MAYBE 1180.23/297.03 MAYBE 1180.23/297.03 1180.23/297.03 We are left with following problem, upon which TcT provides the 1180.23/297.03 certificate MAYBE. 1180.23/297.03 1180.23/297.03 Strict Trs: 1180.23/297.03 { f(s(s(s(s(s(s(s(s(x)))))))), y, y) -> 1180.23/297.03 f(id(s(s(s(s(s(s(s(s(x))))))))), y, y) 1180.23/297.03 , id(s(x)) -> s(id(x)) 1180.23/297.03 , id(0()) -> 0() } 1180.23/297.03 Obligation: 1180.23/297.03 runtime complexity 1180.23/297.03 Answer: 1180.23/297.03 MAYBE 1180.23/297.03 1180.23/297.03 None of the processors succeeded. 1180.23/297.03 1180.23/297.03 Details of failed attempt(s): 1180.23/297.03 ----------------------------- 1180.23/297.03 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 1180.23/297.03 following reason: 1180.23/297.03 1180.23/297.03 Computation stopped due to timeout after 297.0 seconds. 1180.23/297.03 1180.23/297.03 2) 'Best' failed due to the following reason: 1180.23/297.03 1180.23/297.03 None of the processors succeeded. 1180.23/297.03 1180.23/297.03 Details of failed attempt(s): 1180.23/297.03 ----------------------------- 1180.23/297.03 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 1180.23/297.03 seconds)' failed due to the following reason: 1180.23/297.03 1180.23/297.03 Computation stopped due to timeout after 148.0 seconds. 1180.23/297.03 1180.23/297.03 2) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 1180.23/297.03 failed due to the following reason: 1180.23/297.03 1180.23/297.03 None of the processors succeeded. 1180.23/297.03 1180.23/297.03 Details of failed attempt(s): 1180.23/297.03 ----------------------------- 1180.23/297.03 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 1180.23/297.03 failed due to the following reason: 1180.23/297.03 1180.23/297.03 match-boundness of the problem could not be verified. 1180.23/297.03 1180.23/297.03 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 1180.23/297.03 failed due to the following reason: 1180.23/297.03 1180.23/297.03 match-boundness of the problem could not be verified. 1180.23/297.03 1180.23/297.03 1180.23/297.03 3) 'Best' failed due to the following reason: 1180.23/297.03 1180.23/297.03 None of the processors succeeded. 1180.23/297.03 1180.23/297.03 Details of failed attempt(s): 1180.23/297.03 ----------------------------- 1180.23/297.03 1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 1180.23/297.03 following reason: 1180.23/297.03 1180.23/297.03 The processor is inapplicable, reason: 1180.23/297.03 Processor only applicable for innermost runtime complexity analysis 1180.23/297.03 1180.23/297.03 2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 1180.23/297.03 to the following reason: 1180.23/297.03 1180.23/297.03 The processor is inapplicable, reason: 1180.23/297.03 Processor only applicable for innermost runtime complexity analysis 1180.23/297.03 1180.23/297.03 1180.23/297.03 1180.23/297.03 3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to 1180.23/297.03 the following reason: 1180.23/297.03 1180.23/297.03 We add the following weak dependency pairs: 1180.23/297.03 1180.23/297.03 Strict DPs: 1180.23/297.03 { f^#(s(s(s(s(s(s(s(s(x)))))))), y, y) -> 1180.23/297.03 c_1(f^#(id(s(s(s(s(s(s(s(s(x))))))))), y, y)) 1180.23/297.03 , id^#(s(x)) -> c_2(id^#(x)) 1180.23/297.03 , id^#(0()) -> c_3() } 1180.23/297.03 1180.23/297.03 and mark the set of starting terms. 1180.23/297.03 1180.23/297.03 We are left with following problem, upon which TcT provides the 1180.23/297.03 certificate MAYBE. 1180.23/297.03 1180.23/297.03 Strict DPs: 1180.23/297.03 { f^#(s(s(s(s(s(s(s(s(x)))))))), y, y) -> 1180.23/297.03 c_1(f^#(id(s(s(s(s(s(s(s(s(x))))))))), y, y)) 1180.23/297.03 , id^#(s(x)) -> c_2(id^#(x)) 1180.23/297.03 , id^#(0()) -> c_3() } 1180.23/297.03 Strict Trs: 1180.23/297.03 { f(s(s(s(s(s(s(s(s(x)))))))), y, y) -> 1180.23/297.03 f(id(s(s(s(s(s(s(s(s(x))))))))), y, y) 1180.23/297.03 , id(s(x)) -> s(id(x)) 1180.23/297.03 , id(0()) -> 0() } 1180.23/297.03 Obligation: 1180.23/297.03 runtime complexity 1180.23/297.03 Answer: 1180.23/297.03 MAYBE 1180.23/297.03 1180.23/297.03 We estimate the number of application of {3} by applications of 1180.23/297.03 Pre({3}) = {2}. Here rules are labeled as follows: 1180.23/297.03 1180.23/297.03 DPs: 1180.23/297.03 { 1: f^#(s(s(s(s(s(s(s(s(x)))))))), y, y) -> 1180.23/297.03 c_1(f^#(id(s(s(s(s(s(s(s(s(x))))))))), y, y)) 1180.23/297.03 , 2: id^#(s(x)) -> c_2(id^#(x)) 1180.23/297.03 , 3: id^#(0()) -> c_3() } 1180.23/297.03 1180.23/297.03 We are left with following problem, upon which TcT provides the 1180.23/297.03 certificate MAYBE. 1180.23/297.03 1180.23/297.03 Strict DPs: 1180.23/297.03 { f^#(s(s(s(s(s(s(s(s(x)))))))), y, y) -> 1180.23/297.03 c_1(f^#(id(s(s(s(s(s(s(s(s(x))))))))), y, y)) 1180.23/297.03 , id^#(s(x)) -> c_2(id^#(x)) } 1180.23/297.03 Strict Trs: 1180.23/297.03 { f(s(s(s(s(s(s(s(s(x)))))))), y, y) -> 1180.23/297.03 f(id(s(s(s(s(s(s(s(s(x))))))))), y, y) 1180.23/297.03 , id(s(x)) -> s(id(x)) 1180.23/297.03 , id(0()) -> 0() } 1180.23/297.03 Weak DPs: { id^#(0()) -> c_3() } 1180.23/297.03 Obligation: 1180.23/297.03 runtime complexity 1180.23/297.03 Answer: 1180.23/297.03 MAYBE 1180.23/297.03 1180.23/297.03 Empty strict component of the problem is NOT empty. 1180.23/297.03 1180.23/297.03 1180.23/297.03 Arrrr.. 1181.18/297.91 EOF