Problem Transformed CSR 04 Ex1 Luc04b iGM

Tool Bounds

Execution Time	60.057976ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex1 Luc04b iGM

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  tail(active(X)) -> tail(X)
     , tail(mark(X)) -> tail(X)
     , head(active(X)) -> head(X)
     , head(mark(X)) -> head(X)
     , s(active(X)) -> s(X)
     , s(mark(X)) -> s(X)
     , incr(active(X)) -> incr(X)
     , incr(mark(X)) -> incr(X)
     , cons(X1, active(X2)) -> cons(X1, X2)
     , cons(active(X1), X2) -> cons(X1, X2)
     , cons(X1, mark(X2)) -> cons(X1, X2)
     , cons(mark(X1), X2) -> cons(X1, X2)
     , mark(tail(X)) -> active(tail(mark(X)))
     , mark(head(X)) -> active(head(mark(X)))
     , mark(s(X)) -> active(s(mark(X)))
     , mark(odds()) -> active(odds())
     , mark(pairs()) -> active(pairs())
     , mark(incr(X)) -> active(incr(mark(X)))
     , mark(0()) -> active(0())
     , mark(cons(X1, X2)) -> active(cons(mark(X1), X2))
     , mark(nats()) -> active(nats())
     , 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.04599ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex1 Luc04b iGM

stdout:

TIMEOUT

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

Tool EDA

Execution Time	60.062702ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex1 Luc04b iGM

stdout:

Tool IDA

Execution Time	60.06014ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex1 Luc04b iGM

stdout:

Tool TRI

Execution Time	60.047768ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex1 Luc04b iGM

stdout:

Tool TRI2

Execution Time	0.671041ms
Answer	MAYBE
Input	Transformed CSR 04 Ex1 Luc04b iGM

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  tail(active(X)) -> tail(X)
     , tail(mark(X)) -> tail(X)
     , head(active(X)) -> head(X)
     , head(mark(X)) -> head(X)
     , s(active(X)) -> s(X)
     , s(mark(X)) -> s(X)
     , incr(active(X)) -> incr(X)
     , incr(mark(X)) -> incr(X)
     , cons(X1, active(X2)) -> cons(X1, X2)
     , cons(active(X1), X2) -> cons(X1, X2)
     , cons(X1, mark(X2)) -> cons(X1, X2)
     , cons(mark(X1), X2) -> cons(X1, X2)
     , mark(tail(X)) -> active(tail(mark(X)))
     , mark(head(X)) -> active(head(mark(X)))
     , mark(s(X)) -> active(s(mark(X)))
     , mark(odds()) -> active(odds())
     , mark(pairs()) -> active(pairs())
     , mark(incr(X)) -> active(incr(mark(X)))
     , mark(0()) -> active(0())
     , mark(cons(X1, X2)) -> active(cons(mark(X1), X2))
     , mark(nats()) -> active(nats())
     , 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..