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

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

** END proof description **

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