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


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


NO
Input TRS:
    1: f(tt(),x) -> f(isList(x),x)
    2: isList(Cons(x,xs())) -> isList(xs())
    3: isList(nil()) -> tt()
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying isList
1: f(tt(),x) -> f(isList(x),x)
2: isList^1_Cons(x,xs()) -> isList^1_xs()
3: isList^1_nil() -> tt()
4: isList(nil()) ->= isList^1_nil()
5: isList(xs()) ->= isList^1_xs()
6: isList(Cons(_1,_2)) ->= isList^1_Cons(_1,_2)
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #isList(Cons(_1,_2)) ->? #isList^1_Cons(_1,_2)
   #2: #f(tt(),x) -> #f(isList(x),x)
   #3: #f(tt(),x) -> #isList(x)
   #4: #isList(nil()) ->? #isList^1_nil()
Number of SCCs: 1, DPs: 1
  SCC { #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #f(tt(),nil())	-#2->
  #f(isList(nil()),nil())	--->*
  #f(tt(),nil())
  Looping with: [ ]