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