/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES

Problem:
 a__fst(0(),Z) -> nil()
 a__fst(s(X),cons(Y,Z)) -> cons(mark(Y),fst(X,Z))
 a__from(X) -> cons(mark(X),from(s(X)))
 a__add(0(),X) -> mark(X)
 a__add(s(X),Y) -> s(add(X,Y))
 a__len(nil()) -> 0()
 a__len(cons(X,Z)) -> s(len(Z))
 mark(fst(X1,X2)) -> a__fst(mark(X1),mark(X2))
 mark(from(X)) -> a__from(mark(X))
 mark(add(X1,X2)) -> a__add(mark(X1),mark(X2))
 mark(len(X)) -> a__len(mark(X))
 mark(0()) -> 0()
 mark(s(X)) -> s(X)
 mark(nil()) -> nil()
 mark(cons(X1,X2)) -> cons(mark(X1),X2)
 a__fst(X1,X2) -> fst(X1,X2)
 a__from(X) -> from(X)
 a__add(X1,X2) -> add(X1,X2)
 a__len(X) -> len(X)

Proof:
 WPO Processor:
  algebra: Max
  weight function:
   w0 = 0
   w(from) = w(a__from) = 7
   w(cons) = 4
   w(fst) = w(a__fst) = 2
   w(add) = w(a__add) = w(s) = w(nil) = w(0) = 1
   w(len) = w(a__len) = w(mark) = 0
  status function:
   st(len) = st(a__len) = [0]
   st(add) = st(a__add) = [0, 1]
   st(from) = st(a__from) = [0]
   st(fst) = [0, 1]
   st(mark) = [0]
   st(cons) = [0, 1]
   st(s) = [0]
   st(nil) = []
   st(a__fst) = [0, 1]
   st(0) = []
  subterm penalty function:
   sp(from, 0) = sp(a__from, 0) = 6
   sp(add, 1) = sp(a__add, 1) = 4
   sp(cons, 0) = 1
   sp(len, 0) = sp(a__len, 0) = sp(add, 0) = sp(a__add, 0) = sp(fst, 1) = sp(
   fst, 0) = sp(mark, 0) = sp(cons, 1) = sp(s, 0) = sp(a__fst, 1) = sp(
   a__fst, 0) = 0
  precedence:
   mark > a__add ~ nil > a__len ~ a__from ~ a__fst > len ~ add ~ from ~ fst ~ cons ~ s ~ 0
  problem:
   
  Qed