Problem Transformed CSR 04 ExProp7 Luc06 C

Tool Bounds

Execution Time	60.112236ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExProp7 Luc06 C

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  top(ok(X)) -> top(active(X))
     , top(mark(X)) -> top(proper(X))
     , p(ok(X)) -> ok(p(X))
     , s(ok(X)) -> ok(s(X))
     , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
     , f(ok(X)) -> ok(f(X))
     , proper(p(X)) -> p(proper(X))
     , proper(s(X)) -> s(proper(X))
     , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
     , proper(0()) -> ok(0())
     , proper(f(X)) -> f(proper(X))
     , p(mark(X)) -> mark(p(X))
     , s(mark(X)) -> mark(s(X))
     , cons(mark(X1), X2) -> mark(cons(X1, X2))
     , f(mark(X)) -> mark(f(X))
     , active(p(X)) -> p(active(X))
     , active(s(X)) -> s(active(X))
     , active(cons(X1, X2)) -> cons(active(X1), X2)
     , active(f(X)) -> f(active(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.043186ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExProp7 Luc06 C

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.044495ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExProp7 Luc06 C

stdout:

Tool IDA

Execution Time	60.05591ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExProp7 Luc06 C

stdout:

Tool TRI

Execution Time	60.062607ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExProp7 Luc06 C

stdout:

Tool TRI2

Execution Time	0.70079803ms
Answer	MAYBE
Input	Transformed CSR 04 ExProp7 Luc06 C

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  top(ok(X)) -> top(active(X))
     , top(mark(X)) -> top(proper(X))
     , p(ok(X)) -> ok(p(X))
     , s(ok(X)) -> ok(s(X))
     , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
     , f(ok(X)) -> ok(f(X))
     , proper(p(X)) -> p(proper(X))
     , proper(s(X)) -> s(proper(X))
     , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
     , proper(0()) -> ok(0())
     , proper(f(X)) -> f(proper(X))
     , p(mark(X)) -> mark(p(X))
     , s(mark(X)) -> mark(s(X))
     , cons(mark(X1), X2) -> mark(cons(X1, X2))
     , f(mark(X)) -> mark(f(X))
     , active(p(X)) -> p(active(X))
     , active(s(X)) -> s(active(X))
     , active(cons(X1, X2)) -> cons(active(X1), X2)
     , active(f(X)) -> f(active(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..