MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { a__2nd(X) -> 2nd(X) , a__2nd(cons(X, cons(Y, Z))) -> mark(Y) , mark(cons(X1, X2)) -> cons(mark(X1), X2) , mark(from(X)) -> a__from(mark(X)) , mark(s(X)) -> s(mark(X)) , mark(2nd(X)) -> a__2nd(mark(X)) , a__from(X) -> cons(mark(X), from(s(X))) , a__from(X) -> from(X) } Obligation: runtime complexity Answer: MAYBE None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'WithProblem (timeout of 60 seconds)' failed due to the following reason: Computation stopped due to timeout after 60.0 seconds. 2) 'Best' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'WithProblem (timeout of 30 seconds) (timeout of 60 seconds)' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'WithProblem' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'Fastest' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'WithProblem' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'WithProblem' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'WithProblem' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'WithProblem' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'WithProblem' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'WithProblem' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'Best' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'bsearch-popstar (timeout of 60 seconds)' failed due to the following reason: The processor is inapplicable, reason: Processor only applicable for innermost runtime complexity analysis 2) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due to the following reason: The processor is inapplicable, reason: Processor only applicable for innermost runtime complexity analysis 3) 'Fastest (timeout of 5 seconds) (timeout of 60 seconds)' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'Bounds with perSymbol-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. 2) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. 3) 'Innermost Weak Dependency Pairs (timeout of 60 seconds)' failed due to the following reason: We add the following weak dependency pairs: Strict DPs: { a__2nd^#(X) -> c_1(X) , a__2nd^#(cons(X, cons(Y, Z))) -> c_2(mark^#(Y)) , mark^#(cons(X1, X2)) -> c_3(mark^#(X1), X2) , mark^#(from(X)) -> c_4(a__from^#(mark(X))) , mark^#(s(X)) -> c_5(mark^#(X)) , mark^#(2nd(X)) -> c_6(a__2nd^#(mark(X))) , a__from^#(X) -> c_7(mark^#(X), X) , a__from^#(X) -> c_8(X) } and mark the set of starting terms. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { a__2nd^#(X) -> c_1(X) , a__2nd^#(cons(X, cons(Y, Z))) -> c_2(mark^#(Y)) , mark^#(cons(X1, X2)) -> c_3(mark^#(X1), X2) , mark^#(from(X)) -> c_4(a__from^#(mark(X))) , mark^#(s(X)) -> c_5(mark^#(X)) , mark^#(2nd(X)) -> c_6(a__2nd^#(mark(X))) , a__from^#(X) -> c_7(mark^#(X), X) , a__from^#(X) -> c_8(X) } Strict Trs: { a__2nd(X) -> 2nd(X) , a__2nd(cons(X, cons(Y, Z))) -> mark(Y) , mark(cons(X1, X2)) -> cons(mark(X1), X2) , mark(from(X)) -> a__from(mark(X)) , mark(s(X)) -> s(mark(X)) , mark(2nd(X)) -> a__2nd(mark(X)) , a__from(X) -> cons(mark(X), from(s(X))) , a__from(X) -> from(X) } Obligation: runtime complexity Answer: MAYBE Empty strict component of the problem is NOT empty. Arrrr..