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


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


YES
Input TRS:
    1: minus(0(),y) -> 0()
    2: minus(s(x),0()) -> s(x)
    3: minus(s(x),s(y)) -> minus(x,y)
    4: le(0(),y) -> true()
    5: le(s(x),0()) -> false()
    6: le(s(x),s(y)) -> le(x,y)
    7: if(true(),x,y) -> x
    8: if(false(),x,y) -> y
    9: perfectp(0()) -> false()
    10: perfectp(s(x)) -> f(x,s(0()),s(x),s(x))
    11: f(0(),y,0(),u) -> true()
    12: f(0(),y,s(z),u) -> false()
    13: f(s(x),0(),z,u) -> f(x,u,minus(z,s(x)),u)
    14: f(s(x),s(y),z,u) -> if(le(x,y),f(s(x),minus(y,x),z,u),f(x,u,z,u))
Number of strict rules: 14
Direct POLO(bPol) ... failed.
Uncurrying f
1: minus(0(),y) -> 0()
2: minus(s(x),0()) -> s(x)
3: minus(s(x),s(y)) -> minus(x,y)
4: le(0(),y) -> true()
5: le(s(x),0()) -> false()
6: le(s(x),s(y)) -> le(x,y)
7: if(true(),x,y) -> x
8: if(false(),x,y) -> y
9: perfectp(0()) -> false()
10: perfectp(s(x)) -> f(x,s(0()),s(x),s(x))
11: f^1_0(y,0(),u) -> true()
12: f^1_0(y,s(z),u) -> false()
13: f^1_s(x,0(),z,u) -> f(x,u,minus(z,s(x)),u)
14: f^1_s(x,s(y),z,u) -> if(le(x,y),f^1_s(x,minus(y,x),z,u),f(x,u,z,u))
15: f(0(),_3,_4,_5) ->= f^1_0(_3,_4,_5)
16: f(s(_1),_4,_5,_6) ->= f^1_s(_1,_4,_5,_6)
Number of strict rules: 14
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #le(s(x),s(y)) -> #le(x,y)
   #2: #f^1_s(x,0(),z,u) -> #f(x,u,minus(z,s(x)),u)
   #3: #f^1_s(x,0(),z,u) -> #minus(z,s(x))
   #4: #f^1_s(x,s(y),z,u) -> #if(le(x,y),f^1_s(x,minus(y,x),z,u),f(x,u,z,u))
   #5: #f^1_s(x,s(y),z,u) -> #le(x,y)
   #6: #f^1_s(x,s(y),z,u) -> #f^1_s(x,minus(y,x),z,u)
   #7: #f^1_s(x,s(y),z,u) -> #minus(y,x)
   #8: #f^1_s(x,s(y),z,u) -> #f(x,u,z,u)
   #9: #perfectp(s(x)) -> #f(x,s(0()),s(x),s(x))
   #10: #f(s(_1),_4,_5,_6) ->? #f^1_s(_1,_4,_5,_6)
   #11: #minus(s(x),s(y)) -> #minus(x,y)
   #12: #f(0(),_3,_4,_5) ->? #f^1_0(_3,_4,_5)
Number of SCCs: 3, DPs: 6
  SCC { #1 }
POLO(Sum)... succeeded.
      le	w: 0
      s 	w: x1 + 1
      #le	w: x2
      minus	w: 0
      #f^1_s	w: 0
      #perfectp	w: 0
      false	w: 0
      true	w: 0
      f 	w: 0
      0 	w: 0
      if	w: 0
      #f 	w: 0
      #minus	w: 0
      #f^1_0	w: 0
      #if	w: 0
      perfectp	w: 0
      f^1_0	w: 0
      f^1_s	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 2, DPs: 5
  SCC { #11 }
POLO(Sum)... succeeded.
      le	w: 0
      s 	w: x1 + 1
      #le	w: 0
      minus	w: 0
      #f^1_s	w: 0
      #perfectp	w: 0
      false	w: 0
      true	w: 0
      f 	w: 0
      0 	w: 0
      if	w: 0
      #f 	w: 0
      #minus	w: x2
      #f^1_0	w: 0
      #if	w: 0
      perfectp	w: 0
      f^1_0	w: 0
      f^1_s	w: 0
    USABLE RULES: { }
    Removed DPs: #11
Number of SCCs: 1, DPs: 4
  SCC { #2 #6 #8 #10 }
POLO(Sum)... succeeded.
      le	w: 0
      s 	w: x1 + 2
      #le	w: 0
      minus	w: 1
      #f^1_s	w: x1 + x4 + 1
      #perfectp	w: 0
      false	w: 0
      true	w: 0
      f 	w: 0
      0 	w: 2
      if	w: 0
      #f 	w: x1 + x4
      #minus	w: 0
      #f^1_0	w: 0
      #if	w: 0
      perfectp	w: 0
      f^1_0	w: 0
      f^1_s	w: 0
    USABLE RULES: { }
    Removed DPs: #2 #8 #10
Number of SCCs: 1, DPs: 1
  SCC { #6 }
POLO(Sum)... succeeded.
      le	w: 0
      s 	w: x1 + 2
      #le	w: 0
      minus	w: x1 + 1
      #f^1_s	w: x2 + 1
      #perfectp	w: 0
      false	w: 0
      true	w: 0
      f 	w: 0
      0 	w: 1
      if	w: 0
      #f 	w: 0
      #minus	w: 0
      #f^1_0	w: 0
      #if	w: 0
      perfectp	w: 0
      f^1_0	w: 0
      f^1_s	w: 0
    USABLE RULES: { 1..3 }
    Removed DPs: #6
Number of SCCs: 0, DPs: 0