Problem Zantema 04 z064

Tool Bounds

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

stdout:

YES(?,O(n^1))

We consider the following Problem:

  Strict Trs: {b(a(c(b(b(x1))))) -> a(c(b(b(b(a(c(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(4) -> 3
   , b_1(5) -> 4
   , b_1(6) -> 5
   , b_2(10) -> 9
   , b_2(11) -> 10
   , b_2(12) -> 11
   , b_2(16) -> 15
   , b_2(17) -> 16
   , b_2(18) -> 17
   , c_0(1) -> 1
   , c_1(1) -> 7
   , c_1(3) -> 2
   , c_1(5) -> 7
   , c_2(5) -> 13
   , c_2(9) -> 8
   , c_2(11) -> 19
   , c_2(15) -> 14
   , a_0(1) -> 1
   , a_1(2) -> 1
   , a_1(2) -> 5
   , a_1(7) -> 6
   , a_2(8) -> 4
   , a_2(13) -> 12
   , a_2(14) -> 3
   , a_2(19) -> 18}

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

Tool CDI

Execution Time	60.041676ms
Answer	TIMEOUT
Input	Zantema 04 z064

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.038067ms
Answer	TIMEOUT
Input	Zantema 04 z064

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time	60.195133ms
Answer	TIMEOUT
Input	Zantema 04 z064

stdout:

Tool TRI

Execution Time	60.02708ms
Answer	TIMEOUT
Input	Zantema 04 z064

stdout:

Tool TRI2

Execution Time	4.510119ms
Answer	MAYBE
Input	Zantema 04 z064

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..