Require terminaison.

Require Relations.

Require term.

Require List.

Require equational_theory.

Require rpo_extension.

Require equational_extension.

Require closure_extension.

Require term_extension.

Require dp.

Require Inclusion.

Require or_ext_generated.

Require ZArith.

Require ring_extention.

Require Zwf.

Require Inverse_Image.

Require matrix.

Require more_list_extention.

Import List.

Import ZArith.

Set Implicit Arguments.

Module algebra.
 Module F
  <:term.Signature.
  Inductive symb  :
   Set := 
     (* id_concat *)
    | id_concat : symb
     (* id_x *)
    | id_x : symb
     (* id_cons *)
    | id_cons : symb
     (* id_true *)
    | id_true : symb
     (* id_leaf *)
    | id_leaf : symb
     (* id_false *)
    | id_false : symb
     (* id_less_leaves *)
    | id_less_leaves : symb
  .
  
  
  Definition symb_eq_bool (f1 f2:symb) : bool := 
    match f1,f2 with
      | id_concat,id_concat => true
      | id_x,id_x => true
      | id_cons,id_cons => true
      | id_true,id_true => true
      | id_leaf,id_leaf => true
      | id_false,id_false => true
      | id_less_leaves,id_less_leaves => true
      | _,_ => false
      end.
  
  
   (* Proof of decidability of equality over symb *)
  Definition symb_eq_bool_ok(f1 f2:symb) :
   match symb_eq_bool f1 f2 with
     | true => f1 = f2
     | false => f1 <> f2
     end.
  Proof.
    intros f1 f2.
    
    refine match f1 as u1,f2 as u2 return 
             match symb_eq_bool u1 u2 return 
               Prop with
               | true => u1 = u2
               | false => u1 <> u2
               end with
             | id_concat,id_concat => refl_equal _
             | id_x,id_x => refl_equal _
             | id_cons,id_cons => refl_equal _
             | id_true,id_true => refl_equal _
             | id_leaf,id_leaf => refl_equal _
             | id_false,id_false => refl_equal _
             | id_less_leaves,id_less_leaves => refl_equal _
             | _,_ => _
             end;intros abs;discriminate.
  Defined.
  
  
  Definition arity (f:symb) := 
    match f with
      | id_concat => term.Free 2
      | id_x => term.Free 0
      | id_cons => term.Free 2
      | id_true => term.Free 0
      | id_leaf => term.Free 0
      | id_false => term.Free 0
      | id_less_leaves => term.Free 2
      end.
  
  
  Definition symb_order (f1 f2:symb) : bool := 
    match f1,f2 with
      | id_concat,id_concat => true
      | id_concat,id_x => false
      | id_concat,id_cons => false
      | id_concat,id_true => false
      | id_concat,id_leaf => false
      | id_concat,id_false => false
      | id_concat,id_less_leaves => false
      | id_x,id_concat => true
      | id_x,id_x => true
      | id_x,id_cons => false
      | id_x,id_true => false
      | id_x,id_leaf => false
      | id_x,id_false => false
      | id_x,id_less_leaves => false
      | id_cons,id_concat => true
      | id_cons,id_x => true
      | id_cons,id_cons => true
      | id_cons,id_true => false
      | id_cons,id_leaf => false
      | id_cons,id_false => false
      | id_cons,id_less_leaves => false
      | id_true,id_concat => true
      | id_true,id_x => true
      | id_true,id_cons => true
      | id_true,id_true => true
      | id_true,id_leaf => false
      | id_true,id_false => false
      | id_true,id_less_leaves => false
      | id_leaf,id_concat => true
      | id_leaf,id_x => true
      | id_leaf,id_cons => true
      | id_leaf,id_true => true
      | id_leaf,id_leaf => true
      | id_leaf,id_false => false
      | id_leaf,id_less_leaves => false
      | id_false,id_concat => true
      | id_false,id_x => true
      | id_false,id_cons => true
      | id_false,id_true => true
      | id_false,id_leaf => true
      | id_false,id_false => true
      | id_false,id_less_leaves => false
      | id_less_leaves,id_concat => true
      | id_less_leaves,id_x => true
      | id_less_leaves,id_cons => true
      | id_less_leaves,id_true => true
      | id_less_leaves,id_leaf => true
      | id_less_leaves,id_false => true
      | id_less_leaves,id_less_leaves => true
      end.
  
  
  Module Symb.
   Definition A  := symb.
   
   Definition eq_A  := @eq A.
   
   
   Definition eq_proof : equivalence A eq_A.
   Proof.
     constructor.
     red ;reflexivity .
     red ;intros ;transitivity y ;assumption.
     red ;intros ;symmetry ;assumption.
   Defined.
   
   
   Add Relation A eq_A 
  reflexivity proved by (@equiv_refl _ _ eq_proof)
    symmetry proved by (@equiv_sym _ _ eq_proof)
      transitivity proved by (@equiv_trans _ _ eq_proof) as EQA
.
   
   Definition eq_bool  := symb_eq_bool.
   
   Definition eq_bool_ok  := symb_eq_bool_ok.
  End Symb.
  
  Export Symb.
 End F.
 
 Module Alg := term.Make'(F)(term_extension.IntVars).
 
 Module Alg_ext := term_extension.Make(Alg).
 
 Module EQT := equational_theory.Make(Alg).
 
 Module EQT_ext := equational_extension.Make(EQT).
End algebra.

Module R_xml_0_deep_rew.
 Inductive R_xml_0_rules  :
  algebra.Alg.term ->algebra.Alg.term ->Prop := 
    (* concat(leaf,y_) -> y_ *)
   | R_xml_0_rule_0 :
    R_xml_0_rules (algebra.Alg.Var 1) 
     (algebra.Alg.Term algebra.F.id_concat ((algebra.Alg.Term 
      algebra.F.id_leaf nil)::(algebra.Alg.Var 1)::nil))
    (* concat(cons(u_,v_),y_) -> cons(u_,concat(v_,y_)) *)
   | R_xml_0_rule_1 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Var 2)::
                   (algebra.Alg.Term algebra.F.id_concat 
                   ((algebra.Alg.Var 3)::(algebra.Alg.Var 1)::nil))::nil)) 
     (algebra.Alg.Term algebra.F.id_concat ((algebra.Alg.Term 
      algebra.F.id_cons ((algebra.Alg.Var 2)::(algebra.Alg.Var 3)::nil))::
      (algebra.Alg.Var 1)::nil))
    (* less_leaves(x,leaf) -> false *)
   | R_xml_0_rule_2 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_false nil) 
     (algebra.Alg.Term algebra.F.id_less_leaves ((algebra.Alg.Term 
      algebra.F.id_x nil)::(algebra.Alg.Term algebra.F.id_leaf nil)::nil))
    (* less_leaves(leaf,cons(w_,z_)) -> true *)
   | R_xml_0_rule_3 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_true nil) 
     (algebra.Alg.Term algebra.F.id_less_leaves ((algebra.Alg.Term 
      algebra.F.id_leaf nil)::(algebra.Alg.Term algebra.F.id_cons 
      ((algebra.Alg.Var 4)::(algebra.Alg.Var 5)::nil))::nil))
   
    (* less_leaves(cons(u_,v_),cons(w_,z_)) -> less_leaves(concat(u_,v_),concat(w_,z_)) *)
   | R_xml_0_rule_4 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_less_leaves 
                   ((algebra.Alg.Term algebra.F.id_concat 
                   ((algebra.Alg.Var 2)::(algebra.Alg.Var 3)::nil))::
                   (algebra.Alg.Term algebra.F.id_concat 
                   ((algebra.Alg.Var 4)::(algebra.Alg.Var 5)::nil))::nil)) 
     (algebra.Alg.Term algebra.F.id_less_leaves ((algebra.Alg.Term 
      algebra.F.id_cons ((algebra.Alg.Var 2)::(algebra.Alg.Var 3)::nil))::
      (algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Var 4)::
      (algebra.Alg.Var 5)::nil))::nil))
 .
 
 
 Definition R_xml_0_rule_as_list_0  := 
   ((algebra.Alg.Term algebra.F.id_concat ((algebra.Alg.Term 
     algebra.F.id_leaf nil)::(algebra.Alg.Var 1)::nil)),(algebra.Alg.Var 1))::
    nil.
 
 
 Definition R_xml_0_rule_as_list_1  := 
   ((algebra.Alg.Term algebra.F.id_concat ((algebra.Alg.Term 
     algebra.F.id_cons ((algebra.Alg.Var 2)::(algebra.Alg.Var 3)::nil))::
     (algebra.Alg.Var 1)::nil)),
    (algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Var 2)::
     (algebra.Alg.Term algebra.F.id_concat ((algebra.Alg.Var 3)::
     (algebra.Alg.Var 1)::nil))::nil)))::R_xml_0_rule_as_list_0.
 
 
 Definition R_xml_0_rule_as_list_2  := 
   ((algebra.Alg.Term algebra.F.id_less_leaves ((algebra.Alg.Term 
     algebra.F.id_x nil)::(algebra.Alg.Term algebra.F.id_leaf nil)::nil)),
    (algebra.Alg.Term algebra.F.id_false nil))::R_xml_0_rule_as_list_1.
 
 
 Definition R_xml_0_rule_as_list_3  := 
   ((algebra.Alg.Term algebra.F.id_less_leaves ((algebra.Alg.Term 
     algebra.F.id_leaf nil)::(algebra.Alg.Term algebra.F.id_cons 
     ((algebra.Alg.Var 4)::(algebra.Alg.Var 5)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_true nil))::R_xml_0_rule_as_list_2.
 
 
 Definition R_xml_0_rule_as_list_4  := 
   ((algebra.Alg.Term algebra.F.id_less_leaves ((algebra.Alg.Term 
     algebra.F.id_cons ((algebra.Alg.Var 2)::(algebra.Alg.Var 3)::nil))::
     (algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Var 4)::
     (algebra.Alg.Var 5)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_less_leaves ((algebra.Alg.Term 
     algebra.F.id_concat ((algebra.Alg.Var 2)::(algebra.Alg.Var 3)::nil))::
     (algebra.Alg.Term algebra.F.id_concat ((algebra.Alg.Var 4)::
     (algebra.Alg.Var 5)::nil))::nil)))::R_xml_0_rule_as_list_3.
 
 Definition R_xml_0_rule_as_list  := R_xml_0_rule_as_list_4.
 
 
 Lemma R_xml_0_rules_included :
  forall l r, R_xml_0_rules r l <-> In (l,r) R_xml_0_rule_as_list.
 Proof.
   intros l r.
   constructor.
   intros H.
   
   case H;clear H;
    (apply (more_list.mem_impl_in (@eq (algebra.Alg.term*algebra.Alg.term)));
     [tauto|idtac]);
    match goal with
      |  |- _ _ _ ?t ?l =>
       let u := fresh "u" in 
        (generalize (more_list.mem_bool_ok _ _ 
                      algebra.Alg_ext.eq_term_term_bool_ok t l);
          set (u:=more_list.mem_bool algebra.Alg_ext.eq_term_term_bool t l) in *;
          vm_compute in u|-;unfold u in *;clear u;intros H;refine H)
      end
    .
   intros H.
   vm_compute in H|-.
   rewrite  <- or_ext_generated.or6_equiv in H|-.
   case H;clear H;intros H.
   injection H;intros ;subst;constructor 5.
   injection H;intros ;subst;constructor 4.
   injection H;intros ;subst;constructor 3.
   injection H;intros ;subst;constructor 2.
   injection H;intros ;subst;constructor 1.
   elim H.
 Qed.
 
 
 Lemma R_xml_0_non_var : forall x t, ~R_xml_0_rules t (algebra.EQT.T.Var x).
 Proof.
   intros x t H.
   inversion H.
 Qed.
 
 
 Lemma R_xml_0_reg :
  forall s t, 
   (R_xml_0_rules s t) ->
    forall x, In x (algebra.Alg.var_list s) ->In x (algebra.Alg.var_list t).
 Proof.
   intros s t H.
   
   inversion H;intros x Hx;
    (apply (more_list.mem_impl_in (@eq algebra.Alg.variable));[tauto|idtac]);
    apply (more_list.in_impl_mem (@eq algebra.Alg.variable)) in Hx;
    vm_compute in Hx|-*;tauto.
 Qed.
 
 
 Inductive and_5 (x7 x8 x9 x10 x11:Prop) :
  Prop := 
   | conj_5 : x7->x8->x9->x10->x11->and_5 x7 x8 x9 x10 x11
 .
 
 
 Lemma are_constuctors_of_R_xml_0 :
  forall t t', 
   (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) t' t) ->
    and_5 (t = (algebra.Alg.Term algebra.F.id_x nil) ->
           t' = (algebra.Alg.Term algebra.F.id_x nil)) 
     (forall x8 x10, 
      t = (algebra.Alg.Term algebra.F.id_cons (x8::x10::nil)) ->
       exists x7,
         exists x9,
           t' = (algebra.Alg.Term algebra.F.id_cons (x7::x9::nil))/\ 
           (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) 
             x7 x8)/\ 
           (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) 
             x9 x10)) 
     (t = (algebra.Alg.Term algebra.F.id_true nil) ->
      t' = (algebra.Alg.Term algebra.F.id_true nil)) 
     (t = (algebra.Alg.Term algebra.F.id_leaf nil) ->
      t' = (algebra.Alg.Term algebra.F.id_leaf nil)) 
     (t = (algebra.Alg.Term algebra.F.id_false nil) ->
      t' = (algebra.Alg.Term algebra.F.id_false nil)).
 Proof.
   intros t t' H.
   
   induction H as [|y IH z z_to_y] using 
   closure_extension.refl_trans_clos_ind2.
   constructor 1.
   intros H;intuition;constructor 1.
   intros x8 x10 H;exists x8;exists x10;intuition;constructor 1.
   intros H;intuition;constructor 1.
   intros H;intuition;constructor 1.
   intros H;intuition;constructor 1.
   inversion z_to_y as [t1 t2 H H0 H1|f l1 l2 H0 H H2];clear z_to_y;subst.
   
   inversion H as [t1 t2 sigma H2 H1 H0];clear H IH;subst;inversion H2;
    clear ;constructor;try (intros until 0 );clear ;intros abs;
    discriminate abs.
   destruct IH as [H_id_x H_id_cons H_id_true H_id_leaf H_id_false].
   constructor.
   
   clear H_id_cons H_id_true H_id_leaf H_id_false;intros H;injection H;
    clear H;intros ;subst;
    repeat (
    match goal with
      | H:closure.one_step_list (algebra.EQT.one_step _) _ _ |- _ =>
       inversion H;clear H;subst
      end
    ).
   
   clear H_id_x H_id_true H_id_leaf H_id_false;intros x8 x10 H;injection H;
    clear H;intros ;subst;
    repeat (
    match goal with
      | H:closure.one_step_list (algebra.EQT.one_step _) _ _ |- _ =>
       inversion H;clear H;subst
      end
    ).
   
   match goal with
     | H:algebra.EQT.one_step _ ?y x8 |- _ =>
      destruct (H_id_cons y x10 (refl_equal _)) as [x7 [x9]];intros ;
       intuition;exists x7;exists x9;intuition;
       eapply closure_extension.refl_trans_clos_R;eassumption
     end
   .
   
   match goal with
     | H:algebra.EQT.one_step _ ?y x10 |- _ =>
      destruct (H_id_cons x8 y (refl_equal _)) as [x7 [x9]];intros ;
       intuition;exists x7;exists x9;intuition;
       eapply closure_extension.refl_trans_clos_R;eassumption
     end
   .
   
   clear H_id_x H_id_cons H_id_leaf H_id_false;intros H;injection H;clear H;
    intros ;subst;
    repeat (
    match goal with
      | H:closure.one_step_list (algebra.EQT.one_step _) _ _ |- _ =>
       inversion H;clear H;subst
      end
    ).
   
   clear H_id_x H_id_cons H_id_true H_id_false;intros H;injection H;clear H;
    intros ;subst;
    repeat (
    match goal with
      | H:closure.one_step_list (algebra.EQT.one_step _) _ _ |- _ =>
       inversion H;clear H;subst
      end
    ).
   
   clear H_id_x H_id_cons H_id_true H_id_leaf;intros H;injection H;clear H;
    intros ;subst;
    repeat (
    match goal with
      | H:closure.one_step_list (algebra.EQT.one_step _) _ _ |- _ =>
       inversion H;clear H;subst
      end
    ).
 Qed.
 
 
 Lemma id_x_is_R_xml_0_constructor :
  forall t t', 
   (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) t' t) ->
    t = (algebra.Alg.Term algebra.F.id_x nil) ->
     t' = (algebra.Alg.Term algebra.F.id_x nil).
 Proof.
   intros t t' H.
   destruct (are_constuctors_of_R_xml_0 H).
   assumption.
 Qed.
 
 
 Lemma id_cons_is_R_xml_0_constructor :
  forall t t', 
   (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) t' t) ->
    forall x8 x10, 
     t = (algebra.Alg.Term algebra.F.id_cons (x8::x10::nil)) ->
      exists x7,
        exists x9,
          t' = (algebra.Alg.Term algebra.F.id_cons (x7::x9::nil))/\ 
          (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) x7 x8)/\
           
          (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) 
            x9 x10).
 Proof.
   intros t t' H.
   destruct (are_constuctors_of_R_xml_0 H).
   assumption.
 Qed.
 
 
 Lemma id_true_is_R_xml_0_constructor :
  forall t t', 
   (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) t' t) ->
    t = (algebra.Alg.Term algebra.F.id_true nil) ->
     t' = (algebra.Alg.Term algebra.F.id_true nil).
 Proof.
   intros t t' H.
   destruct (are_constuctors_of_R_xml_0 H).
   assumption.
 Qed.
 
 
 Lemma id_leaf_is_R_xml_0_constructor :
  forall t t', 
   (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) t' t) ->
    t = (algebra.Alg.Term algebra.F.id_leaf nil) ->
     t' = (algebra.Alg.Term algebra.F.id_leaf nil).
 Proof.
   intros t t' H.
   destruct (are_constuctors_of_R_xml_0 H).
   assumption.
 Qed.
 
 
 Lemma id_false_is_R_xml_0_constructor :
  forall t t', 
   (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) t' t) ->
    t = (algebra.Alg.Term algebra.F.id_false nil) ->
     t' = (algebra.Alg.Term algebra.F.id_false nil).
 Proof.
   intros t t' H.
   destruct (are_constuctors_of_R_xml_0 H).
   assumption.
 Qed.
 
 
 Ltac impossible_star_reduction_R_xml_0  :=
  match goal with
    | H:closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) 
         _ (algebra.Alg.Term algebra.F.id_x nil) |- _ =>
     let Heq := fresh "Heq" in 
      (set (Heq:=id_x_is_R_xml_0_constructor H (refl_equal _)) in *;
        (discriminate Heq)||
        (clearbody Heq;try (subst);try (clear Heq);clear H;
          impossible_star_reduction_R_xml_0 ))
    | H:closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) 
         _ (algebra.Alg.Term algebra.F.id_cons (?x8::?x7::nil)) |- _ =>
     let x8 := fresh "x" in 
      (let x7 := fresh "x" in 
        (let Heq := fresh "Heq" in 
          (let Hred1 := fresh "Hred" in 
            (let Hred2 := fresh "Hred" in 
              (destruct (id_cons_is_R_xml_0_constructor H (refl_equal _)) as 
               [x8 [x7 [Heq [Hred2 Hred1]]]];
                (discriminate Heq)||
                (injection Heq;intros ;subst;clear Heq;clear H;
                  impossible_star_reduction_R_xml_0 ))))))
    | H:closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) 
         _ (algebra.Alg.Term algebra.F.id_true nil) |- _ =>
     let Heq := fresh "Heq" in 
      (set (Heq:=id_true_is_R_xml_0_constructor H (refl_equal _)) in *;
        (discriminate Heq)||
        (clearbody Heq;try (subst);try (clear Heq);clear H;
          impossible_star_reduction_R_xml_0 ))
    | H:closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) 
         _ (algebra.Alg.Term algebra.F.id_leaf nil) |- _ =>
     let Heq := fresh "Heq" in 
      (set (Heq:=id_leaf_is_R_xml_0_constructor H (refl_equal _)) in *;
        (discriminate Heq)||
        (clearbody Heq;try (subst);try (clear Heq);clear H;
          impossible_star_reduction_R_xml_0 ))
    | H:closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) 
         _ (algebra.Alg.Term algebra.F.id_false nil) |- _ =>
     let Heq := fresh "Heq" in 
      (set (Heq:=id_false_is_R_xml_0_constructor H (refl_equal _)) in *;
        (discriminate Heq)||
        (clearbody Heq;try (subst);try (clear Heq);clear H;
          impossible_star_reduction_R_xml_0 ))
    end
  .
 
 
 Ltac simplify_star_reduction_R_xml_0  :=
  match goal with
    | H:closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) 
         _ (algebra.Alg.Term algebra.F.id_x nil) |- _ =>
     let Heq := fresh "Heq" in 
      (set (Heq:=id_x_is_R_xml_0_constructor H (refl_equal _)) in *;
        (discriminate Heq)||
        (clearbody Heq;try (subst);try (clear Heq);clear H;
          try (simplify_star_reduction_R_xml_0 )))
    | H:closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) 
         _ (algebra.Alg.Term algebra.F.id_cons (?x8::?x7::nil)) |- _ =>
     let x8 := fresh "x" in 
      (let x7 := fresh "x" in 
        (let Heq := fresh "Heq" in 
          (let Hred1 := fresh "Hred" in 
            (let Hred2 := fresh "Hred" in 
              (destruct (id_cons_is_R_xml_0_constructor H (refl_equal _)) as 
               [x8 [x7 [Heq [Hred2 Hred1]]]];
                (discriminate Heq)||
                (injection Heq;intros ;subst;clear Heq;clear H;
                  try (simplify_star_reduction_R_xml_0 )))))))
    | H:closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) 
         _ (algebra.Alg.Term algebra.F.id_true nil) |- _ =>
     let Heq := fresh "Heq" in 
      (set (Heq:=id_true_is_R_xml_0_constructor H (refl_equal _)) in *;
        (discriminate Heq)||
        (clearbody Heq;try (subst);try (clear Heq);clear H;
          try (simplify_star_reduction_R_xml_0 )))
    | H:closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) 
         _ (algebra.Alg.Term algebra.F.id_leaf nil) |- _ =>
     let Heq := fresh "Heq" in 
      (set (Heq:=id_leaf_is_R_xml_0_constructor H (refl_equal _)) in *;
        (discriminate Heq)||
        (clearbody Heq;try (subst);try (clear Heq);clear H;
          try (simplify_star_reduction_R_xml_0 )))
    | H:closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) 
         _ (algebra.Alg.Term algebra.F.id_false nil) |- _ =>
     let Heq := fresh "Heq" in 
      (set (Heq:=id_false_is_R_xml_0_constructor H (refl_equal _)) in *;
        (discriminate Heq)||
        (clearbody Heq;try (subst);try (clear Heq);clear H;
          try (simplify_star_reduction_R_xml_0 )))
    end
  .
End R_xml_0_deep_rew.

Module InterpGen := interp.Interp(algebra.EQT).

Module ddp := dp.MakeDP(algebra.EQT).

Module SymbType. Definition A := algebra.Alg.F.Symb.A. End SymbType.

Module Symb_more_list := more_list_extention.Make(SymbType)(algebra.Alg.F.Symb).

Module SymbSet := list_set.Make(algebra.F.Symb).

Module Interp.
 Section S.
   Require Import interp.
   
   Hypothesis A : Type.
   
   Hypothesis Ale Alt Aeq : A -> A -> Prop.
   
   Hypothesis Aop : interp.ordering_pair Aeq Alt Ale.
   
   Hypothesis A0 : A.
   
   Notation Local "a <= b" := (Ale a b).
   
   Hypothesis P_id_concat : A ->A ->A.
   
   Hypothesis P_id_x : A.
   
   Hypothesis P_id_cons : A ->A ->A.
   
   Hypothesis P_id_true : A.
   
   Hypothesis P_id_leaf : A.
   
   Hypothesis P_id_false : A.
   
   Hypothesis P_id_less_leaves : A ->A ->A.
   
   Hypothesis P_id_concat_monotonic :
    forall x8 x10 x9 x7, 
     (A0 <= x10)/\ (x10 <= x9) ->
      (A0 <= x8)/\ (x8 <= x7) ->P_id_concat x8 x10 <= P_id_concat x7 x9.
   
   Hypothesis P_id_cons_monotonic :
    forall x8 x10 x9 x7, 
     (A0 <= x10)/\ (x10 <= x9) ->
      (A0 <= x8)/\ (x8 <= x7) ->P_id_cons x8 x10 <= P_id_cons x7 x9.
   
   Hypothesis P_id_less_leaves_monotonic :
    forall x8 x10 x9 x7, 
     (A0 <= x10)/\ (x10 <= x9) ->
      (A0 <= x8)/\ (x8 <= x7) ->
       P_id_less_leaves x8 x10 <= P_id_less_leaves x7 x9.
   
   Hypothesis P_id_concat_bounded :
    forall x8 x7, (A0 <= x7) ->(A0 <= x8) ->A0 <= P_id_concat x8 x7.
   
   Hypothesis P_id_x_bounded : A0 <= P_id_x .
   
   Hypothesis P_id_cons_bounded :
    forall x8 x7, (A0 <= x7) ->(A0 <= x8) ->A0 <= P_id_cons x8 x7.
   
   Hypothesis P_id_true_bounded : A0 <= P_id_true .
   
   Hypothesis P_id_leaf_bounded : A0 <= P_id_leaf .
   
   Hypothesis P_id_false_bounded : A0 <= P_id_false .
   
   Hypothesis P_id_less_leaves_bounded :
    forall x8 x7, (A0 <= x7) ->(A0 <= x8) ->A0 <= P_id_less_leaves x8 x7.
   
   Fixpoint measure t { struct t }  := 
     match t with
       | (algebra.Alg.Term algebra.F.id_concat (x8::x7::nil)) =>
        P_id_concat (measure x8) (measure x7)
       | (algebra.Alg.Term algebra.F.id_x nil) => P_id_x 
       | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
        P_id_cons (measure x8) (measure x7)
       | (algebra.Alg.Term algebra.F.id_true nil) => P_id_true 
       | (algebra.Alg.Term algebra.F.id_leaf nil) => P_id_leaf 
       | (algebra.Alg.Term algebra.F.id_false nil) => P_id_false 
       | (algebra.Alg.Term algebra.F.id_less_leaves (x8::x7::nil)) =>
        P_id_less_leaves (measure x8) (measure x7)
       | _ => A0
       end.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_concat (x8::x7::nil)) =>
                    P_id_concat (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_x nil) => P_id_x 
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_true nil) => P_id_true 
                   | (algebra.Alg.Term algebra.F.id_leaf nil) => P_id_leaf 
                   | (algebra.Alg.Term algebra.F.id_false nil) => P_id_false 
                   | (algebra.Alg.Term algebra.F.id_less_leaves (x8::
                      x7::nil)) =>
                    P_id_less_leaves (measure x8) (measure x7)
                   | _ => A0
                   end.
   Proof.
     intros t;case t;intros ;apply refl_equal.
   Qed.
   
   Definition Pols f : InterpGen.Pol_type A (InterpGen.get_arity f) := 
     match f with
       | algebra.F.id_concat => P_id_concat
       | algebra.F.id_x => P_id_x
       | algebra.F.id_cons => P_id_cons
       | algebra.F.id_true => P_id_true
       | algebra.F.id_leaf => P_id_leaf
       | algebra.F.id_false => P_id_false
       | algebra.F.id_less_leaves => P_id_less_leaves
       end.
   
   Lemma same_measure : forall t, measure t = InterpGen.measure A0 Pols t.
   Proof.
     fix 1 .
     intros [a| f l].
     simpl in |-*.
     unfold eq_rect_r, eq_rect, sym_eq in |-*.
     reflexivity .
     
     refine match f with
              | algebra.F.id_concat =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_x => match l with
                                    | nil => _
                                    | _::_ => _
                                    end
              | algebra.F.id_cons =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_true => match l with
                                       | nil => _
                                       | _::_ => _
                                       end
              | algebra.F.id_leaf => match l with
                                       | nil => _
                                       | _::_ => _
                                       end
              | algebra.F.id_false => match l with
                                        | nil => _
                                        | _::_ => _
                                        end
              | algebra.F.id_less_leaves =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              end;simpl in |-*;unfold eq_rect_r, eq_rect, sym_eq in |-*;
      try (reflexivity );f_equal ;auto.
   Qed.
   
   Lemma measure_bounded : forall t, A0 <= measure t.
   Proof.
     intros t.
     rewrite same_measure in |-*.
     apply (InterpGen.measure_bounded Aop).
     intros f.
     case f.
     vm_compute in |-*;intros ;apply P_id_concat_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_x_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_cons_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_true_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_leaf_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_false_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_less_leaves_bounded;assumption.
   Qed.
   
   Ltac generate_pos_hyp  :=
    match goal with
      | H:context [measure ?x] |- _ =>
       let v := fresh "v" in 
        (let H := fresh "h" in 
          (set (H:=measure_bounded x) in *;set (v:=measure x) in *;
            clearbody H;clearbody v))
      |  |- context [measure ?x] =>
       let v := fresh "v" in 
        (let H := fresh "h" in 
          (set (H:=measure_bounded x) in *;set (v:=measure x) in *;
            clearbody H;clearbody v))
      end
    .
   
   Hypothesis rules_monotonic :
    forall l r, 
     (algebra.EQT.axiom R_xml_0_deep_rew.R_xml_0_rules r l) ->
      measure r <= measure l.
   
   Lemma measure_star_monotonic :
    forall l r, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                r l) ->measure r <= measure l.
   Proof.
     intros .
     do 2 (rewrite same_measure in |-*).
     
     apply InterpGen.measure_star_monotonic with (1:=Aop) (Pols:=Pols) 
     (rules:=R_xml_0_deep_rew.R_xml_0_rules).
     intros f.
     case f.
     vm_compute in |-*;intros ;apply P_id_concat_monotonic;assumption.
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;intros ;apply P_id_cons_monotonic;assumption.
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;intros ;apply P_id_less_leaves_monotonic;assumption.
     intros f.
     case f.
     vm_compute in |-*;intros ;apply P_id_concat_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_x_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_cons_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_true_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_leaf_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_false_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_less_leaves_bounded;assumption.
     intros .
     do 2 (rewrite  <- same_measure in |-*).
     apply rules_monotonic;assumption.
     assumption.
   Qed.
   
   Hypothesis P_id_LESS_LEAVES : A ->A ->A.
   
   Hypothesis P_id_CONCAT : A ->A ->A.
   
   Hypothesis P_id_LESS_LEAVES_monotonic :
    forall x8 x10 x9 x7, 
     (A0 <= x10)/\ (x10 <= x9) ->
      (A0 <= x8)/\ (x8 <= x7) ->
       P_id_LESS_LEAVES x8 x10 <= P_id_LESS_LEAVES x7 x9.
   
   Hypothesis P_id_CONCAT_monotonic :
    forall x8 x10 x9 x7, 
     (A0 <= x10)/\ (x10 <= x9) ->
      (A0 <= x8)/\ (x8 <= x7) ->P_id_CONCAT x8 x10 <= P_id_CONCAT x7 x9.
   
   Definition marked_measure t := 
     match t with
       | (algebra.Alg.Term algebra.F.id_less_leaves (x8::x7::nil)) =>
        P_id_LESS_LEAVES (measure x8) (measure x7)
       | (algebra.Alg.Term algebra.F.id_concat (x8::x7::nil)) =>
        P_id_CONCAT (measure x8) (measure x7)
       | _ => measure t
       end.
   
   Definition  Marked_pols :
    forall f, 
     (algebra.EQT.defined R_xml_0_deep_rew.R_xml_0_rules f) ->
      InterpGen.Pol_type A (InterpGen.get_arity f).
   Proof.
     intros f H.
     
     apply ddp.defined_list_complete with (1:=R_xml_0_deep_rew.R_xml_0_rules_included) in H .
     apply (Symb_more_list.change_in algebra.F.symb_order) in H .
     
     set (u := (Symb_more_list.qs algebra.F.symb_order
           (Symb_more_list.XSet.remove_red
              (ddp.defined_list R_xml_0_deep_rew.R_xml_0_rule_as_list)))) in * .
     vm_compute in u .
     unfold u in * .
     clear u .
     unfold more_list.mem_bool in H .
     
     match type of H with 
       | orb ?a ?b = true => 
         assert (H':{a = true}+{b = true});[
           revert H;case a;[left;reflexivity|simpl;intros h;right;exact h]|
             clear H;destruct H' as [H|H]]
     end .
     
     match type of H with 
       | _ _ ?t = true =>
         generalize (algebra.F.symb_eq_bool_ok f t);
           unfold algebra.Alg.eq_symb_bool in H;
           rewrite H;clear H;intros ;subst
     end .
     vm_compute in |-*;intros x8 x7;apply (P_id_LESS_LEAVES x8 x7).
     
     match type of H with 
       | orb ?a ?b = true => 
         assert (H':{a = true}+{b = true});[
           revert H;case a;[left;reflexivity|simpl;intros h;right;exact h]|
             clear H;destruct H' as [H|H]]
     end .
     
     match type of H with 
       | _ _ ?t = true =>
         generalize (algebra.F.symb_eq_bool_ok f t);
           unfold algebra.Alg.eq_symb_bool in H;
           rewrite H;clear H;intros ;subst
     end .
     vm_compute in |-*;intros x8 x7;apply (P_id_CONCAT x8 x7).
     discriminate H.
   Defined.
   
   Lemma same_marked_measure :
    forall t, 
     marked_measure t = InterpGen.marked_measure A0 Pols Marked_pols 
                         (ddp.defined_dec _ _ 
                           R_xml_0_deep_rew.R_xml_0_rules_included) t.
   Proof.
     intros [a| f l].
     simpl in |-*.
     unfold eq_rect_r, eq_rect, sym_eq in |-*.
     reflexivity .
     
     refine match f with
              | algebra.F.id_concat =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_x => match l with
                                    | nil => _
                                    | _::_ => _
                                    end
              | algebra.F.id_cons =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_true => match l with
                                       | nil => _
                                       | _::_ => _
                                       end
              | algebra.F.id_leaf => match l with
                                       | nil => _
                                       | _::_ => _
                                       end
              | algebra.F.id_false => match l with
                                        | nil => _
                                        | _::_ => _
                                        end
              | algebra.F.id_less_leaves =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              end.
     vm_compute in |-*;reflexivity .
     vm_compute in |-*;reflexivity .
     
     lazy - [measure InterpGen.measure Pols] in |-* ;f_equal ;
      apply same_measure.
     vm_compute in |-*;reflexivity .
     vm_compute in |-*;reflexivity .
     vm_compute in |-*;reflexivity .
     vm_compute in |-*;reflexivity .
     vm_compute in |-*;reflexivity .
     
     lazy - [measure InterpGen.measure Pols] in |-* ;f_equal ;
      apply same_measure.
     vm_compute in |-*;reflexivity .
     vm_compute in |-*;reflexivity .
     vm_compute in |-*;reflexivity .
     vm_compute in |-*;reflexivity .
     vm_compute in |-*;reflexivity .
     vm_compute in |-*;reflexivity .
     vm_compute in |-*;reflexivity .
     vm_compute in |-*;reflexivity .
     vm_compute in |-*;reflexivity .
     
     lazy - [measure InterpGen.measure Pols] in |-* ;f_equal ;
      apply same_measure.
     vm_compute in |-*;reflexivity .
   Qed.
   
   Lemma marked_measure_equation :
    forall t, 
     marked_measure t = match t with
                          | (algebra.Alg.Term algebra.F.id_less_leaves (x8::
                             x7::nil)) =>
                           P_id_LESS_LEAVES (measure x8) (measure x7)
                          | (algebra.Alg.Term algebra.F.id_concat (x8::
                             x7::nil)) =>
                           P_id_CONCAT (measure x8) (measure x7)
                          | _ => measure t
                          end.
   Proof.
     reflexivity .
   Qed.
   
   Lemma marked_measure_star_monotonic :
    forall f l1 l2, 
     (closure.refl_trans_clos (closure.one_step_list (algebra.EQT.one_step 
                                                       R_xml_0_deep_rew.R_xml_0_rules)
                                                      ) l1 l2) ->
      marked_measure (algebra.Alg.Term f l1) <= marked_measure (algebra.Alg.Term 
                                                                 f l2).
   Proof.
     intros .
     do 2 (rewrite same_marked_measure in |-*).
     
     apply InterpGen.marked_measure_star_monotonic with (1:=Aop) (Pols:=
     Pols) (rules:=R_xml_0_deep_rew.R_xml_0_rules).
     clear f.
     intros f.
     case f.
     vm_compute in |-*;intros ;apply P_id_concat_monotonic;assumption.
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;intros ;apply P_id_cons_monotonic;assumption.
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;intros ;apply P_id_less_leaves_monotonic;assumption.
     clear f.
     intros f.
     case f.
     vm_compute in |-*;intros ;apply P_id_concat_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_x_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_cons_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_true_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_leaf_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_false_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_less_leaves_bounded;assumption.
     intros .
     do 2 (rewrite  <- same_measure in |-*).
     apply rules_monotonic;assumption.
     clear f.
     intros f.
     clear H.
     intros H.
     generalize H.
     
     apply ddp.defined_list_complete with (1:=R_xml_0_deep_rew.R_xml_0_rules_included) in H .
     apply (Symb_more_list.change_in algebra.F.symb_order) in H .
     
     set (u := (Symb_more_list.qs algebra.F.symb_order
           (Symb_more_list.XSet.remove_red
              (ddp.defined_list R_xml_0_deep_rew.R_xml_0_rule_as_list)))) in * .
     vm_compute in u .
     unfold u in * .
     clear u .
     unfold more_list.mem_bool in H .
     
     match type of H with 
       | orb ?a ?b = true => 
         assert (H':{a = true}+{b = true});[
           revert H;case a;[left;reflexivity|simpl;intros h;right;exact h]|
             clear H;destruct H' as [H|H]]
     end .
     
     match type of H with 
       | _ _ ?t = true =>
         generalize (algebra.F.symb_eq_bool_ok f t);
           unfold algebra.Alg.eq_symb_bool in H;
           rewrite H;clear H;intros ;subst
     end .
     vm_compute in |-*;intros ;apply P_id_LESS_LEAVES_monotonic;assumption.
     
     match type of H with 
       | orb ?a ?b = true => 
         assert (H':{a = true}+{b = true});[
           revert H;case a;[left;reflexivity|simpl;intros h;right;exact h]|
             clear H;destruct H' as [H|H]]
     end .
     
     match type of H with 
       | _ _ ?t = true =>
         generalize (algebra.F.symb_eq_bool_ok f t);
           unfold algebra.Alg.eq_symb_bool in H;
           rewrite H;clear H;intros ;subst
     end .
     vm_compute in |-*;intros ;apply P_id_CONCAT_monotonic;assumption.
     discriminate H.
     assumption.
   Qed.
   
   End S.
End Interp.

Module InterpZ.
 Section S.
   Open Scope Z_scope.
   
   Hypothesis min_value : Z.
   
   Import ring_extention.
   
   Notation Local "'Alt'" := (Zwf.Zwf min_value).
   
   Notation Local "'Ale'" := Zle.
   
   Notation Local "'Aeq'" := (@eq Z).
   
   Notation Local "a <= b" := (Ale a b).
   
   Notation Local "a < b" := (Alt a b).
   
   Hypothesis P_id_concat : Z ->Z ->Z.
   
   Hypothesis P_id_x : Z.
   
   Hypothesis P_id_cons : Z ->Z ->Z.
   
   Hypothesis P_id_true : Z.
   
   Hypothesis P_id_leaf : Z.
   
   Hypothesis P_id_false : Z.
   
   Hypothesis P_id_less_leaves : Z ->Z ->Z.
   
   Hypothesis P_id_concat_monotonic :
    forall x8 x10 x9 x7, 
     (min_value <= x10)/\ (x10 <= x9) ->
      (min_value <= x8)/\ (x8 <= x7) ->
       P_id_concat x8 x10 <= P_id_concat x7 x9.
   
   Hypothesis P_id_cons_monotonic :
    forall x8 x10 x9 x7, 
     (min_value <= x10)/\ (x10 <= x9) ->
      (min_value <= x8)/\ (x8 <= x7) ->P_id_cons x8 x10 <= P_id_cons x7 x9.
   
   Hypothesis P_id_less_leaves_monotonic :
    forall x8 x10 x9 x7, 
     (min_value <= x10)/\ (x10 <= x9) ->
      (min_value <= x8)/\ (x8 <= x7) ->
       P_id_less_leaves x8 x10 <= P_id_less_leaves x7 x9.
   
   Hypothesis P_id_concat_bounded :
    forall x8 x7, 
     (min_value <= x7) ->(min_value <= x8) ->min_value <= P_id_concat x8 x7.
   
   Hypothesis P_id_x_bounded : min_value <= P_id_x .
   
   Hypothesis P_id_cons_bounded :
    forall x8 x7, 
     (min_value <= x7) ->(min_value <= x8) ->min_value <= P_id_cons x8 x7.
   
   Hypothesis P_id_true_bounded : min_value <= P_id_true .
   
   Hypothesis P_id_leaf_bounded : min_value <= P_id_leaf .
   
   Hypothesis P_id_false_bounded : min_value <= P_id_false .
   
   Hypothesis P_id_less_leaves_bounded :
    forall x8 x7, 
     (min_value <= x7) ->
      (min_value <= x8) ->min_value <= P_id_less_leaves x8 x7.
   
   Definition measure  := 
     Interp.measure min_value P_id_concat P_id_x P_id_cons P_id_true 
      P_id_leaf P_id_false P_id_less_leaves.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_concat (x8::x7::nil)) =>
                    P_id_concat (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_x nil) => P_id_x 
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_true nil) => P_id_true 
                   | (algebra.Alg.Term algebra.F.id_leaf nil) => P_id_leaf 
                   | (algebra.Alg.Term algebra.F.id_false nil) => P_id_false 
                   | (algebra.Alg.Term algebra.F.id_less_leaves (x8::
                      x7::nil)) =>
                    P_id_less_leaves (measure x8) (measure x7)
                   | _ => min_value
                   end.
   Proof.
     intros t;case t;intros ;apply refl_equal.
   Qed.
   
   Lemma measure_bounded : forall t, min_value <= measure t.
   Proof.
     unfold measure in |-*.
     
     apply Interp.measure_bounded with Alt Aeq;
      (apply interp.o_Z)||
      (cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;auto with zarith).
   Qed.
   
   Ltac generate_pos_hyp  :=
    match goal with
      | H:context [measure ?x] |- _ =>
       let v := fresh "v" in 
        (let H := fresh "h" in 
          (set (H:=measure_bounded x) in *;set (v:=measure x) in *;
            clearbody H;clearbody v))
      |  |- context [measure ?x] =>
       let v := fresh "v" in 
        (let H := fresh "h" in 
          (set (H:=measure_bounded x) in *;set (v:=measure x) in *;
            clearbody H;clearbody v))
      end
    .
   
   Hypothesis rules_monotonic :
    forall l r, 
     (algebra.EQT.axiom R_xml_0_deep_rew.R_xml_0_rules r l) ->
      measure r <= measure l.
   
   Lemma measure_star_monotonic :
    forall l r, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                r l) ->measure r <= measure l.
   Proof.
     unfold measure in *.
     apply Interp.measure_star_monotonic with Alt Aeq.
     
     (apply interp.o_Z)||
     (cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;auto with zarith).
     intros ;apply P_id_concat_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_less_leaves_monotonic;assumption.
     intros ;apply P_id_concat_bounded;assumption.
     intros ;apply P_id_x_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_true_bounded;assumption.
     intros ;apply P_id_leaf_bounded;assumption.
     intros ;apply P_id_false_bounded;assumption.
     intros ;apply P_id_less_leaves_bounded;assumption.
     apply rules_monotonic.
   Qed.
   
   Hypothesis P_id_LESS_LEAVES : Z ->Z ->Z.
   
   Hypothesis P_id_CONCAT : Z ->Z ->Z.
   
   Hypothesis P_id_LESS_LEAVES_monotonic :
    forall x8 x10 x9 x7, 
     (min_value <= x10)/\ (x10 <= x9) ->
      (min_value <= x8)/\ (x8 <= x7) ->
       P_id_LESS_LEAVES x8 x10 <= P_id_LESS_LEAVES x7 x9.
   
   Hypothesis P_id_CONCAT_monotonic :
    forall x8 x10 x9 x7, 
     (min_value <= x10)/\ (x10 <= x9) ->
      (min_value <= x8)/\ (x8 <= x7) ->
       P_id_CONCAT x8 x10 <= P_id_CONCAT x7 x9.
   
   Definition marked_measure  := 
     Interp.marked_measure min_value P_id_concat P_id_x P_id_cons P_id_true 
      P_id_leaf P_id_false P_id_less_leaves P_id_LESS_LEAVES P_id_CONCAT.
   
   Lemma marked_measure_equation :
    forall t, 
     marked_measure t = match t with
                          | (algebra.Alg.Term algebra.F.id_less_leaves (x8::
                             x7::nil)) =>
                           P_id_LESS_LEAVES (measure x8) (measure x7)
                          | (algebra.Alg.Term algebra.F.id_concat (x8::
                             x7::nil)) =>
                           P_id_CONCAT (measure x8) (measure x7)
                          | _ => measure t
                          end.
   Proof.
     reflexivity .
   Qed.
   
   Lemma marked_measure_star_monotonic :
    forall f l1 l2, 
     (closure.refl_trans_clos (closure.one_step_list (algebra.EQT.one_step 
                                                       R_xml_0_deep_rew.R_xml_0_rules)
                                                      ) l1 l2) ->
      marked_measure (algebra.Alg.Term f l1) <= marked_measure (algebra.Alg.Term 
                                                                 f l2).
   Proof.
     unfold marked_measure in *.
     apply Interp.marked_measure_star_monotonic with Alt Aeq.
     
     (apply interp.o_Z)||
     (cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;auto with zarith).
     intros ;apply P_id_concat_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_less_leaves_monotonic;assumption.
     intros ;apply P_id_concat_bounded;assumption.
     intros ;apply P_id_x_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_true_bounded;assumption.
     intros ;apply P_id_leaf_bounded;assumption.
     intros ;apply P_id_false_bounded;assumption.
     intros ;apply P_id_less_leaves_bounded;assumption.
     apply rules_monotonic.
     intros ;apply P_id_LESS_LEAVES_monotonic;assumption.
     intros ;apply P_id_CONCAT_monotonic;assumption.
   Qed.
   
   End S.
End InterpZ.

Module WF_R_xml_0_deep_rew.
 Inductive DP_R_xml_0  :
  algebra.Alg.term ->algebra.Alg.term ->Prop := 
    (* <concat(cons(u_,v_),y_),concat(v_,y_)> *)
   | DP_R_xml_0_0 :
    forall x8 x2 x1 x3 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_cons (x2::x3::nil)) x8) ->
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 x1 x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_concat (x3::x1::nil)) 
        (algebra.Alg.Term algebra.F.id_concat (x8::x7::nil))
   
    (* <less_leaves(cons(u_,v_),cons(w_,z_)),less_leaves(concat(u_,v_),concat(w_,z_))> *)
   | DP_R_xml_0_1 :
    forall x8 x4 x2 x5 x3 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_cons (x2::x3::nil)) x8) ->
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_cons (x4::x5::nil)) x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_less_leaves 
                   ((algebra.Alg.Term algebra.F.id_concat (x2::x3::nil))::
                   (algebra.Alg.Term algebra.F.id_concat (x4::
                   x5::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_less_leaves (x8::x7::nil))
   
    (* <less_leaves(cons(u_,v_),cons(w_,z_)),concat(u_,v_)> *)
   | DP_R_xml_0_2 :
    forall x8 x4 x2 x5 x3 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_cons (x2::x3::nil)) x8) ->
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_cons (x4::x5::nil)) x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_concat (x2::x3::nil)) 
        (algebra.Alg.Term algebra.F.id_less_leaves (x8::x7::nil))
   
    (* <less_leaves(cons(u_,v_),cons(w_,z_)),concat(w_,z_)> *)
   | DP_R_xml_0_3 :
    forall x8 x4 x2 x5 x3 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_cons (x2::x3::nil)) x8) ->
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_cons (x4::x5::nil)) x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_concat (x4::x5::nil)) 
        (algebra.Alg.Term algebra.F.id_less_leaves (x8::x7::nil))
 .
 
 Module ddp := dp.MakeDP(algebra.EQT).
 
 
 Lemma R_xml_0_dp_step_spec :
  forall x y, 
   (ddp.dp_step R_xml_0_deep_rew.R_xml_0_rules x y) ->
    exists f,
      exists l1,
        exists l2,
          y = algebra.Alg.Term f l2/\ 
          (closure.refl_trans_clos (closure.one_step_list (algebra.EQT.one_step 
                                                            R_xml_0_deep_rew.R_xml_0_rules)
                                                           ) l1 l2)/\ 
          (ddp.dp R_xml_0_deep_rew.R_xml_0_rules x (algebra.Alg.Term f l1)).
 Proof.
   intros x y H.
   induction H.
   inversion H.
   subst.
   destruct t0.
   refine ((False_ind) _ _).
   refine (R_xml_0_deep_rew.R_xml_0_non_var H0).
   simpl in H|-*.
   exists a.
   exists ((List.map) (algebra.Alg.apply_subst sigma) l).
   exists ((List.map) (algebra.Alg.apply_subst sigma) l).
   repeat (constructor).
   assumption.
   exists f.
   exists l2.
   exists l1.
   constructor.
   constructor.
   constructor.
   constructor.
   rewrite  <- closure.rwr_list_trans_clos_one_step_list.
   assumption.
   assumption.
 Qed.
 
 
 Ltac included_dp_tac H :=
  injection H;clear H;intros;subst;
  repeat (match goal with 
  | H: closure.refl_trans_clos (closure.one_step_list _) (_::_) _ |- _=>           
  let x := fresh "x" in 
  let l := fresh "l" in 
  let h1 := fresh "h" in 
  let h2 := fresh "h" in 
  let h3 := fresh "h" in 
  destruct (@algebra.EQT_ext.one_step_list_star_decompose_cons _ _ _ _  H) as [x [l[h1[h2 h3]]]];clear H;subst
  | H: closure.refl_trans_clos (closure.one_step_list _) nil _ |- _ => 
  rewrite (@algebra.EQT_ext.one_step_list_star_decompose_nil _ _ H) in *;clear H
  end
  );simpl;
  econstructor eassumption
 .
 
 
 Ltac dp_concl_tac h2 h cont_tac 
  t :=
  match t with
    | False => let h' := fresh "a" in 
                (set (h':=t) in *;cont_tac h';
                  repeat (
                  let e := type of h in 
                   (match e with
                      | ?t => unfold t in h|-;
                               (case h;
                                [abstract (clear h;intros h;injection h;
                                            clear h;intros ;subst;
                                            included_dp_tac h2)|
                                clear h;intros h;clear t])
                      | ?t => unfold t in h|-;elim h
                      end
                    )
                  ))
    | or ?a ?b => let cont_tac 
                   h' := let h'' := fresh "a" in 
                          (set (h'':=or a h') in *;cont_tac h'') in 
                   (dp_concl_tac h2 h cont_tac b)
    end
  .
 
 
 Module WF_DP_R_xml_0.
  Inductive DP_R_xml_0_scc_1  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <concat(cons(u_,v_),y_),concat(v_,y_)> *)
    | DP_R_xml_0_scc_1_0 :
     forall x8 x2 x1 x3 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_cons (x2::x3::nil)) x8) ->
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  x1 x7) ->
        DP_R_xml_0_scc_1 (algebra.Alg.Term algebra.F.id_concat (x3::x1::nil)) 
         (algebra.Alg.Term algebra.F.id_concat (x8::x7::nil))
  .
  
  
  Module WF_DP_R_xml_0_scc_1.
   Open Scope Z_scope.
   
   Import ring_extention.
   
   Notation Local "a <= b" := (Zle a b).
   
   Notation Local "a < b" := (Zlt a b).
   
   Definition P_id_concat (x7:Z) (x8:Z) := 2 + 1* x7 + 1* x8.
   
   Definition P_id_x  := 0.
   
   Definition P_id_cons (x7:Z) (x8:Z) := 3 + 1* x7 + 1* x8.
   
   Definition P_id_true  := 2.
   
   Definition P_id_leaf  := 1.
   
   Definition P_id_false  := 1.
   
   Definition P_id_less_leaves (x7:Z) (x8:Z) := 1 + 1* x8.
   
   Lemma P_id_concat_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_concat x8 x10 <= P_id_concat x7 x9.
   Proof.
     intros x10 x9 x8 x7.
     intros [H_1 H_0].
     intros [H_3 H_2].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_cons_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_cons x8 x10 <= P_id_cons x7 x9.
   Proof.
     intros x10 x9 x8 x7.
     intros [H_1 H_0].
     intros [H_3 H_2].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_less_leaves_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->
       P_id_less_leaves x8 x10 <= P_id_less_leaves x7 x9.
   Proof.
     intros x10 x9 x8 x7.
     intros [H_1 H_0].
     intros [H_3 H_2].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_concat_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_concat x8 x7.
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_x_bounded : 0 <= P_id_x .
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_cons_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_cons x8 x7.
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_true_bounded : 0 <= P_id_true .
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_leaf_bounded : 0 <= P_id_leaf .
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_false_bounded : 0 <= P_id_false .
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_less_leaves_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_less_leaves x8 x7.
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Definition measure  := 
     InterpZ.measure 0 P_id_concat P_id_x P_id_cons P_id_true P_id_leaf 
      P_id_false P_id_less_leaves.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_concat (x8::x7::nil)) =>
                    P_id_concat (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_x nil) => P_id_x 
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_true nil) => P_id_true 
                   | (algebra.Alg.Term algebra.F.id_leaf nil) => P_id_leaf 
                   | (algebra.Alg.Term algebra.F.id_false nil) => P_id_false 
                   | (algebra.Alg.Term algebra.F.id_less_leaves (x8::
                      x7::nil)) =>
                    P_id_less_leaves (measure x8) (measure x7)
                   | _ => 0
                   end.
   Proof.
     intros t;case t;intros ;apply refl_equal.
   Qed.
   
   Lemma measure_bounded : forall t, 0 <= measure t.
   Proof.
     unfold measure in |-*.
     
     apply InterpZ.measure_bounded;
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Ltac generate_pos_hyp  :=
    match goal with
      | H:context [measure ?x] |- _ =>
       let v := fresh "v" in 
        (let H := fresh "h" in 
          (set (H:=measure_bounded x) in *;set (v:=measure x) in *;
            clearbody H;clearbody v))
      |  |- context [measure ?x] =>
       let v := fresh "v" in 
        (let H := fresh "h" in 
          (set (H:=measure_bounded x) in *;set (v:=measure x) in *;
            clearbody H;clearbody v))
      end
    .
   
   Lemma rules_monotonic :
    forall l r, 
     (algebra.EQT.axiom R_xml_0_deep_rew.R_xml_0_rules r l) ->
      measure r <= measure l.
   Proof.
     intros l r H.
     fold measure in |-*.
     
     inversion H;clear H;subst;inversion H0;clear H0;subst;
      simpl algebra.EQT.T.apply_subst in |-*;
      repeat (
      match goal with
        |  |- context [measure (algebra.Alg.Term ?f ?t)] =>
         rewrite (measure_equation (algebra.Alg.Term f t))
        end
      );repeat (generate_pos_hyp );
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma measure_star_monotonic :
    forall l r, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                r l) ->measure r <= measure l.
   Proof.
     unfold measure in *.
     apply InterpZ.measure_star_monotonic.
     intros ;apply P_id_concat_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_less_leaves_monotonic;assumption.
     intros ;apply P_id_concat_bounded;assumption.
     intros ;apply P_id_x_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_true_bounded;assumption.
     intros ;apply P_id_leaf_bounded;assumption.
     intros ;apply P_id_false_bounded;assumption.
     intros ;apply P_id_less_leaves_bounded;assumption.
     apply rules_monotonic.
   Qed.
   
   Definition P_id_LESS_LEAVES (x7:Z) (x8:Z) := 0.
   
   Definition P_id_CONCAT (x7:Z) (x8:Z) := 1* x7.
   
   Lemma P_id_LESS_LEAVES_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->
       P_id_LESS_LEAVES x8 x10 <= P_id_LESS_LEAVES x7 x9.
   Proof.
     intros x10 x9 x8 x7.
     intros [H_1 H_0].
     intros [H_3 H_2].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_CONCAT_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_CONCAT x8 x10 <= P_id_CONCAT x7 x9.
   Proof.
     intros x10 x9 x8 x7.
     intros [H_1 H_0].
     intros [H_3 H_2].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Definition marked_measure  := 
     InterpZ.marked_measure 0 P_id_concat P_id_x P_id_cons P_id_true 
      P_id_leaf P_id_false P_id_less_leaves P_id_LESS_LEAVES P_id_CONCAT.
   
   Lemma marked_measure_equation :
    forall t, 
     marked_measure t = match t with
                          | (algebra.Alg.Term algebra.F.id_less_leaves (x8::
                             x7::nil)) =>
                           P_id_LESS_LEAVES (measure x8) (measure x7)
                          | (algebra.Alg.Term algebra.F.id_concat (x8::
                             x7::nil)) =>
                           P_id_CONCAT (measure x8) (measure x7)
                          | _ => measure t
                          end.
   Proof.
     reflexivity .
   Qed.
   
   Lemma marked_measure_star_monotonic :
    forall f l1 l2, 
     (closure.refl_trans_clos (closure.one_step_list (algebra.EQT.one_step 
                                                       R_xml_0_deep_rew.R_xml_0_rules)
                                                      ) l1 l2) ->
      marked_measure (algebra.Alg.Term f l1) <= marked_measure (algebra.Alg.Term 
                                                                 f l2).
   Proof.
     unfold marked_measure in *.
     apply InterpZ.marked_measure_star_monotonic.
     intros ;apply P_id_concat_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_less_leaves_monotonic;assumption.
     intros ;apply P_id_concat_bounded;assumption.
     intros ;apply P_id_x_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_true_bounded;assumption.
     intros ;apply P_id_leaf_bounded;assumption.
     intros ;apply P_id_false_bounded;assumption.
     intros ;apply P_id_less_leaves_bounded;assumption.
     apply rules_monotonic.
     intros ;apply P_id_LESS_LEAVES_monotonic;assumption.
     intros ;apply P_id_CONCAT_monotonic;assumption.
   Qed.
   
   Ltac rewrite_and_unfold  :=
    do 2 (rewrite marked_measure_equation);
     repeat (
     match goal with
       |  |- context [measure (algebra.Alg.Term ?f ?t)] =>
        rewrite (measure_equation (algebra.Alg.Term f t))
       | H:context [measure (algebra.Alg.Term ?f ?t)] |- _ =>
        rewrite (measure_equation (algebra.Alg.Term f t)) in H|-
       end
     ).
   
   
   Lemma wf : well_founded WF_DP_R_xml_0.DP_R_xml_0_scc_1.
   Proof.
     intros x.
     
     apply well_founded_ind with
       (R:=fun x y => (Zwf.Zwf 0) (marked_measure x) (marked_measure y)).
     apply Inverse_Image.wf_inverse_image with  (B:=Z).
     apply Zwf.Zwf_well_founded.
     clear x.
     intros x IHx.
     
     repeat (
     constructor;inversion 1;subst;
      full_prove_ineq algebra.Alg.Term 
      ltac:(algebra.Alg_ext.find_replacement ) 
      algebra.EQT_ext.one_step_list_refl_trans_clos marked_measure 
      marked_measure_star_monotonic (Zwf.Zwf 0) (interp.o_Z 0) 
      ltac:(fun _ => R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 ) 
      ltac:(fun _ => rewrite_and_unfold ) ltac:(fun _ => generate_pos_hyp ) 
      ltac:(fun _ => cbv beta iota zeta delta - [Zplus Zmult Zle Zlt] in * ;
                      try (constructor))
       IHx
     ).
   Qed.
  End WF_DP_R_xml_0_scc_1.
  
  Definition wf_DP_R_xml_0_scc_1  := WF_DP_R_xml_0_scc_1.wf.
  
  
  Lemma acc_DP_R_xml_0_scc_1 :
   forall x y, (DP_R_xml_0_scc_1 x y) ->Acc WF_R_xml_0_deep_rew.DP_R_xml_0 x.
  Proof.
    intros x.
    pattern x.
    apply (@Acc_ind _ DP_R_xml_0_scc_1).
    intros x' _ Hrec y h.
    
    inversion h;clear h;subst;
     constructor;intros _y _h;inversion _h;clear _h;subst;
      (eapply Hrec;econstructor eassumption)||
      ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
       (eapply Hrec;econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))).
    apply wf_DP_R_xml_0_scc_1.
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_2  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <less_leaves(cons(u_,v_),cons(w_,z_)),concat(w_,z_)> *)
    | DP_R_xml_0_non_scc_2_0 :
     forall x8 x4 x2 x5 x3 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_cons (x2::x3::nil)) x8) ->
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_cons (x4::x5::nil)) x7) ->
        DP_R_xml_0_non_scc_2 (algebra.Alg.Term algebra.F.id_concat (x4::
                              x5::nil)) 
         (algebra.Alg.Term algebra.F.id_less_leaves (x8::x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_2 :
   forall x y, 
    (DP_R_xml_0_non_scc_2 x y) ->Acc WF_R_xml_0_deep_rew.DP_R_xml_0 x.
  Proof.
    intros x y h.
    
    inversion h;clear h;subst;
     constructor;intros _y _h;inversion _h;clear _h;subst;
      (eapply acc_DP_R_xml_0_scc_1;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
       (eapply Hrec;econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))).
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_3  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <less_leaves(cons(u_,v_),cons(w_,z_)),concat(u_,v_)> *)
    | DP_R_xml_0_non_scc_3_0 :
     forall x8 x4 x2 x5 x3 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_cons (x2::x3::nil)) x8) ->
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_cons (x4::x5::nil)) x7) ->
        DP_R_xml_0_non_scc_3 (algebra.Alg.Term algebra.F.id_concat (x2::
                              x3::nil)) 
         (algebra.Alg.Term algebra.F.id_less_leaves (x8::x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_3 :
   forall x y, 
    (DP_R_xml_0_non_scc_3 x y) ->Acc WF_R_xml_0_deep_rew.DP_R_xml_0 x.
  Proof.
    intros x y h.
    
    inversion h;clear h;subst;
     constructor;intros _y _h;inversion _h;clear _h;subst;
      (eapply acc_DP_R_xml_0_scc_1;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
       (eapply Hrec;econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))).
  Qed.
  
  
  Inductive DP_R_xml_0_scc_4  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <less_leaves(cons(u_,v_),cons(w_,z_)),less_leaves(concat(u_,v_),concat(w_,z_))> *)
    | DP_R_xml_0_scc_4_0 :
     forall x8 x4 x2 x5 x3 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_cons (x2::x3::nil)) x8) ->
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_cons (x4::x5::nil)) x7) ->
        DP_R_xml_0_scc_4 (algebra.Alg.Term algebra.F.id_less_leaves 
                          ((algebra.Alg.Term algebra.F.id_concat (x2::
                          x3::nil))::(algebra.Alg.Term algebra.F.id_concat 
                          (x4::x5::nil))::nil)) 
         (algebra.Alg.Term algebra.F.id_less_leaves (x8::x7::nil))
  .
  
  
  Module WF_DP_R_xml_0_scc_4.
   Open Scope Z_scope.
   
   Import ring_extention.
   
   Notation Local "a <= b" := (Zle a b).
   
   Notation Local "a < b" := (Zlt a b).
   
   Definition P_id_concat (x7:Z) (x8:Z) := 1* x7 + 1* x8.
   
   Definition P_id_x  := 0.
   
   Definition P_id_cons (x7:Z) (x8:Z) := 2 + 2* x7 + 1* x8.
   
   Definition P_id_true  := 2.
   
   Definition P_id_leaf  := 0.
   
   Definition P_id_false  := 0.
   
   Definition P_id_less_leaves (x7:Z) (x8:Z) := 2* x8.
   
   Lemma P_id_concat_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_concat x8 x10 <= P_id_concat x7 x9.
   Proof.
     intros x10 x9 x8 x7.
     intros [H_1 H_0].
     intros [H_3 H_2].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_cons_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_cons x8 x10 <= P_id_cons x7 x9.
   Proof.
     intros x10 x9 x8 x7.
     intros [H_1 H_0].
     intros [H_3 H_2].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_less_leaves_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->
       P_id_less_leaves x8 x10 <= P_id_less_leaves x7 x9.
   Proof.
     intros x10 x9 x8 x7.
     intros [H_1 H_0].
     intros [H_3 H_2].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_concat_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_concat x8 x7.
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_x_bounded : 0 <= P_id_x .
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_cons_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_cons x8 x7.
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_true_bounded : 0 <= P_id_true .
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_leaf_bounded : 0 <= P_id_leaf .
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_false_bounded : 0 <= P_id_false .
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_less_leaves_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_less_leaves x8 x7.
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Definition measure  := 
     InterpZ.measure 0 P_id_concat P_id_x P_id_cons P_id_true P_id_leaf 
      P_id_false P_id_less_leaves.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_concat (x8::x7::nil)) =>
                    P_id_concat (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_x nil) => P_id_x 
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_true nil) => P_id_true 
                   | (algebra.Alg.Term algebra.F.id_leaf nil) => P_id_leaf 
                   | (algebra.Alg.Term algebra.F.id_false nil) => P_id_false 
                   | (algebra.Alg.Term algebra.F.id_less_leaves (x8::
                      x7::nil)) =>
                    P_id_less_leaves (measure x8) (measure x7)
                   | _ => 0
                   end.
   Proof.
     intros t;case t;intros ;apply refl_equal.
   Qed.
   
   Lemma measure_bounded : forall t, 0 <= measure t.
   Proof.
     unfold measure in |-*.
     
     apply InterpZ.measure_bounded;
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Ltac generate_pos_hyp  :=
    match goal with
      | H:context [measure ?x] |- _ =>
       let v := fresh "v" in 
        (let H := fresh "h" in 
          (set (H:=measure_bounded x) in *;set (v:=measure x) in *;
            clearbody H;clearbody v))
      |  |- context [measure ?x] =>
       let v := fresh "v" in 
        (let H := fresh "h" in 
          (set (H:=measure_bounded x) in *;set (v:=measure x) in *;
            clearbody H;clearbody v))
      end
    .
   
   Lemma rules_monotonic :
    forall l r, 
     (algebra.EQT.axiom R_xml_0_deep_rew.R_xml_0_rules r l) ->
      measure r <= measure l.
   Proof.
     intros l r H.
     fold measure in |-*.
     
     inversion H;clear H;subst;inversion H0;clear H0;subst;
      simpl algebra.EQT.T.apply_subst in |-*;
      repeat (
      match goal with
        |  |- context [measure (algebra.Alg.Term ?f ?t)] =>
         rewrite (measure_equation (algebra.Alg.Term f t))
        end
      );repeat (generate_pos_hyp );
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma measure_star_monotonic :
    forall l r, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                r l) ->measure r <= measure l.
   Proof.
     unfold measure in *.
     apply InterpZ.measure_star_monotonic.
     intros ;apply P_id_concat_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_less_leaves_monotonic;assumption.
     intros ;apply P_id_concat_bounded;assumption.
     intros ;apply P_id_x_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_true_bounded;assumption.
     intros ;apply P_id_leaf_bounded;assumption.
     intros ;apply P_id_false_bounded;assumption.
     intros ;apply P_id_less_leaves_bounded;assumption.
     apply rules_monotonic.
   Qed.
   
   Definition P_id_LESS_LEAVES (x7:Z) (x8:Z) := 2* x7.
   
   Definition P_id_CONCAT (x7:Z) (x8:Z) := 0.
   
   Lemma P_id_LESS_LEAVES_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->
       P_id_LESS_LEAVES x8 x10 <= P_id_LESS_LEAVES x7 x9.
   Proof.
     intros x10 x9 x8 x7.
     intros [H_1 H_0].
     intros [H_3 H_2].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_CONCAT_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_CONCAT x8 x10 <= P_id_CONCAT x7 x9.
   Proof.
     intros x10 x9 x8 x7.
     intros [H_1 H_0].
     intros [H_3 H_2].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Definition marked_measure  := 
     InterpZ.marked_measure 0 P_id_concat P_id_x P_id_cons P_id_true 
      P_id_leaf P_id_false P_id_less_leaves P_id_LESS_LEAVES P_id_CONCAT.
   
   Lemma marked_measure_equation :
    forall t, 
     marked_measure t = match t with
                          | (algebra.Alg.Term algebra.F.id_less_leaves (x8::
                             x7::nil)) =>
                           P_id_LESS_LEAVES (measure x8) (measure x7)
                          | (algebra.Alg.Term algebra.F.id_concat (x8::
                             x7::nil)) =>
                           P_id_CONCAT (measure x8) (measure x7)
                          | _ => measure t
                          end.
   Proof.
     reflexivity .
   Qed.
   
   Lemma marked_measure_star_monotonic :
    forall f l1 l2, 
     (closure.refl_trans_clos (closure.one_step_list (algebra.EQT.one_step 
                                                       R_xml_0_deep_rew.R_xml_0_rules)
                                                      ) l1 l2) ->
      marked_measure (algebra.Alg.Term f l1) <= marked_measure (algebra.Alg.Term 
                                                                 f l2).
   Proof.
     unfold marked_measure in *.
     apply InterpZ.marked_measure_star_monotonic.
     intros ;apply P_id_concat_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_less_leaves_monotonic;assumption.
     intros ;apply P_id_concat_bounded;assumption.
     intros ;apply P_id_x_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_true_bounded;assumption.
     intros ;apply P_id_leaf_bounded;assumption.
     intros ;apply P_id_false_bounded;assumption.
     intros ;apply P_id_less_leaves_bounded;assumption.
     apply rules_monotonic.
     intros ;apply P_id_LESS_LEAVES_monotonic;assumption.
     intros ;apply P_id_CONCAT_monotonic;assumption.
   Qed.
   
   Ltac rewrite_and_unfold  :=
    do 2 (rewrite marked_measure_equation);
     repeat (
     match goal with
       |  |- context [measure (algebra.Alg.Term ?f ?t)] =>
        rewrite (measure_equation (algebra.Alg.Term f t))
       | H:context [measure (algebra.Alg.Term ?f ?t)] |- _ =>
        rewrite (measure_equation (algebra.Alg.Term f t)) in H|-
       end
     ).
   
   
   Lemma wf : well_founded WF_DP_R_xml_0.DP_R_xml_0_scc_4.
   Proof.
     intros x.
     
     apply well_founded_ind with
       (R:=fun x y => (Zwf.Zwf 0) (marked_measure x) (marked_measure y)).
     apply Inverse_Image.wf_inverse_image with  (B:=Z).
     apply Zwf.Zwf_well_founded.
     clear x.
     intros x IHx.
     
     repeat (
     constructor;inversion 1;subst;
      full_prove_ineq algebra.Alg.Term 
      ltac:(algebra.Alg_ext.find_replacement ) 
      algebra.EQT_ext.one_step_list_refl_trans_clos marked_measure 
      marked_measure_star_monotonic (Zwf.Zwf 0) (interp.o_Z 0) 
      ltac:(fun _ => R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 ) 
      ltac:(fun _ => rewrite_and_unfold ) ltac:(fun _ => generate_pos_hyp ) 
      ltac:(fun _ => cbv beta iota zeta delta - [Zplus Zmult Zle Zlt] in * ;
                      try (constructor))
       IHx
     ).
   Qed.
  End WF_DP_R_xml_0_scc_4.
  
  Definition wf_DP_R_xml_0_scc_4  := WF_DP_R_xml_0_scc_4.wf.
  
  
  Lemma acc_DP_R_xml_0_scc_4 :
   forall x y, (DP_R_xml_0_scc_4 x y) ->Acc WF_R_xml_0_deep_rew.DP_R_xml_0 x.
  Proof.
    intros x.
    pattern x.
    apply (@Acc_ind _ DP_R_xml_0_scc_4).
    intros x' _ Hrec y h.
    
    inversion h;clear h;subst;
     constructor;intros _y _h;inversion _h;clear _h;subst;
      (eapply Hrec;econstructor eassumption)||
      ((eapply acc_DP_R_xml_0_non_scc_3;
         econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
       ((eapply acc_DP_R_xml_0_non_scc_2;
          econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
        ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
         (eapply Hrec;
           econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))))).
    apply wf_DP_R_xml_0_scc_4.
  Qed.
  
  
  Lemma wf : well_founded WF_R_xml_0_deep_rew.DP_R_xml_0.
  Proof.
    constructor;intros _y _h;inversion _h;clear _h;subst;
     (eapply acc_DP_R_xml_0_non_scc_3;
       econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
     ((eapply acc_DP_R_xml_0_non_scc_2;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((eapply acc_DP_R_xml_0_non_scc_1;
         econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
       ((eapply acc_DP_R_xml_0_non_scc_0;
          econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
        ((eapply acc_DP_R_xml_0_scc_4;
           econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
         ((eapply acc_DP_R_xml_0_scc_3;
            econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
          ((eapply acc_DP_R_xml_0_scc_2;
             econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
           ((eapply acc_DP_R_xml_0_scc_1;
              econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
            ((eapply acc_DP_R_xml_0_scc_0;
               econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
             ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||(fail)))))))))).
  Qed.
 End WF_DP_R_xml_0.
 
 Definition wf_H  := WF_DP_R_xml_0.wf.
 
 Lemma wf :
  well_founded (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules).
 Proof.
   apply ddp.dp_criterion.
   apply R_xml_0_deep_rew.R_xml_0_non_var.
   apply R_xml_0_deep_rew.R_xml_0_reg.
   
   intros ;
    apply (ddp.constructor_defined_dec _ _ 
            R_xml_0_deep_rew.R_xml_0_rules_included).
   refine (Inclusion.wf_incl _ _ _ _ wf_H).
   intros x y H.
   destruct (R_xml_0_dp_step_spec H) as [f [l1 [l2 [H1 [H2 H3]]]]].
   
   destruct (ddp.dp_list_complete _ _ 
              R_xml_0_deep_rew.R_xml_0_rules_included _ _ H3)
    as [x' [y' [sigma [h1 [h2 h3]]]]].
   clear H3.
   subst.
   vm_compute in h3|-.
   let e := type of h3 in (dp_concl_tac h2 h3 ltac:(fun _ => idtac) e).
 Qed.
End WF_R_xml_0_deep_rew.


(* 
*** Local Variables: ***
*** coq-prog-name: "coqtop" ***
*** coq-prog-args: ("-emacs-U" "-I" "$COCCINELLE/examples" "-I" "$COCCINELLE/term_algebra" "-I" "$COCCINELLE/term_orderings" "-I" "$COCCINELLE/basis" "-I" "$COCCINELLE/list_extensions" "-I" "$COCCINELLE/examples/cime_trace/") ***
*** compile-command: "coqc -I $COCCINELLE/term_algebra -I $COCCINELLE/term_orderings -I $COCCINELLE/basis -I $COCCINELLE/list_extensions -I $COCCINELLE/examples/cime_trace/ -I $COCCINELLE/examples/  c_output/strat/tpdb-5.0___TRS___AG01___3.14.trs/a3pat.v" ***
*** End: ***
 *)