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


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


MAYBE
Input TRS:
    1: min(x,0()) -> 0()
    2: min(0(),y) -> 0()
    3: min(s(x),s(y)) -> s(min(x,y))
    4: max(x,0()) -> x
    5: max(0(),y) -> y
    6: max(s(x),s(y)) -> s(max(x,y))
    7: -(x,0()) -> x
    8: -(s(x),s(y)) -> -(x,y)
    9: gcd(s(x),s(y)) -> gcd(-(max(x,y),min(x,y)),s(min(x,y)))
    10: gcd(s(x),0()) -> s(x)
    11: gcd(0(),s(y)) -> s(y)
    12: min(x,y) ->= min(y,x)
    13: max(x,y) ->= max(y,x)
Number of strict rules: 11
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #max(s(x),s(y)) -> #max(x,y)
   #2: #max(x,y) ->? #max(y,x)
   #3: #gcd(s(x),s(y)) -> #gcd(-(max(x,y),min(x,y)),s(min(x,y)))
   #4: #gcd(s(x),s(y)) -> #-(max(x,y),min(x,y))
   #5: #gcd(s(x),s(y)) -> #max(x,y)
   #6: #gcd(s(x),s(y)) -> #min(x,y)
   #7: #gcd(s(x),s(y)) -> #min(x,y)
   #8: #min(x,y) ->? #min(y,x)
   #9: #min(s(x),s(y)) -> #min(x,y)
   #10: #-(s(x),s(y)) -> #-(x,y)
Number of SCCs: 4, DPs: 6
  SCC { #10 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      gcd	w: 0
      #min	w: 0
      0 	w: 0
      max	w: 0
      #max	w: 0
      - 	w: 0
      min	w: 0
      #- 	w: x1 + x2
      #gcd	w: 0
    USABLE RULES: { }
    Removed DPs: #10
Number of SCCs: 3, DPs: 5
  SCC { #8 #9 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      gcd	w: 0
      #min	w: x1 + x2
      0 	w: 0
      max	w: 0
      #max	w: 0
      - 	w: 0
      min	w: 0
      #- 	w: 0
      #gcd	w: 0
    USABLE RULES: { }
    Removed DPs: #9
Number of SCCs: 3, DPs: 4
  SCC { #8 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.