Problem Transformed CSR 04 ExIntrod GM01 iGM

Tool Bounds

Execution Time	60.052048ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExIntrod GM01 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)
     , adx(active(X)) -> adx(X)
     , adx(mark(X)) -> adx(X)
     , s(active(X)) -> s(X)
     , s(mark(X)) -> s(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)
     , incr(active(X)) -> incr(X)
     , incr(mark(X)) -> incr(X)
     , mark(tail(X)) -> active(tail(mark(X)))
     , mark(head(X)) -> active(head(mark(X)))
     , mark(0()) -> active(0())
     , mark(zeros()) -> active(zeros())
     , mark(nats()) -> active(nats())
     , mark(adx(X)) -> active(adx(mark(X)))
     , mark(s(X)) -> active(s(mark(X)))
     , mark(cons(X1, X2)) -> active(cons(mark(X1), X2))
     , mark(nil()) -> active(nil())
     , mark(incr(X)) -> active(incr(mark(X)))
     , active(tail(cons(X, L))) -> mark(L)
     , active(head(cons(X, L))) -> mark(X)
     , active(zeros()) -> mark(cons(0(), zeros()))
     , active(nats()) -> mark(adx(zeros()))
     , active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
     , active(adx(nil())) -> mark(nil())
     , active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
     , active(incr(nil())) -> mark(nil())}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	60.04498ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExIntrod GM01 iGM

stdout:

TIMEOUT

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

Tool EDA

Execution Time	60.05702ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExIntrod GM01 iGM

stdout:

Tool IDA

Execution Time	60.06975ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExIntrod GM01 iGM

stdout:

Tool TRI

Execution Time	60.05217ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExIntrod GM01 iGM

stdout:

Tool TRI2

Execution Time	0.77785087ms
Answer	MAYBE
Input	Transformed CSR 04 ExIntrod GM01 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)
     , adx(active(X)) -> adx(X)
     , adx(mark(X)) -> adx(X)
     , s(active(X)) -> s(X)
     , s(mark(X)) -> s(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)
     , incr(active(X)) -> incr(X)
     , incr(mark(X)) -> incr(X)
     , mark(tail(X)) -> active(tail(mark(X)))
     , mark(head(X)) -> active(head(mark(X)))
     , mark(0()) -> active(0())
     , mark(zeros()) -> active(zeros())
     , mark(nats()) -> active(nats())
     , mark(adx(X)) -> active(adx(mark(X)))
     , mark(s(X)) -> active(s(mark(X)))
     , mark(cons(X1, X2)) -> active(cons(mark(X1), X2))
     , mark(nil()) -> active(nil())
     , mark(incr(X)) -> active(incr(mark(X)))
     , active(tail(cons(X, L))) -> mark(L)
     , active(head(cons(X, L))) -> mark(X)
     , active(zeros()) -> mark(cons(0(), zeros()))
     , active(nats()) -> mark(adx(zeros()))
     , active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
     , active(adx(nil())) -> mark(nil())
     , active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
     , active(incr(nil())) -> mark(nil())}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..