/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 **
qs(o,i): ([qs([_0|[_1|_2]],_3) :- less(_0,_1), less(s(_0),s(_1)) :- less(_0,_1)], {less/2->(), qs/2->(1->_0)})
** END proof argument **

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

** END proof description **

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