Problem Strategy outermost added 08 OvConsOS nosorts noand GM

Tool Bounds

Execution Time	60.154846ms
Answer	TIMEOUT
Input	Strategy outermost added 08 OvConsOS nosorts noand GM

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  a__take(X1, X2) -> take(X1, X2)
     , a__U23(X1, X2, X3, X4) -> U23(X1, X2, X3, X4)
     , a__U22(X1, X2, X3, X4) -> U22(X1, X2, X3, X4)
     , a__U21(X1, X2, X3, X4) -> U21(X1, X2, X3, X4)
     , a__length(X) -> length(X)
     , a__U12(X1, X2) -> U12(X1, X2)
     , a__U11(X1, X2) -> U11(X1, X2)
     , a__zeros() -> zeros()
     , mark(nil()) -> nil()
     , mark(s(X)) -> s(mark(X))
     , mark(tt()) -> tt()
     , mark(0()) -> 0()
     , mark(cons(X1, X2)) -> cons(mark(X1), X2)
     , mark(take(X1, X2)) -> a__take(mark(X1), mark(X2))
     , mark(U23(X1, X2, X3, X4)) -> a__U23(mark(X1), X2, X3, X4)
     , mark(U22(X1, X2, X3, X4)) -> a__U22(mark(X1), X2, X3, X4)
     , mark(U21(X1, X2, X3, X4)) -> a__U21(mark(X1), X2, X3, X4)
     , mark(length(X)) -> a__length(mark(X))
     , mark(U12(X1, X2)) -> a__U12(mark(X1), X2)
     , mark(U11(X1, X2)) -> a__U11(mark(X1), X2)
     , mark(zeros()) -> a__zeros()
     , a__take(s(M), cons(N, IL)) -> a__U21(tt(), IL, M, N)
     , a__take(0(), IL) -> nil()
     , a__length(cons(N, L)) -> a__U11(tt(), L)
     , a__length(nil()) -> 0()
     , a__U23(tt(), IL, M, N) -> cons(mark(N), take(M, IL))
     , a__U22(tt(), IL, M, N) -> a__U23(tt(), IL, M, N)
     , a__U21(tt(), IL, M, N) -> a__U22(tt(), IL, M, N)
     , a__U12(tt(), L) -> s(a__length(mark(L)))
     , a__U11(tt(), L) -> a__U12(tt(), L)
     , a__zeros() -> cons(0(), zeros())}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	3.974384ms
Answer	MAYBE
Input	Strategy outermost added 08 OvConsOS nosorts noand GM

stdout:

MAYBE

Statistics:
Number of monomials: 2250
Last formula building started for bound 3
Last SAT solving started for bound 3

Tool EDA

Execution Time	60.06014ms
Answer	TIMEOUT
Input	Strategy outermost added 08 OvConsOS nosorts noand GM

stdout:

Tool IDA

Execution Time	60.068813ms
Answer	TIMEOUT
Input	Strategy outermost added 08 OvConsOS nosorts noand GM

stdout:

Tool TRI

Execution Time	60.087296ms
Answer	TIMEOUT
Input	Strategy outermost added 08 OvConsOS nosorts noand GM

stdout:

Tool TRI2

Execution Time	0.5598929ms
Answer	MAYBE
Input	Strategy outermost added 08 OvConsOS nosorts noand GM

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a__take(X1, X2) -> take(X1, X2)
     , a__U23(X1, X2, X3, X4) -> U23(X1, X2, X3, X4)
     , a__U22(X1, X2, X3, X4) -> U22(X1, X2, X3, X4)
     , a__U21(X1, X2, X3, X4) -> U21(X1, X2, X3, X4)
     , a__length(X) -> length(X)
     , a__U12(X1, X2) -> U12(X1, X2)
     , a__U11(X1, X2) -> U11(X1, X2)
     , a__zeros() -> zeros()
     , mark(nil()) -> nil()
     , mark(s(X)) -> s(mark(X))
     , mark(tt()) -> tt()
     , mark(0()) -> 0()
     , mark(cons(X1, X2)) -> cons(mark(X1), X2)
     , mark(take(X1, X2)) -> a__take(mark(X1), mark(X2))
     , mark(U23(X1, X2, X3, X4)) -> a__U23(mark(X1), X2, X3, X4)
     , mark(U22(X1, X2, X3, X4)) -> a__U22(mark(X1), X2, X3, X4)
     , mark(U21(X1, X2, X3, X4)) -> a__U21(mark(X1), X2, X3, X4)
     , mark(length(X)) -> a__length(mark(X))
     , mark(U12(X1, X2)) -> a__U12(mark(X1), X2)
     , mark(U11(X1, X2)) -> a__U11(mark(X1), X2)
     , mark(zeros()) -> a__zeros()
     , a__take(s(M), cons(N, IL)) -> a__U21(tt(), IL, M, N)
     , a__take(0(), IL) -> nil()
     , a__length(cons(N, L)) -> a__U11(tt(), L)
     , a__length(nil()) -> 0()
     , a__U23(tt(), IL, M, N) -> cons(mark(N), take(M, IL))
     , a__U22(tt(), IL, M, N) -> a__U23(tt(), IL, M, N)
     , a__U21(tt(), IL, M, N) -> a__U22(tt(), IL, M, N)
     , a__U12(tt(), L) -> s(a__length(mark(L)))
     , a__U11(tt(), L) -> a__U12(tt(), L)
     , a__zeros() -> cons(0(), zeros())}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..