Problem Transformed CSR 04 Ex1 Luc04b C

Tool Bounds

Execution Time	60.15774ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex1 Luc04b C

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  top(ok(X)) -> top(active(X))
     , top(mark(X)) -> top(proper(X))
     , tail(ok(X)) -> ok(tail(X))
     , head(ok(X)) -> ok(head(X))
     , s(ok(X)) -> ok(s(X))
     , incr(ok(X)) -> ok(incr(X))
     , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
     , proper(tail(X)) -> tail(proper(X))
     , proper(head(X)) -> head(proper(X))
     , proper(s(X)) -> s(proper(X))
     , proper(odds()) -> ok(odds())
     , proper(pairs()) -> ok(pairs())
     , proper(incr(X)) -> incr(proper(X))
     , proper(0()) -> ok(0())
     , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
     , proper(nats()) -> ok(nats())
     , tail(mark(X)) -> mark(tail(X))
     , head(mark(X)) -> mark(head(X))
     , s(mark(X)) -> mark(s(X))
     , incr(mark(X)) -> mark(incr(X))
     , cons(mark(X1), X2) -> mark(cons(X1, X2))
     , active(tail(X)) -> tail(active(X))
     , active(head(X)) -> head(active(X))
     , active(s(X)) -> s(active(X))
     , active(incr(X)) -> incr(active(X))
     , active(cons(X1, X2)) -> cons(active(X1), X2)
     , active(tail(cons(X, XS))) -> mark(XS)
     , active(head(cons(X, XS))) -> mark(X)
     , active(incr(cons(X, XS))) -> mark(cons(s(X), incr(XS)))
     , active(odds()) -> mark(incr(pairs()))
     , active(pairs()) -> mark(cons(0(), incr(odds())))
     , active(nats()) -> mark(cons(0(), incr(nats())))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	60.047245ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex1 Luc04b C

stdout:

TIMEOUT

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

Tool EDA

Execution Time	60.060677ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex1 Luc04b C

stdout:

Tool IDA

Execution Time	60.06555ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex1 Luc04b C

stdout:

Tool TRI

Execution Time	60.05116ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex1 Luc04b C

stdout:

Tool TRI2

Execution Time	0.8321738ms
Answer	MAYBE
Input	Transformed CSR 04 Ex1 Luc04b C

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  top(ok(X)) -> top(active(X))
     , top(mark(X)) -> top(proper(X))
     , tail(ok(X)) -> ok(tail(X))
     , head(ok(X)) -> ok(head(X))
     , s(ok(X)) -> ok(s(X))
     , incr(ok(X)) -> ok(incr(X))
     , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
     , proper(tail(X)) -> tail(proper(X))
     , proper(head(X)) -> head(proper(X))
     , proper(s(X)) -> s(proper(X))
     , proper(odds()) -> ok(odds())
     , proper(pairs()) -> ok(pairs())
     , proper(incr(X)) -> incr(proper(X))
     , proper(0()) -> ok(0())
     , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
     , proper(nats()) -> ok(nats())
     , tail(mark(X)) -> mark(tail(X))
     , head(mark(X)) -> mark(head(X))
     , s(mark(X)) -> mark(s(X))
     , incr(mark(X)) -> mark(incr(X))
     , cons(mark(X1), X2) -> mark(cons(X1, X2))
     , active(tail(X)) -> tail(active(X))
     , active(head(X)) -> head(active(X))
     , active(s(X)) -> s(active(X))
     , active(incr(X)) -> incr(active(X))
     , active(cons(X1, X2)) -> cons(active(X1), X2)
     , active(tail(cons(X, XS))) -> mark(XS)
     , active(head(cons(X, XS))) -> mark(X)
     , active(incr(cons(X, XS))) -> mark(cons(s(X), incr(XS)))
     , active(odds()) -> mark(incr(pairs()))
     , active(pairs()) -> mark(cons(0(), incr(odds())))
     , active(nats()) -> mark(cons(0(), incr(nats())))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..