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