MAYBE 106.18/42.38 MAYBE 106.18/42.38 106.18/42.38 We are left with following problem, upon which TcT provides the 106.18/42.38 certificate MAYBE. 106.18/42.38 106.18/42.38 Strict Trs: 106.18/42.38 { not(not(x)) -> x 106.18/42.38 , not(or(x, y)) -> and(not(x), not(y)) 106.18/42.38 , not(and(x, y)) -> or(not(x), not(y)) 106.18/42.38 , and(x, or(y, z)) -> or(and(x, y), and(x, z)) 106.18/42.38 , and(or(y, z), x) -> or(and(x, y), and(x, z)) } 106.18/42.38 Obligation: 106.18/42.38 innermost runtime complexity 106.18/42.38 Answer: 106.18/42.38 MAYBE 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'empty' failed due to the following reason: 106.18/42.38 106.18/42.38 Empty strict component of the problem is NOT empty. 106.18/42.38 106.18/42.38 2) 'Best' failed due to the following reason: 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 106.18/42.38 following reason: 106.18/42.38 106.18/42.38 We add the following dependency tuples: 106.18/42.38 106.18/42.38 Strict DPs: 106.18/42.38 { not^#(not(x)) -> c_1() 106.18/42.38 , not^#(or(x, y)) -> c_2(and^#(not(x), not(y)), not^#(x), not^#(y)) 106.18/42.38 , not^#(and(x, y)) -> c_3(not^#(x), not^#(y)) 106.18/42.38 , and^#(x, or(y, z)) -> c_4(and^#(x, y), and^#(x, z)) 106.18/42.38 , and^#(or(y, z), x) -> c_5(and^#(x, y), and^#(x, z)) } 106.18/42.38 106.18/42.38 and mark the set of starting terms. 106.18/42.38 106.18/42.38 We are left with following problem, upon which TcT provides the 106.18/42.38 certificate MAYBE. 106.18/42.38 106.18/42.38 Strict DPs: 106.18/42.38 { not^#(not(x)) -> c_1() 106.18/42.38 , not^#(or(x, y)) -> c_2(and^#(not(x), not(y)), not^#(x), not^#(y)) 106.18/42.38 , not^#(and(x, y)) -> c_3(not^#(x), not^#(y)) 106.18/42.38 , and^#(x, or(y, z)) -> c_4(and^#(x, y), and^#(x, z)) 106.18/42.38 , and^#(or(y, z), x) -> c_5(and^#(x, y), and^#(x, z)) } 106.18/42.38 Weak Trs: 106.18/42.38 { not(not(x)) -> x 106.18/42.38 , not(or(x, y)) -> and(not(x), not(y)) 106.18/42.38 , not(and(x, y)) -> or(not(x), not(y)) 106.18/42.38 , and(x, or(y, z)) -> or(and(x, y), and(x, z)) 106.18/42.38 , and(or(y, z), x) -> or(and(x, y), and(x, z)) } 106.18/42.38 Obligation: 106.18/42.38 innermost runtime complexity 106.18/42.38 Answer: 106.18/42.38 MAYBE 106.18/42.38 106.18/42.38 We estimate the number of application of {1} by applications of 106.18/42.38 Pre({1}) = {2,3}. Here rules are labeled as follows: 106.18/42.38 106.18/42.38 DPs: 106.18/42.38 { 1: not^#(not(x)) -> c_1() 106.18/42.38 , 2: not^#(or(x, y)) -> 106.18/42.38 c_2(and^#(not(x), not(y)), not^#(x), not^#(y)) 106.18/42.38 , 3: not^#(and(x, y)) -> c_3(not^#(x), not^#(y)) 106.18/42.38 , 4: and^#(x, or(y, z)) -> c_4(and^#(x, y), and^#(x, z)) 106.18/42.38 , 5: and^#(or(y, z), x) -> c_5(and^#(x, y), and^#(x, z)) } 106.18/42.38 106.18/42.38 We are left with following problem, upon which TcT provides the 106.18/42.38 certificate MAYBE. 106.18/42.38 106.18/42.38 Strict DPs: 106.18/42.38 { not^#(or(x, y)) -> c_2(and^#(not(x), not(y)), not^#(x), not^#(y)) 106.18/42.38 , not^#(and(x, y)) -> c_3(not^#(x), not^#(y)) 106.18/42.38 , and^#(x, or(y, z)) -> c_4(and^#(x, y), and^#(x, z)) 106.18/42.38 , and^#(or(y, z), x) -> c_5(and^#(x, y), and^#(x, z)) } 106.18/42.38 Weak DPs: { not^#(not(x)) -> c_1() } 106.18/42.38 Weak Trs: 106.18/42.38 { not(not(x)) -> x 106.18/42.38 , not(or(x, y)) -> and(not(x), not(y)) 106.18/42.38 , not(and(x, y)) -> or(not(x), not(y)) 106.18/42.38 , and(x, or(y, z)) -> or(and(x, y), and(x, z)) 106.18/42.38 , and(or(y, z), x) -> or(and(x, y), and(x, z)) } 106.18/42.38 Obligation: 106.18/42.38 innermost runtime complexity 106.18/42.38 Answer: 106.18/42.38 MAYBE 106.18/42.38 106.18/42.38 The following weak DPs constitute a sub-graph of the DG that is 106.18/42.38 closed under successors. The DPs are removed. 106.18/42.38 106.18/42.38 { not^#(not(x)) -> c_1() } 106.18/42.38 106.18/42.38 We are left with following problem, upon which TcT provides the 106.18/42.38 certificate MAYBE. 106.18/42.38 106.18/42.38 Strict DPs: 106.18/42.38 { not^#(or(x, y)) -> c_2(and^#(not(x), not(y)), not^#(x), not^#(y)) 106.18/42.38 , not^#(and(x, y)) -> c_3(not^#(x), not^#(y)) 106.18/42.38 , and^#(x, or(y, z)) -> c_4(and^#(x, y), and^#(x, z)) 106.18/42.38 , and^#(or(y, z), x) -> c_5(and^#(x, y), and^#(x, z)) } 106.18/42.38 Weak Trs: 106.18/42.38 { not(not(x)) -> x 106.18/42.38 , not(or(x, y)) -> and(not(x), not(y)) 106.18/42.38 , not(and(x, y)) -> or(not(x), not(y)) 106.18/42.38 , and(x, or(y, z)) -> or(and(x, y), and(x, z)) 106.18/42.38 , and(or(y, z), x) -> or(and(x, y), and(x, z)) } 106.18/42.38 Obligation: 106.18/42.38 innermost runtime complexity 106.18/42.38 Answer: 106.18/42.38 MAYBE 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'empty' failed due to the following reason: 106.18/42.38 106.18/42.38 Empty strict component of the problem is NOT empty. 106.18/42.38 106.18/42.38 2) 'With Problem ...' failed due to the following reason: 106.18/42.38 106.18/42.38 We use the processor 'matrix interpretation of dimension 1' to 106.18/42.38 orient following rules strictly. 106.18/42.38 106.18/42.38 DPs: 106.18/42.38 { 1: not^#(or(x, y)) -> 106.18/42.38 c_2(and^#(not(x), not(y)), not^#(x), not^#(y)) 106.18/42.38 , 2: not^#(and(x, y)) -> c_3(not^#(x), not^#(y)) } 106.18/42.38 106.18/42.38 Sub-proof: 106.18/42.38 ---------- 106.18/42.38 The following argument positions are usable: 106.18/42.38 Uargs(c_2) = {1, 2, 3}, Uargs(c_3) = {1, 2}, Uargs(c_4) = {1, 2}, 106.18/42.38 Uargs(c_5) = {1, 2} 106.18/42.38 106.18/42.38 TcT has computed the following constructor-based matrix 106.18/42.38 interpretation satisfying not(EDA). 106.18/42.38 106.18/42.38 [not](x1) = [0] 106.18/42.38 106.18/42.38 [or](x1, x2) = [1] x1 + [1] x2 + [4] 106.18/42.38 106.18/42.38 [and](x1, x2) = [2] x1 + [2] x2 + [4] 106.18/42.38 106.18/42.38 [not^#](x1) = [2] x1 + [0] 106.18/42.38 106.18/42.38 [c_2](x1, x2, x3) = [2] x1 + [1] x2 + [1] x3 + [3] 106.18/42.38 106.18/42.38 [and^#](x1, x2) = [0] 106.18/42.38 106.18/42.38 [c_3](x1, x2) = [1] x1 + [1] x2 + [1] 106.18/42.38 106.18/42.38 [c_4](x1, x2) = [4] x1 + [2] x2 + [0] 106.18/42.38 106.18/42.38 [c_5](x1, x2) = [2] x1 + [2] x2 + [0] 106.18/42.38 106.18/42.38 The order satisfies the following ordering constraints: 106.18/42.38 106.18/42.38 [not(not(x))] = [0] 106.18/42.38 ? [1] x + [0] 106.18/42.38 = [x] 106.18/42.38 106.18/42.38 [not(or(x, y))] = [0] 106.18/42.38 ? [4] 106.18/42.38 = [and(not(x), not(y))] 106.18/42.38 106.18/42.38 [not(and(x, y))] = [0] 106.18/42.38 ? [4] 106.18/42.38 = [or(not(x), not(y))] 106.18/42.38 106.18/42.38 [and(x, or(y, z))] = [2] x + [2] y + [2] z + [12] 106.18/42.38 ? [4] x + [2] y + [2] z + [12] 106.18/42.38 = [or(and(x, y), and(x, z))] 106.18/42.38 106.18/42.38 [and(or(y, z), x)] = [2] x + [2] y + [2] z + [12] 106.18/42.38 ? [4] x + [2] y + [2] z + [12] 106.18/42.38 = [or(and(x, y), and(x, z))] 106.18/42.38 106.18/42.38 [not^#(or(x, y))] = [2] x + [2] y + [8] 106.18/42.38 > [2] x + [2] y + [3] 106.18/42.38 = [c_2(and^#(not(x), not(y)), not^#(x), not^#(y))] 106.18/42.38 106.18/42.38 [not^#(and(x, y))] = [4] x + [4] y + [8] 106.18/42.38 > [2] x + [2] y + [1] 106.18/42.38 = [c_3(not^#(x), not^#(y))] 106.18/42.38 106.18/42.38 [and^#(x, or(y, z))] = [0] 106.18/42.38 >= [0] 106.18/42.38 = [c_4(and^#(x, y), and^#(x, z))] 106.18/42.38 106.18/42.38 [and^#(or(y, z), x)] = [0] 106.18/42.38 >= [0] 106.18/42.38 = [c_5(and^#(x, y), and^#(x, z))] 106.18/42.38 106.18/42.38 106.18/42.38 The strictly oriented rules are moved into the weak component. 106.18/42.38 106.18/42.38 We are left with following problem, upon which TcT provides the 106.18/42.38 certificate MAYBE. 106.18/42.38 106.18/42.38 Strict DPs: 106.18/42.38 { and^#(x, or(y, z)) -> c_4(and^#(x, y), and^#(x, z)) 106.18/42.38 , and^#(or(y, z), x) -> c_5(and^#(x, y), and^#(x, z)) } 106.18/42.38 Weak DPs: 106.18/42.38 { not^#(or(x, y)) -> c_2(and^#(not(x), not(y)), not^#(x), not^#(y)) 106.18/42.38 , not^#(and(x, y)) -> c_3(not^#(x), not^#(y)) } 106.18/42.38 Weak Trs: 106.18/42.38 { not(not(x)) -> x 106.18/42.38 , not(or(x, y)) -> and(not(x), not(y)) 106.18/42.38 , not(and(x, y)) -> or(not(x), not(y)) 106.18/42.38 , and(x, or(y, z)) -> or(and(x, y), and(x, z)) 106.18/42.38 , and(or(y, z), x) -> or(and(x, y), and(x, z)) } 106.18/42.38 Obligation: 106.18/42.38 innermost runtime complexity 106.18/42.38 Answer: 106.18/42.38 MAYBE 106.18/42.38 106.18/42.38 The following weak DPs constitute a sub-graph of the DG that is 106.18/42.38 closed under successors. The DPs are removed. 106.18/42.38 106.18/42.38 { not^#(and(x, y)) -> c_3(not^#(x), not^#(y)) } 106.18/42.38 106.18/42.38 We are left with following problem, upon which TcT provides the 106.18/42.38 certificate MAYBE. 106.18/42.38 106.18/42.38 Strict DPs: 106.18/42.38 { and^#(x, or(y, z)) -> c_4(and^#(x, y), and^#(x, z)) 106.18/42.38 , and^#(or(y, z), x) -> c_5(and^#(x, y), and^#(x, z)) } 106.18/42.38 Weak DPs: 106.18/42.38 { not^#(or(x, y)) -> 106.18/42.38 c_2(and^#(not(x), not(y)), not^#(x), not^#(y)) } 106.18/42.38 Weak Trs: 106.18/42.38 { not(not(x)) -> x 106.18/42.38 , not(or(x, y)) -> and(not(x), not(y)) 106.18/42.38 , not(and(x, y)) -> or(not(x), not(y)) 106.18/42.38 , and(x, or(y, z)) -> or(and(x, y), and(x, z)) 106.18/42.38 , and(or(y, z), x) -> or(and(x, y), and(x, z)) } 106.18/42.38 Obligation: 106.18/42.38 innermost runtime complexity 106.18/42.38 Answer: 106.18/42.38 MAYBE 106.18/42.38 106.18/42.38 We decompose the input problem according to the dependency graph 106.18/42.38 into the upper component 106.18/42.38 106.18/42.38 { not^#(or(x, y)) -> 106.18/42.38 c_2(and^#(not(x), not(y)), not^#(x), not^#(y)) } 106.18/42.38 106.18/42.38 and lower component 106.18/42.38 106.18/42.38 { and^#(x, or(y, z)) -> c_4(and^#(x, y), and^#(x, z)) 106.18/42.38 , and^#(or(y, z), x) -> c_5(and^#(x, y), and^#(x, z)) } 106.18/42.38 106.18/42.38 Further, following extension rules are added to the lower 106.18/42.38 component. 106.18/42.38 106.18/42.38 { not^#(or(x, y)) -> not^#(x) 106.18/42.38 , not^#(or(x, y)) -> not^#(y) 106.18/42.38 , not^#(or(x, y)) -> and^#(not(x), not(y)) } 106.18/42.38 106.18/42.38 TcT solves the upper component with certificate YES(O(1),O(n^1)). 106.18/42.38 106.18/42.38 Sub-proof: 106.18/42.38 ---------- 106.18/42.38 We are left with following problem, upon which TcT provides the 106.18/42.38 certificate YES(O(1),O(n^1)). 106.18/42.38 106.18/42.38 Strict DPs: 106.18/42.38 { not^#(or(x, y)) -> 106.18/42.38 c_2(and^#(not(x), not(y)), not^#(x), not^#(y)) } 106.18/42.38 Weak Trs: 106.18/42.38 { not(not(x)) -> x 106.18/42.38 , not(or(x, y)) -> and(not(x), not(y)) 106.18/42.38 , not(and(x, y)) -> or(not(x), not(y)) 106.18/42.38 , and(x, or(y, z)) -> or(and(x, y), and(x, z)) 106.18/42.38 , and(or(y, z), x) -> or(and(x, y), and(x, z)) } 106.18/42.38 Obligation: 106.18/42.38 innermost runtime complexity 106.18/42.38 Answer: 106.18/42.38 YES(O(1),O(n^1)) 106.18/42.38 106.18/42.38 We use the processor 'matrix interpretation of dimension 1' to 106.18/42.38 orient following rules strictly. 106.18/42.38 106.18/42.38 DPs: 106.18/42.38 { 1: not^#(or(x, y)) -> 106.18/42.38 c_2(and^#(not(x), not(y)), not^#(x), not^#(y)) } 106.18/42.38 106.18/42.38 Sub-proof: 106.18/42.38 ---------- 106.18/42.38 The following argument positions are usable: 106.18/42.38 Uargs(c_2) = {1, 2, 3} 106.18/42.38 106.18/42.38 TcT has computed the following constructor-based matrix 106.18/42.38 interpretation satisfying not(EDA). 106.18/42.38 106.18/42.38 [not](x1) = [0] 106.18/42.38 106.18/42.38 [or](x1, x2) = [1] x1 + [1] x2 + [1] 106.18/42.38 106.18/42.38 [and](x1, x2) = [0] 106.18/42.38 106.18/42.38 [not^#](x1) = [1] x1 + [0] 106.18/42.38 106.18/42.38 [c_2](x1, x2, x3) = [1] x1 + [1] x2 + [1] x3 + [0] 106.18/42.38 106.18/42.38 [and^#](x1, x2) = [0] 106.18/42.38 106.18/42.38 The order satisfies the following ordering constraints: 106.18/42.38 106.18/42.38 [not(not(x))] = [0] 106.18/42.38 ? [1] x + [0] 106.18/42.38 = [x] 106.18/42.38 106.18/42.38 [not(or(x, y))] = [0] 106.18/42.38 >= [0] 106.18/42.38 = [and(not(x), not(y))] 106.18/42.38 106.18/42.38 [not(and(x, y))] = [0] 106.18/42.38 ? [1] 106.18/42.38 = [or(not(x), not(y))] 106.18/42.38 106.18/42.38 [and(x, or(y, z))] = [0] 106.18/42.38 ? [1] 106.18/42.38 = [or(and(x, y), and(x, z))] 106.18/42.38 106.18/42.38 [and(or(y, z), x)] = [0] 106.18/42.38 ? [1] 106.18/42.38 = [or(and(x, y), and(x, z))] 106.18/42.38 106.18/42.38 [not^#(or(x, y))] = [1] x + [1] y + [1] 106.18/42.38 > [1] x + [1] y + [0] 106.18/42.38 = [c_2(and^#(not(x), not(y)), not^#(x), not^#(y))] 106.18/42.38 106.18/42.38 106.18/42.38 The strictly oriented rules are moved into the weak component. 106.18/42.38 106.18/42.38 We are left with following problem, upon which TcT provides the 106.18/42.38 certificate YES(O(1),O(1)). 106.18/42.38 106.18/42.38 Weak DPs: 106.18/42.38 { not^#(or(x, y)) -> 106.18/42.38 c_2(and^#(not(x), not(y)), not^#(x), not^#(y)) } 106.18/42.38 Weak Trs: 106.18/42.38 { not(not(x)) -> x 106.18/42.38 , not(or(x, y)) -> and(not(x), not(y)) 106.18/42.38 , not(and(x, y)) -> or(not(x), not(y)) 106.18/42.38 , and(x, or(y, z)) -> or(and(x, y), and(x, z)) 106.18/42.38 , and(or(y, z), x) -> or(and(x, y), and(x, z)) } 106.18/42.38 Obligation: 106.18/42.38 innermost runtime complexity 106.18/42.38 Answer: 106.18/42.38 YES(O(1),O(1)) 106.18/42.38 106.18/42.38 The following weak DPs constitute a sub-graph of the DG that is 106.18/42.38 closed under successors. The DPs are removed. 106.18/42.38 106.18/42.38 { not^#(or(x, y)) -> 106.18/42.38 c_2(and^#(not(x), not(y)), not^#(x), not^#(y)) } 106.18/42.38 106.18/42.38 We are left with following problem, upon which TcT provides the 106.18/42.38 certificate YES(O(1),O(1)). 106.18/42.38 106.18/42.38 Weak Trs: 106.18/42.38 { not(not(x)) -> x 106.18/42.38 , not(or(x, y)) -> and(not(x), not(y)) 106.18/42.38 , not(and(x, y)) -> or(not(x), not(y)) 106.18/42.38 , and(x, or(y, z)) -> or(and(x, y), and(x, z)) 106.18/42.38 , and(or(y, z), x) -> or(and(x, y), and(x, z)) } 106.18/42.38 Obligation: 106.18/42.38 innermost runtime complexity 106.18/42.38 Answer: 106.18/42.38 YES(O(1),O(1)) 106.18/42.38 106.18/42.38 No rule is usable, rules are removed from the input problem. 106.18/42.38 106.18/42.38 We are left with following problem, upon which TcT provides the 106.18/42.38 certificate YES(O(1),O(1)). 106.18/42.38 106.18/42.38 Rules: Empty 106.18/42.38 Obligation: 106.18/42.38 innermost runtime complexity 106.18/42.38 Answer: 106.18/42.38 YES(O(1),O(1)) 106.18/42.38 106.18/42.38 Empty rules are trivially bounded 106.18/42.38 106.18/42.38 We return to the main proof. 106.18/42.38 106.18/42.38 We are left with following problem, upon which TcT provides the 106.18/42.38 certificate MAYBE. 106.18/42.38 106.18/42.38 Strict DPs: 106.18/42.38 { and^#(x, or(y, z)) -> c_4(and^#(x, y), and^#(x, z)) 106.18/42.38 , and^#(or(y, z), x) -> c_5(and^#(x, y), and^#(x, z)) } 106.18/42.38 Weak DPs: 106.18/42.38 { not^#(or(x, y)) -> not^#(x) 106.18/42.38 , not^#(or(x, y)) -> not^#(y) 106.18/42.38 , not^#(or(x, y)) -> and^#(not(x), not(y)) } 106.18/42.38 Weak Trs: 106.18/42.38 { not(not(x)) -> x 106.18/42.38 , not(or(x, y)) -> and(not(x), not(y)) 106.18/42.38 , not(and(x, y)) -> or(not(x), not(y)) 106.18/42.38 , and(x, or(y, z)) -> or(and(x, y), and(x, z)) 106.18/42.38 , and(or(y, z), x) -> or(and(x, y), and(x, z)) } 106.18/42.38 Obligation: 106.18/42.38 innermost runtime complexity 106.18/42.38 Answer: 106.18/42.38 MAYBE 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'empty' failed due to the following reason: 106.18/42.38 106.18/42.38 Empty strict component of the problem is NOT empty. 106.18/42.38 106.18/42.38 2) 'Fastest' failed due to the following reason: 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'With Problem ...' failed due to the following reason: 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'empty' failed due to the following reason: 106.18/42.38 106.18/42.38 Empty strict component of the problem is NOT empty. 106.18/42.38 106.18/42.38 2) 'Polynomial Path Order (PS)' failed due to the following reason: 106.18/42.38 106.18/42.38 The input cannot be shown compatible 106.18/42.38 106.18/42.38 106.18/42.38 2) 'Polynomial Path Order (PS)' failed due to the following reason: 106.18/42.38 106.18/42.38 The input cannot be shown compatible 106.18/42.38 106.18/42.38 3) 'Fastest (timeout of 24 seconds)' failed due to the following 106.18/42.38 reason: 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 106.18/42.38 failed due to the following reason: 106.18/42.38 106.18/42.38 match-boundness of the problem could not be verified. 106.18/42.38 106.18/42.38 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 106.18/42.38 failed due to the following reason: 106.18/42.38 106.18/42.38 match-boundness of the problem could not be verified. 106.18/42.38 106.18/42.38 106.18/42.38 106.18/42.38 106.18/42.38 106.18/42.38 2) 'Best' failed due to the following reason: 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 106.18/42.38 seconds)' failed due to the following reason: 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'empty' failed due to the following reason: 106.18/42.38 106.18/42.38 Empty strict component of the problem is NOT empty. 106.18/42.38 106.18/42.38 2) 'With Problem ...' failed due to the following reason: 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'empty' failed due to the following reason: 106.18/42.38 106.18/42.38 Empty strict component of the problem is NOT empty. 106.18/42.38 106.18/42.38 2) 'Fastest' failed due to the following reason: 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'With Problem ...' failed due to the following reason: 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'empty' failed due to the following reason: 106.18/42.38 106.18/42.38 Empty strict component of the problem is NOT empty. 106.18/42.38 106.18/42.38 2) 'With Problem ...' failed due to the following reason: 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'empty' failed due to the following reason: 106.18/42.38 106.18/42.38 Empty strict component of the problem is NOT empty. 106.18/42.38 106.18/42.38 2) 'With Problem ...' failed due to the following reason: 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'empty' failed due to the following reason: 106.18/42.38 106.18/42.38 Empty strict component of the problem is NOT empty. 106.18/42.38 106.18/42.38 2) 'With Problem ...' failed due to the following reason: 106.18/42.38 106.18/42.38 Empty strict component of the problem is NOT empty. 106.18/42.38 106.18/42.38 106.18/42.38 106.18/42.38 106.18/42.38 2) 'With Problem ...' failed due to the following reason: 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'empty' failed due to the following reason: 106.18/42.38 106.18/42.38 Empty strict component of the problem is NOT empty. 106.18/42.38 106.18/42.38 2) 'With Problem ...' failed due to the following reason: 106.18/42.38 106.18/42.38 Empty strict component of the problem is NOT empty. 106.18/42.38 106.18/42.38 106.18/42.38 106.18/42.38 106.18/42.38 106.18/42.38 2) 'Best' failed due to the following reason: 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 106.18/42.38 to the following reason: 106.18/42.38 106.18/42.38 The input cannot be shown compatible 106.18/42.38 106.18/42.38 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 106.18/42.38 following reason: 106.18/42.38 106.18/42.38 The input cannot be shown compatible 106.18/42.38 106.18/42.38 106.18/42.38 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 106.18/42.38 failed due to the following reason: 106.18/42.38 106.18/42.38 None of the processors succeeded. 106.18/42.38 106.18/42.38 Details of failed attempt(s): 106.18/42.38 ----------------------------- 106.18/42.38 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 106.18/42.38 failed due to the following reason: 106.18/42.38 106.18/42.38 match-boundness of the problem could not be verified. 106.18/42.38 106.18/42.38 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 106.18/42.38 failed due to the following reason: 106.18/42.38 106.18/42.38 match-boundness of the problem could not be verified. 106.18/42.38 106.18/42.38 106.18/42.38 106.18/42.38 106.18/42.38 106.18/42.38 Arrrr.. 106.33/42.43 EOF