MAYBE 850.18/297.03 MAYBE 850.18/297.03 850.18/297.03 We are left with following problem, upon which TcT provides the 850.18/297.03 certificate MAYBE. 850.18/297.03 850.18/297.03 Strict Trs: 850.18/297.03 { cond(true(), x) -> cond(odd(x), p(x)) 850.18/297.03 , odd(0()) -> false() 850.18/297.03 , odd(s(0())) -> true() 850.18/297.03 , odd(s(s(x))) -> odd(x) 850.18/297.03 , p(0()) -> 0() 850.18/297.03 , p(s(x)) -> x } 850.18/297.03 Obligation: 850.18/297.03 innermost runtime complexity 850.18/297.03 Answer: 850.18/297.03 MAYBE 850.18/297.03 850.18/297.03 None of the processors succeeded. 850.18/297.03 850.18/297.03 Details of failed attempt(s): 850.18/297.03 ----------------------------- 850.18/297.03 1) 'empty' failed due to the following reason: 850.18/297.03 850.18/297.03 Empty strict component of the problem is NOT empty. 850.18/297.03 850.18/297.03 2) 'Best' failed due to the following reason: 850.18/297.03 850.18/297.03 None of the processors succeeded. 850.18/297.03 850.18/297.03 Details of failed attempt(s): 850.18/297.03 ----------------------------- 850.18/297.03 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 850.18/297.03 following reason: 850.18/297.03 850.18/297.03 Computation stopped due to timeout after 297.0 seconds. 850.18/297.03 850.18/297.03 2) 'Best' failed due to the following reason: 850.18/297.03 850.18/297.03 None of the processors succeeded. 850.18/297.03 850.18/297.03 Details of failed attempt(s): 850.18/297.03 ----------------------------- 850.18/297.03 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 850.18/297.03 seconds)' failed due to the following reason: 850.18/297.03 850.18/297.03 The weightgap principle applies (using the following nonconstant 850.18/297.03 growth matrix-interpretation) 850.18/297.03 850.18/297.03 The following argument positions are usable: 850.18/297.03 Uargs(cond) = {1, 2} 850.18/297.03 850.18/297.03 TcT has computed the following matrix interpretation satisfying 850.18/297.03 not(EDA) and not(IDA(1)). 850.18/297.03 850.18/297.03 [cond](x1, x2) = [1] x1 + [1] x2 + [1] 850.18/297.03 850.18/297.03 [true] = [7] 850.18/297.03 850.18/297.03 [odd](x1) = [7] 850.18/297.03 850.18/297.03 [p](x1) = [1] x1 + [7] 850.18/297.03 850.18/297.03 [0] = [7] 850.18/297.03 850.18/297.03 [false] = [6] 850.18/297.03 850.18/297.03 [s](x1) = [1] x1 + [7] 850.18/297.03 850.18/297.03 The order satisfies the following ordering constraints: 850.18/297.03 850.18/297.03 [cond(true(), x)] = [1] x + [8] 850.18/297.03 ? [1] x + [15] 850.18/297.03 = [cond(odd(x), p(x))] 850.18/297.03 850.18/297.03 [odd(0())] = [7] 850.18/297.03 > [6] 850.18/297.03 = [false()] 850.18/297.03 850.18/297.03 [odd(s(0()))] = [7] 850.18/297.03 >= [7] 850.18/297.03 = [true()] 850.18/297.03 850.18/297.03 [odd(s(s(x)))] = [7] 850.18/297.03 >= [7] 850.18/297.03 = [odd(x)] 850.18/297.03 850.18/297.03 [p(0())] = [14] 850.18/297.03 > [7] 850.18/297.03 = [0()] 850.18/297.03 850.18/297.03 [p(s(x))] = [1] x + [14] 850.18/297.03 > [1] x + [0] 850.18/297.03 = [x] 850.18/297.03 850.18/297.03 850.18/297.03 Further, it can be verified that all rules not oriented are covered by the weightgap condition. 850.18/297.03 850.18/297.03 We are left with following problem, upon which TcT provides the 850.18/297.03 certificate MAYBE. 850.18/297.03 850.18/297.03 Strict Trs: 850.18/297.03 { cond(true(), x) -> cond(odd(x), p(x)) 850.18/297.03 , odd(s(0())) -> true() 850.18/297.03 , odd(s(s(x))) -> odd(x) } 850.18/297.03 Weak Trs: 850.18/297.03 { odd(0()) -> false() 850.18/297.03 , p(0()) -> 0() 850.18/297.03 , p(s(x)) -> x } 850.18/297.03 Obligation: 850.18/297.03 innermost runtime complexity 850.18/297.03 Answer: 850.18/297.03 MAYBE 850.18/297.03 850.18/297.03 The weightgap principle applies (using the following nonconstant 850.18/297.03 growth matrix-interpretation) 850.18/297.03 850.18/297.03 The following argument positions are usable: 850.18/297.03 Uargs(cond) = {1, 2} 850.18/297.03 850.18/297.03 TcT has computed the following matrix interpretation satisfying 850.18/297.03 not(EDA) and not(IDA(1)). 850.18/297.03 850.18/297.03 [cond](x1, x2) = [1] x1 + [1] x2 + [0] 850.18/297.03 850.18/297.03 [true] = [1] 850.18/297.03 850.18/297.03 [odd](x1) = [4] 850.18/297.03 850.18/297.03 [p](x1) = [1] x1 + [4] 850.18/297.03 850.18/297.03 [0] = [3] 850.18/297.03 850.18/297.03 [false] = [4] 850.18/297.03 850.18/297.03 [s](x1) = [1] x1 + [7] 850.18/297.03 850.18/297.03 The order satisfies the following ordering constraints: 850.18/297.03 850.18/297.03 [cond(true(), x)] = [1] x + [1] 850.18/297.03 ? [1] x + [8] 850.18/297.03 = [cond(odd(x), p(x))] 850.18/297.03 850.18/297.03 [odd(0())] = [4] 850.18/297.03 >= [4] 850.18/297.03 = [false()] 850.18/297.03 850.18/297.03 [odd(s(0()))] = [4] 850.18/297.03 > [1] 850.18/297.03 = [true()] 850.18/297.03 850.18/297.03 [odd(s(s(x)))] = [4] 850.18/297.03 >= [4] 850.18/297.03 = [odd(x)] 850.18/297.03 850.18/297.03 [p(0())] = [7] 850.18/297.03 > [3] 850.18/297.03 = [0()] 850.18/297.03 850.18/297.03 [p(s(x))] = [1] x + [11] 850.18/297.03 > [1] x + [0] 850.18/297.03 = [x] 850.18/297.03 850.18/297.03 850.18/297.03 Further, it can be verified that all rules not oriented are covered by the weightgap condition. 850.18/297.03 850.18/297.03 We are left with following problem, upon which TcT provides the 850.18/297.03 certificate MAYBE. 850.18/297.03 850.18/297.03 Strict Trs: 850.18/297.03 { cond(true(), x) -> cond(odd(x), p(x)) 850.18/297.03 , odd(s(s(x))) -> odd(x) } 850.18/297.03 Weak Trs: 850.18/297.03 { odd(0()) -> false() 850.18/297.03 , odd(s(0())) -> true() 850.18/297.03 , p(0()) -> 0() 850.18/297.03 , p(s(x)) -> x } 850.18/297.03 Obligation: 850.18/297.03 innermost runtime complexity 850.18/297.03 Answer: 850.18/297.03 MAYBE 850.18/297.03 850.18/297.03 None of the processors succeeded. 850.18/297.03 850.18/297.03 Details of failed attempt(s): 850.18/297.03 ----------------------------- 850.18/297.03 1) 'empty' failed due to the following reason: 850.18/297.03 850.18/297.03 Empty strict component of the problem is NOT empty. 850.18/297.03 850.18/297.03 2) 'With Problem ...' failed due to the following reason: 850.18/297.03 850.18/297.03 None of the processors succeeded. 850.18/297.03 850.18/297.03 Details of failed attempt(s): 850.18/297.03 ----------------------------- 850.18/297.03 1) 'empty' failed due to the following reason: 850.18/297.03 850.18/297.03 Empty strict component of the problem is NOT empty. 850.18/297.03 850.18/297.03 2) 'Fastest' failed due to the following reason: 850.18/297.03 850.18/297.03 None of the processors succeeded. 850.18/297.03 850.18/297.03 Details of failed attempt(s): 850.18/297.03 ----------------------------- 850.18/297.03 1) 'With Problem ...' failed due to the following reason: 850.18/297.03 850.18/297.03 None of the processors succeeded. 850.18/297.03 850.18/297.03 Details of failed attempt(s): 850.18/297.03 ----------------------------- 850.18/297.03 1) 'empty' failed due to the following reason: 850.18/297.03 850.18/297.03 Empty strict component of the problem is NOT empty. 850.18/297.03 850.18/297.03 2) 'With Problem ...' failed due to the following reason: 850.18/297.03 850.18/297.03 None of the processors succeeded. 850.18/297.03 850.18/297.03 Details of failed attempt(s): 850.18/297.03 ----------------------------- 850.18/297.03 1) 'empty' failed due to the following reason: 850.18/297.03 850.18/297.03 Empty strict component of the problem is NOT empty. 850.18/297.03 850.18/297.03 2) 'With Problem ...' failed due to the following reason: 850.18/297.03 850.18/297.03 None of the processors succeeded. 850.18/297.03 850.18/297.03 Details of failed attempt(s): 850.18/297.03 ----------------------------- 850.18/297.03 1) 'empty' failed due to the following reason: 850.18/297.03 850.18/297.03 Empty strict component of the problem is NOT empty. 850.18/297.03 850.18/297.03 2) 'With Problem ...' failed due to the following reason: 850.18/297.03 850.18/297.03 Empty strict component of the problem is NOT empty. 850.18/297.03 850.18/297.03 850.18/297.03 850.18/297.03 850.18/297.03 2) 'With Problem ...' failed due to the following reason: 850.18/297.03 850.18/297.03 None of the processors succeeded. 850.18/297.03 850.18/297.03 Details of failed attempt(s): 850.18/297.03 ----------------------------- 850.18/297.03 1) 'empty' failed due to the following reason: 850.18/297.03 850.18/297.03 Empty strict component of the problem is NOT empty. 850.18/297.03 850.18/297.03 2) 'With Problem ...' failed due to the following reason: 850.18/297.03 850.18/297.03 Empty strict component of the problem is NOT empty. 850.18/297.03 850.18/297.03 850.18/297.03 850.18/297.03 850.18/297.03 850.18/297.03 2) 'Best' failed due to the following reason: 850.18/297.03 850.18/297.03 None of the processors succeeded. 850.18/297.03 850.18/297.03 Details of failed attempt(s): 850.18/297.03 ----------------------------- 850.18/297.03 1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 850.18/297.03 following reason: 850.18/297.03 850.18/297.03 The input cannot be shown compatible 850.18/297.03 850.18/297.03 2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 850.18/297.03 to the following reason: 850.18/297.03 850.18/297.03 The input cannot be shown compatible 850.18/297.03 850.18/297.03 850.18/297.03 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 850.18/297.03 failed due to the following reason: 850.18/297.03 850.18/297.03 None of the processors succeeded. 850.18/297.03 850.18/297.03 Details of failed attempt(s): 850.18/297.03 ----------------------------- 850.18/297.03 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 850.18/297.03 failed due to the following reason: 850.18/297.03 850.18/297.03 match-boundness of the problem could not be verified. 850.18/297.03 850.18/297.03 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 850.18/297.03 failed due to the following reason: 850.18/297.03 850.18/297.03 match-boundness of the problem could not be verified. 850.18/297.03 850.18/297.03 850.18/297.03 850.18/297.03 850.18/297.03 850.18/297.03 Arrrr.. 850.63/297.45 EOF