(COMMENT Transformation of outermost rewriting to context sensitive rewriting of: Example 5.7 in Matthias Raffelsieper and Hans Zantema "A transformational approach to prove outermost termination automatically" (note that, the transformation used here is not described in this paper) f(h(x)) -> f(i(x)) h(x) -> f(h(x)) f(i(x)) -> x i(x) -> h(x) ) (VAR x) (STRATEGY CONTEXTSENSITIVE (f_0 1) (*top*_0 1) (f_1) (h_1) (i_1)) (RULES f_1 (h_1 (x)) -> f_1 (i_1 (x)) h_1 (x) -> f_1 (h_1 (x)) *top*_0 (f_1 (i_1 (x))) -> *top*_0 (x) f_0 (f_1 (i_1 (x))) -> f_1 (x) f_1 (i_1 (x)) -> x i_1 (x) -> h_1 (x))