MAYBE 962.36/297.08 MAYBE 962.36/297.08 962.36/297.08 We are left with following problem, upon which TcT provides the 962.36/297.08 certificate MAYBE. 962.36/297.08 962.36/297.08 Strict Trs: 962.36/297.08 { ack_in(0(), n) -> ack_out(s(n)) 962.36/297.08 , ack_in(s(m), 0()) -> u11(ack_in(m, s(0()))) 962.36/297.08 , ack_in(s(m), s(n)) -> u21(ack_in(s(m), n), m) 962.36/297.08 , u11(ack_out(n)) -> ack_out(n) 962.36/297.08 , u21(ack_out(n), m) -> u22(ack_in(m, n)) 962.36/297.08 , u22(ack_out(n)) -> ack_out(n) } 962.36/297.08 Obligation: 962.36/297.08 runtime complexity 962.36/297.08 Answer: 962.36/297.08 MAYBE 962.36/297.08 962.36/297.08 None of the processors succeeded. 962.36/297.08 962.36/297.08 Details of failed attempt(s): 962.36/297.08 ----------------------------- 962.36/297.08 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 962.36/297.08 following reason: 962.36/297.08 962.36/297.08 Computation stopped due to timeout after 297.0 seconds. 962.36/297.08 962.36/297.08 2) 'Best' failed due to the following reason: 962.36/297.08 962.36/297.08 None of the processors succeeded. 962.36/297.08 962.36/297.08 Details of failed attempt(s): 962.36/297.08 ----------------------------- 962.36/297.08 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 962.36/297.08 seconds)' failed due to the following reason: 962.36/297.08 962.36/297.08 Computation stopped due to timeout after 148.0 seconds. 962.36/297.08 962.36/297.08 2) 'Best' failed due to the following reason: 962.36/297.08 962.36/297.08 None of the processors succeeded. 962.36/297.08 962.36/297.08 Details of failed attempt(s): 962.36/297.08 ----------------------------- 962.36/297.08 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 962.36/297.08 to the following reason: 962.36/297.08 962.36/297.08 The processor is inapplicable, reason: 962.36/297.08 Processor only applicable for innermost runtime complexity analysis 962.36/297.08 962.36/297.08 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 962.36/297.08 following reason: 962.36/297.08 962.36/297.08 The processor is inapplicable, reason: 962.36/297.08 Processor only applicable for innermost runtime complexity analysis 962.36/297.08 962.36/297.08 962.36/297.08 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 962.36/297.08 failed due to the following reason: 962.36/297.08 962.36/297.08 None of the processors succeeded. 962.36/297.08 962.36/297.08 Details of failed attempt(s): 962.36/297.08 ----------------------------- 962.36/297.08 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 962.36/297.08 failed due to the following reason: 962.36/297.08 962.36/297.08 match-boundness of the problem could not be verified. 962.36/297.08 962.36/297.08 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 962.36/297.08 failed due to the following reason: 962.36/297.08 962.36/297.08 match-boundness of the problem could not be verified. 962.36/297.08 962.36/297.08 962.36/297.08 962.36/297.08 3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to 962.36/297.08 the following reason: 962.36/297.08 962.36/297.08 We add the following weak dependency pairs: 962.36/297.08 962.36/297.08 Strict DPs: 962.36/297.08 { ack_in^#(0(), n) -> c_1(n) 962.36/297.08 , ack_in^#(s(m), 0()) -> c_2(u11^#(ack_in(m, s(0())))) 962.36/297.08 , ack_in^#(s(m), s(n)) -> c_3(u21^#(ack_in(s(m), n), m)) 962.36/297.08 , u11^#(ack_out(n)) -> c_4(n) 962.36/297.08 , u21^#(ack_out(n), m) -> c_5(u22^#(ack_in(m, n))) 962.36/297.08 , u22^#(ack_out(n)) -> c_6(n) } 962.36/297.08 962.36/297.08 and mark the set of starting terms. 962.36/297.08 962.36/297.08 We are left with following problem, upon which TcT provides the 962.36/297.08 certificate MAYBE. 962.36/297.08 962.36/297.08 Strict DPs: 962.36/297.08 { ack_in^#(0(), n) -> c_1(n) 962.36/297.08 , ack_in^#(s(m), 0()) -> c_2(u11^#(ack_in(m, s(0())))) 962.36/297.08 , ack_in^#(s(m), s(n)) -> c_3(u21^#(ack_in(s(m), n), m)) 962.36/297.08 , u11^#(ack_out(n)) -> c_4(n) 962.36/297.08 , u21^#(ack_out(n), m) -> c_5(u22^#(ack_in(m, n))) 962.36/297.08 , u22^#(ack_out(n)) -> c_6(n) } 962.36/297.08 Strict Trs: 962.36/297.08 { ack_in(0(), n) -> ack_out(s(n)) 962.36/297.08 , ack_in(s(m), 0()) -> u11(ack_in(m, s(0()))) 962.36/297.08 , ack_in(s(m), s(n)) -> u21(ack_in(s(m), n), m) 962.36/297.08 , u11(ack_out(n)) -> ack_out(n) 962.36/297.08 , u21(ack_out(n), m) -> u22(ack_in(m, n)) 962.36/297.08 , u22(ack_out(n)) -> ack_out(n) } 962.36/297.08 Obligation: 962.36/297.08 runtime complexity 962.36/297.08 Answer: 962.36/297.08 MAYBE 962.36/297.08 962.36/297.08 Empty strict component of the problem is NOT empty. 962.36/297.08 962.36/297.08 962.36/297.08 Arrrr.. 962.46/297.13 EOF