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_active *)
    | id_active : symb
     (* id_add *)
    | id_add : symb
     (* id_nil *)
    | id_nil : symb
     (* id_0 *)
    | id_0 : symb
     (* id_cons *)
    | id_cons : symb
     (* id_fst *)
    | id_fst : symb
     (* id_len *)
    | id_len : symb
     (* id_s *)
    | id_s : symb
     (* id_mark *)
    | id_mark : symb
     (* id_from *)
    | id_from : symb
  .
  
  
  Definition symb_eq_bool (f1 f2:symb) : bool := 
    match f1,f2 with
      | id_active,id_active => true
      | id_add,id_add => true
      | id_nil,id_nil => true
      | id_0,id_0 => true
      | id_cons,id_cons => true
      | id_fst,id_fst => true
      | id_len,id_len => true
      | id_s,id_s => true
      | id_mark,id_mark => true
      | id_from,id_from => 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_active,id_active => refl_equal _
             | id_add,id_add => refl_equal _
             | id_nil,id_nil => refl_equal _
             | id_0,id_0 => refl_equal _
             | id_cons,id_cons => refl_equal _
             | id_fst,id_fst => refl_equal _
             | id_len,id_len => refl_equal _
             | id_s,id_s => refl_equal _
             | id_mark,id_mark => refl_equal _
             | id_from,id_from => refl_equal _
             | _,_ => _
             end;intros abs;discriminate.
  Defined.
  
  
  Definition arity (f:symb) := 
    match f with
      | id_active => term.Free 1
      | id_add => term.Free 2
      | id_nil => term.Free 0
      | id_0 => term.Free 0
      | id_cons => term.Free 2
      | id_fst => term.Free 2
      | id_len => term.Free 1
      | id_s => term.Free 1
      | id_mark => term.Free 1
      | id_from => term.Free 1
      end.
  
  
  Definition symb_order (f1 f2:symb) : bool := 
    match f1,f2 with
      | id_active,id_active => true
      | id_active,id_add => false
      | id_active,id_nil => false
      | id_active,id_0 => false
      | id_active,id_cons => false
      | id_active,id_fst => false
      | id_active,id_len => false
      | id_active,id_s => false
      | id_active,id_mark => false
      | id_active,id_from => false
      | id_add,id_active => true
      | id_add,id_add => true
      | id_add,id_nil => false
      | id_add,id_0 => false
      | id_add,id_cons => false
      | id_add,id_fst => false
      | id_add,id_len => false
      | id_add,id_s => false
      | id_add,id_mark => false
      | id_add,id_from => false
      | id_nil,id_active => true
      | id_nil,id_add => true
      | id_nil,id_nil => true
      | id_nil,id_0 => false
      | id_nil,id_cons => false
      | id_nil,id_fst => false
      | id_nil,id_len => false
      | id_nil,id_s => false
      | id_nil,id_mark => false
      | id_nil,id_from => false
      | id_0,id_active => true
      | id_0,id_add => true
      | id_0,id_nil => true
      | id_0,id_0 => true
      | id_0,id_cons => false
      | id_0,id_fst => false
      | id_0,id_len => false
      | id_0,id_s => false
      | id_0,id_mark => false
      | id_0,id_from => false
      | id_cons,id_active => true
      | id_cons,id_add => true
      | id_cons,id_nil => true
      | id_cons,id_0 => true
      | id_cons,id_cons => true
      | id_cons,id_fst => false
      | id_cons,id_len => false
      | id_cons,id_s => false
      | id_cons,id_mark => false
      | id_cons,id_from => false
      | id_fst,id_active => true
      | id_fst,id_add => true
      | id_fst,id_nil => true
      | id_fst,id_0 => true
      | id_fst,id_cons => true
      | id_fst,id_fst => true
      | id_fst,id_len => false
      | id_fst,id_s => false
      | id_fst,id_mark => false
      | id_fst,id_from => false
      | id_len,id_active => true
      | id_len,id_add => true
      | id_len,id_nil => true
      | id_len,id_0 => true
      | id_len,id_cons => true
      | id_len,id_fst => true
      | id_len,id_len => true
      | id_len,id_s => false
      | id_len,id_mark => false
      | id_len,id_from => false
      | id_s,id_active => true
      | id_s,id_add => true
      | id_s,id_nil => true
      | id_s,id_0 => true
      | id_s,id_cons => true
      | id_s,id_fst => true
      | id_s,id_len => true
      | id_s,id_s => true
      | id_s,id_mark => false
      | id_s,id_from => false
      | id_mark,id_active => true
      | id_mark,id_add => true
      | id_mark,id_nil => true
      | id_mark,id_0 => true
      | id_mark,id_cons => true
      | id_mark,id_fst => true
      | id_mark,id_len => true
      | id_mark,id_s => true
      | id_mark,id_mark => true
      | id_mark,id_from => false
      | id_from,id_active => true
      | id_from,id_add => true
      | id_from,id_nil => true
      | id_from,id_0 => true
      | id_from,id_cons => true
      | id_from,id_fst => true
      | id_from,id_len => true
      | id_from,id_s => true
      | id_from,id_mark => true
      | id_from,id_from => 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 := 
    (* active(fst(0,Z_)) -> mark(nil) *)
   | R_xml_0_rule_0 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
                   algebra.F.id_nil nil)::nil)) 
     (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
      algebra.F.id_fst ((algebra.Alg.Term algebra.F.id_0 nil)::
      (algebra.Alg.Var 1)::nil))::nil))
   
    (* active(fst(s(X_),cons(Y_,Z_))) -> mark(cons(Y_,fst(X_,Z_))) *)
   | R_xml_0_rule_1 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
                   algebra.F.id_cons ((algebra.Alg.Var 3)::(algebra.Alg.Term 
                   algebra.F.id_fst ((algebra.Alg.Var 2)::
                   (algebra.Alg.Var 1)::nil))::nil))::nil)) 
     (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
      algebra.F.id_fst ((algebra.Alg.Term algebra.F.id_s 
      ((algebra.Alg.Var 2)::nil))::(algebra.Alg.Term algebra.F.id_cons 
      ((algebra.Alg.Var 3)::(algebra.Alg.Var 1)::nil))::nil))::nil))
    (* active(from(X_)) -> mark(cons(X_,from(s(X_)))) *)
   | R_xml_0_rule_2 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
                   algebra.F.id_cons ((algebra.Alg.Var 2)::(algebra.Alg.Term 
                   algebra.F.id_from ((algebra.Alg.Term algebra.F.id_s 
                   ((algebra.Alg.Var 2)::nil))::nil))::nil))::nil)) 
     (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
      algebra.F.id_from ((algebra.Alg.Var 2)::nil))::nil))
    (* active(add(0,X_)) -> mark(X_) *)
   | R_xml_0_rule_3 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_mark 
                   ((algebra.Alg.Var 2)::nil)) 
     (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
      algebra.F.id_add ((algebra.Alg.Term algebra.F.id_0 nil)::
      (algebra.Alg.Var 2)::nil))::nil))
    (* active(add(s(X_),Y_)) -> mark(s(add(X_,Y_))) *)
   | R_xml_0_rule_4 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
                   algebra.F.id_s ((algebra.Alg.Term algebra.F.id_add 
                   ((algebra.Alg.Var 2)::
                   (algebra.Alg.Var 3)::nil))::nil))::nil)) 
     (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
      algebra.F.id_add ((algebra.Alg.Term algebra.F.id_s 
      ((algebra.Alg.Var 2)::nil))::(algebra.Alg.Var 3)::nil))::nil))
    (* active(len(nil)) -> mark(0) *)
   | R_xml_0_rule_5 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
                   algebra.F.id_0 nil)::nil)) 
     (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
      algebra.F.id_len ((algebra.Alg.Term algebra.F.id_nil nil)::nil))::nil))
    (* active(len(cons(X_,Z_))) -> mark(s(len(Z_))) *)
   | R_xml_0_rule_6 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
                   algebra.F.id_s ((algebra.Alg.Term algebra.F.id_len 
                   ((algebra.Alg.Var 1)::nil))::nil))::nil)) 
     (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
      algebra.F.id_len ((algebra.Alg.Term algebra.F.id_cons 
      ((algebra.Alg.Var 2)::(algebra.Alg.Var 1)::nil))::nil))::nil))
   
    (* mark(fst(X1_,X2_)) -> active(fst(mark(X1_),mark(X2_))) *)
   | R_xml_0_rule_7 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
                   algebra.F.id_fst ((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))::nil)) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_fst 
      ((algebra.Alg.Var 4)::(algebra.Alg.Var 5)::nil))::nil))
    (* mark(0) -> active(0) *)
   | R_xml_0_rule_8 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
                   algebra.F.id_0 nil)::nil)) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_0 
      nil)::nil))
    (* mark(nil) -> active(nil) *)
   | R_xml_0_rule_9 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
                   algebra.F.id_nil nil)::nil)) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_nil 
      nil)::nil))
    (* mark(s(X_)) -> active(s(X_)) *)
   | R_xml_0_rule_10 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
                   algebra.F.id_s ((algebra.Alg.Var 2)::nil))::nil)) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_s 
      ((algebra.Alg.Var 2)::nil))::nil))
   
    (* mark(cons(X1_,X2_)) -> active(cons(mark(X1_),X2_)) *)
   | R_xml_0_rule_11 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
                   algebra.F.id_cons ((algebra.Alg.Term algebra.F.id_mark 
                   ((algebra.Alg.Var 4)::nil))::
                   (algebra.Alg.Var 5)::nil))::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(from(X_)) -> active(from(mark(X_))) *)
   | R_xml_0_rule_12 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
                   algebra.F.id_from ((algebra.Alg.Term algebra.F.id_mark 
                   ((algebra.Alg.Var 2)::nil))::nil))::nil)) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
      algebra.F.id_from ((algebra.Alg.Var 2)::nil))::nil))
   
    (* mark(add(X1_,X2_)) -> active(add(mark(X1_),mark(X2_))) *)
   | R_xml_0_rule_13 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
                   algebra.F.id_add ((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))::nil)) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_add 
      ((algebra.Alg.Var 4)::(algebra.Alg.Var 5)::nil))::nil))
    (* mark(len(X_)) -> active(len(mark(X_))) *)
   | R_xml_0_rule_14 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
                   algebra.F.id_len ((algebra.Alg.Term algebra.F.id_mark 
                   ((algebra.Alg.Var 2)::nil))::nil))::nil)) 
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_len 
      ((algebra.Alg.Var 2)::nil))::nil))
    (* fst(mark(X1_),X2_) -> fst(X1_,X2_) *)
   | R_xml_0_rule_15 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Var 4)::
                   (algebra.Alg.Var 5)::nil)) 
     (algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Term algebra.F.id_mark 
      ((algebra.Alg.Var 4)::nil))::(algebra.Alg.Var 5)::nil))
    (* fst(X1_,mark(X2_)) -> fst(X1_,X2_) *)
   | R_xml_0_rule_16 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Var 4)::
                   (algebra.Alg.Var 5)::nil)) 
     (algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Var 4)::
      (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Var 5)::nil))::nil))
    (* fst(active(X1_),X2_) -> fst(X1_,X2_) *)
   | R_xml_0_rule_17 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Var 4)::
                   (algebra.Alg.Var 5)::nil)) 
     (algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Term 
      algebra.F.id_active ((algebra.Alg.Var 4)::nil))::
      (algebra.Alg.Var 5)::nil))
    (* fst(X1_,active(X2_)) -> fst(X1_,X2_) *)
   | R_xml_0_rule_18 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Var 4)::
                   (algebra.Alg.Var 5)::nil)) 
     (algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Var 4)::
      (algebra.Alg.Term algebra.F.id_active 
      ((algebra.Alg.Var 5)::nil))::nil))
    (* s(mark(X_)) -> s(X_) *)
   | R_xml_0_rule_19 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_s 
                   ((algebra.Alg.Var 2)::nil)) 
     (algebra.Alg.Term algebra.F.id_s ((algebra.Alg.Term algebra.F.id_mark 
      ((algebra.Alg.Var 2)::nil))::nil))
    (* s(active(X_)) -> s(X_) *)
   | R_xml_0_rule_20 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_s 
                   ((algebra.Alg.Var 2)::nil)) 
     (algebra.Alg.Term algebra.F.id_s ((algebra.Alg.Term algebra.F.id_active 
      ((algebra.Alg.Var 2)::nil))::nil))
    (* cons(mark(X1_),X2_) -> cons(X1_,X2_) *)
   | R_xml_0_rule_21 :
    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_cons ((algebra.Alg.Term 
      algebra.F.id_mark ((algebra.Alg.Var 4)::nil))::
      (algebra.Alg.Var 5)::nil))
    (* cons(X1_,mark(X2_)) -> cons(X1_,X2_) *)
   | R_xml_0_rule_22 :
    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_cons ((algebra.Alg.Var 4)::
      (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Var 5)::nil))::nil))
    (* cons(active(X1_),X2_) -> cons(X1_,X2_) *)
   | R_xml_0_rule_23 :
    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_cons ((algebra.Alg.Term 
      algebra.F.id_active ((algebra.Alg.Var 4)::nil))::
      (algebra.Alg.Var 5)::nil))
    (* cons(X1_,active(X2_)) -> cons(X1_,X2_) *)
   | R_xml_0_rule_24 :
    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_cons ((algebra.Alg.Var 4)::
      (algebra.Alg.Term algebra.F.id_active 
      ((algebra.Alg.Var 5)::nil))::nil))
    (* from(mark(X_)) -> from(X_) *)
   | R_xml_0_rule_25 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_from 
                   ((algebra.Alg.Var 2)::nil)) 
     (algebra.Alg.Term algebra.F.id_from ((algebra.Alg.Term 
      algebra.F.id_mark ((algebra.Alg.Var 2)::nil))::nil))
    (* from(active(X_)) -> from(X_) *)
   | R_xml_0_rule_26 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_from 
                   ((algebra.Alg.Var 2)::nil)) 
     (algebra.Alg.Term algebra.F.id_from ((algebra.Alg.Term 
      algebra.F.id_active ((algebra.Alg.Var 2)::nil))::nil))
    (* add(mark(X1_),X2_) -> add(X1_,X2_) *)
   | R_xml_0_rule_27 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Var 4)::
                   (algebra.Alg.Var 5)::nil)) 
     (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Term algebra.F.id_mark 
      ((algebra.Alg.Var 4)::nil))::(algebra.Alg.Var 5)::nil))
    (* add(X1_,mark(X2_)) -> add(X1_,X2_) *)
   | R_xml_0_rule_28 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Var 4)::
                   (algebra.Alg.Var 5)::nil)) 
     (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Var 4)::
      (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Var 5)::nil))::nil))
    (* add(active(X1_),X2_) -> add(X1_,X2_) *)
   | R_xml_0_rule_29 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Var 4)::
                   (algebra.Alg.Var 5)::nil)) 
     (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Term 
      algebra.F.id_active ((algebra.Alg.Var 4)::nil))::
      (algebra.Alg.Var 5)::nil))
    (* add(X1_,active(X2_)) -> add(X1_,X2_) *)
   | R_xml_0_rule_30 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Var 4)::
                   (algebra.Alg.Var 5)::nil)) 
     (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Var 4)::
      (algebra.Alg.Term algebra.F.id_active 
      ((algebra.Alg.Var 5)::nil))::nil))
    (* len(mark(X_)) -> len(X_) *)
   | R_xml_0_rule_31 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_len 
                   ((algebra.Alg.Var 2)::nil)) 
     (algebra.Alg.Term algebra.F.id_len ((algebra.Alg.Term algebra.F.id_mark 
      ((algebra.Alg.Var 2)::nil))::nil))
    (* len(active(X_)) -> len(X_) *)
   | R_xml_0_rule_32 :
    R_xml_0_rules (algebra.Alg.Term algebra.F.id_len 
                   ((algebra.Alg.Var 2)::nil)) 
     (algebra.Alg.Term algebra.F.id_len ((algebra.Alg.Term 
      algebra.F.id_active ((algebra.Alg.Var 2)::nil))::nil))
 .
 
 
 Definition R_xml_0_rule_as_list_0  := 
   ((algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
     algebra.F.id_fst ((algebra.Alg.Term algebra.F.id_0 nil)::
     (algebra.Alg.Var 1)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_nil 
     nil)::nil)))::nil.
 
 
 Definition R_xml_0_rule_as_list_1  := 
   ((algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
     algebra.F.id_fst ((algebra.Alg.Term algebra.F.id_s 
     ((algebra.Alg.Var 2)::nil))::(algebra.Alg.Term algebra.F.id_cons 
     ((algebra.Alg.Var 3)::(algebra.Alg.Var 1)::nil))::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_cons 
     ((algebra.Alg.Var 3)::(algebra.Alg.Term algebra.F.id_fst 
     ((algebra.Alg.Var 2)::(algebra.Alg.Var 1)::nil))::nil))::nil)))::
    R_xml_0_rule_as_list_0.
 
 
 Definition R_xml_0_rule_as_list_2  := 
   ((algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
     algebra.F.id_from ((algebra.Alg.Var 2)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_cons 
     ((algebra.Alg.Var 2)::(algebra.Alg.Term algebra.F.id_from 
     ((algebra.Alg.Term algebra.F.id_s 
     ((algebra.Alg.Var 2)::nil))::nil))::nil))::nil)))::
    R_xml_0_rule_as_list_1.
 
 
 Definition R_xml_0_rule_as_list_3  := 
   ((algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
     algebra.F.id_add ((algebra.Alg.Term algebra.F.id_0 nil)::
     (algebra.Alg.Var 2)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Var 2)::nil)))::
    R_xml_0_rule_as_list_2.
 
 
 Definition R_xml_0_rule_as_list_4  := 
   ((algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
     algebra.F.id_add ((algebra.Alg.Term algebra.F.id_s 
     ((algebra.Alg.Var 2)::nil))::(algebra.Alg.Var 3)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_s 
     ((algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Var 2)::
     (algebra.Alg.Var 3)::nil))::nil))::nil)))::R_xml_0_rule_as_list_3.
 
 
 Definition R_xml_0_rule_as_list_5  := 
   ((algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
     algebra.F.id_len ((algebra.Alg.Term algebra.F.id_nil nil)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_0 
     nil)::nil)))::R_xml_0_rule_as_list_4.
 
 
 Definition R_xml_0_rule_as_list_6  := 
   ((algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
     algebra.F.id_len ((algebra.Alg.Term algebra.F.id_cons 
     ((algebra.Alg.Var 2)::(algebra.Alg.Var 1)::nil))::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_s 
     ((algebra.Alg.Term algebra.F.id_len 
     ((algebra.Alg.Var 1)::nil))::nil))::nil)))::R_xml_0_rule_as_list_5.
 
 
 Definition R_xml_0_rule_as_list_7  := 
   ((algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term algebra.F.id_fst 
     ((algebra.Alg.Var 4)::(algebra.Alg.Var 5)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
     algebra.F.id_fst ((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))::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_0 
     nil)::nil)),
    (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term algebra.F.id_0 
     nil)::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_nil 
     nil)::nil)),
    (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
     algebra.F.id_nil 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_s 
     ((algebra.Alg.Var 2)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term algebra.F.id_s 
     ((algebra.Alg.Var 2)::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_cons 
     ((algebra.Alg.Var 4)::(algebra.Alg.Var 5)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
     algebra.F.id_cons ((algebra.Alg.Term algebra.F.id_mark 
     ((algebra.Alg.Var 4)::nil))::(algebra.Alg.Var 5)::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_from 
     ((algebra.Alg.Var 2)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
     algebra.F.id_from ((algebra.Alg.Term algebra.F.id_mark 
     ((algebra.Alg.Var 2)::nil))::nil))::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_add 
     ((algebra.Alg.Var 4)::(algebra.Alg.Var 5)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
     algebra.F.id_add ((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))::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_len 
     ((algebra.Alg.Var 2)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
     algebra.F.id_len ((algebra.Alg.Term algebra.F.id_mark 
     ((algebra.Alg.Var 2)::nil))::nil))::nil)))::R_xml_0_rule_as_list_13.
 
 
 Definition R_xml_0_rule_as_list_15  := 
   ((algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Term algebra.F.id_mark 
     ((algebra.Alg.Var 4)::nil))::(algebra.Alg.Var 5)::nil)),
    (algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Var 4)::
     (algebra.Alg.Var 5)::nil)))::R_xml_0_rule_as_list_14.
 
 
 Definition R_xml_0_rule_as_list_16  := 
   ((algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Var 4)::
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Var 5)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_fst ((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_fst ((algebra.Alg.Term 
     algebra.F.id_active ((algebra.Alg.Var 4)::nil))::
     (algebra.Alg.Var 5)::nil)),
    (algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Var 4)::
     (algebra.Alg.Var 5)::nil)))::R_xml_0_rule_as_list_16.
 
 
 Definition R_xml_0_rule_as_list_18  := 
   ((algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Var 4)::
     (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Var 5)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_fst ((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_s ((algebra.Alg.Term algebra.F.id_mark 
     ((algebra.Alg.Var 2)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_s ((algebra.Alg.Var 2)::nil)))::
    R_xml_0_rule_as_list_18.
 
 
 Definition R_xml_0_rule_as_list_20  := 
   ((algebra.Alg.Term algebra.F.id_s ((algebra.Alg.Term algebra.F.id_active 
     ((algebra.Alg.Var 2)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_s ((algebra.Alg.Var 2)::nil)))::
    R_xml_0_rule_as_list_19.
 
 
 Definition R_xml_0_rule_as_list_21  := 
   ((algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Term algebra.F.id_mark 
     ((algebra.Alg.Var 4)::nil))::(algebra.Alg.Var 5)::nil)),
    (algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Var 4)::
     (algebra.Alg.Var 5)::nil)))::R_xml_0_rule_as_list_20.
 
 
 Definition R_xml_0_rule_as_list_22  := 
   ((algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Var 4)::
     (algebra.Alg.Term algebra.F.id_mark ((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_21.
 
 
 Definition R_xml_0_rule_as_list_23  := 
   ((algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Term 
     algebra.F.id_active ((algebra.Alg.Var 4)::nil))::
     (algebra.Alg.Var 5)::nil)),
    (algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Var 4)::
     (algebra.Alg.Var 5)::nil)))::R_xml_0_rule_as_list_22.
 
 
 Definition R_xml_0_rule_as_list_24  := 
   ((algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Var 4)::
     (algebra.Alg.Term algebra.F.id_active ((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_23.
 
 
 Definition R_xml_0_rule_as_list_25  := 
   ((algebra.Alg.Term algebra.F.id_from ((algebra.Alg.Term algebra.F.id_mark 
     ((algebra.Alg.Var 2)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_from ((algebra.Alg.Var 2)::nil)))::
    R_xml_0_rule_as_list_24.
 
 
 Definition R_xml_0_rule_as_list_26  := 
   ((algebra.Alg.Term algebra.F.id_from ((algebra.Alg.Term 
     algebra.F.id_active ((algebra.Alg.Var 2)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_from ((algebra.Alg.Var 2)::nil)))::
    R_xml_0_rule_as_list_25.
 
 
 Definition R_xml_0_rule_as_list_27  := 
   ((algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Term algebra.F.id_mark 
     ((algebra.Alg.Var 4)::nil))::(algebra.Alg.Var 5)::nil)),
    (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Var 4)::
     (algebra.Alg.Var 5)::nil)))::R_xml_0_rule_as_list_26.
 
 
 Definition R_xml_0_rule_as_list_28  := 
   ((algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Var 4)::
     (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Var 5)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Var 4)::
     (algebra.Alg.Var 5)::nil)))::R_xml_0_rule_as_list_27.
 
 
 Definition R_xml_0_rule_as_list_29  := 
   ((algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Term 
     algebra.F.id_active ((algebra.Alg.Var 4)::nil))::
     (algebra.Alg.Var 5)::nil)),
    (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Var 4)::
     (algebra.Alg.Var 5)::nil)))::R_xml_0_rule_as_list_28.
 
 
 Definition R_xml_0_rule_as_list_30  := 
   ((algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Var 4)::
     (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Var 5)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Var 4)::
     (algebra.Alg.Var 5)::nil)))::R_xml_0_rule_as_list_29.
 
 
 Definition R_xml_0_rule_as_list_31  := 
   ((algebra.Alg.Term algebra.F.id_len ((algebra.Alg.Term algebra.F.id_mark 
     ((algebra.Alg.Var 2)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_len ((algebra.Alg.Var 2)::nil)))::
    R_xml_0_rule_as_list_30.
 
 
 Definition R_xml_0_rule_as_list_32  := 
   ((algebra.Alg.Term algebra.F.id_len ((algebra.Alg.Term 
     algebra.F.id_active ((algebra.Alg.Var 2)::nil))::nil)),
    (algebra.Alg.Term algebra.F.id_len ((algebra.Alg.Var 2)::nil)))::
    R_xml_0_rule_as_list_31.
 
 Definition R_xml_0_rule_as_list  := R_xml_0_rule_as_list_32.
 
 
 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.or25_equiv in H|-.
   case H;clear H;intros H.
   injection H;intros ;subst;constructor 33.
   injection H;intros ;subst;constructor 32.
   injection H;intros ;subst;constructor 31.
   injection H;intros ;subst;constructor 30.
   injection H;intros ;subst;constructor 29.
   injection H;intros ;subst;constructor 28.
   injection H;intros ;subst;constructor 27.
   injection H;intros ;subst;constructor 26.
   injection H;intros ;subst;constructor 25.
   injection H;intros ;subst;constructor 24.
   injection H;intros ;subst;constructor 23.
   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.
   rewrite  <- or_ext_generated.or10_equiv in H|-.
   case H;clear H;intros H.
   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_2 (x7 x8:Prop) : Prop := 
   | conj_2 : x7->x8->and_2 x7 x8
 .
 
 
 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_2 (t = (algebra.Alg.Term algebra.F.id_nil nil) ->
           t' = (algebra.Alg.Term algebra.F.id_nil nil)) 
     (t = (algebra.Alg.Term algebra.F.id_0 nil) ->
      t' = (algebra.Alg.Term algebra.F.id_0 nil)).
 Proof.
   intros t t' H.
   
   induction H as [|y IH z z_to_y] using 
   closure_extension.refl_trans_clos_ind2.
   constructor 1.
   intros H;intuition;constructor 1.
   intros H;intuition;constructor 1.
   inversion z_to_y as [t1 t2 H H0 H1|f l1 l2 H0 H H2];clear z_to_y;subst.
   
   inversion H as [t1 t2 sigma H2 H1 H0];clear H IH;subst;inversion H2;
    clear ;constructor;try (intros until 0 );clear ;intros abs;
    discriminate abs.
   destruct IH as [H_id_nil H_id_0].
   constructor.
   
   clear H_id_0;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_nil;intros H;injection H;clear H;intros ;subst;
    repeat (
    match goal with
      | H:closure.one_step_list (algebra.EQT.one_step _) _ _ |- _ =>
       inversion H;clear H;subst
      end
    ).
 Qed.
 
 
 Lemma id_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_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.
 
 
 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_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_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 ))
    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_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_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 )))
    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_active : A ->A.
   
   Hypothesis P_id_add : A ->A ->A.
   
   Hypothesis P_id_nil : A.
   
   Hypothesis P_id_0 : A.
   
   Hypothesis P_id_cons : A ->A ->A.
   
   Hypothesis P_id_fst : A ->A ->A.
   
   Hypothesis P_id_len : A ->A.
   
   Hypothesis P_id_s : A ->A.
   
   Hypothesis P_id_mark : A ->A.
   
   Hypothesis P_id_from : A ->A.
   
   Hypothesis P_id_active_monotonic :
    forall x8 x7, (A0 <= x8)/\ (x8 <= x7) ->P_id_active x8 <= P_id_active x7.
   
   Hypothesis P_id_add_monotonic :
    forall x8 x10 x9 x7, 
     (A0 <= x10)/\ (x10 <= x9) ->
      (A0 <= x8)/\ (x8 <= x7) ->P_id_add x8 x10 <= P_id_add 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_fst_monotonic :
    forall x8 x10 x9 x7, 
     (A0 <= x10)/\ (x10 <= x9) ->
      (A0 <= x8)/\ (x8 <= x7) ->P_id_fst x8 x10 <= P_id_fst x7 x9.
   
   Hypothesis P_id_len_monotonic :
    forall x8 x7, (A0 <= x8)/\ (x8 <= x7) ->P_id_len x8 <= P_id_len x7.
   
   Hypothesis P_id_s_monotonic :
    forall x8 x7, (A0 <= x8)/\ (x8 <= x7) ->P_id_s x8 <= P_id_s x7.
   
   Hypothesis P_id_mark_monotonic :
    forall x8 x7, (A0 <= x8)/\ (x8 <= x7) ->P_id_mark x8 <= P_id_mark x7.
   
   Hypothesis P_id_from_monotonic :
    forall x8 x7, (A0 <= x8)/\ (x8 <= x7) ->P_id_from x8 <= P_id_from x7.
   
   Hypothesis P_id_active_bounded :
    forall x7, (A0 <= x7) ->A0 <= P_id_active x7.
   
   Hypothesis P_id_add_bounded :
    forall x8 x7, (A0 <= x7) ->(A0 <= x8) ->A0 <= P_id_add x8 x7.
   
   Hypothesis P_id_nil_bounded : A0 <= P_id_nil .
   
   Hypothesis P_id_0_bounded : A0 <= P_id_0 .
   
   Hypothesis P_id_cons_bounded :
    forall x8 x7, (A0 <= x7) ->(A0 <= x8) ->A0 <= P_id_cons x8 x7.
   
   Hypothesis P_id_fst_bounded :
    forall x8 x7, (A0 <= x7) ->(A0 <= x8) ->A0 <= P_id_fst x8 x7.
   
   Hypothesis P_id_len_bounded : forall x7, (A0 <= x7) ->A0 <= P_id_len x7.
   
   Hypothesis P_id_s_bounded : forall x7, (A0 <= x7) ->A0 <= P_id_s x7.
   
   Hypothesis P_id_mark_bounded : forall x7, (A0 <= x7) ->A0 <= P_id_mark x7.
   
   Hypothesis P_id_from_bounded : forall x7, (A0 <= x7) ->A0 <= P_id_from x7.
   
   Fixpoint measure t { struct t }  := 
     match t with
       | (algebra.Alg.Term algebra.F.id_active (x7::nil)) =>
        P_id_active (measure x7)
       | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
        P_id_add (measure x8) (measure x7)
       | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
       | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
       | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
        P_id_cons (measure x8) (measure x7)
       | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
        P_id_fst (measure x8) (measure x7)
       | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
        P_id_len (measure x7)
       | (algebra.Alg.Term algebra.F.id_s (x7::nil)) => P_id_s (measure x7)
       | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
        P_id_mark (measure x7)
       | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
        P_id_from (measure x7)
       | _ => A0
       end.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_active (x7::nil)) =>
                    P_id_active (measure x7)
                   | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                    P_id_add (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                   | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                    P_id_fst (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                    P_id_len (measure x7)
                   | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                    P_id_s (measure x7)
                   | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                    P_id_mark (measure x7)
                   | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                    P_id_from (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_active => P_id_active
       | algebra.F.id_add => P_id_add
       | algebra.F.id_nil => P_id_nil
       | algebra.F.id_0 => P_id_0
       | algebra.F.id_cons => P_id_cons
       | algebra.F.id_fst => P_id_fst
       | algebra.F.id_len => P_id_len
       | algebra.F.id_s => P_id_s
       | algebra.F.id_mark => P_id_mark
       | algebra.F.id_from => P_id_from
       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_active =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_add =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_nil => match l with
                                      | nil => _
                                      | _::_ => _
                                      end
              | algebra.F.id_0 => match l with
                                    | nil => _
                                    | _::_ => _
                                    end
              | algebra.F.id_cons =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_fst =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_len =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_s =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_mark =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_from =>
               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_active_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_add_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_nil_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_0_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_cons_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_fst_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_len_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_s_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_mark_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_from_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_active_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_add_monotonic;assumption.
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;intros ;apply P_id_cons_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_fst_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_len_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_s_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_mark_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_from_monotonic;assumption.
     intros f.
     case f.
     vm_compute in |-*;intros ;apply P_id_active_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_add_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_nil_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_0_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_cons_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_fst_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_len_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_s_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_mark_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_from_bounded;assumption.
     intros .
     do 2 (rewrite  <- same_measure in |-*).
     apply rules_monotonic;assumption.
     assumption.
   Qed.
   
   Hypothesis P_id_ADD : A ->A ->A.
   
   Hypothesis P_id_CONS : A ->A ->A.
   
   Hypothesis P_id_ACTIVE : A ->A.
   
   Hypothesis P_id_FROM : A ->A.
   
   Hypothesis P_id_LEN : A ->A.
   
   Hypothesis P_id_FST : A ->A ->A.
   
   Hypothesis P_id_MARK : A ->A.
   
   Hypothesis P_id_S : A ->A.
   
   Hypothesis P_id_ADD_monotonic :
    forall x8 x10 x9 x7, 
     (A0 <= x10)/\ (x10 <= x9) ->
      (A0 <= x8)/\ (x8 <= x7) ->P_id_ADD x8 x10 <= P_id_ADD 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_ACTIVE_monotonic :
    forall x8 x7, (A0 <= x8)/\ (x8 <= x7) ->P_id_ACTIVE x8 <= P_id_ACTIVE x7.
   
   Hypothesis P_id_FROM_monotonic :
    forall x8 x7, (A0 <= x8)/\ (x8 <= x7) ->P_id_FROM x8 <= P_id_FROM x7.
   
   Hypothesis P_id_LEN_monotonic :
    forall x8 x7, (A0 <= x8)/\ (x8 <= x7) ->P_id_LEN x8 <= P_id_LEN x7.
   
   Hypothesis P_id_FST_monotonic :
    forall x8 x10 x9 x7, 
     (A0 <= x10)/\ (x10 <= x9) ->
      (A0 <= x8)/\ (x8 <= x7) ->P_id_FST x8 x10 <= P_id_FST x7 x9.
   
   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.
   
   Definition marked_measure t := 
     match t with
       | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
        P_id_ADD (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_active (x7::nil)) =>
        P_id_ACTIVE (measure x7)
       | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
        P_id_FROM (measure x7)
       | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
        P_id_LEN (measure x7)
       | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
        P_id_FST (measure x8) (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)
       | _ => 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_FROM 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_S 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_LEN 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_FST 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_CONS 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_ADD 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 x7;apply (P_id_ACTIVE 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_active =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_add =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_nil => match l with
                                      | nil => _
                                      | _::_ => _
                                      end
              | algebra.F.id_0 => match l with
                                    | nil => _
                                    | _::_ => _
                                    end
              | algebra.F.id_cons =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_fst =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::nil => _
                 | _::_::_::_ => _
                 end
              | algebra.F.id_len =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_s =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_mark =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              | algebra.F.id_from =>
               match l with
                 | nil => _
                 | _::nil => _
                 | _::_::_ => _
                 end
              end.
     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 .
     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 .
     
     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_add (x8::x7::nil)) =>
                           P_id_ADD (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_active (x7::nil)) =>
                           P_id_ACTIVE (measure x7)
                          | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                           P_id_FROM (measure x7)
                          | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                           P_id_LEN (measure x7)
                          | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                           P_id_FST (measure x8) (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)
                          | _ => 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_active_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_add_monotonic;assumption.
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;apply (Aop.(le_refl)).
     vm_compute in |-*;intros ;apply P_id_cons_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_fst_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_len_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_s_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_mark_monotonic;assumption.
     vm_compute in |-*;intros ;apply P_id_from_monotonic;assumption.
     clear f.
     intros f.
     case f.
     vm_compute in |-*;intros ;apply P_id_active_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_add_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_nil_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_0_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_cons_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_fst_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_len_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_s_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_mark_bounded;assumption.
     vm_compute in |-*;intros ;apply P_id_from_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_FROM_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_S_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_LEN_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_FST_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_CONS_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_ADD_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_ACTIVE_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_active : Z ->Z.
   
   Hypothesis P_id_add : Z ->Z ->Z.
   
   Hypothesis P_id_nil : Z.
   
   Hypothesis P_id_0 : Z.
   
   Hypothesis P_id_cons : Z ->Z ->Z.
   
   Hypothesis P_id_fst : Z ->Z ->Z.
   
   Hypothesis P_id_len : Z ->Z.
   
   Hypothesis P_id_s : Z ->Z.
   
   Hypothesis P_id_mark : Z ->Z.
   
   Hypothesis P_id_from : Z ->Z.
   
   Hypothesis P_id_active_monotonic :
    forall x8 x7, 
     (min_value <= x8)/\ (x8 <= x7) ->P_id_active x8 <= P_id_active x7.
   
   Hypothesis P_id_add_monotonic :
    forall x8 x10 x9 x7, 
     (min_value <= x10)/\ (x10 <= x9) ->
      (min_value <= x8)/\ (x8 <= x7) ->P_id_add x8 x10 <= P_id_add 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_fst_monotonic :
    forall x8 x10 x9 x7, 
     (min_value <= x10)/\ (x10 <= x9) ->
      (min_value <= x8)/\ (x8 <= x7) ->P_id_fst x8 x10 <= P_id_fst x7 x9.
   
   Hypothesis P_id_len_monotonic :
    forall x8 x7, (min_value <= x8)/\ (x8 <= x7) ->P_id_len x8 <= P_id_len 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_mark_monotonic :
    forall x8 x7, 
     (min_value <= x8)/\ (x8 <= x7) ->P_id_mark x8 <= P_id_mark x7.
   
   Hypothesis P_id_from_monotonic :
    forall x8 x7, 
     (min_value <= x8)/\ (x8 <= x7) ->P_id_from x8 <= P_id_from x7.
   
   Hypothesis P_id_active_bounded :
    forall x7, (min_value <= x7) ->min_value <= P_id_active x7.
   
   Hypothesis P_id_add_bounded :
    forall x8 x7, 
     (min_value <= x7) ->(min_value <= x8) ->min_value <= P_id_add x8 x7.
   
   Hypothesis P_id_nil_bounded : min_value <= P_id_nil .
   
   Hypothesis P_id_0_bounded : min_value <= P_id_0 .
   
   Hypothesis P_id_cons_bounded :
    forall x8 x7, 
     (min_value <= x7) ->(min_value <= x8) ->min_value <= P_id_cons x8 x7.
   
   Hypothesis P_id_fst_bounded :
    forall x8 x7, 
     (min_value <= x7) ->(min_value <= x8) ->min_value <= P_id_fst x8 x7.
   
   Hypothesis P_id_len_bounded :
    forall x7, (min_value <= x7) ->min_value <= P_id_len x7.
   
   Hypothesis P_id_s_bounded :
    forall x7, (min_value <= x7) ->min_value <= P_id_s x7.
   
   Hypothesis P_id_mark_bounded :
    forall x7, (min_value <= x7) ->min_value <= P_id_mark x7.
   
   Hypothesis P_id_from_bounded :
    forall x7, (min_value <= x7) ->min_value <= P_id_from x7.
   
   Definition measure  := 
     Interp.measure min_value P_id_active P_id_add P_id_nil P_id_0 P_id_cons 
      P_id_fst P_id_len P_id_s P_id_mark P_id_from.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_active (x7::nil)) =>
                    P_id_active (measure x7)
                   | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                    P_id_add (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                   | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                    P_id_fst (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                    P_id_len (measure x7)
                   | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                    P_id_s (measure x7)
                   | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                    P_id_mark (measure x7)
                   | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                    P_id_from (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_active_monotonic;assumption.
     intros ;apply P_id_add_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_fst_monotonic;assumption.
     intros ;apply P_id_len_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_from_monotonic;assumption.
     intros ;apply P_id_active_bounded;assumption.
     intros ;apply P_id_add_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_fst_bounded;assumption.
     intros ;apply P_id_len_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_from_bounded;assumption.
     apply rules_monotonic.
   Qed.
   
   Hypothesis P_id_ADD : Z ->Z ->Z.
   
   Hypothesis P_id_CONS : Z ->Z ->Z.
   
   Hypothesis P_id_ACTIVE : Z ->Z.
   
   Hypothesis P_id_FROM : Z ->Z.
   
   Hypothesis P_id_LEN : Z ->Z.
   
   Hypothesis P_id_FST : Z ->Z ->Z.
   
   Hypothesis P_id_MARK : Z ->Z.
   
   Hypothesis P_id_S : Z ->Z.
   
   Hypothesis P_id_ADD_monotonic :
    forall x8 x10 x9 x7, 
     (min_value <= x10)/\ (x10 <= x9) ->
      (min_value <= x8)/\ (x8 <= x7) ->P_id_ADD x8 x10 <= P_id_ADD 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_ACTIVE_monotonic :
    forall x8 x7, 
     (min_value <= x8)/\ (x8 <= x7) ->P_id_ACTIVE x8 <= P_id_ACTIVE x7.
   
   Hypothesis P_id_FROM_monotonic :
    forall x8 x7, 
     (min_value <= x8)/\ (x8 <= x7) ->P_id_FROM x8 <= P_id_FROM x7.
   
   Hypothesis P_id_LEN_monotonic :
    forall x8 x7, (min_value <= x8)/\ (x8 <= x7) ->P_id_LEN x8 <= P_id_LEN x7.
   
   Hypothesis P_id_FST_monotonic :
    forall x8 x10 x9 x7, 
     (min_value <= x10)/\ (x10 <= x9) ->
      (min_value <= x8)/\ (x8 <= x7) ->P_id_FST x8 x10 <= P_id_FST x7 x9.
   
   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.
   
   Definition marked_measure  := 
     Interp.marked_measure min_value P_id_active P_id_add P_id_nil P_id_0 
      P_id_cons P_id_fst P_id_len P_id_s P_id_mark P_id_from P_id_ADD 
      P_id_CONS P_id_ACTIVE P_id_FROM P_id_LEN P_id_FST P_id_MARK P_id_S.
   
   Lemma marked_measure_equation :
    forall t, 
     marked_measure t = match t with
                          | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                           P_id_ADD (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_active (x7::nil)) =>
                           P_id_ACTIVE (measure x7)
                          | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                           P_id_FROM (measure x7)
                          | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                           P_id_LEN (measure x7)
                          | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                           P_id_FST (measure x8) (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)
                          | _ => 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_active_monotonic;assumption.
     intros ;apply P_id_add_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_fst_monotonic;assumption.
     intros ;apply P_id_len_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_from_monotonic;assumption.
     intros ;apply P_id_active_bounded;assumption.
     intros ;apply P_id_add_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_fst_bounded;assumption.
     intros ;apply P_id_len_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_from_bounded;assumption.
     apply rules_monotonic.
     intros ;apply P_id_ADD_monotonic;assumption.
     intros ;apply P_id_CONS_monotonic;assumption.
     intros ;apply P_id_ACTIVE_monotonic;assumption.
     intros ;apply P_id_FROM_monotonic;assumption.
     intros ;apply P_id_LEN_monotonic;assumption.
     intros ;apply P_id_FST_monotonic;assumption.
     intros ;apply P_id_MARK_monotonic;assumption.
     intros ;apply P_id_S_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 := 
    (* <active(fst(0,Z_)),mark(nil)> *)
   | DP_R_xml_0_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_fst ((algebra.Alg.Term algebra.F.id_0 
        nil)::x1::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
                  algebra.F.id_nil nil)::nil)) 
       (algebra.Alg.Term algebra.F.id_active (x7::nil))
   
    (* <active(fst(s(X_),cons(Y_,Z_))),mark(cons(Y_,fst(X_,Z_)))> *)
   | DP_R_xml_0_1 :
    forall x2 x1 x3 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Term algebra.F.id_s 
        (x2::nil))::(algebra.Alg.Term algebra.F.id_cons (x3::x1::nil))::nil)) 
       x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
                  algebra.F.id_cons (x3::(algebra.Alg.Term algebra.F.id_fst 
                  (x2::x1::nil))::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_active (x7::nil))
   
    (* <active(fst(s(X_),cons(Y_,Z_))),cons(Y_,fst(X_,Z_))> *)
   | DP_R_xml_0_2 :
    forall x2 x1 x3 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Term algebra.F.id_s 
        (x2::nil))::(algebra.Alg.Term algebra.F.id_cons (x3::x1::nil))::nil)) 
       x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_cons (x3::(algebra.Alg.Term 
                  algebra.F.id_fst (x2::x1::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_active (x7::nil))
    (* <active(fst(s(X_),cons(Y_,Z_))),fst(X_,Z_)> *)
   | DP_R_xml_0_3 :
    forall x2 x1 x3 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Term algebra.F.id_s 
        (x2::nil))::(algebra.Alg.Term algebra.F.id_cons (x3::x1::nil))::nil)) 
       x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_fst (x2::x1::nil)) 
       (algebra.Alg.Term algebra.F.id_active (x7::nil))
    (* <active(from(X_)),mark(cons(X_,from(s(X_))))> *)
   | DP_R_xml_0_4 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_from (x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
                  algebra.F.id_cons (x2::(algebra.Alg.Term algebra.F.id_from 
                  ((algebra.Alg.Term algebra.F.id_s 
                  (x2::nil))::nil))::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_active (x7::nil))
    (* <active(from(X_)),cons(X_,from(s(X_)))> *)
   | DP_R_xml_0_5 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_from (x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_cons (x2::(algebra.Alg.Term 
                  algebra.F.id_from ((algebra.Alg.Term algebra.F.id_s 
                  (x2::nil))::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_active (x7::nil))
    (* <active(from(X_)),from(s(X_))> *)
   | DP_R_xml_0_6 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_from (x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_from ((algebra.Alg.Term 
                  algebra.F.id_s (x2::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_active (x7::nil))
    (* <active(from(X_)),s(X_)> *)
   | DP_R_xml_0_7 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_from (x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_s (x2::nil)) 
       (algebra.Alg.Term algebra.F.id_active (x7::nil))
    (* <active(add(0,X_)),mark(X_)> *)
   | DP_R_xml_0_8 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Term algebra.F.id_0 
        nil)::x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_mark (x2::nil)) 
       (algebra.Alg.Term algebra.F.id_active (x7::nil))
    (* <active(add(s(X_),Y_)),mark(s(add(X_,Y_)))> *)
   | DP_R_xml_0_9 :
    forall x2 x3 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Term algebra.F.id_s 
        (x2::nil))::x3::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
                  algebra.F.id_s ((algebra.Alg.Term algebra.F.id_add (x2::
                  x3::nil))::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_active (x7::nil))
    (* <active(add(s(X_),Y_)),s(add(X_,Y_))> *)
   | DP_R_xml_0_10 :
    forall x2 x3 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Term algebra.F.id_s 
        (x2::nil))::x3::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_s ((algebra.Alg.Term 
                  algebra.F.id_add (x2::x3::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_active (x7::nil))
    (* <active(add(s(X_),Y_)),add(X_,Y_)> *)
   | DP_R_xml_0_11 :
    forall x2 x3 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Term algebra.F.id_s 
        (x2::nil))::x3::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_add (x2::x3::nil)) 
       (algebra.Alg.Term algebra.F.id_active (x7::nil))
    (* <active(len(nil)),mark(0)> *)
   | DP_R_xml_0_12 :
    forall x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_len ((algebra.Alg.Term 
        algebra.F.id_nil nil)::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
                  algebra.F.id_0 nil)::nil)) 
       (algebra.Alg.Term algebra.F.id_active (x7::nil))
    (* <active(len(cons(X_,Z_))),mark(s(len(Z_)))> *)
   | DP_R_xml_0_13 :
    forall 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_len ((algebra.Alg.Term 
        algebra.F.id_cons (x2::x1::nil))::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_mark ((algebra.Alg.Term 
                  algebra.F.id_s ((algebra.Alg.Term algebra.F.id_len 
                  (x1::nil))::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_active (x7::nil))
    (* <active(len(cons(X_,Z_))),s(len(Z_))> *)
   | DP_R_xml_0_14 :
    forall 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_len ((algebra.Alg.Term 
        algebra.F.id_cons (x2::x1::nil))::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_s ((algebra.Alg.Term 
                  algebra.F.id_len (x1::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_active (x7::nil))
    (* <active(len(cons(X_,Z_))),len(Z_)> *)
   | DP_R_xml_0_15 :
    forall 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_len ((algebra.Alg.Term 
        algebra.F.id_cons (x2::x1::nil))::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_len (x1::nil)) 
       (algebra.Alg.Term algebra.F.id_active (x7::nil))
   
    (* <mark(fst(X1_,X2_)),active(fst(mark(X1_),mark(X2_)))> *)
   | DP_R_xml_0_16 :
    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_fst (x4::x5::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
                  algebra.F.id_fst ((algebra.Alg.Term algebra.F.id_mark 
                  (x4::nil))::(algebra.Alg.Term algebra.F.id_mark 
                  (x5::nil))::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(fst(X1_,X2_)),fst(mark(X1_),mark(X2_))> *)
   | DP_R_xml_0_17 :
    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_fst (x4::x5::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_fst ((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(fst(X1_,X2_)),mark(X1_)> *)
   | DP_R_xml_0_18 :
    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_fst (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(fst(X1_,X2_)),mark(X2_)> *)
   | DP_R_xml_0_19 :
    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_fst (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(0),active(0)> *)
   | DP_R_xml_0_20 :
    forall x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                (algebra.Alg.Term algebra.F.id_0 nil) 
       x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
                  algebra.F.id_0 nil)::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(nil),active(nil)> *)
   | DP_R_xml_0_21 :
    forall x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                (algebra.Alg.Term algebra.F.id_nil nil) 
       x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
                  algebra.F.id_nil nil)::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(s(X_)),active(s(X_))> *)
   | DP_R_xml_0_22 :
    forall x2 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 (x2::nil)) 
       x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
                  algebra.F.id_s (x2::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(s(X_)),s(X_)> *)
   | DP_R_xml_0_23 :
    forall x2 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 (x2::nil)) 
       x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_s (x2::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(cons(X1_,X2_)),active(cons(mark(X1_),X2_))> *)
   | DP_R_xml_0_24 :
    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_cons (x4::x5::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
                  algebra.F.id_cons ((algebra.Alg.Term algebra.F.id_mark 
                  (x4::nil))::x5::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(cons(X1_,X2_)),cons(mark(X1_),X2_)> *)
   | DP_R_xml_0_25 :
    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_cons (x4::x5::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_cons ((algebra.Alg.Term 
                  algebra.F.id_mark (x4::nil))::x5::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(cons(X1_,X2_)),mark(X1_)> *)
   | DP_R_xml_0_26 :
    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_cons (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(from(X_)),active(from(mark(X_)))> *)
   | DP_R_xml_0_27 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_from (x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
                  algebra.F.id_from ((algebra.Alg.Term algebra.F.id_mark 
                  (x2::nil))::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(from(X_)),from(mark(X_))> *)
   | DP_R_xml_0_28 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_from (x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_from ((algebra.Alg.Term 
                  algebra.F.id_mark (x2::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(from(X_)),mark(X_)> *)
   | DP_R_xml_0_29 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_from (x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_mark (x2::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
   
    (* <mark(add(X1_,X2_)),active(add(mark(X1_),mark(X2_)))> *)
   | DP_R_xml_0_30 :
    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_add (x4::x5::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
                  algebra.F.id_add ((algebra.Alg.Term algebra.F.id_mark 
                  (x4::nil))::(algebra.Alg.Term algebra.F.id_mark 
                  (x5::nil))::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(add(X1_,X2_)),add(mark(X1_),mark(X2_))> *)
   | DP_R_xml_0_31 :
    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_add (x4::x5::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_add ((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(add(X1_,X2_)),mark(X1_)> *)
   | DP_R_xml_0_32 :
    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_add (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(add(X1_,X2_)),mark(X2_)> *)
   | DP_R_xml_0_33 :
    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_add (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(len(X_)),active(len(mark(X_)))> *)
   | DP_R_xml_0_34 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_len (x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_active ((algebra.Alg.Term 
                  algebra.F.id_len ((algebra.Alg.Term algebra.F.id_mark 
                  (x2::nil))::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(len(X_)),len(mark(X_))> *)
   | DP_R_xml_0_35 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_len (x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_len ((algebra.Alg.Term 
                  algebra.F.id_mark (x2::nil))::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <mark(len(X_)),mark(X_)> *)
   | DP_R_xml_0_36 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_len (x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_mark (x2::nil)) 
       (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    (* <fst(mark(X1_),X2_),fst(X1_,X2_)> *)
   | DP_R_xml_0_37 :
    forall x8 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_mark (x4::nil)) x8) ->
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 x5 x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_fst (x4::x5::nil)) 
        (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil))
    (* <fst(X1_,mark(X2_)),fst(X1_,X2_)> *)
   | DP_R_xml_0_38 :
    forall x8 x4 x5 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                x4 x8) ->
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_mark (x5::nil)) x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_fst (x4::x5::nil)) 
        (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil))
    (* <fst(active(X1_),X2_),fst(X1_,X2_)> *)
   | DP_R_xml_0_39 :
    forall x8 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_active (x4::nil)) x8) ->
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 x5 x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_fst (x4::x5::nil)) 
        (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil))
    (* <fst(X1_,active(X2_)),fst(X1_,X2_)> *)
   | DP_R_xml_0_40 :
    forall x8 x4 x5 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                x4 x8) ->
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_active (x5::nil)) x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_fst (x4::x5::nil)) 
        (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil))
    (* <s(mark(X_)),s(X_)> *)
   | DP_R_xml_0_41 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_mark (x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_s (x2::nil)) 
       (algebra.Alg.Term algebra.F.id_s (x7::nil))
    (* <s(active(X_)),s(X_)> *)
   | DP_R_xml_0_42 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_active (x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_s (x2::nil)) 
       (algebra.Alg.Term algebra.F.id_s (x7::nil))
    (* <cons(mark(X1_),X2_),cons(X1_,X2_)> *)
   | DP_R_xml_0_43 :
    forall x8 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_mark (x4::nil)) x8) ->
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 x5 x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_cons (x4::x5::nil)) 
        (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil))
    (* <cons(X1_,mark(X2_)),cons(X1_,X2_)> *)
   | DP_R_xml_0_44 :
    forall x8 x4 x5 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                x4 x8) ->
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_mark (x5::nil)) x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_cons (x4::x5::nil)) 
        (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil))
    (* <cons(active(X1_),X2_),cons(X1_,X2_)> *)
   | DP_R_xml_0_45 :
    forall x8 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_active (x4::nil)) x8) ->
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 x5 x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_cons (x4::x5::nil)) 
        (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil))
    (* <cons(X1_,active(X2_)),cons(X1_,X2_)> *)
   | DP_R_xml_0_46 :
    forall x8 x4 x5 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                x4 x8) ->
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_active (x5::nil)) x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_cons (x4::x5::nil)) 
        (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil))
    (* <from(mark(X_)),from(X_)> *)
   | DP_R_xml_0_47 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_mark (x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_from (x2::nil)) 
       (algebra.Alg.Term algebra.F.id_from (x7::nil))
    (* <from(active(X_)),from(X_)> *)
   | DP_R_xml_0_48 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_active (x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_from (x2::nil)) 
       (algebra.Alg.Term algebra.F.id_from (x7::nil))
    (* <add(mark(X1_),X2_),add(X1_,X2_)> *)
   | DP_R_xml_0_49 :
    forall x8 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_mark (x4::nil)) x8) ->
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 x5 x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_add (x4::x5::nil)) 
        (algebra.Alg.Term algebra.F.id_add (x8::x7::nil))
    (* <add(X1_,mark(X2_)),add(X1_,X2_)> *)
   | DP_R_xml_0_50 :
    forall x8 x4 x5 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                x4 x8) ->
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_mark (x5::nil)) x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_add (x4::x5::nil)) 
        (algebra.Alg.Term algebra.F.id_add (x8::x7::nil))
    (* <add(active(X1_),X2_),add(X1_,X2_)> *)
   | DP_R_xml_0_51 :
    forall x8 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_active (x4::nil)) x8) ->
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 x5 x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_add (x4::x5::nil)) 
        (algebra.Alg.Term algebra.F.id_add (x8::x7::nil))
    (* <add(X1_,active(X2_)),add(X1_,X2_)> *)
   | DP_R_xml_0_52 :
    forall x8 x4 x5 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                x4 x8) ->
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_active (x5::nil)) x7) ->
       DP_R_xml_0 (algebra.Alg.Term algebra.F.id_add (x4::x5::nil)) 
        (algebra.Alg.Term algebra.F.id_add (x8::x7::nil))
    (* <len(mark(X_)),len(X_)> *)
   | DP_R_xml_0_53 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_mark (x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_len (x2::nil)) 
       (algebra.Alg.Term algebra.F.id_len (x7::nil))
    (* <len(active(X_)),len(X_)> *)
   | DP_R_xml_0_54 :
    forall x2 x7, 
     (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                
       (algebra.Alg.Term algebra.F.id_active (x2::nil)) x7) ->
      DP_R_xml_0 (algebra.Alg.Term algebra.F.id_len (x2::nil)) 
       (algebra.Alg.Term algebra.F.id_len (x7::nil))
 .
 
 Module ddp := dp.MakeDP(algebra.EQT).
 
 
 Lemma R_xml_0_dp_step_spec :
  forall x y, 
   (ddp.dp_step R_xml_0_deep_rew.R_xml_0_rules x y) ->
    exists f,
      exists l1,
        exists l2,
          y = algebra.Alg.Term f l2/\ 
          (closure.refl_trans_clos (closure.one_step_list (algebra.EQT.one_step 
                                                            R_xml_0_deep_rew.R_xml_0_rules)
                                                           ) l1 l2)/\ 
          (ddp.dp R_xml_0_deep_rew.R_xml_0_rules x (algebra.Alg.Term f l1)).
 Proof.
   intros x y H.
   induction H.
   inversion H.
   subst.
   destruct t0.
   refine ((False_ind) _ _).
   refine (R_xml_0_deep_rew.R_xml_0_non_var H0).
   simpl in H|-*.
   exists a.
   exists ((List.map) (algebra.Alg.apply_subst sigma) l).
   exists ((List.map) (algebra.Alg.apply_subst sigma) l).
   repeat (constructor).
   assumption.
   exists f.
   exists l2.
   exists l1.
   constructor.
   constructor.
   constructor.
   constructor.
   rewrite  <- closure.rwr_list_trans_clos_one_step_list.
   assumption.
   assumption.
 Qed.
 
 
 Ltac included_dp_tac H :=
  injection H;clear H;intros;subst;
  repeat (match goal with 
  | H: closure.refl_trans_clos (closure.one_step_list _) (_::_) _ |- _=>           
  let x := fresh "x" in 
  let l := fresh "l" in 
  let h1 := fresh "h" in 
  let h2 := fresh "h" in 
  let h3 := fresh "h" in 
  destruct (@algebra.EQT_ext.one_step_list_star_decompose_cons _ _ _ _  H) as [x [l[h1[h2 h3]]]];clear H;subst
  | H: closure.refl_trans_clos (closure.one_step_list _) nil _ |- _ => 
  rewrite (@algebra.EQT_ext.one_step_list_star_decompose_nil _ _ H) in *;clear H
  end
  );simpl;
  econstructor eassumption
 .
 
 
 Ltac dp_concl_tac h2 h cont_tac 
  t :=
  match t with
    | False => let h' := fresh "a" in 
                (set (h':=t) in *;cont_tac h';
                  repeat (
                  let e := type of h in 
                   (match e with
                      | ?t => unfold t in h|-;
                               (case h;
                                [abstract (clear h;intros h;injection h;
                                            clear h;intros ;subst;
                                            included_dp_tac h2)|
                                clear h;intros h;clear t])
                      | ?t => unfold t in h|-;elim h
                      end
                    )
                  ))
    | or ?a ?b => let cont_tac 
                   h' := let h'' := fresh "a" in 
                          (set (h'':=or a h') in *;cont_tac h'') in 
                   (dp_concl_tac h2 h cont_tac b)
    end
  .
 
 
 Module WF_DP_R_xml_0.
  Inductive DP_R_xml_0_scc_1  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <len(active(X_)),len(X_)> *)
    | DP_R_xml_0_scc_1_0 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_active (x2::nil)) x7) ->
       DP_R_xml_0_scc_1 (algebra.Alg.Term algebra.F.id_len (x2::nil)) 
        (algebra.Alg.Term algebra.F.id_len (x7::nil))
     (* <len(mark(X_)),len(X_)> *)
    | DP_R_xml_0_scc_1_1 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_mark (x2::nil)) x7) ->
       DP_R_xml_0_scc_1 (algebra.Alg.Term algebra.F.id_len (x2::nil)) 
        (algebra.Alg.Term algebra.F.id_len (x7::nil))
  .
  
  
  Module WF_DP_R_xml_0_scc_1.
   Inductive DP_R_xml_0_scc_1_large  :
    algebra.Alg.term ->algebra.Alg.term ->Prop := 
      (* <len(mark(X_)),len(X_)> *)
     | DP_R_xml_0_scc_1_large_0 :
      forall x2 x7, 
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_mark (x2::nil)) x7) ->
        DP_R_xml_0_scc_1_large (algebra.Alg.Term algebra.F.id_len (x2::nil)) 
         (algebra.Alg.Term algebra.F.id_len (x7::nil))
   .
   
   
   Inductive DP_R_xml_0_scc_1_strict  :
    algebra.Alg.term ->algebra.Alg.term ->Prop := 
      (* <len(active(X_)),len(X_)> *)
     | DP_R_xml_0_scc_1_strict_0 :
      forall x2 x7, 
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_active (x2::nil)) x7) ->
        DP_R_xml_0_scc_1_strict (algebra.Alg.Term algebra.F.id_len (x2::nil)) 
         (algebra.Alg.Term algebra.F.id_len (x7::nil))
   .
   
   
   Module WF_DP_R_xml_0_scc_1_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_active (x7:Z) := 1* x7.
    
    Definition P_id_add (x7:Z) (x8:Z) := 2 + 2* x8.
    
    Definition P_id_nil  := 0.
    
    Definition P_id_0  := 1.
    
    Definition P_id_cons (x7:Z) (x8:Z) := 0.
    
    Definition P_id_fst (x7:Z) (x8:Z) := 1 + 2* x7.
    
    Definition P_id_len (x7:Z) := 3.
    
    Definition P_id_s (x7:Z) := 0.
    
    Definition P_id_mark (x7:Z) := 1 + 2* x7.
    
    Definition P_id_from (x7:Z) := 2.
    
    Lemma P_id_active_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_active x8 <= P_id_active 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_add_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_add x8 x10 <= P_id_add 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_fst_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_fst x8 x10 <= P_id_fst 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_len_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_len x8 <= P_id_len 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_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_from_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_from x8 <= P_id_from 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_active_bounded : forall x7, (0 <= x7) ->0 <= P_id_active 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_add_bounded :
     forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_add 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_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_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_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_fst_bounded :
     forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_fst 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_len_bounded : forall x7, (0 <= x7) ->0 <= P_id_len 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_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_from_bounded : forall x7, (0 <= x7) ->0 <= P_id_from 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_active P_id_add P_id_nil P_id_0 P_id_cons 
       P_id_fst P_id_len P_id_s P_id_mark P_id_from.
    
    Lemma measure_equation :
     forall t, 
      measure t = match t with
                    | (algebra.Alg.Term algebra.F.id_active (x7::nil)) =>
                     P_id_active (measure x7)
                    | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                     P_id_add (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                    | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                    | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                     P_id_cons (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                     P_id_fst (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                     P_id_len (measure x7)
                    | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                     P_id_s (measure x7)
                    | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                     P_id_mark (measure x7)
                    | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                     P_id_from (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_active_monotonic;assumption.
      intros ;apply P_id_add_monotonic;assumption.
      intros ;apply P_id_cons_monotonic;assumption.
      intros ;apply P_id_fst_monotonic;assumption.
      intros ;apply P_id_len_monotonic;assumption.
      intros ;apply P_id_s_monotonic;assumption.
      intros ;apply P_id_mark_monotonic;assumption.
      intros ;apply P_id_from_monotonic;assumption.
      intros ;apply P_id_active_bounded;assumption.
      intros ;apply P_id_add_bounded;assumption.
      intros ;apply P_id_nil_bounded;assumption.
      intros ;apply P_id_0_bounded;assumption.
      intros ;apply P_id_cons_bounded;assumption.
      intros ;apply P_id_fst_bounded;assumption.
      intros ;apply P_id_len_bounded;assumption.
      intros ;apply P_id_s_bounded;assumption.
      intros ;apply P_id_mark_bounded;assumption.
      intros ;apply P_id_from_bounded;assumption.
      apply rules_monotonic.
    Qed.
    
    Definition P_id_ADD (x7:Z) (x8:Z) := 0.
    
    Definition P_id_CONS (x7:Z) (x8:Z) := 0.
    
    Definition P_id_ACTIVE (x7:Z) := 0.
    
    Definition P_id_FROM (x7:Z) := 0.
    
    Definition P_id_LEN (x7:Z) := 2* x7.
    
    Definition P_id_FST (x7:Z) (x8:Z) := 0.
    
    Definition P_id_MARK (x7:Z) := 0.
    
    Definition P_id_S (x7:Z) := 0.
    
    Lemma P_id_ADD_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_ADD x8 x10 <= P_id_ADD 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_ACTIVE_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_ACTIVE x8 <= P_id_ACTIVE 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_FROM_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_FROM x8 <= P_id_FROM 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_LEN_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_LEN x8 <= P_id_LEN 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_FST_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_FST x8 x10 <= P_id_FST 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_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.
    
    Definition marked_measure  := 
      InterpZ.marked_measure 0 P_id_active P_id_add P_id_nil P_id_0 
       P_id_cons P_id_fst P_id_len P_id_s P_id_mark P_id_from P_id_ADD 
       P_id_CONS P_id_ACTIVE P_id_FROM P_id_LEN P_id_FST P_id_MARK P_id_S.
    
    Lemma marked_measure_equation :
     forall t, 
      marked_measure t = match t with
                           | (algebra.Alg.Term algebra.F.id_add (x8::
                              x7::nil)) =>
                            P_id_ADD (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_active (x7::nil)) =>
                            P_id_ACTIVE (measure x7)
                           | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                            P_id_FROM (measure x7)
                           | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                            P_id_LEN (measure x7)
                           | (algebra.Alg.Term algebra.F.id_fst (x8::
                              x7::nil)) =>
                            P_id_FST (measure x8) (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)
                           | _ => 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_active_monotonic;assumption.
      intros ;apply P_id_add_monotonic;assumption.
      intros ;apply P_id_cons_monotonic;assumption.
      intros ;apply P_id_fst_monotonic;assumption.
      intros ;apply P_id_len_monotonic;assumption.
      intros ;apply P_id_s_monotonic;assumption.
      intros ;apply P_id_mark_monotonic;assumption.
      intros ;apply P_id_from_monotonic;assumption.
      intros ;apply P_id_active_bounded;assumption.
      intros ;apply P_id_add_bounded;assumption.
      intros ;apply P_id_nil_bounded;assumption.
      intros ;apply P_id_0_bounded;assumption.
      intros ;apply P_id_cons_bounded;assumption.
      intros ;apply P_id_fst_bounded;assumption.
      intros ;apply P_id_len_bounded;assumption.
      intros ;apply P_id_s_bounded;assumption.
      intros ;apply P_id_mark_bounded;assumption.
      intros ;apply P_id_from_bounded;assumption.
      apply rules_monotonic.
      intros ;apply P_id_ADD_monotonic;assumption.
      intros ;apply P_id_CONS_monotonic;assumption.
      intros ;apply P_id_ACTIVE_monotonic;assumption.
      intros ;apply P_id_FROM_monotonic;assumption.
      intros ;apply P_id_LEN_monotonic;assumption.
      intros ;apply P_id_FST_monotonic;assumption.
      intros ;apply P_id_MARK_monotonic;assumption.
      intros ;apply P_id_S_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_1.DP_R_xml_0_scc_1_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_1_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_active (x7:Z) := 1 + 1* x7.
   
   Definition P_id_add (x7:Z) (x8:Z) := 3 + 2* x7 + 2* x8.
   
   Definition P_id_nil  := 2.
   
   Definition P_id_0  := 1.
   
   Definition P_id_cons (x7:Z) (x8:Z) := 1.
   
   Definition P_id_fst (x7:Z) (x8:Z) := 3.
   
   Definition P_id_len (x7:Z) := 1 + 2* x7.
   
   Definition P_id_s (x7:Z) := 2.
   
   Definition P_id_mark (x7:Z) := 2* x7.
   
   Definition P_id_from (x7:Z) := 2.
   
   Lemma P_id_active_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_active x8 <= P_id_active 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_add_monotonic :
    forall x8 x10 x9 x7, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= x8)/\ (x8 <= x7) ->P_id_add x8 x10 <= P_id_add 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, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= 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_fst_monotonic :
    forall x8 x10 x9 x7, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= x8)/\ (x8 <= x7) ->P_id_fst x8 x10 <= P_id_fst 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_len_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_len x8 <= P_id_len 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, (1 <= 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_mark_monotonic :
    forall x8 x7, (1 <= 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_from_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_from x8 <= P_id_from 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_active_bounded : forall x7, (1 <= x7) ->1 <= P_id_active 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_add_bounded :
    forall x8 x7, (1 <= x7) ->(1 <= x8) ->1 <= P_id_add 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_nil_bounded : 1 <= 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_0_bounded : 1 <= 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_cons_bounded :
    forall x8 x7, (1 <= x7) ->(1 <= x8) ->1 <= 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_fst_bounded :
    forall x8 x7, (1 <= x7) ->(1 <= x8) ->1 <= P_id_fst 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_len_bounded : forall x7, (1 <= x7) ->1 <= P_id_len 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, (1 <= x7) ->1 <= 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_mark_bounded : forall x7, (1 <= x7) ->1 <= 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_from_bounded : forall x7, (1 <= x7) ->1 <= P_id_from 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 1 P_id_active P_id_add P_id_nil P_id_0 P_id_cons 
      P_id_fst P_id_len P_id_s P_id_mark P_id_from.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_active (x7::nil)) =>
                    P_id_active (measure x7)
                   | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                    P_id_add (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                   | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                    P_id_fst (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                    P_id_len (measure x7)
                   | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                    P_id_s (measure x7)
                   | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                    P_id_mark (measure x7)
                   | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                    P_id_from (measure x7)
                   | _ => 1
                   end.
   Proof.
     intros t;case t;intros ;apply refl_equal.
   Qed.
   
   Lemma measure_bounded : forall t, 1 <= 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_active_monotonic;assumption.
     intros ;apply P_id_add_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_fst_monotonic;assumption.
     intros ;apply P_id_len_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_from_monotonic;assumption.
     intros ;apply P_id_active_bounded;assumption.
     intros ;apply P_id_add_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_fst_bounded;assumption.
     intros ;apply P_id_len_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_from_bounded;assumption.
     apply rules_monotonic.
   Qed.
   
   Definition P_id_ADD (x7:Z) (x8:Z) := 0.
   
   Definition P_id_CONS (x7:Z) (x8:Z) := 0.
   
   Definition P_id_ACTIVE (x7:Z) := 0.
   
   Definition P_id_FROM (x7:Z) := 0.
   
   Definition P_id_LEN (x7:Z) := 1* x7.
   
   Definition P_id_FST (x7:Z) (x8:Z) := 0.
   
   Definition P_id_MARK (x7:Z) := 0.
   
   Definition P_id_S (x7:Z) := 0.
   
   Lemma P_id_ADD_monotonic :
    forall x8 x10 x9 x7, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= x8)/\ (x8 <= x7) ->P_id_ADD x8 x10 <= P_id_ADD 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, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= 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_ACTIVE_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_ACTIVE x8 <= P_id_ACTIVE 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_FROM_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_FROM x8 <= P_id_FROM 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_LEN_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_LEN x8 <= P_id_LEN 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_FST_monotonic :
    forall x8 x10 x9 x7, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= x8)/\ (x8 <= x7) ->P_id_FST x8 x10 <= P_id_FST 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_MARK_monotonic :
    forall x8 x7, (1 <= 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, (1 <= 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.
   
   Definition marked_measure  := 
     InterpZ.marked_measure 1 P_id_active P_id_add P_id_nil P_id_0 P_id_cons 
      P_id_fst P_id_len P_id_s P_id_mark P_id_from P_id_ADD P_id_CONS 
      P_id_ACTIVE P_id_FROM P_id_LEN P_id_FST P_id_MARK P_id_S.
   
   Lemma marked_measure_equation :
    forall t, 
     marked_measure t = match t with
                          | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                           P_id_ADD (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_active (x7::nil)) =>
                           P_id_ACTIVE (measure x7)
                          | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                           P_id_FROM (measure x7)
                          | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                           P_id_LEN (measure x7)
                          | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                           P_id_FST (measure x8) (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)
                          | _ => 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_active_monotonic;assumption.
     intros ;apply P_id_add_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_fst_monotonic;assumption.
     intros ;apply P_id_len_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_from_monotonic;assumption.
     intros ;apply P_id_active_bounded;assumption.
     intros ;apply P_id_add_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_fst_bounded;assumption.
     intros ;apply P_id_len_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_from_bounded;assumption.
     apply rules_monotonic.
     intros ;apply P_id_ADD_monotonic;assumption.
     intros ;apply P_id_CONS_monotonic;assumption.
     intros ;apply P_id_ACTIVE_monotonic;assumption.
     intros ;apply P_id_FROM_monotonic;assumption.
     intros ;apply P_id_LEN_monotonic;assumption.
     intros ;apply P_id_FST_monotonic;assumption.
     intros ;apply P_id_MARK_monotonic;assumption.
     intros ;apply P_id_S_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 1) (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 1)).
   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_1_strict_in_lt :
    Relation_Definitions.inclusion _ DP_R_xml_0_scc_1_strict lt.
   Proof.
     unfold Relation_Definitions.inclusion, lt in *.
     
     intros a b H;destruct H;
      match goal with
        |  |- (Zwf.Zwf 1) _ (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 1)) 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_1_large_in_le :
    Relation_Definitions.inclusion _ DP_R_xml_0_scc_1_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 1)) 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_1_large  := WF_DP_R_xml_0_scc_1_large.wf.
   
   
   Lemma wf : well_founded WF_DP_R_xml_0.DP_R_xml_0_scc_1.
   Proof.
     intros x.
     apply (well_founded_ind wf_lt).
     clear x.
     intros x.
     pattern x.
     apply (@Acc_ind _ DP_R_xml_0_scc_1_large).
     clear x.
     intros x _ IHx IHx'.
     constructor.
     intros y H.
     
     destruct H;
      (apply IHx';apply DP_R_xml_0_scc_1_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_1_large_in_le;econstructor eassumption])).
     apply wf_DP_R_xml_0_scc_1_large.
   Qed.
  End WF_DP_R_xml_0_scc_1.
  
  Definition wf_DP_R_xml_0_scc_1  := WF_DP_R_xml_0_scc_1.wf.
  
  
  Lemma acc_DP_R_xml_0_scc_1 :
   forall x y, (DP_R_xml_0_scc_1 x y) ->Acc WF_R_xml_0_deep_rew.DP_R_xml_0 x.
  Proof.
    intros x.
    pattern x.
    apply (@Acc_ind _ DP_R_xml_0_scc_1).
    intros x' _ Hrec y h.
    
    inversion h;clear h;subst;
     constructor;intros _y _h;inversion _h;clear _h;subst;
      (eapply Hrec;econstructor eassumption)||
      ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
       (eapply Hrec;econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))).
    apply wf_DP_R_xml_0_scc_1.
  Qed.
  
  
  Inductive DP_R_xml_0_scc_2  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <add(X1_,mark(X2_)),add(X1_,X2_)> *)
    | DP_R_xml_0_scc_2_0 :
     forall x8 x4 x5 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 x4 x8) ->
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_mark (x5::nil)) x7) ->
        DP_R_xml_0_scc_2 (algebra.Alg.Term algebra.F.id_add (x4::x5::nil)) 
         (algebra.Alg.Term algebra.F.id_add (x8::x7::nil))
     (* <add(mark(X1_),X2_),add(X1_,X2_)> *)
    | DP_R_xml_0_scc_2_1 :
     forall x8 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_mark (x4::nil)) x8) ->
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  x5 x7) ->
        DP_R_xml_0_scc_2 (algebra.Alg.Term algebra.F.id_add (x4::x5::nil)) 
         (algebra.Alg.Term algebra.F.id_add (x8::x7::nil))
     (* <add(active(X1_),X2_),add(X1_,X2_)> *)
    | DP_R_xml_0_scc_2_2 :
     forall x8 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_active (x4::nil)) x8) ->
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  x5 x7) ->
        DP_R_xml_0_scc_2 (algebra.Alg.Term algebra.F.id_add (x4::x5::nil)) 
         (algebra.Alg.Term algebra.F.id_add (x8::x7::nil))
     (* <add(X1_,active(X2_)),add(X1_,X2_)> *)
    | DP_R_xml_0_scc_2_3 :
     forall x8 x4 x5 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 x4 x8) ->
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_active (x5::nil)) x7) ->
        DP_R_xml_0_scc_2 (algebra.Alg.Term algebra.F.id_add (x4::x5::nil)) 
         (algebra.Alg.Term algebra.F.id_add (x8::x7::nil))
  .
  
  
  Module WF_DP_R_xml_0_scc_2.
   Inductive DP_R_xml_0_scc_2_large  :
    algebra.Alg.term ->algebra.Alg.term ->Prop := 
      (* <add(active(X1_),X2_),add(X1_,X2_)> *)
     | DP_R_xml_0_scc_2_large_0 :
      forall x8 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_active (x4::nil)) x8) ->
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                   x5 x7) ->
         DP_R_xml_0_scc_2_large (algebra.Alg.Term algebra.F.id_add (x4::
                                 x5::nil)) 
          (algebra.Alg.Term algebra.F.id_add (x8::x7::nil))
      (* <add(X1_,active(X2_)),add(X1_,X2_)> *)
     | DP_R_xml_0_scc_2_large_1 :
      forall x8 x4 x5 x7, 
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  x4 x8) ->
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                   
          (algebra.Alg.Term algebra.F.id_active (x5::nil)) x7) ->
         DP_R_xml_0_scc_2_large (algebra.Alg.Term algebra.F.id_add (x4::
                                 x5::nil)) 
          (algebra.Alg.Term algebra.F.id_add (x8::x7::nil))
   .
   
   
   Inductive DP_R_xml_0_scc_2_strict  :
    algebra.Alg.term ->algebra.Alg.term ->Prop := 
      (* <add(X1_,mark(X2_)),add(X1_,X2_)> *)
     | DP_R_xml_0_scc_2_strict_0 :
      forall x8 x4 x5 x7, 
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  x4 x8) ->
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                   
          (algebra.Alg.Term algebra.F.id_mark (x5::nil)) x7) ->
         DP_R_xml_0_scc_2_strict (algebra.Alg.Term algebra.F.id_add (x4::
                                  x5::nil)) 
          (algebra.Alg.Term algebra.F.id_add (x8::x7::nil))
      (* <add(mark(X1_),X2_),add(X1_,X2_)> *)
     | DP_R_xml_0_scc_2_strict_1 :
      forall x8 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_mark (x4::nil)) x8) ->
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                   x5 x7) ->
         DP_R_xml_0_scc_2_strict (algebra.Alg.Term algebra.F.id_add (x4::
                                  x5::nil)) 
          (algebra.Alg.Term algebra.F.id_add (x8::x7::nil))
   .
   
   
   Module WF_DP_R_xml_0_scc_2_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_active (x7:Z) := 1 + 2* x7.
    
    Definition P_id_add (x7:Z) (x8:Z) := 0.
    
    Definition P_id_nil  := 0.
    
    Definition P_id_0  := 0.
    
    Definition P_id_cons (x7:Z) (x8:Z) := 0.
    
    Definition P_id_fst (x7:Z) (x8:Z) := 0.
    
    Definition P_id_len (x7:Z) := 0.
    
    Definition P_id_s (x7:Z) := 0.
    
    Definition P_id_mark (x7:Z) := 1.
    
    Definition P_id_from (x7:Z) := 0.
    
    Lemma P_id_active_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_active x8 <= P_id_active 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_add_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_add x8 x10 <= P_id_add 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_fst_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_fst x8 x10 <= P_id_fst 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_len_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_len x8 <= P_id_len 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_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_from_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_from x8 <= P_id_from 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_active_bounded : forall x7, (0 <= x7) ->0 <= P_id_active 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_add_bounded :
     forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_add 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_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_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_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_fst_bounded :
     forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_fst 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_len_bounded : forall x7, (0 <= x7) ->0 <= P_id_len 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_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_from_bounded : forall x7, (0 <= x7) ->0 <= P_id_from 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_active P_id_add P_id_nil P_id_0 P_id_cons 
       P_id_fst P_id_len P_id_s P_id_mark P_id_from.
    
    Lemma measure_equation :
     forall t, 
      measure t = match t with
                    | (algebra.Alg.Term algebra.F.id_active (x7::nil)) =>
                     P_id_active (measure x7)
                    | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                     P_id_add (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                    | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                    | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                     P_id_cons (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                     P_id_fst (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                     P_id_len (measure x7)
                    | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                     P_id_s (measure x7)
                    | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                     P_id_mark (measure x7)
                    | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                     P_id_from (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_active_monotonic;assumption.
      intros ;apply P_id_add_monotonic;assumption.
      intros ;apply P_id_cons_monotonic;assumption.
      intros ;apply P_id_fst_monotonic;assumption.
      intros ;apply P_id_len_monotonic;assumption.
      intros ;apply P_id_s_monotonic;assumption.
      intros ;apply P_id_mark_monotonic;assumption.
      intros ;apply P_id_from_monotonic;assumption.
      intros ;apply P_id_active_bounded;assumption.
      intros ;apply P_id_add_bounded;assumption.
      intros ;apply P_id_nil_bounded;assumption.
      intros ;apply P_id_0_bounded;assumption.
      intros ;apply P_id_cons_bounded;assumption.
      intros ;apply P_id_fst_bounded;assumption.
      intros ;apply P_id_len_bounded;assumption.
      intros ;apply P_id_s_bounded;assumption.
      intros ;apply P_id_mark_bounded;assumption.
      intros ;apply P_id_from_bounded;assumption.
      apply rules_monotonic.
    Qed.
    
    Definition P_id_ADD (x7:Z) (x8:Z) := 3* x7 + 2* x8.
    
    Definition P_id_CONS (x7:Z) (x8:Z) := 0.
    
    Definition P_id_ACTIVE (x7:Z) := 0.
    
    Definition P_id_FROM (x7:Z) := 0.
    
    Definition P_id_LEN (x7:Z) := 0.
    
    Definition P_id_FST (x7:Z) (x8:Z) := 0.
    
    Definition P_id_MARK (x7:Z) := 0.
    
    Definition P_id_S (x7:Z) := 0.
    
    Lemma P_id_ADD_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_ADD x8 x10 <= P_id_ADD 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_ACTIVE_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_ACTIVE x8 <= P_id_ACTIVE 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_FROM_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_FROM x8 <= P_id_FROM 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_LEN_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_LEN x8 <= P_id_LEN 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_FST_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_FST x8 x10 <= P_id_FST 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_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.
    
    Definition marked_measure  := 
      InterpZ.marked_measure 0 P_id_active P_id_add P_id_nil P_id_0 
       P_id_cons P_id_fst P_id_len P_id_s P_id_mark P_id_from P_id_ADD 
       P_id_CONS P_id_ACTIVE P_id_FROM P_id_LEN P_id_FST P_id_MARK P_id_S.
    
    Lemma marked_measure_equation :
     forall t, 
      marked_measure t = match t with
                           | (algebra.Alg.Term algebra.F.id_add (x8::
                              x7::nil)) =>
                            P_id_ADD (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_active (x7::nil)) =>
                            P_id_ACTIVE (measure x7)
                           | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                            P_id_FROM (measure x7)
                           | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                            P_id_LEN (measure x7)
                           | (algebra.Alg.Term algebra.F.id_fst (x8::
                              x7::nil)) =>
                            P_id_FST (measure x8) (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)
                           | _ => 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_active_monotonic;assumption.
      intros ;apply P_id_add_monotonic;assumption.
      intros ;apply P_id_cons_monotonic;assumption.
      intros ;apply P_id_fst_monotonic;assumption.
      intros ;apply P_id_len_monotonic;assumption.
      intros ;apply P_id_s_monotonic;assumption.
      intros ;apply P_id_mark_monotonic;assumption.
      intros ;apply P_id_from_monotonic;assumption.
      intros ;apply P_id_active_bounded;assumption.
      intros ;apply P_id_add_bounded;assumption.
      intros ;apply P_id_nil_bounded;assumption.
      intros ;apply P_id_0_bounded;assumption.
      intros ;apply P_id_cons_bounded;assumption.
      intros ;apply P_id_fst_bounded;assumption.
      intros ;apply P_id_len_bounded;assumption.
      intros ;apply P_id_s_bounded;assumption.
      intros ;apply P_id_mark_bounded;assumption.
      intros ;apply P_id_from_bounded;assumption.
      apply rules_monotonic.
      intros ;apply P_id_ADD_monotonic;assumption.
      intros ;apply P_id_CONS_monotonic;assumption.
      intros ;apply P_id_ACTIVE_monotonic;assumption.
      intros ;apply P_id_FROM_monotonic;assumption.
      intros ;apply P_id_LEN_monotonic;assumption.
      intros ;apply P_id_FST_monotonic;assumption.
      intros ;apply P_id_MARK_monotonic;assumption.
      intros ;apply P_id_S_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_2.DP_R_xml_0_scc_2_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_2_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_active (x7:Z) := 1* x7.
   
   Definition P_id_add (x7:Z) (x8:Z) := 3 + 1* x7 + 3* x8.
   
   Definition P_id_nil  := 0.
   
   Definition P_id_0  := 1.
   
   Definition P_id_cons (x7:Z) (x8:Z) := 0.
   
   Definition P_id_fst (x7:Z) (x8:Z) := 1* x7.
   
   Definition P_id_len (x7:Z) := 3.
   
   Definition P_id_s (x7:Z) := 1.
   
   Definition P_id_mark (x7:Z) := 1 + 2* x7.
   
   Definition P_id_from (x7:Z) := 1.
   
   Lemma P_id_active_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_active x8 <= P_id_active 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_add_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_add x8 x10 <= P_id_add 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_fst_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_fst x8 x10 <= P_id_fst 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_len_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_len x8 <= P_id_len 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_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_from_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_from x8 <= P_id_from 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_active_bounded : forall x7, (0 <= x7) ->0 <= P_id_active 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_add_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_add 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_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_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_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_fst_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_fst 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_len_bounded : forall x7, (0 <= x7) ->0 <= P_id_len 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_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_from_bounded : forall x7, (0 <= x7) ->0 <= P_id_from 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_active P_id_add P_id_nil P_id_0 P_id_cons 
      P_id_fst P_id_len P_id_s P_id_mark P_id_from.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_active (x7::nil)) =>
                    P_id_active (measure x7)
                   | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                    P_id_add (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                   | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                    P_id_fst (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                    P_id_len (measure x7)
                   | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                    P_id_s (measure x7)
                   | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                    P_id_mark (measure x7)
                   | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                    P_id_from (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_active_monotonic;assumption.
     intros ;apply P_id_add_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_fst_monotonic;assumption.
     intros ;apply P_id_len_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_from_monotonic;assumption.
     intros ;apply P_id_active_bounded;assumption.
     intros ;apply P_id_add_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_fst_bounded;assumption.
     intros ;apply P_id_len_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_from_bounded;assumption.
     apply rules_monotonic.
   Qed.
   
   Definition P_id_ADD (x7:Z) (x8:Z) := 3* x7 + 3* x8.
   
   Definition P_id_CONS (x7:Z) (x8:Z) := 0.
   
   Definition P_id_ACTIVE (x7:Z) := 0.
   
   Definition P_id_FROM (x7:Z) := 0.
   
   Definition P_id_LEN (x7:Z) := 0.
   
   Definition P_id_FST (x7:Z) (x8:Z) := 0.
   
   Definition P_id_MARK (x7:Z) := 0.
   
   Definition P_id_S (x7:Z) := 0.
   
   Lemma P_id_ADD_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_ADD x8 x10 <= P_id_ADD 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_ACTIVE_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_ACTIVE x8 <= P_id_ACTIVE 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_FROM_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_FROM x8 <= P_id_FROM 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_LEN_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_LEN x8 <= P_id_LEN 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_FST_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_FST x8 x10 <= P_id_FST 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_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.
   
   Definition marked_measure  := 
     InterpZ.marked_measure 0 P_id_active P_id_add P_id_nil P_id_0 P_id_cons 
      P_id_fst P_id_len P_id_s P_id_mark P_id_from P_id_ADD P_id_CONS 
      P_id_ACTIVE P_id_FROM P_id_LEN P_id_FST P_id_MARK P_id_S.
   
   Lemma marked_measure_equation :
    forall t, 
     marked_measure t = match t with
                          | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                           P_id_ADD (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_active (x7::nil)) =>
                           P_id_ACTIVE (measure x7)
                          | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                           P_id_FROM (measure x7)
                          | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                           P_id_LEN (measure x7)
                          | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                           P_id_FST (measure x8) (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)
                          | _ => 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_active_monotonic;assumption.
     intros ;apply P_id_add_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_fst_monotonic;assumption.
     intros ;apply P_id_len_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_from_monotonic;assumption.
     intros ;apply P_id_active_bounded;assumption.
     intros ;apply P_id_add_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_fst_bounded;assumption.
     intros ;apply P_id_len_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_from_bounded;assumption.
     apply rules_monotonic.
     intros ;apply P_id_ADD_monotonic;assumption.
     intros ;apply P_id_CONS_monotonic;assumption.
     intros ;apply P_id_ACTIVE_monotonic;assumption.
     intros ;apply P_id_FROM_monotonic;assumption.
     intros ;apply P_id_LEN_monotonic;assumption.
     intros ;apply P_id_FST_monotonic;assumption.
     intros ;apply P_id_MARK_monotonic;assumption.
     intros ;apply P_id_S_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_2_strict_in_lt :
    Relation_Definitions.inclusion _ DP_R_xml_0_scc_2_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_2_large_in_le :
    Relation_Definitions.inclusion _ DP_R_xml_0_scc_2_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_2_large  := WF_DP_R_xml_0_scc_2_large.wf.
   
   
   Lemma wf : well_founded WF_DP_R_xml_0.DP_R_xml_0_scc_2.
   Proof.
     intros x.
     apply (well_founded_ind wf_lt).
     clear x.
     intros x.
     pattern x.
     apply (@Acc_ind _ DP_R_xml_0_scc_2_large).
     clear x.
     intros x _ IHx IHx'.
     constructor.
     intros y H.
     
     destruct H;
      (apply IHx';apply DP_R_xml_0_scc_2_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_2_large_in_le;econstructor eassumption])).
     apply wf_DP_R_xml_0_scc_2_large.
   Qed.
  End WF_DP_R_xml_0_scc_2.
  
  Definition wf_DP_R_xml_0_scc_2  := WF_DP_R_xml_0_scc_2.wf.
  
  
  Lemma acc_DP_R_xml_0_scc_2 :
   forall x y, (DP_R_xml_0_scc_2 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_2).
    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_2.
  Qed.
  
  
  Inductive DP_R_xml_0_scc_3  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <from(active(X_)),from(X_)> *)
    | DP_R_xml_0_scc_3_0 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_active (x2::nil)) x7) ->
       DP_R_xml_0_scc_3 (algebra.Alg.Term algebra.F.id_from (x2::nil)) 
        (algebra.Alg.Term algebra.F.id_from (x7::nil))
     (* <from(mark(X_)),from(X_)> *)
    | DP_R_xml_0_scc_3_1 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_mark (x2::nil)) x7) ->
       DP_R_xml_0_scc_3 (algebra.Alg.Term algebra.F.id_from (x2::nil)) 
        (algebra.Alg.Term algebra.F.id_from (x7::nil))
  .
  
  
  Module WF_DP_R_xml_0_scc_3.
   Inductive DP_R_xml_0_scc_3_large  :
    algebra.Alg.term ->algebra.Alg.term ->Prop := 
      (* <from(mark(X_)),from(X_)> *)
     | DP_R_xml_0_scc_3_large_0 :
      forall x2 x7, 
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_mark (x2::nil)) x7) ->
        DP_R_xml_0_scc_3_large (algebra.Alg.Term algebra.F.id_from (x2::nil)) 
         (algebra.Alg.Term algebra.F.id_from (x7::nil))
   .
   
   
   Inductive DP_R_xml_0_scc_3_strict  :
    algebra.Alg.term ->algebra.Alg.term ->Prop := 
      (* <from(active(X_)),from(X_)> *)
     | DP_R_xml_0_scc_3_strict_0 :
      forall x2 x7, 
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_active (x2::nil)) x7) ->
        DP_R_xml_0_scc_3_strict (algebra.Alg.Term algebra.F.id_from 
                                 (x2::nil)) 
         (algebra.Alg.Term algebra.F.id_from (x7::nil))
   .
   
   
   Module WF_DP_R_xml_0_scc_3_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_active (x7:Z) := 1* x7.
    
    Definition P_id_add (x7:Z) (x8:Z) := 2 + 2* x8.
    
    Definition P_id_nil  := 0.
    
    Definition P_id_0  := 1.
    
    Definition P_id_cons (x7:Z) (x8:Z) := 0.
    
    Definition P_id_fst (x7:Z) (x8:Z) := 1 + 2* x7.
    
    Definition P_id_len (x7:Z) := 3.
    
    Definition P_id_s (x7:Z) := 0.
    
    Definition P_id_mark (x7:Z) := 1 + 2* x7.
    
    Definition P_id_from (x7:Z) := 2.
    
    Lemma P_id_active_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_active x8 <= P_id_active 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_add_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_add x8 x10 <= P_id_add 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_fst_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_fst x8 x10 <= P_id_fst 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_len_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_len x8 <= P_id_len 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_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_from_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_from x8 <= P_id_from 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_active_bounded : forall x7, (0 <= x7) ->0 <= P_id_active 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_add_bounded :
     forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_add 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_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_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_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_fst_bounded :
     forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_fst 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_len_bounded : forall x7, (0 <= x7) ->0 <= P_id_len 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_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_from_bounded : forall x7, (0 <= x7) ->0 <= P_id_from 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_active P_id_add P_id_nil P_id_0 P_id_cons 
       P_id_fst P_id_len P_id_s P_id_mark P_id_from.
    
    Lemma measure_equation :
     forall t, 
      measure t = match t with
                    | (algebra.Alg.Term algebra.F.id_active (x7::nil)) =>
                     P_id_active (measure x7)
                    | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                     P_id_add (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                    | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                    | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                     P_id_cons (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                     P_id_fst (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                     P_id_len (measure x7)
                    | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                     P_id_s (measure x7)
                    | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                     P_id_mark (measure x7)
                    | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                     P_id_from (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_active_monotonic;assumption.
      intros ;apply P_id_add_monotonic;assumption.
      intros ;apply P_id_cons_monotonic;assumption.
      intros ;apply P_id_fst_monotonic;assumption.
      intros ;apply P_id_len_monotonic;assumption.
      intros ;apply P_id_s_monotonic;assumption.
      intros ;apply P_id_mark_monotonic;assumption.
      intros ;apply P_id_from_monotonic;assumption.
      intros ;apply P_id_active_bounded;assumption.
      intros ;apply P_id_add_bounded;assumption.
      intros ;apply P_id_nil_bounded;assumption.
      intros ;apply P_id_0_bounded;assumption.
      intros ;apply P_id_cons_bounded;assumption.
      intros ;apply P_id_fst_bounded;assumption.
      intros ;apply P_id_len_bounded;assumption.
      intros ;apply P_id_s_bounded;assumption.
      intros ;apply P_id_mark_bounded;assumption.
      intros ;apply P_id_from_bounded;assumption.
      apply rules_monotonic.
    Qed.
    
    Definition P_id_ADD (x7:Z) (x8:Z) := 0.
    
    Definition P_id_CONS (x7:Z) (x8:Z) := 0.
    
    Definition P_id_ACTIVE (x7:Z) := 0.
    
    Definition P_id_FROM (x7:Z) := 2* x7.
    
    Definition P_id_LEN (x7:Z) := 0.
    
    Definition P_id_FST (x7:Z) (x8:Z) := 0.
    
    Definition P_id_MARK (x7:Z) := 0.
    
    Definition P_id_S (x7:Z) := 0.
    
    Lemma P_id_ADD_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_ADD x8 x10 <= P_id_ADD 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_ACTIVE_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_ACTIVE x8 <= P_id_ACTIVE 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_FROM_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_FROM x8 <= P_id_FROM 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_LEN_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_LEN x8 <= P_id_LEN 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_FST_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_FST x8 x10 <= P_id_FST 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_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.
    
    Definition marked_measure  := 
      InterpZ.marked_measure 0 P_id_active P_id_add P_id_nil P_id_0 
       P_id_cons P_id_fst P_id_len P_id_s P_id_mark P_id_from P_id_ADD 
       P_id_CONS P_id_ACTIVE P_id_FROM P_id_LEN P_id_FST P_id_MARK P_id_S.
    
    Lemma marked_measure_equation :
     forall t, 
      marked_measure t = match t with
                           | (algebra.Alg.Term algebra.F.id_add (x8::
                              x7::nil)) =>
                            P_id_ADD (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_active (x7::nil)) =>
                            P_id_ACTIVE (measure x7)
                           | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                            P_id_FROM (measure x7)
                           | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                            P_id_LEN (measure x7)
                           | (algebra.Alg.Term algebra.F.id_fst (x8::
                              x7::nil)) =>
                            P_id_FST (measure x8) (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)
                           | _ => 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_active_monotonic;assumption.
      intros ;apply P_id_add_monotonic;assumption.
      intros ;apply P_id_cons_monotonic;assumption.
      intros ;apply P_id_fst_monotonic;assumption.
      intros ;apply P_id_len_monotonic;assumption.
      intros ;apply P_id_s_monotonic;assumption.
      intros ;apply P_id_mark_monotonic;assumption.
      intros ;apply P_id_from_monotonic;assumption.
      intros ;apply P_id_active_bounded;assumption.
      intros ;apply P_id_add_bounded;assumption.
      intros ;apply P_id_nil_bounded;assumption.
      intros ;apply P_id_0_bounded;assumption.
      intros ;apply P_id_cons_bounded;assumption.
      intros ;apply P_id_fst_bounded;assumption.
      intros ;apply P_id_len_bounded;assumption.
      intros ;apply P_id_s_bounded;assumption.
      intros ;apply P_id_mark_bounded;assumption.
      intros ;apply P_id_from_bounded;assumption.
      apply rules_monotonic.
      intros ;apply P_id_ADD_monotonic;assumption.
      intros ;apply P_id_CONS_monotonic;assumption.
      intros ;apply P_id_ACTIVE_monotonic;assumption.
      intros ;apply P_id_FROM_monotonic;assumption.
      intros ;apply P_id_LEN_monotonic;assumption.
      intros ;apply P_id_FST_monotonic;assumption.
      intros ;apply P_id_MARK_monotonic;assumption.
      intros ;apply P_id_S_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_3.DP_R_xml_0_scc_3_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_3_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_active (x7:Z) := 1 + 1* x7.
   
   Definition P_id_add (x7:Z) (x8:Z) := 3 + 2* x7 + 2* x8.
   
   Definition P_id_nil  := 2.
   
   Definition P_id_0  := 1.
   
   Definition P_id_cons (x7:Z) (x8:Z) := 1.
   
   Definition P_id_fst (x7:Z) (x8:Z) := 3.
   
   Definition P_id_len (x7:Z) := 1 + 2* x7.
   
   Definition P_id_s (x7:Z) := 2.
   
   Definition P_id_mark (x7:Z) := 2* x7.
   
   Definition P_id_from (x7:Z) := 2.
   
   Lemma P_id_active_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_active x8 <= P_id_active 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_add_monotonic :
    forall x8 x10 x9 x7, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= x8)/\ (x8 <= x7) ->P_id_add x8 x10 <= P_id_add 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, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= 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_fst_monotonic :
    forall x8 x10 x9 x7, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= x8)/\ (x8 <= x7) ->P_id_fst x8 x10 <= P_id_fst 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_len_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_len x8 <= P_id_len 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, (1 <= 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_mark_monotonic :
    forall x8 x7, (1 <= 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_from_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_from x8 <= P_id_from 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_active_bounded : forall x7, (1 <= x7) ->1 <= P_id_active 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_add_bounded :
    forall x8 x7, (1 <= x7) ->(1 <= x8) ->1 <= P_id_add 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_nil_bounded : 1 <= 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_0_bounded : 1 <= 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_cons_bounded :
    forall x8 x7, (1 <= x7) ->(1 <= x8) ->1 <= 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_fst_bounded :
    forall x8 x7, (1 <= x7) ->(1 <= x8) ->1 <= P_id_fst 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_len_bounded : forall x7, (1 <= x7) ->1 <= P_id_len 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, (1 <= x7) ->1 <= 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_mark_bounded : forall x7, (1 <= x7) ->1 <= 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_from_bounded : forall x7, (1 <= x7) ->1 <= P_id_from 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 1 P_id_active P_id_add P_id_nil P_id_0 P_id_cons 
      P_id_fst P_id_len P_id_s P_id_mark P_id_from.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_active (x7::nil)) =>
                    P_id_active (measure x7)
                   | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                    P_id_add (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                   | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                    P_id_fst (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                    P_id_len (measure x7)
                   | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                    P_id_s (measure x7)
                   | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                    P_id_mark (measure x7)
                   | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                    P_id_from (measure x7)
                   | _ => 1
                   end.
   Proof.
     intros t;case t;intros ;apply refl_equal.
   Qed.
   
   Lemma measure_bounded : forall t, 1 <= 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_active_monotonic;assumption.
     intros ;apply P_id_add_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_fst_monotonic;assumption.
     intros ;apply P_id_len_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_from_monotonic;assumption.
     intros ;apply P_id_active_bounded;assumption.
     intros ;apply P_id_add_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_fst_bounded;assumption.
     intros ;apply P_id_len_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_from_bounded;assumption.
     apply rules_monotonic.
   Qed.
   
   Definition P_id_ADD (x7:Z) (x8:Z) := 0.
   
   Definition P_id_CONS (x7:Z) (x8:Z) := 0.
   
   Definition P_id_ACTIVE (x7:Z) := 0.
   
   Definition P_id_FROM (x7:Z) := 1* x7.
   
   Definition P_id_LEN (x7:Z) := 0.
   
   Definition P_id_FST (x7:Z) (x8:Z) := 0.
   
   Definition P_id_MARK (x7:Z) := 0.
   
   Definition P_id_S (x7:Z) := 0.
   
   Lemma P_id_ADD_monotonic :
    forall x8 x10 x9 x7, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= x8)/\ (x8 <= x7) ->P_id_ADD x8 x10 <= P_id_ADD 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, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= 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_ACTIVE_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_ACTIVE x8 <= P_id_ACTIVE 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_FROM_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_FROM x8 <= P_id_FROM 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_LEN_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_LEN x8 <= P_id_LEN 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_FST_monotonic :
    forall x8 x10 x9 x7, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= x8)/\ (x8 <= x7) ->P_id_FST x8 x10 <= P_id_FST 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_MARK_monotonic :
    forall x8 x7, (1 <= 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, (1 <= 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.
   
   Definition marked_measure  := 
     InterpZ.marked_measure 1 P_id_active P_id_add P_id_nil P_id_0 P_id_cons 
      P_id_fst P_id_len P_id_s P_id_mark P_id_from P_id_ADD P_id_CONS 
      P_id_ACTIVE P_id_FROM P_id_LEN P_id_FST P_id_MARK P_id_S.
   
   Lemma marked_measure_equation :
    forall t, 
     marked_measure t = match t with
                          | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                           P_id_ADD (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_active (x7::nil)) =>
                           P_id_ACTIVE (measure x7)
                          | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                           P_id_FROM (measure x7)
                          | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                           P_id_LEN (measure x7)
                          | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                           P_id_FST (measure x8) (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)
                          | _ => 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_active_monotonic;assumption.
     intros ;apply P_id_add_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_fst_monotonic;assumption.
     intros ;apply P_id_len_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_from_monotonic;assumption.
     intros ;apply P_id_active_bounded;assumption.
     intros ;apply P_id_add_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_fst_bounded;assumption.
     intros ;apply P_id_len_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_from_bounded;assumption.
     apply rules_monotonic.
     intros ;apply P_id_ADD_monotonic;assumption.
     intros ;apply P_id_CONS_monotonic;assumption.
     intros ;apply P_id_ACTIVE_monotonic;assumption.
     intros ;apply P_id_FROM_monotonic;assumption.
     intros ;apply P_id_LEN_monotonic;assumption.
     intros ;apply P_id_FST_monotonic;assumption.
     intros ;apply P_id_MARK_monotonic;assumption.
     intros ;apply P_id_S_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 1) (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 1)).
   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_3_strict_in_lt :
    Relation_Definitions.inclusion _ DP_R_xml_0_scc_3_strict lt.
   Proof.
     unfold Relation_Definitions.inclusion, lt in *.
     
     intros a b H;destruct H;
      match goal with
        |  |- (Zwf.Zwf 1) _ (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 1)) 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_3_large_in_le :
    Relation_Definitions.inclusion _ DP_R_xml_0_scc_3_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 1)) 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_3_large  := WF_DP_R_xml_0_scc_3_large.wf.
   
   
   Lemma wf : well_founded WF_DP_R_xml_0.DP_R_xml_0_scc_3.
   Proof.
     intros x.
     apply (well_founded_ind wf_lt).
     clear x.
     intros x.
     pattern x.
     apply (@Acc_ind _ DP_R_xml_0_scc_3_large).
     clear x.
     intros x _ IHx IHx'.
     constructor.
     intros y H.
     
     destruct H;
      (apply IHx';apply DP_R_xml_0_scc_3_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_3_large_in_le;econstructor eassumption])).
     apply wf_DP_R_xml_0_scc_3_large.
   Qed.
  End WF_DP_R_xml_0_scc_3.
  
  Definition wf_DP_R_xml_0_scc_3  := WF_DP_R_xml_0_scc_3.wf.
  
  
  Lemma acc_DP_R_xml_0_scc_3 :
   forall x y, (DP_R_xml_0_scc_3 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_3).
    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_3.
  Qed.
  
  
  Inductive DP_R_xml_0_scc_4  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <cons(X1_,mark(X2_)),cons(X1_,X2_)> *)
    | DP_R_xml_0_scc_4_0 :
     forall x8 x4 x5 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 x4 x8) ->
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_mark (x5::nil)) x7) ->
        DP_R_xml_0_scc_4 (algebra.Alg.Term algebra.F.id_cons (x4::x5::nil)) 
         (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil))
     (* <cons(mark(X1_),X2_),cons(X1_,X2_)> *)
    | DP_R_xml_0_scc_4_1 :
     forall x8 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_mark (x4::nil)) x8) ->
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  x5 x7) ->
        DP_R_xml_0_scc_4 (algebra.Alg.Term algebra.F.id_cons (x4::x5::nil)) 
         (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil))
     (* <cons(active(X1_),X2_),cons(X1_,X2_)> *)
    | DP_R_xml_0_scc_4_2 :
     forall x8 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_active (x4::nil)) x8) ->
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  x5 x7) ->
        DP_R_xml_0_scc_4 (algebra.Alg.Term algebra.F.id_cons (x4::x5::nil)) 
         (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil))
     (* <cons(X1_,active(X2_)),cons(X1_,X2_)> *)
    | DP_R_xml_0_scc_4_3 :
     forall x8 x4 x5 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 x4 x8) ->
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_active (x5::nil)) x7) ->
        DP_R_xml_0_scc_4 (algebra.Alg.Term algebra.F.id_cons (x4::x5::nil)) 
         (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil))
  .
  
  
  Module WF_DP_R_xml_0_scc_4.
   Inductive DP_R_xml_0_scc_4_large  :
    algebra.Alg.term ->algebra.Alg.term ->Prop := 
      (* <cons(active(X1_),X2_),cons(X1_,X2_)> *)
     | DP_R_xml_0_scc_4_large_0 :
      forall x8 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_active (x4::nil)) x8) ->
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                   x5 x7) ->
         DP_R_xml_0_scc_4_large (algebra.Alg.Term algebra.F.id_cons (x4::
                                 x5::nil)) 
          (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil))
      (* <cons(X1_,active(X2_)),cons(X1_,X2_)> *)
     | DP_R_xml_0_scc_4_large_1 :
      forall x8 x4 x5 x7, 
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  x4 x8) ->
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                   
          (algebra.Alg.Term algebra.F.id_active (x5::nil)) x7) ->
         DP_R_xml_0_scc_4_large (algebra.Alg.Term algebra.F.id_cons (x4::
                                 x5::nil)) 
          (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil))
   .
   
   
   Inductive DP_R_xml_0_scc_4_strict  :
    algebra.Alg.term ->algebra.Alg.term ->Prop := 
      (* <cons(X1_,mark(X2_)),cons(X1_,X2_)> *)
     | DP_R_xml_0_scc_4_strict_0 :
      forall x8 x4 x5 x7, 
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  x4 x8) ->
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                   
          (algebra.Alg.Term algebra.F.id_mark (x5::nil)) x7) ->
         DP_R_xml_0_scc_4_strict (algebra.Alg.Term algebra.F.id_cons (x4::
                                  x5::nil)) 
          (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil))
      (* <cons(mark(X1_),X2_),cons(X1_,X2_)> *)
     | DP_R_xml_0_scc_4_strict_1 :
      forall x8 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_mark (x4::nil)) x8) ->
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                   x5 x7) ->
         DP_R_xml_0_scc_4_strict (algebra.Alg.Term algebra.F.id_cons (x4::
                                  x5::nil)) 
          (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil))
   .
   
   
   Module WF_DP_R_xml_0_scc_4_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_active (x7:Z) := 1 + 2* x7.
    
    Definition P_id_add (x7:Z) (x8:Z) := 0.
    
    Definition P_id_nil  := 0.
    
    Definition P_id_0  := 0.
    
    Definition P_id_cons (x7:Z) (x8:Z) := 0.
    
    Definition P_id_fst (x7:Z) (x8:Z) := 0.
    
    Definition P_id_len (x7:Z) := 0.
    
    Definition P_id_s (x7:Z) := 0.
    
    Definition P_id_mark (x7:Z) := 1.
    
    Definition P_id_from (x7:Z) := 0.
    
    Lemma P_id_active_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_active x8 <= P_id_active 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_add_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_add x8 x10 <= P_id_add 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_fst_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_fst x8 x10 <= P_id_fst 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_len_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_len x8 <= P_id_len 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_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_from_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_from x8 <= P_id_from 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_active_bounded : forall x7, (0 <= x7) ->0 <= P_id_active 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_add_bounded :
     forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_add 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_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_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_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_fst_bounded :
     forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_fst 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_len_bounded : forall x7, (0 <= x7) ->0 <= P_id_len 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_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_from_bounded : forall x7, (0 <= x7) ->0 <= P_id_from 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_active P_id_add P_id_nil P_id_0 P_id_cons 
       P_id_fst P_id_len P_id_s P_id_mark P_id_from.
    
    Lemma measure_equation :
     forall t, 
      measure t = match t with
                    | (algebra.Alg.Term algebra.F.id_active (x7::nil)) =>
                     P_id_active (measure x7)
                    | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                     P_id_add (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                    | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                    | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                     P_id_cons (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                     P_id_fst (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                     P_id_len (measure x7)
                    | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                     P_id_s (measure x7)
                    | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                     P_id_mark (measure x7)
                    | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                     P_id_from (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_active_monotonic;assumption.
      intros ;apply P_id_add_monotonic;assumption.
      intros ;apply P_id_cons_monotonic;assumption.
      intros ;apply P_id_fst_monotonic;assumption.
      intros ;apply P_id_len_monotonic;assumption.
      intros ;apply P_id_s_monotonic;assumption.
      intros ;apply P_id_mark_monotonic;assumption.
      intros ;apply P_id_from_monotonic;assumption.
      intros ;apply P_id_active_bounded;assumption.
      intros ;apply P_id_add_bounded;assumption.
      intros ;apply P_id_nil_bounded;assumption.
      intros ;apply P_id_0_bounded;assumption.
      intros ;apply P_id_cons_bounded;assumption.
      intros ;apply P_id_fst_bounded;assumption.
      intros ;apply P_id_len_bounded;assumption.
      intros ;apply P_id_s_bounded;assumption.
      intros ;apply P_id_mark_bounded;assumption.
      intros ;apply P_id_from_bounded;assumption.
      apply rules_monotonic.
    Qed.
    
    Definition P_id_ADD (x7:Z) (x8:Z) := 0.
    
    Definition P_id_CONS (x7:Z) (x8:Z) := 3* x7 + 2* x8.
    
    Definition P_id_ACTIVE (x7:Z) := 0.
    
    Definition P_id_FROM (x7:Z) := 0.
    
    Definition P_id_LEN (x7:Z) := 0.
    
    Definition P_id_FST (x7:Z) (x8:Z) := 0.
    
    Definition P_id_MARK (x7:Z) := 0.
    
    Definition P_id_S (x7:Z) := 0.
    
    Lemma P_id_ADD_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_ADD x8 x10 <= P_id_ADD 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_ACTIVE_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_ACTIVE x8 <= P_id_ACTIVE 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_FROM_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_FROM x8 <= P_id_FROM 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_LEN_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_LEN x8 <= P_id_LEN 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_FST_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_FST x8 x10 <= P_id_FST 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_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.
    
    Definition marked_measure  := 
      InterpZ.marked_measure 0 P_id_active P_id_add P_id_nil P_id_0 
       P_id_cons P_id_fst P_id_len P_id_s P_id_mark P_id_from P_id_ADD 
       P_id_CONS P_id_ACTIVE P_id_FROM P_id_LEN P_id_FST P_id_MARK P_id_S.
    
    Lemma marked_measure_equation :
     forall t, 
      marked_measure t = match t with
                           | (algebra.Alg.Term algebra.F.id_add (x8::
                              x7::nil)) =>
                            P_id_ADD (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_active (x7::nil)) =>
                            P_id_ACTIVE (measure x7)
                           | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                            P_id_FROM (measure x7)
                           | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                            P_id_LEN (measure x7)
                           | (algebra.Alg.Term algebra.F.id_fst (x8::
                              x7::nil)) =>
                            P_id_FST (measure x8) (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)
                           | _ => 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_active_monotonic;assumption.
      intros ;apply P_id_add_monotonic;assumption.
      intros ;apply P_id_cons_monotonic;assumption.
      intros ;apply P_id_fst_monotonic;assumption.
      intros ;apply P_id_len_monotonic;assumption.
      intros ;apply P_id_s_monotonic;assumption.
      intros ;apply P_id_mark_monotonic;assumption.
      intros ;apply P_id_from_monotonic;assumption.
      intros ;apply P_id_active_bounded;assumption.
      intros ;apply P_id_add_bounded;assumption.
      intros ;apply P_id_nil_bounded;assumption.
      intros ;apply P_id_0_bounded;assumption.
      intros ;apply P_id_cons_bounded;assumption.
      intros ;apply P_id_fst_bounded;assumption.
      intros ;apply P_id_len_bounded;assumption.
      intros ;apply P_id_s_bounded;assumption.
      intros ;apply P_id_mark_bounded;assumption.
      intros ;apply P_id_from_bounded;assumption.
      apply rules_monotonic.
      intros ;apply P_id_ADD_monotonic;assumption.
      intros ;apply P_id_CONS_monotonic;assumption.
      intros ;apply P_id_ACTIVE_monotonic;assumption.
      intros ;apply P_id_FROM_monotonic;assumption.
      intros ;apply P_id_LEN_monotonic;assumption.
      intros ;apply P_id_FST_monotonic;assumption.
      intros ;apply P_id_MARK_monotonic;assumption.
      intros ;apply P_id_S_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_4.DP_R_xml_0_scc_4_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_4_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_active (x7:Z) := 1* x7.
   
   Definition P_id_add (x7:Z) (x8:Z) := 3 + 1* x7 + 3* x8.
   
   Definition P_id_nil  := 0.
   
   Definition P_id_0  := 1.
   
   Definition P_id_cons (x7:Z) (x8:Z) := 0.
   
   Definition P_id_fst (x7:Z) (x8:Z) := 1* x7.
   
   Definition P_id_len (x7:Z) := 3.
   
   Definition P_id_s (x7:Z) := 1.
   
   Definition P_id_mark (x7:Z) := 1 + 2* x7.
   
   Definition P_id_from (x7:Z) := 1.
   
   Lemma P_id_active_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_active x8 <= P_id_active 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_add_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_add x8 x10 <= P_id_add 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_fst_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_fst x8 x10 <= P_id_fst 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_len_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_len x8 <= P_id_len 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_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_from_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_from x8 <= P_id_from 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_active_bounded : forall x7, (0 <= x7) ->0 <= P_id_active 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_add_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_add 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_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_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_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_fst_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_fst 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_len_bounded : forall x7, (0 <= x7) ->0 <= P_id_len 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_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_from_bounded : forall x7, (0 <= x7) ->0 <= P_id_from 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_active P_id_add P_id_nil P_id_0 P_id_cons 
      P_id_fst P_id_len P_id_s P_id_mark P_id_from.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_active (x7::nil)) =>
                    P_id_active (measure x7)
                   | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                    P_id_add (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                   | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                    P_id_fst (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                    P_id_len (measure x7)
                   | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                    P_id_s (measure x7)
                   | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                    P_id_mark (measure x7)
                   | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                    P_id_from (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_active_monotonic;assumption.
     intros ;apply P_id_add_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_fst_monotonic;assumption.
     intros ;apply P_id_len_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_from_monotonic;assumption.
     intros ;apply P_id_active_bounded;assumption.
     intros ;apply P_id_add_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_fst_bounded;assumption.
     intros ;apply P_id_len_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_from_bounded;assumption.
     apply rules_monotonic.
   Qed.
   
   Definition P_id_ADD (x7:Z) (x8:Z) := 0.
   
   Definition P_id_CONS (x7:Z) (x8:Z) := 3* x7 + 3* x8.
   
   Definition P_id_ACTIVE (x7:Z) := 0.
   
   Definition P_id_FROM (x7:Z) := 0.
   
   Definition P_id_LEN (x7:Z) := 0.
   
   Definition P_id_FST (x7:Z) (x8:Z) := 0.
   
   Definition P_id_MARK (x7:Z) := 0.
   
   Definition P_id_S (x7:Z) := 0.
   
   Lemma P_id_ADD_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_ADD x8 x10 <= P_id_ADD 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_ACTIVE_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_ACTIVE x8 <= P_id_ACTIVE 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_FROM_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_FROM x8 <= P_id_FROM 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_LEN_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_LEN x8 <= P_id_LEN 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_FST_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_FST x8 x10 <= P_id_FST 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_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.
   
   Definition marked_measure  := 
     InterpZ.marked_measure 0 P_id_active P_id_add P_id_nil P_id_0 P_id_cons 
      P_id_fst P_id_len P_id_s P_id_mark P_id_from P_id_ADD P_id_CONS 
      P_id_ACTIVE P_id_FROM P_id_LEN P_id_FST P_id_MARK P_id_S.
   
   Lemma marked_measure_equation :
    forall t, 
     marked_measure t = match t with
                          | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                           P_id_ADD (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_active (x7::nil)) =>
                           P_id_ACTIVE (measure x7)
                          | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                           P_id_FROM (measure x7)
                          | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                           P_id_LEN (measure x7)
                          | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                           P_id_FST (measure x8) (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)
                          | _ => 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_active_monotonic;assumption.
     intros ;apply P_id_add_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_fst_monotonic;assumption.
     intros ;apply P_id_len_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_from_monotonic;assumption.
     intros ;apply P_id_active_bounded;assumption.
     intros ;apply P_id_add_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_fst_bounded;assumption.
     intros ;apply P_id_len_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_from_bounded;assumption.
     apply rules_monotonic.
     intros ;apply P_id_ADD_monotonic;assumption.
     intros ;apply P_id_CONS_monotonic;assumption.
     intros ;apply P_id_ACTIVE_monotonic;assumption.
     intros ;apply P_id_FROM_monotonic;assumption.
     intros ;apply P_id_LEN_monotonic;assumption.
     intros ;apply P_id_FST_monotonic;assumption.
     intros ;apply P_id_MARK_monotonic;assumption.
     intros ;apply P_id_S_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_4_strict_in_lt :
    Relation_Definitions.inclusion _ DP_R_xml_0_scc_4_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_4_large_in_le :
    Relation_Definitions.inclusion _ DP_R_xml_0_scc_4_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_4_large  := WF_DP_R_xml_0_scc_4_large.wf.
   
   
   Lemma wf : well_founded WF_DP_R_xml_0.DP_R_xml_0_scc_4.
   Proof.
     intros x.
     apply (well_founded_ind wf_lt).
     clear x.
     intros x.
     pattern x.
     apply (@Acc_ind _ DP_R_xml_0_scc_4_large).
     clear x.
     intros x _ IHx IHx'.
     constructor.
     intros y H.
     
     destruct H;
      (apply IHx';apply DP_R_xml_0_scc_4_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_4_large_in_le;econstructor eassumption])).
     apply wf_DP_R_xml_0_scc_4_large.
   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_scc_5  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <s(active(X_)),s(X_)> *)
    | DP_R_xml_0_scc_5_0 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_active (x2::nil)) x7) ->
       DP_R_xml_0_scc_5 (algebra.Alg.Term algebra.F.id_s (x2::nil)) 
        (algebra.Alg.Term algebra.F.id_s (x7::nil))
     (* <s(mark(X_)),s(X_)> *)
    | DP_R_xml_0_scc_5_1 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_mark (x2::nil)) x7) ->
       DP_R_xml_0_scc_5 (algebra.Alg.Term algebra.F.id_s (x2::nil)) 
        (algebra.Alg.Term algebra.F.id_s (x7::nil))
  .
  
  
  Module WF_DP_R_xml_0_scc_5.
   Inductive DP_R_xml_0_scc_5_large  :
    algebra.Alg.term ->algebra.Alg.term ->Prop := 
      (* <s(mark(X_)),s(X_)> *)
     | DP_R_xml_0_scc_5_large_0 :
      forall x2 x7, 
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_mark (x2::nil)) x7) ->
        DP_R_xml_0_scc_5_large (algebra.Alg.Term algebra.F.id_s (x2::nil)) 
         (algebra.Alg.Term algebra.F.id_s (x7::nil))
   .
   
   
   Inductive DP_R_xml_0_scc_5_strict  :
    algebra.Alg.term ->algebra.Alg.term ->Prop := 
      (* <s(active(X_)),s(X_)> *)
     | DP_R_xml_0_scc_5_strict_0 :
      forall x2 x7, 
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_active (x2::nil)) x7) ->
        DP_R_xml_0_scc_5_strict (algebra.Alg.Term algebra.F.id_s (x2::nil)) 
         (algebra.Alg.Term algebra.F.id_s (x7::nil))
   .
   
   
   Module WF_DP_R_xml_0_scc_5_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_active (x7:Z) := 1* x7.
    
    Definition P_id_add (x7:Z) (x8:Z) := 2 + 2* x8.
    
    Definition P_id_nil  := 0.
    
    Definition P_id_0  := 1.
    
    Definition P_id_cons (x7:Z) (x8:Z) := 0.
    
    Definition P_id_fst (x7:Z) (x8:Z) := 1 + 2* x7.
    
    Definition P_id_len (x7:Z) := 3.
    
    Definition P_id_s (x7:Z) := 0.
    
    Definition P_id_mark (x7:Z) := 1 + 2* x7.
    
    Definition P_id_from (x7:Z) := 2.
    
    Lemma P_id_active_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_active x8 <= P_id_active 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_add_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_add x8 x10 <= P_id_add 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_fst_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_fst x8 x10 <= P_id_fst 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_len_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_len x8 <= P_id_len 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_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_from_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_from x8 <= P_id_from 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_active_bounded : forall x7, (0 <= x7) ->0 <= P_id_active 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_add_bounded :
     forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_add 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_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_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_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_fst_bounded :
     forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_fst 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_len_bounded : forall x7, (0 <= x7) ->0 <= P_id_len 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_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_from_bounded : forall x7, (0 <= x7) ->0 <= P_id_from 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_active P_id_add P_id_nil P_id_0 P_id_cons 
       P_id_fst P_id_len P_id_s P_id_mark P_id_from.
    
    Lemma measure_equation :
     forall t, 
      measure t = match t with
                    | (algebra.Alg.Term algebra.F.id_active (x7::nil)) =>
                     P_id_active (measure x7)
                    | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                     P_id_add (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                    | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                    | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                     P_id_cons (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                     P_id_fst (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                     P_id_len (measure x7)
                    | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                     P_id_s (measure x7)
                    | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                     P_id_mark (measure x7)
                    | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                     P_id_from (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_active_monotonic;assumption.
      intros ;apply P_id_add_monotonic;assumption.
      intros ;apply P_id_cons_monotonic;assumption.
      intros ;apply P_id_fst_monotonic;assumption.
      intros ;apply P_id_len_monotonic;assumption.
      intros ;apply P_id_s_monotonic;assumption.
      intros ;apply P_id_mark_monotonic;assumption.
      intros ;apply P_id_from_monotonic;assumption.
      intros ;apply P_id_active_bounded;assumption.
      intros ;apply P_id_add_bounded;assumption.
      intros ;apply P_id_nil_bounded;assumption.
      intros ;apply P_id_0_bounded;assumption.
      intros ;apply P_id_cons_bounded;assumption.
      intros ;apply P_id_fst_bounded;assumption.
      intros ;apply P_id_len_bounded;assumption.
      intros ;apply P_id_s_bounded;assumption.
      intros ;apply P_id_mark_bounded;assumption.
      intros ;apply P_id_from_bounded;assumption.
      apply rules_monotonic.
    Qed.
    
    Definition P_id_ADD (x7:Z) (x8:Z) := 0.
    
    Definition P_id_CONS (x7:Z) (x8:Z) := 0.
    
    Definition P_id_ACTIVE (x7:Z) := 0.
    
    Definition P_id_FROM (x7:Z) := 0.
    
    Definition P_id_LEN (x7:Z) := 0.
    
    Definition P_id_FST (x7:Z) (x8:Z) := 0.
    
    Definition P_id_MARK (x7:Z) := 0.
    
    Definition P_id_S (x7:Z) := 2* x7.
    
    Lemma P_id_ADD_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_ADD x8 x10 <= P_id_ADD 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_ACTIVE_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_ACTIVE x8 <= P_id_ACTIVE 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_FROM_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_FROM x8 <= P_id_FROM 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_LEN_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_LEN x8 <= P_id_LEN 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_FST_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_FST x8 x10 <= P_id_FST 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_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.
    
    Definition marked_measure  := 
      InterpZ.marked_measure 0 P_id_active P_id_add P_id_nil P_id_0 
       P_id_cons P_id_fst P_id_len P_id_s P_id_mark P_id_from P_id_ADD 
       P_id_CONS P_id_ACTIVE P_id_FROM P_id_LEN P_id_FST P_id_MARK P_id_S.
    
    Lemma marked_measure_equation :
     forall t, 
      marked_measure t = match t with
                           | (algebra.Alg.Term algebra.F.id_add (x8::
                              x7::nil)) =>
                            P_id_ADD (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_active (x7::nil)) =>
                            P_id_ACTIVE (measure x7)
                           | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                            P_id_FROM (measure x7)
                           | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                            P_id_LEN (measure x7)
                           | (algebra.Alg.Term algebra.F.id_fst (x8::
                              x7::nil)) =>
                            P_id_FST (measure x8) (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)
                           | _ => 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_active_monotonic;assumption.
      intros ;apply P_id_add_monotonic;assumption.
      intros ;apply P_id_cons_monotonic;assumption.
      intros ;apply P_id_fst_monotonic;assumption.
      intros ;apply P_id_len_monotonic;assumption.
      intros ;apply P_id_s_monotonic;assumption.
      intros ;apply P_id_mark_monotonic;assumption.
      intros ;apply P_id_from_monotonic;assumption.
      intros ;apply P_id_active_bounded;assumption.
      intros ;apply P_id_add_bounded;assumption.
      intros ;apply P_id_nil_bounded;assumption.
      intros ;apply P_id_0_bounded;assumption.
      intros ;apply P_id_cons_bounded;assumption.
      intros ;apply P_id_fst_bounded;assumption.
      intros ;apply P_id_len_bounded;assumption.
      intros ;apply P_id_s_bounded;assumption.
      intros ;apply P_id_mark_bounded;assumption.
      intros ;apply P_id_from_bounded;assumption.
      apply rules_monotonic.
      intros ;apply P_id_ADD_monotonic;assumption.
      intros ;apply P_id_CONS_monotonic;assumption.
      intros ;apply P_id_ACTIVE_monotonic;assumption.
      intros ;apply P_id_FROM_monotonic;assumption.
      intros ;apply P_id_LEN_monotonic;assumption.
      intros ;apply P_id_FST_monotonic;assumption.
      intros ;apply P_id_MARK_monotonic;assumption.
      intros ;apply P_id_S_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_5.DP_R_xml_0_scc_5_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_5_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_active (x7:Z) := 1 + 1* x7.
   
   Definition P_id_add (x7:Z) (x8:Z) := 3 + 2* x7 + 2* x8.
   
   Definition P_id_nil  := 2.
   
   Definition P_id_0  := 1.
   
   Definition P_id_cons (x7:Z) (x8:Z) := 1.
   
   Definition P_id_fst (x7:Z) (x8:Z) := 3.
   
   Definition P_id_len (x7:Z) := 1 + 2* x7.
   
   Definition P_id_s (x7:Z) := 2.
   
   Definition P_id_mark (x7:Z) := 2* x7.
   
   Definition P_id_from (x7:Z) := 2.
   
   Lemma P_id_active_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_active x8 <= P_id_active 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_add_monotonic :
    forall x8 x10 x9 x7, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= x8)/\ (x8 <= x7) ->P_id_add x8 x10 <= P_id_add 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, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= 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_fst_monotonic :
    forall x8 x10 x9 x7, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= x8)/\ (x8 <= x7) ->P_id_fst x8 x10 <= P_id_fst 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_len_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_len x8 <= P_id_len 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, (1 <= 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_mark_monotonic :
    forall x8 x7, (1 <= 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_from_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_from x8 <= P_id_from 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_active_bounded : forall x7, (1 <= x7) ->1 <= P_id_active 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_add_bounded :
    forall x8 x7, (1 <= x7) ->(1 <= x8) ->1 <= P_id_add 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_nil_bounded : 1 <= 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_0_bounded : 1 <= 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_cons_bounded :
    forall x8 x7, (1 <= x7) ->(1 <= x8) ->1 <= 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_fst_bounded :
    forall x8 x7, (1 <= x7) ->(1 <= x8) ->1 <= P_id_fst 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_len_bounded : forall x7, (1 <= x7) ->1 <= P_id_len 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, (1 <= x7) ->1 <= 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_mark_bounded : forall x7, (1 <= x7) ->1 <= 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_from_bounded : forall x7, (1 <= x7) ->1 <= P_id_from 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 1 P_id_active P_id_add P_id_nil P_id_0 P_id_cons 
      P_id_fst P_id_len P_id_s P_id_mark P_id_from.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_active (x7::nil)) =>
                    P_id_active (measure x7)
                   | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                    P_id_add (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                   | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                    P_id_fst (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                    P_id_len (measure x7)
                   | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                    P_id_s (measure x7)
                   | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                    P_id_mark (measure x7)
                   | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                    P_id_from (measure x7)
                   | _ => 1
                   end.
   Proof.
     intros t;case t;intros ;apply refl_equal.
   Qed.
   
   Lemma measure_bounded : forall t, 1 <= 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_active_monotonic;assumption.
     intros ;apply P_id_add_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_fst_monotonic;assumption.
     intros ;apply P_id_len_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_from_monotonic;assumption.
     intros ;apply P_id_active_bounded;assumption.
     intros ;apply P_id_add_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_fst_bounded;assumption.
     intros ;apply P_id_len_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_from_bounded;assumption.
     apply rules_monotonic.
   Qed.
   
   Definition P_id_ADD (x7:Z) (x8:Z) := 0.
   
   Definition P_id_CONS (x7:Z) (x8:Z) := 0.
   
   Definition P_id_ACTIVE (x7:Z) := 0.
   
   Definition P_id_FROM (x7:Z) := 0.
   
   Definition P_id_LEN (x7:Z) := 0.
   
   Definition P_id_FST (x7:Z) (x8:Z) := 0.
   
   Definition P_id_MARK (x7:Z) := 0.
   
   Definition P_id_S (x7:Z) := 1* x7.
   
   Lemma P_id_ADD_monotonic :
    forall x8 x10 x9 x7, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= x8)/\ (x8 <= x7) ->P_id_ADD x8 x10 <= P_id_ADD 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, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= 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_ACTIVE_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_ACTIVE x8 <= P_id_ACTIVE 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_FROM_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_FROM x8 <= P_id_FROM 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_LEN_monotonic :
    forall x8 x7, (1 <= x8)/\ (x8 <= x7) ->P_id_LEN x8 <= P_id_LEN 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_FST_monotonic :
    forall x8 x10 x9 x7, 
     (1 <= x10)/\ (x10 <= x9) ->
      (1 <= x8)/\ (x8 <= x7) ->P_id_FST x8 x10 <= P_id_FST 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_MARK_monotonic :
    forall x8 x7, (1 <= 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, (1 <= 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.
   
   Definition marked_measure  := 
     InterpZ.marked_measure 1 P_id_active P_id_add P_id_nil P_id_0 P_id_cons 
      P_id_fst P_id_len P_id_s P_id_mark P_id_from P_id_ADD P_id_CONS 
      P_id_ACTIVE P_id_FROM P_id_LEN P_id_FST P_id_MARK P_id_S.
   
   Lemma marked_measure_equation :
    forall t, 
     marked_measure t = match t with
                          | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                           P_id_ADD (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_active (x7::nil)) =>
                           P_id_ACTIVE (measure x7)
                          | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                           P_id_FROM (measure x7)
                          | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                           P_id_LEN (measure x7)
                          | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                           P_id_FST (measure x8) (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)
                          | _ => 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_active_monotonic;assumption.
     intros ;apply P_id_add_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_fst_monotonic;assumption.
     intros ;apply P_id_len_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_from_monotonic;assumption.
     intros ;apply P_id_active_bounded;assumption.
     intros ;apply P_id_add_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_fst_bounded;assumption.
     intros ;apply P_id_len_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_from_bounded;assumption.
     apply rules_monotonic.
     intros ;apply P_id_ADD_monotonic;assumption.
     intros ;apply P_id_CONS_monotonic;assumption.
     intros ;apply P_id_ACTIVE_monotonic;assumption.
     intros ;apply P_id_FROM_monotonic;assumption.
     intros ;apply P_id_LEN_monotonic;assumption.
     intros ;apply P_id_FST_monotonic;assumption.
     intros ;apply P_id_MARK_monotonic;assumption.
     intros ;apply P_id_S_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 1) (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 1)).
   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_5_strict_in_lt :
    Relation_Definitions.inclusion _ DP_R_xml_0_scc_5_strict lt.
   Proof.
     unfold Relation_Definitions.inclusion, lt in *.
     
     intros a b H;destruct H;
      match goal with
        |  |- (Zwf.Zwf 1) _ (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 1)) 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_5_large_in_le :
    Relation_Definitions.inclusion _ DP_R_xml_0_scc_5_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 1)) 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_5_large  := WF_DP_R_xml_0_scc_5_large.wf.
   
   
   Lemma wf : well_founded WF_DP_R_xml_0.DP_R_xml_0_scc_5.
   Proof.
     intros x.
     apply (well_founded_ind wf_lt).
     clear x.
     intros x.
     pattern x.
     apply (@Acc_ind _ DP_R_xml_0_scc_5_large).
     clear x.
     intros x _ IHx IHx'.
     constructor.
     intros y H.
     
     destruct H;
      (apply IHx';apply DP_R_xml_0_scc_5_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_5_large_in_le;econstructor eassumption])).
     apply wf_DP_R_xml_0_scc_5_large.
   Qed.
  End WF_DP_R_xml_0_scc_5.
  
  Definition wf_DP_R_xml_0_scc_5  := WF_DP_R_xml_0_scc_5.wf.
  
  
  Lemma acc_DP_R_xml_0_scc_5 :
   forall x y, (DP_R_xml_0_scc_5 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_5).
    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_5.
  Qed.
  
  
  Inductive DP_R_xml_0_scc_6  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <fst(X1_,mark(X2_)),fst(X1_,X2_)> *)
    | DP_R_xml_0_scc_6_0 :
     forall x8 x4 x5 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 x4 x8) ->
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_mark (x5::nil)) x7) ->
        DP_R_xml_0_scc_6 (algebra.Alg.Term algebra.F.id_fst (x4::x5::nil)) 
         (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil))
     (* <fst(mark(X1_),X2_),fst(X1_,X2_)> *)
    | DP_R_xml_0_scc_6_1 :
     forall x8 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_mark (x4::nil)) x8) ->
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  x5 x7) ->
        DP_R_xml_0_scc_6 (algebra.Alg.Term algebra.F.id_fst (x4::x5::nil)) 
         (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil))
     (* <fst(active(X1_),X2_),fst(X1_,X2_)> *)
    | DP_R_xml_0_scc_6_2 :
     forall x8 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_active (x4::nil)) x8) ->
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  x5 x7) ->
        DP_R_xml_0_scc_6 (algebra.Alg.Term algebra.F.id_fst (x4::x5::nil)) 
         (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil))
     (* <fst(X1_,active(X2_)),fst(X1_,X2_)> *)
    | DP_R_xml_0_scc_6_3 :
     forall x8 x4 x5 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 x4 x8) ->
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  
         (algebra.Alg.Term algebra.F.id_active (x5::nil)) x7) ->
        DP_R_xml_0_scc_6 (algebra.Alg.Term algebra.F.id_fst (x4::x5::nil)) 
         (algebra.Alg.Term algebra.F.id_fst (x8::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 := 
      (* <fst(active(X1_),X2_),fst(X1_,X2_)> *)
     | DP_R_xml_0_scc_6_large_0 :
      forall x8 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_active (x4::nil)) x8) ->
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                   x5 x7) ->
         DP_R_xml_0_scc_6_large (algebra.Alg.Term algebra.F.id_fst (x4::
                                 x5::nil)) 
          (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil))
      (* <fst(X1_,active(X2_)),fst(X1_,X2_)> *)
     | DP_R_xml_0_scc_6_large_1 :
      forall x8 x4 x5 x7, 
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  x4 x8) ->
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                   
          (algebra.Alg.Term algebra.F.id_active (x5::nil)) x7) ->
         DP_R_xml_0_scc_6_large (algebra.Alg.Term algebra.F.id_fst (x4::
                                 x5::nil)) 
          (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil))
   .
   
   
   Inductive DP_R_xml_0_scc_6_strict  :
    algebra.Alg.term ->algebra.Alg.term ->Prop := 
      (* <fst(X1_,mark(X2_)),fst(X1_,X2_)> *)
     | DP_R_xml_0_scc_6_strict_0 :
      forall x8 x4 x5 x7, 
       (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                  x4 x8) ->
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                   
          (algebra.Alg.Term algebra.F.id_mark (x5::nil)) x7) ->
         DP_R_xml_0_scc_6_strict (algebra.Alg.Term algebra.F.id_fst (x4::
                                  x5::nil)) 
          (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil))
      (* <fst(mark(X1_),X2_),fst(X1_,X2_)> *)
     | DP_R_xml_0_scc_6_strict_1 :
      forall x8 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_mark (x4::nil)) x8) ->
        (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                   x5 x7) ->
         DP_R_xml_0_scc_6_strict (algebra.Alg.Term algebra.F.id_fst (x4::
                                  x5::nil)) 
          (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil))
   .
   
   
   Module 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_active (x7:Z) := 1 + 2* x7.
    
    Definition P_id_add (x7:Z) (x8:Z) := 0.
    
    Definition P_id_nil  := 0.
    
    Definition P_id_0  := 0.
    
    Definition P_id_cons (x7:Z) (x8:Z) := 0.
    
    Definition P_id_fst (x7:Z) (x8:Z) := 0.
    
    Definition P_id_len (x7:Z) := 0.
    
    Definition P_id_s (x7:Z) := 0.
    
    Definition P_id_mark (x7:Z) := 1.
    
    Definition P_id_from (x7:Z) := 0.
    
    Lemma P_id_active_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_active x8 <= P_id_active 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_add_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_add x8 x10 <= P_id_add 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_fst_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_fst x8 x10 <= P_id_fst 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_len_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_len x8 <= P_id_len 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_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_from_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_from x8 <= P_id_from 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_active_bounded : forall x7, (0 <= x7) ->0 <= P_id_active 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_add_bounded :
     forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_add 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_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_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_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_fst_bounded :
     forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_fst 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_len_bounded : forall x7, (0 <= x7) ->0 <= P_id_len 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_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_from_bounded : forall x7, (0 <= x7) ->0 <= P_id_from 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_active P_id_add P_id_nil P_id_0 P_id_cons 
       P_id_fst P_id_len P_id_s P_id_mark P_id_from.
    
    Lemma measure_equation :
     forall t, 
      measure t = match t with
                    | (algebra.Alg.Term algebra.F.id_active (x7::nil)) =>
                     P_id_active (measure x7)
                    | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                     P_id_add (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                    | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                    | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                     P_id_cons (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                     P_id_fst (measure x8) (measure x7)
                    | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                     P_id_len (measure x7)
                    | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                     P_id_s (measure x7)
                    | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                     P_id_mark (measure x7)
                    | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                     P_id_from (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_active_monotonic;assumption.
      intros ;apply P_id_add_monotonic;assumption.
      intros ;apply P_id_cons_monotonic;assumption.
      intros ;apply P_id_fst_monotonic;assumption.
      intros ;apply P_id_len_monotonic;assumption.
      intros ;apply P_id_s_monotonic;assumption.
      intros ;apply P_id_mark_monotonic;assumption.
      intros ;apply P_id_from_monotonic;assumption.
      intros ;apply P_id_active_bounded;assumption.
      intros ;apply P_id_add_bounded;assumption.
      intros ;apply P_id_nil_bounded;assumption.
      intros ;apply P_id_0_bounded;assumption.
      intros ;apply P_id_cons_bounded;assumption.
      intros ;apply P_id_fst_bounded;assumption.
      intros ;apply P_id_len_bounded;assumption.
      intros ;apply P_id_s_bounded;assumption.
      intros ;apply P_id_mark_bounded;assumption.
      intros ;apply P_id_from_bounded;assumption.
      apply rules_monotonic.
    Qed.
    
    Definition P_id_ADD (x7:Z) (x8:Z) := 0.
    
    Definition P_id_CONS (x7:Z) (x8:Z) := 0.
    
    Definition P_id_ACTIVE (x7:Z) := 0.
    
    Definition P_id_FROM (x7:Z) := 0.
    
    Definition P_id_LEN (x7:Z) := 0.
    
    Definition P_id_FST (x7:Z) (x8:Z) := 3* x7 + 2* x8.
    
    Definition P_id_MARK (x7:Z) := 0.
    
    Definition P_id_S (x7:Z) := 0.
    
    Lemma P_id_ADD_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_ADD x8 x10 <= P_id_ADD 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_ACTIVE_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_ACTIVE x8 <= P_id_ACTIVE 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_FROM_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_FROM x8 <= P_id_FROM 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_LEN_monotonic :
     forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_LEN x8 <= P_id_LEN 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_FST_monotonic :
     forall x8 x10 x9 x7, 
      (0 <= x10)/\ (x10 <= x9) ->
       (0 <= x8)/\ (x8 <= x7) ->P_id_FST x8 x10 <= P_id_FST 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_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.
    
    Definition marked_measure  := 
      InterpZ.marked_measure 0 P_id_active P_id_add P_id_nil P_id_0 
       P_id_cons P_id_fst P_id_len P_id_s P_id_mark P_id_from P_id_ADD 
       P_id_CONS P_id_ACTIVE P_id_FROM P_id_LEN P_id_FST P_id_MARK P_id_S.
    
    Lemma marked_measure_equation :
     forall t, 
      marked_measure t = match t with
                           | (algebra.Alg.Term algebra.F.id_add (x8::
                              x7::nil)) =>
                            P_id_ADD (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_active (x7::nil)) =>
                            P_id_ACTIVE (measure x7)
                           | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                            P_id_FROM (measure x7)
                           | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                            P_id_LEN (measure x7)
                           | (algebra.Alg.Term algebra.F.id_fst (x8::
                              x7::nil)) =>
                            P_id_FST (measure x8) (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)
                           | _ => 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_active_monotonic;assumption.
      intros ;apply P_id_add_monotonic;assumption.
      intros ;apply P_id_cons_monotonic;assumption.
      intros ;apply P_id_fst_monotonic;assumption.
      intros ;apply P_id_len_monotonic;assumption.
      intros ;apply P_id_s_monotonic;assumption.
      intros ;apply P_id_mark_monotonic;assumption.
      intros ;apply P_id_from_monotonic;assumption.
      intros ;apply P_id_active_bounded;assumption.
      intros ;apply P_id_add_bounded;assumption.
      intros ;apply P_id_nil_bounded;assumption.
      intros ;apply P_id_0_bounded;assumption.
      intros ;apply P_id_cons_bounded;assumption.
      intros ;apply P_id_fst_bounded;assumption.
      intros ;apply P_id_len_bounded;assumption.
      intros ;apply P_id_s_bounded;assumption.
      intros ;apply P_id_mark_bounded;assumption.
      intros ;apply P_id_from_bounded;assumption.
      apply rules_monotonic.
      intros ;apply P_id_ADD_monotonic;assumption.
      intros ;apply P_id_CONS_monotonic;assumption.
      intros ;apply P_id_ACTIVE_monotonic;assumption.
      intros ;apply P_id_FROM_monotonic;assumption.
      intros ;apply P_id_LEN_monotonic;assumption.
      intros ;apply P_id_FST_monotonic;assumption.
      intros ;apply P_id_MARK_monotonic;assumption.
      intros ;apply P_id_S_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.DP_R_xml_0_scc_6_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.
   
   Open Scope Z_scope.
   
   Import ring_extention.
   
   Notation Local "a <= b" := (Zle a b).
   
   Notation Local "a < b" := (Zlt a b).
   
   Definition P_id_active (x7:Z) := 1* x7.
   
   Definition P_id_add (x7:Z) (x8:Z) := 3 + 1* x7 + 3* x8.
   
   Definition P_id_nil  := 0.
   
   Definition P_id_0  := 1.
   
   Definition P_id_cons (x7:Z) (x8:Z) := 0.
   
   Definition P_id_fst (x7:Z) (x8:Z) := 1* x7.
   
   Definition P_id_len (x7:Z) := 3.
   
   Definition P_id_s (x7:Z) := 1.
   
   Definition P_id_mark (x7:Z) := 1 + 2* x7.
   
   Definition P_id_from (x7:Z) := 1.
   
   Lemma P_id_active_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_active x8 <= P_id_active 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_add_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_add x8 x10 <= P_id_add 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_fst_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_fst x8 x10 <= P_id_fst 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_len_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_len x8 <= P_id_len 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_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_from_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_from x8 <= P_id_from 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_active_bounded : forall x7, (0 <= x7) ->0 <= P_id_active 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_add_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_add 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_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_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_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_fst_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_fst 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_len_bounded : forall x7, (0 <= x7) ->0 <= P_id_len 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_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_from_bounded : forall x7, (0 <= x7) ->0 <= P_id_from 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_active P_id_add P_id_nil P_id_0 P_id_cons 
      P_id_fst P_id_len P_id_s P_id_mark P_id_from.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_active (x7::nil)) =>
                    P_id_active (measure x7)
                   | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                    P_id_add (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                   | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                    P_id_fst (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                    P_id_len (measure x7)
                   | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                    P_id_s (measure x7)
                   | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                    P_id_mark (measure x7)
                   | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                    P_id_from (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_active_monotonic;assumption.
     intros ;apply P_id_add_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_fst_monotonic;assumption.
     intros ;apply P_id_len_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_from_monotonic;assumption.
     intros ;apply P_id_active_bounded;assumption.
     intros ;apply P_id_add_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_fst_bounded;assumption.
     intros ;apply P_id_len_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_from_bounded;assumption.
     apply rules_monotonic.
   Qed.
   
   Definition P_id_ADD (x7:Z) (x8:Z) := 0.
   
   Definition P_id_CONS (x7:Z) (x8:Z) := 0.
   
   Definition P_id_ACTIVE (x7:Z) := 0.
   
   Definition P_id_FROM (x7:Z) := 0.
   
   Definition P_id_LEN (x7:Z) := 0.
   
   Definition P_id_FST (x7:Z) (x8:Z) := 3* x7 + 3* x8.
   
   Definition P_id_MARK (x7:Z) := 0.
   
   Definition P_id_S (x7:Z) := 0.
   
   Lemma P_id_ADD_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_ADD x8 x10 <= P_id_ADD 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_ACTIVE_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_ACTIVE x8 <= P_id_ACTIVE 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_FROM_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_FROM x8 <= P_id_FROM 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_LEN_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_LEN x8 <= P_id_LEN 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_FST_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_FST x8 x10 <= P_id_FST 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_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.
   
   Definition marked_measure  := 
     InterpZ.marked_measure 0 P_id_active P_id_add P_id_nil P_id_0 P_id_cons 
      P_id_fst P_id_len P_id_s P_id_mark P_id_from P_id_ADD P_id_CONS 
      P_id_ACTIVE P_id_FROM P_id_LEN P_id_FST P_id_MARK P_id_S.
   
   Lemma marked_measure_equation :
    forall t, 
     marked_measure t = match t with
                          | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                           P_id_ADD (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_active (x7::nil)) =>
                           P_id_ACTIVE (measure x7)
                          | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                           P_id_FROM (measure x7)
                          | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                           P_id_LEN (measure x7)
                          | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                           P_id_FST (measure x8) (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)
                          | _ => 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_active_monotonic;assumption.
     intros ;apply P_id_add_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_fst_monotonic;assumption.
     intros ;apply P_id_len_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_from_monotonic;assumption.
     intros ;apply P_id_active_bounded;assumption.
     intros ;apply P_id_add_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_fst_bounded;assumption.
     intros ;apply P_id_len_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_from_bounded;assumption.
     apply rules_monotonic.
     intros ;apply P_id_ADD_monotonic;assumption.
     intros ;apply P_id_CONS_monotonic;assumption.
     intros ;apply P_id_ACTIVE_monotonic;assumption.
     intros ;apply P_id_FROM_monotonic;assumption.
     intros ;apply P_id_LEN_monotonic;assumption.
     intros ;apply P_id_FST_monotonic;assumption.
     intros ;apply P_id_MARK_monotonic;assumption.
     intros ;apply P_id_S_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)||
      ((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.
  
  
  Inductive DP_R_xml_0_non_scc_7  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <mark(len(X_)),len(mark(X_))> *)
    | DP_R_xml_0_non_scc_7_0 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_len (x2::nil)) x7) ->
       DP_R_xml_0_non_scc_7 (algebra.Alg.Term algebra.F.id_len 
                             ((algebra.Alg.Term algebra.F.id_mark 
                             (x2::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_7 :
   forall x y, 
    (DP_R_xml_0_non_scc_7 x y) ->Acc WF_R_xml_0_deep_rew.DP_R_xml_0 x.
  Proof.
    intros x y h.
    
    inversion h;clear h;subst;
     constructor;intros _y _h;inversion _h;clear _h;subst;
      (eapply acc_DP_R_xml_0_scc_1;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
       (eapply Hrec;econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))).
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_8  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <mark(add(X1_,X2_)),add(mark(X1_),mark(X2_))> *)
    | DP_R_xml_0_non_scc_8_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_add (x4::x5::nil)) x7) ->
       DP_R_xml_0_non_scc_8 (algebra.Alg.Term algebra.F.id_add 
                             ((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_8 :
   forall x y, 
    (DP_R_xml_0_non_scc_8 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_2;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
       (eapply Hrec;econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))).
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_9  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <mark(from(X_)),from(mark(X_))> *)
    | DP_R_xml_0_non_scc_9_0 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_from (x2::nil)) x7) ->
       DP_R_xml_0_non_scc_9 (algebra.Alg.Term algebra.F.id_from 
                             ((algebra.Alg.Term algebra.F.id_mark 
                             (x2::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_9 :
   forall x y, 
    (DP_R_xml_0_non_scc_9 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_3;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
       (eapply Hrec;econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))).
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_10  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <mark(cons(X1_,X2_)),cons(mark(X1_),X2_)> *)
    | DP_R_xml_0_non_scc_10_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_cons (x4::x5::nil)) x7) ->
       DP_R_xml_0_non_scc_10 (algebra.Alg.Term algebra.F.id_cons 
                              ((algebra.Alg.Term algebra.F.id_mark 
                              (x4::nil))::x5::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_10 :
   forall x y, 
    (DP_R_xml_0_non_scc_10 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_non_scc_11  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <mark(s(X_)),s(X_)> *)
    | DP_R_xml_0_non_scc_11_0 :
     forall x2 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 (x2::nil)) 
        x7) ->
       DP_R_xml_0_non_scc_11 (algebra.Alg.Term algebra.F.id_s (x2::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_11 :
   forall x y, 
    (DP_R_xml_0_non_scc_11 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_5;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
       (eapply Hrec;econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))).
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_12  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <mark(fst(X1_,X2_)),fst(mark(X1_),mark(X2_))> *)
    | DP_R_xml_0_non_scc_12_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_fst (x4::x5::nil)) x7) ->
       DP_R_xml_0_non_scc_12 (algebra.Alg.Term algebra.F.id_fst 
                              ((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_12 :
   forall x y, 
    (DP_R_xml_0_non_scc_12 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_6;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
       (eapply Hrec;econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))).
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_13  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <active(len(cons(X_,Z_))),len(Z_)> *)
    | DP_R_xml_0_non_scc_13_0 :
     forall 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_len ((algebra.Alg.Term 
         algebra.F.id_cons (x2::x1::nil))::nil)) x7) ->
       DP_R_xml_0_non_scc_13 (algebra.Alg.Term algebra.F.id_len (x1::nil)) 
        (algebra.Alg.Term algebra.F.id_active (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_13 :
   forall x y, 
    (DP_R_xml_0_non_scc_13 x y) ->Acc WF_R_xml_0_deep_rew.DP_R_xml_0 x.
  Proof.
    intros x y h.
    
    inversion h;clear h;subst;
     constructor;intros _y _h;inversion _h;clear _h;subst;
      (eapply acc_DP_R_xml_0_scc_1;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
       (eapply Hrec;econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))).
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_14  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <active(len(cons(X_,Z_))),s(len(Z_))> *)
    | DP_R_xml_0_non_scc_14_0 :
     forall 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_len ((algebra.Alg.Term 
         algebra.F.id_cons (x2::x1::nil))::nil)) x7) ->
       DP_R_xml_0_non_scc_14 (algebra.Alg.Term algebra.F.id_s 
                              ((algebra.Alg.Term algebra.F.id_len 
                              (x1::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_active (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_14 :
   forall x y, 
    (DP_R_xml_0_non_scc_14 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_5;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
       (eapply Hrec;econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))).
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_15  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <active(add(s(X_),Y_)),add(X_,Y_)> *)
    | DP_R_xml_0_non_scc_15_0 :
     forall x2 x3 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Term algebra.F.id_s 
         (x2::nil))::x3::nil)) x7) ->
       DP_R_xml_0_non_scc_15 (algebra.Alg.Term algebra.F.id_add (x2::
                              x3::nil)) 
        (algebra.Alg.Term algebra.F.id_active (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_15 :
   forall x y, 
    (DP_R_xml_0_non_scc_15 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_2;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
       (eapply Hrec;econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))).
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_16  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <active(add(s(X_),Y_)),s(add(X_,Y_))> *)
    | DP_R_xml_0_non_scc_16_0 :
     forall x2 x3 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Term algebra.F.id_s 
         (x2::nil))::x3::nil)) x7) ->
       DP_R_xml_0_non_scc_16 (algebra.Alg.Term algebra.F.id_s 
                              ((algebra.Alg.Term algebra.F.id_add (x2::
                              x3::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_active (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_16 :
   forall x y, 
    (DP_R_xml_0_non_scc_16 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_5;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
       (eapply Hrec;econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))).
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_17  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <active(from(X_)),s(X_)> *)
    | DP_R_xml_0_non_scc_17_0 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_from (x2::nil)) x7) ->
       DP_R_xml_0_non_scc_17 (algebra.Alg.Term algebra.F.id_s (x2::nil)) 
        (algebra.Alg.Term algebra.F.id_active (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_17 :
   forall x y, 
    (DP_R_xml_0_non_scc_17 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_5;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
       (eapply Hrec;econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))).
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_18  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <active(from(X_)),from(s(X_))> *)
    | DP_R_xml_0_non_scc_18_0 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_from (x2::nil)) x7) ->
       DP_R_xml_0_non_scc_18 (algebra.Alg.Term algebra.F.id_from 
                              ((algebra.Alg.Term algebra.F.id_s 
                              (x2::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_active (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_18 :
   forall x y, 
    (DP_R_xml_0_non_scc_18 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_3;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
       (eapply Hrec;econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))).
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_19  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <active(from(X_)),cons(X_,from(s(X_)))> *)
    | DP_R_xml_0_non_scc_19_0 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_from (x2::nil)) x7) ->
       DP_R_xml_0_non_scc_19 (algebra.Alg.Term algebra.F.id_cons (x2::
                              (algebra.Alg.Term algebra.F.id_from 
                              ((algebra.Alg.Term algebra.F.id_s 
                              (x2::nil))::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_active (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_19 :
   forall x y, 
    (DP_R_xml_0_non_scc_19 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_non_scc_20  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <active(fst(s(X_),cons(Y_,Z_))),fst(X_,Z_)> *)
    | DP_R_xml_0_non_scc_20_0 :
     forall x2 x1 x3 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Term algebra.F.id_s 
         (x2::nil))::(algebra.Alg.Term algebra.F.id_cons (x3::
         x1::nil))::nil)) x7) ->
       DP_R_xml_0_non_scc_20 (algebra.Alg.Term algebra.F.id_fst (x2::
                              x1::nil)) 
        (algebra.Alg.Term algebra.F.id_active (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_20 :
   forall x y, 
    (DP_R_xml_0_non_scc_20 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_6;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
       (eapply Hrec;econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))).
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_21  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <active(fst(s(X_),cons(Y_,Z_))),cons(Y_,fst(X_,Z_))> *)
    | DP_R_xml_0_non_scc_21_0 :
     forall x2 x1 x3 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Term algebra.F.id_s 
         (x2::nil))::(algebra.Alg.Term algebra.F.id_cons (x3::
         x1::nil))::nil)) x7) ->
       DP_R_xml_0_non_scc_21 (algebra.Alg.Term algebra.F.id_cons (x3::
                              (algebra.Alg.Term algebra.F.id_fst (x2::
                              x1::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_active (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_21 :
   forall x y, 
    (DP_R_xml_0_non_scc_21 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_non_scc_22  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <mark(nil),active(nil)> *)
    | DP_R_xml_0_non_scc_22_0 :
     forall x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 (algebra.Alg.Term algebra.F.id_nil nil) 
        x7) ->
       DP_R_xml_0_non_scc_22 (algebra.Alg.Term algebra.F.id_active 
                              ((algebra.Alg.Term algebra.F.id_nil nil)::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_22 :
   forall x y, 
    (DP_R_xml_0_non_scc_22 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_non_scc_21;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((eapply acc_DP_R_xml_0_non_scc_20;
         econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
       ((eapply acc_DP_R_xml_0_non_scc_19;
          econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
        ((eapply acc_DP_R_xml_0_non_scc_18;
           econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
         ((eapply acc_DP_R_xml_0_non_scc_17;
            econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
          ((eapply acc_DP_R_xml_0_non_scc_16;
             econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
           ((eapply acc_DP_R_xml_0_non_scc_15;
              econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
            ((eapply acc_DP_R_xml_0_non_scc_14;
               econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
             ((eapply acc_DP_R_xml_0_non_scc_13;
                econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
              ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
               (eapply Hrec;
                 econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))))))))))).
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_23  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <mark(0),active(0)> *)
    | DP_R_xml_0_non_scc_23_0 :
     forall x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 (algebra.Alg.Term algebra.F.id_0 nil) 
        x7) ->
       DP_R_xml_0_non_scc_23 (algebra.Alg.Term algebra.F.id_active 
                              ((algebra.Alg.Term algebra.F.id_0 nil)::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_23 :
   forall x y, 
    (DP_R_xml_0_non_scc_23 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_non_scc_21;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((eapply acc_DP_R_xml_0_non_scc_20;
         econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
       ((eapply acc_DP_R_xml_0_non_scc_19;
          econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
        ((eapply acc_DP_R_xml_0_non_scc_18;
           econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
         ((eapply acc_DP_R_xml_0_non_scc_17;
            econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
          ((eapply acc_DP_R_xml_0_non_scc_16;
             econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
           ((eapply acc_DP_R_xml_0_non_scc_15;
              econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
            ((eapply acc_DP_R_xml_0_non_scc_14;
               econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
             ((eapply acc_DP_R_xml_0_non_scc_13;
                econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
              ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
               (eapply Hrec;
                 econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))))))))))).
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_24  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <active(len(nil)),mark(0)> *)
    | DP_R_xml_0_non_scc_24_0 :
     forall x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_len ((algebra.Alg.Term 
         algebra.F.id_nil nil)::nil)) x7) ->
       DP_R_xml_0_non_scc_24 (algebra.Alg.Term algebra.F.id_mark 
                              ((algebra.Alg.Term algebra.F.id_0 nil)::nil)) 
        (algebra.Alg.Term algebra.F.id_active (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_24 :
   forall x y, 
    (DP_R_xml_0_non_scc_24 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_non_scc_23;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((eapply acc_DP_R_xml_0_non_scc_12;
         econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
       ((eapply acc_DP_R_xml_0_non_scc_11;
          econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
        ((eapply acc_DP_R_xml_0_non_scc_10;
           econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
         ((eapply acc_DP_R_xml_0_non_scc_9;
            econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
          ((eapply acc_DP_R_xml_0_non_scc_8;
             econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
           ((eapply acc_DP_R_xml_0_non_scc_7;
              econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
            ((R_xml_0_deep_rew.impossible_star_reduction_R_xml_0 )||
             (eapply Hrec;
               econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))))))))).
  Qed.
  
  
  Inductive DP_R_xml_0_non_scc_25  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <active(fst(0,Z_)),mark(nil)> *)
    | DP_R_xml_0_non_scc_25_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_fst ((algebra.Alg.Term algebra.F.id_0 
         nil)::x1::nil)) x7) ->
       DP_R_xml_0_non_scc_25 (algebra.Alg.Term algebra.F.id_mark 
                              ((algebra.Alg.Term algebra.F.id_nil nil)::nil)) 
        (algebra.Alg.Term algebra.F.id_active (x7::nil))
  .
  
  
  Lemma acc_DP_R_xml_0_non_scc_25 :
   forall x y, 
    (DP_R_xml_0_non_scc_25 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_non_scc_22;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((eapply acc_DP_R_xml_0_non_scc_12;
         econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
       ((eapply acc_DP_R_xml_0_non_scc_11;
          econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
        ((eapply acc_DP_R_xml_0_non_scc_10;
           econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
         ((eapply acc_DP_R_xml_0_non_scc_9;
            econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
          ((eapply acc_DP_R_xml_0_non_scc_8;
             econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
           ((eapply acc_DP_R_xml_0_non_scc_7;
              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_26  :
   algebra.Alg.term ->algebra.Alg.term ->Prop := 
     (* <active(fst(s(X_),cons(Y_,Z_))),mark(cons(Y_,fst(X_,Z_)))> *)
    | DP_R_xml_0_scc_26_0 :
     forall x2 x1 x3 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_fst ((algebra.Alg.Term algebra.F.id_s 
         (x2::nil))::(algebra.Alg.Term algebra.F.id_cons (x3::
         x1::nil))::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_mark 
                          ((algebra.Alg.Term algebra.F.id_cons (x3::
                          (algebra.Alg.Term algebra.F.id_fst (x2::
                          x1::nil))::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_active (x7::nil))
    
     (* <mark(fst(X1_,X2_)),active(fst(mark(X1_),mark(X2_)))> *)
    | DP_R_xml_0_scc_26_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_fst (x4::x5::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_active 
                          ((algebra.Alg.Term algebra.F.id_fst 
                          ((algebra.Alg.Term algebra.F.id_mark (x4::nil))::
                          (algebra.Alg.Term algebra.F.id_mark 
                          (x5::nil))::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    
     (* <active(from(X_)),mark(cons(X_,from(s(X_))))> *)
    | DP_R_xml_0_scc_26_2 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_from (x2::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_mark 
                          ((algebra.Alg.Term algebra.F.id_cons (x2::
                          (algebra.Alg.Term algebra.F.id_from 
                          ((algebra.Alg.Term algebra.F.id_s 
                          (x2::nil))::nil))::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_active (x7::nil))
     (* <mark(fst(X1_,X2_)),mark(X1_)> *)
    | DP_R_xml_0_scc_26_3 :
     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_fst (x4::x5::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_mark (x4::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
     (* <mark(fst(X1_,X2_)),mark(X2_)> *)
    | DP_R_xml_0_scc_26_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_fst (x4::x5::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_mark (x5::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
     (* <mark(s(X_)),active(s(X_))> *)
    | DP_R_xml_0_scc_26_5 :
     forall x2 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 (x2::nil)) 
        x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_active 
                          ((algebra.Alg.Term algebra.F.id_s (x2::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
     (* <active(add(0,X_)),mark(X_)> *)
    | DP_R_xml_0_scc_26_6 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Term algebra.F.id_0 
         nil)::x2::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_mark (x2::nil)) 
        (algebra.Alg.Term algebra.F.id_active (x7::nil))
    
     (* <mark(cons(X1_,X2_)),active(cons(mark(X1_),X2_))> *)
    | DP_R_xml_0_scc_26_7 :
     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_cons (x4::x5::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_active 
                          ((algebra.Alg.Term algebra.F.id_cons 
                          ((algebra.Alg.Term algebra.F.id_mark (x4::nil))::
                          x5::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
     (* <active(add(s(X_),Y_)),mark(s(add(X_,Y_)))> *)
    | DP_R_xml_0_scc_26_8 :
     forall x2 x3 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_add ((algebra.Alg.Term algebra.F.id_s 
         (x2::nil))::x3::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_mark 
                          ((algebra.Alg.Term algebra.F.id_s 
                          ((algebra.Alg.Term algebra.F.id_add (x2::
                          x3::nil))::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_active (x7::nil))
     (* <mark(cons(X1_,X2_)),mark(X1_)> *)
    | DP_R_xml_0_scc_26_9 :
     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_cons (x4::x5::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_mark (x4::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
     (* <mark(from(X_)),active(from(mark(X_)))> *)
    | DP_R_xml_0_scc_26_10 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_from (x2::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_active 
                          ((algebra.Alg.Term algebra.F.id_from 
                          ((algebra.Alg.Term algebra.F.id_mark 
                          (x2::nil))::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    
     (* <active(len(cons(X_,Z_))),mark(s(len(Z_)))> *)
    | DP_R_xml_0_scc_26_11 :
     forall 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_len ((algebra.Alg.Term 
         algebra.F.id_cons (x2::x1::nil))::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_mark 
                          ((algebra.Alg.Term algebra.F.id_s 
                          ((algebra.Alg.Term algebra.F.id_len 
                          (x1::nil))::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_active (x7::nil))
     (* <mark(from(X_)),mark(X_)> *)
    | DP_R_xml_0_scc_26_12 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_from (x2::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_mark (x2::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
    
     (* <mark(add(X1_,X2_)),active(add(mark(X1_),mark(X2_)))> *)
    | DP_R_xml_0_scc_26_13 :
     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_add (x4::x5::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_active 
                          ((algebra.Alg.Term algebra.F.id_add 
                          ((algebra.Alg.Term algebra.F.id_mark (x4::nil))::
                          (algebra.Alg.Term algebra.F.id_mark 
                          (x5::nil))::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
     (* <mark(add(X1_,X2_)),mark(X1_)> *)
    | DP_R_xml_0_scc_26_14 :
     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_add (x4::x5::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_mark (x4::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
     (* <mark(add(X1_,X2_)),mark(X2_)> *)
    | DP_R_xml_0_scc_26_15 :
     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_add (x4::x5::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_mark (x5::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
     (* <mark(len(X_)),active(len(mark(X_)))> *)
    | DP_R_xml_0_scc_26_16 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_len (x2::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_active 
                          ((algebra.Alg.Term algebra.F.id_len 
                          ((algebra.Alg.Term algebra.F.id_mark 
                          (x2::nil))::nil))::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
     (* <mark(len(X_)),mark(X_)> *)
    | DP_R_xml_0_scc_26_17 :
     forall x2 x7, 
      (closure.refl_trans_clos (algebra.EQT.one_step R_xml_0_deep_rew.R_xml_0_rules)
                                 
        (algebra.Alg.Term algebra.F.id_len (x2::nil)) x7) ->
       DP_R_xml_0_scc_26 (algebra.Alg.Term algebra.F.id_mark (x2::nil)) 
        (algebra.Alg.Term algebra.F.id_mark (x7::nil))
  .
  
  
  Module WF_DP_R_xml_0_scc_26.
   Open Scope Z_scope.
   
   Import ring_extention.
   
   Notation Local "a <= b" := (Zle a b).
   
   Notation Local "a < b" := (Zlt a b).
   
   Definition P_id_active (x7:Z) := 1* x7.
   
   Definition P_id_add (x7:Z) (x8:Z) := 3 + 2* x7 + 1* x8.
   
   Definition P_id_nil  := 0.
   
   Definition P_id_0  := 0.
   
   Definition P_id_cons (x7:Z) (x8:Z) := 1 + 1* x7.
   
   Definition P_id_fst (x7:Z) (x8:Z) := 3 + 2* x7 + 3* x8.
   
   Definition P_id_len (x7:Z) := 2 + 1* x7.
   
   Definition P_id_s (x7:Z) := 0.
   
   Definition P_id_mark (x7:Z) := 1* x7.
   
   Definition P_id_from (x7:Z) := 2 + 2* x7.
   
   Lemma P_id_active_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_active x8 <= P_id_active 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_add_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_add x8 x10 <= P_id_add 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_fst_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_fst x8 x10 <= P_id_fst 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_len_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_len x8 <= P_id_len 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_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_from_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_from x8 <= P_id_from 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_active_bounded : forall x7, (0 <= x7) ->0 <= P_id_active 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_add_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_add 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_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_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_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_fst_bounded :
    forall x8 x7, (0 <= x7) ->(0 <= x8) ->0 <= P_id_fst 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_len_bounded : forall x7, (0 <= x7) ->0 <= P_id_len 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_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_from_bounded : forall x7, (0 <= x7) ->0 <= P_id_from 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_active P_id_add P_id_nil P_id_0 P_id_cons 
      P_id_fst P_id_len P_id_s P_id_mark P_id_from.
   
   Lemma measure_equation :
    forall t, 
     measure t = match t with
                   | (algebra.Alg.Term algebra.F.id_active (x7::nil)) =>
                    P_id_active (measure x7)
                   | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                    P_id_add (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_nil nil) => P_id_nil 
                   | (algebra.Alg.Term algebra.F.id_0 nil) => P_id_0 
                   | (algebra.Alg.Term algebra.F.id_cons (x8::x7::nil)) =>
                    P_id_cons (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                    P_id_fst (measure x8) (measure x7)
                   | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                    P_id_len (measure x7)
                   | (algebra.Alg.Term algebra.F.id_s (x7::nil)) =>
                    P_id_s (measure x7)
                   | (algebra.Alg.Term algebra.F.id_mark (x7::nil)) =>
                    P_id_mark (measure x7)
                   | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                    P_id_from (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_active_monotonic;assumption.
     intros ;apply P_id_add_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_fst_monotonic;assumption.
     intros ;apply P_id_len_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_from_monotonic;assumption.
     intros ;apply P_id_active_bounded;assumption.
     intros ;apply P_id_add_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_fst_bounded;assumption.
     intros ;apply P_id_len_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_from_bounded;assumption.
     apply rules_monotonic.
   Qed.
   
   Definition P_id_ADD (x7:Z) (x8:Z) := 0.
   
   Definition P_id_CONS (x7:Z) (x8:Z) := 0.
   
   Definition P_id_ACTIVE (x7:Z) := 2* x7.
   
   Definition P_id_FROM (x7:Z) := 0.
   
   Definition P_id_LEN (x7:Z) := 0.
   
   Definition P_id_FST (x7:Z) (x8:Z) := 0.
   
   Definition P_id_MARK (x7:Z) := 1 + 2* x7.
   
   Definition P_id_S (x7:Z) := 0.
   
   Lemma P_id_ADD_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_ADD x8 x10 <= P_id_ADD 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_ACTIVE_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_ACTIVE x8 <= P_id_ACTIVE 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_FROM_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_FROM x8 <= P_id_FROM 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_LEN_monotonic :
    forall x8 x7, (0 <= x8)/\ (x8 <= x7) ->P_id_LEN x8 <= P_id_LEN 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_FST_monotonic :
    forall x8 x10 x9 x7, 
     (0 <= x10)/\ (x10 <= x9) ->
      (0 <= x8)/\ (x8 <= x7) ->P_id_FST x8 x10 <= P_id_FST 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_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.
   
   Definition marked_measure  := 
     InterpZ.marked_measure 0 P_id_active P_id_add P_id_nil P_id_0 P_id_cons 
      P_id_fst P_id_len P_id_s P_id_mark P_id_from P_id_ADD P_id_CONS 
      P_id_ACTIVE P_id_FROM P_id_LEN P_id_FST P_id_MARK P_id_S.
   
   Lemma marked_measure_equation :
    forall t, 
     marked_measure t = match t with
                          | (algebra.Alg.Term algebra.F.id_add (x8::x7::nil)) =>
                           P_id_ADD (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_active (x7::nil)) =>
                           P_id_ACTIVE (measure x7)
                          | (algebra.Alg.Term algebra.F.id_from (x7::nil)) =>
                           P_id_FROM (measure x7)
                          | (algebra.Alg.Term algebra.F.id_len (x7::nil)) =>
                           P_id_LEN (measure x7)
                          | (algebra.Alg.Term algebra.F.id_fst (x8::x7::nil)) =>
                           P_id_FST (measure x8) (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)
                          | _ => 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_active_monotonic;assumption.
     intros ;apply P_id_add_monotonic;assumption.
     intros ;apply P_id_cons_monotonic;assumption.
     intros ;apply P_id_fst_monotonic;assumption.
     intros ;apply P_id_len_monotonic;assumption.
     intros ;apply P_id_s_monotonic;assumption.
     intros ;apply P_id_mark_monotonic;assumption.
     intros ;apply P_id_from_monotonic;assumption.
     intros ;apply P_id_active_bounded;assumption.
     intros ;apply P_id_add_bounded;assumption.
     intros ;apply P_id_nil_bounded;assumption.
     intros ;apply P_id_0_bounded;assumption.
     intros ;apply P_id_cons_bounded;assumption.
     intros ;apply P_id_fst_bounded;assumption.
     intros ;apply P_id_len_bounded;assumption.
     intros ;apply P_id_s_bounded;assumption.
     intros ;apply P_id_mark_bounded;assumption.
     intros ;apply P_id_from_bounded;assumption.
     apply rules_monotonic.
     intros ;apply P_id_ADD_monotonic;assumption.
     intros ;apply P_id_CONS_monotonic;assumption.
     intros ;apply P_id_ACTIVE_monotonic;assumption.
     intros ;apply P_id_FROM_monotonic;assumption.
     intros ;apply P_id_LEN_monotonic;assumption.
     intros ;apply P_id_FST_monotonic;assumption.
     intros ;apply P_id_MARK_monotonic;assumption.
     intros ;apply P_id_S_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_26.
   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_26.
  
  Definition wf_DP_R_xml_0_scc_26  := WF_DP_R_xml_0_scc_26.wf.
  
  
  Lemma acc_DP_R_xml_0_scc_26 :
   forall x y, (DP_R_xml_0_scc_26 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_26).
    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_25;
         econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
       ((eapply acc_DP_R_xml_0_non_scc_24;
          econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
        ((eapply acc_DP_R_xml_0_non_scc_23;
           econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
         ((eapply acc_DP_R_xml_0_non_scc_22;
            econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
          ((eapply acc_DP_R_xml_0_non_scc_21;
             econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
           ((eapply acc_DP_R_xml_0_non_scc_20;
              econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
            ((eapply acc_DP_R_xml_0_non_scc_19;
               econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
             ((eapply acc_DP_R_xml_0_non_scc_18;
                econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
              ((eapply acc_DP_R_xml_0_non_scc_17;
                 econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
               ((eapply acc_DP_R_xml_0_non_scc_16;
                  econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
                ((eapply acc_DP_R_xml_0_non_scc_15;
                   econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
                 ((eapply acc_DP_R_xml_0_non_scc_14;
                    econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
                  ((eapply acc_DP_R_xml_0_non_scc_13;
                     econstructor 
                     (eassumption)||(algebra.Alg_ext.star_refl' ))||
                   ((eapply acc_DP_R_xml_0_non_scc_12;
                      econstructor 
                      (eassumption)||(algebra.Alg_ext.star_refl' ))||
                    ((eapply acc_DP_R_xml_0_non_scc_11;
                       econstructor 
                       (eassumption)||(algebra.Alg_ext.star_refl' ))||
                     ((eapply acc_DP_R_xml_0_non_scc_10;
                        econstructor 
                        (eassumption)||(algebra.Alg_ext.star_refl' ))||
                      ((eapply acc_DP_R_xml_0_non_scc_9;
                         econstructor 
                         (eassumption)||(algebra.Alg_ext.star_refl' ))||
                       ((eapply acc_DP_R_xml_0_non_scc_8;
                          econstructor 
                          (eassumption)||(algebra.Alg_ext.star_refl' ))||
                        ((eapply acc_DP_R_xml_0_non_scc_7;
                           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_26.
  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_25;
       econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
     ((eapply acc_DP_R_xml_0_non_scc_24;
        econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
      ((eapply acc_DP_R_xml_0_non_scc_23;
         econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
       ((eapply acc_DP_R_xml_0_non_scc_22;
          econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
        ((eapply acc_DP_R_xml_0_non_scc_21;
           econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
         ((eapply acc_DP_R_xml_0_non_scc_20;
            econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
          ((eapply acc_DP_R_xml_0_non_scc_19;
             econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
           ((eapply acc_DP_R_xml_0_non_scc_18;
              econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
            ((eapply acc_DP_R_xml_0_non_scc_17;
               econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
             ((eapply acc_DP_R_xml_0_non_scc_16;
                econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
              ((eapply acc_DP_R_xml_0_non_scc_15;
                 econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
               ((eapply acc_DP_R_xml_0_non_scc_14;
                  econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
                ((eapply acc_DP_R_xml_0_non_scc_13;
                   econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
                 ((eapply acc_DP_R_xml_0_non_scc_12;
                    econstructor (eassumption)||(algebra.Alg_ext.star_refl' ))||
                  ((eapply acc_DP_R_xml_0_non_scc_11;
                     econstructor 
                     (eassumption)||(algebra.Alg_ext.star_refl' ))||
                   ((eapply acc_DP_R_xml_0_non_scc_10;
                      econstructor 
                      (eassumption)||(algebra.Alg_ext.star_refl' ))||
                    ((eapply acc_DP_R_xml_0_non_scc_9;
                       econstructor 
                       (eassumption)||(algebra.Alg_ext.star_refl' ))||
                     ((eapply acc_DP_R_xml_0_non_scc_8;
                        econstructor 
                        (eassumption)||(algebra.Alg_ext.star_refl' ))||
                      ((eapply acc_DP_R_xml_0_non_scc_7;
                         econstructor 
                         (eassumption)||(algebra.Alg_ext.star_refl' ))||
                       ((eapply acc_DP_R_xml_0_non_scc_6;
                          econstructor 
                          (eassumption)||(algebra.Alg_ext.star_refl' ))||
                        ((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_26;
                                 econstructor 
                                 (eassumption)||(algebra.Alg_ext.star_refl' ))||
                               ((eapply acc_DP_R_xml_0_scc_25;
                                  econstructor 
                                  (eassumption)||
                                  (algebra.Alg_ext.star_refl' ))||
                                ((eapply acc_DP_R_xml_0_scc_24;
                                   econstructor 
                                   (eassumption)||
                                   (algebra.Alg_ext.star_refl' ))||
                                 ((eapply acc_DP_R_xml_0_scc_23;
                                    econstructor 
                                    (eassumption)||
                                    (algebra.Alg_ext.star_refl' ))||
                                  ((eapply acc_DP_R_xml_0_scc_22;
                                     econstructor 
                                     (eassumption)||
                                     (algebra.Alg_ext.star_refl' ))||
                                   ((eapply acc_DP_R_xml_0_scc_21;
                                      econstructor 
                                      (eassumption)||
                                      (algebra.Alg_ext.star_refl' ))||
                                    ((eapply acc_DP_R_xml_0_scc_20;
                                       econstructor 
                                       (eassumption)||
                                       (algebra.Alg_ext.star_refl' ))||
                                     ((eapply acc_DP_R_xml_0_scc_19;
                                        econstructor 
                                        (eassumption)||
                                        (algebra.Alg_ext.star_refl' ))||
                                      ((eapply acc_DP_R_xml_0_scc_18;
                                         econstructor 
                                         (eassumption)||
                                         (algebra.Alg_ext.star_refl' ))||
                                       ((eapply acc_DP_R_xml_0_scc_17;
                                          econstructor 
                                          (eassumption)||
                                          (algebra.Alg_ext.star_refl' ))||
                                        ((eapply acc_DP_R_xml_0_scc_16;
                                           econstructor 
                                           (eassumption)||
                                           (algebra.Alg_ext.star_refl' ))||
                                         ((eapply acc_DP_R_xml_0_scc_15;
                                            econstructor 
                                            (eassumption)||
                                            (algebra.Alg_ext.star_refl' ))||
                                          ((eapply acc_DP_R_xml_0_scc_14;
                                             econstructor 
                                             (eassumption)||
                                             (algebra.Alg_ext.star_refl' ))||
                                           ((eapply acc_DP_R_xml_0_scc_13;
                                              econstructor 
                                              (eassumption)||
                                              (algebra.Alg_ext.star_refl' ))||
                                            ((eapply acc_DP_R_xml_0_scc_12;
                                               econstructor 
                                               (eassumption)||
                                               (algebra.Alg_ext.star_refl' ))||
                                             ((eapply acc_DP_R_xml_0_scc_11;
                                                econstructor 
                                                (eassumption)||
                                                (algebra.Alg_ext.star_refl' ))||
                                              ((eapply acc_DP_R_xml_0_scc_10;
                                                 econstructor 
                                                 (eassumption)||
                                                 (algebra.Alg_ext.star_refl' ))||
                                               ((eapply acc_DP_R_xml_0_scc_9;
                                                  econstructor 
                                                  (eassumption)||
                                                  (algebra.Alg_ext.star_refl' ))||
                                                ((eapply acc_DP_R_xml_0_scc_8;
                                                   econstructor 
                                                   (eassumption)||
                                                   (algebra.Alg_ext.star_refl' ))||
                                                 ((eapply acc_DP_R_xml_0_scc_7;
                                                    
                                                    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___Ex2_Luc03b_iGM.trs/a3pat.v" ***
*** End: ***
 *)