Problem Strategy outermost added 08 LengthOfFiniteLists nosorts FR

Tool Bounds

Execution Time	60.03123ms
Answer	TIMEOUT
Input	Strategy outermost added 08 LengthOfFiniteLists nosorts FR

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  activate(X) -> X
     , activate(n__zeros()) -> zeros()
     , zeros() -> n__zeros()
     , length(cons(N, L)) -> s(length(activate(L)))
     , length(nil()) -> 0()
     , and(tt(), X) -> activate(X)
     , zeros() -> cons(0(), n__zeros())}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	7.32167ms
Answer	MAYBE
Input	Strategy outermost added 08 LengthOfFiniteLists nosorts FR

stdout:

MAYBE

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

Tool EDA

Execution Time	60.033936ms
Answer	TIMEOUT
Input	Strategy outermost added 08 LengthOfFiniteLists nosorts FR

stdout:

Tool IDA

Execution Time	60.034508ms
Answer	TIMEOUT
Input	Strategy outermost added 08 LengthOfFiniteLists nosorts FR

stdout:

Tool TRI

Execution Time	60.031452ms
Answer	TIMEOUT
Input	Strategy outermost added 08 LengthOfFiniteLists nosorts FR

stdout:

Tool TRI2

Execution Time	0.113722086ms
Answer	MAYBE
Input	Strategy outermost added 08 LengthOfFiniteLists nosorts FR

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  activate(X) -> X
     , activate(n__zeros()) -> zeros()
     , zeros() -> n__zeros()
     , length(cons(N, L)) -> s(length(activate(L)))
     , length(nil()) -> 0()
     , and(tt(), X) -> activate(X)
     , zeros() -> cons(0(), n__zeros())}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..