1 include "logic/equality.ma".
3 (* Inclusion of: GRP180-1.p *)
5 (* -------------------------------------------------------------------------- *)
7 (* File : GRP180-1 : TPTP v3.7.0. Bugfixed v1.2.1. *)
9 (* Domain : Group Theory (Lattice Ordered) *)
11 (* Problem : Consequence of converting between GLB and LUB *)
13 (* Version : [Fuc94] (equality) axioms. *)
17 (* Refs : [Fuc94] Fuchs (1994), The Application of Goal-Orientated Heuri *)
19 (* : [Sch95] Schulz (1995), Explanation Based Learning for Distribu *)
25 (* Status : Unsatisfiable *)
27 (* Rating : 0.44 v3.4.0, 0.62 v3.3.0, 0.50 v3.1.0, 0.44 v2.7.0, 0.55 v2.6.0, 0.50 v2.5.0, 0.25 v2.4.0, 0.00 v2.2.1, 0.78 v2.2.0, 0.86 v2.1.0, 0.86 v2.0.0 *)
29 (* Syntax : Number of clauses : 16 ( 0 non-Horn; 16 unit; 1 RR) *)
31 (* Number of atoms : 16 ( 16 equality) *)
33 (* Maximal clause size : 1 ( 1 average) *)
35 (* Number of predicates : 1 ( 0 propositional; 2-2 arity) *)
37 (* Number of functors : 7 ( 3 constant; 0-2 arity) *)
39 (* Number of variables : 33 ( 2 singleton) *)
41 (* Maximal term depth : 5 ( 2 average) *)
43 (* Comments : ORDERING LPO inverse > product > greatest_lower_bound > *)
45 (* least_upper_bound > identity > a > b *)
47 (* : ORDERING LPO greatest_lower_bound > least_upper_bound > *)
49 (* inverse > product > identity > a > b *)
51 (* : This is a standardized version of the problem that appears in *)
55 (* Bugfixes : v1.2.1 - Duplicate axioms in GRP004-2.ax removed. *)
57 (* -------------------------------------------------------------------------- *)
59 (* ----Include equality group theory axioms *)
61 (* Inclusion of: Axioms/GRP004-0.ax *)
63 (* -------------------------------------------------------------------------- *)
65 (* File : GRP004-0 : TPTP v3.7.0. Released v1.0.0. *)
67 (* Domain : Group Theory *)
69 (* Axioms : Group theory (equality) axioms *)
71 (* Version : [MOW76] (equality) axioms : *)
73 (* Reduced > Complete. *)
77 (* Refs : [MOW76] McCharen et al. (1976), Problems and Experiments for a *)
79 (* : [Wos88] Wos (1988), Automated Reasoning - 33 Basic Research Pr *)
87 (* Syntax : Number of clauses : 3 ( 0 non-Horn; 3 unit; 0 RR) *)
89 (* Number of atoms : 3 ( 3 equality) *)
91 (* Maximal clause size : 1 ( 1 average) *)
93 (* Number of predicates : 1 ( 0 propositional; 2-2 arity) *)
95 (* Number of functors : 3 ( 1 constant; 0-2 arity) *)
97 (* Number of variables : 5 ( 0 singleton) *)
99 (* Maximal term depth : 3 ( 2 average) *)
101 (* Comments : [MOW76] also contains redundant right_identity and *)
103 (* right_inverse axioms. *)
105 (* : These axioms are also used in [Wos88] p.186, also with *)
107 (* right_identity and right_inverse. *)
109 (* -------------------------------------------------------------------------- *)
111 (* ----For any x and y in the group x*y is also in the group. No clause *)
113 (* ----is needed here since this is an instance of reflexivity *)
115 (* ----There exists an identity element *)
117 (* ----For any x in the group, there exists an element y such that x*y = y*x *)
119 (* ----= identity. *)
121 (* ----The operation '*' is associative *)
123 (* -------------------------------------------------------------------------- *)
125 (* ----Include Lattice ordered group (equality) axioms *)
127 (* Inclusion of: Axioms/GRP004-2.ax *)
129 (* -------------------------------------------------------------------------- *)
131 (* File : GRP004-2 : TPTP v3.7.0. Bugfixed v1.2.0. *)
133 (* Domain : Group Theory (Lattice Ordered) *)
135 (* Axioms : Lattice ordered group (equality) axioms *)
137 (* Version : [Fuc94] (equality) axioms. *)
141 (* Refs : [Fuc94] Fuchs (1994), The Application of Goal-Orientated Heuri *)
143 (* : [Sch95] Schulz (1995), Explanation Based Learning for Distribu *)
145 (* Source : [Sch95] *)
151 (* Syntax : Number of clauses : 12 ( 0 non-Horn; 12 unit; 0 RR) *)
153 (* Number of atoms : 12 ( 12 equality) *)
155 (* Maximal clause size : 1 ( 1 average) *)
157 (* Number of predicates : 1 ( 0 propositional; 2-2 arity) *)
159 (* Number of functors : 3 ( 0 constant; 2-2 arity) *)
161 (* Number of variables : 28 ( 2 singleton) *)
163 (* Maximal term depth : 3 ( 2 average) *)
165 (* Comments : Requires GRP004-0.ax *)
167 (* -------------------------------------------------------------------------- *)
169 (* ----Specification of the least upper bound and greatest lower bound *)
171 (* ----Monotony of multiply *)
173 (* -------------------------------------------------------------------------- *)
175 (* -------------------------------------------------------------------------- *)
177 (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
180 ∀greatest_lower_bound:∀_:Univ.∀_:Univ.Univ.
182 ∀inverse:∀_:Univ.Univ.
183 ∀least_upper_bound:∀_:Univ.∀_:Univ.Univ.
184 ∀multiply:∀_:Univ.∀_:Univ.Univ.
185 ∀H0:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (multiply (greatest_lower_bound Y Z) X) (greatest_lower_bound (multiply Y X) (multiply Z X)).
186 ∀H1:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (multiply (least_upper_bound Y Z) X) (least_upper_bound (multiply Y X) (multiply Z X)).
187 ∀H2:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (multiply X (greatest_lower_bound Y Z)) (greatest_lower_bound (multiply X Y) (multiply X Z)).
188 ∀H3:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (multiply X (least_upper_bound Y Z)) (least_upper_bound (multiply X Y) (multiply X Z)).
189 ∀H4:∀X:Univ.∀Y:Univ.eq Univ (greatest_lower_bound X (least_upper_bound X Y)) X.
190 ∀H5:∀X:Univ.∀Y:Univ.eq Univ (least_upper_bound X (greatest_lower_bound X Y)) X.
191 ∀H6:∀X:Univ.eq Univ (greatest_lower_bound X X) X.
192 ∀H7:∀X:Univ.eq Univ (least_upper_bound X X) X.
193 ∀H8:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (least_upper_bound X (least_upper_bound Y Z)) (least_upper_bound (least_upper_bound X Y) Z).
194 ∀H9:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (greatest_lower_bound X (greatest_lower_bound Y Z)) (greatest_lower_bound (greatest_lower_bound X Y) Z).
195 ∀H10:∀X:Univ.∀Y:Univ.eq Univ (least_upper_bound X Y) (least_upper_bound Y X).
196 ∀H11:∀X:Univ.∀Y:Univ.eq Univ (greatest_lower_bound X Y) (greatest_lower_bound Y X).
197 ∀H12:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (multiply (multiply X Y) Z) (multiply X (multiply Y Z)).
198 ∀H13:∀X:Univ.eq Univ (multiply (inverse X) X) identity.
199 ∀H14:∀X:Univ.eq Univ (multiply identity X) X.eq Univ (multiply a (multiply (inverse (greatest_lower_bound a b)) b)) (least_upper_bound a b))
207 #greatest_lower_bound ##.
210 #least_upper_bound ##.
227 nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10,H11,H12,H13,H14 ##;
228 ntry (nassumption) ##;
231 (* -------------------------------------------------------------------------- *)