/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


NO

Prover = LP(tech=TOPLAS06, unlimited)

** BEGIN proof argument **
sublist(i,o): ([sublist(_0,_1) :- append(_2,_0,_3), append([_0|_1],_2,[_0|_3]) :- append(_1,_2,_3)], {append/3->(1->_0), sublist/2->(0->_1, 1->_2)})
** END proof argument **

** BEGIN proof description **
* Iteration = 0: 0 unfolded rule generated, 0 loop generated
* Iteration = 1: 3 new unfolded rule(s) generated, 1 new loop(s) generated
* Iteration = 2: 6 new unfolded rule(s) generated, 5 new loop(s) generated
The mode sublist(i,o) is non-terminating because of the generated looping pair:
  ([sublist(_0,_1) :- append(_2,_0,_3), append([_0|_1],_2,[_0|_3]) :- append(_1,_2,_3)], {append/3->(1->_0), sublist/2->(0->_1, 1->_2)})
* All specified modes do not terminate: sublist(i,o) 

** END proof description **

Proof stopped at iteration 2
Number of unfolded rules generated by this proof = 9
Number of unfolded rules generated by all the parallel proofs = 9