/export/starexec/sandbox/solver/bin/starexec_run_tct_dci /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE * Step 1: Failure MAYBE + Considered Problem: - Strict TRS: U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U12(X1,active(X2)) -> U12(X1,X2) U12(X1,mark(X2)) -> U12(X1,X2) U12(active(X1),X2) -> U12(X1,X2) U12(mark(X1),X2) -> U12(X1,X2) active(U11(tt(),L)) -> mark(U12(tt(),L)) active(U12(tt(),L)) -> mark(s(length(L))) active(length(cons(N,L))) -> mark(U11(tt(),L)) active(length(nil())) -> mark(0()) active(zeros()) -> mark(cons(0(),zeros())) cons(X1,active(X2)) -> cons(X1,X2) cons(X1,mark(X2)) -> cons(X1,X2) cons(active(X1),X2) -> cons(X1,X2) cons(mark(X1),X2) -> cons(X1,X2) length(active(X)) -> length(X) length(mark(X)) -> length(X) mark(0()) -> active(0()) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U12(X1,X2)) -> active(U12(mark(X1),X2)) mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) mark(length(X)) -> active(length(mark(X))) mark(nil()) -> active(nil()) mark(s(X)) -> active(s(mark(X))) mark(tt()) -> active(tt()) mark(zeros()) -> active(zeros()) s(active(X)) -> s(X) s(mark(X)) -> s(X) - Signature: {U11/2,U12/2,active/1,cons/2,length/1,mark/1,s/1} / {0/0,nil/0,tt/0,zeros/0} - Obligation: innermost derivational complexity wrt. signature {0,U11,U12,active,cons,length,mark,nil,s,tt,zeros} + Applied Processor: DecomposeCP {onSelectionCP_ = any strict-rules, withBoundCP_ = RelativeComp, withCP_ = NaturalMI {miDimension = 4, miDegree = 4, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Nothing}} + Details: application of cp failed MAYBE