/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(f(f(f(j(),a),b),c),d) -> f(f(a,b),f(f(a,d),c))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #f(f(f(f(j(),a),b),c),d) -> #f(f(a,b),f(f(a,d),c))
   #2: #f(f(f(f(j(),a),b),c),d) -> #f(a,b)
   #3: #f(f(f(f(j(),a),b),c),d) -> #f(f(a,d),c)
   #4: #f(f(f(f(j(),a),b),c),d) -> #f(a,d)
Number of SCCs: 1, DPs: 4
  SCC { #1..4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      f 	w: max(x1 + 1, x2 - 1, 0)
      #f 	w: max(x1 + 3, x2 + 2, 0)
      j 	w: 0
    USABLE RULES: { 1 }
    Removed DPs: #2
Number of SCCs: 1, DPs: 3
  SCC { #1 #3 #4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.