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


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


YES
Input TRS:
    1: cond1(true(),x) -> cond2(even(x),x)
    2: cond2(true(),x) -> cond1(neq(x,0()),div2(x))
    3: cond2(false(),x) -> cond1(neq(x,0()),p(x))
    4: neq(0(),0()) -> false()
    5: neq(0(),s(x)) -> true()
    6: neq(s(x),0()) -> true()
    7: neq(s(x),s(y())) -> neq(x,y())
    8: even(0()) -> true()
    9: even(s(0())) -> false()
    10: even(s(s(x))) -> even(x)
    11: div2(0()) -> 0()
    12: div2(s(0())) -> 0()
    13: div2(s(s(x))) -> s(div2(x))
    14: p(0()) -> 0()
    15: p(s(x)) -> x
Number of strict rules: 15
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #cond2(true(),x) -> #cond1(neq(x,0()),div2(x))
   #2: #cond2(true(),x) -> #neq(x,0())
   #3: #cond2(true(),x) -> #div2(x)
   #4: #div2(s(s(x))) -> #div2(x)
   #5: #neq(s(x),s(y())) -> #neq(x,y())
   #6: #even(s(s(x))) -> #even(x)
   #7: #cond2(false(),x) -> #cond1(neq(x,0()),p(x))
   #8: #cond2(false(),x) -> #neq(x,0())
   #9: #cond2(false(),x) -> #p(x)
   #10: #cond1(true(),x) -> #cond2(even(x),x)
   #11: #cond1(true(),x) -> #even(x)
Number of SCCs: 3, DPs: 5
  SCC { #4 }
POLO(Sum)... succeeded.
      neq	w: 0
      cond2	w: 0
      s 	w: x1 + 1
      #cond1	w: 0
      y 	w: 0
      even	w: 0
      false	w: 0
      #p 	w: 0
      true	w: 0
      cond1	w: 0
      #even	w: 0
      p 	w: 0
      0 	w: 0
      #neq	w: 0
      div2	w: 0
      #div2	w: x1
      #cond2	w: 0
    USABLE RULES: { }
    Removed DPs: #4
Number of SCCs: 2, DPs: 4
  SCC { #6 }
POLO(Sum)... succeeded.
      neq	w: 0
      cond2	w: 0
      s 	w: x1 + 1
      #cond1	w: 0
      y 	w: 0
      even	w: 0
      false	w: 0
      #p 	w: 0
      true	w: 0
      cond1	w: 0
      #even	w: x1
      p 	w: 0
      0 	w: 0
      #neq	w: 0
      div2	w: 0
      #div2	w: 0
      #cond2	w: 0
    USABLE RULES: { }
    Removed DPs: #6
Number of SCCs: 1, DPs: 3
  SCC { #1 #7 #10 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      neq	w: max(x1 + 10, 0)
      cond2	w: 0
      s 	w: max(x1 + 2, 0)
      #cond1	w: max(x1 - 14, x2 - 1, 0)
      y 	w: 0
      even	w: max(x1 + 8, 0)
      false	w: 10
      #p 	w: max(x1 - 1, 0)
      true	w: 6
      cond1	w: 0
      #even	w: max(x1 - 1, 0)
      p 	w: max(x1 - 1, 0)
      0 	w: 0
      #neq	w: max(x1 - 1, 0)
      div2	w: max(x1 - 1, 0)
      #div2	w: max(x1 - 1, 0)
      #cond2	w: max(x1 - 9, x2 - 1, 0)
    USABLE RULES: { 4 6 8..15 }
    Removed DPs: #7
Number of SCCs: 1, DPs: 2
  SCC { #1 #10 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      neq	w: max(x1 + 1, 0)
      cond2	w: 0
      s 	w: max(x1 + 6, 0)
      #cond1	w: max(x1 + 1, x2 + 4, 0)
      y 	w: 0
      even	w: 6
      false	w: 1
      #p 	w: max(x1 - 1, 0)
      true	w: 6
      cond1	w: 0
      #even	w: max(x1 - 1, 0)
      p 	w: max(x1 - 1, 0)
      0 	w: 0
      #neq	w: max(x1 - 1, 0)
      div2	w: max(x1 - 5, 0)
      #div2	w: max(x1 - 1, 0)
      #cond2	w: max(x1 - 1, x2 + 3, 0)
    USABLE RULES: { 4 6 8..15 }
    Removed DPs: #1 #10
Number of SCCs: 0, DPs: 0