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