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


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


MAYBE
Input TRS:
    1: a__f(b(),X,c()) -> a__f(X,a__c(),X)
    2: a__c() -> b()
    3: mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3)
    4: mark(c()) -> a__c()
    5: mark(b()) -> b()
    6: a__f(X1,X2,X3) -> f(X1,X2,X3)
    7: a__c() -> c()
Number of strict rules: 7
Direct POLO(bPol) ... removes: 4 3 5 6
      b 	w: 2
      a__f	w: x1 + 2 * x2 + x3 + 4
      c 	w: 2
      f 	w: x1 + 2 * x2 + x3 + 3
      mark	w: 2 * x1 + 1
      a__c	w: 2
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #a__f(b(),X,c()) -> #a__f(X,a__c(),X)
   #2: #a__f(b(),X,c()) -> #a__c()
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.