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