/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 **
slowsort(o,i): ([slowsort([_0|[_1]],[_2|[_3]]) :- delete(_2,[_0|_1],_4), delete(_0,[_1|_2],_3) :- delete(_0,_2,_3)], {delete/3->(0->_0, 2->_1), slowsort/2->(1->[_2|[_3]])})
** END proof argument **

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

** END proof description **

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