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 := | U11 : symb | U12 : symb | U13 : symb | U21 : symb | U22 : symb | U31 : symb | U41 : symb | _0_1 : symb | a__U11 : symb | a__U12 : symb | a__U13 : symb | a__U21 : symb | a__U22 : symb | a__U31 : symb | a__U41 : symb | a__and : symb | a__isNat : symb | a__isNatKind : symb | a__plus : symb | and : symb | isNat : symb | isNatKind : symb | mark : symb | plus : symb | s : symb | tt : 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.U11 => 3 | M.U12 => 2 | M.U13 => 1 | M.U21 => 2 | M.U22 => 1 | M.U31 => 2 | M.U41 => 3 | M._0_1 => 0 | M.a__U11 => 3 | M.a__U12 => 2 | M.a__U13 => 1 | M.a__U21 => 2 | M.a__U22 => 1 | M.a__U31 => 2 | M.a__U41 => 3 | M.a__and => 2 | M.a__isNat => 1 | M.a__isNatKind => 1 | M.a__plus => 2 | M.and => 2 | M.isNat => 1 | M.isNatKind => 1 | M.mark => 1 | M.plus => 2 | M.s => 1 | M.tt => 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 U11 x3 x2 x1 := F0 M.U11 (Vcons x3 (Vcons x2 (Vcons x1 Vnil))). Definition U12 x2 x1 := F0 M.U12 (Vcons x2 (Vcons x1 Vnil)). Definition U13 x1 := F0 M.U13 (Vcons x1 Vnil). Definition U21 x2 x1 := F0 M.U21 (Vcons x2 (Vcons x1 Vnil)). Definition U22 x1 := F0 M.U22 (Vcons x1 Vnil). Definition U31 x2 x1 := F0 M.U31 (Vcons x2 (Vcons x1 Vnil)). Definition U41 x3 x2 x1 := F0 M.U41 (Vcons x3 (Vcons x2 (Vcons x1 Vnil))). Definition _0_1 := F0 M._0_1 Vnil. Definition a__U11 x3 x2 x1 := F0 M.a__U11 (Vcons x3 (Vcons x2 (Vcons x1 Vnil))). Definition a__U12 x2 x1 := F0 M.a__U12 (Vcons x2 (Vcons x1 Vnil)). Definition a__U13 x1 := F0 M.a__U13 (Vcons x1 Vnil). Definition a__U21 x2 x1 := F0 M.a__U21 (Vcons x2 (Vcons x1 Vnil)). Definition a__U22 x1 := F0 M.a__U22 (Vcons x1 Vnil). Definition a__U31 x2 x1 := F0 M.a__U31 (Vcons x2 (Vcons x1 Vnil)). Definition a__U41 x3 x2 x1 := F0 M.a__U41 (Vcons x3 (Vcons x2 (Vcons x1 Vnil))). Definition a__and x2 x1 := F0 M.a__and (Vcons x2 (Vcons x1 Vnil)). Definition a__isNat x1 := F0 M.a__isNat (Vcons x1 Vnil). Definition a__isNatKind x1 := F0 M.a__isNatKind (Vcons x1 Vnil). Definition a__plus x2 x1 := F0 M.a__plus (Vcons x2 (Vcons x1 Vnil)). Definition and x2 x1 := F0 M.and (Vcons x2 (Vcons x1 Vnil)). Definition isNat x1 := F0 M.isNat (Vcons x1 Vnil). Definition isNatKind x1 := F0 M.isNatKind (Vcons x1 Vnil). Definition mark x1 := F0 M.mark (Vcons x1 Vnil). Definition plus x2 x1 := F0 M.plus (Vcons x2 (Vcons x1 Vnil)). Definition s x1 := F0 M.s (Vcons x1 Vnil). Definition tt := F0 M.tt Vnil. End S0. Definition E := @nil (@ATrs.rule s0). Definition R := R0 (S0.a__U11 S0.tt (V0 0) (V0 1)) (S0.a__U12 (S0.a__isNat (V0 0)) (V0 1)) :: R0 (S0.a__U12 S0.tt (V0 0)) (S0.a__U13 (S0.a__isNat (V0 0))) :: R0 (S0.a__U13 S0.tt) S0.tt :: R0 (S0.a__U21 S0.tt (V0 0)) (S0.a__U22 (S0.a__isNat (V0 0))) :: R0 (S0.a__U22 S0.tt) S0.tt :: R0 (S0.a__U31 S0.tt (V0 0)) (S0.mark (V0 0)) :: R0 (S0.a__U41 S0.tt (V0 0) (V0 1)) (S0.s (S0.a__plus (S0.mark (V0 1)) (S0.mark (V0 0)))) :: R0 (S0.a__and S0.tt (V0 0)) (S0.mark (V0 0)) :: R0 (S0.a__isNat S0._0_1) S0.tt :: R0 (S0.a__isNat (S0.plus (V0 0) (V0 1))) (S0.a__U11 (S0.a__and (S0.a__isNatKind (V0 0)) (S0.isNatKind (V0 1))) (V0 0) (V0 1)) :: R0 (S0.a__isNat (S0.s (V0 0))) (S0.a__U21 (S0.a__isNatKind (V0 0)) (V0 0)) :: R0 (S0.a__isNatKind S0._0_1) S0.tt :: R0 (S0.a__isNatKind (S0.plus (V0 0) (V0 1))) (S0.a__and (S0.a__isNatKind (V0 0)) (S0.isNatKind (V0 1))) :: R0 (S0.a__isNatKind (S0.s (V0 0))) (S0.a__isNatKind (V0 0)) :: R0 (S0.a__plus (V0 0) S0._0_1) (S0.a__U31 (S0.a__and (S0.a__isNat (V0 0)) (S0.isNatKind (V0 0))) (V0 0)) :: R0 (S0.a__plus (V0 0) (S0.s (V0 1))) (S0.a__U41 (S0.a__and (S0.a__and (S0.a__isNat (V0 1)) (S0.isNatKind (V0 1))) (S0.and (S0.isNat (V0 0)) (S0.isNatKind (V0 0)))) (V0 1) (V0 0)) :: R0 (S0.mark (S0.U11 (V0 0) (V0 1) (V0 2))) (S0.a__U11 (S0.mark (V0 0)) (V0 1) (V0 2)) :: R0 (S0.mark (S0.U12 (V0 0) (V0 1))) (S0.a__U12 (S0.mark (V0 0)) (V0 1)) :: R0 (S0.mark (S0.isNat (V0 0))) (S0.a__isNat (V0 0)) :: R0 (S0.mark (S0.U13 (V0 0))) (S0.a__U13 (S0.mark (V0 0))) :: R0 (S0.mark (S0.U21 (V0 0) (V0 1))) (S0.a__U21 (S0.mark (V0 0)) (V0 1)) :: R0 (S0.mark (S0.U22 (V0 0))) (S0.a__U22 (S0.mark (V0 0))) :: R0 (S0.mark (S0.U31 (V0 0) (V0 1))) (S0.a__U31 (S0.mark (V0 0)) (V0 1)) :: R0 (S0.mark (S0.U41 (V0 0) (V0 1) (V0 2))) (S0.a__U41 (S0.mark (V0 0)) (V0 1) (V0 2)) :: R0 (S0.mark (S0.plus (V0 0) (V0 1))) (S0.a__plus (S0.mark (V0 0)) (S0.mark (V0 1))) :: R0 (S0.mark (S0.and (V0 0) (V0 1))) (S0.a__and (S0.mark (V0 0)) (V0 1)) :: R0 (S0.mark (S0.isNatKind (V0 0))) (S0.a__isNatKind (V0 0)) :: R0 (S0.mark S0.tt) S0.tt :: R0 (S0.mark (S0.s (V0 0))) (S0.s (S0.mark (V0 0))) :: R0 (S0.mark S0._0_1) S0._0_1 :: R0 (S0.a__U11 (V0 0) (V0 1) (V0 2)) (S0.U11 (V0 0) (V0 1) (V0 2)) :: R0 (S0.a__U12 (V0 0) (V0 1)) (S0.U12 (V0 0) (V0 1)) :: R0 (S0.a__isNat (V0 0)) (S0.isNat (V0 0)) :: R0 (S0.a__U13 (V0 0)) (S0.U13 (V0 0)) :: R0 (S0.a__U21 (V0 0) (V0 1)) (S0.U21 (V0 0) (V0 1)) :: R0 (S0.a__U22 (V0 0)) (S0.U22 (V0 0)) :: R0 (S0.a__U31 (V0 0) (V0 1)) (S0.U31 (V0 0) (V0 1)) :: R0 (S0.a__U41 (V0 0) (V0 1) (V0 2)) (S0.U41 (V0 0) (V0 1) (V0 2)) :: R0 (S0.a__plus (V0 0) (V0 1)) (S0.plus (V0 0) (V0 1)) :: R0 (S0.a__and (V0 0) (V0 1)) (S0.and (V0 0) (V0 1)) :: R0 (S0.a__isNatKind (V0 0)) (S0.isNatKind (V0 0)) :: @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 hU11 x3 x2 x1 := F1 (hd_symb s1_p M.U11) (Vcons x3 (Vcons x2 (Vcons x1 Vnil))). Definition U11 x3 x2 x1 := F1 (int_symb s1_p M.U11) (Vcons x3 (Vcons x2 (Vcons x1 Vnil))). Definition hU12 x2 x1 := F1 (hd_symb s1_p M.U12) (Vcons x2 (Vcons x1 Vnil)). Definition U12 x2 x1 := F1 (int_symb s1_p M.U12) (Vcons x2 (Vcons x1 Vnil)). Definition hU13 x1 := F1 (hd_symb s1_p M.U13) (Vcons x1 Vnil). Definition U13 x1 := F1 (int_symb s1_p M.U13) (Vcons x1 Vnil). Definition hU21 x2 x1 := F1 (hd_symb s1_p M.U21) (Vcons x2 (Vcons x1 Vnil)). Definition U21 x2 x1 := F1 (int_symb s1_p M.U21) (Vcons x2 (Vcons x1 Vnil)). Definition hU22 x1 := F1 (hd_symb s1_p M.U22) (Vcons x1 Vnil). Definition U22 x1 := F1 (int_symb s1_p M.U22) (Vcons x1 Vnil). Definition hU31 x2 x1 := F1 (hd_symb s1_p M.U31) (Vcons x2 (Vcons x1 Vnil)). Definition U31 x2 x1 := F1 (int_symb s1_p M.U31) (Vcons x2 (Vcons x1 Vnil)). Definition hU41 x3 x2 x1 := F1 (hd_symb s1_p M.U41) (Vcons x3 (Vcons x2 (Vcons x1 Vnil))). Definition U41 x3 x2 x1 := F1 (int_symb s1_p M.U41) (Vcons x3 (Vcons x2 (Vcons x1 Vnil))). Definition h_0_1 := F1 (hd_symb s1_p M._0_1) Vnil. Definition _0_1 := F1 (int_symb s1_p M._0_1) Vnil. Definition ha__U11 x3 x2 x1 := F1 (hd_symb s1_p M.a__U11) (Vcons x3 (Vcons x2 (Vcons x1 Vnil))). Definition a__U11 x3 x2 x1 := F1 (int_symb s1_p M.a__U11) (Vcons x3 (Vcons x2 (Vcons x1 Vnil))). Definition ha__U12 x2 x1 := F1 (hd_symb s1_p M.a__U12) (Vcons x2 (Vcons x1 Vnil)). Definition a__U12 x2 x1 := F1 (int_symb s1_p M.a__U12) (Vcons x2 (Vcons x1 Vnil)). Definition ha__U13 x1 := F1 (hd_symb s1_p M.a__U13) (Vcons x1 Vnil). Definition a__U13 x1 := F1 (int_symb s1_p M.a__U13) (Vcons x1 Vnil). Definition ha__U21 x2 x1 := F1 (hd_symb s1_p M.a__U21) (Vcons x2 (Vcons x1 Vnil)). Definition a__U21 x2 x1 := F1 (int_symb s1_p M.a__U21) (Vcons x2 (Vcons x1 Vnil)). Definition ha__U22 x1 := F1 (hd_symb s1_p M.a__U22) (Vcons x1 Vnil). Definition a__U22 x1 := F1 (int_symb s1_p M.a__U22) (Vcons x1 Vnil). Definition ha__U31 x2 x1 := F1 (hd_symb s1_p M.a__U31) (Vcons x2 (Vcons x1 Vnil)). Definition a__U31 x2 x1 := F1 (int_symb s1_p M.a__U31) (Vcons x2 (Vcons x1 Vnil)). Definition ha__U41 x3 x2 x1 := F1 (hd_symb s1_p M.a__U41) (Vcons x3 (Vcons x2 (Vcons x1 Vnil))). Definition a__U41 x3 x2 x1 := F1 (int_symb s1_p M.a__U41) (Vcons x3 (Vcons x2 (Vcons x1 Vnil))). Definition ha__and x2 x1 := F1 (hd_symb s1_p M.a__and) (Vcons x2 (Vcons x1 Vnil)). Definition a__and x2 x1 := F1 (int_symb s1_p M.a__and) (Vcons x2 (Vcons x1 Vnil)). Definition ha__isNat x1 := F1 (hd_symb s1_p M.a__isNat) (Vcons x1 Vnil). Definition a__isNat x1 := F1 (int_symb s1_p M.a__isNat) (Vcons x1 Vnil). Definition ha__isNatKind x1 := F1 (hd_symb s1_p M.a__isNatKind) (Vcons x1 Vnil). Definition a__isNatKind x1 := F1 (int_symb s1_p M.a__isNatKind) (Vcons x1 Vnil). Definition ha__plus x2 x1 := F1 (hd_symb s1_p M.a__plus) (Vcons x2 (Vcons x1 Vnil)). Definition a__plus x2 x1 := F1 (int_symb s1_p M.a__plus) (Vcons x2 (Vcons x1 Vnil)). Definition hand x2 x1 := F1 (hd_symb s1_p M.and) (Vcons x2 (Vcons x1 Vnil)). Definition and x2 x1 := F1 (int_symb s1_p M.and) (Vcons x2 (Vcons x1 Vnil)). Definition hisNat x1 := F1 (hd_symb s1_p M.isNat) (Vcons x1 Vnil). Definition isNat x1 := F1 (int_symb s1_p M.isNat) (Vcons x1 Vnil). Definition hisNatKind x1 := F1 (hd_symb s1_p M.isNatKind) (Vcons x1 Vnil). Definition isNatKind x1 := F1 (int_symb s1_p M.isNatKind) (Vcons x1 Vnil). Definition hmark x1 := F1 (hd_symb s1_p M.mark) (Vcons x1 Vnil). Definition mark x1 := F1 (int_symb s1_p M.mark) (Vcons x1 Vnil). Definition hplus x2 x1 := F1 (hd_symb s1_p M.plus) (Vcons x2 (Vcons x1 Vnil)). Definition plus x2 x1 := F1 (int_symb s1_p M.plus) (Vcons x2 (Vcons x1 Vnil)). Definition hs x1 := F1 (hd_symb s1_p M.s) (Vcons x1 Vnil). Definition s x1 := F1 (int_symb s1_p M.s) (Vcons x1 Vnil). Definition htt := F1 (hd_symb s1_p M.tt) Vnil. Definition tt := F1 (int_symb s1_p M.tt) Vnil. End S1. (* graph decomposition 1 *) Definition cs1 : list (list (@ATrs.rule s1)) := ( R1 (S1.hmark (S1.U22 (V1 0))) (S1.ha__U22 (S1.mark (V1 0))) :: nil) :: ( R1 (S1.hmark (S1.U13 (V1 0))) (S1.ha__U13 (S1.mark (V1 0))) :: nil) :: ( R1 (S1.ha__U21 (S1.tt) (V1 0)) (S1.ha__U22 (S1.a__isNat (V1 0))) :: nil) :: ( R1 (S1.ha__U12 (S1.tt) (V1 0)) (S1.ha__U13 (S1.a__isNat (V1 0))) :: nil) :: ( R1 (S1.ha__U12 (S1.tt) (V1 0)) (S1.ha__isNat (V1 0)) :: R1 (S1.ha__isNat (S1.plus (V1 0) (V1 1))) (S1.ha__U11 (S1.a__and (S1.a__isNatKind (V1 0)) (S1.isNatKind (V1 1))) (V1 0) (V1 1)) :: R1 (S1.ha__U11 (S1.tt) (V1 0) (V1 1)) (S1.ha__U12 (S1.a__isNat (V1 0)) (V1 1)) :: R1 (S1.ha__U11 (S1.tt) (V1 0) (V1 1)) (S1.ha__isNat (V1 0)) :: R1 (S1.ha__isNat (S1.plus (V1 0) (V1 1))) (S1.ha__and (S1.a__isNatKind (V1 0)) (S1.isNatKind (V1 1))) :: R1 (S1.ha__and (S1.tt) (V1 0)) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.U11 (V1 0) (V1 1) (V1 2))) (S1.ha__U11 (S1.mark (V1 0)) (V1 1) (V1 2)) :: R1 (S1.hmark (S1.U11 (V1 0) (V1 1) (V1 2))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.U12 (V1 0) (V1 1))) (S1.ha__U12 (S1.mark (V1 0)) (V1 1)) :: R1 (S1.hmark (S1.U12 (V1 0) (V1 1))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.isNat (V1 0))) (S1.ha__isNat (V1 0)) :: R1 (S1.ha__isNat (S1.plus (V1 0) (V1 1))) (S1.ha__isNatKind (V1 0)) :: R1 (S1.ha__isNatKind (S1.plus (V1 0) (V1 1))) (S1.ha__and (S1.a__isNatKind (V1 0)) (S1.isNatKind (V1 1))) :: R1 (S1.ha__isNatKind (S1.plus (V1 0) (V1 1))) (S1.ha__isNatKind (V1 0)) :: R1 (S1.ha__isNatKind (S1.s (V1 0))) (S1.ha__isNatKind (V1 0)) :: R1 (S1.ha__isNat (S1.s (V1 0))) (S1.ha__U21 (S1.a__isNatKind (V1 0)) (V1 0)) :: R1 (S1.ha__U21 (S1.tt) (V1 0)) (S1.ha__isNat (V1 0)) :: R1 (S1.ha__isNat (S1.s (V1 0))) (S1.ha__isNatKind (V1 0)) :: R1 (S1.hmark (S1.U13 (V1 0))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.U21 (V1 0) (V1 1))) (S1.ha__U21 (S1.mark (V1 0)) (V1 1)) :: R1 (S1.hmark (S1.U21 (V1 0) (V1 1))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.U22 (V1 0))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.U31 (V1 0) (V1 1))) (S1.ha__U31 (S1.mark (V1 0)) (V1 1)) :: R1 (S1.ha__U31 (S1.tt) (V1 0)) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.U31 (V1 0) (V1 1))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.U41 (V1 0) (V1 1) (V1 2))) (S1.ha__U41 (S1.mark (V1 0)) (V1 1) (V1 2)) :: R1 (S1.ha__U41 (S1.tt) (V1 0) (V1 1)) (S1.ha__plus (S1.mark (V1 1)) (S1.mark (V1 0))) :: R1 (S1.ha__plus (V1 0) (S1._0_1)) (S1.ha__U31 (S1.a__and (S1.a__isNat (V1 0)) (S1.isNatKind (V1 0))) (V1 0)) :: R1 (S1.ha__plus (V1 0) (S1._0_1)) (S1.ha__and (S1.a__isNat (V1 0)) (S1.isNatKind (V1 0))) :: R1 (S1.ha__plus (V1 0) (S1._0_1)) (S1.ha__isNat (V1 0)) :: R1 (S1.ha__plus (V1 0) (S1.s (V1 1))) (S1.ha__U41 (S1.a__and (S1.a__and (S1.a__isNat (V1 1)) (S1.isNatKind (V1 1))) (S1.and (S1.isNat (V1 0)) (S1.isNatKind (V1 0)))) (V1 1) (V1 0)) :: R1 (S1.ha__U41 (S1.tt) (V1 0) (V1 1)) (S1.hmark (V1 1)) :: R1 (S1.hmark (S1.U41 (V1 0) (V1 1) (V1 2))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.plus (V1 0) (V1 1))) (S1.ha__plus (S1.mark (V1 0)) (S1.mark (V1 1))) :: R1 (S1.ha__plus (V1 0) (S1.s (V1 1))) (S1.ha__and (S1.a__and (S1.a__isNat (V1 1)) (S1.isNatKind (V1 1))) (S1.and (S1.isNat (V1 0)) (S1.isNatKind (V1 0)))) :: R1 (S1.ha__plus (V1 0) (S1.s (V1 1))) (S1.ha__and (S1.a__isNat (V1 1)) (S1.isNatKind (V1 1))) :: R1 (S1.ha__plus (V1 0) (S1.s (V1 1))) (S1.ha__isNat (V1 1)) :: R1 (S1.hmark (S1.plus (V1 0) (V1 1))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.plus (V1 0) (V1 1))) (S1.hmark (V1 1)) :: R1 (S1.hmark (S1.and (V1 0) (V1 1))) (S1.ha__and (S1.mark (V1 0)) (V1 1)) :: R1 (S1.hmark (S1.and (V1 0) (V1 1))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.isNatKind (V1 0))) (S1.ha__isNatKind (V1 0)) :: R1 (S1.hmark (S1.s (V1 0))) (S1.hmark (V1 0)) :: R1 (S1.ha__U41 (S1.tt) (V1 0) (V1 1)) (S1.hmark (V1 0)) :: 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.a__U11) => (3%Z, (Vcons 0 (Vcons 0 (Vcons 0 Vnil)))) :: nil | (int_symb M.a__U11) => (2%Z, (Vcons 1 (Vcons 0 (Vcons 0 Vnil)))) :: nil | (hd_symb M.tt) => nil | (int_symb M.tt) => nil | (hd_symb M.a__U12) => (3%Z, (Vcons 0 (Vcons 0 Vnil))) :: nil | (int_symb M.a__U12) => (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: nil | (hd_symb M.a__isNat) => (3%Z, (Vcons 0 Vnil)) :: nil | (int_symb M.a__isNat) => nil | (hd_symb M.a__U13) => nil | (int_symb M.a__U13) => (2%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U21) => (3%Z, (Vcons 0 (Vcons 0 Vnil))) :: nil | (int_symb M.a__U21) => (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: nil | (hd_symb M.a__U22) => nil | (int_symb M.a__U22) => (2%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U31) => (3%Z, (Vcons 0 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (int_symb M.a__U31) => (2%Z, (Vcons 0 (Vcons 0 Vnil))) :: (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.mark) => (3%Z, (Vcons 0 Vnil)) :: (2%Z, (Vcons 1 Vnil)) :: nil | (int_symb M.mark) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U41) => (3%Z, (Vcons 0 (Vcons 0 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil | (int_symb M.a__U41) => (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.s) => nil | (int_symb M.s) => (2%Z, (Vcons 0 Vnil)) :: (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__plus) => (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (int_symb M.a__plus) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__and) => (3%Z, (Vcons 0 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (int_symb M.a__and) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M._0_1) => nil | (int_symb M._0_1) => (2%Z, Vnil) :: nil | (hd_symb M.plus) => nil | (int_symb M.plus) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__isNatKind) => (3%Z, (Vcons 0 Vnil)) :: nil | (int_symb M.a__isNatKind) => nil | (hd_symb M.isNatKind) => nil | (int_symb M.isNatKind) => nil | (hd_symb M.and) => nil | (int_symb M.and) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.isNat) => nil | (int_symb M.isNat) => nil | (hd_symb M.U11) => nil | (int_symb M.U11) => (2%Z, (Vcons 1 (Vcons 0 (Vcons 0 Vnil)))) :: nil | (hd_symb M.U12) => nil | (int_symb M.U12) => (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: nil | (hd_symb M.U13) => nil | (int_symb M.U13) => (2%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.U21) => nil | (int_symb M.U21) => (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: nil | (hd_symb M.U22) => nil | (int_symb M.U22) => (2%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.U31) => nil | (int_symb M.U31) => (2%Z, (Vcons 0 (Vcons 0 Vnil))) :: (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.U41) => nil | (int_symb M.U41) => (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 end. Lemma trsInt_wm : forall f, pweak_monotone (trsInt f). Proof. pmonotone. Qed. End PIS1. Module PI1 := PolyInt PIS1. (* graph decomposition 2 *) Definition cs2 : list (list (@ATrs.rule s1)) := ( R1 (S1.ha__isNat (S1.plus (V1 0) (V1 1))) (S1.ha__U11 (S1.a__and (S1.a__isNatKind (V1 0)) (S1.isNatKind (V1 1))) (V1 0) (V1 1)) :: R1 (S1.ha__U11 (S1.tt) (V1 0) (V1 1)) (S1.ha__U12 (S1.a__isNat (V1 0)) (V1 1)) :: R1 (S1.ha__U12 (S1.tt) (V1 0)) (S1.ha__isNat (V1 0)) :: R1 (S1.ha__isNat (S1.plus (V1 0) (V1 1))) (S1.ha__and (S1.a__isNatKind (V1 0)) (S1.isNatKind (V1 1))) :: R1 (S1.ha__and (S1.tt) (V1 0)) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.U11 (V1 0) (V1 1) (V1 2))) (S1.ha__U11 (S1.mark (V1 0)) (V1 1) (V1 2)) :: R1 (S1.ha__U11 (S1.tt) (V1 0) (V1 1)) (S1.ha__isNat (V1 0)) :: R1 (S1.ha__isNat (S1.plus (V1 0) (V1 1))) (S1.ha__isNatKind (V1 0)) :: R1 (S1.ha__isNatKind (S1.plus (V1 0) (V1 1))) (S1.ha__and (S1.a__isNatKind (V1 0)) (S1.isNatKind (V1 1))) :: R1 (S1.ha__isNatKind (S1.plus (V1 0) (V1 1))) (S1.ha__isNatKind (V1 0)) :: R1 (S1.ha__isNatKind (S1.s (V1 0))) (S1.ha__isNatKind (V1 0)) :: R1 (S1.ha__isNat (S1.s (V1 0))) (S1.ha__U21 (S1.a__isNatKind (V1 0)) (V1 0)) :: R1 (S1.ha__U21 (S1.tt) (V1 0)) (S1.ha__isNat (V1 0)) :: R1 (S1.ha__isNat (S1.s (V1 0))) (S1.ha__isNatKind (V1 0)) :: R1 (S1.hmark (S1.U11 (V1 0) (V1 1) (V1 2))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.U12 (V1 0) (V1 1))) (S1.ha__U12 (S1.mark (V1 0)) (V1 1)) :: R1 (S1.hmark (S1.U12 (V1 0) (V1 1))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.isNat (V1 0))) (S1.ha__isNat (V1 0)) :: R1 (S1.hmark (S1.U13 (V1 0))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.U21 (V1 0) (V1 1))) (S1.ha__U21 (S1.mark (V1 0)) (V1 1)) :: R1 (S1.hmark (S1.U21 (V1 0) (V1 1))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.U22 (V1 0))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.plus (V1 0) (V1 1))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.plus (V1 0) (V1 1))) (S1.hmark (V1 1)) :: R1 (S1.hmark (S1.and (V1 0) (V1 1))) (S1.ha__and (S1.mark (V1 0)) (V1 1)) :: R1 (S1.hmark (S1.and (V1 0) (V1 1))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.isNatKind (V1 0))) (S1.ha__isNatKind (V1 0)) :: nil) :: ( R1 (S1.ha__U41 (S1.tt) (V1 0) (V1 1)) (S1.hmark (V1 0)) :: nil) :: ( R1 (S1.ha__U41 (S1.tt) (V1 0) (V1 1)) (S1.hmark (V1 1)) :: nil) :: ( R1 (S1.ha__U31 (S1.tt) (V1 0)) (S1.hmark (V1 0)) :: nil) :: nil. (* polynomial interpretation 2 *) Module PIS2 (*<: TPolyInt*). Definition sig := s1. Definition trsInt f := match f as f return poly (@ASignature.arity s1 f) with | (hd_symb M.a__U11) => (1%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (3%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil | (int_symb M.a__U11) => (2%Z, (Vcons 1 (Vcons 0 (Vcons 0 Vnil)))) :: (1%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil | (hd_symb M.tt) => nil | (int_symb M.tt) => nil | (hd_symb M.a__U12) => (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (int_symb M.a__U12) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__isNat) => (1%Z, (Vcons 1 Vnil)) :: nil | (int_symb M.a__isNat) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U13) => nil | (int_symb M.a__U13) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U21) => (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (int_symb M.a__U21) => (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__U22) => nil | (int_symb M.a__U22) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U31) => nil | (int_symb M.a__U31) => (1%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.mark) => (2%Z, (Vcons 1 Vnil)) :: nil | (int_symb M.mark) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U41) => nil | (int_symb M.a__U41) => (1%Z, (Vcons 0 (Vcons 0 (Vcons 0 Vnil)))) :: (3%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (1%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil | (hd_symb M.s) => nil | (int_symb M.s) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__plus) => nil | (int_symb M.a__plus) => (1%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (3%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__and) => (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (int_symb M.a__and) => (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M._0_1) => nil | (int_symb M._0_1) => (1%Z, Vnil) :: nil | (hd_symb M.plus) => nil | (int_symb M.plus) => (1%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (3%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__isNatKind) => nil | (int_symb M.a__isNatKind) => nil | (hd_symb M.isNatKind) => nil | (int_symb M.isNatKind) => nil | (hd_symb M.and) => nil | (int_symb M.and) => (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.isNat) => nil | (int_symb M.isNat) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.U11) => nil | (int_symb M.U11) => (2%Z, (Vcons 1 (Vcons 0 (Vcons 0 Vnil)))) :: (1%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil | (hd_symb M.U12) => nil | (int_symb M.U12) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.U13) => nil | (int_symb M.U13) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.U21) => nil | (int_symb M.U21) => (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.U22) => nil | (int_symb M.U22) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.U31) => nil | (int_symb M.U31) => (1%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.U41) => nil | (int_symb M.U41) => (1%Z, (Vcons 0 (Vcons 0 (Vcons 0 Vnil)))) :: (3%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (1%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil end. Lemma trsInt_wm : forall f, pweak_monotone (trsInt f). Proof. pmonotone. Qed. End PIS2. Module PI2 := PolyInt PIS2. (* polynomial interpretation 3 *) Module PIS3 (*<: TPolyInt*). Definition sig := s1. Definition trsInt f := match f as f return poly (@ASignature.arity s1 f) with | (hd_symb M.a__U11) => nil | (int_symb M.a__U11) => (1%Z, (Vcons 1 (Vcons 0 (Vcons 0 Vnil)))) :: nil | (hd_symb M.tt) => nil | (int_symb M.tt) => (1%Z, Vnil) :: nil | (hd_symb M.a__U12) => nil | (int_symb M.a__U12) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: nil | (hd_symb M.a__isNat) => nil | (int_symb M.a__isNat) => (1%Z, (Vcons 0 Vnil)) :: nil | (hd_symb M.a__U13) => nil | (int_symb M.a__U13) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U21) => nil | (int_symb M.a__U21) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: nil | (hd_symb M.a__U22) => nil | (int_symb M.a__U22) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U31) => nil | (int_symb M.a__U31) => (1%Z, (Vcons 0 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.mark) => (2%Z, (Vcons 1 Vnil)) :: nil | (int_symb M.mark) => (1%Z, (Vcons 0 Vnil)) :: (2%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U41) => nil | (int_symb M.a__U41) => nil | (hd_symb M.s) => nil | (int_symb M.s) => nil | (hd_symb M.a__plus) => nil | (int_symb M.a__plus) => (1%Z, (Vcons 0 (Vcons 0 Vnil))) :: (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: nil | (hd_symb M.a__and) => (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (int_symb M.a__and) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M._0_1) => nil | (int_symb M._0_1) => nil | (hd_symb M.plus) => nil | (int_symb M.plus) => (1%Z, (Vcons 0 (Vcons 0 Vnil))) :: (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: nil | (hd_symb M.a__isNatKind) => nil | (int_symb M.a__isNatKind) => (1%Z, (Vcons 0 Vnil)) :: nil | (hd_symb M.isNatKind) => nil | (int_symb M.isNatKind) => nil | (hd_symb M.and) => nil | (int_symb M.and) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.isNat) => nil | (int_symb M.isNat) => (1%Z, (Vcons 0 Vnil)) :: nil | (hd_symb M.U11) => nil | (int_symb M.U11) => (1%Z, (Vcons 1 (Vcons 0 (Vcons 0 Vnil)))) :: nil | (hd_symb M.U12) => nil | (int_symb M.U12) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: nil | (hd_symb M.U13) => nil | (int_symb M.U13) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.U21) => nil | (int_symb M.U21) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: nil | (hd_symb M.U22) => nil | (int_symb M.U22) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.U31) => nil | (int_symb M.U31) => (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.U41) => nil | (int_symb M.U41) => nil end. Lemma trsInt_wm : forall f, pweak_monotone (trsInt f). Proof. pmonotone. Qed. End PIS3. Module PI3 := PolyInt PIS3. (* polynomial interpretation 4 *) Module PIS4 (*<: TPolyInt*). Definition sig := s1. Definition trsInt f := match f as f return poly (@ASignature.arity s1 f) with | (hd_symb M.a__U11) => (2%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil | (int_symb M.a__U11) => (2%Z, (Vcons 1 (Vcons 0 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (3%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil | (hd_symb M.tt) => nil | (int_symb M.tt) => nil | (hd_symb M.a__U12) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (int_symb M.a__U12) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (3%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__isNat) => nil | (int_symb M.a__isNat) => (2%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U13) => nil | (int_symb M.a__U13) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U21) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: nil | (int_symb M.a__U21) => (2%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__U22) => nil | (int_symb M.a__U22) => (1%Z, (Vcons 0 Vnil)) :: (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U31) => nil | (int_symb M.a__U31) => (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.mark) => (1%Z, (Vcons 1 Vnil)) :: nil | (int_symb M.mark) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U41) => nil | (int_symb M.a__U41) => (3%Z, (Vcons 0 (Vcons 0 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (1%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil | (hd_symb M.s) => nil | (int_symb M.s) => (2%Z, (Vcons 0 Vnil)) :: (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__plus) => nil | (int_symb M.a__plus) => (1%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__and) => (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (int_symb M.a__and) => (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M._0_1) => nil | (int_symb M._0_1) => nil | (hd_symb M.plus) => nil | (int_symb M.plus) => (1%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__isNatKind) => nil | (int_symb M.a__isNatKind) => nil | (hd_symb M.isNatKind) => nil | (int_symb M.isNatKind) => nil | (hd_symb M.and) => nil | (int_symb M.and) => (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.isNat) => nil | (int_symb M.isNat) => (2%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.U11) => nil | (int_symb M.U11) => (2%Z, (Vcons 1 (Vcons 0 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (3%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil | (hd_symb M.U12) => nil | (int_symb M.U12) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (3%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.U13) => nil | (int_symb M.U13) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.U21) => nil | (int_symb M.U21) => (2%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.U22) => nil | (int_symb M.U22) => (1%Z, (Vcons 0 Vnil)) :: (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.U31) => nil | (int_symb M.U31) => (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.U41) => nil | (int_symb M.U41) => (3%Z, (Vcons 0 (Vcons 0 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (1%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil end. Lemma trsInt_wm : forall f, pweak_monotone (trsInt f). Proof. pmonotone. Qed. End PIS4. Module PI4 := PolyInt PIS4. (* polynomial interpretation 5 *) Module PIS5 (*<: TPolyInt*). Definition sig := s1. Definition trsInt f := match f as f return poly (@ASignature.arity s1 f) with | (hd_symb M.a__U11) => (3%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (3%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil | (int_symb M.a__U11) => (3%Z, (Vcons 0 (Vcons 0 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 1 (Vcons 0 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (3%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil | (hd_symb M.tt) => nil | (int_symb M.tt) => nil | (hd_symb M.a__U12) => (3%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (int_symb M.a__U12) => (3%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__isNat) => nil | (int_symb M.a__isNat) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U13) => nil | (int_symb M.a__U13) => (3%Z, (Vcons 0 Vnil)) :: (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U21) => nil | (int_symb M.a__U21) => (2%Z, (Vcons 0 (Vcons 0 Vnil))) :: nil | (hd_symb M.a__U22) => nil | (int_symb M.a__U22) => (2%Z, (Vcons 0 Vnil)) :: nil | (hd_symb M.a__U31) => nil | (int_symb M.a__U31) => (3%Z, (Vcons 0 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.mark) => (2%Z, (Vcons 1 Vnil)) :: nil | (int_symb M.mark) => (2%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U41) => nil | (int_symb M.a__U41) => (2%Z, (Vcons 0 (Vcons 0 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil | (hd_symb M.s) => nil | (int_symb M.s) => (2%Z, (Vcons 0 Vnil)) :: nil | (hd_symb M.a__plus) => nil | (int_symb M.a__plus) => (3%Z, (Vcons 0 (Vcons 0 Vnil))) :: (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: (3%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__and) => (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (int_symb M.a__and) => (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M._0_1) => nil | (int_symb M._0_1) => (1%Z, Vnil) :: nil | (hd_symb M.plus) => nil | (int_symb M.plus) => (3%Z, (Vcons 0 (Vcons 0 Vnil))) :: (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: (3%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__isNatKind) => nil | (int_symb M.a__isNatKind) => nil | (hd_symb M.isNatKind) => nil | (int_symb M.isNatKind) => nil | (hd_symb M.and) => nil | (int_symb M.and) => (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.isNat) => nil | (int_symb M.isNat) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.U11) => nil | (int_symb M.U11) => (2%Z, (Vcons 0 (Vcons 0 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 1 (Vcons 0 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil | (hd_symb M.U12) => nil | (int_symb M.U12) => (2%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.U13) => nil | (int_symb M.U13) => (3%Z, (Vcons 0 Vnil)) :: (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.U21) => nil | (int_symb M.U21) => (1%Z, (Vcons 0 (Vcons 0 Vnil))) :: nil | (hd_symb M.U22) => nil | (int_symb M.U22) => (1%Z, (Vcons 0 Vnil)) :: nil | (hd_symb M.U31) => nil | (int_symb M.U31) => (2%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.U41) => nil | (int_symb M.U41) => (1%Z, (Vcons 0 (Vcons 0 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil end. Lemma trsInt_wm : forall f, pweak_monotone (trsInt f). Proof. pmonotone. Qed. End PIS5. Module PI5 := PolyInt PIS5. (* graph decomposition 3 *) Definition cs3 : list (list (@ATrs.rule s1)) := ( R1 (S1.hmark (S1.and (V1 0) (V1 1))) (S1.ha__and (S1.mark (V1 0)) (V1 1)) :: R1 (S1.ha__and (S1.tt) (V1 0)) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.and (V1 0) (V1 1))) (S1.hmark (V1 0)) :: R1 (S1.hmark (S1.isNatKind (V1 0))) (S1.ha__isNatKind (V1 0)) :: R1 (S1.ha__isNatKind (S1.plus (V1 0) (V1 1))) (S1.ha__and (S1.a__isNatKind (V1 0)) (S1.isNatKind (V1 1))) :: R1 (S1.ha__isNatKind (S1.plus (V1 0) (V1 1))) (S1.ha__isNatKind (V1 0)) :: R1 (S1.ha__isNatKind (S1.s (V1 0))) (S1.ha__isNatKind (V1 0)) :: nil) :: ( R1 (S1.ha__isNat (S1.s (V1 0))) (S1.ha__isNatKind (V1 0)) :: nil) :: ( R1 (S1.ha__isNat (S1.s (V1 0))) (S1.ha__U21 (S1.a__isNatKind (V1 0)) (V1 0)) :: R1 (S1.ha__U21 (S1.tt) (V1 0)) (S1.ha__isNat (V1 0)) :: nil) :: ( R1 (S1.ha__U11 (S1.tt) (V1 0) (V1 1)) (S1.ha__isNat (V1 0)) :: nil) :: ( R1 (S1.ha__U12 (S1.tt) (V1 0)) (S1.ha__isNat (V1 0)) :: nil) :: ( R1 (S1.ha__U11 (S1.tt) (V1 0) (V1 1)) (S1.ha__U12 (S1.a__isNat (V1 0)) (V1 1)) :: nil) :: nil. (* polynomial interpretation 6 *) Module PIS6 (*<: TPolyInt*). Definition sig := s1. Definition trsInt f := match f as f return poly (@ASignature.arity s1 f) with | (hd_symb M.a__U11) => nil | (int_symb M.a__U11) => nil | (hd_symb M.tt) => nil | (int_symb M.tt) => nil | (hd_symb M.a__U12) => nil | (int_symb M.a__U12) => nil | (hd_symb M.a__isNat) => nil | (int_symb M.a__isNat) => nil | (hd_symb M.a__U13) => nil | (int_symb M.a__U13) => nil | (hd_symb M.a__U21) => nil | (int_symb M.a__U21) => nil | (hd_symb M.a__U22) => nil | (int_symb M.a__U22) => nil | (hd_symb M.a__U31) => nil | (int_symb M.a__U31) => (2%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.mark) => (3%Z, (Vcons 1 Vnil)) :: nil | (int_symb M.mark) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U41) => nil | (int_symb M.a__U41) => (3%Z, (Vcons 0 (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.s) => nil | (int_symb M.s) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__plus) => nil | (int_symb M.a__plus) => (3%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__and) => (3%Z, (Vcons 0 (Vcons 0 Vnil))) :: (3%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (int_symb M.a__and) => (3%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M._0_1) => nil | (int_symb M._0_1) => nil | (hd_symb M.plus) => nil | (int_symb M.plus) => (3%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__isNatKind) => (3%Z, (Vcons 1 Vnil)) :: nil | (int_symb M.a__isNatKind) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.isNatKind) => nil | (int_symb M.isNatKind) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.and) => nil | (int_symb M.and) => (3%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.isNat) => nil | (int_symb M.isNat) => nil | (hd_symb M.U11) => nil | (int_symb M.U11) => nil | (hd_symb M.U12) => nil | (int_symb M.U12) => nil | (hd_symb M.U13) => nil | (int_symb M.U13) => nil | (hd_symb M.U21) => nil | (int_symb M.U21) => nil | (hd_symb M.U22) => nil | (int_symb M.U22) => nil | (hd_symb M.U31) => nil | (int_symb M.U31) => (2%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.U41) => nil | (int_symb M.U41) => (3%Z, (Vcons 0 (Vcons 0 (Vcons 0 Vnil)))) :: (1%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (1%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil end. Lemma trsInt_wm : forall f, pweak_monotone (trsInt f). Proof. pmonotone. Qed. End PIS6. Module PI6 := PolyInt PIS6. (* graph decomposition 4 *) Definition cs4 : list (list (@ATrs.rule s1)) := ( R1 (S1.ha__isNatKind (S1.s (V1 0))) (S1.ha__isNatKind (V1 0)) :: nil) :: ( R1 (S1.hmark (S1.isNatKind (V1 0))) (S1.ha__isNatKind (V1 0)) :: nil) :: nil. (* polynomial interpretation 7 *) Module PIS7 (*<: TPolyInt*). Definition sig := s1. Definition trsInt f := match f as f return poly (@ASignature.arity s1 f) with | (hd_symb M.a__U11) => nil | (int_symb M.a__U11) => nil | (hd_symb M.tt) => nil | (int_symb M.tt) => nil | (hd_symb M.a__U12) => nil | (int_symb M.a__U12) => nil | (hd_symb M.a__isNat) => nil | (int_symb M.a__isNat) => nil | (hd_symb M.a__U13) => nil | (int_symb M.a__U13) => (2%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U21) => nil | (int_symb M.a__U21) => nil | (hd_symb M.a__U22) => nil | (int_symb M.a__U22) => nil | (hd_symb M.a__U31) => nil | (int_symb M.a__U31) => (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.mark) => nil | (int_symb M.mark) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U41) => nil | (int_symb M.a__U41) => (1%Z, (Vcons 0 (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.s) => nil | (int_symb M.s) => (1%Z, (Vcons 0 Vnil)) :: (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__plus) => nil | (int_symb M.a__plus) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__and) => nil | (int_symb M.a__and) => (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M._0_1) => nil | (int_symb M._0_1) => nil | (hd_symb M.plus) => nil | (int_symb M.plus) => (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__isNatKind) => (1%Z, (Vcons 1 Vnil)) :: nil | (int_symb M.a__isNatKind) => nil | (hd_symb M.isNatKind) => nil | (int_symb M.isNatKind) => nil | (hd_symb M.and) => nil | (int_symb M.and) => (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.isNat) => nil | (int_symb M.isNat) => nil | (hd_symb M.U11) => nil | (int_symb M.U11) => nil | (hd_symb M.U12) => nil | (int_symb M.U12) => nil | (hd_symb M.U13) => nil | (int_symb M.U13) => (2%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.U21) => nil | (int_symb M.U21) => nil | (hd_symb M.U22) => nil | (int_symb M.U22) => nil | (hd_symb M.U31) => nil | (int_symb M.U31) => (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.U41) => nil | (int_symb M.U41) => (1%Z, (Vcons 0 (Vcons 0 (Vcons 0 Vnil)))) :: (1%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (1%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil end. Lemma trsInt_wm : forall f, pweak_monotone (trsInt f). Proof. pmonotone. Qed. End PIS7. Module PI7 := PolyInt PIS7. (* polynomial interpretation 8 *) Module PIS8 (*<: TPolyInt*). Definition sig := s1. Definition trsInt f := match f as f return poly (@ASignature.arity s1 f) with | (hd_symb M.a__U11) => nil | (int_symb M.a__U11) => nil | (hd_symb M.tt) => nil | (int_symb M.tt) => nil | (hd_symb M.a__U12) => nil | (int_symb M.a__U12) => nil | (hd_symb M.a__isNat) => (3%Z, (Vcons 0 Vnil)) :: (2%Z, (Vcons 1 Vnil)) :: nil | (int_symb M.a__isNat) => nil | (hd_symb M.a__U13) => nil | (int_symb M.a__U13) => nil | (hd_symb M.a__U21) => (3%Z, (Vcons 0 (Vcons 0 Vnil))) :: (1%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (int_symb M.a__U21) => nil | (hd_symb M.a__U22) => nil | (int_symb M.a__U22) => nil | (hd_symb M.a__U31) => nil | (int_symb M.a__U31) => (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.mark) => nil | (int_symb M.mark) => (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__U41) => nil | (int_symb M.a__U41) => (2%Z, (Vcons 0 (Vcons 0 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil | (hd_symb M.s) => nil | (int_symb M.s) => (2%Z, (Vcons 0 Vnil)) :: (1%Z, (Vcons 1 Vnil)) :: nil | (hd_symb M.a__plus) => nil | (int_symb M.a__plus) => (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__and) => nil | (int_symb M.a__and) => (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M._0_1) => nil | (int_symb M._0_1) => nil | (hd_symb M.plus) => nil | (int_symb M.plus) => (2%Z, (Vcons 1 (Vcons 0 Vnil))) :: (2%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.a__isNatKind) => nil | (int_symb M.a__isNatKind) => (1%Z, (Vcons 0 Vnil)) :: nil | (hd_symb M.isNatKind) => nil | (int_symb M.isNatKind) => (1%Z, (Vcons 0 Vnil)) :: nil | (hd_symb M.and) => nil | (int_symb M.and) => (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.isNat) => nil | (int_symb M.isNat) => nil | (hd_symb M.U11) => nil | (int_symb M.U11) => nil | (hd_symb M.U12) => nil | (int_symb M.U12) => nil | (hd_symb M.U13) => nil | (int_symb M.U13) => nil | (hd_symb M.U21) => nil | (int_symb M.U21) => nil | (hd_symb M.U22) => nil | (int_symb M.U22) => nil | (hd_symb M.U31) => nil | (int_symb M.U31) => (1%Z, (Vcons 0 (Vcons 1 Vnil))) :: nil | (hd_symb M.U41) => nil | (int_symb M.U41) => (2%Z, (Vcons 0 (Vcons 0 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 1 (Vcons 0 Vnil)))) :: (2%Z, (Vcons 0 (Vcons 0 (Vcons 1 Vnil)))) :: nil end. Lemma trsInt_wm : forall f, pweak_monotone (trsInt f). Proof. pmonotone. Qed. End PIS8. Module PI8 := PolyInt PIS8. (* graph decomposition 5 *) Definition cs5 : list (list (@ATrs.rule s1)) := ( R1 (S1.ha__U21 (S1.tt) (V1 0)) (S1.ha__isNat (V1 0)) :: nil) :: nil. (* 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. left. co_scc. left. co_scc. left. co_scc. right. PI1.prove_termination. 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) cs2; subst D; subst R. dpg_unif_N_correct. right. PI2.prove_termination. PI3.prove_termination. PI4.prove_termination. PI5.prove_termination. 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) cs3; subst D; subst R. dpg_unif_N_correct. right. PI6.prove_termination. 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) cs4; subst D; subst R. dpg_unif_N_correct. right. PI7.prove_termination. termination_trivial. left. co_scc. left. co_scc. right. PI8.prove_termination. 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) cs5; subst D; subst R. dpg_unif_N_correct. left. co_scc. left. co_scc. left. co_scc. left. co_scc. left. co_scc. left. co_scc. left. co_scc. Qed.