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