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