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


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


MAYBE
Input TRS:
    1: minus(x,0()) -> x
    2: minus(s(x),s(y)) -> minus(x,y)
    3: quot(0(),s(y)) -> 0()
    4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
    5: plus(0(),y) -> y
    6: plus(s(x),y) -> s(plus(x,y))
    7: plus(minus(x,s(0())),minus(y,s(s(z)))) -> plus(minus(y,s(s(z))),minus(x,s(0())))
    8: plus(plus(x,s(0())),plus(y,s(s(z)))) -> plus(plus(y,s(s(z))),plus(x,s(0())))
Number of strict rules: 8
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #minus(s(x),s(y)) -> #minus(x,y)
   #2: #plus(s(x),y) -> #plus(x,y)
   #3: #plus(minus(x,s(0())),minus(y,s(s(z)))) -> #plus(minus(y,s(s(z))),minus(x,s(0())))
   #4: #plus(plus(x,s(0())),plus(y,s(s(z)))) -> #plus(plus(y,s(s(z))),plus(x,s(0())))
   #5: #quot(s(x),s(y)) -> #quot(minus(x,y),s(y))
   #6: #quot(s(x),s(y)) -> #minus(x,y)
Number of SCCs: 3, DPs: 5
  SCC { #1 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      minus	w: 0
      #plus	w: 0
      0 	w: 0
      quot	w: 0
      #minus	w: x1 + x2
      plus	w: 0
      #quot	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 2, DPs: 4
  SCC { #5 }
POLO(Sum)... succeeded.
      s 	w: x1 + 2
      minus	w: x1 + 1
      #plus	w: 0
      0 	w: 1
      quot	w: 0
      #minus	w: 0
      plus	w: 0
      #quot	w: x1
    USABLE RULES: { 1 2 }
    Removed DPs: #5
Number of SCCs: 1, DPs: 3
  SCC { #2..4 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      minus	w: x1 + x2 + 1
      #plus	w: x1 + x2
      0 	w: 1
      quot	w: 0
      #minus	w: 0
      plus	w: x1 + x2 + 2
      #quot	w: x1
    USABLE RULES: { 1 2 5..8 }
    Removed DPs: #2
Number of SCCs: 1, DPs: 2
  SCC { #3 #4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      s 	w: x1 + [1;2]
      minus	w: [1,1;1,1] * x1 + [0,0;0,1] * x2 + [1;0]
      #plus	w: [1,0;1,0] * x1 + [0,1;1,0] * x2
      0 	w: [1;1]
      quot	w: [0;0]
      #minus	w: [0;0]
      plus	w: [1,1;1,1] * x1 + [1,1;1,1] * x2 + [1;1]
      #quot	w: [0;0]
    USABLE RULES: { 1 2 5..8 }
    Removed DPs: #3
Number of SCCs: 1, DPs: 1
  SCC { #4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.