YES Problem: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Proof: DP Processor: DPs: active#(add(s(X),Y)) -> add#(X,Y) active#(add(s(X),Y)) -> s#(add(X,Y)) active#(first(s(X),cons(Y,Z))) -> first#(X,Z) active#(first(s(X),cons(Y,Z))) -> cons#(Y,first(X,Z)) active#(from(X)) -> s#(X) active#(from(X)) -> from#(s(X)) active#(from(X)) -> cons#(X,from(s(X))) active#(and(X1,X2)) -> active#(X1) active#(and(X1,X2)) -> and#(active(X1),X2) active#(if(X1,X2,X3)) -> active#(X1) active#(if(X1,X2,X3)) -> if#(active(X1),X2,X3) active#(add(X1,X2)) -> active#(X1) active#(add(X1,X2)) -> add#(active(X1),X2) active#(first(X1,X2)) -> active#(X1) active#(first(X1,X2)) -> first#(active(X1),X2) active#(first(X1,X2)) -> active#(X2) active#(first(X1,X2)) -> first#(X1,active(X2)) and#(mark(X1),X2) -> and#(X1,X2) if#(mark(X1),X2,X3) -> if#(X1,X2,X3) add#(mark(X1),X2) -> add#(X1,X2) first#(mark(X1),X2) -> first#(X1,X2) first#(X1,mark(X2)) -> first#(X1,X2) proper#(and(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(if(X1,X2,X3)) -> proper#(X3) proper#(if(X1,X2,X3)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X1) proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) proper#(add(X1,X2)) -> proper#(X2) proper#(add(X1,X2)) -> proper#(X1) proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) proper#(s(X)) -> proper#(X) proper#(s(X)) -> s#(proper(X)) proper#(first(X1,X2)) -> proper#(X2) proper#(first(X1,X2)) -> proper#(X1) proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) proper#(cons(X1,X2)) -> proper#(X2) proper#(cons(X1,X2)) -> proper#(X1) proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(from(X)) -> proper#(X) proper#(from(X)) -> from#(proper(X)) and#(ok(X1),ok(X2)) -> and#(X1,X2) if#(ok(X1),ok(X2),ok(X3)) -> if#(X1,X2,X3) add#(ok(X1),ok(X2)) -> add#(X1,X2) s#(ok(X)) -> s#(X) first#(ok(X1),ok(X2)) -> first#(X1,X2) cons#(ok(X1),ok(X2)) -> cons#(X1,X2) from#(ok(X)) -> from#(X) top#(mark(X)) -> proper#(X) top#(mark(X)) -> top#(proper(X)) top#(ok(X)) -> active#(X) top#(ok(X)) -> top#(active(X)) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) TDG Processor: DPs: active#(add(s(X),Y)) -> add#(X,Y) active#(add(s(X),Y)) -> s#(add(X,Y)) active#(first(s(X),cons(Y,Z))) -> first#(X,Z) active#(first(s(X),cons(Y,Z))) -> cons#(Y,first(X,Z)) active#(from(X)) -> s#(X) active#(from(X)) -> from#(s(X)) active#(from(X)) -> cons#(X,from(s(X))) active#(and(X1,X2)) -> active#(X1) active#(and(X1,X2)) -> and#(active(X1),X2) active#(if(X1,X2,X3)) -> active#(X1) active#(if(X1,X2,X3)) -> if#(active(X1),X2,X3) active#(add(X1,X2)) -> active#(X1) active#(add(X1,X2)) -> add#(active(X1),X2) active#(first(X1,X2)) -> active#(X1) active#(first(X1,X2)) -> first#(active(X1),X2) active#(first(X1,X2)) -> active#(X2) active#(first(X1,X2)) -> first#(X1,active(X2)) and#(mark(X1),X2) -> and#(X1,X2) if#(mark(X1),X2,X3) -> if#(X1,X2,X3) add#(mark(X1),X2) -> add#(X1,X2) first#(mark(X1),X2) -> first#(X1,X2) first#(X1,mark(X2)) -> first#(X1,X2) proper#(and(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(if(X1,X2,X3)) -> proper#(X3) proper#(if(X1,X2,X3)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X1) proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) proper#(add(X1,X2)) -> proper#(X2) proper#(add(X1,X2)) -> proper#(X1) proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) proper#(s(X)) -> proper#(X) proper#(s(X)) -> s#(proper(X)) proper#(first(X1,X2)) -> proper#(X2) proper#(first(X1,X2)) -> proper#(X1) proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) proper#(cons(X1,X2)) -> proper#(X2) proper#(cons(X1,X2)) -> proper#(X1) proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(from(X)) -> proper#(X) proper#(from(X)) -> from#(proper(X)) and#(ok(X1),ok(X2)) -> and#(X1,X2) if#(ok(X1),ok(X2),ok(X3)) -> if#(X1,X2,X3) add#(ok(X1),ok(X2)) -> add#(X1,X2) s#(ok(X)) -> s#(X) first#(ok(X1),ok(X2)) -> first#(X1,X2) cons#(ok(X1),ok(X2)) -> cons#(X1,X2) from#(ok(X)) -> from#(X) top#(mark(X)) -> proper#(X) top#(mark(X)) -> top#(proper(X)) top#(ok(X)) -> active#(X) top#(ok(X)) -> top#(active(X)) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) graph: top#(ok(X)) -> top#(active(X)) -> top#(ok(X)) -> top#(active(X)) top#(ok(X)) -> top#(active(X)) -> top#(ok(X)) -> active#(X) top#(ok(X)) -> top#(active(X)) -> top#(mark(X)) -> top#(proper(X)) top#(ok(X)) -> top#(active(X)) -> top#(mark(X)) -> proper#(X) top#(ok(X)) -> active#(X) -> active#(first(X1,X2)) -> first#(X1,active(X2)) top#(ok(X)) -> active#(X) -> active#(first(X1,X2)) -> active#(X2) top#(ok(X)) -> active#(X) -> active#(first(X1,X2)) -> first#(active(X1),X2) top#(ok(X)) -> active#(X) -> active#(first(X1,X2)) -> active#(X1) top#(ok(X)) -> active#(X) -> active#(add(X1,X2)) -> add#(active(X1),X2) top#(ok(X)) -> active#(X) -> active#(add(X1,X2)) -> active#(X1) top#(ok(X)) -> active#(X) -> active#(if(X1,X2,X3)) -> if#(active(X1),X2,X3) top#(ok(X)) -> active#(X) -> active#(if(X1,X2,X3)) -> active#(X1) top#(ok(X)) -> active#(X) -> active#(and(X1,X2)) -> and#(active(X1),X2) top#(ok(X)) -> active#(X) -> active#(and(X1,X2)) -> active#(X1) top#(ok(X)) -> active#(X) -> active#(from(X)) -> cons#(X,from(s(X))) top#(ok(X)) -> active#(X) -> active#(from(X)) -> from#(s(X)) top#(ok(X)) -> active#(X) -> active#(from(X)) -> s#(X) top#(ok(X)) -> active#(X) -> active#(first(s(X),cons(Y,Z))) -> cons#(Y,first(X,Z)) top#(ok(X)) -> active#(X) -> active#(first(s(X),cons(Y,Z))) -> first#(X,Z) top#(ok(X)) -> active#(X) -> active#(add(s(X),Y)) -> s#(add(X,Y)) top#(ok(X)) -> active#(X) -> active#(add(s(X),Y)) -> add#(X,Y) top#(mark(X)) -> top#(proper(X)) -> top#(ok(X)) -> top#(active(X)) top#(mark(X)) -> top#(proper(X)) -> top#(ok(X)) -> active#(X) top#(mark(X)) -> top#(proper(X)) -> top#(mark(X)) -> top#(proper(X)) top#(mark(X)) -> top#(proper(X)) -> top#(mark(X)) -> proper#(X) top#(mark(X)) -> proper#(X) -> proper#(from(X)) -> from#(proper(X)) top#(mark(X)) -> proper#(X) -> proper#(from(X)) -> proper#(X) top#(mark(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) top#(mark(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> proper#(X1) top#(mark(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> proper#(X2) top#(mark(X)) -> proper#(X) -> proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) top#(mark(X)) -> proper#(X) -> proper#(first(X1,X2)) -> proper#(X1) top#(mark(X)) -> proper#(X) -> proper#(first(X1,X2)) -> proper#(X2) top#(mark(X)) -> proper#(X) -> proper#(s(X)) -> s#(proper(X)) top#(mark(X)) -> proper#(X) -> proper#(s(X)) -> proper#(X) top#(mark(X)) -> proper#(X) -> proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) top#(mark(X)) -> proper#(X) -> proper#(add(X1,X2)) -> proper#(X1) top#(mark(X)) -> proper#(X) -> proper#(add(X1,X2)) -> proper#(X2) top#(mark(X)) -> proper#(X) -> proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) top#(mark(X)) -> proper#(X) -> proper#(if(X1,X2,X3)) -> proper#(X1) top#(mark(X)) -> proper#(X) -> proper#(if(X1,X2,X3)) -> proper#(X2) top#(mark(X)) -> proper#(X) -> proper#(if(X1,X2,X3)) -> proper#(X3) top#(mark(X)) -> proper#(X) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) top#(mark(X)) -> proper#(X) -> proper#(and(X1,X2)) -> proper#(X1) top#(mark(X)) -> proper#(X) -> proper#(and(X1,X2)) -> proper#(X2) proper#(from(X)) -> proper#(X) -> proper#(from(X)) -> from#(proper(X)) proper#(from(X)) -> proper#(X) -> proper#(from(X)) -> proper#(X) proper#(from(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(from(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> proper#(X1) proper#(from(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> proper#(X2) proper#(from(X)) -> proper#(X) -> proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) proper#(from(X)) -> proper#(X) -> proper#(first(X1,X2)) -> proper#(X1) proper#(from(X)) -> proper#(X) -> proper#(first(X1,X2)) -> proper#(X2) proper#(from(X)) -> proper#(X) -> proper#(s(X)) -> s#(proper(X)) proper#(from(X)) -> proper#(X) -> proper#(s(X)) -> proper#(X) proper#(from(X)) -> proper#(X) -> proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) proper#(from(X)) -> proper#(X) -> proper#(add(X1,X2)) -> proper#(X1) proper#(from(X)) -> proper#(X) -> proper#(add(X1,X2)) -> proper#(X2) proper#(from(X)) -> proper#(X) -> proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) proper#(from(X)) -> proper#(X) -> proper#(if(X1,X2,X3)) -> proper#(X1) proper#(from(X)) -> proper#(X) -> proper#(if(X1,X2,X3)) -> proper#(X2) proper#(from(X)) -> proper#(X) -> proper#(if(X1,X2,X3)) -> proper#(X3) proper#(from(X)) -> proper#(X) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(from(X)) -> proper#(X) -> proper#(and(X1,X2)) -> proper#(X1) proper#(from(X)) -> proper#(X) -> proper#(and(X1,X2)) -> proper#(X2) proper#(from(X)) -> from#(proper(X)) -> from#(ok(X)) -> from#(X) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(from(X)) -> from#(proper(X)) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(from(X)) -> proper#(X) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(cons(X1,X2)) -> proper#(X1) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(cons(X1,X2)) -> proper#(X2) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(first(X1,X2)) -> proper#(X1) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(first(X1,X2)) -> proper#(X2) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(s(X)) -> s#(proper(X)) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(s(X)) -> proper#(X) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(add(X1,X2)) -> proper#(X1) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(add(X1,X2)) -> proper#(X2) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> proper#(X1) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> proper#(X2) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> proper#(X3) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> proper#(X1) proper#(cons(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> proper#(X2) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(from(X)) -> from#(proper(X)) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(from(X)) -> proper#(X) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(cons(X1,X2)) -> proper#(X1) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(cons(X1,X2)) -> proper#(X2) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(first(X1,X2)) -> proper#(X1) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(first(X1,X2)) -> proper#(X2) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(s(X)) -> s#(proper(X)) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(s(X)) -> proper#(X) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(add(X1,X2)) -> proper#(X1) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(add(X1,X2)) -> proper#(X2) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> proper#(X1) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> proper#(X2) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> proper#(X3) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> proper#(X1) proper#(cons(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> proper#(X2) proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) -> cons#(ok(X1),ok(X2)) -> cons#(X1,X2) proper#(first(X1,X2)) -> proper#(X2) -> proper#(from(X)) -> from#(proper(X)) proper#(first(X1,X2)) -> proper#(X2) -> proper#(from(X)) -> proper#(X) proper#(first(X1,X2)) -> proper#(X2) -> proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(first(X1,X2)) -> proper#(X2) -> proper#(cons(X1,X2)) -> proper#(X1) proper#(first(X1,X2)) -> proper#(X2) -> proper#(cons(X1,X2)) -> proper#(X2) proper#(first(X1,X2)) -> proper#(X2) -> proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) proper#(first(X1,X2)) -> proper#(X2) -> proper#(first(X1,X2)) -> proper#(X1) proper#(first(X1,X2)) -> proper#(X2) -> proper#(first(X1,X2)) -> proper#(X2) proper#(first(X1,X2)) -> proper#(X2) -> proper#(s(X)) -> s#(proper(X)) proper#(first(X1,X2)) -> proper#(X2) -> proper#(s(X)) -> proper#(X) proper#(first(X1,X2)) -> proper#(X2) -> proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) proper#(first(X1,X2)) -> proper#(X2) -> proper#(add(X1,X2)) -> proper#(X1) proper#(first(X1,X2)) -> proper#(X2) -> proper#(add(X1,X2)) -> proper#(X2) proper#(first(X1,X2)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) proper#(first(X1,X2)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> proper#(X1) proper#(first(X1,X2)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> proper#(X2) proper#(first(X1,X2)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> proper#(X3) proper#(first(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(first(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> proper#(X1) proper#(first(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> proper#(X2) proper#(first(X1,X2)) -> proper#(X1) -> proper#(from(X)) -> from#(proper(X)) proper#(first(X1,X2)) -> proper#(X1) -> proper#(from(X)) -> proper#(X) proper#(first(X1,X2)) -> proper#(X1) -> proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(first(X1,X2)) -> proper#(X1) -> proper#(cons(X1,X2)) -> proper#(X1) proper#(first(X1,X2)) -> proper#(X1) -> proper#(cons(X1,X2)) -> proper#(X2) proper#(first(X1,X2)) -> proper#(X1) -> proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) proper#(first(X1,X2)) -> proper#(X1) -> proper#(first(X1,X2)) -> proper#(X1) proper#(first(X1,X2)) -> proper#(X1) -> proper#(first(X1,X2)) -> proper#(X2) proper#(first(X1,X2)) -> proper#(X1) -> proper#(s(X)) -> s#(proper(X)) proper#(first(X1,X2)) -> proper#(X1) -> proper#(s(X)) -> proper#(X) proper#(first(X1,X2)) -> proper#(X1) -> proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) proper#(first(X1,X2)) -> proper#(X1) -> proper#(add(X1,X2)) -> proper#(X1) proper#(first(X1,X2)) -> proper#(X1) -> proper#(add(X1,X2)) -> proper#(X2) proper#(first(X1,X2)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) proper#(first(X1,X2)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> proper#(X1) proper#(first(X1,X2)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> proper#(X2) proper#(first(X1,X2)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> proper#(X3) proper#(first(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(first(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> proper#(X1) proper#(first(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> proper#(X2) proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) -> first#(ok(X1),ok(X2)) -> first#(X1,X2) proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) -> first#(X1,mark(X2)) -> first#(X1,X2) proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) -> first#(mark(X1),X2) -> first#(X1,X2) proper#(s(X)) -> proper#(X) -> proper#(from(X)) -> from#(proper(X)) proper#(s(X)) -> proper#(X) -> proper#(from(X)) -> proper#(X) proper#(s(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(s(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> proper#(X1) proper#(s(X)) -> proper#(X) -> proper#(cons(X1,X2)) -> proper#(X2) proper#(s(X)) -> proper#(X) -> proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) proper#(s(X)) -> proper#(X) -> proper#(first(X1,X2)) -> proper#(X1) proper#(s(X)) -> proper#(X) -> proper#(first(X1,X2)) -> proper#(X2) proper#(s(X)) -> proper#(X) -> proper#(s(X)) -> s#(proper(X)) proper#(s(X)) -> proper#(X) -> proper#(s(X)) -> proper#(X) proper#(s(X)) -> proper#(X) -> proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) proper#(s(X)) -> proper#(X) -> proper#(add(X1,X2)) -> proper#(X1) proper#(s(X)) -> proper#(X) -> proper#(add(X1,X2)) -> proper#(X2) proper#(s(X)) -> proper#(X) -> proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) proper#(s(X)) -> proper#(X) -> proper#(if(X1,X2,X3)) -> proper#(X1) proper#(s(X)) -> proper#(X) -> proper#(if(X1,X2,X3)) -> proper#(X2) proper#(s(X)) -> proper#(X) -> proper#(if(X1,X2,X3)) -> proper#(X3) proper#(s(X)) -> proper#(X) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(s(X)) -> proper#(X) -> proper#(and(X1,X2)) -> proper#(X1) proper#(s(X)) -> proper#(X) -> proper#(and(X1,X2)) -> proper#(X2) proper#(s(X)) -> s#(proper(X)) -> s#(ok(X)) -> s#(X) proper#(add(X1,X2)) -> proper#(X2) -> proper#(from(X)) -> from#(proper(X)) proper#(add(X1,X2)) -> proper#(X2) -> proper#(from(X)) -> proper#(X) proper#(add(X1,X2)) -> proper#(X2) -> proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(add(X1,X2)) -> proper#(X2) -> proper#(cons(X1,X2)) -> proper#(X1) proper#(add(X1,X2)) -> proper#(X2) -> proper#(cons(X1,X2)) -> proper#(X2) proper#(add(X1,X2)) -> proper#(X2) -> proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) proper#(add(X1,X2)) -> proper#(X2) -> proper#(first(X1,X2)) -> proper#(X1) proper#(add(X1,X2)) -> proper#(X2) -> proper#(first(X1,X2)) -> proper#(X2) proper#(add(X1,X2)) -> proper#(X2) -> proper#(s(X)) -> s#(proper(X)) proper#(add(X1,X2)) -> proper#(X2) -> proper#(s(X)) -> proper#(X) proper#(add(X1,X2)) -> proper#(X2) -> proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) proper#(add(X1,X2)) -> proper#(X2) -> proper#(add(X1,X2)) -> proper#(X1) proper#(add(X1,X2)) -> proper#(X2) -> proper#(add(X1,X2)) -> proper#(X2) proper#(add(X1,X2)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) proper#(add(X1,X2)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> proper#(X1) proper#(add(X1,X2)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> proper#(X2) proper#(add(X1,X2)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> proper#(X3) proper#(add(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(add(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> proper#(X1) proper#(add(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> proper#(X2) proper#(add(X1,X2)) -> proper#(X1) -> proper#(from(X)) -> from#(proper(X)) proper#(add(X1,X2)) -> proper#(X1) -> proper#(from(X)) -> proper#(X) proper#(add(X1,X2)) -> proper#(X1) -> proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(add(X1,X2)) -> proper#(X1) -> proper#(cons(X1,X2)) -> proper#(X1) proper#(add(X1,X2)) -> proper#(X1) -> proper#(cons(X1,X2)) -> proper#(X2) proper#(add(X1,X2)) -> proper#(X1) -> proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) proper#(add(X1,X2)) -> proper#(X1) -> proper#(first(X1,X2)) -> proper#(X1) proper#(add(X1,X2)) -> proper#(X1) -> proper#(first(X1,X2)) -> proper#(X2) proper#(add(X1,X2)) -> proper#(X1) -> proper#(s(X)) -> s#(proper(X)) proper#(add(X1,X2)) -> proper#(X1) -> proper#(s(X)) -> proper#(X) proper#(add(X1,X2)) -> proper#(X1) -> proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) proper#(add(X1,X2)) -> proper#(X1) -> proper#(add(X1,X2)) -> proper#(X1) proper#(add(X1,X2)) -> proper#(X1) -> proper#(add(X1,X2)) -> proper#(X2) proper#(add(X1,X2)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) proper#(add(X1,X2)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> proper#(X1) proper#(add(X1,X2)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> proper#(X2) proper#(add(X1,X2)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> proper#(X3) proper#(add(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(add(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> proper#(X1) proper#(add(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> proper#(X2) proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) -> add#(ok(X1),ok(X2)) -> add#(X1,X2) proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) -> add#(mark(X1),X2) -> add#(X1,X2) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(from(X)) -> from#(proper(X)) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(from(X)) -> proper#(X) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(cons(X1,X2)) -> proper#(X1) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(cons(X1,X2)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(first(X1,X2)) -> proper#(X1) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(first(X1,X2)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(s(X)) -> s#(proper(X)) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(s(X)) -> proper#(X) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(add(X1,X2)) -> proper#(X1) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(add(X1,X2)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(if(X1,X2,X3)) -> proper#(X1) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(if(X1,X2,X3)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(if(X1,X2,X3)) -> proper#(X3) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(and(X1,X2)) -> proper#(X1) proper#(if(X1,X2,X3)) -> proper#(X3) -> proper#(and(X1,X2)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(from(X)) -> from#(proper(X)) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(from(X)) -> proper#(X) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(cons(X1,X2)) -> proper#(X1) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(cons(X1,X2)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(first(X1,X2)) -> proper#(X1) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(first(X1,X2)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(s(X)) -> s#(proper(X)) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(s(X)) -> proper#(X) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(add(X1,X2)) -> proper#(X1) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(add(X1,X2)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> proper#(X1) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> proper#(X3) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(and(X1,X2)) -> proper#(X1) proper#(if(X1,X2,X3)) -> proper#(X2) -> proper#(and(X1,X2)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(from(X)) -> from#(proper(X)) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(from(X)) -> proper#(X) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(cons(X1,X2)) -> proper#(X1) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(cons(X1,X2)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(first(X1,X2)) -> proper#(X1) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(first(X1,X2)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(s(X)) -> s#(proper(X)) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(s(X)) -> proper#(X) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(add(X1,X2)) -> proper#(X1) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(add(X1,X2)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> proper#(X1) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> proper#(X3) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(and(X1,X2)) -> proper#(X1) proper#(if(X1,X2,X3)) -> proper#(X1) -> proper#(and(X1,X2)) -> proper#(X2) proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) -> if#(ok(X1),ok(X2),ok(X3)) -> if#(X1,X2,X3) proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) -> if#(mark(X1),X2,X3) -> if#(X1,X2,X3) proper#(and(X1,X2)) -> proper#(X2) -> proper#(from(X)) -> from#(proper(X)) proper#(and(X1,X2)) -> proper#(X2) -> proper#(from(X)) -> proper#(X) proper#(and(X1,X2)) -> proper#(X2) -> proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(and(X1,X2)) -> proper#(X2) -> proper#(cons(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> proper#(X2) -> proper#(cons(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X2) -> proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) proper#(and(X1,X2)) -> proper#(X2) -> proper#(first(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> proper#(X2) -> proper#(first(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X2) -> proper#(s(X)) -> s#(proper(X)) proper#(and(X1,X2)) -> proper#(X2) -> proper#(s(X)) -> proper#(X) proper#(and(X1,X2)) -> proper#(X2) -> proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) proper#(and(X1,X2)) -> proper#(X2) -> proper#(add(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> proper#(X2) -> proper#(add(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) proper#(and(X1,X2)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> proper#(X1) proper#(and(X1,X2)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X2) -> proper#(if(X1,X2,X3)) -> proper#(X3) proper#(and(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(and(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> proper#(X2) -> proper#(and(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X1) -> proper#(from(X)) -> from#(proper(X)) proper#(and(X1,X2)) -> proper#(X1) -> proper#(from(X)) -> proper#(X) proper#(and(X1,X2)) -> proper#(X1) -> proper#(cons(X1,X2)) -> cons#(proper(X1),proper(X2)) proper#(and(X1,X2)) -> proper#(X1) -> proper#(cons(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> proper#(X1) -> proper#(cons(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X1) -> proper#(first(X1,X2)) -> first#(proper(X1),proper(X2)) proper#(and(X1,X2)) -> proper#(X1) -> proper#(first(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> proper#(X1) -> proper#(first(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X1) -> proper#(s(X)) -> s#(proper(X)) proper#(and(X1,X2)) -> proper#(X1) -> proper#(s(X)) -> proper#(X) proper#(and(X1,X2)) -> proper#(X1) -> proper#(add(X1,X2)) -> add#(proper(X1),proper(X2)) proper#(and(X1,X2)) -> proper#(X1) -> proper#(add(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> proper#(X1) -> proper#(add(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> if#(proper(X1),proper(X2),proper(X3)) proper#(and(X1,X2)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> proper#(X1) proper#(and(X1,X2)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X1) -> proper#(if(X1,X2,X3)) -> proper#(X3) proper#(and(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) proper#(and(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> proper#(X1) proper#(and(X1,X2)) -> proper#(X1) -> proper#(and(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) -> and#(ok(X1),ok(X2)) -> and#(X1,X2) proper#(and(X1,X2)) -> and#(proper(X1),proper(X2)) -> and#(mark(X1),X2) -> and#(X1,X2) if#(ok(X1),ok(X2),ok(X3)) -> if#(X1,X2,X3) -> if#(ok(X1),ok(X2),ok(X3)) -> if#(X1,X2,X3) if#(ok(X1),ok(X2),ok(X3)) -> if#(X1,X2,X3) -> if#(mark(X1),X2,X3) -> if#(X1,X2,X3) if#(mark(X1),X2,X3) -> if#(X1,X2,X3) -> if#(ok(X1),ok(X2),ok(X3)) -> if#(X1,X2,X3) if#(mark(X1),X2,X3) -> if#(X1,X2,X3) -> if#(mark(X1),X2,X3) -> if#(X1,X2,X3) and#(ok(X1),ok(X2)) -> and#(X1,X2) -> and#(ok(X1),ok(X2)) -> and#(X1,X2) and#(ok(X1),ok(X2)) -> and#(X1,X2) -> and#(mark(X1),X2) -> and#(X1,X2) and#(mark(X1),X2) -> and#(X1,X2) -> and#(ok(X1),ok(X2)) -> and#(X1,X2) and#(mark(X1),X2) -> and#(X1,X2) -> and#(mark(X1),X2) -> and#(X1,X2) from#(ok(X)) -> from#(X) -> from#(ok(X)) -> from#(X) cons#(ok(X1),ok(X2)) -> cons#(X1,X2) -> cons#(ok(X1),ok(X2)) -> cons#(X1,X2) first#(ok(X1),ok(X2)) -> first#(X1,X2) -> first#(ok(X1),ok(X2)) -> first#(X1,X2) first#(ok(X1),ok(X2)) -> first#(X1,X2) -> first#(X1,mark(X2)) -> first#(X1,X2) first#(ok(X1),ok(X2)) -> first#(X1,X2) -> first#(mark(X1),X2) -> first#(X1,X2) first#(mark(X1),X2) -> first#(X1,X2) -> first#(ok(X1),ok(X2)) -> first#(X1,X2) first#(mark(X1),X2) -> first#(X1,X2) -> first#(X1,mark(X2)) -> first#(X1,X2) first#(mark(X1),X2) -> first#(X1,X2) -> first#(mark(X1),X2) -> first#(X1,X2) first#(X1,mark(X2)) -> first#(X1,X2) -> first#(ok(X1),ok(X2)) -> first#(X1,X2) first#(X1,mark(X2)) -> first#(X1,X2) -> first#(X1,mark(X2)) -> first#(X1,X2) first#(X1,mark(X2)) -> first#(X1,X2) -> first#(mark(X1),X2) -> first#(X1,X2) s#(ok(X)) -> s#(X) -> s#(ok(X)) -> s#(X) add#(ok(X1),ok(X2)) -> add#(X1,X2) -> add#(ok(X1),ok(X2)) -> add#(X1,X2) add#(ok(X1),ok(X2)) -> add#(X1,X2) -> add#(mark(X1),X2) -> add#(X1,X2) add#(mark(X1),X2) -> add#(X1,X2) -> add#(ok(X1),ok(X2)) -> add#(X1,X2) add#(mark(X1),X2) -> add#(X1,X2) -> add#(mark(X1),X2) -> add#(X1,X2) active#(from(X)) -> from#(s(X)) -> from#(ok(X)) -> from#(X) active#(from(X)) -> cons#(X,from(s(X))) -> cons#(ok(X1),ok(X2)) -> cons#(X1,X2) active#(from(X)) -> s#(X) -> s#(ok(X)) -> s#(X) active#(first(s(X),cons(Y,Z))) -> cons#(Y,first(X,Z)) -> cons#(ok(X1),ok(X2)) -> cons#(X1,X2) active#(first(s(X),cons(Y,Z))) -> first#(X,Z) -> first#(ok(X1),ok(X2)) -> first#(X1,X2) active#(first(s(X),cons(Y,Z))) -> first#(X,Z) -> first#(X1,mark(X2)) -> first#(X1,X2) active#(first(s(X),cons(Y,Z))) -> first#(X,Z) -> first#(mark(X1),X2) -> first#(X1,X2) active#(first(X1,X2)) -> first#(active(X1),X2) -> first#(ok(X1),ok(X2)) -> first#(X1,X2) active#(first(X1,X2)) -> first#(active(X1),X2) -> first#(X1,mark(X2)) -> first#(X1,X2) active#(first(X1,X2)) -> first#(active(X1),X2) -> first#(mark(X1),X2) -> first#(X1,X2) active#(first(X1,X2)) -> first#(X1,active(X2)) -> first#(ok(X1),ok(X2)) -> first#(X1,X2) active#(first(X1,X2)) -> first#(X1,active(X2)) -> first#(X1,mark(X2)) -> first#(X1,X2) active#(first(X1,X2)) -> first#(X1,active(X2)) -> first#(mark(X1),X2) -> first#(X1,X2) active#(first(X1,X2)) -> active#(X2) -> active#(first(X1,X2)) -> first#(X1,active(X2)) active#(first(X1,X2)) -> active#(X2) -> active#(first(X1,X2)) -> active#(X2) active#(first(X1,X2)) -> active#(X2) -> active#(first(X1,X2)) -> first#(active(X1),X2) active#(first(X1,X2)) -> active#(X2) -> active#(first(X1,X2)) -> active#(X1) active#(first(X1,X2)) -> active#(X2) -> active#(add(X1,X2)) -> add#(active(X1),X2) active#(first(X1,X2)) -> active#(X2) -> active#(add(X1,X2)) -> active#(X1) active#(first(X1,X2)) -> active#(X2) -> active#(if(X1,X2,X3)) -> if#(active(X1),X2,X3) active#(first(X1,X2)) -> active#(X2) -> active#(if(X1,X2,X3)) -> active#(X1) active#(first(X1,X2)) -> active#(X2) -> active#(and(X1,X2)) -> and#(active(X1),X2) active#(first(X1,X2)) -> active#(X2) -> active#(and(X1,X2)) -> active#(X1) active#(first(X1,X2)) -> active#(X2) -> active#(from(X)) -> cons#(X,from(s(X))) active#(first(X1,X2)) -> active#(X2) -> active#(from(X)) -> from#(s(X)) active#(first(X1,X2)) -> active#(X2) -> active#(from(X)) -> s#(X) active#(first(X1,X2)) -> active#(X2) -> active#(first(s(X),cons(Y,Z))) -> cons#(Y,first(X,Z)) active#(first(X1,X2)) -> active#(X2) -> active#(first(s(X),cons(Y,Z))) -> first#(X,Z) active#(first(X1,X2)) -> active#(X2) -> active#(add(s(X),Y)) -> s#(add(X,Y)) active#(first(X1,X2)) -> active#(X2) -> active#(add(s(X),Y)) -> add#(X,Y) active#(first(X1,X2)) -> active#(X1) -> active#(first(X1,X2)) -> first#(X1,active(X2)) active#(first(X1,X2)) -> active#(X1) -> active#(first(X1,X2)) -> active#(X2) active#(first(X1,X2)) -> active#(X1) -> active#(first(X1,X2)) -> first#(active(X1),X2) active#(first(X1,X2)) -> active#(X1) -> active#(first(X1,X2)) -> active#(X1) active#(first(X1,X2)) -> active#(X1) -> active#(add(X1,X2)) -> add#(active(X1),X2) active#(first(X1,X2)) -> active#(X1) -> active#(add(X1,X2)) -> active#(X1) active#(first(X1,X2)) -> active#(X1) -> active#(if(X1,X2,X3)) -> if#(active(X1),X2,X3) active#(first(X1,X2)) -> active#(X1) -> active#(if(X1,X2,X3)) -> active#(X1) active#(first(X1,X2)) -> active#(X1) -> active#(and(X1,X2)) -> and#(active(X1),X2) active#(first(X1,X2)) -> active#(X1) -> active#(and(X1,X2)) -> active#(X1) active#(first(X1,X2)) -> active#(X1) -> active#(from(X)) -> cons#(X,from(s(X))) active#(first(X1,X2)) -> active#(X1) -> active#(from(X)) -> from#(s(X)) active#(first(X1,X2)) -> active#(X1) -> active#(from(X)) -> s#(X) active#(first(X1,X2)) -> active#(X1) -> active#(first(s(X),cons(Y,Z))) -> cons#(Y,first(X,Z)) active#(first(X1,X2)) -> active#(X1) -> active#(first(s(X),cons(Y,Z))) -> first#(X,Z) active#(first(X1,X2)) -> active#(X1) -> active#(add(s(X),Y)) -> s#(add(X,Y)) active#(first(X1,X2)) -> active#(X1) -> active#(add(s(X),Y)) -> add#(X,Y) active#(add(s(X),Y)) -> s#(add(X,Y)) -> s#(ok(X)) -> s#(X) active#(add(s(X),Y)) -> add#(X,Y) -> add#(ok(X1),ok(X2)) -> add#(X1,X2) active#(add(s(X),Y)) -> add#(X,Y) -> add#(mark(X1),X2) -> add#(X1,X2) active#(add(X1,X2)) -> add#(active(X1),X2) -> add#(ok(X1),ok(X2)) -> add#(X1,X2) active#(add(X1,X2)) -> add#(active(X1),X2) -> add#(mark(X1),X2) -> add#(X1,X2) active#(add(X1,X2)) -> active#(X1) -> active#(first(X1,X2)) -> first#(X1,active(X2)) active#(add(X1,X2)) -> active#(X1) -> active#(first(X1,X2)) -> active#(X2) active#(add(X1,X2)) -> active#(X1) -> active#(first(X1,X2)) -> first#(active(X1),X2) active#(add(X1,X2)) -> active#(X1) -> active#(first(X1,X2)) -> active#(X1) active#(add(X1,X2)) -> active#(X1) -> active#(add(X1,X2)) -> add#(active(X1),X2) active#(add(X1,X2)) -> active#(X1) -> active#(add(X1,X2)) -> active#(X1) active#(add(X1,X2)) -> active#(X1) -> active#(if(X1,X2,X3)) -> if#(active(X1),X2,X3) active#(add(X1,X2)) -> active#(X1) -> active#(if(X1,X2,X3)) -> active#(X1) active#(add(X1,X2)) -> active#(X1) -> active#(and(X1,X2)) -> and#(active(X1),X2) active#(add(X1,X2)) -> active#(X1) -> active#(and(X1,X2)) -> active#(X1) active#(add(X1,X2)) -> active#(X1) -> active#(from(X)) -> cons#(X,from(s(X))) active#(add(X1,X2)) -> active#(X1) -> active#(from(X)) -> from#(s(X)) active#(add(X1,X2)) -> active#(X1) -> active#(from(X)) -> s#(X) active#(add(X1,X2)) -> active#(X1) -> active#(first(s(X),cons(Y,Z))) -> cons#(Y,first(X,Z)) active#(add(X1,X2)) -> active#(X1) -> active#(first(s(X),cons(Y,Z))) -> first#(X,Z) active#(add(X1,X2)) -> active#(X1) -> active#(add(s(X),Y)) -> s#(add(X,Y)) active#(add(X1,X2)) -> active#(X1) -> active#(add(s(X),Y)) -> add#(X,Y) active#(if(X1,X2,X3)) -> if#(active(X1),X2,X3) -> if#(ok(X1),ok(X2),ok(X3)) -> if#(X1,X2,X3) active#(if(X1,X2,X3)) -> if#(active(X1),X2,X3) -> if#(mark(X1),X2,X3) -> if#(X1,X2,X3) active#(if(X1,X2,X3)) -> active#(X1) -> active#(first(X1,X2)) -> first#(X1,active(X2)) active#(if(X1,X2,X3)) -> active#(X1) -> active#(first(X1,X2)) -> active#(X2) active#(if(X1,X2,X3)) -> active#(X1) -> active#(first(X1,X2)) -> first#(active(X1),X2) active#(if(X1,X2,X3)) -> active#(X1) -> active#(first(X1,X2)) -> active#(X1) active#(if(X1,X2,X3)) -> active#(X1) -> active#(add(X1,X2)) -> add#(active(X1),X2) active#(if(X1,X2,X3)) -> active#(X1) -> active#(add(X1,X2)) -> active#(X1) active#(if(X1,X2,X3)) -> active#(X1) -> active#(if(X1,X2,X3)) -> if#(active(X1),X2,X3) active#(if(X1,X2,X3)) -> active#(X1) -> active#(if(X1,X2,X3)) -> active#(X1) active#(if(X1,X2,X3)) -> active#(X1) -> active#(and(X1,X2)) -> and#(active(X1),X2) active#(if(X1,X2,X3)) -> active#(X1) -> active#(and(X1,X2)) -> active#(X1) active#(if(X1,X2,X3)) -> active#(X1) -> active#(from(X)) -> cons#(X,from(s(X))) active#(if(X1,X2,X3)) -> active#(X1) -> active#(from(X)) -> from#(s(X)) active#(if(X1,X2,X3)) -> active#(X1) -> active#(from(X)) -> s#(X) active#(if(X1,X2,X3)) -> active#(X1) -> active#(first(s(X),cons(Y,Z))) -> cons#(Y,first(X,Z)) active#(if(X1,X2,X3)) -> active#(X1) -> active#(first(s(X),cons(Y,Z))) -> first#(X,Z) active#(if(X1,X2,X3)) -> active#(X1) -> active#(add(s(X),Y)) -> s#(add(X,Y)) active#(if(X1,X2,X3)) -> active#(X1) -> active#(add(s(X),Y)) -> add#(X,Y) active#(and(X1,X2)) -> and#(active(X1),X2) -> and#(ok(X1),ok(X2)) -> and#(X1,X2) active#(and(X1,X2)) -> and#(active(X1),X2) -> and#(mark(X1),X2) -> and#(X1,X2) active#(and(X1,X2)) -> active#(X1) -> active#(first(X1,X2)) -> first#(X1,active(X2)) active#(and(X1,X2)) -> active#(X1) -> active#(first(X1,X2)) -> active#(X2) active#(and(X1,X2)) -> active#(X1) -> active#(first(X1,X2)) -> first#(active(X1),X2) active#(and(X1,X2)) -> active#(X1) -> active#(first(X1,X2)) -> active#(X1) active#(and(X1,X2)) -> active#(X1) -> active#(add(X1,X2)) -> add#(active(X1),X2) active#(and(X1,X2)) -> active#(X1) -> active#(add(X1,X2)) -> active#(X1) active#(and(X1,X2)) -> active#(X1) -> active#(if(X1,X2,X3)) -> if#(active(X1),X2,X3) active#(and(X1,X2)) -> active#(X1) -> active#(if(X1,X2,X3)) -> active#(X1) active#(and(X1,X2)) -> active#(X1) -> active#(and(X1,X2)) -> and#(active(X1),X2) active#(and(X1,X2)) -> active#(X1) -> active#(and(X1,X2)) -> active#(X1) active#(and(X1,X2)) -> active#(X1) -> active#(from(X)) -> cons#(X,from(s(X))) active#(and(X1,X2)) -> active#(X1) -> active#(from(X)) -> from#(s(X)) active#(and(X1,X2)) -> active#(X1) -> active#(from(X)) -> s#(X) active#(and(X1,X2)) -> active#(X1) -> active#(first(s(X),cons(Y,Z))) -> cons#(Y,first(X,Z)) active#(and(X1,X2)) -> active#(X1) -> active#(first(s(X),cons(Y,Z))) -> first#(X,Z) active#(and(X1,X2)) -> active#(X1) -> active#(add(s(X),Y)) -> s#(add(X,Y)) active#(and(X1,X2)) -> active#(X1) -> active#(add(s(X),Y)) -> add#(X,Y) SCC Processor: #sccs: 10 #rules: 32 #arcs: 448/2809 DPs: top#(ok(X)) -> top#(active(X)) top#(mark(X)) -> top#(proper(X)) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) KBO Processor: argument filtering: pi(true) = [] pi(and) = [0,1] pi(active) = 0 pi(mark) = [0] pi(false) = [] pi(if) = [0,1,2] pi(0) = [] pi(add) = [0,1] pi(s) = [] pi(first) = [0,1] pi(nil) = [] pi(cons) = 0 pi(from) = [0] pi(proper) = [0] pi(ok) = 0 pi(top) = [] pi(top#) = 0 weight function: w0 = 1 w(top#) = w(top) = w(from) = w(nil) = w(s) = w(0) = w(false) = w( mark) = w(true) = 1 w(ok) = w(proper) = w(cons) = w(first) = w(add) = w(if) = w(active) = w( and) = 0 precedence: top ~ proper > first ~ if ~ and > from ~ add > top# ~ ok ~ cons ~ nil ~ s ~ 0 ~ false ~ mark ~ active ~ true problem: DPs: top#(ok(X)) -> top#(active(X)) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Arctic Interpretation Processor: dimension: 1 interpretation: [top#](x0) = x0, [top](x0) = 1, [ok](x0) = 1x0, [proper](x0) = 1x0, [from](x0) = 3x0, [cons](x0, x1) = x0 + x1, [nil] = 3, [first](x0, x1) = x0 + x1, [s](x0) = x0, [add](x0, x1) = x0 + 1x1, [0] = 3, [if](x0, x1, x2) = x0 + x1 + x2, [false] = 0, [mark](x0) = x0, [active](x0) = x0, [and](x0, x1) = x0 + x1, [true] = 0 orientation: top#(ok(X)) = 1X >= X = top#(active(X)) active(and(true(),X)) = X + 0 >= X = mark(X) active(and(false(),Y)) = Y + 0 >= 0 = mark(false()) active(if(true(),X,Y)) = X + Y + 0 >= X = mark(X) active(if(false(),X,Y)) = X + Y + 0 >= Y = mark(Y) active(add(0(),X)) = 1X + 3 >= X = mark(X) active(add(s(X),Y)) = X + 1Y >= X + 1Y = mark(s(add(X,Y))) active(first(0(),X)) = X + 3 >= 3 = mark(nil()) active(first(s(X),cons(Y,Z))) = X + Y + Z >= X + Y + Z = mark(cons(Y,first(X,Z))) active(from(X)) = 3X >= 3X = mark(cons(X,from(s(X)))) active(and(X1,X2)) = X1 + X2 >= X1 + X2 = and(active(X1),X2) active(if(X1,X2,X3)) = X1 + X2 + X3 >= X1 + X2 + X3 = if(active(X1),X2,X3) active(add(X1,X2)) = X1 + 1X2 >= X1 + 1X2 = add(active(X1),X2) active(first(X1,X2)) = X1 + X2 >= X1 + X2 = first(active(X1),X2) active(first(X1,X2)) = X1 + X2 >= X1 + X2 = first(X1,active(X2)) and(mark(X1),X2) = X1 + X2 >= X1 + X2 = mark(and(X1,X2)) if(mark(X1),X2,X3) = X1 + X2 + X3 >= X1 + X2 + X3 = mark(if(X1,X2,X3)) add(mark(X1),X2) = X1 + 1X2 >= X1 + 1X2 = mark(add(X1,X2)) first(mark(X1),X2) = X1 + X2 >= X1 + X2 = mark(first(X1,X2)) first(X1,mark(X2)) = X1 + X2 >= X1 + X2 = mark(first(X1,X2)) proper(and(X1,X2)) = 1X1 + 1X2 >= 1X1 + 1X2 = and(proper(X1),proper(X2)) proper(true()) = 1 >= 1 = ok(true()) proper(false()) = 1 >= 1 = ok(false()) proper(if(X1,X2,X3)) = 1X1 + 1X2 + 1X3 >= 1X1 + 1X2 + 1X3 = if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) = 1X1 + 2X2 >= 1X1 + 2X2 = add(proper(X1),proper(X2)) proper(0()) = 4 >= 4 = ok(0()) proper(s(X)) = 1X >= 1X = s(proper(X)) proper(first(X1,X2)) = 1X1 + 1X2 >= 1X1 + 1X2 = first(proper(X1),proper(X2)) proper(nil()) = 4 >= 4 = ok(nil()) proper(cons(X1,X2)) = 1X1 + 1X2 >= 1X1 + 1X2 = cons(proper(X1),proper(X2)) proper(from(X)) = 4X >= 4X = from(proper(X)) and(ok(X1),ok(X2)) = 1X1 + 1X2 >= 1X1 + 1X2 = ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) = 1X1 + 1X2 + 1X3 >= 1X1 + 1X2 + 1X3 = ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) = 1X1 + 2X2 >= 1X1 + 2X2 = ok(add(X1,X2)) s(ok(X)) = 1X >= 1X = ok(s(X)) first(ok(X1),ok(X2)) = 1X1 + 1X2 >= 1X1 + 1X2 = ok(first(X1,X2)) cons(ok(X1),ok(X2)) = 1X1 + 1X2 >= 1X1 + 1X2 = ok(cons(X1,X2)) from(ok(X)) = 4X >= 4X = ok(from(X)) top(mark(X)) = 1 >= 1 = top(proper(X)) top(ok(X)) = 1 >= 1 = top(active(X)) problem: DPs: TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: active#(and(X1,X2)) -> active#(X1) active#(if(X1,X2,X3)) -> active#(X1) active#(add(X1,X2)) -> active#(X1) active#(first(X1,X2)) -> active#(X1) active#(first(X1,X2)) -> active#(X2) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(active#) = 0 problem: DPs: TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: proper#(and(X1,X2)) -> proper#(X2) proper#(and(X1,X2)) -> proper#(X1) proper#(if(X1,X2,X3)) -> proper#(X3) proper#(if(X1,X2,X3)) -> proper#(X2) proper#(if(X1,X2,X3)) -> proper#(X1) proper#(add(X1,X2)) -> proper#(X2) proper#(add(X1,X2)) -> proper#(X1) proper#(s(X)) -> proper#(X) proper#(first(X1,X2)) -> proper#(X2) proper#(first(X1,X2)) -> proper#(X1) proper#(cons(X1,X2)) -> proper#(X2) proper#(cons(X1,X2)) -> proper#(X1) proper#(from(X)) -> proper#(X) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(proper#) = 0 problem: DPs: TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: from#(ok(X)) -> from#(X) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(from#) = 0 problem: DPs: TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: cons#(ok(X1),ok(X2)) -> cons#(X1,X2) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(cons#) = 1 problem: DPs: TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: first#(mark(X1),X2) -> first#(X1,X2) first#(X1,mark(X2)) -> first#(X1,X2) first#(ok(X1),ok(X2)) -> first#(X1,X2) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(first#) = 1 problem: DPs: first#(mark(X1),X2) -> first#(X1,X2) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(first#) = 0 problem: DPs: TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: s#(ok(X)) -> s#(X) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(s#) = 0 problem: DPs: TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: add#(mark(X1),X2) -> add#(X1,X2) add#(ok(X1),ok(X2)) -> add#(X1,X2) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(add#) = 1 problem: DPs: add#(mark(X1),X2) -> add#(X1,X2) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(add#) = 0 problem: DPs: TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: if#(mark(X1),X2,X3) -> if#(X1,X2,X3) if#(ok(X1),ok(X2),ok(X3)) -> if#(X1,X2,X3) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(if#) = 2 problem: DPs: if#(mark(X1),X2,X3) -> if#(X1,X2,X3) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(if#) = 0 problem: DPs: TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed DPs: and#(mark(X1),X2) -> and#(X1,X2) and#(ok(X1),ok(X2)) -> and#(X1,X2) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(and#) = 1 problem: DPs: and#(mark(X1),X2) -> and#(X1,X2) TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Subterm Criterion Processor: simple projection: pi(and#) = 0 problem: DPs: TRS: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Qed