/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


NO

Problem:
 from(X) -> cons(X,n__from(s(X)))
 length(n__nil()) -> 0()
 length(n__cons(X,Y)) -> s(length1(activate(Y)))
 length1(X) -> length(activate(X))
 from(X) -> n__from(X)
 nil() -> n__nil()
 cons(X1,X2) -> n__cons(X1,X2)
 activate(n__from(X)) -> from(X)
 activate(n__nil()) -> nil()
 activate(n__cons(X1,X2)) -> cons(X1,X2)
 activate(X) -> X

Proof:
 Unfolding Processor:
  loop length: 6
  terms:
   length(n__cons(X,n__from(x42749)))
   s(length1(activate(n__from(x42749))))
   s(length(activate(activate(n__from(x42749)))))
   s(length(activate(n__from(x42749))))
   s(length(from(x42749)))
   s(length(cons(x42749,n__from(s(x42749)))))
  context: s([])
  substitution:
   X -> x42749
   x42749 -> s(x42749)
  Qed