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