Problem Transformed CSR 04 LengthOfFiniteLists nosorts noand C

Tool Bounds

Execution Time	60.11466ms
Answer	TIMEOUT
Input	Transformed CSR 04 LengthOfFiniteLists nosorts noand C

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  top(ok(X)) -> top(active(X))
     , top(mark(X)) -> top(proper(X))
     , length(ok(X)) -> ok(length(X))
     , s(ok(X)) -> ok(s(X))
     , U12(ok(X1), ok(X2)) -> ok(U12(X1, X2))
     , U11(ok(X1), ok(X2)) -> ok(U11(X1, X2))
     , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
     , proper(nil()) -> ok(nil())
     , proper(length(X)) -> length(proper(X))
     , proper(s(X)) -> s(proper(X))
     , proper(U12(X1, X2)) -> U12(proper(X1), proper(X2))
     , proper(tt()) -> ok(tt())
     , proper(U11(X1, X2)) -> U11(proper(X1), proper(X2))
     , proper(0()) -> ok(0())
     , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
     , proper(zeros()) -> ok(zeros())
     , length(mark(X)) -> mark(length(X))
     , s(mark(X)) -> mark(s(X))
     , U12(mark(X1), X2) -> mark(U12(X1, X2))
     , U11(mark(X1), X2) -> mark(U11(X1, X2))
     , cons(mark(X1), X2) -> mark(cons(X1, X2))
     , active(length(X)) -> length(active(X))
     , active(s(X)) -> s(active(X))
     , active(U12(X1, X2)) -> U12(active(X1), X2)
     , active(U11(X1, X2)) -> U11(active(X1), X2)
     , active(cons(X1, X2)) -> cons(active(X1), X2)
     , active(length(cons(N, L))) -> mark(U11(tt(), L))
     , active(length(nil())) -> mark(0())
     , active(U12(tt(), L)) -> mark(s(length(L)))
     , active(U11(tt(), L)) -> mark(U12(tt(), L))
     , active(zeros()) -> mark(cons(0(), zeros()))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	31.269577ms
Answer	MAYBE
Input	Transformed CSR 04 LengthOfFiniteLists nosorts noand C

stdout:

MAYBE

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

Tool EDA

Execution Time	60.06295ms
Answer	TIMEOUT
Input	Transformed CSR 04 LengthOfFiniteLists nosorts noand C

stdout:

Tool IDA

Execution Time	60.06211ms
Answer	TIMEOUT
Input	Transformed CSR 04 LengthOfFiniteLists nosorts noand C

stdout:

Tool TRI

Execution Time	60.057396ms
Answer	TIMEOUT
Input	Transformed CSR 04 LengthOfFiniteLists nosorts noand C

stdout:

Tool TRI2

Execution Time	1.0481911ms
Answer	MAYBE
Input	Transformed CSR 04 LengthOfFiniteLists nosorts noand C

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  top(ok(X)) -> top(active(X))
     , top(mark(X)) -> top(proper(X))
     , length(ok(X)) -> ok(length(X))
     , s(ok(X)) -> ok(s(X))
     , U12(ok(X1), ok(X2)) -> ok(U12(X1, X2))
     , U11(ok(X1), ok(X2)) -> ok(U11(X1, X2))
     , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
     , proper(nil()) -> ok(nil())
     , proper(length(X)) -> length(proper(X))
     , proper(s(X)) -> s(proper(X))
     , proper(U12(X1, X2)) -> U12(proper(X1), proper(X2))
     , proper(tt()) -> ok(tt())
     , proper(U11(X1, X2)) -> U11(proper(X1), proper(X2))
     , proper(0()) -> ok(0())
     , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
     , proper(zeros()) -> ok(zeros())
     , length(mark(X)) -> mark(length(X))
     , s(mark(X)) -> mark(s(X))
     , U12(mark(X1), X2) -> mark(U12(X1, X2))
     , U11(mark(X1), X2) -> mark(U11(X1, X2))
     , cons(mark(X1), X2) -> mark(cons(X1, X2))
     , active(length(X)) -> length(active(X))
     , active(s(X)) -> s(active(X))
     , active(U12(X1, X2)) -> U12(active(X1), X2)
     , active(U11(X1, X2)) -> U11(active(X1), X2)
     , active(cons(X1, X2)) -> cons(active(X1), X2)
     , active(length(cons(N, L))) -> mark(U11(tt(), L))
     , active(length(nil())) -> mark(0())
     , active(U12(tt(), L)) -> mark(s(length(L)))
     , active(U11(tt(), L)) -> mark(U12(tt(), L))
     , active(zeros()) -> mark(cons(0(), zeros()))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..