MAYBE 864.90/297.03 MAYBE 864.90/297.03 864.90/297.03 We are left with following problem, upon which TcT provides the 864.90/297.03 certificate MAYBE. 864.90/297.03 864.90/297.03 Strict Trs: 864.90/297.03 { O(0()) -> 0() 864.90/297.03 , +(x, 0()) -> x 864.90/297.03 , +(O(x), O(y)) -> O(+(x, y)) 864.90/297.03 , +(O(x), I(y)) -> I(+(x, y)) 864.90/297.03 , +(0(), x) -> x 864.90/297.03 , +(I(x), O(y)) -> I(+(x, y)) 864.90/297.03 , +(I(x), I(y)) -> O(+(+(x, y), I(0()))) 864.90/297.03 , *(x, 0()) -> 0() 864.90/297.03 , *(O(x), y) -> O(*(x, y)) 864.90/297.03 , *(0(), x) -> 0() 864.90/297.03 , *(I(x), y) -> +(O(*(x, y)), y) 864.90/297.03 , -(x, 0()) -> x 864.90/297.03 , -(O(x), O(y)) -> O(-(x, y)) 864.90/297.03 , -(O(x), I(y)) -> I(-(-(x, y), I(1()))) 864.90/297.03 , -(0(), x) -> 0() 864.90/297.03 , -(I(x), O(y)) -> I(-(x, y)) 864.90/297.03 , -(I(x), I(y)) -> O(-(x, y)) } 864.90/297.03 Obligation: 864.90/297.03 innermost runtime complexity 864.90/297.03 Answer: 864.90/297.03 MAYBE 864.90/297.03 864.90/297.03 None of the processors succeeded. 864.90/297.03 864.90/297.03 Details of failed attempt(s): 864.90/297.03 ----------------------------- 864.90/297.03 1) 'empty' failed due to the following reason: 864.90/297.03 864.90/297.03 Empty strict component of the problem is NOT empty. 864.90/297.03 864.90/297.03 2) 'Best' failed due to the following reason: 864.90/297.03 864.90/297.03 None of the processors succeeded. 864.90/297.03 864.90/297.03 Details of failed attempt(s): 864.90/297.03 ----------------------------- 864.90/297.03 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 864.90/297.03 following reason: 864.90/297.03 864.90/297.03 Computation stopped due to timeout after 297.0 seconds. 864.90/297.03 864.90/297.03 2) 'Best' failed due to the following reason: 864.90/297.03 864.90/297.03 None of the processors succeeded. 864.90/297.03 864.90/297.03 Details of failed attempt(s): 864.90/297.03 ----------------------------- 864.90/297.03 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 864.90/297.03 seconds)' failed due to the following reason: 864.90/297.03 864.90/297.03 Computation stopped due to timeout after 148.0 seconds. 864.90/297.03 864.90/297.03 2) 'Best' failed due to the following reason: 864.90/297.03 864.90/297.03 None of the processors succeeded. 864.90/297.03 864.90/297.03 Details of failed attempt(s): 864.90/297.03 ----------------------------- 864.90/297.03 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 864.90/297.03 to the following reason: 864.90/297.03 864.90/297.03 The input cannot be shown compatible 864.90/297.03 864.90/297.03 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 864.90/297.03 following reason: 864.90/297.03 864.90/297.03 The input cannot be shown compatible 864.90/297.03 864.90/297.03 864.90/297.03 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 864.90/297.03 failed due to the following reason: 864.90/297.03 864.90/297.03 None of the processors succeeded. 864.90/297.03 864.90/297.03 Details of failed attempt(s): 864.90/297.03 ----------------------------- 864.90/297.03 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 864.90/297.03 failed due to the following reason: 864.90/297.03 864.90/297.03 match-boundness of the problem could not be verified. 864.90/297.03 864.90/297.03 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 864.90/297.03 failed due to the following reason: 864.90/297.03 864.90/297.03 match-boundness of the problem could not be verified. 864.90/297.03 864.90/297.03 864.90/297.03 864.90/297.03 864.90/297.03 864.90/297.03 Arrrr.. 865.01/297.15 EOF