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