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