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


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


MAYBE
Input TRS:
    1: fact(X) -> if(zero(X),n__s(n__0()),n__prod(X,n__fact(n__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: 0() -> n__0()
    13: prod(X1,X2) -> n__prod(X1,X2)
    14: fact(X) -> n__fact(X)
    15: p(X) -> n__p(X)
    16: activate(n__s(X)) -> s(activate(X))
    17: activate(n__0()) -> 0()
    18: activate(n__prod(X1,X2)) -> prod(activate(X1),activate(X2))
    19: activate(n__fact(X)) -> fact(activate(X))
    20: activate(n__p(X)) -> p(activate(X))
    21: activate(X) -> X
Number of strict rules: 21
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #if(true(),X,Y) -> #activate(X)
   #2: #activate(n__p(X)) -> #p(activate(X))
   #3: #activate(n__p(X)) -> #activate(X)
   #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: #activate(n__0()) -> #0()
   #8: #activate(n__fact(X)) -> #fact(activate(X))
   #9: #activate(n__fact(X)) -> #activate(X)
   #10: #activate(n__s(X)) -> #s(activate(X))
   #11: #activate(n__s(X)) -> #activate(X)
   #12: #add(s(X),Y) -> #s(add(X,Y))
   #13: #add(s(X),Y) -> #add(X,Y)
   #14: #fact(X) -> #if(zero(X),n__s(n__0()),n__prod(X,n__fact(n__p(X))))
   #15: #fact(X) -> #zero(X)
   #16: #activate(n__prod(X1,X2)) -> #prod(activate(X1),activate(X2))
   #17: #activate(n__prod(X1,X2)) -> #activate(X1)
   #18: #activate(n__prod(X1,X2)) -> #activate(X2)
Number of SCCs: 3, DPs: 11
  SCC { #6 }
POLO(Sum)... succeeded.
      zero	w: 0
      #0 	w: 0
      prod	w: 0
      n__prod	w: 0
      s 	w: x1 + 1
      #prod	w: x1
      activate	w: 0
      n__fact	w: 0
      #activate	w: 0
      false	w: 0
      #fact	w: 0
      #p 	w: 0
      true	w: 0
      n__s	w: 0
      p 	w: 0
      if	w: 0
      0 	w: 0
      #s 	w: 0
      fact	w: 0
      n__0	w: 0
      n__p	w: 0
      #if	w: 0
      #add	w: 0
      add	w: 0
      #zero	w: 0
    USABLE RULES: { }
    Removed DPs: #6
Number of SCCs: 2, DPs: 10
  SCC { #13 }
POLO(Sum)... succeeded.
      zero	w: 0
      #0 	w: 0
      prod	w: 0
      n__prod	w: 0
      s 	w: x1 + 1
      #prod	w: 0
      activate	w: 0
      n__fact	w: 0
      #activate	w: 0
      false	w: 0
      #fact	w: 0
      #p 	w: 0
      true	w: 0
      n__s	w: 0
      p 	w: 0
      if	w: 0
      0 	w: 0
      #s 	w: 0
      fact	w: 0
      n__0	w: 0
      n__p	w: 0
      #if	w: 0
      #add	w: x1
      add	w: 0
      #zero	w: 0
    USABLE RULES: { }
    Removed DPs: #13
Number of SCCs: 1, DPs: 9
  SCC { #1 #3 #4 #8 #9 #11 #14 #17 #18 }
POLO(Sum)... POLO(max)... succeeded.
      zero	w: x1
      #0 	w: 0
      prod	w: max(x1 + 1, x2)
      n__prod	w: max(x1 + 1, x2)
      s 	w: x1
      #prod	w: 0
      activate	w: x1
      n__fact	w: x1 + 3
      #activate	w: x1 + 1
      false	w: 1
      #fact	w: x1 + 4
      #p 	w: 0
      true	w: 2
      n__s	w: x1
      p 	w: x1
      if	w: max(x2, x3)
      0 	w: 1
      #s 	w: 0
      fact	w: x1 + 3
      n__0	w: 1
      n__p	w: x1
      #if	w: max(x2 + 2, x3 + 1)
      #add	w: 0
      add	w: max(x2)
      #zero	w: 0
    USABLE RULES: { 1..7 10..21 }
    Removed DPs: #1 #9 #17
Number of SCCs: 1, DPs: 6
  SCC { #3 #4 #8 #11 #14 #18 }
POLO(Sum)... succeeded.
      zero	w: x1 + 1
      #0 	w: 0
      prod	w: x2 + 1
      n__prod	w: x2
      s 	w: x1 + 1
      #prod	w: 0
      activate	w: 5
      n__fact	w: 7
      #activate	w: x1
      false	w: 5
      #fact	w: 7
      #p 	w: 0
      true	w: 4
      n__s	w: x1 + 1
      p 	w: x1 + 1
      if	w: x1
      0 	w: 2
      #s 	w: 0
      fact	w: 6
      n__0	w: 3
      n__p	w: x1 + 2
      #if	w: x3
      #add	w: 0
      add	w: 2
      #zero	w: 0
    USABLE RULES: { }
    Removed DPs: #3 #11
Number of SCCs: 1, DPs: 4
  SCC { #4 #8 #14 #18 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.