Problem Secret 05 SRS torpa3

Tool Bounds

Execution Time	60.056034ms
Answer	TIMEOUT
Input	Secret 05 SRS torpa3

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	2.549201ms
Answer	MAYBE
Input	Secret 05 SRS torpa3

stdout:

MAYBE

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

Tool EDA

Execution Time	19.413744ms
Answer	YES(?,O(n^4))
Input	Secret 05 SRS torpa3

stdout:

YES(?,O(n^4))

We consider the following Problem:

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

Certificate: YES(?,O(n^4))

Proof:
  We have the following EDA-non-satisfying matrix interpretation:
  Interpretation Functions:
   b(x1) = [1 3 1 2] x1 + [0]
           [0 1 2 1]      [2]
           [0 0 0 2]      [0]
           [0 0 0 0]      [2]
   d(x1) = [1 2 0 3] x1 + [0]
           [0 1 2 0]      [0]
           [0 0 0 2]      [0]
           [0 0 0 0]      [2]
   c(x1) = [1 3 2 3] x1 + [2]
           [0 1 2 2]      [0]
           [0 0 0 1]      [2]
           [0 0 0 0]      [2]
   g(x1) = [1 3 2 2] x1 + [1]
           [0 1 2 2]      [0]
           [0 0 0 1]      [2]
           [0 0 0 0]      [2]
   f(x1) = [1 3 2 2] x1 + [2]
           [0 0 0 0]      [0]
           [0 0 0 0]      [0]
           [0 0 0 0]      [0]
   a(x1) = [1 0 0 0] x1 + [0]
           [0 0 0 0]      [0]
           [0 0 0 0]      [0]
           [0 0 0 0]      [0]

Hurray, we answered YES(?,O(n^4))

Tool IDA

Execution Time	60.032078ms
Answer	TIMEOUT
Input	Secret 05 SRS torpa3

stdout:

Tool TRI

Execution Time	3.979543ms
Answer	YES(?,O(n^2))
Input	Secret 05 SRS torpa3

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

Certificate: YES(?,O(n^2))

Proof:
  We have the following triangular matrix interpretation:
  Interpretation Functions:
   b(x1) = [1 3 2 2] x1 + [0]
           [0 0 2 1]      [2]
           [0 0 1 2]      [1]
           [0 0 0 0]      [1]
   d(x1) = [1 3 0 3] x1 + [0]
           [0 0 2 0]      [1]
           [0 0 1 2]      [0]
           [0 0 0 0]      [1]
   c(x1) = [1 3 3 3] x1 + [2]
           [0 0 2 2]      [1]
           [0 0 1 2]      [1]
           [0 0 0 0]      [1]
   g(x1) = [1 3 3 2] x1 + [1]
           [0 0 2 2]      [1]
           [0 0 1 2]      [1]
           [0 0 0 0]      [1]
   f(x1) = [1 3 3 2] x1 + [2]
           [0 0 0 0]      [0]
           [0 0 0 0]      [0]
           [0 0 0 0]      [0]
   a(x1) = [1 0 0 0] x1 + [0]
           [0 0 0 0]      [0]
           [0 0 0 0]      [0]
           [0 0 0 0]      [0]

Hurray, we answered YES(?,O(n^2))

Tool TRI2

Execution Time	0.15783215ms
Answer	MAYBE
Input	Secret 05 SRS torpa3

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..