/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(x,0()) -> x
    2: minus(s(x),s(y)) -> minus(x,y)
    3: double(0()) -> 0()
    4: double(s(x)) -> s(s(double(x)))
    5: plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
    6: plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
    7: plus(zero(),y) -> y
    8: plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y))))
    9: id(x) -> x
    10: if(true(),x,y) -> x
    11: if(false(),x,y) -> y
    12: not(x) -> if(x,false(),true())
    13: gt(s(x),zero()) -> true()
    14: gt(zero(),y) -> false()
    15: gt(s(x),s(y)) -> gt(x,y)
Number of strict rules: 15
Direct POLO(bPol) ... failed.
Uncurrying gt
1: minus(x,0()) -> x
2: minus(s(x),s(y)) -> minus(x,y)
3: double(0()) -> 0()
4: double(s(x)) -> s(s(double(x)))
5: plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))))
6: plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x))
7: plus(zero(),y) -> y
8: plus(id(x),s(y)) -> s(plus(x,if(gt^1_s(y,y),y,s(y))))
9: id(x) -> x
10: if(true(),x,y) -> x
11: if(false(),x,y) -> y
12: not(x) -> if(x,false(),true())
13: gt^1_s(x,zero()) -> true()
14: gt^1_zero(y) -> false()
15: gt^1_s(x,s(y)) -> gt(x,y)
16: gt(zero(),_1) ->= gt^1_zero(_1)
17: gt(s(_1),_2) ->= gt^1_s(_1,_2)
Number of strict rules: 15
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #minus(s(x),s(y)) -> #minus(x,y)
   #2: #plus(s(x),x) -> #plus(if(gt(x,x),id(x),id(x)),s(x))
   #3: #plus(s(x),x) -> #if(gt(x,x),id(x),id(x))
   #4: #plus(s(x),x) -> #gt(x,x)
   #5: #plus(s(x),x) -> #id(x)
   #6: #plus(s(x),x) -> #id(x)
   #7: #not(x) -> #if(x,false(),true())
   #8: #plus(s(x),s(y)) -> #plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y)))
   #9: #plus(s(x),s(y)) -> #if(gt(x,y),x,y)
   #10: #plus(s(x),s(y)) -> #gt(x,y)
   #11: #plus(s(x),s(y)) -> #if(not(gt(x,y)),id(x),id(y))
   #12: #plus(s(x),s(y)) -> #not(gt(x,y))
   #13: #plus(s(x),s(y)) -> #gt(x,y)
   #14: #plus(s(x),s(y)) -> #id(x)
   #15: #plus(s(x),s(y)) -> #id(y)
   #16: #gt(s(_1),_2) ->? #gt^1_s(_1,_2)
   #17: #gt(zero(),_1) ->? #gt^1_zero(_1)
   #18: #plus(id(x),s(y)) -> #plus(x,if(gt^1_s(y,y),y,s(y)))
   #19: #plus(id(x),s(y)) -> #if(gt^1_s(y,y),y,s(y))
   #20: #plus(id(x),s(y)) -> #gt^1_s(y,y)
   #21: #gt^1_s(x,s(y)) -> #gt(x,y)
   #22: #double(s(x)) -> #double(x)
Number of SCCs: 4, DPs: 7
  SCC { #22 }
POLO(Sum)... succeeded.
      zero	w: 0
      s 	w: x1 + 1
      gt	w: 0
      minus	w: 0
      #gt^1_zero	w: 0
      #plus	w: 0
      false	w: 0
      #id	w: 0
      gt^1_zero	w: 0
      true	w: 0
      #not	w: 0
      0 	w: 0
      if	w: 0
      #double	w: x1
      double	w: 0
      #gt	w: 0
      #minus	w: 0
      plus	w: 0
      gt^1_s	w: 0
      #if	w: 0
      id	w: 0
      #gt^1_s	w: 0
      not	w: 0
    USABLE RULES: { }
    Removed DPs: #22
Number of SCCs: 3, DPs: 6
  SCC { #1 }
POLO(Sum)... succeeded.
      zero	w: 0
      s 	w: x1 + 1
      gt	w: 0
      minus	w: 0
      #gt^1_zero	w: 0
      #plus	w: 0
      false	w: 0
      #id	w: 0
      gt^1_zero	w: 0
      true	w: 0
      #not	w: 0
      0 	w: 0
      if	w: 0
      #double	w: 0
      double	w: 0
      #gt	w: 0
      #minus	w: x2
      plus	w: 0
      gt^1_s	w: 0
      #if	w: 0
      id	w: 0
      #gt^1_s	w: 0
      not	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 2, DPs: 5
  SCC { #16 #21 }
POLO(Sum)... succeeded.
      zero	w: 0
      s 	w: x1 + 2
      gt	w: 0
      minus	w: 0
      #gt^1_zero	w: 0
      #plus	w: 0
      false	w: 0
      #id	w: 0
      gt^1_zero	w: 0
      true	w: 0
      #not	w: 0
      0 	w: 0
      if	w: 0
      #double	w: 0
      double	w: 0
      #gt	w: x2 + 1
      #minus	w: 0
      plus	w: 0
      gt^1_s	w: 0
      #if	w: 0
      id	w: 0
      #gt^1_s	w: x2
      not	w: 0
    USABLE RULES: { }
    Removed DPs: #16 #21
Number of SCCs: 1, DPs: 3
  SCC { #2 #8 #18 }
POLO(Sum)... POLO(max)... succeeded.
      zero	w: 0
      s 	w: x1 + 6
      gt	w: max(x2 + 1)
      minus	w: 0
      #gt^1_zero	w: 0
      #plus	w: max(x1 + 4, x2 + 1)
      false	w: 0
      #id	w: 0
      gt^1_zero	w: 0
      true	w: 1
      #not	w: 0
      0 	w: 0
      if	w: max(x1 + 1, x2 + 1, x3)
      #double	w: 0
      double	w: 0
      #gt	w: 0
      #minus	w: 0
      plus	w: 0
      gt^1_s	w: max(x2 + 1)
      #if	w: 0
      id	w: x1
      #gt^1_s	w: 0
      not	w: x1 + 4
    USABLE RULES: { 9..17 }
    Removed DPs: #2
Number of SCCs: 1, DPs: 2
  SCC { #8 #18 }
POLO(Sum)... POLO(max)... succeeded.
      zero	w: 5
      s 	w: x1 + 3
      gt	w: max(x2 + 1)
      minus	w: 0
      #gt^1_zero	w: 0
      #plus	w: max(x1 + 4, x2 + 5)
      false	w: 5
      #id	w: 0
      gt^1_zero	w: 0
      true	w: 6
      #not	w: 0
      0 	w: 0
      if	w: max(x2 + 1, x3)
      #double	w: 0
      double	w: 0
      #gt	w: 0
      #minus	w: 0
      plus	w: 0
      gt^1_s	w: max(x2 + 1)
      #if	w: 0
      id	w: x1
      #gt^1_s	w: 0
      not	w: x1 + 5
    USABLE RULES: { 9..11 }
    Removed DPs: #8
Number of SCCs: 1, DPs: 1
  SCC { #18 }
POLO(Sum)... succeeded.
      zero	w: 1
      s 	w: 1
      gt	w: 1
      minus	w: 0
      #gt^1_zero	w: 0
      #plus	w: x1
      false	w: 1
      #id	w: 0
      gt^1_zero	w: 1
      true	w: 1
      #not	w: 0
      0 	w: 0
      if	w: x2 + x3
      #double	w: 0
      double	w: 0
      #gt	w: 1
      #minus	w: 0
      plus	w: 0
      gt^1_s	w: 1
      #if	w: 0
      id	w: x1 + 1
      #gt^1_s	w: 0
      not	w: 2
    USABLE RULES: { 9..11 13..17 }
    Removed DPs: #18
Number of SCCs: 0, DPs: 0