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