Problem Rubio 04 lindau

Tool Bounds

Execution Time	3.301692e-2ms
Answer	YES(?,O(n^1))
Input	Rubio 04 lindau

stdout:

YES(?,O(n^1))

We consider the following Problem:

  Strict Trs:
    {  c(X) -> e()
     , b(X) -> e()
     , a(X) -> e()
     , c(b(a(X))) -> a(a(b(b(c(c(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) -> 1
   , a_1(2) -> 1
   , a_1(2) -> 6
   , a_1(3) -> 2
   , b_0(1) -> 1
   , b_1(4) -> 3
   , b_1(5) -> 4
   , c_0(1) -> 1
   , c_1(1) -> 6
   , c_1(2) -> 6
   , c_1(6) -> 5
   , e_0() -> 1
   , e_1() -> 1
   , e_2() -> 1
   , e_2() -> 2
   , e_2() -> 3
   , e_2() -> 4
   , e_2() -> 5
   , e_2() -> 6}

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

Tool CDI

Execution Time	60.04274ms
Answer	TIMEOUT
Input	Rubio 04 lindau

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.03407ms
Answer	TIMEOUT
Input	Rubio 04 lindau

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  c(X) -> e()
     , b(X) -> e()
     , a(X) -> e()
     , c(b(a(X))) -> a(a(b(b(c(c(X))))))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time	60.042305ms
Answer	TIMEOUT
Input	Rubio 04 lindau

stdout:

Tool TRI

Execution Time	1.019398ms
Answer	YES(?,O(n^1))
Input	Rubio 04 lindau

stdout:

YES(?,O(n^1))

We consider the following Problem:

  Strict Trs:
    {  c(X) -> e()
     , b(X) -> e()
     , a(X) -> e()
     , c(b(a(X))) -> a(a(b(b(c(c(X))))))}
  StartTerms: all
  Strategy: none

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

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

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

Tool TRI2

Execution Time	0.3420751ms
Answer	MAYBE
Input	Rubio 04 lindau

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  c(X) -> e()
     , b(X) -> e()
     , a(X) -> e()
     , c(b(a(X))) -> a(a(b(b(c(c(X))))))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..