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


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


NO

Prover = LP(tech=TOPLAS06, unlimited)

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

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

** END proof description **

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