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