MAYBE 405.95/135.64 MAYBE 405.95/135.64 405.95/135.64 We are left with following problem, upon which TcT provides the 405.95/135.64 certificate MAYBE. 405.95/135.64 405.95/135.64 Strict Trs: 405.95/135.64 { g(x, x, x) -> g(c(), d(), e()) 405.95/135.64 , g(x, y, x) -> g(c(), d(), e()) 405.95/135.64 , s(y) -> b() 405.95/135.64 , s(f(x, y)) -> f(y, f(s(s(x)), a())) 405.95/135.64 , f(x, g(x, a(), f(s(x), y))) -> f(h(x, b()), g(a(), b(), y)) 405.95/135.64 , f(x, f(y, f(x, y))) -> f(a(), f(x, f(y, b()))) 405.95/135.64 , f(h(a(), y), g(x, b(), a())) -> h(f(x, s(y)), s(b())) 405.95/135.64 , h(f(x, s(y)), b()) -> f(a(), g(y, a(), f(s(x), a()))) 405.95/135.64 , h(h(x, a()), y) -> h(h(a(), y), h(a(), x)) } 405.95/135.64 Obligation: 405.95/135.64 derivational complexity 405.95/135.64 Answer: 405.95/135.64 MAYBE 405.95/135.64 405.95/135.64 None of the processors succeeded. 405.95/135.64 405.95/135.64 Details of failed attempt(s): 405.95/135.64 ----------------------------- 405.95/135.64 1) 'Inspecting Problem... (timeout of 297 seconds)' failed due to 405.95/135.64 the following reason: 405.95/135.64 405.95/135.64 The weightgap principle applies (using the following nonconstant 405.95/135.64 growth matrix-interpretation) 405.95/135.64 405.95/135.64 TcT has computed the following triangular matrix interpretation. 405.95/135.64 Note that the diagonal of the component-wise maxima of 405.95/135.64 interpretation-entries contains no more than 1 non-zero entries. 405.95/135.65 405.95/135.65 [g](x1, x2, x3) = [1] x1 + [1] x2 + [1] x3 + [1] 405.95/135.65 405.95/135.65 [c] = [2] 405.95/135.65 405.95/135.65 [d] = [2] 405.95/135.65 405.95/135.65 [e] = [1] 405.95/135.65 405.95/135.65 [s](x1) = [1] x1 + [0] 405.95/135.65 405.95/135.65 [f](x1, x2) = [1] x1 + [1] x2 + [0] 405.95/135.65 405.95/135.65 [a] = [0] 405.95/135.65 405.95/135.65 [h](x1, x2) = [1] x1 + [1] x2 + [0] 405.95/135.65 405.95/135.65 [b] = [0] 405.95/135.65 405.95/135.65 The order satisfies the following ordering constraints: 405.95/135.65 405.95/135.65 [g(x, x, x)] = [3] x + [1] 405.95/135.65 ? [6] 405.95/135.65 = [g(c(), d(), e())] 405.95/135.65 405.95/135.65 [g(x, y, x)] = [2] x + [1] y + [1] 405.95/135.65 ? [6] 405.95/135.65 = [g(c(), d(), e())] 405.95/135.65 405.95/135.65 [s(y)] = [1] y + [0] 405.95/135.65 >= [0] 405.95/135.65 = [b()] 405.95/135.65 405.95/135.65 [s(f(x, y))] = [1] x + [1] y + [0] 405.95/135.65 >= [1] x + [1] y + [0] 405.95/135.65 = [f(y, f(s(s(x)), a()))] 405.95/135.65 405.95/135.65 [f(x, g(x, a(), f(s(x), y)))] = [3] x + [1] y + [1] 405.95/135.65 >= [1] x + [1] y + [1] 405.95/135.65 = [f(h(x, b()), g(a(), b(), y))] 405.95/135.65 405.95/135.65 [f(x, f(y, f(x, y)))] = [2] x + [2] y + [0] 405.95/135.65 >= [1] x + [1] y + [0] 405.95/135.65 = [f(a(), f(x, f(y, b())))] 405.95/135.65 405.95/135.65 [f(h(a(), y), g(x, b(), a()))] = [1] x + [1] y + [1] 405.95/135.65 > [1] x + [1] y + [0] 405.95/135.65 = [h(f(x, s(y)), s(b()))] 405.95/135.65 405.95/135.65 [h(f(x, s(y)), b())] = [1] x + [1] y + [0] 405.95/135.65 ? [1] x + [1] y + [1] 405.95/135.65 = [f(a(), g(y, a(), f(s(x), a())))] 405.95/135.65 405.95/135.65 [h(h(x, a()), y)] = [1] x + [1] y + [0] 405.95/135.65 >= [1] x + [1] y + [0] 405.95/135.65 = [h(h(a(), y), h(a(), x))] 405.95/135.65 405.95/135.65 405.95/135.65 Further, it can be verified that all rules not oriented are covered by the weightgap condition. 405.95/135.65 405.95/135.65 We are left with following problem, upon which TcT provides the 405.95/135.65 certificate MAYBE. 405.95/135.65 405.95/135.65 Strict Trs: 405.95/135.65 { g(x, x, x) -> g(c(), d(), e()) 405.95/135.65 , g(x, y, x) -> g(c(), d(), e()) 405.95/135.65 , s(y) -> b() 405.95/135.65 , s(f(x, y)) -> f(y, f(s(s(x)), a())) 405.95/135.65 , f(x, g(x, a(), f(s(x), y))) -> f(h(x, b()), g(a(), b(), y)) 405.95/135.65 , f(x, f(y, f(x, y))) -> f(a(), f(x, f(y, b()))) 405.95/135.65 , h(f(x, s(y)), b()) -> f(a(), g(y, a(), f(s(x), a()))) 405.95/135.65 , h(h(x, a()), y) -> h(h(a(), y), h(a(), x)) } 405.95/135.65 Weak Trs: { f(h(a(), y), g(x, b(), a())) -> h(f(x, s(y)), s(b())) } 405.95/135.65 Obligation: 405.95/135.65 derivational complexity 405.95/135.65 Answer: 405.95/135.65 MAYBE 405.95/135.65 405.95/135.65 The weightgap principle applies (using the following nonconstant 405.95/135.65 growth matrix-interpretation) 405.95/135.65 405.95/135.65 TcT has computed the following triangular matrix interpretation. 405.95/135.65 Note that the diagonal of the component-wise maxima of 405.95/135.65 interpretation-entries contains no more than 1 non-zero entries. 405.95/135.65 405.95/135.65 [g](x1, x2, x3) = [1] x1 + [1] x2 + [1] x3 + [0] 405.95/135.65 405.95/135.65 [c] = [1] 405.95/135.65 405.95/135.65 [d] = [2] 405.95/135.65 405.95/135.65 [e] = [0] 405.95/135.65 405.95/135.65 [s](x1) = [1] x1 + [0] 405.95/135.65 405.95/135.65 [f](x1, x2) = [1] x1 + [1] x2 + [0] 405.95/135.65 405.95/135.65 [a] = [0] 405.95/135.65 405.95/135.65 [h](x1, x2) = [1] x1 + [1] x2 + [1] 405.95/135.65 405.95/135.65 [b] = [0] 405.95/135.65 405.95/135.65 The order satisfies the following ordering constraints: 405.95/135.65 405.95/135.65 [g(x, x, x)] = [3] x + [0] 405.95/135.65 ? [3] 405.95/135.65 = [g(c(), d(), e())] 405.95/135.65 405.95/135.65 [g(x, y, x)] = [2] x + [1] y + [0] 405.95/135.65 ? [3] 405.95/135.65 = [g(c(), d(), e())] 405.95/135.65 405.95/135.65 [s(y)] = [1] y + [0] 405.95/135.65 >= [0] 405.95/135.65 = [b()] 405.95/135.65 405.95/135.65 [s(f(x, y))] = [1] x + [1] y + [0] 405.95/135.65 >= [1] x + [1] y + [0] 405.95/135.65 = [f(y, f(s(s(x)), a()))] 405.95/135.65 405.95/135.65 [f(x, g(x, a(), f(s(x), y)))] = [3] x + [1] y + [0] 405.95/135.65 ? [1] x + [1] y + [1] 405.95/135.65 = [f(h(x, b()), g(a(), b(), y))] 405.95/135.65 405.95/135.65 [f(x, f(y, f(x, y)))] = [2] x + [2] y + [0] 405.95/135.65 >= [1] x + [1] y + [0] 405.95/135.65 = [f(a(), f(x, f(y, b())))] 405.95/135.65 405.95/135.65 [f(h(a(), y), g(x, b(), a()))] = [1] x + [1] y + [1] 405.95/135.65 >= [1] x + [1] y + [1] 405.95/135.65 = [h(f(x, s(y)), s(b()))] 405.95/135.65 405.95/135.65 [h(f(x, s(y)), b())] = [1] x + [1] y + [1] 405.95/135.65 > [1] x + [1] y + [0] 405.95/135.65 = [f(a(), g(y, a(), f(s(x), a())))] 405.95/135.65 405.95/135.65 [h(h(x, a()), y)] = [1] x + [1] y + [2] 405.95/135.65 ? [1] x + [1] y + [3] 405.95/135.65 = [h(h(a(), y), h(a(), x))] 405.95/135.65 405.95/135.65 405.95/135.65 Further, it can be verified that all rules not oriented are covered by the weightgap condition. 405.95/135.65 405.95/135.65 We are left with following problem, upon which TcT provides the 405.95/135.65 certificate MAYBE. 405.95/135.65 405.95/135.65 Strict Trs: 405.95/135.65 { g(x, x, x) -> g(c(), d(), e()) 405.95/135.65 , g(x, y, x) -> g(c(), d(), e()) 405.95/135.65 , s(y) -> b() 405.95/135.65 , s(f(x, y)) -> f(y, f(s(s(x)), a())) 405.95/135.65 , f(x, g(x, a(), f(s(x), y))) -> f(h(x, b()), g(a(), b(), y)) 405.95/135.65 , f(x, f(y, f(x, y))) -> f(a(), f(x, f(y, b()))) 405.95/135.65 , h(h(x, a()), y) -> h(h(a(), y), h(a(), x)) } 405.95/135.65 Weak Trs: 405.95/135.65 { f(h(a(), y), g(x, b(), a())) -> h(f(x, s(y)), s(b())) 405.95/135.65 , h(f(x, s(y)), b()) -> f(a(), g(y, a(), f(s(x), a()))) } 405.95/135.65 Obligation: 405.95/135.65 derivational complexity 405.95/135.65 Answer: 405.95/135.65 MAYBE 405.95/135.65 405.95/135.65 The weightgap principle applies (using the following nonconstant 405.95/135.65 growth matrix-interpretation) 405.95/135.65 405.95/135.65 TcT has computed the following triangular matrix interpretation. 405.95/135.65 Note that the diagonal of the component-wise maxima of 405.95/135.65 interpretation-entries contains no more than 1 non-zero entries. 405.95/135.65 405.95/135.65 [g](x1, x2, x3) = [1] x1 + [1] x2 + [1] x3 + [2] 405.95/135.65 405.95/135.65 [c] = [2] 405.95/135.65 405.95/135.65 [d] = [2] 405.95/135.65 405.95/135.65 [e] = [1] 405.95/135.65 405.95/135.65 [s](x1) = [1] x1 + [1] 405.95/135.65 405.95/135.65 [f](x1, x2) = [1] x1 + [1] x2 + [0] 405.95/135.65 405.95/135.65 [a] = [0] 405.95/135.65 405.95/135.65 [h](x1, x2) = [1] x1 + [1] x2 + [2] 405.95/135.65 405.95/135.65 [b] = [0] 405.95/135.65 405.95/135.65 The order satisfies the following ordering constraints: 405.95/135.65 405.95/135.65 [g(x, x, x)] = [3] x + [2] 405.95/135.65 ? [7] 405.95/135.65 = [g(c(), d(), e())] 405.95/135.65 405.95/135.65 [g(x, y, x)] = [2] x + [1] y + [2] 405.95/135.65 ? [7] 405.95/135.65 = [g(c(), d(), e())] 405.95/135.65 405.95/135.65 [s(y)] = [1] y + [1] 405.95/135.65 > [0] 405.95/135.65 = [b()] 405.95/135.65 405.95/135.65 [s(f(x, y))] = [1] x + [1] y + [1] 405.95/135.65 ? [1] x + [1] y + [2] 405.95/135.65 = [f(y, f(s(s(x)), a()))] 405.95/135.65 405.95/135.65 [f(x, g(x, a(), f(s(x), y)))] = [3] x + [1] y + [3] 405.95/135.65 ? [1] x + [1] y + [4] 405.95/135.65 = [f(h(x, b()), g(a(), b(), y))] 405.95/135.65 405.95/135.65 [f(x, f(y, f(x, y)))] = [2] x + [2] y + [0] 405.95/135.65 >= [1] x + [1] y + [0] 405.95/135.65 = [f(a(), f(x, f(y, b())))] 405.95/135.65 405.95/135.65 [f(h(a(), y), g(x, b(), a()))] = [1] x + [1] y + [4] 405.95/135.65 >= [1] x + [1] y + [4] 405.95/135.65 = [h(f(x, s(y)), s(b()))] 405.95/135.65 405.95/135.65 [h(f(x, s(y)), b())] = [1] x + [1] y + [3] 405.95/135.65 >= [1] x + [1] y + [3] 405.95/135.65 = [f(a(), g(y, a(), f(s(x), a())))] 405.95/135.65 405.95/135.65 [h(h(x, a()), y)] = [1] x + [1] y + [4] 405.95/135.65 ? [1] x + [1] y + [6] 405.95/135.65 = [h(h(a(), y), h(a(), x))] 405.95/135.65 405.95/135.65 405.95/135.65 Further, it can be verified that all rules not oriented are covered by the weightgap condition. 405.95/135.65 405.95/135.65 We are left with following problem, upon which TcT provides the 405.95/135.65 certificate MAYBE. 405.95/135.65 405.95/135.65 Strict Trs: 405.95/135.65 { g(x, x, x) -> g(c(), d(), e()) 405.95/135.65 , g(x, y, x) -> g(c(), d(), e()) 405.95/135.65 , s(f(x, y)) -> f(y, f(s(s(x)), a())) 405.95/135.65 , f(x, g(x, a(), f(s(x), y))) -> f(h(x, b()), g(a(), b(), y)) 405.95/135.65 , f(x, f(y, f(x, y))) -> f(a(), f(x, f(y, b()))) 405.95/135.65 , h(h(x, a()), y) -> h(h(a(), y), h(a(), x)) } 405.95/135.65 Weak Trs: 405.95/135.65 { s(y) -> b() 405.95/135.65 , f(h(a(), y), g(x, b(), a())) -> h(f(x, s(y)), s(b())) 405.95/135.65 , h(f(x, s(y)), b()) -> f(a(), g(y, a(), f(s(x), a()))) } 405.95/135.65 Obligation: 405.95/135.65 derivational complexity 405.95/135.65 Answer: 405.95/135.65 MAYBE 405.95/135.65 405.95/135.65 The weightgap principle applies (using the following nonconstant 405.95/135.65 growth matrix-interpretation) 405.95/135.65 405.95/135.65 TcT has computed the following triangular matrix interpretation. 405.95/135.65 Note that the diagonal of the component-wise maxima of 405.95/135.65 interpretation-entries contains no more than 1 non-zero entries. 405.95/135.65 405.95/135.65 [1 2 1 0] [1 0 0 0] [1 0 0 0] [0] 405.95/135.65 [g](x1, x2, x3) = [0 0 0 0] x1 + [0 0 1 0] x2 + [0 0 0 0] x3 + [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 405.95/135.65 [2] 405.95/135.65 [c] = [0] 405.95/135.65 [0] 405.95/135.65 [0] 405.95/135.65 405.95/135.65 [0] 405.95/135.65 [d] = [2] 405.95/135.65 [0] 405.95/135.65 [0] 405.95/135.65 405.95/135.65 [0] 405.95/135.65 [e] = [1] 405.95/135.65 [0] 405.95/135.65 [0] 405.95/135.65 405.95/135.65 [1 2 1 0] [0] 405.95/135.65 [s](x1) = [0 0 0 0] x1 + [0] 405.95/135.65 [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [1] 405.95/135.65 405.95/135.65 [1 2 1 0] [1 2 0 1] [0] 405.95/135.65 [f](x1, x2) = [0 0 0 0] x1 + [0 0 2 1] x2 + [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 405.95/135.65 [0] 405.95/135.65 [a] = [0] 405.95/135.65 [1] 405.95/135.65 [0] 405.95/135.65 405.95/135.65 [1 2 1 0] [1 2 1 0] [0] 405.95/135.65 [h](x1, x2) = [0 0 1 0] x1 + [0 0 0 0] x2 + [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 405.95/135.65 [0] 405.95/135.65 [b] = [0] 405.95/135.65 [0] 405.95/135.65 [0] 405.95/135.65 405.95/135.65 The order satisfies the following ordering constraints: 405.95/135.65 405.95/135.65 [g(x, x, x)] = [3 2 1 0] [0] 405.95/135.65 [0 0 1 0] x + [0] 405.95/135.65 [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0] 405.95/135.65 ? [2] 405.95/135.65 [0] 405.95/135.65 [0] 405.95/135.65 [0] 405.95/135.65 = [g(c(), d(), e())] 405.95/135.65 405.95/135.65 [g(x, y, x)] = [2 2 1 0] [1 0 0 0] [0] 405.95/135.65 [0 0 0 0] x + [0 0 1 0] y + [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 ? [2] 405.95/135.65 [0] 405.95/135.65 [0] 405.95/135.65 [0] 405.95/135.65 = [g(c(), d(), e())] 405.95/135.65 405.95/135.65 [s(y)] = [1 2 1 0] [0] 405.95/135.65 [0 0 0 0] y + [0] 405.95/135.65 [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [1] 405.95/135.65 >= [0] 405.95/135.65 [0] 405.95/135.65 [0] 405.95/135.65 [0] 405.95/135.65 = [b()] 405.95/135.65 405.95/135.65 [s(f(x, y))] = [1 2 1 0] [1 2 4 3] [0] 405.95/135.65 [0 0 0 0] x + [0 0 0 0] y + [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [1] 405.95/135.65 ? [1 2 1 0] [1 2 1 0] [4] 405.95/135.65 [0 0 0 0] x + [0 0 0 0] y + [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 = [f(y, f(s(s(x)), a()))] 405.95/135.65 405.95/135.65 [f(x, g(x, a(), f(s(x), y)))] = [3 6 3 0] [1 2 0 1] [2] 405.95/135.65 [0 0 0 0] x + [0 0 0 0] y + [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 > [1 2 3 0] [1 0 0 0] [1] 405.95/135.65 [0 0 0 0] x + [0 0 0 0] y + [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 = [f(h(x, b()), g(a(), b(), y))] 405.95/135.65 405.95/135.65 [f(x, f(y, f(x, y)))] = [2 4 2 0] [2 4 5 3] [0] 405.95/135.65 [0 0 0 0] x + [0 0 0 0] y + [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 ? [1 2 1 0] [1 2 1 0] [1] 405.95/135.65 [0 0 0 0] x + [0 0 0 0] y + [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 = [f(a(), f(x, f(y, b())))] 405.95/135.65 405.95/135.65 [f(h(a(), y), g(x, b(), a()))] = [1 2 1 0] [1 2 1 0] [3] 405.95/135.65 [0 0 0 0] x + [0 0 0 0] y + [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 >= [1 2 1 0] [1 2 1 0] [3] 405.95/135.65 [0 0 0 0] x + [0 0 0 0] y + [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 = [h(f(x, s(y)), s(b()))] 405.95/135.65 405.95/135.65 [h(f(x, s(y)), b())] = [1 2 1 0] [1 2 1 0] [3] 405.95/135.65 [0 0 0 0] x + [0 0 0 0] y + [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 >= [1 2 1 0] [1 2 1 0] [3] 405.95/135.65 [0 0 0 0] x + [0 0 0 0] y + [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 = [f(a(), g(y, a(), f(s(x), a())))] 405.95/135.65 405.95/135.65 [h(h(x, a()), y)] = [1 2 3 0] [1 2 1 0] [1] 405.95/135.65 [0 0 0 0] x + [0 0 0 0] y + [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 ? [1 2 1 0] [1 2 1 0] [6] 405.95/135.65 [0 0 0 0] x + [0 0 0 0] y + [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 [0 0 0 0] [0 0 0 0] [0] 405.95/135.65 = [h(h(a(), y), h(a(), x))] 405.95/135.65 405.95/135.65 405.95/135.65 Further, it can be verified that all rules not oriented are covered by the weightgap condition. 405.95/135.65 405.95/135.65 We are left with following problem, upon which TcT provides the 405.95/135.65 certificate MAYBE. 405.95/135.65 405.95/135.65 Strict Trs: 405.95/135.65 { g(x, x, x) -> g(c(), d(), e()) 405.95/135.65 , g(x, y, x) -> g(c(), d(), e()) 405.95/135.65 , s(f(x, y)) -> f(y, f(s(s(x)), a())) 405.95/135.65 , f(x, f(y, f(x, y))) -> f(a(), f(x, f(y, b()))) 405.95/135.65 , h(h(x, a()), y) -> h(h(a(), y), h(a(), x)) } 405.95/135.65 Weak Trs: 405.95/135.65 { s(y) -> b() 405.95/135.65 , f(x, g(x, a(), f(s(x), y))) -> f(h(x, b()), g(a(), b(), y)) 405.95/135.65 , f(h(a(), y), g(x, b(), a())) -> h(f(x, s(y)), s(b())) 405.95/135.65 , h(f(x, s(y)), b()) -> f(a(), g(y, a(), f(s(x), a()))) } 405.95/135.65 Obligation: 405.95/135.65 derivational complexity 405.95/135.65 Answer: 405.95/135.65 MAYBE 405.95/135.65 405.95/135.65 None of the processors succeeded. 405.95/135.65 405.95/135.65 Details of failed attempt(s): 405.95/135.65 ----------------------------- 405.95/135.65 1) 'empty' failed due to the following reason: 405.95/135.65 405.95/135.65 Empty strict component of the problem is NOT empty. 405.95/135.65 405.95/135.65 2) 'Fastest' failed due to the following reason: 405.95/135.65 405.95/135.65 None of the processors succeeded. 405.95/135.65 405.95/135.65 Details of failed attempt(s): 405.95/135.65 ----------------------------- 405.95/135.65 1) 'Fastest' failed due to the following reason: 405.95/135.65 405.95/135.65 None of the processors succeeded. 405.95/135.65 405.95/135.65 Details of failed attempt(s): 405.95/135.65 ----------------------------- 405.95/135.65 1) 'matrix interpretation of dimension 6' failed due to the 405.95/135.65 following reason: 405.95/135.65 405.95/135.65 The input cannot be shown compatible 405.95/135.65 405.95/135.65 2) 'matrix interpretation of dimension 5' failed due to the 405.95/135.65 following reason: 405.95/135.65 405.95/135.65 The input cannot be shown compatible 405.95/135.65 405.95/135.65 3) 'matrix interpretation of dimension 4' failed due to the 405.95/135.65 following reason: 405.95/135.65 405.95/135.65 The input cannot be shown compatible 405.95/135.65 405.95/135.65 4) 'matrix interpretation of dimension 3' failed due to the 405.95/135.65 following reason: 405.95/135.65 405.95/135.65 The input cannot be shown compatible 405.95/135.65 405.95/135.65 5) 'matrix interpretation of dimension 2' failed due to the 405.95/135.65 following reason: 405.95/135.65 405.95/135.65 The input cannot be shown compatible 405.95/135.65 405.95/135.65 6) 'matrix interpretation of dimension 1' failed due to the 405.95/135.65 following reason: 405.95/135.65 405.95/135.65 The input cannot be shown compatible 405.95/135.65 405.95/135.65 405.95/135.65 2) 'Fastest (timeout of 30 seconds)' failed due to the following 405.95/135.65 reason: 405.95/135.65 405.95/135.65 Computation stopped due to timeout after 30.0 seconds. 405.95/135.65 405.95/135.65 3) 'iteProgress' failed due to the following reason: 405.95/135.65 405.95/135.65 Fail 405.95/135.65 405.95/135.65 4) 'bsearch-matrix' failed due to the following reason: 405.95/135.65 405.95/135.65 The input cannot be shown compatible 405.95/135.65 405.95/135.65 405.95/135.65 405.95/135.65 2) 'Fastest (timeout of 60 seconds)' failed due to the following 405.95/135.65 reason: 405.95/135.65 405.95/135.65 Computation stopped due to timeout after 60.0 seconds. 405.95/135.65 405.95/135.65 3) 'iteProgress (timeout of 297 seconds)' failed due to the 405.95/135.65 following reason: 405.95/135.65 405.95/135.65 Fail 405.95/135.65 405.95/135.65 4) 'bsearch-matrix (timeout of 297 seconds)' failed due to the 405.95/135.65 following reason: 405.95/135.65 405.95/135.65 The input cannot be shown compatible 405.95/135.65 405.95/135.65 405.95/135.65 Arrrr.. 406.16/135.71 EOF