Tool Bounds
stdout:
YES(?,O(n^1))
We consider the following Problem:
Strict Trs: {b(a(b(a(a(x1))))) -> a(a(a(b(a(b(a(b(x1))))))))}
StartTerms: all
Strategy: none
Certificate: YES(?,O(n^1))
Proof:
The problem is match-bounded by 5.
The enriched problem is compatible with the following automaton:
{ a_0(1) -> 1
, a_1(2) -> 1
, a_1(2) -> 6
, a_1(2) -> 8
, a_1(3) -> 2
, a_1(4) -> 3
, a_1(6) -> 5
, a_1(8) -> 7
, a_2(9) -> 6
, a_2(9) -> 20
, a_2(10) -> 9
, a_2(11) -> 10
, a_2(13) -> 12
, a_2(15) -> 14
, a_2(16) -> 4
, a_2(16) -> 6
, a_2(16) -> 8
, a_2(16) -> 13
, a_2(16) -> 15
, a_2(17) -> 16
, a_2(18) -> 17
, a_2(20) -> 19
, a_2(22) -> 21
, a_3(23) -> 20
, a_3(23) -> 34
, a_3(23) -> 48
, a_3(24) -> 23
, a_3(25) -> 24
, a_3(27) -> 26
, a_3(29) -> 28
, a_3(30) -> 11
, a_3(31) -> 30
, a_3(32) -> 31
, a_3(34) -> 33
, a_3(36) -> 35
, a_3(37) -> 13
, a_3(38) -> 37
, a_3(39) -> 38
, a_3(41) -> 40
, a_3(43) -> 42
, a_3(44) -> 43
, a_3(45) -> 44
, a_3(46) -> 45
, a_3(48) -> 47
, a_3(50) -> 49
, a_4(51) -> 27
, a_4(52) -> 51
, a_4(53) -> 52
, a_4(55) -> 54
, a_4(57) -> 56
, a_4(58) -> 57
, a_4(59) -> 58
, a_4(60) -> 59
, a_4(62) -> 61
, a_4(64) -> 63
, a_4(65) -> 48
, a_4(65) -> 62
, a_4(66) -> 65
, a_4(67) -> 66
, a_4(69) -> 68
, a_4(71) -> 70
, a_4(72) -> 39
, a_4(73) -> 72
, a_4(74) -> 73
, a_4(76) -> 75
, a_4(78) -> 77
, a_4(79) -> 76
, a_4(80) -> 79
, a_4(81) -> 80
, a_4(83) -> 82
, a_4(85) -> 84
, a_5(86) -> 53
, a_5(87) -> 86
, a_5(88) -> 87
, a_5(90) -> 89
, a_5(92) -> 91
, a_5(93) -> 90
, a_5(94) -> 93
, a_5(95) -> 94
, a_5(97) -> 96
, a_5(99) -> 98
, b_0(1) -> 1
, b_1(1) -> 8
, b_1(2) -> 8
, b_1(3) -> 8
, b_1(5) -> 4
, b_1(7) -> 6
, b_2(2) -> 22
, b_2(3) -> 15
, b_2(4) -> 15
, b_2(9) -> 22
, b_2(12) -> 11
, b_2(14) -> 13
, b_2(16) -> 22
, b_2(19) -> 18
, b_2(21) -> 20
, b_3(9) -> 50
, b_3(11) -> 29
, b_3(16) -> 36
, b_3(17) -> 43
, b_3(18) -> 29
, b_3(23) -> 50
, b_3(26) -> 25
, b_3(28) -> 27
, b_3(33) -> 32
, b_3(35) -> 34
, b_3(40) -> 39
, b_3(42) -> 41
, b_3(47) -> 46
, b_3(49) -> 48
, b_4(23) -> 64
, b_4(25) -> 71
, b_4(31) -> 57
, b_4(44) -> 78
, b_4(46) -> 85
, b_4(54) -> 53
, b_4(56) -> 55
, b_4(61) -> 60
, b_4(63) -> 62
, b_4(68) -> 67
, b_4(70) -> 69
, b_4(75) -> 74
, b_4(77) -> 76
, b_4(82) -> 81
, b_4(84) -> 83
, b_5(58) -> 92
, b_5(60) -> 99
, b_5(89) -> 88
, b_5(91) -> 90
, b_5(96) -> 95
, b_5(98) -> 97}
Hurray, we answered YES(?,O(n^1))Tool CDI
stdout:
TIMEOUT
Statistics:
Number of monomials: 0
Last formula building started for bound 0
Last SAT solving started for bound 0Tool EDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs: {b(a(b(a(a(x1))))) -> a(a(a(b(a(b(a(b(x1))))))))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool IDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs: {b(a(b(a(a(x1))))) -> a(a(a(b(a(b(a(b(x1))))))))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool TRI
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs: {b(a(b(a(a(x1))))) -> a(a(a(b(a(b(a(b(x1))))))))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool TRI2
stdout:
MAYBE
We consider the following Problem:
Strict Trs: {b(a(b(a(a(x1))))) -> a(a(a(b(a(b(a(b(x1))))))))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..