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