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