Problem Transformed CSR 04 ExProp7 Luc06 iGM

Tool Bounds

Execution Time	60.088745ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExProp7 Luc06 iGM

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  p(active(X)) -> p(X)
     , p(mark(X)) -> p(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)
     , f(active(X)) -> f(X)
     , f(mark(X)) -> f(X)
     , mark(p(X)) -> active(p(mark(X)))
     , mark(s(X)) -> active(s(mark(X)))
     , mark(cons(X1, X2)) -> active(cons(mark(X1), X2))
     , mark(0()) -> active(0())
     , mark(f(X)) -> active(f(mark(X)))
     , active(p(s(X))) -> mark(X)
     , active(f(s(0()))) -> mark(f(p(s(0()))))
     , active(f(0())) -> mark(cons(0(), f(s(0()))))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	60.043247ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExProp7 Luc06 iGM

stdout:

TIMEOUT

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

Tool EDA

Execution Time	60.050537ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExProp7 Luc06 iGM

stdout:

Tool IDA

Execution Time	60.052372ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExProp7 Luc06 iGM

stdout:

Tool TRI

Execution Time	60.036552ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExProp7 Luc06 iGM

stdout:

Tool TRI2

Execution Time	0.58026505ms
Answer	MAYBE
Input	Transformed CSR 04 ExProp7 Luc06 iGM

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  p(active(X)) -> p(X)
     , p(mark(X)) -> p(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)
     , f(active(X)) -> f(X)
     , f(mark(X)) -> f(X)
     , mark(p(X)) -> active(p(mark(X)))
     , mark(s(X)) -> active(s(mark(X)))
     , mark(cons(X1, X2)) -> active(cons(mark(X1), X2))
     , mark(0()) -> active(0())
     , mark(f(X)) -> active(f(mark(X)))
     , active(p(s(X))) -> mark(X)
     , active(f(s(0()))) -> mark(f(p(s(0()))))
     , active(f(0())) -> mark(cons(0(), f(s(0()))))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..