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