MAYBE 850.46/297.05 MAYBE 850.46/297.05 850.46/297.05 We are left with following problem, upon which TcT provides the 850.46/297.05 certificate MAYBE. 850.46/297.05 850.46/297.05 Strict Trs: 850.46/297.05 { app(l, nil()) -> l 850.46/297.05 , app(nil(), k) -> k 850.46/297.05 , app(cons(x, l), k) -> cons(x, app(l, k)) 850.46/297.05 , sum(cons(x, nil())) -> cons(x, nil()) 850.46/297.05 , sum(cons(x, cons(y, l))) -> sum(cons(a(x, y, h()), l)) 850.46/297.05 , a(x, s(y), h()) -> a(x, y, s(h())) 850.46/297.05 , a(x, s(y), s(z)) -> a(x, y, a(x, s(y), z)) 850.46/297.05 , a(h(), h(), x) -> s(x) 850.46/297.05 , a(s(x), h(), z) -> a(x, z, z) } 850.46/297.05 Obligation: 850.46/297.05 innermost runtime complexity 850.46/297.05 Answer: 850.46/297.05 MAYBE 850.46/297.05 850.46/297.05 None of the processors succeeded. 850.46/297.05 850.46/297.05 Details of failed attempt(s): 850.46/297.05 ----------------------------- 850.46/297.05 1) 'empty' failed due to the following reason: 850.46/297.05 850.46/297.05 Empty strict component of the problem is NOT empty. 850.46/297.05 850.46/297.05 2) 'Best' failed due to the following reason: 850.46/297.05 850.46/297.05 None of the processors succeeded. 850.46/297.05 850.46/297.05 Details of failed attempt(s): 850.46/297.05 ----------------------------- 850.46/297.05 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 850.46/297.05 following reason: 850.46/297.05 850.46/297.05 Computation stopped due to timeout after 297.0 seconds. 850.46/297.05 850.46/297.05 2) 'Best' failed due to the following reason: 850.46/297.05 850.46/297.05 None of the processors succeeded. 850.46/297.05 850.46/297.05 Details of failed attempt(s): 850.46/297.05 ----------------------------- 850.46/297.05 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 850.46/297.05 seconds)' failed due to the following reason: 850.46/297.05 850.46/297.05 The weightgap principle applies (using the following nonconstant 850.46/297.05 growth matrix-interpretation) 850.46/297.05 850.46/297.05 The following argument positions are usable: 850.46/297.05 Uargs(cons) = {1, 2}, Uargs(sum) = {1}, Uargs(a) = {3} 850.46/297.05 850.46/297.05 TcT has computed the following matrix interpretation satisfying 850.46/297.05 not(EDA) and not(IDA(1)). 850.46/297.05 850.46/297.05 [app](x1, x2) = [1] x1 + [1] x2 + [0] 850.46/297.05 850.46/297.05 [nil] = [0] 850.46/297.05 850.46/297.05 [cons](x1, x2) = [1] x1 + [1] x2 + [0] 850.46/297.05 850.46/297.05 [sum](x1) = [1] x1 + [0] 850.46/297.05 850.46/297.05 [a](x1, x2, x3) = [1] x3 + [0] 850.46/297.05 850.46/297.05 [h] = [0] 850.46/297.05 850.46/297.05 [s](x1) = [1] x1 + [1] 850.46/297.05 850.46/297.05 The order satisfies the following ordering constraints: 850.46/297.05 850.46/297.05 [app(l, nil())] = [1] l + [0] 850.46/297.05 >= [1] l + [0] 850.46/297.05 = [l] 850.46/297.05 850.46/297.05 [app(nil(), k)] = [1] k + [0] 850.46/297.05 >= [1] k + [0] 850.46/297.05 = [k] 850.46/297.05 850.46/297.05 [app(cons(x, l), k)] = [1] k + [1] l + [1] x + [0] 850.46/297.05 >= [1] k + [1] l + [1] x + [0] 850.46/297.05 = [cons(x, app(l, k))] 850.46/297.05 850.46/297.05 [sum(cons(x, nil()))] = [1] x + [0] 850.46/297.05 >= [1] x + [0] 850.46/297.05 = [cons(x, nil())] 850.46/297.05 850.46/297.05 [sum(cons(x, cons(y, l)))] = [1] l + [1] x + [1] y + [0] 850.46/297.05 >= [1] l + [0] 850.46/297.05 = [sum(cons(a(x, y, h()), l))] 850.46/297.05 850.46/297.05 [a(x, s(y), h())] = [0] 850.46/297.05 ? [1] 850.46/297.05 = [a(x, y, s(h()))] 850.46/297.05 850.46/297.05 [a(x, s(y), s(z))] = [1] z + [1] 850.46/297.05 > [1] z + [0] 850.46/297.05 = [a(x, y, a(x, s(y), z))] 850.46/297.05 850.46/297.05 [a(h(), h(), x)] = [1] x + [0] 850.46/297.05 ? [1] x + [1] 850.46/297.05 = [s(x)] 850.46/297.05 850.46/297.05 [a(s(x), h(), z)] = [1] z + [0] 850.46/297.05 >= [1] z + [0] 850.46/297.05 = [a(x, z, z)] 850.46/297.05 850.46/297.05 850.46/297.05 Further, it can be verified that all rules not oriented are covered by the weightgap condition. 850.46/297.05 850.46/297.05 We are left with following problem, upon which TcT provides the 850.46/297.05 certificate MAYBE. 850.46/297.05 850.46/297.05 Strict Trs: 850.46/297.05 { app(l, nil()) -> l 850.46/297.05 , app(nil(), k) -> k 850.46/297.05 , app(cons(x, l), k) -> cons(x, app(l, k)) 850.46/297.05 , sum(cons(x, nil())) -> cons(x, nil()) 850.46/297.05 , sum(cons(x, cons(y, l))) -> sum(cons(a(x, y, h()), l)) 850.46/297.05 , a(x, s(y), h()) -> a(x, y, s(h())) 850.46/297.05 , a(h(), h(), x) -> s(x) 850.46/297.05 , a(s(x), h(), z) -> a(x, z, z) } 850.46/297.05 Weak Trs: { a(x, s(y), s(z)) -> a(x, y, a(x, s(y), z)) } 850.46/297.05 Obligation: 850.46/297.05 innermost runtime complexity 850.46/297.05 Answer: 850.46/297.05 MAYBE 850.46/297.05 850.46/297.05 The weightgap principle applies (using the following nonconstant 850.46/297.05 growth matrix-interpretation) 850.46/297.05 850.46/297.05 The following argument positions are usable: 850.46/297.05 Uargs(cons) = {1, 2}, Uargs(sum) = {1}, Uargs(a) = {3} 850.46/297.05 850.46/297.05 TcT has computed the following matrix interpretation satisfying 850.46/297.05 not(EDA) and not(IDA(1)). 850.46/297.05 850.46/297.05 [app](x1, x2) = [1] x1 + [1] x2 + [0] 850.46/297.05 850.46/297.05 [nil] = [0] 850.46/297.05 850.46/297.05 [cons](x1, x2) = [1] x1 + [1] x2 + [0] 850.46/297.05 850.46/297.05 [sum](x1) = [1] x1 + [4] 850.46/297.05 850.46/297.05 [a](x1, x2, x3) = [1] x3 + [0] 850.46/297.05 850.46/297.05 [h] = [0] 850.46/297.05 850.46/297.05 [s](x1) = [1] x1 + [0] 850.46/297.05 850.46/297.05 The order satisfies the following ordering constraints: 850.46/297.05 850.46/297.05 [app(l, nil())] = [1] l + [0] 850.46/297.05 >= [1] l + [0] 850.46/297.05 = [l] 850.46/297.05 850.46/297.05 [app(nil(), k)] = [1] k + [0] 850.46/297.05 >= [1] k + [0] 850.46/297.05 = [k] 850.46/297.05 850.46/297.05 [app(cons(x, l), k)] = [1] k + [1] l + [1] x + [0] 850.46/297.05 >= [1] k + [1] l + [1] x + [0] 850.46/297.05 = [cons(x, app(l, k))] 850.46/297.05 850.46/297.05 [sum(cons(x, nil()))] = [1] x + [4] 850.46/297.05 > [1] x + [0] 850.46/297.05 = [cons(x, nil())] 850.46/297.05 850.46/297.05 [sum(cons(x, cons(y, l)))] = [1] l + [1] x + [1] y + [4] 850.46/297.05 >= [1] l + [4] 850.46/297.05 = [sum(cons(a(x, y, h()), l))] 850.46/297.05 850.46/297.05 [a(x, s(y), h())] = [0] 850.46/297.05 >= [0] 850.46/297.05 = [a(x, y, s(h()))] 850.46/297.05 850.46/297.05 [a(x, s(y), s(z))] = [1] z + [0] 850.46/297.05 >= [1] z + [0] 850.46/297.05 = [a(x, y, a(x, s(y), z))] 850.46/297.05 850.46/297.05 [a(h(), h(), x)] = [1] x + [0] 850.46/297.05 >= [1] x + [0] 850.46/297.05 = [s(x)] 850.46/297.05 850.46/297.05 [a(s(x), h(), z)] = [1] z + [0] 850.46/297.05 >= [1] z + [0] 850.46/297.05 = [a(x, z, z)] 850.46/297.05 850.46/297.05 850.46/297.05 Further, it can be verified that all rules not oriented are covered by the weightgap condition. 850.46/297.05 850.46/297.05 We are left with following problem, upon which TcT provides the 850.46/297.05 certificate MAYBE. 850.46/297.05 850.46/297.05 Strict Trs: 850.46/297.05 { app(l, nil()) -> l 850.46/297.05 , app(nil(), k) -> k 850.46/297.05 , app(cons(x, l), k) -> cons(x, app(l, k)) 850.46/297.05 , sum(cons(x, cons(y, l))) -> sum(cons(a(x, y, h()), l)) 850.46/297.05 , a(x, s(y), h()) -> a(x, y, s(h())) 850.46/297.05 , a(h(), h(), x) -> s(x) 850.46/297.05 , a(s(x), h(), z) -> a(x, z, z) } 850.46/297.05 Weak Trs: 850.46/297.05 { sum(cons(x, nil())) -> cons(x, nil()) 850.46/297.05 , a(x, s(y), s(z)) -> a(x, y, a(x, s(y), z)) } 850.46/297.05 Obligation: 850.46/297.05 innermost runtime complexity 850.46/297.05 Answer: 850.46/297.05 MAYBE 850.46/297.05 850.46/297.05 The weightgap principle applies (using the following nonconstant 850.46/297.05 growth matrix-interpretation) 850.46/297.05 850.46/297.05 The following argument positions are usable: 850.46/297.05 Uargs(cons) = {1, 2}, Uargs(sum) = {1}, Uargs(a) = {3} 850.46/297.05 850.46/297.05 TcT has computed the following matrix interpretation satisfying 850.46/297.05 not(EDA) and not(IDA(1)). 850.46/297.05 850.46/297.05 [app](x1, x2) = [1] x1 + [1] x2 + [1] 850.46/297.05 850.46/297.05 [nil] = [0] 850.46/297.05 850.46/297.05 [cons](x1, x2) = [1] x1 + [1] x2 + [0] 850.46/297.05 850.46/297.05 [sum](x1) = [1] x1 + [0] 850.46/297.05 850.46/297.05 [a](x1, x2, x3) = [1] x3 + [0] 850.46/297.05 850.46/297.05 [h] = [0] 850.46/297.05 850.46/297.05 [s](x1) = [1] x1 + [0] 850.46/297.05 850.46/297.05 The order satisfies the following ordering constraints: 850.46/297.05 850.46/297.05 [app(l, nil())] = [1] l + [1] 850.46/297.05 > [1] l + [0] 850.46/297.05 = [l] 850.46/297.05 850.46/297.05 [app(nil(), k)] = [1] k + [1] 850.46/297.05 > [1] k + [0] 850.46/297.05 = [k] 850.46/297.05 850.46/297.05 [app(cons(x, l), k)] = [1] k + [1] l + [1] x + [1] 850.46/297.05 >= [1] k + [1] l + [1] x + [1] 850.46/297.05 = [cons(x, app(l, k))] 850.46/297.05 850.46/297.05 [sum(cons(x, nil()))] = [1] x + [0] 850.46/297.05 >= [1] x + [0] 850.46/297.05 = [cons(x, nil())] 850.46/297.05 850.46/297.05 [sum(cons(x, cons(y, l)))] = [1] l + [1] x + [1] y + [0] 850.46/297.05 >= [1] l + [0] 850.46/297.05 = [sum(cons(a(x, y, h()), l))] 850.46/297.05 850.46/297.05 [a(x, s(y), h())] = [0] 850.46/297.05 >= [0] 850.46/297.05 = [a(x, y, s(h()))] 850.46/297.05 850.46/297.05 [a(x, s(y), s(z))] = [1] z + [0] 850.46/297.05 >= [1] z + [0] 850.46/297.05 = [a(x, y, a(x, s(y), z))] 850.46/297.05 850.46/297.05 [a(h(), h(), x)] = [1] x + [0] 850.46/297.05 >= [1] x + [0] 850.46/297.05 = [s(x)] 850.46/297.05 850.46/297.05 [a(s(x), h(), z)] = [1] z + [0] 850.46/297.05 >= [1] z + [0] 850.46/297.05 = [a(x, z, z)] 850.46/297.05 850.46/297.05 850.46/297.05 Further, it can be verified that all rules not oriented are covered by the weightgap condition. 850.46/297.05 850.46/297.05 We are left with following problem, upon which TcT provides the 850.46/297.05 certificate MAYBE. 850.46/297.05 850.46/297.05 Strict Trs: 850.46/297.05 { app(cons(x, l), k) -> cons(x, app(l, k)) 850.46/297.05 , sum(cons(x, cons(y, l))) -> sum(cons(a(x, y, h()), l)) 850.46/297.05 , a(x, s(y), h()) -> a(x, y, s(h())) 850.46/297.05 , a(h(), h(), x) -> s(x) 850.46/297.05 , a(s(x), h(), z) -> a(x, z, z) } 850.46/297.05 Weak Trs: 850.46/297.05 { app(l, nil()) -> l 850.46/297.05 , app(nil(), k) -> k 850.46/297.05 , sum(cons(x, nil())) -> cons(x, nil()) 850.46/297.05 , a(x, s(y), s(z)) -> a(x, y, a(x, s(y), z)) } 850.46/297.05 Obligation: 850.46/297.05 innermost runtime complexity 850.46/297.05 Answer: 850.46/297.05 MAYBE 850.46/297.05 850.46/297.05 The weightgap principle applies (using the following nonconstant 850.46/297.05 growth matrix-interpretation) 850.46/297.05 850.46/297.05 The following argument positions are usable: 850.46/297.05 Uargs(cons) = {1, 2}, Uargs(sum) = {1}, Uargs(a) = {3} 850.46/297.05 850.46/297.05 TcT has computed the following matrix interpretation satisfying 850.46/297.05 not(EDA) and not(IDA(1)). 850.46/297.05 850.46/297.05 [app](x1, x2) = [1] x1 + [1] x2 + [0] 850.46/297.05 850.46/297.05 [nil] = [7] 850.46/297.05 850.46/297.05 [cons](x1, x2) = [1] x1 + [1] x2 + [1] 850.46/297.05 850.46/297.05 [sum](x1) = [1] x1 + [3] 850.46/297.05 850.46/297.05 [a](x1, x2, x3) = [1] x3 + [0] 850.46/297.05 850.46/297.05 [h] = [0] 850.46/297.05 850.46/297.05 [s](x1) = [1] x1 + [0] 850.46/297.05 850.46/297.05 The order satisfies the following ordering constraints: 850.46/297.05 850.46/297.05 [app(l, nil())] = [1] l + [7] 850.46/297.05 > [1] l + [0] 850.46/297.05 = [l] 850.46/297.05 850.46/297.05 [app(nil(), k)] = [1] k + [7] 850.46/297.05 > [1] k + [0] 850.46/297.06 = [k] 850.46/297.06 850.46/297.06 [app(cons(x, l), k)] = [1] k + [1] l + [1] x + [1] 850.46/297.06 >= [1] k + [1] l + [1] x + [1] 850.46/297.06 = [cons(x, app(l, k))] 850.46/297.06 850.46/297.06 [sum(cons(x, nil()))] = [1] x + [11] 850.46/297.06 > [1] x + [8] 850.46/297.06 = [cons(x, nil())] 850.46/297.06 850.46/297.06 [sum(cons(x, cons(y, l)))] = [1] l + [1] x + [1] y + [5] 850.46/297.06 > [1] l + [4] 850.46/297.06 = [sum(cons(a(x, y, h()), l))] 850.46/297.06 850.46/297.06 [a(x, s(y), h())] = [0] 850.46/297.06 >= [0] 850.46/297.06 = [a(x, y, s(h()))] 850.46/297.06 850.46/297.06 [a(x, s(y), s(z))] = [1] z + [0] 850.46/297.06 >= [1] z + [0] 850.46/297.06 = [a(x, y, a(x, s(y), z))] 850.46/297.06 850.46/297.06 [a(h(), h(), x)] = [1] x + [0] 850.46/297.06 >= [1] x + [0] 850.46/297.06 = [s(x)] 850.46/297.06 850.46/297.06 [a(s(x), h(), z)] = [1] z + [0] 850.46/297.06 >= [1] z + [0] 850.46/297.06 = [a(x, z, z)] 850.46/297.06 850.46/297.06 850.46/297.06 Further, it can be verified that all rules not oriented are covered by the weightgap condition. 850.46/297.06 850.46/297.06 We are left with following problem, upon which TcT provides the 850.46/297.06 certificate MAYBE. 850.46/297.06 850.46/297.06 Strict Trs: 850.46/297.06 { app(cons(x, l), k) -> cons(x, app(l, k)) 850.46/297.06 , a(x, s(y), h()) -> a(x, y, s(h())) 850.46/297.06 , a(h(), h(), x) -> s(x) 850.46/297.06 , a(s(x), h(), z) -> a(x, z, z) } 850.46/297.06 Weak Trs: 850.46/297.06 { app(l, nil()) -> l 850.46/297.06 , app(nil(), k) -> k 850.46/297.06 , sum(cons(x, nil())) -> cons(x, nil()) 850.46/297.06 , sum(cons(x, cons(y, l))) -> sum(cons(a(x, y, h()), l)) 850.46/297.06 , a(x, s(y), s(z)) -> a(x, y, a(x, s(y), z)) } 850.46/297.06 Obligation: 850.46/297.06 innermost runtime complexity 850.46/297.06 Answer: 850.46/297.06 MAYBE 850.46/297.06 850.46/297.06 We use the processor 'matrix interpretation of dimension 1' to 850.46/297.06 orient following rules strictly. 850.46/297.06 850.46/297.06 Trs: { app(cons(x, l), k) -> cons(x, app(l, k)) } 850.46/297.06 850.46/297.06 The induced complexity on above rules (modulo remaining rules) is 850.46/297.06 YES(?,O(n^1)) . These rules are moved into the corresponding weak 850.46/297.06 component(s). 850.46/297.06 850.46/297.06 Sub-proof: 850.46/297.06 ---------- 850.46/297.06 The following argument positions are usable: 850.46/297.06 Uargs(cons) = {1, 2}, Uargs(sum) = {1}, Uargs(a) = {3} 850.46/297.06 850.46/297.06 TcT has computed the following constructor-based matrix 850.46/297.06 interpretation satisfying not(EDA). 850.46/297.06 850.46/297.06 [app](x1, x2) = [2] x1 + [1] x2 + [0] 850.46/297.06 850.46/297.06 [nil] = [1] 850.46/297.06 850.46/297.06 [cons](x1, x2) = [1] x1 + [1] x2 + [2] 850.46/297.06 850.46/297.06 [sum](x1) = [1] x1 + [1] 850.46/297.06 850.46/297.06 [a](x1, x2, x3) = [1] x3 + [0] 850.46/297.06 850.46/297.06 [h] = [0] 850.46/297.06 850.46/297.06 [s](x1) = [1] x1 + [0] 850.46/297.06 850.46/297.06 The order satisfies the following ordering constraints: 850.46/297.06 850.46/297.06 [app(l, nil())] = [2] l + [1] 850.46/297.06 > [1] l + [0] 850.46/297.06 = [l] 850.46/297.06 850.46/297.06 [app(nil(), k)] = [1] k + [2] 850.46/297.06 > [1] k + [0] 850.46/297.06 = [k] 850.46/297.06 850.46/297.06 [app(cons(x, l), k)] = [1] k + [2] l + [2] x + [4] 850.46/297.06 > [1] k + [2] l + [1] x + [2] 850.46/297.06 = [cons(x, app(l, k))] 850.46/297.06 850.46/297.06 [sum(cons(x, nil()))] = [1] x + [4] 850.46/297.06 > [1] x + [3] 850.46/297.06 = [cons(x, nil())] 850.46/297.06 850.46/297.06 [sum(cons(x, cons(y, l)))] = [1] l + [1] x + [1] y + [5] 850.46/297.06 > [1] l + [3] 850.46/297.06 = [sum(cons(a(x, y, h()), l))] 850.46/297.06 850.46/297.06 [a(x, s(y), h())] = [0] 850.46/297.06 >= [0] 850.46/297.06 = [a(x, y, s(h()))] 850.46/297.06 850.46/297.06 [a(x, s(y), s(z))] = [1] z + [0] 850.46/297.06 >= [1] z + [0] 850.46/297.06 = [a(x, y, a(x, s(y), z))] 850.46/297.06 850.46/297.06 [a(h(), h(), x)] = [1] x + [0] 850.46/297.06 >= [1] x + [0] 850.46/297.06 = [s(x)] 850.46/297.06 850.46/297.06 [a(s(x), h(), z)] = [1] z + [0] 850.46/297.06 >= [1] z + [0] 850.46/297.06 = [a(x, z, z)] 850.46/297.06 850.46/297.06 850.46/297.06 We return to the main proof. 850.46/297.06 850.46/297.06 We are left with following problem, upon which TcT provides the 850.46/297.06 certificate MAYBE. 850.46/297.06 850.46/297.06 Strict Trs: 850.46/297.06 { a(x, s(y), h()) -> a(x, y, s(h())) 850.46/297.06 , a(h(), h(), x) -> s(x) 850.46/297.06 , a(s(x), h(), z) -> a(x, z, z) } 850.46/297.06 Weak Trs: 850.46/297.06 { app(l, nil()) -> l 850.46/297.06 , app(nil(), k) -> k 850.46/297.06 , app(cons(x, l), k) -> cons(x, app(l, k)) 850.46/297.06 , sum(cons(x, nil())) -> cons(x, nil()) 850.46/297.06 , sum(cons(x, cons(y, l))) -> sum(cons(a(x, y, h()), l)) 850.46/297.06 , a(x, s(y), s(z)) -> a(x, y, a(x, s(y), z)) } 850.46/297.06 Obligation: 850.46/297.06 innermost runtime complexity 850.46/297.06 Answer: 850.46/297.06 MAYBE 850.46/297.06 850.46/297.06 None of the processors succeeded. 850.46/297.06 850.46/297.06 Details of failed attempt(s): 850.46/297.06 ----------------------------- 850.46/297.06 1) 'empty' failed due to the following reason: 850.46/297.06 850.46/297.06 Empty strict component of the problem is NOT empty. 850.46/297.06 850.46/297.06 2) 'With Problem ...' failed due to the following reason: 850.46/297.06 850.46/297.06 None of the processors succeeded. 850.46/297.06 850.46/297.06 Details of failed attempt(s): 850.46/297.06 ----------------------------- 850.46/297.06 1) 'empty' failed due to the following reason: 850.46/297.06 850.46/297.06 Empty strict component of the problem is NOT empty. 850.46/297.06 850.46/297.06 2) 'Fastest' failed due to the following reason: 850.46/297.06 850.46/297.06 None of the processors succeeded. 850.46/297.06 850.46/297.06 Details of failed attempt(s): 850.46/297.06 ----------------------------- 850.46/297.06 1) 'With Problem ...' failed due to the following reason: 850.46/297.06 850.46/297.06 None of the processors succeeded. 850.46/297.06 850.46/297.06 Details of failed attempt(s): 850.46/297.06 ----------------------------- 850.46/297.06 1) 'empty' failed due to the following reason: 850.46/297.06 850.46/297.06 Empty strict component of the problem is NOT empty. 850.46/297.06 850.46/297.06 2) 'With Problem ...' failed due to the following reason: 850.46/297.06 850.46/297.06 Empty strict component of the problem is NOT empty. 850.46/297.06 850.46/297.06 850.46/297.06 2) 'With Problem ...' failed due to the following reason: 850.46/297.06 850.46/297.06 None of the processors succeeded. 850.46/297.06 850.46/297.06 Details of failed attempt(s): 850.46/297.06 ----------------------------- 850.46/297.06 1) 'empty' failed due to the following reason: 850.46/297.06 850.46/297.06 Empty strict component of the problem is NOT empty. 850.46/297.06 850.46/297.06 2) 'With Problem ...' failed due to the following reason: 850.46/297.06 850.46/297.06 None of the processors succeeded. 850.46/297.06 850.46/297.06 Details of failed attempt(s): 850.46/297.06 ----------------------------- 850.46/297.06 1) 'empty' failed due to the following reason: 850.46/297.06 850.46/297.06 Empty strict component of the problem is NOT empty. 850.46/297.06 850.46/297.06 2) 'With Problem ...' failed due to the following reason: 850.46/297.06 850.46/297.06 None of the processors succeeded. 850.46/297.06 850.46/297.06 Details of failed attempt(s): 850.46/297.06 ----------------------------- 850.46/297.06 1) 'empty' failed due to the following reason: 850.46/297.06 850.46/297.06 Empty strict component of the problem is NOT empty. 850.46/297.06 850.46/297.06 2) 'With Problem ...' failed due to the following reason: 850.46/297.06 850.46/297.06 Empty strict component of the problem is NOT empty. 850.46/297.06 850.46/297.06 850.46/297.06 850.46/297.06 850.46/297.06 850.46/297.06 850.46/297.06 850.46/297.06 2) 'Best' failed due to the following reason: 850.46/297.06 850.46/297.06 None of the processors succeeded. 850.46/297.06 850.46/297.06 Details of failed attempt(s): 850.46/297.06 ----------------------------- 850.46/297.06 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 850.46/297.06 to the following reason: 850.46/297.06 850.46/297.06 The input cannot be shown compatible 850.46/297.06 850.46/297.06 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 850.46/297.06 following reason: 850.46/297.06 850.46/297.06 The input cannot be shown compatible 850.46/297.06 850.46/297.06 850.46/297.06 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 850.46/297.06 failed due to the following reason: 850.46/297.06 850.46/297.06 None of the processors succeeded. 850.46/297.06 850.46/297.06 Details of failed attempt(s): 850.46/297.06 ----------------------------- 850.46/297.06 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 850.46/297.06 failed due to the following reason: 850.46/297.06 850.46/297.06 match-boundness of the problem could not be verified. 850.46/297.06 850.46/297.06 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 850.46/297.06 failed due to the following reason: 850.46/297.06 850.46/297.06 match-boundness of the problem could not be verified. 850.46/297.06 850.46/297.06 850.46/297.06 850.46/297.06 850.46/297.06 850.46/297.06 Arrrr.. 850.96/297.43 EOF