Problem Zantema 04 z126

Tool Bounds

Execution Time	52.073017ms
Answer	MAYBE
Input	Zantema 04 z126

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  None of the processors succeeded.


Arrrr..

Tool CDI

Execution Time	0.9996772ms
Answer	MAYBE
Input	Zantema 04 z126

stdout:

MAYBE

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

Tool EDA

Execution Time	4.222123ms
Answer	YES(?,O(n^3))
Input	Zantema 04 z126

stdout:

YES(?,O(n^3))

We consider the following Problem:

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

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

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

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

Tool IDA

Execution Time	5.646711ms
Answer	YES(?,O(n^1))
Input	Zantema 04 z126

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

Proof:
  We have the following EDA-non-satisfying and IDA(1)-non-satisfying matrix interpretation:
  Interpretation Functions:
   a(x1) = [1 2 0] x1 + [1]
           [0 0 0]      [0]
           [0 0 0]      [2]
   b(x1) = [1 0 0] x1 + [2]
           [0 0 2]      [0]
           [0 0 0]      [0]

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

Tool TRI

Execution Time	0.538954ms
Answer	YES(?,O(n^1))
Input	Zantema 04 z126

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

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

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

Tool TRI2

Execution Time	0.3125012ms
Answer	MAYBE
Input	Zantema 04 z126

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..