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

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

** END proof description **

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