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