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


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


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