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


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


NO
Input TRS:
    1: fact(X) -> if(zero(X),n__s(0()),n__prod(X,fact(p(X))))
    2: add(0(),X) -> X
    3: add(s(X),Y) -> s(add(X,Y))
    4: prod(0(),X) -> 0()
    5: prod(s(X),Y) -> add(Y,prod(X,Y))
    6: if(true(),X,Y) -> activate(X)
    7: if(false(),X,Y) -> activate(Y)
    8: zero(0()) -> true()
    9: zero(s(X)) -> false()
    10: p(s(X)) -> X
    11: s(X) -> n__s(X)
    12: prod(X1,X2) -> n__prod(X1,X2)
    13: activate(n__s(X)) -> s(X)
    14: activate(n__prod(X1,X2)) -> prod(X1,X2)
    15: activate(X) -> X
Number of strict rules: 15
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #if(true(),X,Y) -> #activate(X)
   #2: #activate(n__s(X)) -> #s(X)
   #3: #activate(n__prod(X1,X2)) -> #prod(X1,X2)
   #4: #if(false(),X,Y) -> #activate(Y)
   #5: #prod(s(X),Y) -> #add(Y,prod(X,Y))
   #6: #prod(s(X),Y) -> #prod(X,Y)
   #7: #add(s(X),Y) -> #s(add(X,Y))
   #8: #add(s(X),Y) -> #add(X,Y)
   #9: #fact(X) -> #if(zero(X),n__s(0()),n__prod(X,fact(p(X))))
   #10: #fact(X) -> #zero(X)
   #11: #fact(X) -> #fact(p(X))
   #12: #fact(X) -> #p(X)
Number of SCCs: 3, DPs: 3
  SCC { #11 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #fact(X)	-#11->
  #fact(p(X))	--->*
  #fact(p(X))
  Looping with: [ X := p(X); ]