Tool Bounds
stdout:
YES(?,O(n^1))
We consider the following Problem:
Strict Trs: {c(b(a(a(x1)))) -> a(a(b(a(a(b(c(b(a(c(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:
{ a_0(1) -> 1
, a_0(2) -> 1
, a_0(3) -> 1
, a_1(4) -> 3
, a_1(4) -> 12
, a_1(5) -> 4
, a_1(7) -> 6
, a_1(8) -> 7
, a_1(12) -> 11
, a_2(13) -> 9
, a_2(14) -> 13
, a_2(16) -> 15
, a_2(17) -> 16
, a_2(21) -> 20
, a_2(22) -> 12
, a_2(23) -> 22
, a_2(25) -> 24
, a_2(26) -> 25
, a_2(30) -> 29
, a_2(31) -> 30
, a_2(32) -> 31
, a_2(34) -> 33
, a_2(35) -> 34
, a_2(39) -> 38
, a_3(40) -> 39
, a_3(41) -> 40
, a_3(43) -> 42
, a_3(44) -> 43
, a_3(48) -> 47
, a_3(49) -> 27
, a_3(50) -> 49
, a_3(52) -> 51
, a_3(53) -> 52
, a_3(57) -> 56
, a_3(58) -> 36
, a_3(59) -> 58
, a_3(61) -> 60
, a_3(62) -> 61
, a_3(66) -> 65
, b_0(1) -> 2
, b_0(2) -> 2
, b_0(3) -> 2
, b_1(6) -> 5
, b_1(9) -> 8
, b_1(11) -> 10
, b_2(15) -> 14
, b_2(18) -> 17
, b_2(20) -> 19
, b_2(24) -> 23
, b_2(27) -> 26
, b_2(29) -> 28
, b_2(33) -> 32
, b_2(36) -> 35
, b_2(38) -> 37
, b_3(42) -> 41
, b_3(45) -> 44
, b_3(47) -> 46
, b_3(51) -> 50
, b_3(54) -> 53
, b_3(56) -> 55
, b_3(60) -> 59
, b_3(63) -> 62
, b_3(65) -> 64
, c_0(1) -> 3
, c_0(2) -> 3
, c_0(3) -> 3
, c_1(1) -> 12
, c_1(2) -> 12
, c_1(3) -> 12
, c_1(4) -> 12
, c_1(5) -> 12
, c_1(10) -> 9
, c_2(4) -> 21
, c_2(8) -> 30
, c_2(14) -> 39
, c_2(19) -> 18
, c_2(22) -> 21
, c_2(28) -> 27
, c_2(37) -> 36
, c_3(17) -> 48
, c_3(31) -> 57
, c_3(40) -> 66
, c_3(46) -> 45
, c_3(55) -> 54
, c_3(64) -> 63}
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: {c(b(a(a(x1)))) -> a(a(b(a(a(b(c(b(a(c(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: {c(b(a(a(x1)))) -> a(a(b(a(a(b(c(b(a(c(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: {c(b(a(a(x1)))) -> a(a(b(a(a(b(c(b(a(c(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: {c(b(a(a(x1)))) -> a(a(b(a(a(b(c(b(a(c(x1))))))))))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..