Require Import ADPUnif.
Require Import ADecomp.
Require Import ADuplicateSymb.
Require Import AGraph.
Require Import APolyInt_MA.
Require Import ATrs.
Require Import List.
Require Import LogicUtil.
Require Import MonotonePolynom.
Require Import Polynom.
Require Import SN.
Require Import VecUtil.

Open Scope nat_scope.
(* termination problem *)

Module M.
  Inductive symb : Type :=
  | _plus__plus__1 : symb
  | merge : symb
  | nil : symb
  | u : symb
  | v : symb.
End M.

Lemma eq_symb_dec : forall f g : M.symb, {f=g}+{~f=g}.

Proof.
decide equality.
Defined.

Open Scope nat_scope.
Definition ar (s : M.symb) : nat :=
  match s with
  | M._plus__plus__1 => 2
  | M.merge => 2
  | M.nil => 0
  | M.u => 0
  | M.v => 0
  end.

Definition s0 := ASignature.mkSignature ar eq_symb_dec.
Definition s0_p := s0.
Definition V0 := @ATerm.Var s0.
Definition F0 := @ATerm.Fun s0.
Definition R0 := @ATrs.mkRule s0.

Module S0.
  Definition _plus__plus__1 x2 x1 := F0 M._plus__plus__1 (Vcons x2 (Vcons x1 Vnil)).
  Definition merge x2 x1 := F0 M.merge (Vcons x2 (Vcons x1 Vnil)).
  Definition nil := F0 M.nil Vnil.
  Definition u := F0 M.u Vnil.
  Definition v := F0 M.v Vnil.
End S0.

Definition E :=
   @nil (@ATrs.rule s0).

Definition R :=
   R0 (S0.merge (V0 0) S0.nil)
      (V0 0)
:: R0 (S0.merge S0.nil (V0 0))
      (V0 0)
:: R0 (S0.merge (S0._plus__plus__1 (V0 0) (V0 1)) (S0._plus__plus__1 S0.u S0.v))
      (S0._plus__plus__1 (V0 0) (S0.merge (V0 1) (S0._plus__plus__1 S0.u S0.v)))
:: R0 (S0.merge (S0._plus__plus__1 (V0 0) (V0 1)) (S0._plus__plus__1 S0.u S0.v))
      (S0._plus__plus__1 S0.u (S0.merge (S0._plus__plus__1 (V0 0) (V0 1)) S0.v))
:: @nil (@ATrs.rule s0).

Definition rel := ATrs.red_mod E R.

(* symbol marking *)

Definition s1 := dup_sig s0.
Definition s1_p := s0.
Definition V1 := @ATerm.Var s1.
Definition F1 := @ATerm.Fun s1.
Definition R1 := @ATrs.mkRule s1.

Module S1.
  Definition h_plus__plus__1 x2 x1 := F1 (hd_symb s1_p M._plus__plus__1) (Vcons x2 (Vcons x1 Vnil)).
  Definition _plus__plus__1 x2 x1 := F1 (int_symb s1_p M._plus__plus__1) (Vcons x2 (Vcons x1 Vnil)).
  Definition hmerge x2 x1 := F1 (hd_symb s1_p M.merge) (Vcons x2 (Vcons x1 Vnil)).
  Definition merge x2 x1 := F1 (int_symb s1_p M.merge) (Vcons x2 (Vcons x1 Vnil)).
  Definition hnil := F1 (hd_symb s1_p M.nil) Vnil.
  Definition nil := F1 (int_symb s1_p M.nil) Vnil.
  Definition hu := F1 (hd_symb s1_p M.u) Vnil.
  Definition u := F1 (int_symb s1_p M.u) Vnil.
  Definition hv := F1 (hd_symb s1_p M.v) Vnil.
  Definition v := F1 (int_symb s1_p M.v) Vnil.
End S1.

(* graph decomposition 1 *)

Definition cs1 : list (list (@ATrs.rule s1)) :=

   (  R1 (S1.hmerge (S1._plus__plus__1 (V1 0) (V1 1)) (S1._plus__plus__1 (S1.u) (S1.v)))
         (S1.hmerge (S1._plus__plus__1 (V1 0) (V1 1)) (S1.v))
   :: nil)

:: (  R1 (S1.hmerge (S1._plus__plus__1 (V1 0) (V1 1)) (S1._plus__plus__1 (S1.u) (S1.v)))
         (S1.hmerge (V1 1) (S1._plus__plus__1 (S1.u) (S1.v)))
   :: nil)

:: nil.

(* polynomial interpretation 1 *)

Module PIS1 (*<: TPolyInt*).

  Definition sig := s1.

  Definition trsInt f :=
    match f as f return poly (@ASignature.arity s1 f) with
    | (hd_symb M.merge) =>
         (1%Z, (Vcons 1 (Vcons 0 Vnil)))
      :: nil
    | (int_symb M.merge) =>
         (2%Z, (Vcons 1 (Vcons 0 Vnil)))
      :: (2%Z, (Vcons 0 (Vcons 1 Vnil)))
      :: nil
    | (hd_symb M.nil) =>
         nil
    | (int_symb M.nil) =>
         nil
    | (hd_symb M._plus__plus__1) =>
         nil
    | (int_symb M._plus__plus__1) =>
         (2%Z, (Vcons 0 (Vcons 0 Vnil)))
      :: (1%Z, (Vcons 0 (Vcons 1 Vnil)))
      :: nil
    | (hd_symb M.u) =>
         nil
    | (int_symb M.u) =>
         nil
    | (hd_symb M.v) =>
         nil
    | (int_symb M.v) =>
         (2%Z, Vnil)
      :: nil
    end.

  Lemma trsInt_wm : forall f, pweak_monotone (trsInt f).
  Proof.
    pmonotone.
  Qed.

End PIS1.

Module PI1 := PolyInt PIS1.

(* termination proof *)

Lemma termination : WF rel.

Proof.
unfold rel.
dp_trans.
mark.
let D := fresh "D" in let R := fresh "R" in set_rules_to D; set_mod_rules_to R;
graph_decomp (dpg_unif_N 100 R D) cs1; subst D; subst R.
dpg_unif_N_correct.
left. co_scc.
right. PI1.prove_termination.
termination_trivial.
Qed.