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

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

** END proof description **

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