MAYBE 863.81/297.10 MAYBE 863.81/297.10 863.81/297.10 We are left with following problem, upon which TcT provides the 863.81/297.10 certificate MAYBE. 863.81/297.10 863.81/297.10 Strict Trs: 863.81/297.10 { active(h(X)) -> h(active(X)) 863.81/297.10 , active(h(X)) -> mark(g(X, X)) 863.81/297.10 , active(g(X1, X2)) -> g(active(X1), X2) 863.81/297.10 , active(g(a(), X)) -> mark(f(b(), X)) 863.81/297.10 , active(a()) -> mark(b()) 863.81/297.10 , active(f(X, X)) -> mark(h(a())) 863.81/297.10 , active(f(X1, X2)) -> f(active(X1), X2) 863.81/297.10 , h(mark(X)) -> mark(h(X)) 863.81/297.10 , h(ok(X)) -> ok(h(X)) 863.81/297.10 , g(mark(X1), X2) -> mark(g(X1, X2)) 863.81/297.10 , g(ok(X1), ok(X2)) -> ok(g(X1, X2)) 863.81/297.10 , f(mark(X1), X2) -> mark(f(X1, X2)) 863.81/297.10 , f(ok(X1), ok(X2)) -> ok(f(X1, X2)) 863.81/297.10 , proper(h(X)) -> h(proper(X)) 863.81/297.10 , proper(g(X1, X2)) -> g(proper(X1), proper(X2)) 863.81/297.10 , proper(a()) -> ok(a()) 863.81/297.10 , proper(f(X1, X2)) -> f(proper(X1), proper(X2)) 863.81/297.10 , proper(b()) -> ok(b()) 863.81/297.10 , top(mark(X)) -> top(proper(X)) 863.81/297.10 , top(ok(X)) -> top(active(X)) } 863.81/297.10 Obligation: 863.81/297.10 innermost runtime complexity 863.81/297.10 Answer: 863.81/297.10 MAYBE 863.81/297.10 863.81/297.10 None of the processors succeeded. 863.81/297.10 863.81/297.10 Details of failed attempt(s): 863.81/297.10 ----------------------------- 863.81/297.10 1) 'empty' failed due to the following reason: 863.81/297.11 863.81/297.11 Empty strict component of the problem is NOT empty. 863.81/297.11 863.81/297.11 2) 'Best' failed due to the following reason: 863.81/297.11 863.81/297.11 None of the processors succeeded. 863.81/297.11 863.81/297.11 Details of failed attempt(s): 863.81/297.11 ----------------------------- 863.81/297.11 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 863.81/297.11 following reason: 863.81/297.11 863.81/297.11 Computation stopped due to timeout after 297.0 seconds. 863.81/297.11 863.81/297.11 2) 'Best' failed due to the following reason: 863.81/297.11 863.81/297.11 None of the processors succeeded. 863.81/297.11 863.81/297.11 Details of failed attempt(s): 863.81/297.11 ----------------------------- 863.81/297.11 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 863.81/297.11 seconds)' failed due to the following reason: 863.81/297.11 863.81/297.11 Computation stopped due to timeout after 148.0 seconds. 863.81/297.11 863.81/297.11 2) 'Best' failed due to the following reason: 863.81/297.11 863.81/297.11 None of the processors succeeded. 863.81/297.11 863.81/297.11 Details of failed attempt(s): 863.81/297.11 ----------------------------- 863.81/297.11 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 863.81/297.11 to the following reason: 863.81/297.11 863.81/297.11 The input cannot be shown compatible 863.81/297.11 863.81/297.11 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 863.81/297.11 following reason: 863.81/297.11 863.81/297.11 The input cannot be shown compatible 863.81/297.11 863.81/297.11 863.81/297.11 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 863.81/297.11 failed due to the following reason: 863.81/297.11 863.81/297.11 None of the processors succeeded. 863.81/297.11 863.81/297.11 Details of failed attempt(s): 863.81/297.11 ----------------------------- 863.81/297.11 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 863.81/297.11 failed due to the following reason: 863.81/297.11 863.81/297.11 match-boundness of the problem could not be verified. 863.81/297.11 863.81/297.11 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 863.81/297.11 failed due to the following reason: 863.81/297.11 863.81/297.11 match-boundness of the problem could not be verified. 863.81/297.11 863.81/297.11 863.81/297.11 863.81/297.11 863.81/297.11 863.81/297.11 Arrrr.. 863.81/297.14 EOF