/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: from(X) -> cons(X,n__from(s(X))) sel(0(),cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) from(X) -> n__from(X) activate(n__from(X)) -> from(X) activate(X) -> X Proof: DP Processor: DPs: sel#(s(X),cons(Y,Z)) -> activate#(Z) sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z)) activate#(n__from(X)) -> from#(X) TRS: from(X) -> cons(X,n__from(s(X))) sel(0(),cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) from(X) -> n__from(X) activate(n__from(X)) -> from(X) activate(X) -> X TDG Processor: DPs: sel#(s(X),cons(Y,Z)) -> activate#(Z) sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z)) activate#(n__from(X)) -> from#(X) TRS: from(X) -> cons(X,n__from(s(X))) sel(0(),cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) from(X) -> n__from(X) activate(n__from(X)) -> from(X) activate(X) -> X graph: sel#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__from(X)) -> from#(X) sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z)) -> sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z)) sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z)) -> sel#(s(X),cons(Y,Z)) -> activate#(Z) SCC Processor: #sccs: 1 #rules: 1 #arcs: 3/9 DPs: sel#(s(X),cons(Y,Z)) -> sel#(X,activate(Z)) TRS: from(X) -> cons(X,n__from(s(X))) sel(0(),cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) from(X) -> n__from(X) activate(n__from(X)) -> from(X) activate(X) -> X Subterm Criterion Processor: simple projection: pi(sel#) = 0 problem: DPs: TRS: from(X) -> cons(X,n__from(s(X))) sel(0(),cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) from(X) -> n__from(X) activate(n__from(X)) -> from(X) activate(X) -> X Qed