Tool Bounds
stdout:
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{ 5(4(5(3(2(4(3(x1))))))) -> 2(5(5(5(0(4(5(0(1(4(x1))))))))))
, 4(4(0(5(4(2(2(x1))))))) -> 4(0(4(3(4(4(4(5(4(1(x1))))))))))
, 4(1(4(5(0(5(4(x1))))))) -> 4(1(5(3(1(0(5(3(1(0(x1))))))))))
, 3(3(0(4(1(2(x1)))))) -> 3(5(1(2(0(2(0(5(3(1(x1))))))))))
, 3(2(4(2(4(1(x1)))))) -> 0(2(1(1(1(5(3(1(3(3(x1))))))))))
, 3(1(4(3(1(2(x1)))))) -> 0(0(1(1(4(2(3(0(0(3(x1))))))))))
, 1(1(4(5(3(3(x1)))))) -> 1(3(1(1(3(0(1(2(2(1(x1))))))))))
, 0(5(4(2(4(3(x1)))))) -> 5(1(5(5(3(5(3(0(0(0(x1))))))))))
, 4(4(2(4(2(x1))))) -> 2(0(5(2(1(4(0(2(0(1(x1))))))))))
, 4(2(4(x1))) -> 2(0(0(5(3(3(5(2(0(4(x1))))))))))}
StartTerms: all
Strategy: none
Certificate: YES(?,O(n^1))
Proof:
The problem is match-bounded by 1.
The enriched problem is compatible with the following automaton:
{ 4_0(1) -> 1
, 4_1(1) -> 10
, 4_1(7) -> 6
, 4_1(11) -> 1
, 4_1(11) -> 10
, 4_1(11) -> 18
, 4_1(13) -> 12
, 4_1(15) -> 14
, 4_1(16) -> 15
, 4_1(17) -> 16
, 4_1(19) -> 18
, 4_1(28) -> 10
, 4_1(48) -> 47
, 4_1(72) -> 71
, 2_0(1) -> 1
, 2_1(2) -> 1
, 2_1(2) -> 10
, 2_1(19) -> 59
, 2_1(31) -> 30
, 2_1(33) -> 32
, 2_1(37) -> 36
, 2_1(49) -> 48
, 2_1(59) -> 58
, 2_1(70) -> 69
, 2_1(74) -> 73
, 2_1(80) -> 79
, 0_0(1) -> 1
, 0_1(1) -> 27
, 0_1(6) -> 5
, 0_1(9) -> 8
, 0_1(10) -> 80
, 0_1(11) -> 27
, 0_1(12) -> 11
, 0_1(19) -> 74
, 0_1(24) -> 23
, 0_1(27) -> 67
, 0_1(28) -> 27
, 0_1(32) -> 31
, 0_1(34) -> 33
, 0_1(36) -> 1
, 0_1(36) -> 35
, 0_1(36) -> 44
, 0_1(44) -> 51
, 0_1(45) -> 36
, 0_1(51) -> 50
, 0_1(57) -> 56
, 0_1(67) -> 66
, 0_1(68) -> 2
, 0_1(73) -> 72
, 0_1(75) -> 68
, 5_0(1) -> 1
, 5_1(3) -> 2
, 5_1(4) -> 3
, 5_1(5) -> 4
, 5_1(8) -> 7
, 5_1(18) -> 17
, 5_1(21) -> 20
, 5_1(25) -> 24
, 5_1(29) -> 28
, 5_1(35) -> 34
, 5_1(41) -> 40
, 5_1(60) -> 1
, 5_1(60) -> 27
, 5_1(62) -> 61
, 5_1(63) -> 62
, 5_1(65) -> 64
, 5_1(69) -> 68
, 5_1(76) -> 75
, 5_1(79) -> 78
, 3_0(1) -> 1
, 3_1(1) -> 44
, 3_1(2) -> 44
, 3_1(14) -> 13
, 3_1(19) -> 35
, 3_1(20) -> 44
, 3_1(22) -> 21
, 3_1(26) -> 25
, 3_1(28) -> 1
, 3_1(28) -> 43
, 3_1(28) -> 44
, 3_1(42) -> 41
, 3_1(44) -> 43
, 3_1(50) -> 49
, 3_1(52) -> 28
, 3_1(53) -> 52
, 3_1(56) -> 55
, 3_1(64) -> 63
, 3_1(66) -> 65
, 3_1(77) -> 76
, 3_1(78) -> 77
, 1_0(1) -> 1
, 1_1(1) -> 19
, 1_1(2) -> 19
, 1_1(10) -> 9
, 1_1(20) -> 11
, 1_1(23) -> 22
, 1_1(27) -> 26
, 1_1(28) -> 19
, 1_1(30) -> 29
, 1_1(38) -> 37
, 1_1(39) -> 38
, 1_1(40) -> 39
, 1_1(43) -> 42
, 1_1(46) -> 45
, 1_1(47) -> 46
, 1_1(52) -> 1
, 1_1(52) -> 19
, 1_1(54) -> 53
, 1_1(55) -> 54
, 1_1(58) -> 57
, 1_1(61) -> 60
, 1_1(71) -> 70}
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(5(3(2(4(3(x1))))))) -> 2(5(5(5(0(4(5(0(1(4(x1))))))))))
, 4(4(0(5(4(2(2(x1))))))) -> 4(0(4(3(4(4(4(5(4(1(x1))))))))))
, 4(1(4(5(0(5(4(x1))))))) -> 4(1(5(3(1(0(5(3(1(0(x1))))))))))
, 3(3(0(4(1(2(x1)))))) -> 3(5(1(2(0(2(0(5(3(1(x1))))))))))
, 3(2(4(2(4(1(x1)))))) -> 0(2(1(1(1(5(3(1(3(3(x1))))))))))
, 3(1(4(3(1(2(x1)))))) -> 0(0(1(1(4(2(3(0(0(3(x1))))))))))
, 1(1(4(5(3(3(x1)))))) -> 1(3(1(1(3(0(1(2(2(1(x1))))))))))
, 0(5(4(2(4(3(x1)))))) -> 5(1(5(5(3(5(3(0(0(0(x1))))))))))
, 4(4(2(4(2(x1))))) -> 2(0(5(2(1(4(0(2(0(1(x1))))))))))
, 4(2(4(x1))) -> 2(0(0(5(3(3(5(2(0(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(5(3(2(4(3(x1))))))) -> 2(5(5(5(0(4(5(0(1(4(x1))))))))))
, 4(4(0(5(4(2(2(x1))))))) -> 4(0(4(3(4(4(4(5(4(1(x1))))))))))
, 4(1(4(5(0(5(4(x1))))))) -> 4(1(5(3(1(0(5(3(1(0(x1))))))))))
, 3(3(0(4(1(2(x1)))))) -> 3(5(1(2(0(2(0(5(3(1(x1))))))))))
, 3(2(4(2(4(1(x1)))))) -> 0(2(1(1(1(5(3(1(3(3(x1))))))))))
, 3(1(4(3(1(2(x1)))))) -> 0(0(1(1(4(2(3(0(0(3(x1))))))))))
, 1(1(4(5(3(3(x1)))))) -> 1(3(1(1(3(0(1(2(2(1(x1))))))))))
, 0(5(4(2(4(3(x1)))))) -> 5(1(5(5(3(5(3(0(0(0(x1))))))))))
, 4(4(2(4(2(x1))))) -> 2(0(5(2(1(4(0(2(0(1(x1))))))))))
, 4(2(4(x1))) -> 2(0(0(5(3(3(5(2(0(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(5(3(2(4(3(x1))))))) -> 2(5(5(5(0(4(5(0(1(4(x1))))))))))
, 4(4(0(5(4(2(2(x1))))))) -> 4(0(4(3(4(4(4(5(4(1(x1))))))))))
, 4(1(4(5(0(5(4(x1))))))) -> 4(1(5(3(1(0(5(3(1(0(x1))))))))))
, 3(3(0(4(1(2(x1)))))) -> 3(5(1(2(0(2(0(5(3(1(x1))))))))))
, 3(2(4(2(4(1(x1)))))) -> 0(2(1(1(1(5(3(1(3(3(x1))))))))))
, 3(1(4(3(1(2(x1)))))) -> 0(0(1(1(4(2(3(0(0(3(x1))))))))))
, 1(1(4(5(3(3(x1)))))) -> 1(3(1(1(3(0(1(2(2(1(x1))))))))))
, 0(5(4(2(4(3(x1)))))) -> 5(1(5(5(3(5(3(0(0(0(x1))))))))))
, 4(4(2(4(2(x1))))) -> 2(0(5(2(1(4(0(2(0(1(x1))))))))))
, 4(2(4(x1))) -> 2(0(0(5(3(3(5(2(0(4(x1))))))))))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool TRI2
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ 5(4(5(3(2(4(3(x1))))))) -> 2(5(5(5(0(4(5(0(1(4(x1))))))))))
, 4(4(0(5(4(2(2(x1))))))) -> 4(0(4(3(4(4(4(5(4(1(x1))))))))))
, 4(1(4(5(0(5(4(x1))))))) -> 4(1(5(3(1(0(5(3(1(0(x1))))))))))
, 3(3(0(4(1(2(x1)))))) -> 3(5(1(2(0(2(0(5(3(1(x1))))))))))
, 3(2(4(2(4(1(x1)))))) -> 0(2(1(1(1(5(3(1(3(3(x1))))))))))
, 3(1(4(3(1(2(x1)))))) -> 0(0(1(1(4(2(3(0(0(3(x1))))))))))
, 1(1(4(5(3(3(x1)))))) -> 1(3(1(1(3(0(1(2(2(1(x1))))))))))
, 0(5(4(2(4(3(x1)))))) -> 5(1(5(5(3(5(3(0(0(0(x1))))))))))
, 4(4(2(4(2(x1))))) -> 2(0(5(2(1(4(0(2(0(1(x1))))))))))
, 4(2(4(x1))) -> 2(0(0(5(3(3(5(2(0(4(x1))))))))))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..