/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 **
insert(i,o,o): ([insert(0,tree(s(_0),_1,_2),tree(s(_0),_3,_2)) :- insert(0,_1,_3)], {insert/3->(0->0)})
** END proof argument **

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

** END proof description **

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