MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { r(xs, ys, zs, nil()) -> xs , r(xs, nil(), zs, cons(w, ws)) -> r(xs, xs, cons(succ(zero()), zs), ws) , r(xs, cons(y, ys), nil(), cons(w, ws)) -> r(xs, xs, cons(succ(zero()), nil()), ws) , r(xs, cons(y, ys), cons(z, zs), cons(w, ws)) -> r(ys, cons(y, ys), zs, cons(succ(zero()), cons(w, ws))) } 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) '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) 'Best' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) '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 2) '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 3) 'Innermost Weak Dependency Pairs (timeout of 60 seconds)' failed due to the following reason: We add the following weak dependency pairs: Strict DPs: { r^#(xs, ys, zs, nil()) -> c_1(xs) , r^#(xs, nil(), zs, cons(w, ws)) -> c_2(r^#(xs, xs, cons(succ(zero()), zs), ws)) , r^#(xs, cons(y, ys), nil(), cons(w, ws)) -> c_3(r^#(xs, xs, cons(succ(zero()), nil()), ws)) , r^#(xs, cons(y, ys), cons(z, zs), cons(w, ws)) -> c_4(r^#(ys, cons(y, ys), zs, cons(succ(zero()), cons(w, ws)))) } and mark the set of starting terms. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { r^#(xs, ys, zs, nil()) -> c_1(xs) , r^#(xs, nil(), zs, cons(w, ws)) -> c_2(r^#(xs, xs, cons(succ(zero()), zs), ws)) , r^#(xs, cons(y, ys), nil(), cons(w, ws)) -> c_3(r^#(xs, xs, cons(succ(zero()), nil()), ws)) , r^#(xs, cons(y, ys), cons(z, zs), cons(w, ws)) -> c_4(r^#(ys, cons(y, ys), zs, cons(succ(zero()), cons(w, ws)))) } Strict Trs: { r(xs, ys, zs, nil()) -> xs , r(xs, nil(), zs, cons(w, ws)) -> r(xs, xs, cons(succ(zero()), zs), ws) , r(xs, cons(y, ys), nil(), cons(w, ws)) -> r(xs, xs, cons(succ(zero()), nil()), ws) , r(xs, cons(y, ys), cons(z, zs), cons(w, ws)) -> r(ys, cons(y, ys), zs, cons(succ(zero()), cons(w, ws))) } Obligation: runtime complexity Answer: MAYBE Empty strict component of the problem is NOT empty. Arrrr..