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


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


MAYBE
Input TRS:
    1: f(0(),1(),x) -> f(g(x),g(x),x)
    2: f(g(x),y,z) -> g(f(x,y,z))
    3: f(x,g(y),z) -> g(f(x,y,z))
    4: f(x,y,g(z)) -> g(f(x,y,z))
Number of strict rules: 4
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #f(g(x),y,z) -> #f(x,y,z)
   #2: #f(x,g(y),z) -> #f(x,y,z)
   #3: #f(0(),1(),x) -> #f(g(x),g(x),x)
   #4: #f(x,y,g(z)) -> #f(x,y,z)
Number of SCCs: 1, DPs: 4
  SCC { #1..4 }
POLO(Sum)... succeeded.
      1 	w: 3
      f 	w: 0
      0 	w: 0
      #f 	w: x3
      g 	w: x1 + 1
    USABLE RULES: { }
    Removed DPs: #4
Number of SCCs: 1, DPs: 3
  SCC { #1..3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.