1 include "logic/equality.ma".
3 (* Inclusion of: LAT039-2.p *)
5 (* -------------------------------------------------------------------------- *)
7 (* File : LAT039-2 : TPTP v3.7.0. Released v2.4.0. *)
9 (* Domain : Lattice Theory *)
11 (* Problem : Every distributive lattice is modular *)
13 (* Version : [McC88] (equality) axioms. *)
15 (* English : Theorem formulation : Modularity is expressed by: *)
17 (* x <= y -> x v (y & z) = (x v y) & (x v z) *)
19 (* Refs : [DeN00] DeNivelle (2000), Email to G. Sutcliffe *)
21 (* [McC88] McCune (1988), Challenge Equality Problems in Lattice *)
23 (* Source : [DeN00] *)
25 (* Names : lattice-mod-3 [DeN00] *)
27 (* Status : Unsatisfiable *)
29 (* Rating : 0.00 v2.4.0 *)
31 (* Syntax : Number of clauses : 12 ( 0 non-Horn; 12 unit; 2 RR) *)
33 (* Number of atoms : 12 ( 12 equality) *)
35 (* Maximal clause size : 1 ( 1 average) *)
37 (* Number of predicates : 1 ( 0 propositional; 2-2 arity) *)
39 (* Number of functors : 5 ( 3 constant; 0-2 arity) *)
41 (* Number of variables : 22 ( 2 singleton) *)
43 (* Maximal term depth : 3 ( 2 average) *)
47 (* -------------------------------------------------------------------------- *)
49 (* ----Include lattice theory axioms *)
51 (* Inclusion of: Axioms/LAT001-0.ax *)
53 (* -------------------------------------------------------------------------- *)
55 (* File : LAT001-0 : TPTP v3.7.0. Released v1.0.0. *)
57 (* Domain : Lattice Theory *)
59 (* Axioms : Lattice theory (equality) axioms *)
61 (* Version : [McC88] (equality) axioms. *)
65 (* Refs : [Bum65] Bumcroft (1965), Proceedings of the Glasgow Mathematic *)
67 (* : [McC88] McCune (1988), Challenge Equality Problems in Lattice *)
69 (* : [Wos88] Wos (1988), Automated Reasoning - 33 Basic Research Pr *)
71 (* Source : [McC88] *)
77 (* Syntax : Number of clauses : 8 ( 0 non-Horn; 8 unit; 0 RR) *)
79 (* Number of atoms : 8 ( 8 equality) *)
81 (* Maximal clause size : 1 ( 1 average) *)
83 (* Number of predicates : 1 ( 0 propositional; 2-2 arity) *)
85 (* Number of functors : 2 ( 0 constant; 2-2 arity) *)
87 (* Number of variables : 16 ( 2 singleton) *)
89 (* Maximal term depth : 3 ( 2 average) *)
93 (* -------------------------------------------------------------------------- *)
95 (* ----The following 8 clauses characterise lattices *)
97 (* -------------------------------------------------------------------------- *)
99 (* -------------------------------------------------------------------------- *)
101 (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
102 ∀join:∀_:Univ.∀_:Univ.Univ.
103 ∀meet:∀_:Univ.∀_:Univ.Univ.
107 ∀H0:eq Univ (join xx yy) yy.
108 ∀H1:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (meet X (join Y Z)) (join (meet X Y) (meet X Z)).
109 ∀H2:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (join X (meet Y Z)) (meet (join X Y) (join X Z)).
110 ∀H3:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (join (join X Y) Z) (join X (join Y Z)).
111 ∀H4:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (meet (meet X Y) Z) (meet X (meet Y Z)).
112 ∀H5:∀X:Univ.∀Y:Univ.eq Univ (join X Y) (join Y X).
113 ∀H6:∀X:Univ.∀Y:Univ.eq Univ (meet X Y) (meet Y X).
114 ∀H7:∀X:Univ.∀Y:Univ.eq Univ (join X (meet X Y)) X.
115 ∀H8:∀X:Univ.∀Y:Univ.eq Univ (meet X (join X Y)) X.
116 ∀H9:∀X:Univ.eq Univ (join X X) X.
117 ∀H10:∀X:Univ.eq Univ (meet X X) X.eq Univ (join xx (meet yy zz)) (meet (join xx yy) (join xx zz)))
139 nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10 ##;
140 ntry (nassumption) ##;
143 (* -------------------------------------------------------------------------- *)