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


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


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