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


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


YES
Input TRS:
    1: minus(n__0(),Y) -> 0()
    2: minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y))
    3: geq(X,n__0()) -> true()
    4: geq(n__0(),n__s(Y)) -> false()
    5: geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y))
    6: div(0(),n__s(Y)) -> 0()
    7: div(s(X),n__s(Y)) -> if(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())
    8: if(true(),X,Y) -> activate(X)
    9: if(false(),X,Y) -> activate(Y)
    10: 0() -> n__0()
    11: s(X) -> n__s(X)
    12: activate(n__0()) -> 0()
    13: activate(n__s(X)) -> s(X)
    14: activate(X) -> X
Number of strict rules: 14
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #minus(n__s(X),n__s(Y)) -> #minus(activate(X),activate(Y))
   #2: #minus(n__s(X),n__s(Y)) -> #activate(X)
   #3: #minus(n__s(X),n__s(Y)) -> #activate(Y)
   #4: #activate(n__s(X)) -> #s(X)
   #5: #if(false(),X,Y) -> #activate(Y)
   #6: #activate(n__0()) -> #0()
   #7: #div(s(X),n__s(Y)) -> #if(geq(X,activate(Y)),n__s(div(minus(X,activate(Y)),n__s(activate(Y)))),n__0())
   #8: #div(s(X),n__s(Y)) -> #geq(X,activate(Y))
   #9: #div(s(X),n__s(Y)) -> #activate(Y)
   #10: #div(s(X),n__s(Y)) -> #div(minus(X,activate(Y)),n__s(activate(Y)))
   #11: #div(s(X),n__s(Y)) -> #minus(X,activate(Y))
   #12: #div(s(X),n__s(Y)) -> #activate(Y)
   #13: #div(s(X),n__s(Y)) -> #activate(Y)
   #14: #geq(n__s(X),n__s(Y)) -> #geq(activate(X),activate(Y))
   #15: #geq(n__s(X),n__s(Y)) -> #activate(X)
   #16: #geq(n__s(X),n__s(Y)) -> #activate(Y)
   #17: #minus(n__0(),Y) -> #0()
   #18: #if(true(),X,Y) -> #activate(X)
Number of SCCs: 2, DPs: 2
  SCC { #14 }
POLO(Sum)... succeeded.
      #0 	w: 0
      #div	w: 0
      s 	w: x1 + 2
      minus	w: 0
      activate	w: x1 + 1
      #geq	w: x1 + x2
      #activate	w: 0
      false	w: 0
      div	w: 0
      geq	w: 0
      true	w: 0
      n__s	w: x1 + 2
      0 	w: 1
      if	w: 0
      #s 	w: 0
      n__0	w: 1
      #minus	w: 0
      #if	w: 0
    USABLE RULES: { 10..14 }
    Removed DPs: #14
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... succeeded.
      #0 	w: 0
      #div	w: 0
      s 	w: x1 + 2
      minus	w: 0
      activate	w: x1 + 1
      #geq	w: x1 + x2
      #activate	w: 0
      false	w: 0
      div	w: 0
      geq	w: 0
      true	w: 0
      n__s	w: x1 + 2
      0 	w: 1
      if	w: 0
      #s 	w: 0
      n__0	w: 1
      #minus	w: x1 + x2
      #if	w: 0
    USABLE RULES: { 10..14 }
    Removed DPs: #1
Number of SCCs: 0, DPs: 0