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