Problem Secret 05 SRS torpa4

Tool Bounds

Execution Time	60.12759ms
Answer	TIMEOUT
Input	Secret 05 SRS torpa4

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  g(x1) -> d(d(d(d(x1))))
     , g(x1) -> c(a(x1))
     , c(d(x1)) -> a(a(x1))
     , c(a(c(x1))) -> b(c(a(b(c(x1)))))
     , c(x1) -> f(f(x1))
     , b(g(x1)) -> g(b(x1))
     , a(f(f(x1))) -> g(x1)
     , a(d(x1)) -> c(x1)
     , a(b(c(a(x1)))) -> b(a(c(b(a(b(x1))))))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	60.039562ms
Answer	TIMEOUT
Input	Secret 05 SRS torpa4

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.04558ms
Answer	TIMEOUT
Input	Secret 05 SRS torpa4

stdout:

Tool IDA

Execution Time	60.066605ms
Answer	TIMEOUT
Input	Secret 05 SRS torpa4

stdout:

Tool TRI

Execution Time	60.053158ms
Answer	TIMEOUT
Input	Secret 05 SRS torpa4

stdout:

Tool TRI2

Execution Time	0.532346ms
Answer	MAYBE
Input	Secret 05 SRS torpa4

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  g(x1) -> d(d(d(d(x1))))
     , g(x1) -> c(a(x1))
     , c(d(x1)) -> a(a(x1))
     , c(a(c(x1))) -> b(c(a(b(c(x1)))))
     , c(x1) -> f(f(x1))
     , b(g(x1)) -> g(b(x1))
     , a(f(f(x1))) -> g(x1)
     , a(d(x1)) -> c(x1)
     , a(b(c(a(x1)))) -> b(a(c(b(a(b(x1))))))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..