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


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


MAYBE
Input TRS:
    1: le(0(),y,z) -> greater(y,z)
    2: le(s(x),0(),z) -> false()
    3: le(s(x),s(y),0()) -> false()
    4: le(s(x),s(y),s(z)) -> le(x,y,z)
    5: greater(x,0()) -> first()
    6: greater(0(),s(y)) -> second()
    7: greater(s(x),s(y)) -> greater(x,y)
    8: double(0()) -> 0()
    9: double(s(x)) -> s(s(double(x)))
    10: triple(x) -> if(le(x,x,double(x)),x,0(),0())
    11: if(false(),x,y,z) -> true()
    12: if(first(),x,y,z) -> if(le(s(x),y,s(z)),s(x),y,s(z))
    13: if(second(),x,y,z) -> if(le(s(x),s(y),z),s(x),s(y),z)
Number of strict rules: 13
Direct POLO(bPol) ... failed.
Uncurrying le
1: le^1_0(y,z) -> greater(y,z)
2: le^1_s(x,0(),z) -> false()
3: le^1_s(x,s(y),0()) -> false()
4: le^1_s(x,s(y),s(z)) -> le(x,y,z)
5: greater(x,0()) -> first()
6: greater(0(),s(y)) -> second()
7: greater(s(x),s(y)) -> greater(x,y)
8: double(0()) -> 0()
9: double(s(x)) -> s(s(double(x)))
10: triple(x) -> if(le(x,x,double(x)),x,0(),0())
11: if(false(),x,y,z) -> true()
12: if(first(),x,y,z) -> if(le^1_s(x,y,s(z)),s(x),y,s(z))
13: if(second(),x,y,z) -> if(le^1_s(x,s(y),z),s(x),s(y),z)
14: le(0(),_2,_3) ->= le^1_0(_2,_3)
15: le(s(_1),_3,_4) ->= le^1_s(_1,_3,_4)
Number of strict rules: 13
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #if(second(),x,y,z) -> #if(le^1_s(x,s(y),z),s(x),s(y),z)
   #2: #if(second(),x,y,z) -> #le^1_s(x,s(y),z)
   #3: #double(s(x)) -> #double(x)
   #4: #if(first(),x,y,z) -> #if(le^1_s(x,y,s(z)),s(x),y,s(z))
   #5: #if(first(),x,y,z) -> #le^1_s(x,y,s(z))
   #6: #le(0(),_2,_3) ->? #le^1_0(_2,_3)
   #7: #greater(s(x),s(y)) -> #greater(x,y)
   #8: #triple(x) -> #if(le(x,x,double(x)),x,0(),0())
   #9: #triple(x) -> #le(x,x,double(x))
   #10: #triple(x) -> #double(x)
   #11: #le^1_0(y,z) -> #greater(y,z)
   #12: #le(s(_1),_3,_4) ->? #le^1_s(_1,_3,_4)
   #13: #le^1_s(x,s(y),s(z)) -> #le(x,y,z)
Number of SCCs: 4, DPs: 6
  SCC { #3 }
POLO(Sum)... succeeded.
      #le^1_s	w: 0
      le	w: 0
      le^1_s	w: 0
      s 	w: x1 + 1
      #le	w: 0
      #le^1_0	w: 0
      #triple	w: 0
      greater	w: 0
      false	w: 0
      triple	w: 0
      second	w: 0
      true	w: 0
      0 	w: 0
      if	w: 0
      #double	w: x1
      double	w: 0
      first	w: 0
      #greater	w: 0
      le^1_0	w: 0
      #if	w: 0
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 3, DPs: 5
  SCC { #7 }
POLO(Sum)... succeeded.
      #le^1_s	w: 0
      le	w: 0
      le^1_s	w: 0
      s 	w: x1 + 1
      #le	w: 0
      #le^1_0	w: 0
      #triple	w: 0
      greater	w: 0
      false	w: 0
      triple	w: 0
      second	w: 0
      true	w: 0
      0 	w: 0
      if	w: 0
      #double	w: 0
      double	w: 0
      first	w: 0
      #greater	w: x2
      le^1_0	w: 0
      #if	w: 0
    USABLE RULES: { }
    Removed DPs: #7
Number of SCCs: 2, DPs: 4
  SCC { #12 #13 }
POLO(Sum)... succeeded.
      #le^1_s	w: x2 + x3
      le	w: 0
      le^1_s	w: 0
      s 	w: x1 + 1
      #le	w: x2 + x3 + 1
      #le^1_0	w: 0
      #triple	w: 0
      greater	w: 0
      false	w: 0
      triple	w: 0
      second	w: 0
      true	w: 0
      0 	w: 0
      if	w: 0
      #double	w: 0
      double	w: 0
      first	w: 0
      #greater	w: 0
      le^1_0	w: 0
      #if	w: 0
    USABLE RULES: { }
    Removed DPs: #12 #13
Number of SCCs: 1, DPs: 2
  SCC { #1 #4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.