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


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


MAYBE
Input TRS:
    1: zeros() -> cons(0(),n__zeros())
    2: U11(tt()) -> tt()
    3: U21(tt()) -> tt()
    4: U31(tt()) -> tt()
    5: U41(tt(),V2) -> U42(isNatIList(activate(V2)))
    6: U42(tt()) -> tt()
    7: U51(tt(),V2) -> U52(isNatList(activate(V2)))
    8: U52(tt()) -> tt()
    9: U61(tt(),L,N) -> U62(isNat(activate(N)),activate(L))
    10: U62(tt(),L) -> s(length(activate(L)))
    11: isNat(n__0()) -> tt()
    12: isNat(n__length(V1)) -> U11(isNatList(activate(V1)))
    13: isNat(n__s(V1)) -> U21(isNat(activate(V1)))
    14: isNatIList(V) -> U31(isNatList(activate(V)))
    15: isNatIList(n__zeros()) -> tt()
    16: isNatIList(n__cons(V1,V2)) -> U41(isNat(activate(V1)),activate(V2))
    17: isNatList(n__nil()) -> tt()
    18: isNatList(n__cons(V1,V2)) -> U51(isNat(activate(V1)),activate(V2))
    19: length(nil()) -> 0()
    20: length(cons(N,L)) -> U61(isNatList(activate(L)),activate(L),N)
    21: zeros() -> n__zeros()
    22: 0() -> n__0()
    23: length(X) -> n__length(X)
    24: s(X) -> n__s(X)
    25: cons(X1,X2) -> n__cons(X1,X2)
    26: nil() -> n__nil()
    27: activate(n__zeros()) -> zeros()
    28: activate(n__0()) -> 0()
    29: activate(n__length(X)) -> length(activate(X))
    30: activate(n__s(X)) -> s(activate(X))
    31: activate(n__cons(X1,X2)) -> cons(activate(X1),X2)
    32: activate(n__nil()) -> nil()
    33: activate(X) -> X
Number of strict rules: 33
Direct POLO(bPol) ... removes: 4 15 19 17 14 12 2
      U21	w: x1
      isNatList	w: x1 + 1
      U11	w: x1 + 1
      s 	w: x1
      U42	w: x1
      activate	w: x1
      n__zeros	w: 0
      isNatIList	w: x1 + 17
      zeros	w: 0
      n__nil	w: 16
      n__s	w: x1
      0 	w: 0
      n__cons	w: 2 * x1 + 2 * x2
      nil	w: 16
      U62	w: 2 * x1 + x2 + 19
      n__0	w: 0
      n__length	w: x1 + 21
      isNat	w: x1 + 1
      U52	w: x1
      U61	w: x1 + x2 + 2 * x3 + 20
      U31	w: x1 + 1
      cons	w: 2 * x1 + 2 * x2
      tt	w: 1
      U51	w: x1 + x2
      length	w: x1 + 21
      U41	w: x1 + x2 + 16
Number of strict rules: 26
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #activate(n__length(X)) -> #length(activate(X))
   #2: #activate(n__length(X)) -> #activate(X)
   #3: #isNat(n__s(V1)) -> #U21(isNat(activate(V1)))
   #4: #isNat(n__s(V1)) -> #isNat(activate(V1))
   #5: #isNat(n__s(V1)) -> #activate(V1)
   #6: #U61(tt(),L,N) -> #U62(isNat(activate(N)),activate(L))
   #7: #U61(tt(),L,N) -> #isNat(activate(N))
   #8: #U61(tt(),L,N) -> #activate(N)
   #9: #U61(tt(),L,N) -> #activate(L)
   #10: #activate(n__cons(X1,X2)) -> #cons(activate(X1),X2)
   #11: #activate(n__cons(X1,X2)) -> #activate(X1)
   #12: #activate(n__s(X)) -> #s(activate(X))
   #13: #activate(n__s(X)) -> #activate(X)
   #14: #length(cons(N,L)) -> #U61(isNatList(activate(L)),activate(L),N)
   #15: #length(cons(N,L)) -> #isNatList(activate(L))
   #16: #length(cons(N,L)) -> #activate(L)
   #17: #length(cons(N,L)) -> #activate(L)
   #18: #U51(tt(),V2) -> #U52(isNatList(activate(V2)))
   #19: #U51(tt(),V2) -> #isNatList(activate(V2))
   #20: #U51(tt(),V2) -> #activate(V2)
   #21: #U62(tt(),L) -> #s(length(activate(L)))
   #22: #U62(tt(),L) -> #length(activate(L))
   #23: #U62(tt(),L) -> #activate(L)
   #24: #U41(tt(),V2) -> #U42(isNatIList(activate(V2)))
   #25: #U41(tt(),V2) -> #isNatIList(activate(V2))
   #26: #U41(tt(),V2) -> #activate(V2)
   #27: #activate(n__0()) -> #0()
   #28: #activate(n__zeros()) -> #zeros()
   #29: #activate(n__nil()) -> #nil()
   #30: #isNatIList(n__cons(V1,V2)) -> #U41(isNat(activate(V1)),activate(V2))
   #31: #isNatIList(n__cons(V1,V2)) -> #isNat(activate(V1))
   #32: #isNatIList(n__cons(V1,V2)) -> #activate(V1)
   #33: #isNatIList(n__cons(V1,V2)) -> #activate(V2)
   #34: #zeros() -> #cons(0(),n__zeros())
   #35: #zeros() -> #0()
   #36: #isNatList(n__cons(V1,V2)) -> #U51(isNat(activate(V1)),activate(V2))
   #37: #isNatList(n__cons(V1,V2)) -> #isNat(activate(V1))
   #38: #isNatList(n__cons(V1,V2)) -> #activate(V1)
   #39: #isNatList(n__cons(V1,V2)) -> #activate(V2)
Number of SCCs: 2, DPs: 24
  SCC { #25 #30 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.