Problem Zantema 04 z066

Tool Bounds

Execution Time	60.037903ms
Answer	TIMEOUT
Input	Zantema 04 z066

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	20.241585ms
Answer	MAYBE
Input	Zantema 04 z066

stdout:

MAYBE

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

Tool EDA

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

stdout:

YES(?,O(n^3))

We consider the following Problem:

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

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

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

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

Tool IDA

Execution Time	60.034557ms
Answer	TIMEOUT
Input	Zantema 04 z066

stdout:

Tool TRI

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

stdout:

YES(?,O(n^3))

We consider the following Problem:

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

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

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

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

Tool TRI2

Execution Time	60.037365ms
Answer	TIMEOUT
Input	Zantema 04 z066