MAYBE 694.28/297.05 MAYBE 694.28/297.05 694.28/297.05 We are left with following problem, upon which TcT provides the 694.28/297.05 certificate MAYBE. 694.28/297.05 694.28/297.05 Strict Trs: 694.28/297.05 { O(0()) -> 0() 694.28/297.05 , +(x, 0()) -> x 694.28/297.05 , +(O(x), O(y)) -> O(+(x, y)) 694.28/297.05 , +(O(x), I(y)) -> I(+(x, y)) 694.28/297.05 , +(0(), x) -> x 694.28/297.05 , +(I(x), O(y)) -> I(+(x, y)) 694.28/297.05 , +(I(x), I(y)) -> O(+(+(x, y), I(0()))) 694.28/297.05 , *(x, 0()) -> 0() 694.28/297.05 , *(O(x), y) -> O(*(x, y)) 694.28/297.05 , *(0(), x) -> 0() 694.28/297.05 , *(I(x), y) -> +(O(*(x, y)), y) 694.28/297.05 , -(x, 0()) -> x 694.28/297.05 , -(O(x), O(y)) -> O(-(x, y)) 694.28/297.05 , -(O(x), I(y)) -> I(-(-(x, y), I(1()))) 694.28/297.05 , -(0(), x) -> 0() 694.28/297.05 , -(I(x), O(y)) -> I(-(x, y)) 694.28/297.05 , -(I(x), I(y)) -> O(-(x, y)) } 694.28/297.05 Obligation: 694.28/297.05 runtime complexity 694.28/297.05 Answer: 694.28/297.05 MAYBE 694.28/297.05 694.28/297.05 None of the processors succeeded. 694.28/297.05 694.28/297.05 Details of failed attempt(s): 694.28/297.05 ----------------------------- 694.28/297.05 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 694.28/297.05 following reason: 694.28/297.05 694.28/297.05 Computation stopped due to timeout after 297.0 seconds. 694.28/297.05 694.28/297.05 2) 'Best' failed due to the following reason: 694.28/297.05 694.28/297.05 None of the processors succeeded. 694.28/297.05 694.28/297.05 Details of failed attempt(s): 694.28/297.05 ----------------------------- 694.28/297.05 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 694.28/297.05 seconds)' failed due to the following reason: 694.28/297.05 694.28/297.05 Computation stopped due to timeout after 148.0 seconds. 694.28/297.05 694.28/297.05 2) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 694.28/297.05 failed due to the following reason: 694.28/297.05 694.28/297.05 None of the processors succeeded. 694.28/297.05 694.28/297.05 Details of failed attempt(s): 694.28/297.05 ----------------------------- 694.28/297.05 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 694.28/297.05 failed due to the following reason: 694.28/297.05 694.28/297.05 match-boundness of the problem could not be verified. 694.28/297.05 694.28/297.05 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 694.28/297.05 failed due to the following reason: 694.28/297.05 694.28/297.05 match-boundness of the problem could not be verified. 694.28/297.05 694.28/297.05 694.28/297.05 3) 'Best' failed due to the following reason: 694.28/297.05 694.28/297.05 None of the processors succeeded. 694.28/297.05 694.28/297.05 Details of failed attempt(s): 694.28/297.05 ----------------------------- 694.28/297.05 1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 694.28/297.05 following reason: 694.28/297.05 694.28/297.05 The processor is inapplicable, reason: 694.28/297.05 Processor only applicable for innermost runtime complexity analysis 694.28/297.05 694.28/297.05 2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 694.28/297.05 to the following reason: 694.28/297.05 694.28/297.05 The processor is inapplicable, reason: 694.28/297.05 Processor only applicable for innermost runtime complexity analysis 694.28/297.05 694.28/297.05 694.28/297.05 694.28/297.05 3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to 694.28/297.05 the following reason: 694.28/297.05 694.28/297.05 We add the following weak dependency pairs: 694.28/297.05 694.28/297.05 Strict DPs: 694.28/297.05 { O^#(0()) -> c_1() 694.28/297.05 , +^#(x, 0()) -> c_2(x) 694.28/297.05 , +^#(O(x), O(y)) -> c_3(O^#(+(x, y))) 694.28/297.05 , +^#(O(x), I(y)) -> c_4(+^#(x, y)) 694.28/297.05 , +^#(0(), x) -> c_5(x) 694.28/297.05 , +^#(I(x), O(y)) -> c_6(+^#(x, y)) 694.28/297.05 , +^#(I(x), I(y)) -> c_7(O^#(+(+(x, y), I(0())))) 694.28/297.05 , *^#(x, 0()) -> c_8() 694.28/297.05 , *^#(O(x), y) -> c_9(O^#(*(x, y))) 694.28/297.05 , *^#(0(), x) -> c_10() 694.28/297.05 , *^#(I(x), y) -> c_11(+^#(O(*(x, y)), y)) 694.28/297.05 , -^#(x, 0()) -> c_12(x) 694.28/297.05 , -^#(O(x), O(y)) -> c_13(O^#(-(x, y))) 694.28/297.05 , -^#(O(x), I(y)) -> c_14(-^#(-(x, y), I(1()))) 694.28/297.05 , -^#(0(), x) -> c_15() 694.28/297.05 , -^#(I(x), O(y)) -> c_16(-^#(x, y)) 694.28/297.05 , -^#(I(x), I(y)) -> c_17(O^#(-(x, y))) } 694.28/297.05 694.28/297.05 and mark the set of starting terms. 694.28/297.05 694.28/297.05 We are left with following problem, upon which TcT provides the 694.28/297.05 certificate MAYBE. 694.28/297.05 694.28/297.05 Strict DPs: 694.28/297.05 { O^#(0()) -> c_1() 694.28/297.05 , +^#(x, 0()) -> c_2(x) 694.28/297.05 , +^#(O(x), O(y)) -> c_3(O^#(+(x, y))) 694.28/297.05 , +^#(O(x), I(y)) -> c_4(+^#(x, y)) 694.28/297.05 , +^#(0(), x) -> c_5(x) 694.28/297.05 , +^#(I(x), O(y)) -> c_6(+^#(x, y)) 694.28/297.05 , +^#(I(x), I(y)) -> c_7(O^#(+(+(x, y), I(0())))) 694.28/297.05 , *^#(x, 0()) -> c_8() 694.28/297.05 , *^#(O(x), y) -> c_9(O^#(*(x, y))) 694.28/297.05 , *^#(0(), x) -> c_10() 694.28/297.05 , *^#(I(x), y) -> c_11(+^#(O(*(x, y)), y)) 694.28/297.05 , -^#(x, 0()) -> c_12(x) 694.28/297.05 , -^#(O(x), O(y)) -> c_13(O^#(-(x, y))) 694.28/297.05 , -^#(O(x), I(y)) -> c_14(-^#(-(x, y), I(1()))) 694.28/297.05 , -^#(0(), x) -> c_15() 694.28/297.05 , -^#(I(x), O(y)) -> c_16(-^#(x, y)) 694.28/297.05 , -^#(I(x), I(y)) -> c_17(O^#(-(x, y))) } 694.28/297.05 Strict Trs: 694.28/297.05 { O(0()) -> 0() 694.28/297.05 , +(x, 0()) -> x 694.28/297.05 , +(O(x), O(y)) -> O(+(x, y)) 694.28/297.05 , +(O(x), I(y)) -> I(+(x, y)) 694.28/297.05 , +(0(), x) -> x 694.28/297.05 , +(I(x), O(y)) -> I(+(x, y)) 694.28/297.05 , +(I(x), I(y)) -> O(+(+(x, y), I(0()))) 694.28/297.05 , *(x, 0()) -> 0() 694.28/297.05 , *(O(x), y) -> O(*(x, y)) 694.28/297.05 , *(0(), x) -> 0() 694.28/297.05 , *(I(x), y) -> +(O(*(x, y)), y) 694.28/297.05 , -(x, 0()) -> x 694.28/297.05 , -(O(x), O(y)) -> O(-(x, y)) 694.28/297.05 , -(O(x), I(y)) -> I(-(-(x, y), I(1()))) 694.28/297.05 , -(0(), x) -> 0() 694.28/297.05 , -(I(x), O(y)) -> I(-(x, y)) 694.28/297.05 , -(I(x), I(y)) -> O(-(x, y)) } 694.28/297.05 Obligation: 694.28/297.05 runtime complexity 694.28/297.05 Answer: 694.28/297.05 MAYBE 694.28/297.05 694.28/297.05 We estimate the number of application of {1,8,10,15} by 694.28/297.05 applications of Pre({1,8,10,15}) = {2,3,5,7,9,12,13,14,16,17}. Here 694.28/297.05 rules are labeled as follows: 694.28/297.05 694.28/297.05 DPs: 694.28/297.05 { 1: O^#(0()) -> c_1() 694.28/297.05 , 2: +^#(x, 0()) -> c_2(x) 694.28/297.05 , 3: +^#(O(x), O(y)) -> c_3(O^#(+(x, y))) 694.28/297.05 , 4: +^#(O(x), I(y)) -> c_4(+^#(x, y)) 694.28/297.05 , 5: +^#(0(), x) -> c_5(x) 694.28/297.05 , 6: +^#(I(x), O(y)) -> c_6(+^#(x, y)) 694.28/297.05 , 7: +^#(I(x), I(y)) -> c_7(O^#(+(+(x, y), I(0())))) 694.28/297.05 , 8: *^#(x, 0()) -> c_8() 694.28/297.05 , 9: *^#(O(x), y) -> c_9(O^#(*(x, y))) 694.28/297.05 , 10: *^#(0(), x) -> c_10() 694.28/297.05 , 11: *^#(I(x), y) -> c_11(+^#(O(*(x, y)), y)) 694.28/297.05 , 12: -^#(x, 0()) -> c_12(x) 694.28/297.05 , 13: -^#(O(x), O(y)) -> c_13(O^#(-(x, y))) 694.28/297.05 , 14: -^#(O(x), I(y)) -> c_14(-^#(-(x, y), I(1()))) 694.28/297.05 , 15: -^#(0(), x) -> c_15() 694.28/297.05 , 16: -^#(I(x), O(y)) -> c_16(-^#(x, y)) 694.28/297.05 , 17: -^#(I(x), I(y)) -> c_17(O^#(-(x, y))) } 694.28/297.05 694.28/297.05 We are left with following problem, upon which TcT provides the 694.28/297.05 certificate MAYBE. 694.28/297.05 694.28/297.05 Strict DPs: 694.28/297.05 { +^#(x, 0()) -> c_2(x) 694.28/297.05 , +^#(O(x), O(y)) -> c_3(O^#(+(x, y))) 694.28/297.05 , +^#(O(x), I(y)) -> c_4(+^#(x, y)) 694.28/297.05 , +^#(0(), x) -> c_5(x) 694.28/297.05 , +^#(I(x), O(y)) -> c_6(+^#(x, y)) 694.28/297.05 , +^#(I(x), I(y)) -> c_7(O^#(+(+(x, y), I(0())))) 694.28/297.05 , *^#(O(x), y) -> c_9(O^#(*(x, y))) 694.28/297.05 , *^#(I(x), y) -> c_11(+^#(O(*(x, y)), y)) 694.28/297.05 , -^#(x, 0()) -> c_12(x) 694.28/297.05 , -^#(O(x), O(y)) -> c_13(O^#(-(x, y))) 694.28/297.05 , -^#(O(x), I(y)) -> c_14(-^#(-(x, y), I(1()))) 694.28/297.05 , -^#(I(x), O(y)) -> c_16(-^#(x, y)) 694.28/297.05 , -^#(I(x), I(y)) -> c_17(O^#(-(x, y))) } 694.28/297.05 Strict Trs: 694.28/297.05 { O(0()) -> 0() 694.28/297.05 , +(x, 0()) -> x 694.28/297.05 , +(O(x), O(y)) -> O(+(x, y)) 694.28/297.05 , +(O(x), I(y)) -> I(+(x, y)) 694.28/297.05 , +(0(), x) -> x 694.28/297.05 , +(I(x), O(y)) -> I(+(x, y)) 694.28/297.05 , +(I(x), I(y)) -> O(+(+(x, y), I(0()))) 694.28/297.05 , *(x, 0()) -> 0() 694.28/297.05 , *(O(x), y) -> O(*(x, y)) 694.28/297.05 , *(0(), x) -> 0() 694.28/297.05 , *(I(x), y) -> +(O(*(x, y)), y) 694.28/297.05 , -(x, 0()) -> x 694.28/297.05 , -(O(x), O(y)) -> O(-(x, y)) 694.28/297.05 , -(O(x), I(y)) -> I(-(-(x, y), I(1()))) 694.28/297.05 , -(0(), x) -> 0() 694.28/297.05 , -(I(x), O(y)) -> I(-(x, y)) 694.28/297.05 , -(I(x), I(y)) -> O(-(x, y)) } 694.28/297.05 Weak DPs: 694.28/297.05 { O^#(0()) -> c_1() 694.28/297.05 , *^#(x, 0()) -> c_8() 694.28/297.05 , *^#(0(), x) -> c_10() 694.28/297.05 , -^#(0(), x) -> c_15() } 694.28/297.05 Obligation: 694.28/297.05 runtime complexity 694.28/297.05 Answer: 694.28/297.05 MAYBE 694.28/297.05 694.28/297.05 We estimate the number of application of {2,6,7,10,13} by 694.28/297.05 applications of Pre({2,6,7,10,13}) = {1,3,4,5,8,9,11,12}. Here 694.28/297.05 rules are labeled as follows: 694.28/297.05 694.28/297.05 DPs: 694.28/297.05 { 1: +^#(x, 0()) -> c_2(x) 694.28/297.05 , 2: +^#(O(x), O(y)) -> c_3(O^#(+(x, y))) 694.28/297.05 , 3: +^#(O(x), I(y)) -> c_4(+^#(x, y)) 694.28/297.05 , 4: +^#(0(), x) -> c_5(x) 694.28/297.05 , 5: +^#(I(x), O(y)) -> c_6(+^#(x, y)) 694.28/297.05 , 6: +^#(I(x), I(y)) -> c_7(O^#(+(+(x, y), I(0())))) 694.28/297.05 , 7: *^#(O(x), y) -> c_9(O^#(*(x, y))) 694.28/297.05 , 8: *^#(I(x), y) -> c_11(+^#(O(*(x, y)), y)) 694.28/297.05 , 9: -^#(x, 0()) -> c_12(x) 694.28/297.05 , 10: -^#(O(x), O(y)) -> c_13(O^#(-(x, y))) 694.28/297.05 , 11: -^#(O(x), I(y)) -> c_14(-^#(-(x, y), I(1()))) 694.28/297.05 , 12: -^#(I(x), O(y)) -> c_16(-^#(x, y)) 694.28/297.05 , 13: -^#(I(x), I(y)) -> c_17(O^#(-(x, y))) 694.28/297.05 , 14: O^#(0()) -> c_1() 694.28/297.05 , 15: *^#(x, 0()) -> c_8() 694.28/297.05 , 16: *^#(0(), x) -> c_10() 694.28/297.05 , 17: -^#(0(), x) -> c_15() } 694.28/297.05 694.28/297.05 We are left with following problem, upon which TcT provides the 694.28/297.05 certificate MAYBE. 694.28/297.05 694.28/297.05 Strict DPs: 694.28/297.05 { +^#(x, 0()) -> c_2(x) 694.28/297.05 , +^#(O(x), I(y)) -> c_4(+^#(x, y)) 694.28/297.05 , +^#(0(), x) -> c_5(x) 694.28/297.05 , +^#(I(x), O(y)) -> c_6(+^#(x, y)) 694.28/297.05 , *^#(I(x), y) -> c_11(+^#(O(*(x, y)), y)) 694.28/297.05 , -^#(x, 0()) -> c_12(x) 694.28/297.05 , -^#(O(x), I(y)) -> c_14(-^#(-(x, y), I(1()))) 694.28/297.05 , -^#(I(x), O(y)) -> c_16(-^#(x, y)) } 694.28/297.05 Strict Trs: 694.28/297.05 { O(0()) -> 0() 694.28/297.05 , +(x, 0()) -> x 694.28/297.05 , +(O(x), O(y)) -> O(+(x, y)) 694.28/297.05 , +(O(x), I(y)) -> I(+(x, y)) 694.28/297.05 , +(0(), x) -> x 694.28/297.05 , +(I(x), O(y)) -> I(+(x, y)) 694.28/297.05 , +(I(x), I(y)) -> O(+(+(x, y), I(0()))) 694.28/297.05 , *(x, 0()) -> 0() 694.28/297.05 , *(O(x), y) -> O(*(x, y)) 694.28/297.05 , *(0(), x) -> 0() 694.28/297.05 , *(I(x), y) -> +(O(*(x, y)), y) 694.28/297.05 , -(x, 0()) -> x 694.28/297.05 , -(O(x), O(y)) -> O(-(x, y)) 694.28/297.05 , -(O(x), I(y)) -> I(-(-(x, y), I(1()))) 694.28/297.05 , -(0(), x) -> 0() 694.28/297.05 , -(I(x), O(y)) -> I(-(x, y)) 694.28/297.05 , -(I(x), I(y)) -> O(-(x, y)) } 694.28/297.05 Weak DPs: 694.28/297.05 { O^#(0()) -> c_1() 694.28/297.05 , +^#(O(x), O(y)) -> c_3(O^#(+(x, y))) 694.28/297.05 , +^#(I(x), I(y)) -> c_7(O^#(+(+(x, y), I(0())))) 694.28/297.05 , *^#(x, 0()) -> c_8() 694.28/297.05 , *^#(O(x), y) -> c_9(O^#(*(x, y))) 694.28/297.05 , *^#(0(), x) -> c_10() 694.28/297.05 , -^#(O(x), O(y)) -> c_13(O^#(-(x, y))) 694.28/297.05 , -^#(0(), x) -> c_15() 694.28/297.05 , -^#(I(x), I(y)) -> c_17(O^#(-(x, y))) } 694.28/297.05 Obligation: 694.28/297.05 runtime complexity 694.28/297.05 Answer: 694.28/297.05 MAYBE 694.28/297.05 694.28/297.05 Empty strict component of the problem is NOT empty. 694.28/297.05 694.28/297.05 694.28/297.05 Arrrr.. 694.60/297.34 EOF