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 :=
  | _if_1 : symb
  | false : symb
  | true : 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._if_1 => 3
  | M.false => 0
  | M.true => 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 _if_1 x3 x2 x1 := F0 M._if_1 (Vcons x3 (Vcons x2 (Vcons x1 Vnil))).
  Definition false := F0 M.false Vnil.
  Definition true := F0 M.true 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._if_1 S0.true (V0 0) (V0 1))
      (V0 0)
:: R0 (S0._if_1 S0.false (V0 0) (V0 1))
      (V0 1)
:: R0 (S0._if_1 (V0 0) (V0 1) (V0 1))
      (V0 1)
:: R0 (S0._if_1 (S0._if_1 (V0 0) (V0 1) (V0 2)) S0.u S0.v)
      (S0._if_1 (V0 0) (S0._if_1 (V0 1) S0.u S0.v) (S0._if_1 (V0 2) S0.u 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_if_1 x3 x2 x1 := F1 (hd_symb s1_p M._if_1) (Vcons x3 (Vcons x2 (Vcons x1 Vnil))).
  Definition _if_1 x3 x2 x1 := F1 (int_symb s1_p M._if_1) (Vcons x3 (Vcons x2 (Vcons x1 Vnil))).
  Definition hfalse := F1 (hd_symb s1_p M.false) Vnil.
  Definition false := F1 (int_symb s1_p M.false) Vnil.
  Definition htrue := F1 (hd_symb s1_p M.true) Vnil.
  Definition true := F1 (int_symb s1_p M.true) 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.

(* 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._if_1) =>
         (1%Z, (Vcons 1 (Vcons 0 (Vcons 0 Vnil))))
      :: nil
    | (int_symb M._if_1) =>
         (2%Z, (Vcons 0 (Vcons 0 (Vcons 0 Vnil))))
      :: (2%Z, (Vcons 1 (Vcons 0 (Vcons 0 Vnil))))
      :: (1%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil))))
      :: (1%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil))))
      :: nil
    | (hd_symb M.true) =>
         nil
    | (int_symb M.true) =>
         nil
    | (hd_symb M.false) =>
         nil
    | (int_symb M.false) =>
         nil
    | (hd_symb M.u) =>
         nil
    | (int_symb M.u) =>
         nil
    | (hd_symb M.v) =>
         nil
    | (int_symb M.v) =>
         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.
PI1.prove_termination.
termination_trivial.
Qed.