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