/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(true(),xs) -> f(eq(s(length(xs)),length(cons(a(),xs))),cons(a(),xs))
    2: length(nil()) -> 0()
    3: length(cons(x,xs)) -> s(length(xs))
    4: eq(0(),0()) -> true()
    5: eq(s(x),0()) -> false()
    6: eq(0(),s(y)) -> false()
    7: eq(s(x),s(y)) -> eq(x,y)
Number of strict rules: 7
Direct POLO(bPol) ... failed.
Uncurrying length eq
1: f(true(),xs) -> f(eq^1_s(length(xs),length^1_cons(a(),xs)),cons(a(),xs))
2: length^1_nil() -> 0()
3: length^1_cons(x,xs) -> s(length(xs))
4: eq^1_0(0()) -> true()
5: eq^1_s(x,0()) -> false()
6: eq^1_0(s(y)) -> false()
7: eq^1_s(x,s(y)) -> eq(x,y)
8: eq(0(),_1) ->= eq^1_0(_1)
9: eq(s(_1),_2) ->= eq^1_s(_1,_2)
10: length(cons(_1,_2)) ->= length^1_cons(_1,_2)
11: length(nil()) ->= length^1_nil()
Number of strict rules: 7
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #eq(s(_1),_2) ->? #eq^1_s(_1,_2)
   #2: #length(nil()) ->? #length^1_nil()
   #3: #eq^1_s(x,s(y)) -> #eq(x,y)
   #4: #length(cons(_1,_2)) ->? #length^1_cons(_1,_2)
   #5: #length^1_cons(x,xs) -> #length(xs)
   #6: #f(true(),xs) -> #f(eq^1_s(length(xs),length^1_cons(a(),xs)),cons(a(),xs))
   #7: #f(true(),xs) -> #eq^1_s(length(xs),length^1_cons(a(),xs))
   #8: #f(true(),xs) -> #length(xs)
   #9: #f(true(),xs) -> #length^1_cons(a(),xs)
   #10: #eq(0(),_1) ->? #eq^1_0(_1)
Number of SCCs: 3, DPs: 5
  SCC { #4 #5 }
POLO(Sum)... succeeded.
      a 	w: 0
      #eq^1_s	w: 0
      s 	w: 0
      eq^1_s	w: 0
      length^1_nil	w: 0
      #eq^1_0	w: 0
      eq	w: 0
      false	w: 0
      #length^1_cons	w: x2 + 1
      true	w: 0
      f 	w: 0
      #eq	w: 0
      0 	w: 0
      eq^1_0	w: 0
      length^1_cons	w: 0
      nil	w: 0
      #f 	w: 0
      #length^1_nil	w: 0
      cons	w: x1 + x2 + 2
      length	w: 0
      #length	w: x1
    USABLE RULES: { }
    Removed DPs: #4 #5
Number of SCCs: 2, DPs: 3
  SCC { #6 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.