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