Problem Transformed CSR 04 OvConsOS nosorts C

Tool Bounds

Execution Time	60.08955ms
Answer	TIMEOUT
Input	Transformed CSR 04 OvConsOS nosorts C

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  top(ok(X)) -> top(active(X))
     , top(mark(X)) -> top(proper(X))
     , take(ok(X1), ok(X2)) -> ok(take(X1, X2))
     , s(ok(X)) -> ok(s(X))
     , length(ok(X)) -> ok(length(X))
     , and(ok(X1), ok(X2)) -> ok(and(X1, X2))
     , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
     , proper(take(X1, X2)) -> take(proper(X1), proper(X2))
     , proper(s(X)) -> s(proper(X))
     , proper(nil()) -> ok(nil())
     , proper(length(X)) -> length(proper(X))
     , proper(tt()) -> ok(tt())
     , proper(and(X1, X2)) -> and(proper(X1), proper(X2))
     , proper(0()) -> ok(0())
     , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
     , proper(zeros()) -> ok(zeros())
     , take(X1, mark(X2)) -> mark(take(X1, X2))
     , take(mark(X1), X2) -> mark(take(X1, X2))
     , s(mark(X)) -> mark(s(X))
     , length(mark(X)) -> mark(length(X))
     , and(mark(X1), X2) -> mark(and(X1, X2))
     , cons(mark(X1), X2) -> mark(cons(X1, X2))
     , active(take(X1, X2)) -> take(X1, active(X2))
     , active(take(X1, X2)) -> take(active(X1), X2)
     , active(s(X)) -> s(active(X))
     , active(length(X)) -> length(active(X))
     , active(and(X1, X2)) -> and(active(X1), X2)
     , active(cons(X1, X2)) -> cons(active(X1), X2)
     , active(take(s(M), cons(N, IL))) -> mark(cons(N, take(M, IL)))
     , active(take(0(), IL)) -> mark(nil())
     , active(length(cons(N, L))) -> mark(s(length(L)))
     , active(length(nil())) -> mark(0())
     , active(and(tt(), X)) -> mark(X)
     , 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	60.045486ms
Answer	TIMEOUT
Input	Transformed CSR 04 OvConsOS nosorts C

stdout:

TIMEOUT

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

Tool EDA

Execution Time	60.096348ms
Answer	TIMEOUT
Input	Transformed CSR 04 OvConsOS nosorts C

stdout:

Tool IDA

Execution Time	60.07381ms
Answer	TIMEOUT
Input	Transformed CSR 04 OvConsOS nosorts C

stdout:

Tool TRI

Execution Time	60.05563ms
Answer	TIMEOUT
Input	Transformed CSR 04 OvConsOS nosorts C

stdout:

Tool TRI2

Execution Time	1.1175079ms
Answer	MAYBE
Input	Transformed CSR 04 OvConsOS nosorts C

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..