fix examples

quentin · quentin · commit 10a860164f6b · 2022-03-21T07:10:06.000+01:00
diff --git a/tests/example/CMakeLists.txt b/tests/example/CMakeLists.txt
@@ -131,5 +131,3 @@ positive_test(tree)
 positive_test(triangle)
 positive_test(turing1)
 positive_test(weighted_distances)
-positive_test(lucas)
-positive_test(nfsa2fsa)
diff --git a/tests/example/lucas/lucas.err b/tests/example/lucas/lucas.err
diff --git a/tests/example/lucas/lucas.out b/tests/example/lucas/lucas.out
diff --git a/tests/example/minimum_spanning_tree/minimum_spanning_tree.dl b/tests/example/minimum_spanning_tree/minimum_spanning_tree.dl
@@ -14,7 +14,7 @@
 node(x) :- graph(x,_,_) ; graph(_,x,_).
 
 .decl edge(id:number, x:symbol, y:symbol, w:number)
-edge($,x,y,w) :- graph(x,y,w).
+edge(autoinc(),x,y,w) :- graph(x,y,w).
 
 .decl edgePosition(id:number, pos:number)
 edgePosition(id,0) :- edgeFirst(id).
diff --git a/tests/example/peano_arithmetic/peano_arithmetic.dl b/tests/example/peano_arithmetic/peano_arithmetic.dl
@@ -16,7 +16,7 @@
 .decl A(x:SExpr)
 
 // this represents the expression 2 * (1 + 1)
-A($Mul($Succ($Succ($Zero)), $Add($Succ($Zero()),$Succ($Zero())))).
+A($Mul($Succ($Succ($Zero())), $Add($Succ($Zero()),$Succ($Zero())))).
 
 // Represents the symmetric reflexive transitive closure of the
 // reduction relation usign an equivalence relation in Souffle.
diff --git a/tests/example/sort/sort.dl b/tests/example/sort/sort.dl
@@ -63,7 +63,7 @@ ToCat(s_b,[h,s_a]) :-
 
 // Assign each value a unique index; 0,1,2,...
 .decl Indexed(x : value, i : index)
-Indexed(x, $) :- InputVals(x).
+Indexed(x, autoinc()) :- InputVals(x).
 
 // Build the list
 .decl InList(l : list, i : index)
