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