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_a__eq *)
    | id_a__eq : symb
     (* id_a__take *)
    | id_a__take : symb
     (* id_false *)
    | id_false : symb
     (* id_length *)
    | id_length : symb
     (* id_true *)
    | id_true : symb
     (* id_take *)
    | id_take : symb
     (* id_cons *)
    | id_cons : symb
     (* id_eq *)
    | id_eq : symb
     (* id_0 *)
    | id_0 : symb
     (* id_nil *)
    | id_nil : symb
     (* id_a__inf *)
    | id_a__inf : symb
     (* id_mark *)
    | id_mark : symb
     (* id_s *)
    | id_s : symb
     (* id_a__length *)
    | id_a__length : symb
     (* id_inf *)
    | id_inf : symb
  .
  
  
  Definition symb_eq_bool (f1 f2:symb) : bool := 
    match f1,f2 with
      | id_a__eq,id_a__eq => true
      | id_a__take,id_a__take => true
      | id_false,id_false => true
      | id_length,id_length => true
      | id_true,id_true => true
      | id_take,id_take => true
      | id_cons,id_cons => true
      | id_eq,id_eq => true
      | id_0,id_0 => true
      | id_nil,id_nil => true
      | id_a__inf,id_a__inf => true
      | id_mark,id_mark => true
      | id_s,id_s => true
      | id_a__length,id_a__length => true
      | id_inf,id_inf => 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_a__eq,id_a__eq => refl_equal _
             | id_a__take,id_a__take => refl_equal _
             | id_false,id_false => refl_equal _
             | id_length,id_length => refl_equal _
             | id_true,id_true => refl_equal _
             | id_take,id_take => refl_equal _
             | id_cons,id_cons => refl_equal _
             | id_eq,id_eq => refl_equal _
             | id_0,id_0 => refl_equal _
             | id_nil,id_nil => refl_equal _
             | id_a__inf,id_a__inf => refl_equal _
             | id_mark,id_mark => refl_equal _
             | id_s,id_s => refl_equal _
             | id_a__length,id_a__length => refl_equal _
             | id_inf,id_inf => refl_equal _
             | _,_ => _
             end;intros abs;discriminate.
  Defined.
  
  
  Definition arity (f:symb) := 
    match f with
      | id_a__eq => term.Free 2
      | id_a__take => term.Free 2
      | id_false => term.Free 0
      | id_length => term.Free 1
      | id_true => term.Free 0
      | id_take => term.Free 2
      | id_cons => term.Free 2
      | id_eq => term.Free 2
      | id_0 => term.Free 0
      | id_nil => term.Free 0
      | id_a__inf => term.Free 1
      | id_mark => term.Free 1
      | id_s => term.Free 1
      | id_a__length => term.Free 1
      | id_inf => term.Free 1
      end.
  
  
  Definition symb_order (f1 f2:symb) : bool := 
    match f1,f2 with
      | id_a__eq,id_a__eq => true
      | id_a__eq,id_a__take => false
      | id_a__eq,id_false => false
      | id_a__eq,id_length => false
      | id_a__eq,id_true => false
      | id_a__eq,id_take => false
      | id_a__eq,id_cons => false
      | id_a__eq,id_eq => false
      | id_a__eq,id_0 => false
      | id_a__eq,id_nil => false
      | id_a__eq,id_a__inf => false
      | id_a__eq,id_mark => false
      | id_a__eq,id_s => false
      | id_a__eq,id_a__length => false
      | id_a__eq,id_inf => false
      | id_a__take,id_a__eq => true
      | id_a__take,id_a__take => true
      | id_a__take,id_false => false
      | id_a__take,id_length => false
      | id_a__take,id_true => false
      | id_a__take,id_take => false
      | id_a__take,id_cons => false
      | id_a__take,id_eq => false
      | id_a__take,id_0 => false
      | id_a__take,id_nil => false
      | id_a__take,id_a__inf => false
      | id_a__take,id_mark => false
      | id_a__take,id_s => false
      | id_a__take,id_a__length => false
      | id_a__take,id_inf => false
      | id_false,id_a__eq => true
      | id_false,id_a__take => true
      | id_false,id_false => true
      | id_false,id_length => false
      | id_false,id_true => false
      | id_false,id_take => false
      | id_false,id_cons => false
      | id_false,id_eq => false
      | id_false,id_0 => false
      | id_false,id_nil => false
      | id_false,id_a__inf => false
      | id_false,id_mark => false
      | id_false,id_s => false
      | id_false,id_a__length => false
      | id_false,id_inf => false
      | id_length,id_a__eq => true
      | id_length,id_a__take => true
      | id_length,id_false => true
      | id_length,id_length => true
      | id_length,id_true => false
      | id_length,id_take => false
      | id_length,id_cons => false
      | id_length,id_eq => false
      | id_length,id_0 => false
      | id_length,id_nil => false
      | id_length,id_a__inf => false
      | id_length,id_mark => false
      | id_length,id_s => false
      | id_length,id_a__length => false
      | id_length,id_inf => false
      | id_true,id_a__eq => true
      | id_true,id_a__take => true
      | id_true,id_false => true
      | id_true,id_length => true
      | id_true,id_true => true
      | id_true,id_take => false
      | id_true,id_cons => false
      | id_true,id_eq => false
      | id_true,id_0 => false
      | id_true,id_nil => false
      | id_true,id_a__inf => false
      | id_true,id_mark => false
      | id_true,id_s => false
      | id_true,id_a__length => false
      | id_true,id_inf => false
      | id_take,id_a__eq => true
      | id_take,id_a__take => true
      | id_take,id_false => true
      | id_take,id_length => true
      | id_take,id_true => true
      | id_take,id_take => true
      | id_take,id_cons => false
      | id_take,id_eq => false
      | id_take,id_0 => false
      | id_take,id_nil => false
      | id_take,id_a__inf => false
      | id_take,id_mark => false
      | id_take,id_s => false
      | id_take,id_a__length => false
      | id_take,id_inf => false
      | id_cons,id_a__eq => true
      | id_cons,id_a__take => true
      | id_cons,id_false => true
      | id_cons,id_length => true
      | id_cons,id_true => true
      | id_cons,id_take => true
      | id_cons,id_cons => true
      | id_cons,id_eq => false
      | id_cons,id_0 => false
      | id_cons,id_nil => false
      | id_cons,id_a__inf => false
      | id_cons,id_mark => false
      | id_cons,id_s => false
      | id_cons,id_a__length => false
      | id_cons,id_inf => false
      | id_eq,id_a__eq => true
      | id_eq,id_a__take => true
      | id_eq,id_false => true
      | id_eq,id_length => true
      | id_eq,id_true => true
      | id_eq,id_take => true
      | id_eq,id_cons => true
      | id_eq,id_eq => true
      | id_eq,id_0 => false
      | id_eq,id_nil => false
      | id_eq,id_a__inf => false
      | id_eq,id_mark => false
      | id_eq,id_s => false
      | id_eq,id_a__length => false
      | id_eq,id_inf => false
      | id_0,id_a__eq => true
      | id_0,id_a__take => true
      | id_0,id_false => true
      | id_0,id_length => true
      | id_0,id_true => true
      | id_0,id_take => true
      | id_0,id_cons => true
      | id_0,id_eq => true
      | id_0,id_0 => true
      | id_0,id_nil => false
      | id_0,id_a__inf => false
      | id_0,id_mark => false
      | id_0,id_s => false
      | id_0,id_a__length => false
      | id_0,id_inf => false
      | id_nil,id_a__eq => true
      | id_nil,id_a__take => true
      | id_nil,id_false => true
      | id_nil,id_length => true
      | id_nil,id_true => true
      | id_nil,id_take => true
      | id_nil,id_cons => true
      | id_nil,id_eq => true
      | id_nil,id_0 => true
      | id_nil,id_nil => true
      | id_nil,id_a__inf => false
      | id_nil,id_mark => false
      | id_nil,id_s => false
      | id_nil,id_a__length => false
      | id_nil,id_inf => false
      | id_a__inf,id_a__eq => true
      | id_a__inf,id_a__take => true
      | id_a__inf,id_false => true
      | id_a__inf,id_length => true
      | id_a__inf,id_true => true
      | id_a__inf,id_take => true
      | id_a__inf,id_cons => true
      | id_a__inf,id_eq => true
      | id_a__inf,id_0 => true
      | id_a__inf,id_nil => true
      | id_a__inf,id_a__inf => true
      | id_a__inf,id_mark => false
      | id_a__inf,id_s => false
      | id_a__inf,id_a__length => false
      | id_a__inf,id_inf => false
      | id_mark,id_a__eq => true
      | id_mark,id_a__take => true
      | id_mark,id_false => true
      | id_mark,id_length => true
      | id_mark,id_true => true
      | id_mark,id_take => true
      | id_mark,id_cons => true
      | id_mark,id_eq => true
      | id_mark,id_0 => true
      | id_mark,id_nil => true
      | id_mark,id_a__inf => true
      | id_mark,id_mark => true
      | id_mark,id_s => false
      | id_mark,id_a__length => false
      | id_mark,id_inf => false
      | id_s,id_a__eq => true
      | id_s,id_a__take => true
      | id_s,id_false => true
      | id_s,id_length => true
      | id_s,id_true => true
      | id_s,id_take => true
      | id_s,id_cons => true
      | id_s,id_eq => true
      | id_s,id_0 => true
      | id_s,id_nil => true
      | id_s,id_a__inf => true
      | id_s,id_mark => true
      | id_s,id_s => true
      | id_s,id_a__length => false
      | id_s,id_inf => false
      | id_a__length,id_a__eq => true
      | id_a__length,id_a__take => true
      | id_a__length,id_false => true
      | id_a__length,id_length => true
      | id_a__length,id_true => true
      | id_a__length,id_take => true
      | id_a__length,id_cons => true
      | id_a__length,id_eq => true
      | id_a__length,id_0 => true
      | id_a__length,id_nil => true
      | id_a__length,id_a__inf => true
      | id_a__length,id_mark => true
      | id_a__length,id_s => true
      | id_a__length,id_a__length => true
      | id_a__length,id_inf => false
      | id_inf,id_a__eq => true
      | id_inf,id_a__take => true
      | id_inf,id_false => true
      | id_inf,id_length => true
      | id_inf,id_true => true
      | id_inf,id_take => true
      | id_inf,id_cons => true
      | id_inf,id_eq => true
      | id_inf,id_0 => true
      | id_inf,id_nil => true
      | id_inf,id_a__inf => true
      | id_inf,id_mark => true
      | id_inf,id_s => true
      | id_inf,id_a__length => true
      | id_inf,id_inf => 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 := 
    (* a__eq(0,0) -> true *)
   | R_xml_0_rule_0 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_true nil) 
     (algebra.Alg.Term algebra.F.id_a__eq ((algebra.Alg.Term algebra.F.id_0 
      nil)::(algebra.Alg.Term algebra.F.id_0 nil)::nil))
    (* a__eq(s(X_),s(Y_)) -> a__eq(X_,Y_) *)
   | R_xml_0_rule_1 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_a__eq ((algebra.Alg.Var 1)::
                   (algebra.Alg.Var 2)::nil)) 
     (algebra.Alg.Term algebra.F.id_a__eq ((algebra.Alg.Term algebra.F.id_s 
      ((algebra.Alg.Var 1)::nil))::(algebra.Alg.Term algebra.F.id_s 
      ((algebra.Alg.Var 2)::nil))::nil))
    (* a__eq(X_,Y_) -> false *)
   | R_xml_0_rule_2 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_false nil) 
     (algebra.Alg.Term algebra.F.id_a__eq ((algebra.Alg.Var 1)::
      (algebra.Alg.Var 2)::nil))
    (* a__inf(X_) -> cons(X_,inf(s(X_))) *)
   | R_xml_0_rule_3 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Var 1)::
                   (algebra.Alg.Term algebra.F.id_inf ((algebra.Alg.Term 
                   algebra.F.id_s ((algebra.Alg.Var 1)::nil))::nil))::nil)) 
     (algebra.Alg.Term algebra.F.id_a__inf ((algebra.Alg.Var 1)::nil))
    (* a__take(0,X_) -> nil *)
   | R_xml_0_rule_4 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_nil nil) 
     (algebra.Alg.Term algebra.F.id_a__take ((algebra.Alg.Term 
      algebra.F.id_0 nil)::(algebra.Alg.Var 1)::nil))
   
    (* a__take(s(X_),cons(Y_,L_)) -> cons(Y_,take(X_,L_)) *)
   | R_xml_0_rule_5 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Var 2)::
                   (algebra.Alg.Term algebra.F.id_take ((algebra.Alg.Var 1)::
                   (algebra.Alg.Var 3)::nil))::nil)) 
     (algebra.Alg.Term algebra.F.id_a__take ((algebra.Alg.Term 
      algebra.F.id_s ((algebra.Alg.Var 1)::nil))::(algebra.Alg.Term 
      algebra.F.id_cons ((algebra.Alg.Var 2)::
      (algebra.Alg.Var 3)::nil))::nil))
    (* a__length(nil) -> 0 *)
   | R_xml_0_rule_6 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_0 nil) 
     (algebra.Alg.Term algebra.F.id_a__length ((algebra.Alg.Term 
      algebra.F.id_nil nil)::nil))
    (* a__length(cons(X_,L_)) -> s(length(L_)) *)
   | R_xml_0_rule_7 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_s ((algebra.Alg.Term 
                   algebra.F.id_length ((algebra.Alg.Var 3)::nil))::nil)) 
     (algebra.Alg.Term algebra.F.id_a__length ((algebra.Alg.Term 
      algebra.F.id_cons ((algebra.Alg.Var 1)::
      (algebra.Alg.Var 3)::nil))::nil))
    (* mark(eq(X1_,X2_)) -> a__eq(X1_,X2_) *)
   | R_xml_0_rule_8 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_a__eq ((algebra.Alg.Var 4)::
                   (algebra.Alg.Var 5)::nil)) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_eq 
      ((algebra.Alg.Var 4)::(algebra.Alg.Var 5)::nil))::nil))
    (* mark(inf(X_)) -> a__inf(mark(X_)) *)
   | R_xml_0_rule_9 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_a__inf ((algebra.Alg.Term 
                   algebra.F.id_mark ((algebra.Alg.Var 1)::nil))::nil)) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_inf 
      ((algebra.Alg.Var 1)::nil))::nil))
   
    (* mark(take(X1_,X2_)) -> a__take(mark(X1_),mark(X2_)) *)
   | R_xml_0_rule_10 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_a__take ((algebra.Alg.Term 
                   algebra.F.id_mark ((algebra.Alg.Var 4)::nil))::
                   (algebra.Alg.Term algebra.F.id_mark 
                   ((algebra.Alg.Var 5)::nil))::nil)) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
      algebra.F.id_take ((algebra.Alg.Var 4)::
      (algebra.Alg.Var 5)::nil))::nil))
    (* mark(length(X_)) -> a__length(mark(X_)) *)
   | R_xml_0_rule_11 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_a__length 
                   ((algebra.Alg.Term algebra.F.id_mark 
                   ((algebra.Alg.Var 1)::nil))::nil)) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
      algebra.F.id_length ((algebra.Alg.Var 1)::nil))::nil))
    (* mark(0) -> 0 *)
   | R_xml_0_rule_12 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_0 nil) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_0 
      nil)::nil))
    (* mark(true) -> true *)
   | R_xml_0_rule_13 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_true nil) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
      algebra.F.id_true nil)::nil))
    (* mark(s(X_)) -> s(X_) *)
   | R_xml_0_rule_14 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_s 
                   ((algebra.Alg.Var 1)::nil)) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_s 
      ((algebra.Alg.Var 1)::nil))::nil))
    (* mark(false) -> false *)
   | R_xml_0_rule_15 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_false nil) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
      algebra.F.id_false nil)::nil))
    (* mark(cons(X1_,X2_)) -> cons(X1_,X2_) *)
   | R_xml_0_rule_16 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Var 4)::
                   (algebra.Alg.Var 5)::nil)) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
      algebra.F.id_cons ((algebra.Alg.Var 4)::
      (algebra.Alg.Var 5)::nil))::nil))
    (* mark(nil) -> nil *)
   | R_xml_0_rule_17 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_nil nil) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_nil 
      nil)::nil))
    (* a__eq(X1_,X2_) -> eq(X1_,X2_) *)
   | R_xml_0_rule_18 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_eq ((algebra.Alg.Var 4)::
                   (algebra.Alg.Var 5)::nil)) 
     (algebra.Alg.Term algebra.F.id_a__eq ((algebra.Alg.Var 4)::
      (algebra.Alg.Var 5)::nil))
    (* a__inf(X_) -> inf(X_) *)
   | R_xml_0_rule_19 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_inf 
                   ((algebra.Alg.Var 1)::nil)) 
     (algebra.Alg.Term algebra.F.id_a__inf ((algebra.Alg.Var 1)::nil))
    (* a__take(X1_,X2_) -> take(X1_,X2_) *)
   | R_xml_0_rule_20 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_take ((algebra.Alg.Var 4)::
                   (algebra.Alg.Var 5)::nil)) 
     (algebra.Alg.Term algebra.F.id_a__take ((algebra.Alg.Var 4)::
      (algebra.Alg.Var 5)::nil))
    (* a__length(X_) -> length(X_) *)
   | R_xml_0_rule_21 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_length 
                   ((algebra.Alg.Var 1)::nil)) 
     (algebra.Alg.Term algebra.F.id_a__length ((algebra.Alg.Var 1)::nil))
 .
 
 
 Definition R_xml_0_rule_as_list_0  := 
   ((algebra.Alg.Term algebra.F.id_a__eq ((algebra.Alg.Term algebra.F.id_0 
     nil)::(algebra.Alg.Term algebra.F.id_0 nil)::nil)),
    (algebra.Alg.Term algebra.F.id_true nil))::nil.
 
 
 Definition R_xml_0_rule_as_list_1  := 
   ((algebra.Alg.Term algebra.F.id_a__eq ((algebra.Alg.Term algebra.F.id_s 
     ((algebra.Alg.Var 1)::nil))::(algebra.Alg.Term algebra.F.id_s 
     ((algebra.Alg.Var 2)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_a__eq ((algebra.Alg.Var 1)::
     (algebra.Alg.Var 2)::nil)))::R_xml_0_rule_as_list_0.
 
 
 Definition R_xml_0_rule_as_list_2  := 
   ((algebra.Alg.Term algebra.F.id_a__eq ((algebra.Alg.Var 1)::
     (algebra.Alg.Var 2)::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_a__inf ((algebra.Alg.Var 1)::nil)),
    (algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Var 1)::
     (algebra.Alg.Term algebra.F.id_inf ((algebra.Alg.Term algebra.F.id_s 
     ((algebra.Alg.Var 1)::nil))::nil))::nil)))::R_xml_0_rule_as_list_2.
 
 
 Definition R_xml_0_rule_as_list_4  := 
   ((algebra.Alg.Term algebra.F.id_a__take ((algebra.Alg.Term algebra.F.id_0 
     nil)::(algebra.Alg.Var 1)::nil)),
    (algebra.Alg.Term algebra.F.id_nil nil))::R_xml_0_rule_as_list_3.
 
 
 Definition R_xml_0_rule_as_list_5  := 
   ((algebra.Alg.Term algebra.F.id_a__take ((algebra.Alg.Term algebra.F.id_s 
     ((algebra.Alg.Var 1)::nil))::(algebra.Alg.Term algebra.F.id_cons 
     ((algebra.Alg.Var 2)::(algebra.Alg.Var 3)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Var 2)::
     (algebra.Alg.Term algebra.F.id_take ((algebra.Alg.Var 1)::
     (algebra.Alg.Var 3)::nil))::nil)))::R_xml_0_rule_as_list_4.
 
 
 Definition R_xml_0_rule_as_list_6  := 
   ((algebra.Alg.Term algebra.F.id_a__length ((algebra.Alg.Term 
     algebra.F.id_nil nil)::nil)),(algebra.Alg.Term algebra.F.id_0 nil))::
    R_xml_0_rule_as_list_5.
 
 
 Definition R_xml_0_rule_as_list_7  := 
   ((algebra.Alg.Term algebra.F.id_a__length ((algebra.Alg.Term 
     algebra.F.id_cons ((algebra.Alg.Var 1)::
     (algebra.Alg.Var 3)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_s ((algebra.Alg.Term algebra.F.id_length 
     ((algebra.Alg.Var 3)::nil))::nil)))::R_xml_0_rule_as_list_6.
 
 
 Definition R_xml_0_rule_as_list_8  := 
   ((algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_eq 
     ((algebra.Alg.Var 4)::(algebra.Alg.Var 5)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_a__eq ((algebra.Alg.Var 4)::
     (algebra.Alg.Var 5)::nil)))::R_xml_0_rule_as_list_7.
 
 
 Definition R_xml_0_rule_as_list_9  := 
   ((algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_inf 
     ((algebra.Alg.Var 1)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_a__inf ((algebra.Alg.Term 
     algebra.F.id_mark ((algebra.Alg.Var 1)::nil))::nil)))::
    R_xml_0_rule_as_list_8.
 
 
 Definition R_xml_0_rule_as_list_10  := 
   ((algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_take 
     ((algebra.Alg.Var 4)::(algebra.Alg.Var 5)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_a__take ((algebra.Alg.Term 
     algebra.F.id_mark ((algebra.Alg.Var 4)::nil))::(algebra.Alg.Term 
     algebra.F.id_mark ((algebra.Alg.Var 5)::nil))::nil)))::
    R_xml_0_rule_as_list_9.
 
 
 Definition R_xml_0_rule_as_list_11  := 
   ((algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
     algebra.F.id_length ((algebra.Alg.Var 1)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_a__length ((algebra.Alg.Term 
     algebra.F.id_mark ((algebra.Alg.Var 1)::nil))::nil)))::
    R_xml_0_rule_as_list_10.
 
 
 Definition R_xml_0_rule_as_list_12  := 
   ((algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_0 
     nil)::nil)),(algebra.Alg.Term algebra.F.id_0 nil))::
    R_xml_0_rule_as_list_11.
 
 
 Definition R_xml_0_rule_as_list_13  := 
   ((algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_true 
     nil)::nil)),(algebra.Alg.Term algebra.F.id_true nil))::
    R_xml_0_rule_as_list_12.
 
 
 Definition R_xml_0_rule_as_list_14  := 
   ((algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_s 
     ((algebra.Alg.Var 1)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_s ((algebra.Alg.Var 1)::nil)))::
    R_xml_0_rule_as_list_13.
 
 
 Definition R_xml_0_rule_as_list_15  := 
   ((algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
     algebra.F.id_false nil)::nil)),
    (algebra.Alg.Term algebra.F.id_false nil))::R_xml_0_rule_as_list_14.
 
 
 Definition R_xml_0_rule_as_list_16  := 
   ((algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_cons 
     ((algebra.Alg.Var 4)::(algebra.Alg.Var 5)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Var 4)::
     (algebra.Alg.Var 5)::nil)))::R_xml_0_rule_as_list_15.
 
 
 Definition R_xml_0_rule_as_list_17  := 
   ((algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_nil 
     nil)::nil)),(algebra.Alg.Term algebra.F.id_nil nil))::
    R_xml_0_rule_as_list_16.
 
 
 Definition R_xml_0_rule_as_list_18  := 
   ((algebra.Alg.Term algebra.F.id_a__eq ((algebra.Alg.Var 4)::
     (algebra.Alg.Var 5)::nil)),
    (algebra.Alg.Term algebra.F.id_eq ((algebra.Alg.Var 4)::
     (algebra.Alg.Var 5)::nil)))::R_xml_0_rule_as_list_17.
 
 
 Definition R_xml_0_rule_as_list_19  := 
   ((algebra.Alg.Term algebra.F.id_a__inf ((algebra.Alg.Var 1)::nil)),
    (algebra.Alg.Term algebra.F.id_inf ((algebra.Alg.Var 1)::nil)))::
    R_xml_0_rule_as_list_18.
 
 
 Definition R_xml_0_rule_as_list_20  := 
   ((algebra.Alg.Term algebra.F.id_a__take ((algebra.Alg.Var 4)::
     (algebra.Alg.Var 5)::nil)),
    (algebra.Alg.Term algebra.F.id_take ((algebra.Alg.Var 4)::
     (algebra.Alg.Var 5)::nil)))::R_xml_0_rule_as_list_19.
 
 
 Definition R_xml_0_rule_as_list_21  := 
   ((algebra.Alg.Term algebra.F.id_a__length ((algebra.Alg.Var 1)::nil)),
    (algebra.Alg.Term algebra.F.id_length ((algebra.Alg.Var 1)::nil)))::
    R_xml_0_rule_as_list_20.
 
 Definition R_xml_0_rule_as_list  := R_xml_0_rule_as_list_21.
 
 
 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.or23_equiv in H|-.
   case H;clear H;intros H.
   injection H;intros ;subst;constructor 22.
   injection H;intros ;subst;constructor 21.
   injection H;intros ;subst;constructor 20.
   injection H;intros ;subst;constructor 19.
   injection H;intros ;subst;constructor 18.
   injection H;intros ;subst;constructor 17.
   injection H;intros ;subst;constructor 16.
   injection H;intros ;subst;constructor 15.
   injection H;intros ;subst;constructor 14.
   injection H;intros ;subst;constructor 13.
   injection H;intros ;subst;constructor 12.
   injection H;intros ;subst;constructor 11.
   injection H;intros ;subst;constructor 10.
   injection H;intros ;subst;constructor 9.
   injection H;intros ;subst;constructor 8.
   injection H;intros ;subst;constructor 7.
   injection H;intros ;subst;constructor 6.
   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_10 (x7 x8 x9 x10 x11 x12 x13 x14 x15 x16:Prop) :
  Prop := 
   | conj_10 :
    x7->x8->x9->x10->x11->x12->x13->x14->x15->x16->
     and_10 x7 x8 x9 x10 x11 x12 x13 x14 x15 x16
 .
 
 
 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_10 (t = (algebra.Alg.Term algebra.F.id_false nil) ->
            t' = (algebra.Alg.Term algebra.F.id_false nil)) 
     (forall x8, 
      t = (algebra.Alg.Term algebra.F.id_length (x8::nil)) ->
       exists x7,
         t' = (algebra.Alg.Term algebra.F.id_length (x7::nil))/\ 
         (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) x7 x8)) 
     
     (t = (algebra.Alg.Term algebra.F.id_true nil) ->
      t' = (algebra.Alg.Term algebra.F.id_true nil)) 
     (forall x8 x10, 
      t = (algebra.Alg.Term algebra.F.id_take (x8::x10::nil)) ->
       exists x7,
         exists x9,
           t' = (algebra.Alg.Term algebra.F.id_take (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)) 
     (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)) 
     (forall x8 x10, 
      t = (algebra.Alg.Term algebra.F.id_eq (x8::x10::nil)) ->
       exists x7,
         exists x9,
           t' = (algebra.Alg.Term algebra.F.id_eq (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_0 nil) ->
      t' = (algebra.Alg.Term algebra.F.id_0 nil)) 
     (t = (algebra.Alg.Term algebra.F.id_nil nil) ->
      t' = (algebra.Alg.Term algebra.F.id_nil nil)) 
     (forall x8, 
      t = (algebra.Alg.Term algebra.F.id_s (x8::nil)) ->
       exists x7,
         t' = (algebra.Alg.Term algebra.F.id_s (x7::nil))/\ 
         (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) x7 x8)) 
     
     (forall x8, 
      t = (algebra.Alg.Term algebra.F.id_inf (x8::nil)) ->
       exists x7,
         t' = (algebra.Alg.Term algebra.F.id_inf (x7::nil))/\ 
         (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) x7 x8)).
 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 H;exists x8;intuition;constructor 1.
   intros H;intuition;constructor 1.
   intros x8 x10 H;exists x8;exists x10;intuition;constructor 1.
   intros x8 x10 H;exists x8;exists x10;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 x8 H;exists x8;intuition;constructor 1.
   intros x8 H;exists x8;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_false H_id_length H_id_true H_id_take H_id_cons H_id_eq H_id_0 
    H_id_nil H_id_s H_id_inf].
   constructor.
   
   clear H_id_length H_id_true H_id_take H_id_cons H_id_eq H_id_0 H_id_nil 
   H_id_s H_id_inf;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_false H_id_true H_id_take H_id_cons H_id_eq H_id_0 H_id_nil 
   H_id_s H_id_inf;intros x8 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_length y (refl_equal _)) as [x7];intros ;intuition;
       exists x7;intuition;eapply closure_extension.refl_trans_clos_R;
       eassumption
     end
   .
   
   clear H_id_false H_id_length H_id_take H_id_cons H_id_eq H_id_0 H_id_nil 
   H_id_s H_id_inf;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_false H_id_length H_id_true H_id_cons H_id_eq H_id_0 H_id_nil 
   H_id_s H_id_inf;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_take 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_take 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_false H_id_length H_id_true H_id_take H_id_eq H_id_0 H_id_nil 
   H_id_s H_id_inf;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_false H_id_length H_id_true H_id_take H_id_cons H_id_0 
   H_id_nil H_id_s H_id_inf;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_eq 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_eq 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_false H_id_length H_id_true H_id_take H_id_cons H_id_eq 
   H_id_nil H_id_s H_id_inf;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_false H_id_length H_id_true H_id_take H_id_cons H_id_eq 
   H_id_0 H_id_s H_id_inf;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_false H_id_length H_id_true H_id_take H_id_cons H_id_eq 
   H_id_0 H_id_nil H_id_inf;intros x8 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_s y (refl_equal _)) as [x7];intros ;intuition;exists x7;
       intuition;eapply closure_extension.refl_trans_clos_R;eassumption
     end
   .
   
   clear H_id_false H_id_length H_id_true H_id_take H_id_cons H_id_eq 
   H_id_0 H_id_nil H_id_s;intros x8 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_inf y (refl_equal _)) as [x7];intros ;intuition;
       exists x7;intuition;eapply closure_extension.refl_trans_clos_R;
       eassumption
     end
   .
 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.
 
 
 Lemma id_length_is_R_xml_0_constructor :
  forall t t', 
   (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) t' t) ->
    forall x8, 
     t = (algebra.Alg.Term algebra.F.id_length (x8::nil)) ->
      exists x7,
        t' = (algebra.Alg.Term algebra.F.id_length (x7::nil))/\ 
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) x7 x8).
 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_take_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_take (x8::x10::nil)) ->
      exists x7,
        exists x9,
          t' = (algebra.Alg.Term algebra.F.id_take (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_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_eq_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_eq (x8::x10::nil)) ->
      exists x7,
        exists x9,
          t' = (algebra.Alg.Term algebra.F.id_eq (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_0_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_0 nil) ->
     t' = (algebra.Alg.Term algebra.F.id_0 nil).
 Proof.
   intros t t' H.
   destruct (are_constuctors_of_R_xml_0 H).
   assumption.
 Qed.
 
 
 Lemma id_nil_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_nil nil) ->
     t' = (algebra.Alg.Term algebra.F.id_nil nil).
 Proof.
   intros t t' H.
   destruct (are_constuctors_of_R_xml_0 H).
   assumption.
 Qed.
 
 
 Lemma id_s_is_R_xml_0_constructor :
  forall t t', 
   (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) t' t) ->
    forall x8, 
     t = (algebra.Alg.Term algebra.F.id_s (x8::nil)) ->
      exists x7,
        t' = (algebra.Alg.Term algebra.F.id_s (x7::nil))/\ 
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) x7 x8).
 Proof.
   intros t t' H.
   destruct (are_constuctors_of_R_xml_0 H).
   assumption.
 Qed.
 
 
 Lemma id_inf_is_R_xml_0_constructor :
  forall t t', 
   (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) t' t) ->
    forall x8, 
     t = (algebra.Alg.Term algebra.F.id_inf (x8::nil)) ->
      exists x7,
        t' = (algebra.Alg.Term algebra.F.id_inf (x7::nil))/\ 
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) x7 x8).
 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_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 ))
    | H:closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) 
         _ (algebra.Alg.Term algebra.F.id_length (?x7::nil)) |- _ =>
     let x7 := fresh "x" in 
      (let Heq := fresh "Heq" in 
        (let Hred1 := fresh "Hred" in 
          (destruct (id_length_is_R_xml_0_constructor H (refl_equal _)) as 
           [x7 [Heq 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_take (?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_take_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_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_eq (?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_eq_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_0 nil) |- _ =>
     let Heq := fresh "Heq" in 
      (set (Heq:=id_0_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_nil nil) |- _ =>
     let Heq := fresh "Heq" in 
      (set (Heq:=id_nil_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_s (?x7::nil)) |- _ =>
     let x7 := fresh "x" in 
      (let Heq := fresh "Heq" in 
        (let Hred1 := fresh "Hred" in 
          (destruct (id_s_is_R_xml_0_constructor H (refl_equal _)) as 
           [x7 [Heq 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_inf (?x7::nil)) |- _ =>
     let x7 := fresh "x" in 
      (let Heq := fresh "Heq" in 
        (let Hred1 := fresh "Hred" in 
          (destruct (id_inf_is_R_xml_0_constructor H (refl_equal _)) as 
           [x7 [Heq Hred1]];
            (discriminate Heq)||
            (injection Heq;intros ;subst;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_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 )))
    | H:closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_rules) 
         _ (algebra.Alg.Term algebra.F.id_length (?x7::nil)) |- _ =>
     let x7 := fresh "x" in 
      (let Heq := fresh "Heq" in 
        (let Hred1 := fresh "Hred" in 
          (destruct (id_length_is_R_xml_0_constructor H (refl_equal _)) as 
           [x7 [Heq 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_take (?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_take_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_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_eq (?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_eq_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_0 nil) |- _ =>
     let Heq := fresh "Heq" in 
      (set (Heq:=id_0_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_nil nil) |- _ =>
     let Heq := fresh "Heq" in 
      (set (Heq:=id_nil_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_s (?x7::nil)) |- _ =>
     let x7 := fresh "x" in 
      (let Heq := fresh "Heq" in 
        (let Hred1 := fresh "Hred" in 
          (destruct (id_s_is_R_xml_0_constructor H (refl_equal _)) as 
           [x7 [Heq 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_inf (?x7::nil)) |- _ =>
     let x7 := fresh "x" in 
      (let Heq := fresh "Heq" in 
        (let Hred1 := fresh "Hred" in 
          (destruct (id_inf_is_R_xml_0_constructor H (refl_equal _)) as 
           [x7 [Heq Hred1]];
            (discriminate Heq)||
            (injection Heq;intros ;subst;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_a__eq : A ->A ->A.
   
   Hypothesis P_id_a__take : A ->A ->A.
   
   Hypothesis P_id_false : A.
   
   Hypothesis P_id_length : A ->A.
   
   Hypothesis P_id_true : A.
   
   Hypothesis P_id_take : A ->A ->A.
   
   Hypothesis P_id_cons : A ->A ->A.
   
   Hypothesis P_id_eq : A ->A ->A.
   
   Hypothesis P_id_0 : A.
   
   Hypothesis P_id_nil : A.
   
   Hypothesis P_id_a__inf : A ->A.
   
   Hypothesis P_id_mark : A ->A.
   
   Hypothesis P_id_s : A ->A.
   
   Hypothesis P_id_a__length : A ->A.
   
   Hypothesis P_id_inf : A ->A.
   
   Hypothesis P_id_a__eq_monotonic :
    forall x8 x10 x9 x7, 
     (A0 <= x10)/\ (x10 <= x9) ->
      (A0 <= x8)/\ (x8 <= x7) ->P_id_a__eq x8 x10 <= P_id_a__eq x7 x9.
   
   Hypothesis P_id_a__take_monotonic :
    forall x8 x10 x9 x7, 
     (A0 <= x10)/\ (x10 <= x9) ->
      (A0 <= x8)/\ (x8 <= x7) ->P_id_a__take x8 x10 <= P_id_a__take x7 x9.
   
   Hypothesis P_id_length_monotonic :
    forall x8 x7, (A0 <= x8)/\ (x8 <= x7) ->P_id_length x8 <= P_id_length x7.
   
   Hypothesis P_id_take_monotonic :
    forall x8 x10 x9 x7, 
     (A0 <= x10)/\ (x10 <= x9) ->
      (A0 <= x8)/\ (x8 <= x7) ->P_id_take x8 x10 <= P_id_take 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_eq_monotonic :
    forall x8 x10 x9 x7, 
     (A0 <= x10)/\ (x10 <= x9) ->
      (A0 <= x8)/\ (x8 <= x7) ->P_id_eq x8 x10 <= P_id_eq x7 x9.
   
   Hypothesis P_id_a__inf_monotonic :
    forall x8 x7, (A0 <= x8)/\ (x8 <= x7) ->P_id_a__inf x8 <= P_id_a__inf x7.
   
   Hypothesis P_id_mark_monotonic :
    forall x8 x7, (A0 <= x8)/\ (x8 <= x7) ->P_id_mark x8 <= P_id_mark x7.
   
   Hypothesis P_id_s_monotonic :
    forall x8 x7, (A0 <= x8)/\ (x8 <= x7) ->P_id_s x8 <= P_id_s x7.
   
   Hypothesis P_id_a__length_monotonic :
    forall x8 x7, 
     (A0 <= x8)/\ (x8 <= x7) ->P_id_a__length x8 <= P_id_a__length x7.
   
   Hypothesis P_id_inf_monotonic :
    forall x8 x7, (A0 <= x8)/\ (x8 <= x7) ->P_id_inf x8 <= P_id_inf x7.
   
   Hypothesis P_id_a__eq_bounded :
    forall x8 x7, (A0 <= x7) ->(A0 <= x8) ->A0 <= P_id_a__eq x8 x7.
   
   Hypothesis P_id_a__take_bounded :
    forall x8 x7, (A0 <= x7) ->(A0 <= x8) ->A0 <= P_id_a__take x8 x7.
   
   Hypothesis P_id_false_bounded : A0 <= P_id_false .
   
   Hypothesis P_id_length_bounded :
    forall x7, (A0 <= x7) ->A0 <= P_id_length x7.
   
   Hypothesis P_id_true_bounded : A0 <= P_id_true .
   
   Hypothesis P_id_take_bounded :
    forall x8 x7, (A0 <= x7) ->(A0 <= x8) ->A0 <= P_id_take x8 x7.
   
   Hypothesis P_id_cons_bounded :
    forall x8 x7, (A0 <= x7) ->(A0 <= x8) ->A0 <= P_id_cons x8 x7.
   
   Hypothesis P_id_eq_bounded :
    forall x8 x7, (A0 <= x7) ->(A0 <= x8) ->A0 <= P_id_eq x8 x7.
   
   Hypothesis P_id_0_bounded : A0 <= P_id_0 .
   
   Hypothesis P_id_nil_bounded : A0 <= P_id_nil .
   
   Hypothesis P_id_a__inf_bounded :
    forall x7, (A0 <= x7) ->A0 <= P_id_a__inf x7.
   
   Hypothesis P_id_mark_bounded : forall x7, (A0 <= x7) ->A0 <= P_id_mark x7.
   
   Hypothesis P_id_s_bounded : forall x7, (A0 <= x7) ->A0 <= P_id_s x7.
   
   Hypothesis P_id_a__length_bounded :
    forall x7, (A0 <= x7) ->A0 <= P_id_a__length x7.
   
   Hypothesis P_id_inf_bounded : forall x7, (A0 <= x7) ->A0 <= P_id_inf x7.
   
   Fixpoint measure t { struct t }  := 
     match t with
       | (algebra.Alg.Term algebra.F.id_a__eq (x8::x7::nil)) =>
        P_id_a__eq (measure x8) (measure x7)
       | (algebra.Alg.Term algebra.F.id_a__take (x8::x7::nil)) =>
        P_id_a__take (measure x8) (measure x7)
       | (algebra.Alg.Term algebra.F.id_false nil) => P_id_false 
       | (algebra.Alg.Term algebra.F.id_length (x7::nil)) =>
        P_id_length (measure x7)
       | (algebra.Alg.Term algebra.F.id_true nil) => P_id_true 
       | (algebra.Alg.Term algebra.F.id_take (x8::x7::nil)) =>
        P_id_take (measure x8) (measure x7)
       | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
        P_id_cons (measure x8) (measure x7)
       | (algebra.Alg.Term algebra.F.id_eq (x8::x7::nil)) =>
        P_id_eq (measure x8) (measure x7)
       | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
       | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
       | (algebra.Alg.Term algebra.F.id_a__inf (x7::nil)) =>
        P_id_a__inf (measure x7)
       | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
        P_id_mark (measure x7)
       | (algebra.Alg.Term algebra.F.id_s (x7::nil)) => P_id_s (measure x7)
       | (algebra.Alg.Term algebra.F.id_a__length (x7::nil)) =>
        P_id_a__length (measure x7)
       | (algebra.Alg.Term algebra.F.id_inf (x7::nil)) =>
        P_id_inf (measure x7)
       | _ => A0
       end.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_a__eq (x8::x7::nil)) =>
                    P_id_a__eq (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_a__take (x8::x7::nil)) =>
                    P_id_a__take (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_false nil) => P_id_false 
                   | (algebra.Alg.Term algebra.F.id_length (x7::nil)) =>
                    P_id_length (measure x7)
                   | (algebra.Alg.Term algebra.F.id_true nil) => P_id_true 
                   | (algebra.Alg.Term algebra.F.id_take (x8::x7::nil)) =>
                    P_id_take (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_eq (x8::x7::nil)) =>
                    P_id_eq (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                   | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                   | (algebra.Alg.Term algebra.F.id_a__inf (x7::nil)) =>
                    P_id_a__inf (measure x7)
                   | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                    P_id_mark (measure x7)
                   | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                    P_id_s (measure x7)
                   | (algebra.Alg.Term algebra.F.id_a__length (x7::nil)) =>
                    P_id_a__length (measure x7)
                   | (algebra.Alg.Term algebra.F.id_inf (x7::nil)) =>
                    P_id_inf (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_a__eq => P_id_a__eq
       | algebra.F.id_a__take => P_id_a__take
       | algebra.F.id_false => P_id_false
       | algebra.F.id_length => P_id_length
       | algebra.F.id_true => P_id_true
       | algebra.F.id_take => P_id_take
       | algebra.F.id_cons => P_id_cons
       | algebra.F.id_eq => P_id_eq
       | algebra.F.id_0 => P_id_0
       | algebra.F.id_nil => P_id_nil
       | algebra.F.id_a__inf => P_id_a__inf
       | algebra.F.id_mark => P_id_mark
       | algebra.F.id_s => P_id_s
       | algebra.F.id_a__length => P_id_a__length
       | algebra.F.id_inf => P_id_inf
       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_a__eq =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_a__take =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_false => match l with
                                        | nil => _
                                        | _::_ => _
                                        end
              | algebra.F.id_length =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_true => match l with
                                       | nil => _
                                       | _::_ => _
                                       end
              | algebra.F.id_take =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_cons =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_eq =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_0 => match l with
                                    | nil => _
                                    | _::_ => _
                                    end
              | algebra.F.id_nil => match l with
                                      | nil => _
                                      | _::_ => _
                                      end
              | algebra.F.id_a__inf =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_mark =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_s =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_a__length =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_inf =>
               match l with
                 | 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_a__eq_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_a__take_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_false_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_length_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_true_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_take_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_cons_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_eq_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_0_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_nil_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_a__inf_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_mark_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_s_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_a__length_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_inf_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_a__eq_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_a__take_monotonic;assumption.
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;intros ;apply P_id_length_monotonic;assumption.
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;intros ;apply P_id_take_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_cons_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_eq_monotonic;assumption.
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;intros ;apply P_id_a__inf_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_mark_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_s_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_a__length_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_inf_monotonic;assumption.
     intros f.
     case f.
     vm_compute in |-*;intros ;apply P_id_a__eq_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_a__take_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_false_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_length_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_true_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_take_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_cons_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_eq_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_0_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_nil_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_a__inf_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_mark_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_s_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_a__length_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_inf_bounded;assumption.
     intros .
     do 2 (rewrite  <- same_measure in |-*).
     apply rules_monotonic;assumption.
     assumption.
   Qed.
   
   Hypothesis P_id_MARK : A ->A.
   
   Hypothesis P_id_A__TAKE : A ->A ->A.
   
   Hypothesis P_id_A__INF : A ->A.
   
   Hypothesis P_id_A__LENGTH : A ->A.
   
   Hypothesis P_id_A__EQ : A ->A ->A.
   
   Hypothesis P_id_MARK_monotonic :
    forall x8 x7, (A0 <= x8)/\ (x8 <= x7) ->P_id_MARK x8 <= P_id_MARK x7.
   
   Hypothesis P_id_A__TAKE_monotonic :
    forall x8 x10 x9 x7, 
     (A0 <= x10)/\ (x10 <= x9) ->
      (A0 <= x8)/\ (x8 <= x7) ->P_id_A__TAKE x8 x10 <= P_id_A__TAKE x7 x9.
   
   Hypothesis P_id_A__INF_monotonic :
    forall x8 x7, (A0 <= x8)/\ (x8 <= x7) ->P_id_A__INF x8 <= P_id_A__INF x7.
   
   Hypothesis P_id_A__LENGTH_monotonic :
    forall x8 x7, 
     (A0 <= x8)/\ (x8 <= x7) ->P_id_A__LENGTH x8 <= P_id_A__LENGTH x7.
   
   Hypothesis P_id_A__EQ_monotonic :
    forall x8 x10 x9 x7, 
     (A0 <= x10)/\ (x10 <= x9) ->
      (A0 <= x8)/\ (x8 <= x7) ->P_id_A__EQ x8 x10 <= P_id_A__EQ x7 x9.
   
   Definition marked_measure t := 
     match t with
       | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
        P_id_MARK (measure x7)
       | (algebra.Alg.Term algebra.F.id_a__take (x8::x7::nil)) =>
        P_id_A__TAKE (measure x8) (measure x7)
       | (algebra.Alg.Term algebra.F.id_a__inf (x7::nil)) =>
        P_id_A__INF (measure x7)
       | (algebra.Alg.Term algebra.F.id_a__length (x7::nil)) =>
        P_id_A__LENGTH (measure x7)
       | (algebra.Alg.Term algebra.F.id_a__eq (x8::x7::nil)) =>
        P_id_A__EQ (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 x7;apply (P_id_A__LENGTH 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 x7;apply (P_id_MARK 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 x7;apply (P_id_A__INF 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_A__TAKE 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_A__EQ 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_a__eq =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_a__take =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_false => match l with
                                        | nil => _
                                        | _::_ => _
                                        end
              | algebra.F.id_length =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_true => match l with
                                       | nil => _
                                       | _::_ => _
                                       end
              | algebra.F.id_take =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_cons =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_eq =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_0 => match l with
                                    | nil => _
                                    | _::_ => _
                                    end
              | algebra.F.id_nil => match l with
                                      | nil => _
                                      | _::_ => _
                                      end
              | algebra.F.id_a__inf =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_mark =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_s =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_a__length =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_inf =>
               match l with
                 | 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 .
     
     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 .
     
     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 .
     
     lazy - [measure InterpGen.measure Pols] in |-* ;f_equal ;
      apply same_measure.
     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 .
     
     lazy - [measure InterpGen.measure Pols] in |-* ;f_equal ;
      apply same_measure.
     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 .
     
     lazy - [measure InterpGen.measure Pols] in |-* ;f_equal ;
      apply same_measure.
     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 .
     
     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_mark (x7::nil)) =>
                           P_id_MARK (measure x7)
                          | (algebra.Alg.Term algebra.F.id_a__take (x8::
                             x7::nil)) =>
                           P_id_A__TAKE (measure x8) (measure x7)
                          | (algebra.Alg.Term algebra.F.id_a__inf (x7::nil)) =>
                           P_id_A__INF (measure x7)
                          | (algebra.Alg.Term algebra.F.id_a__length 
                             (x7::nil)) =>
                           P_id_A__LENGTH (measure x7)
                          | (algebra.Alg.Term algebra.F.id_a__eq (x8::
                             x7::nil)) =>
                           P_id_A__EQ (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_a__eq_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_a__take_monotonic;assumption.
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;intros ;apply P_id_length_monotonic;assumption.
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;intros ;apply P_id_take_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_cons_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_eq_monotonic;assumption.
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;intros ;apply P_id_a__inf_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_mark_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_s_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_a__length_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_inf_monotonic;assumption.
     clear f.
     intros f.
     case f.
     vm_compute in |-*;intros ;apply P_id_a__eq_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_a__take_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_false_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_length_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_true_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_take_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_cons_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_eq_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_0_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_nil_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_a__inf_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_mark_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_s_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_a__length_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_inf_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_A__LENGTH_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_MARK_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_A__INF_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_A__TAKE_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_A__EQ_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_a__eq : Z ->Z ->Z.
   
   Hypothesis P_id_a__take : Z ->Z ->Z.
   
   Hypothesis P_id_false : Z.
   
   Hypothesis P_id_length : Z ->Z.
   
   Hypothesis P_id_true : Z.
   
   Hypothesis P_id_take : Z ->Z ->Z.
   
   Hypothesis P_id_cons : Z ->Z ->Z.
   
   Hypothesis P_id_eq : Z ->Z ->Z.
   
   Hypothesis P_id_0 : Z.
   
   Hypothesis P_id_nil : Z.
   
   Hypothesis P_id_a__inf : Z ->Z.
   
   Hypothesis P_id_mark : Z ->Z.
   
   Hypothesis P_id_s : Z ->Z.
   
   Hypothesis P_id_a__length : Z ->Z.
   
   Hypothesis P_id_inf : Z ->Z.
   
   Hypothesis P_id_a__eq_monotonic :
    forall x8 x10 x9 x7, 
     (min_value <= x10)/\ (x10 <= x9) ->
      (min_value <= x8)/\ (x8 <= x7) ->P_id_a__eq x8 x10 <= P_id_a__eq x7 x9.
   
   Hypothesis P_id_a__take_monotonic :
    forall x8 x10 x9 x7, 
     (min_value <= x10)/\ (x10 <= x9) ->
      (min_value <= x8)/\ (x8 <= x7) ->
       P_id_a__take x8 x10 <= P_id_a__take x7 x9.
   
   Hypothesis P_id_length_monotonic :
    forall x8 x7, 
     (min_value <= x8)/\ (x8 <= x7) ->P_id_length x8 <= P_id_length x7.
   
   Hypothesis P_id_take_monotonic :
    forall x8 x10 x9 x7, 
     (min_value <= x10)/\ (x10 <= x9) ->
      (min_value <= x8)/\ (x8 <= x7) ->P_id_take x8 x10 <= P_id_take 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_eq_monotonic :
    forall x8 x10 x9 x7, 
     (min_value <= x10)/\ (x10 <= x9) ->
      (min_value <= x8)/\ (x8 <= x7) ->P_id_eq x8 x10 <= P_id_eq x7 x9.
   
   Hypothesis P_id_a__inf_monotonic :
    forall x8 x7, 
     (min_value <= x8)/\ (x8 <= x7) ->P_id_a__inf x8 <= P_id_a__inf x7.
   
   Hypothesis P_id_mark_monotonic :
    forall x8 x7, 
     (min_value <= x8)/\ (x8 <= x7) ->P_id_mark x8 <= P_id_mark x7.
   
   Hypothesis P_id_s_monotonic :
    forall x8 x7, (min_value <= x8)/\ (x8 <= x7) ->P_id_s x8 <= P_id_s x7.
   
   Hypothesis P_id_a__length_monotonic :
    forall x8 x7, 
     (min_value <= x8)/\ (x8 <= x7) ->P_id_a__length x8 <= P_id_a__length x7.
   
   Hypothesis P_id_inf_monotonic :
    forall x8 x7, (min_value <= x8)/\ (x8 <= x7) ->P_id_inf x8 <= P_id_inf x7.
   
   Hypothesis P_id_a__eq_bounded :
    forall x8 x7, 
     (min_value <= x7) ->(min_value <= x8) ->min_value <= P_id_a__eq x8 x7.
   
   Hypothesis P_id_a__take_bounded :
    forall x8 x7, 
     (min_value <= x7) ->(min_value <= x8) ->min_value <= P_id_a__take x8 x7.
   
   Hypothesis P_id_false_bounded : min_value <= P_id_false .
   
   Hypothesis P_id_length_bounded :
    forall x7, (min_value <= x7) ->min_value <= P_id_length x7.
   
   Hypothesis P_id_true_bounded : min_value <= P_id_true .
   
   Hypothesis P_id_take_bounded :
    forall x8 x7, 
     (min_value <= x7) ->(min_value <= x8) ->min_value <= P_id_take x8 x7.
   
   Hypothesis P_id_cons_bounded :
    forall x8 x7, 
     (min_value <= x7) ->(min_value <= x8) ->min_value <= P_id_cons x8 x7.
   
   Hypothesis P_id_eq_bounded :
    forall x8 x7, 
     (min_value <= x7) ->(min_value <= x8) ->min_value <= P_id_eq x8 x7.
   
   Hypothesis P_id_0_bounded : min_value <= P_id_0 .
   
   Hypothesis P_id_nil_bounded : min_value <= P_id_nil .
   
   Hypothesis P_id_a__inf_bounded :
    forall x7, (min_value <= x7) ->min_value <= P_id_a__inf x7.
   
   Hypothesis P_id_mark_bounded :
    forall x7, (min_value <= x7) ->min_value <= P_id_mark x7.
   
   Hypothesis P_id_s_bounded :
    forall x7, (min_value <= x7) ->min_value <= P_id_s x7.
   
   Hypothesis P_id_a__length_bounded :
    forall x7, (min_value <= x7) ->min_value <= P_id_a__length x7.
   
   Hypothesis P_id_inf_bounded :
    forall x7, (min_value <= x7) ->min_value <= P_id_inf x7.
   
   Definition measure  := 
     Interp.measure min_value P_id_a__eq P_id_a__take P_id_false P_id_length 
      P_id_true P_id_take P_id_cons P_id_eq P_id_0 P_id_nil P_id_a__inf 
      P_id_mark P_id_s P_id_a__length P_id_inf.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_a__eq (x8::x7::nil)) =>
                    P_id_a__eq (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_a__take (x8::x7::nil)) =>
                    P_id_a__take (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_false nil) => P_id_false 
                   | (algebra.Alg.Term algebra.F.id_length (x7::nil)) =>
                    P_id_length (measure x7)
                   | (algebra.Alg.Term algebra.F.id_true nil) => P_id_true 
                   | (algebra.Alg.Term algebra.F.id_take (x8::x7::nil)) =>
                    P_id_take (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_eq (x8::x7::nil)) =>
                    P_id_eq (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                   | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                   | (algebra.Alg.Term algebra.F.id_a__inf (x7::nil)) =>
                    P_id_a__inf (measure x7)
                   | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                    P_id_mark (measure x7)
                   | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                    P_id_s (measure x7)
                   | (algebra.Alg.Term algebra.F.id_a__length (x7::nil)) =>
                    P_id_a__length (measure x7)
                   | (algebra.Alg.Term algebra.F.id_inf (x7::nil)) =>
                    P_id_inf (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_a__eq_monotonic;assumption.
     intros ;apply P_id_a__take_monotonic;assumption.
     intros ;apply P_id_length_monotonic;assumption.
     intros ;apply P_id_take_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_eq_monotonic;assumption.
     intros ;apply P_id_a__inf_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_a__length_monotonic;assumption.
     intros ;apply P_id_inf_monotonic;assumption.
     intros ;apply P_id_a__eq_bounded;assumption.
     intros ;apply P_id_a__take_bounded;assumption.
     intros ;apply P_id_false_bounded;assumption.
     intros ;apply P_id_length_bounded;assumption.
     intros ;apply P_id_true_bounded;assumption.
     intros ;apply P_id_take_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_eq_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_a__inf_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_a__length_bounded;assumption.
     intros ;apply P_id_inf_bounded;assumption.
     apply rules_monotonic.
   Qed.
   
   Hypothesis P_id_MARK : Z ->Z.
   
   Hypothesis P_id_A__TAKE : Z ->Z ->Z.
   
   Hypothesis P_id_A__INF : Z ->Z.
   
   Hypothesis P_id_A__LENGTH : Z ->Z.
   
   Hypothesis P_id_A__EQ : Z ->Z ->Z.
   
   Hypothesis P_id_MARK_monotonic :
    forall x8 x7, 
     (min_value <= x8)/\ (x8 <= x7) ->P_id_MARK x8 <= P_id_MARK x7.
   
   Hypothesis P_id_A__TAKE_monotonic :
    forall x8 x10 x9 x7, 
     (min_value <= x10)/\ (x10 <= x9) ->
      (min_value <= x8)/\ (x8 <= x7) ->
       P_id_A__TAKE x8 x10 <= P_id_A__TAKE x7 x9.
   
   Hypothesis P_id_A__INF_monotonic :
    forall x8 x7, 
     (min_value <= x8)/\ (x8 <= x7) ->P_id_A__INF x8 <= P_id_A__INF x7.
   
   Hypothesis P_id_A__LENGTH_monotonic :
    forall x8 x7, 
     (min_value <= x8)/\ (x8 <= x7) ->P_id_A__LENGTH x8 <= P_id_A__LENGTH x7.
   
   Hypothesis P_id_A__EQ_monotonic :
    forall x8 x10 x9 x7, 
     (min_value <= x10)/\ (x10 <= x9) ->
      (min_value <= x8)/\ (x8 <= x7) ->P_id_A__EQ x8 x10 <= P_id_A__EQ x7 x9.
   
   Definition marked_measure  := 
     Interp.marked_measure min_value P_id_a__eq P_id_a__take P_id_false 
      P_id_length P_id_true P_id_take P_id_cons P_id_eq P_id_0 P_id_nil 
      P_id_a__inf P_id_mark P_id_s P_id_a__length P_id_inf P_id_MARK 
      P_id_A__TAKE P_id_A__INF P_id_A__LENGTH P_id_A__EQ.
   
   Lemma marked_measure_equation :
    forall t, 
     marked_measure t = match t with
                          | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                           P_id_MARK (measure x7)
                          | (algebra.Alg.Term algebra.F.id_a__take (x8::
                             x7::nil)) =>
                           P_id_A__TAKE (measure x8) (measure x7)
                          | (algebra.Alg.Term algebra.F.id_a__inf (x7::nil)) =>
                           P_id_A__INF (measure x7)
                          | (algebra.Alg.Term algebra.F.id_a__length 
                             (x7::nil)) =>
                           P_id_A__LENGTH (measure x7)
                          | (algebra.Alg.Term algebra.F.id_a__eq (x8::
                             x7::nil)) =>
                           P_id_A__EQ (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_a__eq_monotonic;assumption.
     intros ;apply P_id_a__take_monotonic;assumption.
     intros ;apply P_id_length_monotonic;assumption.
     intros ;apply P_id_take_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_eq_monotonic;assumption.
     intros ;apply P_id_a__inf_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_a__length_monotonic;assumption.
     intros ;apply P_id_inf_monotonic;assumption.
     intros ;apply P_id_a__eq_bounded;assumption.
     intros ;apply P_id_a__take_bounded;assumption.
     intros ;apply P_id_false_bounded;assumption.
     intros ;apply P_id_length_bounded;assumption.
     intros ;apply P_id_true_bounded;assumption.
     intros ;apply P_id_take_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_eq_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_a__inf_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_a__length_bounded;assumption.
     intros ;apply P_id_inf_bounded;assumption.
     apply rules_monotonic.
     intros ;apply P_id_MARK_monotonic;assumption.
     intros ;apply P_id_A__TAKE_monotonic;assumption.
     intros ;apply P_id_A__INF_monotonic;assumption.
     intros ;apply P_id_A__LENGTH_monotonic;assumption.
     intros ;apply P_id_A__EQ_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 := 
    (* <a__eq(s(X_),s(Y_)),a__eq(X_,Y_)> *)
   | DP_R_xml_0_0 :
    forall x8 x2 x1 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                (algebra.Alg.Term algebra.F.id_s (x1::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_s (x2::nil)) 
        x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_a__eq (x1::x2::nil)) 
        (algebra.Alg.Term algebra.F.id_a__eq (x8::x7::nil))
    (* <mark(eq(X1_,X2_)),a__eq(X1_,X2_)> *)
   | DP_R_xml_0_1 :
    forall x4 x5 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_eq (x4::x5::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_a__eq (x4::x5::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(inf(X_)),a__inf(mark(X_))> *)
   | DP_R_xml_0_2 :
    forall x1 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_inf (x1::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_a__inf ((algebra.Alg.Term 
                  algebra.F.id_mark (x1::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(inf(X_)),mark(X_)> *)
   | DP_R_xml_0_3 :
    forall x1 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_inf (x1::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_mark (x1::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(take(X1_,X2_)),a__take(mark(X1_),mark(X2_))> *)
   | DP_R_xml_0_4 :
    forall x4 x5 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_take (x4::x5::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_a__take ((algebra.Alg.Term 
                  algebra.F.id_mark (x4::nil))::(algebra.Alg.Term 
                  algebra.F.id_mark (x5::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(take(X1_,X2_)),mark(X1_)> *)
   | DP_R_xml_0_5 :
    forall x4 x5 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_take (x4::x5::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_mark (x4::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(take(X1_,X2_)),mark(X2_)> *)
   | DP_R_xml_0_6 :
    forall x4 x5 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_take (x4::x5::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_mark (x5::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(length(X_)),a__length(mark(X_))> *)
   | DP_R_xml_0_7 :
    forall x1 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_length (x1::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_a__length ((algebra.Alg.Term 
                  algebra.F.id_mark (x1::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(length(X_)),mark(X_)> *)
   | DP_R_xml_0_8 :
    forall x1 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_length (x1::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_mark (x1::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (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_non_scc_1  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <mark(length(X_)),a__length(mark(X_))> *)
    | DP_R_xml_0_non_scc_1_0 :
     forall x1 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_length (x1::nil)) x7) ->
       DP_R_xml_0_non_scc_1 (algebra.Alg.Term algebra.F.id_a__length 
                             ((algebra.Alg.Term algebra.F.id_mark 
                             (x1::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_1 :
   forall x y, 
    (DP_R_xml_0_non_scc_1 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;
      (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_2  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <mark(take(X1_,X2_)),a__take(mark(X1_),mark(X2_))> *)
    | DP_R_xml_0_non_scc_2_0 :
     forall x4 x5 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_take (x4::x5::nil)) x7) ->
       DP_R_xml_0_non_scc_2 (algebra.Alg.Term algebra.F.id_a__take 
                             ((algebra.Alg.Term algebra.F.id_mark 
                             (x4::nil))::(algebra.Alg.Term algebra.F.id_mark 
                             (x5::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (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;
      (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 := 
     (* <mark(inf(X_)),a__inf(mark(X_))> *)
    | DP_R_xml_0_non_scc_3_0 :
     forall x1 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_inf (x1::nil)) x7) ->
       DP_R_xml_0_non_scc_3 (algebra.Alg.Term algebra.F.id_a__inf 
                             ((algebra.Alg.Term algebra.F.id_mark 
                             (x1::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (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;
      (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 := 
     (* <a__eq(s(X_),s(Y_)),a__eq(X_,Y_)> *)
    | DP_R_xml_0_scc_4_0 :
     forall x8 x2 x1 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 (algebra.Alg.Term algebra.F.id_s (x1::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_s (x2::nil)) x7) ->
        DP_R_xml_0_scc_4 (algebra.Alg.Term algebra.F.id_a__eq (x1::x2::nil)) 
         (algebra.Alg.Term algebra.F.id_a__eq (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_a__eq (x7:Z) (x8:Z) := 2 + 3* x7 + 3* x8.
   
   Definition P_id_a__take (x7:Z) (x8:Z) := 0.
   
   Definition P_id_false  := 0.
   
   Definition P_id_length (x7:Z) := 0.
   
   Definition P_id_true  := 2.
   
   Definition P_id_take (x7:Z) (x8:Z) := 0.
   
   Definition P_id_cons (x7:Z) (x8:Z) := 0.
   
   Definition P_id_eq (x7:Z) (x8:Z) := 2 + 2* x7 + 2* x8.
   
   Definition P_id_0  := 1.
   
   Definition P_id_nil  := 0.
   
   Definition P_id_a__inf (x7:Z) := 3.
   
   Definition P_id_mark (x7:Z) := 1 + 2* x7.
   
   Definition P_id_s (x7:Z) := 1 + 1* x7.
   
   Definition P_id_a__length (x7:Z) := 1.
   
   Definition P_id_inf (x7:Z) := 2.
   
   Lemma P_id_a__eq_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_a__eq x8 x10 <= P_id_a__eq 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_a__take_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_a__take x8 x10 <= P_id_a__take 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_length_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_length x8 <= P_id_length x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_take_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_take x8 x10 <= P_id_take 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_eq_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_eq x8 x10 <= P_id_eq 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_a__inf_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_a__inf x8 <= P_id_a__inf x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_mark_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_mark x8 <= P_id_mark x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_s_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_s x8 <= P_id_s x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_a__length_monotonic :
    forall x8 x7, 
     (0 <= x8)/\ (x8 <= x7) ->P_id_a__length x8 <= P_id_a__length x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_inf_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_inf x8 <= P_id_inf x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_a__eq_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_a__eq 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_a__take_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_a__take 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_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_length_bounded : forall x7, (0 <= x7) ->0 <= P_id_length 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_take_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_take 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_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_eq_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_eq 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_0_bounded : 0 <= P_id_0 .
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_nil_bounded : 0 <= P_id_nil .
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_a__inf_bounded : forall x7, (0 <= x7) ->0 <= P_id_a__inf 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_mark_bounded : forall x7, (0 <= x7) ->0 <= P_id_mark 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_s_bounded : forall x7, (0 <= x7) ->0 <= P_id_s 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_a__length_bounded :
    forall x7, (0 <= x7) ->0 <= P_id_a__length 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_inf_bounded : forall x7, (0 <= x7) ->0 <= P_id_inf 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_a__eq P_id_a__take P_id_false P_id_length 
      P_id_true P_id_take P_id_cons P_id_eq P_id_0 P_id_nil P_id_a__inf 
      P_id_mark P_id_s P_id_a__length P_id_inf.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_a__eq (x8::x7::nil)) =>
                    P_id_a__eq (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_a__take (x8::x7::nil)) =>
                    P_id_a__take (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_false nil) => P_id_false 
                   | (algebra.Alg.Term algebra.F.id_length (x7::nil)) =>
                    P_id_length (measure x7)
                   | (algebra.Alg.Term algebra.F.id_true nil) => P_id_true 
                   | (algebra.Alg.Term algebra.F.id_take (x8::x7::nil)) =>
                    P_id_take (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_eq (x8::x7::nil)) =>
                    P_id_eq (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                   | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                   | (algebra.Alg.Term algebra.F.id_a__inf (x7::nil)) =>
                    P_id_a__inf (measure x7)
                   | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                    P_id_mark (measure x7)
                   | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                    P_id_s (measure x7)
                   | (algebra.Alg.Term algebra.F.id_a__length (x7::nil)) =>
                    P_id_a__length (measure x7)
                   | (algebra.Alg.Term algebra.F.id_inf (x7::nil)) =>
                    P_id_inf (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_a__eq_monotonic;assumption.
     intros ;apply P_id_a__take_monotonic;assumption.
     intros ;apply P_id_length_monotonic;assumption.
     intros ;apply P_id_take_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_eq_monotonic;assumption.
     intros ;apply P_id_a__inf_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_a__length_monotonic;assumption.
     intros ;apply P_id_inf_monotonic;assumption.
     intros ;apply P_id_a__eq_bounded;assumption.
     intros ;apply P_id_a__take_bounded;assumption.
     intros ;apply P_id_false_bounded;assumption.
     intros ;apply P_id_length_bounded;assumption.
     intros ;apply P_id_true_bounded;assumption.
     intros ;apply P_id_take_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_eq_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_a__inf_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_a__length_bounded;assumption.
     intros ;apply P_id_inf_bounded;assumption.
     apply rules_monotonic.
   Qed.
   
   Definition P_id_MARK (x7:Z) := 0.
   
   Definition P_id_A__TAKE (x7:Z) (x8:Z) := 0.
   
   Definition P_id_A__INF (x7:Z) := 0.
   
   Definition P_id_A__LENGTH (x7:Z) := 0.
   
   Definition P_id_A__EQ (x7:Z) (x8:Z) := 1* x8.
   
   Lemma P_id_MARK_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_MARK x8 <= P_id_MARK x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_A__TAKE_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_A__TAKE x8 x10 <= P_id_A__TAKE 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_A__INF_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_A__INF x8 <= P_id_A__INF x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_A__LENGTH_monotonic :
    forall x8 x7, 
     (0 <= x8)/\ (x8 <= x7) ->P_id_A__LENGTH x8 <= P_id_A__LENGTH x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_A__EQ_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_A__EQ x8 x10 <= P_id_A__EQ 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_a__eq P_id_a__take P_id_false P_id_length 
      P_id_true P_id_take P_id_cons P_id_eq P_id_0 P_id_nil P_id_a__inf 
      P_id_mark P_id_s P_id_a__length P_id_inf P_id_MARK P_id_A__TAKE 
      P_id_A__INF P_id_A__LENGTH P_id_A__EQ.
   
   Lemma marked_measure_equation :
    forall t, 
     marked_measure t = match t with
                          | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                           P_id_MARK (measure x7)
                          | (algebra.Alg.Term algebra.F.id_a__take (x8::
                             x7::nil)) =>
                           P_id_A__TAKE (measure x8) (measure x7)
                          | (algebra.Alg.Term algebra.F.id_a__inf (x7::nil)) =>
                           P_id_A__INF (measure x7)
                          | (algebra.Alg.Term algebra.F.id_a__length 
                             (x7::nil)) =>
                           P_id_A__LENGTH (measure x7)
                          | (algebra.Alg.Term algebra.F.id_a__eq (x8::
                             x7::nil)) =>
                           P_id_A__EQ (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_a__eq_monotonic;assumption.
     intros ;apply P_id_a__take_monotonic;assumption.
     intros ;apply P_id_length_monotonic;assumption.
     intros ;apply P_id_take_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_eq_monotonic;assumption.
     intros ;apply P_id_a__inf_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_a__length_monotonic;assumption.
     intros ;apply P_id_inf_monotonic;assumption.
     intros ;apply P_id_a__eq_bounded;assumption.
     intros ;apply P_id_a__take_bounded;assumption.
     intros ;apply P_id_false_bounded;assumption.
     intros ;apply P_id_length_bounded;assumption.
     intros ;apply P_id_true_bounded;assumption.
     intros ;apply P_id_take_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_eq_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_a__inf_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_a__length_bounded;assumption.
     intros ;apply P_id_inf_bounded;assumption.
     apply rules_monotonic.
     intros ;apply P_id_MARK_monotonic;assumption.
     intros ;apply P_id_A__TAKE_monotonic;assumption.
     intros ;apply P_id_A__INF_monotonic;assumption.
     intros ;apply P_id_A__LENGTH_monotonic;assumption.
     intros ;apply P_id_A__EQ_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)||
      ((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.
  
  
  Inductive DP_R_xml_0_non_scc_5  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <mark(eq(X1_,X2_)),a__eq(X1_,X2_)> *)
    | DP_R_xml_0_non_scc_5_0 :
     forall x4 x5 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_eq (x4::x5::nil)) x7) ->
       DP_R_xml_0_non_scc_5 (algebra.Alg.Term algebra.F.id_a__eq (x4::
                             x5::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_5 :
   forall x y, 
    (DP_R_xml_0_non_scc_5 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_4;
        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_6  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <mark(take(X1_,X2_)),mark(X1_)> *)
    | DP_R_xml_0_scc_6_0 :
     forall x4 x5 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_take (x4::x5::nil)) x7) ->
       DP_R_xml_0_scc_6 (algebra.Alg.Term algebra.F.id_mark (x4::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
     (* <mark(inf(X_)),mark(X_)> *)
    | DP_R_xml_0_scc_6_1 :
     forall x1 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_inf (x1::nil)) x7) ->
       DP_R_xml_0_scc_6 (algebra.Alg.Term algebra.F.id_mark (x1::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
     (* <mark(take(X1_,X2_)),mark(X2_)> *)
    | DP_R_xml_0_scc_6_2 :
     forall x4 x5 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_take (x4::x5::nil)) x7) ->
       DP_R_xml_0_scc_6 (algebra.Alg.Term algebra.F.id_mark (x5::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
     (* <mark(length(X_)),mark(X_)> *)
    | DP_R_xml_0_scc_6_3 :
     forall x1 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_length (x1::nil)) x7) ->
       DP_R_xml_0_scc_6 (algebra.Alg.Term algebra.F.id_mark (x1::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
  .
  
  
  Module WF_DP_R_xml_0_scc_6.
   Inductive DP_R_xml_0_scc_6_large  :
    algebra.Alg.term ->algebra.Alg.term ->Prop := 
      (* <mark(inf(X_)),mark(X_)> *)
     | DP_R_xml_0_scc_6_large_0 :
      forall x1 x7, 
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_inf (x1::nil)) x7) ->
        DP_R_xml_0_scc_6_large (algebra.Alg.Term algebra.F.id_mark (x1::nil)) 
         (algebra.Alg.Term algebra.F.id_mark (x7::nil))
      (* <mark(length(X_)),mark(X_)> *)
     | DP_R_xml_0_scc_6_large_1 :
      forall x1 x7, 
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_length (x1::nil)) x7) ->
        DP_R_xml_0_scc_6_large (algebra.Alg.Term algebra.F.id_mark (x1::nil)) 
         (algebra.Alg.Term algebra.F.id_mark (x7::nil))
   .
   
   
   Inductive DP_R_xml_0_scc_6_strict  :
    algebra.Alg.term ->algebra.Alg.term ->Prop := 
      (* <mark(take(X1_,X2_)),mark(X1_)> *)
     | DP_R_xml_0_scc_6_strict_0 :
      forall x4 x5 x7, 
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_take (x4::x5::nil)) x7) ->
        DP_R_xml_0_scc_6_strict (algebra.Alg.Term algebra.F.id_mark 
                                 (x4::nil)) 
         (algebra.Alg.Term algebra.F.id_mark (x7::nil))
      (* <mark(take(X1_,X2_)),mark(X2_)> *)
     | DP_R_xml_0_scc_6_strict_1 :
      forall x4 x5 x7, 
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_take (x4::x5::nil)) x7) ->
        DP_R_xml_0_scc_6_strict (algebra.Alg.Term algebra.F.id_mark 
                                 (x5::nil)) 
         (algebra.Alg.Term algebra.F.id_mark (x7::nil))
   .
   
   
   Module WF_DP_R_xml_0_scc_6_large.
    Inductive DP_R_xml_0_scc_6_large_large  :
     algebra.Alg.term ->algebra.Alg.term ->Prop := 
       (* <mark(length(X_)),mark(X_)> *)
      | DP_R_xml_0_scc_6_large_large_0 :
       forall x1 x7, 
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                   
          (algebra.Alg.Term algebra.F.id_length (x1::nil)) x7) ->
         DP_R_xml_0_scc_6_large_large (algebra.Alg.Term algebra.F.id_mark 
                                       (x1::nil)) 
          (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    .
    
    
    Inductive DP_R_xml_0_scc_6_large_strict  :
     algebra.Alg.term ->algebra.Alg.term ->Prop := 
       (* <mark(inf(X_)),mark(X_)> *)
      | DP_R_xml_0_scc_6_large_strict_0 :
       forall x1 x7, 
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                   
          (algebra.Alg.Term algebra.F.id_inf (x1::nil)) x7) ->
         DP_R_xml_0_scc_6_large_strict (algebra.Alg.Term algebra.F.id_mark 
                                        (x1::nil)) 
          (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    .
    
    
    Module WF_DP_R_xml_0_scc_6_large_large.
     Open Scope Z_scope.
     
     Import ring_extention.
     
     Notation Local "a <= b" := (Zle a b).
     
     Notation Local "a < b" := (Zlt a b).
     
     Definition P_id_a__eq (x7:Z) (x8:Z) := 1.
     
     Definition P_id_a__take (x7:Z) (x8:Z) := 2.
     
     Definition P_id_false  := 0.
     
     Definition P_id_length (x7:Z) := 2 + 3* x7.
     
     Definition P_id_true  := 0.
     
     Definition P_id_take (x7:Z) (x8:Z) := 1.
     
     Definition P_id_cons (x7:Z) (x8:Z) := 1.
     
     Definition P_id_eq (x7:Z) (x8:Z) := 1.
     
     Definition P_id_0  := 0.
     
     Definition P_id_nil  := 2.
     
     Definition P_id_a__inf (x7:Z) := 2.
     
     Definition P_id_mark (x7:Z) := 2* x7.
     
     Definition P_id_s (x7:Z) := 2.
     
     Definition P_id_a__length (x7:Z) := 3 + 3* x7.
     
     Definition P_id_inf (x7:Z) := 2.
     
     Lemma P_id_a__eq_monotonic :
      forall x8 x10 x9 x7, 
       (0 <= x10)/\ (x10 <= x9) ->
        (0 <= x8)/\ (x8 <= x7) ->P_id_a__eq x8 x10 <= P_id_a__eq 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_a__take_monotonic :
      forall x8 x10 x9 x7, 
       (0 <= x10)/\ (x10 <= x9) ->
        (0 <= x8)/\ (x8 <= x7) ->P_id_a__take x8 x10 <= P_id_a__take 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_length_monotonic :
      forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_length x8 <= P_id_length x7.
     Proof.
       intros x8 x7.
       intros [H_1 H_0].
       
       cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
        (auto with zarith)||(repeat (translate_vars );prove_ineq ).
     Qed.
     
     Lemma P_id_take_monotonic :
      forall x8 x10 x9 x7, 
       (0 <= x10)/\ (x10 <= x9) ->
        (0 <= x8)/\ (x8 <= x7) ->P_id_take x8 x10 <= P_id_take 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_eq_monotonic :
      forall x8 x10 x9 x7, 
       (0 <= x10)/\ (x10 <= x9) ->
        (0 <= x8)/\ (x8 <= x7) ->P_id_eq x8 x10 <= P_id_eq 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_a__inf_monotonic :
      forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_a__inf x8 <= P_id_a__inf x7.
     Proof.
       intros x8 x7.
       intros [H_1 H_0].
       
       cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
        (auto with zarith)||(repeat (translate_vars );prove_ineq ).
     Qed.
     
     Lemma P_id_mark_monotonic :
      forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_mark x8 <= P_id_mark x7.
     Proof.
       intros x8 x7.
       intros [H_1 H_0].
       
       cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
        (auto with zarith)||(repeat (translate_vars );prove_ineq ).
     Qed.
     
     Lemma P_id_s_monotonic :
      forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_s x8 <= P_id_s x7.
     Proof.
       intros x8 x7.
       intros [H_1 H_0].
       
       cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
        (auto with zarith)||(repeat (translate_vars );prove_ineq ).
     Qed.
     
     Lemma P_id_a__length_monotonic :
      forall x8 x7, 
       (0 <= x8)/\ (x8 <= x7) ->P_id_a__length x8 <= P_id_a__length x7.
     Proof.
       intros x8 x7.
       intros [H_1 H_0].
       
       cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
        (auto with zarith)||(repeat (translate_vars );prove_ineq ).
     Qed.
     
     Lemma P_id_inf_monotonic :
      forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_inf x8 <= P_id_inf x7.
     Proof.
       intros x8 x7.
       intros [H_1 H_0].
       
       cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
        (auto with zarith)||(repeat (translate_vars );prove_ineq ).
     Qed.
     
     Lemma P_id_a__eq_bounded :
      forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_a__eq 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_a__take_bounded :
      forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_a__take 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_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_length_bounded : forall x7, (0 <= x7) ->0 <= P_id_length 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_take_bounded :
      forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_take 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_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_eq_bounded :
      forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_eq 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_0_bounded : 0 <= P_id_0 .
     Proof.
       intros .
       
       cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
        (auto with zarith)||(repeat (translate_vars );prove_ineq ).
     Qed.
     
     Lemma P_id_nil_bounded : 0 <= P_id_nil .
     Proof.
       intros .
       
       cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
        (auto with zarith)||(repeat (translate_vars );prove_ineq ).
     Qed.
     
     Lemma P_id_a__inf_bounded : forall x7, (0 <= x7) ->0 <= P_id_a__inf 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_mark_bounded : forall x7, (0 <= x7) ->0 <= P_id_mark 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_s_bounded : forall x7, (0 <= x7) ->0 <= P_id_s 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_a__length_bounded :
      forall x7, (0 <= x7) ->0 <= P_id_a__length 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_inf_bounded : forall x7, (0 <= x7) ->0 <= P_id_inf 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_a__eq P_id_a__take P_id_false P_id_length 
        P_id_true P_id_take P_id_cons P_id_eq P_id_0 P_id_nil P_id_a__inf 
        P_id_mark P_id_s P_id_a__length P_id_inf.
     
     Lemma measure_equation :
      forall t, 
       measure t = match t with
                     | (algebra.Alg.Term algebra.F.id_a__eq (x8::x7::nil)) =>
                      P_id_a__eq (measure x8) (measure x7)
                     | (algebra.Alg.Term algebra.F.id_a__take (x8::x7::nil)) =>
                      P_id_a__take (measure x8) (measure x7)
                     | (algebra.Alg.Term algebra.F.id_false nil) =>
                      P_id_false 
                     | (algebra.Alg.Term algebra.F.id_length (x7::nil)) =>
                      P_id_length (measure x7)
                     | (algebra.Alg.Term algebra.F.id_true nil) => P_id_true 
                     | (algebra.Alg.Term algebra.F.id_take (x8::x7::nil)) =>
                      P_id_take (measure x8) (measure x7)
                     | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                      P_id_cons (measure x8) (measure x7)
                     | (algebra.Alg.Term algebra.F.id_eq (x8::x7::nil)) =>
                      P_id_eq (measure x8) (measure x7)
                     | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                     | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                     | (algebra.Alg.Term algebra.F.id_a__inf (x7::nil)) =>
                      P_id_a__inf (measure x7)
                     | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                      P_id_mark (measure x7)
                     | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                      P_id_s (measure x7)
                     | (algebra.Alg.Term algebra.F.id_a__length (x7::nil)) =>
                      P_id_a__length (measure x7)
                     | (algebra.Alg.Term algebra.F.id_inf (x7::nil)) =>
                      P_id_inf (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_a__eq_monotonic;assumption.
       intros ;apply P_id_a__take_monotonic;assumption.
       intros ;apply P_id_length_monotonic;assumption.
       intros ;apply P_id_take_monotonic;assumption.
       intros ;apply P_id_cons_monotonic;assumption.
       intros ;apply P_id_eq_monotonic;assumption.
       intros ;apply P_id_a__inf_monotonic;assumption.
       intros ;apply P_id_mark_monotonic;assumption.
       intros ;apply P_id_s_monotonic;assumption.
       intros ;apply P_id_a__length_monotonic;assumption.
       intros ;apply P_id_inf_monotonic;assumption.
       intros ;apply P_id_a__eq_bounded;assumption.
       intros ;apply P_id_a__take_bounded;assumption.
       intros ;apply P_id_false_bounded;assumption.
       intros ;apply P_id_length_bounded;assumption.
       intros ;apply P_id_true_bounded;assumption.
       intros ;apply P_id_take_bounded;assumption.
       intros ;apply P_id_cons_bounded;assumption.
       intros ;apply P_id_eq_bounded;assumption.
       intros ;apply P_id_0_bounded;assumption.
       intros ;apply P_id_nil_bounded;assumption.
       intros ;apply P_id_a__inf_bounded;assumption.
       intros ;apply P_id_mark_bounded;assumption.
       intros ;apply P_id_s_bounded;assumption.
       intros ;apply P_id_a__length_bounded;assumption.
       intros ;apply P_id_inf_bounded;assumption.
       apply rules_monotonic.
     Qed.
     
     Definition P_id_MARK (x7:Z) := 3* x7.
     
     Definition P_id_A__TAKE (x7:Z) (x8:Z) := 0.
     
     Definition P_id_A__INF (x7:Z) := 0.
     
     Definition P_id_A__LENGTH (x7:Z) := 0.
     
     Definition P_id_A__EQ (x7:Z) (x8:Z) := 0.
     
     Lemma P_id_MARK_monotonic :
      forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_MARK x8 <= P_id_MARK x7.
     Proof.
       intros x8 x7.
       intros [H_1 H_0].
       
       cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
        (auto with zarith)||(repeat (translate_vars );prove_ineq ).
     Qed.
     
     Lemma P_id_A__TAKE_monotonic :
      forall x8 x10 x9 x7, 
       (0 <= x10)/\ (x10 <= x9) ->
        (0 <= x8)/\ (x8 <= x7) ->P_id_A__TAKE x8 x10 <= P_id_A__TAKE 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_A__INF_monotonic :
      forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_A__INF x8 <= P_id_A__INF x7.
     Proof.
       intros x8 x7.
       intros [H_1 H_0].
       
       cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
        (auto with zarith)||(repeat (translate_vars );prove_ineq ).
     Qed.
     
     Lemma P_id_A__LENGTH_monotonic :
      forall x8 x7, 
       (0 <= x8)/\ (x8 <= x7) ->P_id_A__LENGTH x8 <= P_id_A__LENGTH x7.
     Proof.
       intros x8 x7.
       intros [H_1 H_0].
       
       cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
        (auto with zarith)||(repeat (translate_vars );prove_ineq ).
     Qed.
     
     Lemma P_id_A__EQ_monotonic :
      forall x8 x10 x9 x7, 
       (0 <= x10)/\ (x10 <= x9) ->
        (0 <= x8)/\ (x8 <= x7) ->P_id_A__EQ x8 x10 <= P_id_A__EQ 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_a__eq P_id_a__take P_id_false 
        P_id_length P_id_true P_id_take P_id_cons P_id_eq P_id_0 P_id_nil 
        P_id_a__inf P_id_mark P_id_s P_id_a__length P_id_inf P_id_MARK 
        P_id_A__TAKE P_id_A__INF P_id_A__LENGTH P_id_A__EQ.
     
     Lemma marked_measure_equation :
      forall t, 
       marked_measure t = match t with
                            | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                             P_id_MARK (measure x7)
                            | (algebra.Alg.Term algebra.F.id_a__take (x8::
                               x7::nil)) =>
                             P_id_A__TAKE (measure x8) (measure x7)
                            | (algebra.Alg.Term algebra.F.id_a__inf 
                               (x7::nil)) =>
                             P_id_A__INF (measure x7)
                            | (algebra.Alg.Term algebra.F.id_a__length 
                               (x7::nil)) =>
                             P_id_A__LENGTH (measure x7)
                            | (algebra.Alg.Term algebra.F.id_a__eq (x8::
                               x7::nil)) =>
                             P_id_A__EQ (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_a__eq_monotonic;assumption.
       intros ;apply P_id_a__take_monotonic;assumption.
       intros ;apply P_id_length_monotonic;assumption.
       intros ;apply P_id_take_monotonic;assumption.
       intros ;apply P_id_cons_monotonic;assumption.
       intros ;apply P_id_eq_monotonic;assumption.
       intros ;apply P_id_a__inf_monotonic;assumption.
       intros ;apply P_id_mark_monotonic;assumption.
       intros ;apply P_id_s_monotonic;assumption.
       intros ;apply P_id_a__length_monotonic;assumption.
       intros ;apply P_id_inf_monotonic;assumption.
       intros ;apply P_id_a__eq_bounded;assumption.
       intros ;apply P_id_a__take_bounded;assumption.
       intros ;apply P_id_false_bounded;assumption.
       intros ;apply P_id_length_bounded;assumption.
       intros ;apply P_id_true_bounded;assumption.
       intros ;apply P_id_take_bounded;assumption.
       intros ;apply P_id_cons_bounded;assumption.
       intros ;apply P_id_eq_bounded;assumption.
       intros ;apply P_id_0_bounded;assumption.
       intros ;apply P_id_nil_bounded;assumption.
       intros ;apply P_id_a__inf_bounded;assumption.
       intros ;apply P_id_mark_bounded;assumption.
       intros ;apply P_id_s_bounded;assumption.
       intros ;apply P_id_a__length_bounded;assumption.
       intros ;apply P_id_inf_bounded;assumption.
       apply rules_monotonic.
       intros ;apply P_id_MARK_monotonic;assumption.
       intros ;apply P_id_A__TAKE_monotonic;assumption.
       intros ;apply P_id_A__INF_monotonic;assumption.
       intros ;apply P_id_A__LENGTH_monotonic;assumption.
       intros ;apply P_id_A__EQ_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_scc_6_large.DP_R_xml_0_scc_6_large_large.
     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_6_large_large.
    
    Open Scope Z_scope.
    
    Import ring_extention.
    
    Notation Local "a <= b" := (Zle a b).
    
    Notation Local "a < b" := (Zlt a b).
    
    Definition P_id_a__eq (x7:Z) (x8:Z) := 2.
    
    Definition P_id_a__take (x7:Z) (x8:Z) := 2.
    
    Definition P_id_false  := 0.
    
    Definition P_id_length (x7:Z) := 2* x7.
    
    Definition P_id_true  := 0.
    
    Definition P_id_take (x7:Z) (x8:Z) := 2.
    
    Definition P_id_cons (x7:Z) (x8:Z) := 0.
    
    Definition P_id_eq (x7:Z) (x8:Z) := 1.
    
    Definition P_id_0  := 0.
    
    Definition P_id_nil  := 0.
    
    Definition P_id_a__inf (x7:Z) := 1 + 1* x7.
    
    Definition P_id_mark (x7:Z) := 2* x7.
    
    Definition P_id_s (x7:Z) := 0.
    
    Definition P_id_a__length (x7:Z) := 2* x7.
    
    Definition P_id_inf (x7:Z) := 1 + 1* x7.
    
    Lemma P_id_a__eq_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_a__eq x8 x10 <= P_id_a__eq 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_a__take_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_a__take x8 x10 <= P_id_a__take 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_length_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_length x8 <= P_id_length x7.
    Proof.
      intros x8 x7.
      intros [H_1 H_0].
      
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
    Qed.
    
    Lemma P_id_take_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_take x8 x10 <= P_id_take 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_eq_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_eq x8 x10 <= P_id_eq 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_a__inf_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_a__inf x8 <= P_id_a__inf x7.
    Proof.
      intros x8 x7.
      intros [H_1 H_0].
      
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
    Qed.
    
    Lemma P_id_mark_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_mark x8 <= P_id_mark x7.
    Proof.
      intros x8 x7.
      intros [H_1 H_0].
      
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
    Qed.
    
    Lemma P_id_s_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_s x8 <= P_id_s x7.
    Proof.
      intros x8 x7.
      intros [H_1 H_0].
      
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
    Qed.
    
    Lemma P_id_a__length_monotonic :
     forall x8 x7, 
      (0 <= x8)/\ (x8 <= x7) ->P_id_a__length x8 <= P_id_a__length x7.
    Proof.
      intros x8 x7.
      intros [H_1 H_0].
      
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
    Qed.
    
    Lemma P_id_inf_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_inf x8 <= P_id_inf x7.
    Proof.
      intros x8 x7.
      intros [H_1 H_0].
      
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
    Qed.
    
    Lemma P_id_a__eq_bounded :
     forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_a__eq 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_a__take_bounded :
     forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_a__take 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_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_length_bounded : forall x7, (0 <= x7) ->0 <= P_id_length 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_take_bounded :
     forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_take 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_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_eq_bounded :
     forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_eq 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_0_bounded : 0 <= P_id_0 .
    Proof.
      intros .
      
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
    Qed.
    
    Lemma P_id_nil_bounded : 0 <= P_id_nil .
    Proof.
      intros .
      
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
    Qed.
    
    Lemma P_id_a__inf_bounded : forall x7, (0 <= x7) ->0 <= P_id_a__inf 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_mark_bounded : forall x7, (0 <= x7) ->0 <= P_id_mark 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_s_bounded : forall x7, (0 <= x7) ->0 <= P_id_s 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_a__length_bounded :
     forall x7, (0 <= x7) ->0 <= P_id_a__length 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_inf_bounded : forall x7, (0 <= x7) ->0 <= P_id_inf 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_a__eq P_id_a__take P_id_false P_id_length 
       P_id_true P_id_take P_id_cons P_id_eq P_id_0 P_id_nil P_id_a__inf 
       P_id_mark P_id_s P_id_a__length P_id_inf.
    
    Lemma measure_equation :
     forall t, 
      measure t = match t with
                    | (algebra.Alg.Term algebra.F.id_a__eq (x8::x7::nil)) =>
                     P_id_a__eq (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_a__take (x8::x7::nil)) =>
                     P_id_a__take (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_false nil) =>
                     P_id_false 
                    | (algebra.Alg.Term algebra.F.id_length (x7::nil)) =>
                     P_id_length (measure x7)
                    | (algebra.Alg.Term algebra.F.id_true nil) => P_id_true 
                    | (algebra.Alg.Term algebra.F.id_take (x8::x7::nil)) =>
                     P_id_take (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                     P_id_cons (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_eq (x8::x7::nil)) =>
                     P_id_eq (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                    | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                    | (algebra.Alg.Term algebra.F.id_a__inf (x7::nil)) =>
                     P_id_a__inf (measure x7)
                    | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                     P_id_mark (measure x7)
                    | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                     P_id_s (measure x7)
                    | (algebra.Alg.Term algebra.F.id_a__length (x7::nil)) =>
                     P_id_a__length (measure x7)
                    | (algebra.Alg.Term algebra.F.id_inf (x7::nil)) =>
                     P_id_inf (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_a__eq_monotonic;assumption.
      intros ;apply P_id_a__take_monotonic;assumption.
      intros ;apply P_id_length_monotonic;assumption.
      intros ;apply P_id_take_monotonic;assumption.
      intros ;apply P_id_cons_monotonic;assumption.
      intros ;apply P_id_eq_monotonic;assumption.
      intros ;apply P_id_a__inf_monotonic;assumption.
      intros ;apply P_id_mark_monotonic;assumption.
      intros ;apply P_id_s_monotonic;assumption.
      intros ;apply P_id_a__length_monotonic;assumption.
      intros ;apply P_id_inf_monotonic;assumption.
      intros ;apply P_id_a__eq_bounded;assumption.
      intros ;apply P_id_a__take_bounded;assumption.
      intros ;apply P_id_false_bounded;assumption.
      intros ;apply P_id_length_bounded;assumption.
      intros ;apply P_id_true_bounded;assumption.
      intros ;apply P_id_take_bounded;assumption.
      intros ;apply P_id_cons_bounded;assumption.
      intros ;apply P_id_eq_bounded;assumption.
      intros ;apply P_id_0_bounded;assumption.
      intros ;apply P_id_nil_bounded;assumption.
      intros ;apply P_id_a__inf_bounded;assumption.
      intros ;apply P_id_mark_bounded;assumption.
      intros ;apply P_id_s_bounded;assumption.
      intros ;apply P_id_a__length_bounded;assumption.
      intros ;apply P_id_inf_bounded;assumption.
      apply rules_monotonic.
    Qed.
    
    Definition P_id_MARK (x7:Z) := 1* x7.
    
    Definition P_id_A__TAKE (x7:Z) (x8:Z) := 0.
    
    Definition P_id_A__INF (x7:Z) := 0.
    
    Definition P_id_A__LENGTH (x7:Z) := 0.
    
    Definition P_id_A__EQ (x7:Z) (x8:Z) := 0.
    
    Lemma P_id_MARK_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_MARK x8 <= P_id_MARK x7.
    Proof.
      intros x8 x7.
      intros [H_1 H_0].
      
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
    Qed.
    
    Lemma P_id_A__TAKE_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_A__TAKE x8 x10 <= P_id_A__TAKE 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_A__INF_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_A__INF x8 <= P_id_A__INF x7.
    Proof.
      intros x8 x7.
      intros [H_1 H_0].
      
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
    Qed.
    
    Lemma P_id_A__LENGTH_monotonic :
     forall x8 x7, 
      (0 <= x8)/\ (x8 <= x7) ->P_id_A__LENGTH x8 <= P_id_A__LENGTH x7.
    Proof.
      intros x8 x7.
      intros [H_1 H_0].
      
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
    Qed.
    
    Lemma P_id_A__EQ_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_A__EQ x8 x10 <= P_id_A__EQ 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_a__eq P_id_a__take P_id_false 
       P_id_length P_id_true P_id_take P_id_cons P_id_eq P_id_0 P_id_nil 
       P_id_a__inf P_id_mark P_id_s P_id_a__length P_id_inf P_id_MARK 
       P_id_A__TAKE P_id_A__INF P_id_A__LENGTH P_id_A__EQ.
    
    Lemma marked_measure_equation :
     forall t, 
      marked_measure t = match t with
                           | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                            P_id_MARK (measure x7)
                           | (algebra.Alg.Term algebra.F.id_a__take (x8::
                              x7::nil)) =>
                            P_id_A__TAKE (measure x8) (measure x7)
                           | (algebra.Alg.Term algebra.F.id_a__inf (x7::nil)) =>
                            P_id_A__INF (measure x7)
                           | (algebra.Alg.Term algebra.F.id_a__length 
                              (x7::nil)) =>
                            P_id_A__LENGTH (measure x7)
                           | (algebra.Alg.Term algebra.F.id_a__eq (x8::
                              x7::nil)) =>
                            P_id_A__EQ (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_a__eq_monotonic;assumption.
      intros ;apply P_id_a__take_monotonic;assumption.
      intros ;apply P_id_length_monotonic;assumption.
      intros ;apply P_id_take_monotonic;assumption.
      intros ;apply P_id_cons_monotonic;assumption.
      intros ;apply P_id_eq_monotonic;assumption.
      intros ;apply P_id_a__inf_monotonic;assumption.
      intros ;apply P_id_mark_monotonic;assumption.
      intros ;apply P_id_s_monotonic;assumption.
      intros ;apply P_id_a__length_monotonic;assumption.
      intros ;apply P_id_inf_monotonic;assumption.
      intros ;apply P_id_a__eq_bounded;assumption.
      intros ;apply P_id_a__take_bounded;assumption.
      intros ;apply P_id_false_bounded;assumption.
      intros ;apply P_id_length_bounded;assumption.
      intros ;apply P_id_true_bounded;assumption.
      intros ;apply P_id_take_bounded;assumption.
      intros ;apply P_id_cons_bounded;assumption.
      intros ;apply P_id_eq_bounded;assumption.
      intros ;apply P_id_0_bounded;assumption.
      intros ;apply P_id_nil_bounded;assumption.
      intros ;apply P_id_a__inf_bounded;assumption.
      intros ;apply P_id_mark_bounded;assumption.
      intros ;apply P_id_s_bounded;assumption.
      intros ;apply P_id_a__length_bounded;assumption.
      intros ;apply P_id_inf_bounded;assumption.
      apply rules_monotonic.
      intros ;apply P_id_MARK_monotonic;assumption.
      intros ;apply P_id_A__TAKE_monotonic;assumption.
      intros ;apply P_id_A__INF_monotonic;assumption.
      intros ;apply P_id_A__LENGTH_monotonic;assumption.
      intros ;apply P_id_A__EQ_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
      ).
    
    Definition lt a b := (Zwf.Zwf 0) (marked_measure a) (marked_measure b).
    
    Definition le a b := marked_measure a <= marked_measure b.
    
    Lemma lt_le_compat : forall a b c, (lt a b) ->(le b c) ->lt a c.
    Proof.
      unfold lt, le in *.
      intros a b c.
      apply (interp.le_lt_compat_right (interp.o_Z 0)).
    Qed.
    
    Lemma wf_lt : well_founded lt.
    Proof.
      unfold lt in *.
      apply Inverse_Image.wf_inverse_image with  (B:=Z).
      apply Zwf.Zwf_well_founded.
    Qed.
    
    Lemma DP_R_xml_0_scc_6_large_strict_in_lt :
     Relation_Definitions.inclusion _ DP_R_xml_0_scc_6_large_strict lt.
    Proof.
      unfold Relation_Definitions.inclusion, lt in *.
      
      intros a b H;destruct H;
       match goal with
         |  |- (Zwf.Zwf 0) _ (marked_measure (algebra.Alg.Term ?f ?l)) =>
          let l'' := algebra.Alg_ext.find_replacement l  in 
           ((apply (interp.le_lt_compat_right (interp.o_Z 0)) with
              (marked_measure (algebra.Alg.Term f l''));[idtac|
             apply marked_measure_star_monotonic;
              repeat (apply algebra.EQT_ext.one_step_list_refl_trans_clos);
              (assumption)||(constructor 1)]))
         end
       ;clear ;rewrite_and_unfold ;repeat (generate_pos_hyp );
       cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
        (auto with zarith)||(repeat (translate_vars );prove_ineq ).
    Qed.
    
    Lemma DP_R_xml_0_scc_6_large_large_in_le :
     Relation_Definitions.inclusion _ DP_R_xml_0_scc_6_large_large le.
    Proof.
      unfold Relation_Definitions.inclusion, le, Zwf.Zwf in *.
      
      intros a b H;destruct H;
       match goal with
         |  |- _ <= marked_measure (algebra.Alg.Term ?f ?l) =>
          let l'' := algebra.Alg_ext.find_replacement l  in 
           ((apply (interp.le_trans (interp.o_Z 0)) with
              (marked_measure (algebra.Alg.Term f l''));[idtac|
             apply marked_measure_star_monotonic;
              repeat (apply algebra.EQT_ext.one_step_list_refl_trans_clos);
              (assumption)||(constructor 1)]))
         end
       ;clear ;rewrite_and_unfold ;repeat (generate_pos_hyp );
       cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
        (auto with zarith)||(repeat (translate_vars );prove_ineq ).
    Qed.
    
    Definition wf_DP_R_xml_0_scc_6_large_large  := 
      WF_DP_R_xml_0_scc_6_large_large.wf.
    
    
    Lemma wf : well_founded WF_DP_R_xml_0_scc_6.DP_R_xml_0_scc_6_large.
    Proof.
      intros x.
      apply (well_founded_ind wf_lt).
      clear x.
      intros x.
      pattern x.
      apply (@Acc_ind _ DP_R_xml_0_scc_6_large_large).
      clear x.
      intros x _ IHx IHx'.
      constructor.
      intros y H.
      
      destruct H;
       (apply IHx';apply DP_R_xml_0_scc_6_large_strict_in_lt;
         econstructor eassumption)||
       ((apply IHx;[econstructor eassumption|
         intros y' Hlt;apply IHx';apply lt_le_compat with (1:=Hlt) ;
          apply DP_R_xml_0_scc_6_large_large_in_le;econstructor eassumption])).
      apply wf_DP_R_xml_0_scc_6_large_large.
    Qed.
   End WF_DP_R_xml_0_scc_6_large.
   
   Open Scope Z_scope.
   
   Import ring_extention.
   
   Notation Local "a <= b" := (Zle a b).
   
   Notation Local "a < b" := (Zlt a b).
   
   Definition P_id_a__eq (x7:Z) (x8:Z) := 0.
   
   Definition P_id_a__take (x7:Z) (x8:Z) := 2 + 1* x7 + 2* x8.
   
   Definition P_id_false  := 0.
   
   Definition P_id_length (x7:Z) := 1* x7.
   
   Definition P_id_true  := 0.
   
   Definition P_id_take (x7:Z) (x8:Z) := 2 + 1* x7 + 2* x8.
   
   Definition P_id_cons (x7:Z) (x8:Z) := 1* x7.
   
   Definition P_id_eq (x7:Z) (x8:Z) := 0.
   
   Definition P_id_0  := 0.
   
   Definition P_id_nil  := 1.
   
   Definition P_id_a__inf (x7:Z) := 2* x7.
   
   Definition P_id_mark (x7:Z) := 1* x7.
   
   Definition P_id_s (x7:Z) := 0.
   
   Definition P_id_a__length (x7:Z) := 1* x7.
   
   Definition P_id_inf (x7:Z) := 2* x7.
   
   Lemma P_id_a__eq_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_a__eq x8 x10 <= P_id_a__eq 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_a__take_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_a__take x8 x10 <= P_id_a__take 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_length_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_length x8 <= P_id_length x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_take_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_take x8 x10 <= P_id_take 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_eq_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_eq x8 x10 <= P_id_eq 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_a__inf_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_a__inf x8 <= P_id_a__inf x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_mark_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_mark x8 <= P_id_mark x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_s_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_s x8 <= P_id_s x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_a__length_monotonic :
    forall x8 x7, 
     (0 <= x8)/\ (x8 <= x7) ->P_id_a__length x8 <= P_id_a__length x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_inf_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_inf x8 <= P_id_inf x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_a__eq_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_a__eq 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_a__take_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_a__take 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_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_length_bounded : forall x7, (0 <= x7) ->0 <= P_id_length 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_take_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_take 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_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_eq_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_eq 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_0_bounded : 0 <= P_id_0 .
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_nil_bounded : 0 <= P_id_nil .
   Proof.
     intros .
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_a__inf_bounded : forall x7, (0 <= x7) ->0 <= P_id_a__inf 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_mark_bounded : forall x7, (0 <= x7) ->0 <= P_id_mark 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_s_bounded : forall x7, (0 <= x7) ->0 <= P_id_s 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_a__length_bounded :
    forall x7, (0 <= x7) ->0 <= P_id_a__length 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_inf_bounded : forall x7, (0 <= x7) ->0 <= P_id_inf 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_a__eq P_id_a__take P_id_false P_id_length 
      P_id_true P_id_take P_id_cons P_id_eq P_id_0 P_id_nil P_id_a__inf 
      P_id_mark P_id_s P_id_a__length P_id_inf.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_a__eq (x8::x7::nil)) =>
                    P_id_a__eq (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_a__take (x8::x7::nil)) =>
                    P_id_a__take (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_false nil) => P_id_false 
                   | (algebra.Alg.Term algebra.F.id_length (x7::nil)) =>
                    P_id_length (measure x7)
                   | (algebra.Alg.Term algebra.F.id_true nil) => P_id_true 
                   | (algebra.Alg.Term algebra.F.id_take (x8::x7::nil)) =>
                    P_id_take (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_eq (x8::x7::nil)) =>
                    P_id_eq (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                   | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                   | (algebra.Alg.Term algebra.F.id_a__inf (x7::nil)) =>
                    P_id_a__inf (measure x7)
                   | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                    P_id_mark (measure x7)
                   | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                    P_id_s (measure x7)
                   | (algebra.Alg.Term algebra.F.id_a__length (x7::nil)) =>
                    P_id_a__length (measure x7)
                   | (algebra.Alg.Term algebra.F.id_inf (x7::nil)) =>
                    P_id_inf (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_a__eq_monotonic;assumption.
     intros ;apply P_id_a__take_monotonic;assumption.
     intros ;apply P_id_length_monotonic;assumption.
     intros ;apply P_id_take_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_eq_monotonic;assumption.
     intros ;apply P_id_a__inf_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_a__length_monotonic;assumption.
     intros ;apply P_id_inf_monotonic;assumption.
     intros ;apply P_id_a__eq_bounded;assumption.
     intros ;apply P_id_a__take_bounded;assumption.
     intros ;apply P_id_false_bounded;assumption.
     intros ;apply P_id_length_bounded;assumption.
     intros ;apply P_id_true_bounded;assumption.
     intros ;apply P_id_take_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_eq_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_a__inf_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_a__length_bounded;assumption.
     intros ;apply P_id_inf_bounded;assumption.
     apply rules_monotonic.
   Qed.
   
   Definition P_id_MARK (x7:Z) := 2* x7.
   
   Definition P_id_A__TAKE (x7:Z) (x8:Z) := 0.
   
   Definition P_id_A__INF (x7:Z) := 0.
   
   Definition P_id_A__LENGTH (x7:Z) := 0.
   
   Definition P_id_A__EQ (x7:Z) (x8:Z) := 0.
   
   Lemma P_id_MARK_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_MARK x8 <= P_id_MARK x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_A__TAKE_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_A__TAKE x8 x10 <= P_id_A__TAKE 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_A__INF_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_A__INF x8 <= P_id_A__INF x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_A__LENGTH_monotonic :
    forall x8 x7, 
     (0 <= x8)/\ (x8 <= x7) ->P_id_A__LENGTH x8 <= P_id_A__LENGTH x7.
   Proof.
     intros x8 x7.
     intros [H_1 H_0].
     
     cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
      (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma P_id_A__EQ_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_A__EQ x8 x10 <= P_id_A__EQ 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_a__eq P_id_a__take P_id_false P_id_length 
      P_id_true P_id_take P_id_cons P_id_eq P_id_0 P_id_nil P_id_a__inf 
      P_id_mark P_id_s P_id_a__length P_id_inf P_id_MARK P_id_A__TAKE 
      P_id_A__INF P_id_A__LENGTH P_id_A__EQ.
   
   Lemma marked_measure_equation :
    forall t, 
     marked_measure t = match t with
                          | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                           P_id_MARK (measure x7)
                          | (algebra.Alg.Term algebra.F.id_a__take (x8::
                             x7::nil)) =>
                           P_id_A__TAKE (measure x8) (measure x7)
                          | (algebra.Alg.Term algebra.F.id_a__inf (x7::nil)) =>
                           P_id_A__INF (measure x7)
                          | (algebra.Alg.Term algebra.F.id_a__length 
                             (x7::nil)) =>
                           P_id_A__LENGTH (measure x7)
                          | (algebra.Alg.Term algebra.F.id_a__eq (x8::
                             x7::nil)) =>
                           P_id_A__EQ (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_a__eq_monotonic;assumption.
     intros ;apply P_id_a__take_monotonic;assumption.
     intros ;apply P_id_length_monotonic;assumption.
     intros ;apply P_id_take_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_eq_monotonic;assumption.
     intros ;apply P_id_a__inf_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_a__length_monotonic;assumption.
     intros ;apply P_id_inf_monotonic;assumption.
     intros ;apply P_id_a__eq_bounded;assumption.
     intros ;apply P_id_a__take_bounded;assumption.
     intros ;apply P_id_false_bounded;assumption.
     intros ;apply P_id_length_bounded;assumption.
     intros ;apply P_id_true_bounded;assumption.
     intros ;apply P_id_take_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_eq_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_a__inf_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_a__length_bounded;assumption.
     intros ;apply P_id_inf_bounded;assumption.
     apply rules_monotonic.
     intros ;apply P_id_MARK_monotonic;assumption.
     intros ;apply P_id_A__TAKE_monotonic;assumption.
     intros ;apply P_id_A__INF_monotonic;assumption.
     intros ;apply P_id_A__LENGTH_monotonic;assumption.
     intros ;apply P_id_A__EQ_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
     ).
   
   Definition lt a b := (Zwf.Zwf 0) (marked_measure a) (marked_measure b).
   
   Definition le a b := marked_measure a <= marked_measure b.
   
   Lemma lt_le_compat : forall a b c, (lt a b) ->(le b c) ->lt a c.
   Proof.
     unfold lt, le in *.
     intros a b c.
     apply (interp.le_lt_compat_right (interp.o_Z 0)).
   Qed.
   
   Lemma wf_lt : well_founded lt.
   Proof.
     unfold lt in *.
     apply Inverse_Image.wf_inverse_image with  (B:=Z).
     apply Zwf.Zwf_well_founded.
   Qed.
   
   Lemma DP_R_xml_0_scc_6_strict_in_lt :
    Relation_Definitions.inclusion _ DP_R_xml_0_scc_6_strict lt.
   Proof.
     unfold Relation_Definitions.inclusion, lt in *.
     
     intros a b H;destruct H;
      match goal with
        |  |- (Zwf.Zwf 0) _ (marked_measure (algebra.Alg.Term ?f ?l)) =>
         let l'' := algebra.Alg_ext.find_replacement l  in 
          ((apply (interp.le_lt_compat_right (interp.o_Z 0)) with
             (marked_measure (algebra.Alg.Term f l''));[idtac|
            apply marked_measure_star_monotonic;
             repeat (apply algebra.EQT_ext.one_step_list_refl_trans_clos);
             (assumption)||(constructor 1)]))
        end
      ;clear ;rewrite_and_unfold ;repeat (generate_pos_hyp );
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Lemma DP_R_xml_0_scc_6_large_in_le :
    Relation_Definitions.inclusion _ DP_R_xml_0_scc_6_large le.
   Proof.
     unfold Relation_Definitions.inclusion, le, Zwf.Zwf in *.
     
     intros a b H;destruct H;
      match goal with
        |  |- _ <= marked_measure (algebra.Alg.Term ?f ?l) =>
         let l'' := algebra.Alg_ext.find_replacement l  in 
          ((apply (interp.le_trans (interp.o_Z 0)) with
             (marked_measure (algebra.Alg.Term f l''));[idtac|
            apply marked_measure_star_monotonic;
             repeat (apply algebra.EQT_ext.one_step_list_refl_trans_clos);
             (assumption)||(constructor 1)]))
        end
      ;clear ;rewrite_and_unfold ;repeat (generate_pos_hyp );
      cbv beta iota zeta delta - [Zle Zlt Zplus Zmult] ;intuition;
       (auto with zarith)||(repeat (translate_vars );prove_ineq ).
   Qed.
   
   Definition wf_DP_R_xml_0_scc_6_large  := WF_DP_R_xml_0_scc_6_large.wf.
   
   
   Lemma wf : well_founded WF_DP_R_xml_0.DP_R_xml_0_scc_6.
   Proof.
     intros x.
     apply (well_founded_ind wf_lt).
     clear x.
     intros x.
     pattern x.
     apply (@Acc_ind _ DP_R_xml_0_scc_6_large).
     clear x.
     intros x _ IHx IHx'.
     constructor.
     intros y H.
     
     destruct H;
      (apply IHx';apply DP_R_xml_0_scc_6_strict_in_lt;
        econstructor eassumption)||
      ((apply IHx;[econstructor eassumption|
        intros y' Hlt;apply IHx';apply lt_le_compat with (1:=Hlt) ;
         apply DP_R_xml_0_scc_6_large_in_le;econstructor eassumption])).
     apply wf_DP_R_xml_0_scc_6_large.
   Qed.
  End WF_DP_R_xml_0_scc_6.
  
  Definition wf_DP_R_xml_0_scc_6  := WF_DP_R_xml_0_scc_6.wf.
  
  
  Lemma acc_DP_R_xml_0_scc_6 :
   forall x y, (DP_R_xml_0_scc_6 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_6).
    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_5;
         econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
       ((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' ))||
          ((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_6.
  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_5;
       econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
     ((eapply acc_DP_R_xml_0_non_scc_4;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((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_6;
             econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
           ((eapply acc_DP_R_xml_0_scc_5;
              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___TRCSR___Ex1_GL02a_GM.trs/a3pat.v" ***
*** End: ***
 *)