/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


NO
Input TRS:
    1: incr(nil()) -> nil()
    2: incr(cons(X,L)) -> cons(s(X),incr(L))
    3: adx(nil()) -> nil()
    4: adx(cons(X,L)) -> incr(cons(X,adx(L)))
    5: nats() -> adx(zeros())
    6: zeros() -> cons(0(),zeros())
    7: head(cons(X,L)) -> X
    8: tail(cons(X,L)) -> L
Number of strict rules: 8
Direct POLO(bPol) ... removes: 8 3 5 7
      incr	w: x1
      s 	w: x1
      adx	w: x1 + 1
      zeros	w: 1
      tail	w: x1 + 1
      0 	w: 0
      nil	w: 1
      nats	w: 3
      head	w: x1 + 1
      cons	w: x1 + x2
Number of strict rules: 4
Direct POLO(bPol) ... failed.
Uncurrying incr
1: incr^1_nil() -> nil()
2: incr^1_cons(X,L) -> cons(s(X),incr(L))
4: adx(cons(X,L)) -> incr^1_cons(X,adx(L))
6: zeros() -> cons(0(),zeros())
9: incr(cons(_1,_2)) ->= incr^1_cons(_1,_2)
10: incr(nil()) ->= incr^1_nil()
Number of strict rules: 4
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #incr^1_cons(X,L) -> #incr(L)
   #2: #zeros() -> #zeros()
   #3: #incr(cons(_1,_2)) ->? #incr^1_cons(_1,_2)
   #4: #incr(nil()) ->? #incr^1_nil()
   #5: #adx(cons(X,L)) -> #incr^1_cons(X,adx(L))
   #6: #adx(cons(X,L)) -> #adx(L)
Number of SCCs: 3, DPs: 4
  SCC { #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #zeros()	-#2->
  #zeros()	--->*
  #zeros()
  Looping with: [ ]