/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(a(),b(),X) -> a__f(X,X,mark(X))
    2: a__c() -> a()
    3: a__c() -> b()
    4: mark(f(X1,X2,X3)) -> a__f(X1,X2,mark(X3))
    5: mark(c()) -> a__c()
    6: mark(a()) -> a()
    7: mark(b()) -> b()
    8: a__f(X1,X2,X3) -> f(X1,X2,X3)
    9: a__c() -> c()
Number of strict rules: 9
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #mark(c()) -> #a__c()
   #2: #a__f(a(),b(),X) -> #a__f(X,X,mark(X))
   #3: #a__f(a(),b(),X) -> #mark(X)
   #4: #mark(f(X1,X2,X3)) -> #a__f(X1,X2,mark(X3))
   #5: #mark(f(X1,X2,X3)) -> #mark(X3)
Number of SCCs: 1, DPs: 4
  SCC { #2..5 }
POLO(Sum)... succeeded.
      a 	w: 1
      #a__c	w: 0
      b 	w: 1
      a__f	w: x3 + 2
      c 	w: 1
      f 	w: x3 + 2
      #mark	w: x1
      mark	w: x1
      #a__f	w: x3 + 1
      a__c	w: 1
    USABLE RULES: { 1..9 }
    Removed DPs: #3..5
Number of SCCs: 1, DPs: 1
  SCC { #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.