Tool Bounds
stdout:
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{ 5(4(0(2(x1)))) -> 3(0(4(5(0(2(x1))))))
, 5(4(0(0(x1)))) -> 1(0(4(0(2(2(x1))))))
, 4(3(0(5(x1)))) -> 3(3(2(3(5(5(x1))))))
, 2(5(4(0(x1)))) -> 0(4(1(2(4(0(x1))))))
, 1(4(5(5(x1)))) -> 0(0(1(3(4(1(x1))))))
, 1(4(5(4(x1)))) -> 0(4(5(0(2(1(x1))))))
, 0(5(5(4(x1)))) -> 0(1(3(4(3(4(x1))))))
, 0(5(5(0(x1)))) -> 0(2(0(0(3(0(x1))))))
, 5(5(4(x1))) -> 3(4(4(1(2(2(x1))))))
, 5(4(4(x1))) -> 4(1(1(3(2(4(x1))))))
, 5(4(0(x1))) -> 5(1(5(2(1(0(x1))))))
, 5(4(0(x1))) -> 2(4(0(4(4(0(x1))))))
, 4(1(4(x1))) -> 3(3(2(2(3(1(x1))))))
, 3(5(4(x1))) -> 4(1(3(4(2(3(x1))))))
, 1(5(4(x1))) -> 0(2(5(2(0(4(x1))))))
, 0(5(5(x1))) -> 1(0(1(3(4(2(x1))))))
, 0(3(0(x1))) -> 2(1(1(0(2(0(x1))))))
, 5(4(x1)) -> 4(2(3(1(1(1(x1))))))
, 1(4(x1)) -> 3(1(1(2(2(4(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:
{ 4_0(1) -> 1
, 4_1(1) -> 29
, 4_1(4) -> 3
, 4_1(6) -> 63
, 4_1(9) -> 8
, 4_1(14) -> 3
, 4_1(16) -> 15
, 4_1(18) -> 45
, 4_1(19) -> 18
, 4_1(23) -> 22
, 4_1(28) -> 27
, 4_1(33) -> 2
, 4_1(34) -> 33
, 4_1(35) -> 1
, 4_1(35) -> 14
, 4_1(35) -> 54
, 4_1(44) -> 43
, 4_1(53) -> 52
, 4_1(54) -> 27
, 4_2(35) -> 89
, 4_2(55) -> 12
, 4_2(58) -> 57
, 4_2(79) -> 13
, 4_2(79) -> 14
, 4_2(91) -> 90
, 4_2(92) -> 91
, 1_0(1) -> 1
, 1_1(1) -> 23
, 1_1(7) -> 1
, 1_1(7) -> 14
, 1_1(7) -> 19
, 1_1(7) -> 70
, 1_1(10) -> 34
, 1_1(17) -> 16
, 1_1(19) -> 42
, 1_1(21) -> 20
, 1_1(23) -> 78
, 1_1(26) -> 15
, 1_1(34) -> 2
, 1_1(35) -> 23
, 1_1(36) -> 35
, 1_1(37) -> 36
, 1_1(39) -> 23
, 1_1(40) -> 39
, 1_1(62) -> 8
, 1_1(64) -> 43
, 1_1(65) -> 64
, 1_1(78) -> 77
, 1_1(83) -> 2
, 1_1(84) -> 83
, 1_2(35) -> 51
, 1_2(51) -> 82
, 1_2(56) -> 55
, 1_2(67) -> 66
, 1_2(68) -> 67
, 1_2(72) -> 71
, 1_2(73) -> 72
, 1_2(79) -> 51
, 1_2(82) -> 81
, 1_2(86) -> 85
, 1_2(87) -> 86
, 1_2(93) -> 92
, 2_0(1) -> 1
, 2_1(1) -> 6
, 2_1(2) -> 60
, 2_1(6) -> 10
, 2_1(12) -> 11
, 2_1(15) -> 6
, 2_1(18) -> 17
, 2_1(19) -> 60
, 2_1(20) -> 6
, 2_1(23) -> 25
, 2_1(29) -> 38
, 2_1(30) -> 15
, 2_1(35) -> 6
, 2_1(38) -> 84
, 2_1(39) -> 6
, 2_1(42) -> 41
, 2_1(43) -> 1
, 2_1(43) -> 14
, 2_1(43) -> 19
, 2_1(43) -> 70
, 2_1(46) -> 12
, 2_1(54) -> 53
, 2_1(61) -> 60
, 2_1(76) -> 35
, 2_2(35) -> 94
, 2_2(49) -> 48
, 2_2(50) -> 49
, 2_2(59) -> 58
, 2_2(66) -> 31
, 2_2(70) -> 69
, 2_2(71) -> 19
, 2_2(71) -> 61
, 2_2(71) -> 70
, 2_2(75) -> 74
, 2_2(80) -> 79
, 2_2(88) -> 87
, 2_2(89) -> 88
, 2_2(94) -> 93
, 3_0(1) -> 1
, 3_1(1) -> 54
, 3_1(2) -> 1
, 3_1(2) -> 13
, 3_1(2) -> 14
, 3_1(2) -> 22
, 3_1(2) -> 23
, 3_1(2) -> 27
, 3_1(2) -> 29
, 3_1(6) -> 37
, 3_1(11) -> 2
, 3_1(13) -> 12
, 3_1(19) -> 32
, 3_1(22) -> 21
, 3_1(23) -> 46
, 3_1(27) -> 26
, 3_1(29) -> 28
, 3_1(35) -> 54
, 3_1(38) -> 37
, 3_1(52) -> 36
, 3_1(63) -> 62
, 3_1(77) -> 76
, 3_2(35) -> 59
, 3_2(47) -> 22
, 3_2(48) -> 47
, 3_2(51) -> 50
, 3_2(57) -> 56
, 3_2(79) -> 59
, 3_2(81) -> 80
, 3_2(85) -> 23
, 3_2(90) -> 13
, 5_0(1) -> 1
, 5_1(1) -> 14
, 5_1(5) -> 4
, 5_1(14) -> 13
, 5_1(19) -> 4
, 5_1(24) -> 16
, 5_1(39) -> 1
, 5_1(39) -> 14
, 5_1(41) -> 40
, 5_1(60) -> 30
, 0_0(1) -> 1
, 0_1(1) -> 19
, 0_1(3) -> 2
, 0_1(6) -> 5
, 0_1(8) -> 7
, 0_1(10) -> 9
, 0_1(15) -> 1
, 0_1(15) -> 6
, 0_1(15) -> 19
, 0_1(15) -> 23
, 0_1(15) -> 70
, 0_1(20) -> 15
, 0_1(25) -> 24
, 0_1(29) -> 61
, 0_1(31) -> 30
, 0_1(32) -> 31
, 0_1(45) -> 44
, 0_1(60) -> 65
, 0_2(1) -> 70
, 0_2(3) -> 75
, 0_2(15) -> 70
, 0_2(69) -> 68
, 0_2(74) -> 73}
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:
{ 5(4(0(2(x1)))) -> 3(0(4(5(0(2(x1))))))
, 5(4(0(0(x1)))) -> 1(0(4(0(2(2(x1))))))
, 4(3(0(5(x1)))) -> 3(3(2(3(5(5(x1))))))
, 2(5(4(0(x1)))) -> 0(4(1(2(4(0(x1))))))
, 1(4(5(5(x1)))) -> 0(0(1(3(4(1(x1))))))
, 1(4(5(4(x1)))) -> 0(4(5(0(2(1(x1))))))
, 0(5(5(4(x1)))) -> 0(1(3(4(3(4(x1))))))
, 0(5(5(0(x1)))) -> 0(2(0(0(3(0(x1))))))
, 5(5(4(x1))) -> 3(4(4(1(2(2(x1))))))
, 5(4(4(x1))) -> 4(1(1(3(2(4(x1))))))
, 5(4(0(x1))) -> 5(1(5(2(1(0(x1))))))
, 5(4(0(x1))) -> 2(4(0(4(4(0(x1))))))
, 4(1(4(x1))) -> 3(3(2(2(3(1(x1))))))
, 3(5(4(x1))) -> 4(1(3(4(2(3(x1))))))
, 1(5(4(x1))) -> 0(2(5(2(0(4(x1))))))
, 0(5(5(x1))) -> 1(0(1(3(4(2(x1))))))
, 0(3(0(x1))) -> 2(1(1(0(2(0(x1))))))
, 5(4(x1)) -> 4(2(3(1(1(1(x1))))))
, 1(4(x1)) -> 3(1(1(2(2(4(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:
{ 5(4(0(2(x1)))) -> 3(0(4(5(0(2(x1))))))
, 5(4(0(0(x1)))) -> 1(0(4(0(2(2(x1))))))
, 4(3(0(5(x1)))) -> 3(3(2(3(5(5(x1))))))
, 2(5(4(0(x1)))) -> 0(4(1(2(4(0(x1))))))
, 1(4(5(5(x1)))) -> 0(0(1(3(4(1(x1))))))
, 1(4(5(4(x1)))) -> 0(4(5(0(2(1(x1))))))
, 0(5(5(4(x1)))) -> 0(1(3(4(3(4(x1))))))
, 0(5(5(0(x1)))) -> 0(2(0(0(3(0(x1))))))
, 5(5(4(x1))) -> 3(4(4(1(2(2(x1))))))
, 5(4(4(x1))) -> 4(1(1(3(2(4(x1))))))
, 5(4(0(x1))) -> 5(1(5(2(1(0(x1))))))
, 5(4(0(x1))) -> 2(4(0(4(4(0(x1))))))
, 4(1(4(x1))) -> 3(3(2(2(3(1(x1))))))
, 3(5(4(x1))) -> 4(1(3(4(2(3(x1))))))
, 1(5(4(x1))) -> 0(2(5(2(0(4(x1))))))
, 0(5(5(x1))) -> 1(0(1(3(4(2(x1))))))
, 0(3(0(x1))) -> 2(1(1(0(2(0(x1))))))
, 5(4(x1)) -> 4(2(3(1(1(1(x1))))))
, 1(4(x1)) -> 3(1(1(2(2(4(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:
{ 5(4(0(2(x1)))) -> 3(0(4(5(0(2(x1))))))
, 5(4(0(0(x1)))) -> 1(0(4(0(2(2(x1))))))
, 4(3(0(5(x1)))) -> 3(3(2(3(5(5(x1))))))
, 2(5(4(0(x1)))) -> 0(4(1(2(4(0(x1))))))
, 1(4(5(5(x1)))) -> 0(0(1(3(4(1(x1))))))
, 1(4(5(4(x1)))) -> 0(4(5(0(2(1(x1))))))
, 0(5(5(4(x1)))) -> 0(1(3(4(3(4(x1))))))
, 0(5(5(0(x1)))) -> 0(2(0(0(3(0(x1))))))
, 5(5(4(x1))) -> 3(4(4(1(2(2(x1))))))
, 5(4(4(x1))) -> 4(1(1(3(2(4(x1))))))
, 5(4(0(x1))) -> 5(1(5(2(1(0(x1))))))
, 5(4(0(x1))) -> 2(4(0(4(4(0(x1))))))
, 4(1(4(x1))) -> 3(3(2(2(3(1(x1))))))
, 3(5(4(x1))) -> 4(1(3(4(2(3(x1))))))
, 1(5(4(x1))) -> 0(2(5(2(0(4(x1))))))
, 0(5(5(x1))) -> 1(0(1(3(4(2(x1))))))
, 0(3(0(x1))) -> 2(1(1(0(2(0(x1))))))
, 5(4(x1)) -> 4(2(3(1(1(1(x1))))))
, 1(4(x1)) -> 3(1(1(2(2(4(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:
{ 5(4(0(2(x1)))) -> 3(0(4(5(0(2(x1))))))
, 5(4(0(0(x1)))) -> 1(0(4(0(2(2(x1))))))
, 4(3(0(5(x1)))) -> 3(3(2(3(5(5(x1))))))
, 2(5(4(0(x1)))) -> 0(4(1(2(4(0(x1))))))
, 1(4(5(5(x1)))) -> 0(0(1(3(4(1(x1))))))
, 1(4(5(4(x1)))) -> 0(4(5(0(2(1(x1))))))
, 0(5(5(4(x1)))) -> 0(1(3(4(3(4(x1))))))
, 0(5(5(0(x1)))) -> 0(2(0(0(3(0(x1))))))
, 5(5(4(x1))) -> 3(4(4(1(2(2(x1))))))
, 5(4(4(x1))) -> 4(1(1(3(2(4(x1))))))
, 5(4(0(x1))) -> 5(1(5(2(1(0(x1))))))
, 5(4(0(x1))) -> 2(4(0(4(4(0(x1))))))
, 4(1(4(x1))) -> 3(3(2(2(3(1(x1))))))
, 3(5(4(x1))) -> 4(1(3(4(2(3(x1))))))
, 1(5(4(x1))) -> 0(2(5(2(0(4(x1))))))
, 0(5(5(x1))) -> 1(0(1(3(4(2(x1))))))
, 0(3(0(x1))) -> 2(1(1(0(2(0(x1))))))
, 5(4(x1)) -> 4(2(3(1(1(1(x1))))))
, 1(4(x1)) -> 3(1(1(2(2(4(x1))))))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..