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


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


MAYBE
Input TRS:
    1: add(true(),x,xs) -> add(and(isNat(x),isList(xs)),x,Cons(tt(),xs))
    2: isList(Cons(x,xs)) -> isList(xs)
    3: isList(nil()) -> true()
    4: isNat(s(x)) -> isNat(x)
    5: isNat(0()) -> true()
    6: and(true(),true()) -> true()
    7: and(false(),x) -> false()
    8: and(x,false()) -> false()
Number of strict rules: 8
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #isList(Cons(x,xs)) -> #isList(xs)
   #2: #add(true(),x,xs) -> #add(and(isNat(x),isList(xs)),x,Cons(tt(),xs))
   #3: #add(true(),x,xs) -> #and(isNat(x),isList(xs))
   #4: #add(true(),x,xs) -> #isNat(x)
   #5: #add(true(),x,xs) -> #isList(xs)
   #6: #isNat(s(x)) -> #isNat(x)
Number of SCCs: 3, DPs: 3
  SCC { #6 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      #isNat	w: x1
      and	w: 0
      false	w: 0
      true	w: 0
      isList	w: 0
      0 	w: 0
      nil	w: 0
      #isList	w: 0
      isNat	w: 0
      tt	w: 0
      #add	w: 0
      add	w: 0
      #and	w: 0
      Cons	w: 0
    USABLE RULES: { }
    Removed DPs: #6
Number of SCCs: 2, DPs: 2
  SCC { #1 }
POLO(Sum)... succeeded.
      s 	w: 1
      #isNat	w: 0
      and	w: 0
      false	w: 0
      true	w: 0
      isList	w: 0
      0 	w: 0
      nil	w: 0
      #isList	w: x1
      isNat	w: 0
      tt	w: 0
      #add	w: 0
      add	w: 0
      #and	w: 0
      Cons	w: x2 + 1
    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.