Problem Zantema 04 z053

Tool Bounds

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

stdout:

YES(?,O(n^1))

We consider the following Problem:

  Strict Trs: {b(a(a(b(a(b(x1)))))) -> a(b(a(a(b(b(a(x1)))))))}
  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:
  {  b_0(1) -> 1
   , b_1(3) -> 2
   , b_1(6) -> 5
   , b_1(7) -> 6
   , b_2(9) -> 8
   , b_2(12) -> 11
   , b_2(13) -> 12
   , a_0(1) -> 1
   , a_1(1) -> 7
   , a_1(2) -> 1
   , a_1(2) -> 6
   , a_1(3) -> 7
   , a_1(4) -> 3
   , a_1(5) -> 4
   , a_2(3) -> 13
   , a_2(8) -> 2
   , a_2(10) -> 9
   , a_2(11) -> 10}

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

Tool CDI

Execution Time	60.044346ms
Answer	TIMEOUT
Input	Zantema 04 z053

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.039265ms
Answer	TIMEOUT
Input	Zantema 04 z053

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time	60.04612ms
Answer	TIMEOUT
Input	Zantema 04 z053

stdout:

Tool TRI

Execution Time	60.027843ms
Answer	TIMEOUT
Input	Zantema 04 z053

stdout:

Tool TRI2

Execution Time	0.99189687ms
Answer	MAYBE
Input	Zantema 04 z053

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..