Problem Zantema 04 z045

Tool Bounds

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

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

Proof:
  The problem is match-bounded by 3.
  The enriched problem is compatible with the following automaton:
  {  b_0(1) -> 1
   , b_1(3) -> 2
   , b_1(5) -> 4
   , b_1(6) -> 5
   , b_1(8) -> 7
   , b_1(9) -> 8
   , b_1(12) -> 11
   , b_2(15) -> 14
   , b_2(17) -> 16
   , b_2(18) -> 17
   , b_2(20) -> 19
   , b_2(21) -> 20
   , b_2(24) -> 23
   , b_2(27) -> 26
   , b_2(29) -> 28
   , b_2(30) -> 29
   , b_2(32) -> 31
   , b_2(33) -> 32
   , b_2(36) -> 35
   , b_2(39) -> 38
   , b_2(41) -> 40
   , b_2(42) -> 41
   , b_2(44) -> 43
   , b_2(45) -> 44
   , b_2(48) -> 47
   , b_3(51) -> 50
   , b_3(53) -> 52
   , b_3(54) -> 53
   , b_3(56) -> 55
   , b_3(57) -> 56
   , b_3(60) -> 59
   , a_0(1) -> 1
   , a_1(1) -> 13
   , a_1(2) -> 1
   , a_1(2) -> 12
   , a_1(3) -> 13
   , a_1(4) -> 3
   , a_1(5) -> 13
   , a_1(7) -> 6
   , a_1(11) -> 10
   , a_2(3) -> 25
   , a_2(8) -> 37
   , a_2(14) -> 9
   , a_2(15) -> 49
   , a_2(16) -> 15
   , a_2(19) -> 18
   , a_2(23) -> 22
   , a_2(26) -> 12
   , a_2(27) -> 25
   , a_2(28) -> 27
   , a_2(31) -> 30
   , a_2(35) -> 34
   , a_2(38) -> 36
   , a_2(40) -> 39
   , a_2(43) -> 42
   , a_2(47) -> 46
   , a_3(39) -> 61
   , a_3(50) -> 33
   , a_3(52) -> 51
   , a_3(55) -> 54
   , a_3(59) -> 58
   , c_0(1) -> 1
   , c_1(10) -> 9
   , c_1(13) -> 12
   , c_2(22) -> 21
   , c_2(25) -> 24
   , c_2(34) -> 33
   , c_2(37) -> 36
   , c_2(46) -> 45
   , c_2(49) -> 48
   , c_3(58) -> 57
   , c_3(61) -> 60}

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

Tool CDI

Execution Time	60.038536ms
Answer	TIMEOUT
Input	Zantema 04 z045

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.044693ms
Answer	TIMEOUT
Input	Zantema 04 z045

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {c(a(b(a(b(x1))))) -> a(b(a(b(b(a(b(b(c(a(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.07874ms
Answer	TIMEOUT
Input	Zantema 04 z045

stdout:

Tool TRI

Execution Time	60.03768ms
Answer	TIMEOUT
Input	Zantema 04 z045

stdout:

Tool TRI2

Execution Time	2.416067ms
Answer	MAYBE
Input	Zantema 04 z045

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..