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