Problem Zantema 06 16

Tool Bounds

Execution Time60.062267ms
Answer
TIMEOUT
InputZantema 06 16

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time60.0415ms
Answer
TIMEOUT
InputZantema 06 16

stdout:

TIMEOUT

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

Tool EDA

Execution Time60.06273ms
Answer
TIMEOUT
InputZantema 06 16

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time60.049824ms
Answer
TIMEOUT
InputZantema 06 16

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI

Execution Time3.938592ms
Answer
YES(?,O(n^1))
InputZantema 06 16

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

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

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

Tool TRI2

Execution Time0.6696789ms
Answer
MAYBE
InputZantema 06 16

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..