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


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


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