Problem Zantema 04 z062

Tool Bounds

Execution Time	3.0661106e-2ms
Answer	YES(?,O(n^1))
Input	Zantema 04 z062

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

Proof:
  The problem is match-bounded by 1.
  The enriched problem is compatible with the following automaton:
  {  c_0(1) -> 1
   , c_1(4) -> 3
   , c_1(7) -> 6
   , b_0(1) -> 1
   , b_1(3) -> 2
   , b_1(5) -> 4
   , b_1(6) -> 5
   , a_0(1) -> 1
   , a_1(1) -> 7
   , a_1(2) -> 1
   , a_1(2) -> 5}

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

Tool CDI

Execution Time	60.04106ms
Answer	TIMEOUT
Input	Zantema 04 z062

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.035988ms
Answer	TIMEOUT
Input	Zantema 04 z062

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time	60.22755ms
Answer	TIMEOUT
Input	Zantema 04 z062

stdout:

Tool TRI

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

stdout:

YES(?,O(n^3))

We consider the following Problem:

  Strict Trs: {b(c(a(b(b(c(x1)))))) -> a(b(c(b(b(c(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 0] x1 + [0]
           [0 1 1 0]      [0]
           [0 0 1 1]      [1]
           [0 0 0 0]      [0]
   b(x1) = [1 1 0 0] x1 + [0]
           [0 0 1 0]      [0]
           [0 0 0 0]      [0]
           [0 0 0 0]      [2]
   a(x1) = [1 0 0 0] x1 + [0]
           [0 0 0 1]      [0]
           [0 0 0 0]      [0]
           [0 0 0 0]      [1]

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

Tool TRI2

Execution Time	25.915014ms
Answer	MAYBE
Input	Zantema 04 z062

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..