Problem Secret 05 TRS matchbox2

Tool Bounds

Execution Time	5.006385e-2ms
Answer	YES(?,O(n^1))
Input	Secret 05 TRS matchbox2

stdout:

YES(?,O(n^1))

We consider the following Problem:

  Strict Trs: {f(f(x, a()), y) -> f(f(a(), y), f(a(), x))}
  StartTerms: all
  Strategy: none

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

Proof:
  The problem is match-bounded by 2.
  The enriched problem is compatible with the following automaton:
  {  a_0() -> 1
   , a_1() -> 5
   , a_1() -> 6
   , a_2() -> 9
   , a_2() -> 10
   , f_0(1, 1) -> 2
   , f_0(1, 2) -> 2
   , f_0(2, 1) -> 2
   , f_0(2, 2) -> 2
   , f_1(3, 4) -> 2
   , f_1(4, 4) -> 2
   , f_1(5, 1) -> 3
   , f_1(6, 1) -> 4
   , f_1(6, 2) -> 4
   , f_1(6, 4) -> 3
   , f_1(6, 5) -> 4
   , f_1(6, 6) -> 4
   , f_2(7, 8) -> 2
   , f_2(9, 4) -> 7
   , f_2(10, 6) -> 8}

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

Tool CDI

Execution Time	11.883942ms
Answer	MAYBE
Input	Secret 05 TRS matchbox2

stdout:

MAYBE

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

Tool EDA

Execution Time	60.02468ms
Answer	TIMEOUT
Input	Secret 05 TRS matchbox2

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs: {f(f(x, a()), y) -> f(f(a(), y), f(a(), x))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time	60.02624ms
Answer	TIMEOUT
Input	Secret 05 TRS matchbox2

stdout:

Tool TRI

Execution Time	60.02417ms
Answer	TIMEOUT
Input	Secret 05 TRS matchbox2

stdout:

Tool TRI2

Execution Time	0.15704894ms
Answer	MAYBE
Input	Secret 05 TRS matchbox2

stdout:

MAYBE

We consider the following Problem:

  Strict Trs: {f(f(x, a()), y) -> f(f(a(), y), f(a(), x))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..