MAYBE 892.24/297.10 MAYBE 892.24/297.10 892.24/297.10 We are left with following problem, upon which TcT provides the 892.24/297.10 certificate MAYBE. 892.24/297.10 892.24/297.10 Strict Trs: 892.24/297.10 { active(eq(X, Y)) -> mark(false()) 892.24/297.10 , active(eq(0(), 0())) -> mark(true()) 892.24/297.10 , active(eq(s(X), s(Y))) -> mark(eq(X, Y)) 892.24/297.10 , active(inf(X)) -> mark(cons(X, inf(s(X)))) 892.24/297.10 , active(inf(X)) -> inf(active(X)) 892.24/297.10 , active(take(X1, X2)) -> take(X1, active(X2)) 892.24/297.10 , active(take(X1, X2)) -> take(active(X1), X2) 892.24/297.10 , active(take(0(), X)) -> mark(nil()) 892.24/297.10 , active(take(s(X), cons(Y, L))) -> mark(cons(Y, take(X, L))) 892.24/297.10 , active(length(X)) -> length(active(X)) 892.24/297.10 , active(length(cons(X, L))) -> mark(s(length(L))) 892.24/297.10 , active(length(nil())) -> mark(0()) 892.24/297.10 , eq(ok(X1), ok(X2)) -> ok(eq(X1, X2)) 892.24/297.10 , s(ok(X)) -> ok(s(X)) 892.24/297.10 , inf(mark(X)) -> mark(inf(X)) 892.24/297.10 , inf(ok(X)) -> ok(inf(X)) 892.24/297.10 , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) 892.24/297.10 , take(X1, mark(X2)) -> mark(take(X1, X2)) 892.24/297.10 , take(mark(X1), X2) -> mark(take(X1, X2)) 892.24/297.10 , take(ok(X1), ok(X2)) -> ok(take(X1, X2)) 892.24/297.10 , length(mark(X)) -> mark(length(X)) 892.24/297.10 , length(ok(X)) -> ok(length(X)) 892.24/297.10 , proper(eq(X1, X2)) -> eq(proper(X1), proper(X2)) 892.24/297.10 , proper(0()) -> ok(0()) 892.24/297.10 , proper(true()) -> ok(true()) 892.24/297.10 , proper(s(X)) -> s(proper(X)) 892.24/297.10 , proper(false()) -> ok(false()) 892.24/297.10 , proper(inf(X)) -> inf(proper(X)) 892.24/297.10 , proper(cons(any(X1), X2)) -> 892.24/297.10 cons(any(any(proper(X1))), any(proper(X2))) 892.24/297.10 , proper(take(X1, X2)) -> take(proper(X1), proper(X2)) 892.24/297.10 , proper(nil()) -> ok(nil()) 892.24/297.10 , proper(length(X)) -> length(proper(X)) 892.24/297.10 , any(X) -> s(X) 892.24/297.10 , any(proper(X)) -> any(any(any(X))) 892.24/297.10 , top(mark(X)) -> top(proper(X)) 892.24/297.10 , top(ok(X)) -> top(active(X)) } 892.24/297.10 Obligation: 892.24/297.10 innermost runtime complexity 892.24/297.10 Answer: 892.24/297.10 MAYBE 892.24/297.10 892.24/297.10 Arguments of following rules are not normal-forms: 892.24/297.10 892.24/297.10 { proper(cons(any(X1), X2)) -> 892.24/297.10 cons(any(any(proper(X1))), any(proper(X2))) } 892.24/297.10 892.24/297.10 All above mentioned rules can be savely removed. 892.24/297.10 892.24/297.10 We are left with following problem, upon which TcT provides the 892.24/297.10 certificate MAYBE. 892.24/297.10 892.24/297.10 Strict Trs: 892.24/297.10 { active(eq(X, Y)) -> mark(false()) 892.24/297.10 , active(eq(0(), 0())) -> mark(true()) 892.24/297.10 , active(eq(s(X), s(Y))) -> mark(eq(X, Y)) 892.24/297.10 , active(inf(X)) -> mark(cons(X, inf(s(X)))) 892.24/297.10 , active(inf(X)) -> inf(active(X)) 892.24/297.10 , active(take(X1, X2)) -> take(X1, active(X2)) 892.24/297.10 , active(take(X1, X2)) -> take(active(X1), X2) 892.24/297.10 , active(take(0(), X)) -> mark(nil()) 892.24/297.10 , active(take(s(X), cons(Y, L))) -> mark(cons(Y, take(X, L))) 892.24/297.10 , active(length(X)) -> length(active(X)) 892.24/297.10 , active(length(cons(X, L))) -> mark(s(length(L))) 892.24/297.10 , active(length(nil())) -> mark(0()) 892.24/297.10 , eq(ok(X1), ok(X2)) -> ok(eq(X1, X2)) 892.24/297.10 , s(ok(X)) -> ok(s(X)) 892.24/297.10 , inf(mark(X)) -> mark(inf(X)) 892.24/297.10 , inf(ok(X)) -> ok(inf(X)) 892.24/297.10 , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) 892.24/297.10 , take(X1, mark(X2)) -> mark(take(X1, X2)) 892.24/297.10 , take(mark(X1), X2) -> mark(take(X1, X2)) 892.24/297.10 , take(ok(X1), ok(X2)) -> ok(take(X1, X2)) 892.24/297.10 , length(mark(X)) -> mark(length(X)) 892.24/297.10 , length(ok(X)) -> ok(length(X)) 892.24/297.10 , proper(eq(X1, X2)) -> eq(proper(X1), proper(X2)) 892.24/297.10 , proper(0()) -> ok(0()) 892.24/297.10 , proper(true()) -> ok(true()) 892.24/297.10 , proper(s(X)) -> s(proper(X)) 892.24/297.10 , proper(false()) -> ok(false()) 892.24/297.10 , proper(inf(X)) -> inf(proper(X)) 892.24/297.10 , proper(take(X1, X2)) -> take(proper(X1), proper(X2)) 892.24/297.10 , proper(nil()) -> ok(nil()) 892.24/297.10 , proper(length(X)) -> length(proper(X)) 892.24/297.10 , any(X) -> s(X) 892.24/297.10 , any(proper(X)) -> any(any(any(X))) 892.24/297.10 , top(mark(X)) -> top(proper(X)) 892.24/297.10 , top(ok(X)) -> top(active(X)) } 892.24/297.10 Obligation: 892.24/297.10 innermost runtime complexity 892.24/297.10 Answer: 892.24/297.10 MAYBE 892.24/297.10 892.24/297.10 None of the processors succeeded. 892.24/297.10 892.24/297.10 Details of failed attempt(s): 892.24/297.10 ----------------------------- 892.24/297.10 1) 'empty' failed due to the following reason: 892.24/297.10 892.24/297.10 Empty strict component of the problem is NOT empty. 892.24/297.10 892.24/297.10 2) 'Best' failed due to the following reason: 892.24/297.10 892.24/297.10 None of the processors succeeded. 892.24/297.10 892.24/297.10 Details of failed attempt(s): 892.24/297.10 ----------------------------- 892.24/297.10 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 892.24/297.10 following reason: 892.24/297.10 892.24/297.10 Computation stopped due to timeout after 297.0 seconds. 892.24/297.10 892.24/297.10 2) 'Best' failed due to the following reason: 892.24/297.10 892.24/297.10 None of the processors succeeded. 892.24/297.10 892.24/297.10 Details of failed attempt(s): 892.24/297.10 ----------------------------- 892.24/297.10 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 892.24/297.10 seconds)' failed due to the following reason: 892.24/297.10 892.24/297.10 Computation stopped due to timeout after 148.0 seconds. 892.24/297.10 892.24/297.10 2) 'Best' failed due to the following reason: 892.24/297.10 892.24/297.10 None of the processors succeeded. 892.24/297.10 892.24/297.10 Details of failed attempt(s): 892.24/297.10 ----------------------------- 892.24/297.10 1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 892.24/297.10 following reason: 892.24/297.10 892.24/297.10 The input cannot be shown compatible 892.24/297.10 892.24/297.10 2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 892.24/297.10 to the following reason: 892.24/297.10 892.24/297.10 The input cannot be shown compatible 892.24/297.10 892.24/297.10 892.24/297.10 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 892.24/297.10 failed due to the following reason: 892.24/297.10 892.24/297.10 None of the processors succeeded. 892.24/297.10 892.24/297.10 Details of failed attempt(s): 892.24/297.10 ----------------------------- 892.24/297.10 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 892.24/297.10 failed due to the following reason: 892.24/297.10 892.24/297.10 match-boundness of the problem could not be verified. 892.24/297.10 892.24/297.10 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 892.24/297.10 failed due to the following reason: 892.24/297.10 892.24/297.10 match-boundness of the problem could not be verified. 892.24/297.10 892.24/297.10 892.24/297.10 892.24/297.10 892.24/297.10 892.24/297.10 Arrrr.. 892.37/297.24 EOF