/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


NO

Prover = LP(tech=TOPLAS06, unlimited)

** BEGIN proof argument **
div(i,i,o): ([div(s(_0),s(0),s(_1)) :- div(s(_0),s(0),_1)], {div/3->(0->s(_0), 1->s(0))})
** END proof argument **

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

** END proof description **

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