TSTP Solution File: REL033-2 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : REL033-2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 13:44:18 EDT 2023
% Result : Unsatisfiable 101.33s 13.34s
% Output : Proof 102.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : REL033-2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.16/0.34 % Computer : n025.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Fri Aug 25 22:49:37 EDT 2023
% 0.16/0.34 % CPUTime :
% 101.33/13.34 Command-line arguments: --no-flatten-goal
% 101.33/13.34
% 101.33/13.34 % SZS status Unsatisfiable
% 101.33/13.34
% 102.47/13.49 % SZS output start Proof
% 102.47/13.49 Take the following subset of the input axioms:
% 102.47/13.49 fof(composition_associativity_5, axiom, ![A, B, C]: composition(A, composition(B, C))=composition(composition(A, B), C)).
% 102.47/13.49 fof(composition_distributivity_7, axiom, ![A2, B2, C2]: composition(join(A2, B2), C2)=join(composition(A2, C2), composition(B2, C2))).
% 102.47/13.49 fof(composition_identity_6, axiom, ![A2]: composition(A2, one)=A2).
% 102.47/13.49 fof(converse_additivity_9, axiom, ![A2, B2]: converse(join(A2, B2))=join(converse(A2), converse(B2))).
% 102.47/13.49 fof(converse_cancellativity_11, axiom, ![A2, B2]: join(composition(converse(A2), complement(composition(A2, B2))), complement(B2))=complement(B2)).
% 102.47/13.49 fof(converse_idempotence_8, axiom, ![A2]: converse(converse(A2))=A2).
% 102.47/13.49 fof(converse_multiplicativity_10, axiom, ![A2, B2]: converse(composition(A2, B2))=composition(converse(B2), converse(A2))).
% 102.47/13.49 fof(def_top_12, axiom, ![A2]: top=join(A2, complement(A2))).
% 102.47/13.49 fof(def_zero_13, axiom, ![A2]: zero=meet(A2, complement(A2))).
% 102.47/13.49 fof(goals_14, negated_conjecture, composition(sk1, top)=sk1).
% 102.47/13.49 fof(goals_15, negated_conjecture, join(composition(meet(sk1, sk2), sk3), meet(sk1, composition(sk2, sk3)))!=meet(sk1, composition(sk2, sk3)) | join(meet(sk1, composition(sk2, sk3)), composition(meet(sk1, sk2), sk3))!=composition(meet(sk1, sk2), sk3)).
% 102.47/13.49 fof(maddux1_join_commutativity_1, axiom, ![A2, B2]: join(A2, B2)=join(B2, A2)).
% 102.47/13.49 fof(maddux2_join_associativity_2, axiom, ![A2, B2, C2]: join(A2, join(B2, C2))=join(join(A2, B2), C2)).
% 102.47/13.49 fof(maddux3_a_kind_of_de_Morgan_3, axiom, ![A2, B2]: A2=join(complement(join(complement(A2), complement(B2))), complement(join(complement(A2), B2)))).
% 102.47/13.49 fof(maddux4_definiton_of_meet_4, axiom, ![A2, B2]: meet(A2, B2)=complement(join(complement(A2), complement(B2)))).
% 102.47/13.49
% 102.47/13.49 Now clausify the problem and encode Horn clauses using encoding 3 of
% 102.47/13.49 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 102.47/13.49 We repeatedly replace C & s=t => u=v by the two clauses:
% 102.47/13.49 fresh(y, y, x1...xn) = u
% 102.47/13.49 C => fresh(s, t, x1...xn) = v
% 102.47/13.49 where fresh is a fresh function symbol and x1..xn are the free
% 102.47/13.49 variables of u and v.
% 102.47/13.49 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 102.47/13.49 input problem has no model of domain size 1).
% 102.47/13.49
% 102.47/13.49 The encoding turns the above axioms into the following unit equations and goals:
% 102.47/13.49
% 102.47/13.49 Axiom 1 (converse_idempotence_8): converse(converse(X)) = X.
% 102.47/13.49 Axiom 2 (maddux1_join_commutativity_1): join(X, Y) = join(Y, X).
% 102.47/13.49 Axiom 3 (composition_identity_6): composition(X, one) = X.
% 102.47/13.49 Axiom 4 (goals_14): composition(sk1, top) = sk1.
% 102.47/13.49 Axiom 5 (def_zero_13): zero = meet(X, complement(X)).
% 102.47/13.49 Axiom 6 (def_top_12): top = join(X, complement(X)).
% 102.47/13.49 Axiom 7 (converse_additivity_9): converse(join(X, Y)) = join(converse(X), converse(Y)).
% 102.47/13.49 Axiom 8 (maddux2_join_associativity_2): join(X, join(Y, Z)) = join(join(X, Y), Z).
% 102.47/13.49 Axiom 9 (converse_multiplicativity_10): converse(composition(X, Y)) = composition(converse(Y), converse(X)).
% 102.47/13.49 Axiom 10 (composition_associativity_5): composition(X, composition(Y, Z)) = composition(composition(X, Y), Z).
% 102.47/13.49 Axiom 11 (maddux4_definiton_of_meet_4): meet(X, Y) = complement(join(complement(X), complement(Y))).
% 102.47/13.49 Axiom 12 (composition_distributivity_7): composition(join(X, Y), Z) = join(composition(X, Z), composition(Y, Z)).
% 102.47/13.49 Axiom 13 (converse_cancellativity_11): join(composition(converse(X), complement(composition(X, Y))), complement(Y)) = complement(Y).
% 102.47/13.49 Axiom 14 (maddux3_a_kind_of_de_Morgan_3): X = join(complement(join(complement(X), complement(Y))), complement(join(complement(X), Y))).
% 102.47/13.49
% 102.47/13.49 Lemma 15: complement(top) = zero.
% 102.47/13.49 Proof:
% 102.47/13.49 complement(top)
% 102.47/13.49 = { by axiom 6 (def_top_12) }
% 102.47/13.49 complement(join(complement(X), complement(complement(X))))
% 102.47/13.49 = { by axiom 11 (maddux4_definiton_of_meet_4) R->L }
% 102.47/13.49 meet(X, complement(X))
% 102.47/13.49 = { by axiom 5 (def_zero_13) R->L }
% 102.47/13.49 zero
% 102.47/13.49
% 102.47/13.49 Lemma 16: converse(composition(converse(X), Y)) = composition(converse(Y), X).
% 102.47/13.49 Proof:
% 102.47/13.49 converse(composition(converse(X), Y))
% 102.47/13.49 = { by axiom 9 (converse_multiplicativity_10) }
% 102.47/13.49 composition(converse(Y), converse(converse(X)))
% 102.47/13.49 = { by axiom 1 (converse_idempotence_8) }
% 102.47/13.49 composition(converse(Y), X)
% 102.47/13.49
% 102.47/13.49 Lemma 17: composition(converse(one), X) = X.
% 102.47/13.49 Proof:
% 102.47/13.49 composition(converse(one), X)
% 102.47/13.49 = { by lemma 16 R->L }
% 102.47/13.49 converse(composition(converse(X), one))
% 102.47/13.49 = { by axiom 3 (composition_identity_6) }
% 102.47/13.49 converse(converse(X))
% 102.47/13.49 = { by axiom 1 (converse_idempotence_8) }
% 102.47/13.49 X
% 102.47/13.49
% 102.47/13.49 Lemma 18: composition(one, X) = X.
% 102.47/13.49 Proof:
% 102.47/13.49 composition(one, X)
% 102.47/13.49 = { by lemma 17 R->L }
% 102.47/13.49 composition(converse(one), composition(one, X))
% 102.47/13.49 = { by axiom 10 (composition_associativity_5) }
% 102.47/13.49 composition(composition(converse(one), one), X)
% 102.47/13.49 = { by axiom 3 (composition_identity_6) }
% 102.47/13.49 composition(converse(one), X)
% 102.47/13.49 = { by lemma 17 }
% 102.47/13.50 X
% 102.47/13.50
% 102.47/13.50 Lemma 19: join(complement(X), composition(converse(Y), complement(composition(Y, X)))) = complement(X).
% 102.47/13.50 Proof:
% 102.47/13.50 join(complement(X), composition(converse(Y), complement(composition(Y, X))))
% 102.47/13.50 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.50 join(composition(converse(Y), complement(composition(Y, X))), complement(X))
% 102.47/13.50 = { by axiom 13 (converse_cancellativity_11) }
% 102.47/13.50 complement(X)
% 102.47/13.50
% 102.47/13.50 Lemma 20: join(complement(X), complement(X)) = complement(X).
% 102.47/13.50 Proof:
% 102.47/13.50 join(complement(X), complement(X))
% 102.47/13.50 = { by lemma 17 R->L }
% 102.47/13.50 join(complement(X), composition(converse(one), complement(X)))
% 102.47/13.50 = { by lemma 18 R->L }
% 102.47/13.50 join(complement(X), composition(converse(one), complement(composition(one, X))))
% 102.47/13.50 = { by lemma 19 }
% 102.47/13.50 complement(X)
% 102.47/13.50
% 102.47/13.50 Lemma 21: join(meet(X, Y), complement(join(complement(X), Y))) = X.
% 102.47/13.50 Proof:
% 102.47/13.50 join(meet(X, Y), complement(join(complement(X), Y)))
% 102.47/13.50 = { by axiom 11 (maddux4_definiton_of_meet_4) }
% 102.47/13.50 join(complement(join(complement(X), complement(Y))), complement(join(complement(X), Y)))
% 102.47/13.50 = { by axiom 14 (maddux3_a_kind_of_de_Morgan_3) R->L }
% 102.47/13.50 X
% 102.47/13.50
% 102.47/13.50 Lemma 22: join(zero, meet(X, X)) = X.
% 102.47/13.50 Proof:
% 102.47/13.50 join(zero, meet(X, X))
% 102.47/13.50 = { by axiom 11 (maddux4_definiton_of_meet_4) }
% 102.47/13.50 join(zero, complement(join(complement(X), complement(X))))
% 102.47/13.50 = { by axiom 5 (def_zero_13) }
% 102.47/13.50 join(meet(X, complement(X)), complement(join(complement(X), complement(X))))
% 102.47/13.50 = { by lemma 21 }
% 102.47/13.50 X
% 102.47/13.50
% 102.47/13.50 Lemma 23: join(zero, join(X, meet(Y, Y))) = join(X, Y).
% 102.47/13.50 Proof:
% 102.47/13.50 join(zero, join(X, meet(Y, Y)))
% 102.47/13.50 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.50 join(zero, join(meet(Y, Y), X))
% 102.47/13.50 = { by axiom 8 (maddux2_join_associativity_2) }
% 102.47/13.50 join(join(zero, meet(Y, Y)), X)
% 102.47/13.50 = { by lemma 22 }
% 102.47/13.50 join(Y, X)
% 102.47/13.50 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.50 join(X, Y)
% 102.47/13.50
% 102.47/13.50 Lemma 24: join(X, join(Y, complement(X))) = join(Y, top).
% 102.47/13.50 Proof:
% 102.47/13.50 join(X, join(Y, complement(X)))
% 102.47/13.50 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.50 join(X, join(complement(X), Y))
% 102.47/13.50 = { by axiom 8 (maddux2_join_associativity_2) }
% 102.47/13.50 join(join(X, complement(X)), Y)
% 102.47/13.50 = { by axiom 6 (def_top_12) R->L }
% 102.47/13.50 join(top, Y)
% 102.47/13.50 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.50 join(Y, top)
% 102.47/13.50
% 102.47/13.50 Lemma 25: join(top, complement(X)) = top.
% 102.47/13.50 Proof:
% 102.47/13.50 join(top, complement(X))
% 102.47/13.50 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.50 join(complement(X), top)
% 102.47/13.50 = { by lemma 24 R->L }
% 102.47/13.50 join(X, join(complement(X), complement(X)))
% 102.47/13.50 = { by lemma 20 }
% 102.47/13.50 join(X, complement(X))
% 102.47/13.50 = { by axiom 6 (def_top_12) R->L }
% 102.47/13.50 top
% 102.47/13.50
% 102.47/13.50 Lemma 26: join(Y, top) = join(X, top).
% 102.47/13.50 Proof:
% 102.47/13.50 join(Y, top)
% 102.47/13.50 = { by lemma 25 R->L }
% 102.47/13.50 join(Y, join(top, complement(Y)))
% 102.47/13.50 = { by lemma 24 }
% 102.47/13.50 join(top, top)
% 102.47/13.50 = { by lemma 24 R->L }
% 102.47/13.50 join(X, join(top, complement(X)))
% 102.47/13.50 = { by lemma 25 }
% 102.47/13.50 join(X, top)
% 102.47/13.50
% 102.47/13.50 Lemma 27: join(X, top) = top.
% 102.47/13.50 Proof:
% 102.47/13.50 join(X, top)
% 102.47/13.50 = { by lemma 26 }
% 102.47/13.50 join(zero, top)
% 102.47/13.50 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.50 join(top, zero)
% 102.47/13.50 = { by lemma 15 R->L }
% 102.47/13.50 join(top, complement(top))
% 102.47/13.50 = { by axiom 6 (def_top_12) R->L }
% 102.47/13.50 top
% 102.47/13.50
% 102.47/13.50 Lemma 28: join(X, join(complement(X), Y)) = top.
% 102.47/13.50 Proof:
% 102.47/13.50 join(X, join(complement(X), Y))
% 102.47/13.50 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.50 join(X, join(Y, complement(X)))
% 102.47/13.50 = { by lemma 24 }
% 102.47/13.50 join(Y, top)
% 102.47/13.50 = { by lemma 26 R->L }
% 102.47/13.50 join(Z, top)
% 102.47/13.50 = { by lemma 27 }
% 102.47/13.50 top
% 102.47/13.50
% 102.47/13.50 Lemma 29: join(X, complement(zero)) = top.
% 102.47/13.50 Proof:
% 102.47/13.50 join(X, complement(zero))
% 102.47/13.50 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.50 join(complement(zero), X)
% 102.47/13.50 = { by lemma 23 R->L }
% 102.47/13.50 join(zero, join(complement(zero), meet(X, X)))
% 102.47/13.50 = { by lemma 28 }
% 102.47/13.50 top
% 102.47/13.50
% 102.47/13.50 Lemma 30: complement(zero) = top.
% 102.47/13.50 Proof:
% 102.47/13.50 complement(zero)
% 102.47/13.50 = { by lemma 20 R->L }
% 102.47/13.50 join(complement(zero), complement(zero))
% 102.47/13.50 = { by lemma 29 }
% 102.47/13.50 top
% 102.47/13.50
% 102.47/13.50 Lemma 31: converse(one) = one.
% 102.47/13.50 Proof:
% 102.47/13.50 converse(one)
% 102.47/13.50 = { by axiom 3 (composition_identity_6) R->L }
% 102.47/13.50 composition(converse(one), one)
% 102.47/13.50 = { by lemma 17 }
% 102.47/13.50 one
% 102.47/13.50
% 102.47/13.50 Lemma 32: converse(join(X, converse(Y))) = join(Y, converse(X)).
% 102.47/13.50 Proof:
% 102.47/13.50 converse(join(X, converse(Y)))
% 102.47/13.50 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.50 converse(join(converse(Y), X))
% 102.47/13.50 = { by axiom 7 (converse_additivity_9) }
% 102.47/13.50 join(converse(converse(Y)), converse(X))
% 102.47/13.50 = { by axiom 1 (converse_idempotence_8) }
% 102.47/13.50 join(Y, converse(X))
% 102.47/13.50
% 102.47/13.50 Lemma 33: converse(join(converse(X), Y)) = join(X, converse(Y)).
% 102.47/13.50 Proof:
% 102.47/13.50 converse(join(converse(X), Y))
% 102.47/13.50 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.50 converse(join(Y, converse(X)))
% 102.47/13.50 = { by lemma 32 }
% 102.47/13.50 join(X, converse(Y))
% 102.47/13.50
% 102.47/13.50 Lemma 34: join(X, converse(top)) = top.
% 102.47/13.50 Proof:
% 102.47/13.50 join(X, converse(top))
% 102.47/13.50 = { by axiom 6 (def_top_12) }
% 102.47/13.50 join(X, converse(join(converse(complement(X)), complement(converse(complement(X))))))
% 102.47/13.50 = { by lemma 33 }
% 102.47/13.50 join(X, join(complement(X), converse(complement(converse(complement(X))))))
% 102.47/13.50 = { by lemma 28 }
% 102.47/13.50 top
% 102.47/13.50
% 102.47/13.50 Lemma 35: converse(top) = top.
% 102.47/13.50 Proof:
% 102.47/13.50 converse(top)
% 102.47/13.50 = { by lemma 27 R->L }
% 102.47/13.50 converse(join(X, top))
% 102.47/13.50 = { by axiom 7 (converse_additivity_9) }
% 102.47/13.50 join(converse(X), converse(top))
% 102.47/13.50 = { by lemma 34 }
% 102.47/13.50 top
% 102.47/13.50
% 102.47/13.50 Lemma 36: complement(complement(X)) = meet(X, X).
% 102.47/13.50 Proof:
% 102.47/13.50 complement(complement(X))
% 102.47/13.50 = { by lemma 20 R->L }
% 102.47/13.50 complement(join(complement(X), complement(X)))
% 102.47/13.50 = { by axiom 11 (maddux4_definiton_of_meet_4) R->L }
% 102.47/13.50 meet(X, X)
% 102.47/13.50
% 102.47/13.50 Lemma 37: meet(Y, X) = meet(X, Y).
% 102.47/13.50 Proof:
% 102.47/13.50 meet(Y, X)
% 102.47/13.50 = { by axiom 11 (maddux4_definiton_of_meet_4) }
% 102.47/13.50 complement(join(complement(Y), complement(X)))
% 102.47/13.50 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.50 complement(join(complement(X), complement(Y)))
% 102.47/13.50 = { by axiom 11 (maddux4_definiton_of_meet_4) R->L }
% 102.47/13.50 meet(X, Y)
% 102.47/13.50
% 102.47/13.50 Lemma 38: complement(join(zero, complement(X))) = meet(X, top).
% 102.47/13.50 Proof:
% 102.47/13.50 complement(join(zero, complement(X)))
% 102.47/13.50 = { by lemma 15 R->L }
% 102.47/13.50 complement(join(complement(top), complement(X)))
% 102.47/13.50 = { by axiom 11 (maddux4_definiton_of_meet_4) R->L }
% 102.47/13.50 meet(top, X)
% 102.47/13.50 = { by lemma 37 R->L }
% 102.47/13.50 meet(X, top)
% 102.47/13.50
% 102.47/13.50 Lemma 39: join(meet(X, Y), meet(X, complement(Y))) = X.
% 102.47/13.50 Proof:
% 102.47/13.50 join(meet(X, Y), meet(X, complement(Y)))
% 102.47/13.50 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.50 join(meet(X, complement(Y)), meet(X, Y))
% 102.47/13.50 = { by axiom 11 (maddux4_definiton_of_meet_4) }
% 102.47/13.50 join(meet(X, complement(Y)), complement(join(complement(X), complement(Y))))
% 102.47/13.50 = { by lemma 21 }
% 102.47/13.50 X
% 102.47/13.50
% 102.47/13.50 Lemma 40: join(zero, meet(X, top)) = X.
% 102.47/13.50 Proof:
% 102.47/13.50 join(zero, meet(X, top))
% 102.47/13.50 = { by lemma 30 R->L }
% 102.47/13.50 join(zero, meet(X, complement(zero)))
% 102.47/13.50 = { by lemma 15 R->L }
% 102.47/13.50 join(complement(top), meet(X, complement(zero)))
% 102.47/13.50 = { by lemma 29 R->L }
% 102.47/13.50 join(complement(join(complement(X), complement(zero))), meet(X, complement(zero)))
% 102.47/13.50 = { by axiom 11 (maddux4_definiton_of_meet_4) R->L }
% 102.47/13.50 join(meet(X, zero), meet(X, complement(zero)))
% 102.47/13.50 = { by lemma 39 }
% 102.47/13.50 X
% 102.47/13.50
% 102.47/13.50 Lemma 41: join(zero, complement(X)) = complement(X).
% 102.47/13.50 Proof:
% 102.47/13.50 join(zero, complement(X))
% 102.47/13.50 = { by lemma 22 R->L }
% 102.47/13.50 join(zero, complement(join(zero, meet(X, X))))
% 102.47/13.50 = { by lemma 36 R->L }
% 102.47/13.51 join(zero, complement(join(zero, complement(complement(X)))))
% 102.47/13.51 = { by lemma 38 }
% 102.47/13.51 join(zero, meet(complement(X), top))
% 102.47/13.51 = { by lemma 40 }
% 102.47/13.51 complement(X)
% 102.47/13.51
% 102.47/13.51 Lemma 42: complement(complement(X)) = X.
% 102.47/13.51 Proof:
% 102.47/13.51 complement(complement(X))
% 102.47/13.51 = { by lemma 41 R->L }
% 102.47/13.51 join(zero, complement(complement(X)))
% 102.47/13.51 = { by lemma 36 }
% 102.47/13.51 join(zero, meet(X, X))
% 102.47/13.51 = { by lemma 22 }
% 102.47/13.51 X
% 102.47/13.51
% 102.47/13.51 Lemma 43: join(X, X) = X.
% 102.47/13.51 Proof:
% 102.47/13.51 join(X, X)
% 102.47/13.51 = { by lemma 42 R->L }
% 102.47/13.51 join(X, complement(complement(X)))
% 102.47/13.51 = { by lemma 42 R->L }
% 102.47/13.51 join(complement(complement(X)), complement(complement(X)))
% 102.47/13.51 = { by lemma 20 }
% 102.47/13.51 complement(complement(X))
% 102.47/13.51 = { by lemma 42 }
% 102.47/13.51 X
% 102.47/13.51
% 102.47/13.51 Lemma 44: join(X, zero) = X.
% 102.47/13.51 Proof:
% 102.47/13.51 join(X, zero)
% 102.47/13.51 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.51 join(zero, X)
% 102.47/13.51 = { by lemma 42 R->L }
% 102.47/13.51 join(zero, complement(complement(X)))
% 102.47/13.51 = { by lemma 36 }
% 102.47/13.51 join(zero, meet(X, X))
% 102.47/13.51 = { by lemma 22 }
% 102.47/13.51 X
% 102.47/13.51
% 102.47/13.51 Lemma 45: join(top, X) = top.
% 102.47/13.51 Proof:
% 102.47/13.51 join(top, X)
% 102.47/13.51 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.51 join(X, top)
% 102.47/13.51 = { by lemma 26 R->L }
% 102.47/13.51 join(Y, top)
% 102.47/13.51 = { by lemma 27 }
% 102.47/13.51 top
% 102.47/13.51
% 102.47/13.51 Lemma 46: join(zero, X) = X.
% 102.47/13.51 Proof:
% 102.47/13.51 join(zero, X)
% 102.47/13.51 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.51 join(X, zero)
% 102.47/13.51 = { by lemma 44 }
% 102.47/13.51 X
% 102.47/13.51
% 102.47/13.51 Lemma 47: meet(X, X) = X.
% 102.47/13.51 Proof:
% 102.47/13.51 meet(X, X)
% 102.47/13.51 = { by lemma 36 R->L }
% 102.47/13.51 complement(complement(X))
% 102.47/13.51 = { by lemma 42 }
% 102.47/13.51 X
% 102.47/13.51
% 102.47/13.51 Lemma 48: meet(X, top) = X.
% 102.47/13.51 Proof:
% 102.47/13.51 meet(X, top)
% 102.47/13.51 = { by lemma 38 R->L }
% 102.47/13.51 complement(join(zero, complement(X)))
% 102.47/13.51 = { by lemma 41 R->L }
% 102.47/13.51 join(zero, complement(join(zero, complement(X))))
% 102.47/13.51 = { by lemma 38 }
% 102.47/13.51 join(zero, meet(X, top))
% 102.47/13.51 = { by lemma 40 }
% 102.47/13.51 X
% 102.47/13.51
% 102.47/13.51 Lemma 49: meet(top, X) = X.
% 102.47/13.51 Proof:
% 102.47/13.51 meet(top, X)
% 102.47/13.51 = { by lemma 37 }
% 102.47/13.51 meet(X, top)
% 102.47/13.51 = { by lemma 48 }
% 102.47/13.51 X
% 102.47/13.51
% 102.47/13.51 Lemma 50: composition(join(one, Y), X) = join(X, composition(Y, X)).
% 102.47/13.51 Proof:
% 102.47/13.51 composition(join(one, Y), X)
% 102.47/13.51 = { by axiom 12 (composition_distributivity_7) }
% 102.47/13.51 join(composition(one, X), composition(Y, X))
% 102.47/13.51 = { by lemma 18 }
% 102.47/13.51 join(X, composition(Y, X))
% 102.47/13.51
% 102.47/13.51 Lemma 51: join(X, composition(top, X)) = composition(top, X).
% 102.47/13.51 Proof:
% 102.47/13.51 join(X, composition(top, X))
% 102.47/13.51 = { by lemma 35 R->L }
% 102.47/13.51 join(X, composition(converse(top), X))
% 102.47/13.51 = { by lemma 50 R->L }
% 102.47/13.51 composition(join(one, converse(top)), X)
% 102.47/13.51 = { by lemma 34 }
% 102.47/13.51 composition(top, X)
% 102.47/13.51
% 102.47/13.51 Lemma 52: composition(top, zero) = zero.
% 102.47/13.51 Proof:
% 102.47/13.51 composition(top, zero)
% 102.47/13.51 = { by lemma 35 R->L }
% 102.47/13.51 composition(converse(top), zero)
% 102.47/13.51 = { by lemma 46 R->L }
% 102.47/13.51 join(zero, composition(converse(top), zero))
% 102.47/13.51 = { by lemma 15 R->L }
% 102.47/13.51 join(complement(top), composition(converse(top), zero))
% 102.47/13.51 = { by lemma 15 R->L }
% 102.47/13.51 join(complement(top), composition(converse(top), complement(top)))
% 102.47/13.51 = { by lemma 45 R->L }
% 102.47/13.51 join(complement(top), composition(converse(top), complement(join(top, composition(top, top)))))
% 102.47/13.51 = { by lemma 51 }
% 102.47/13.51 join(complement(top), composition(converse(top), complement(composition(top, top))))
% 102.47/13.51 = { by lemma 19 }
% 102.47/13.51 complement(top)
% 102.47/13.51 = { by lemma 15 }
% 102.47/13.51 zero
% 102.47/13.51
% 102.47/13.51 Lemma 53: composition(converse(sk1), complement(sk1)) = zero.
% 102.47/13.51 Proof:
% 102.47/13.51 composition(converse(sk1), complement(sk1))
% 102.47/13.51 = { by lemma 46 R->L }
% 102.47/13.51 join(zero, composition(converse(sk1), complement(sk1)))
% 102.47/13.51 = { by lemma 15 R->L }
% 102.47/13.51 join(complement(top), composition(converse(sk1), complement(sk1)))
% 102.47/13.51 = { by axiom 4 (goals_14) R->L }
% 102.47/13.51 join(complement(top), composition(converse(sk1), complement(composition(sk1, top))))
% 102.47/13.51 = { by lemma 19 }
% 102.47/13.51 complement(top)
% 102.47/13.51 = { by lemma 15 }
% 102.47/13.51 zero
% 102.47/13.51
% 102.47/13.51 Lemma 54: composition(converse(complement(sk1)), composition(sk1, X)) = converse(zero).
% 102.47/13.51 Proof:
% 102.47/13.51 composition(converse(complement(sk1)), composition(sk1, X))
% 102.47/13.51 = { by lemma 16 R->L }
% 102.47/13.51 converse(composition(converse(composition(sk1, X)), complement(sk1)))
% 102.47/13.51 = { by axiom 9 (converse_multiplicativity_10) }
% 102.47/13.51 converse(composition(composition(converse(X), converse(sk1)), complement(sk1)))
% 102.47/13.51 = { by axiom 10 (composition_associativity_5) R->L }
% 102.47/13.51 converse(composition(converse(X), composition(converse(sk1), complement(sk1))))
% 102.47/13.51 = { by lemma 53 }
% 102.47/13.51 converse(composition(converse(X), zero))
% 102.47/13.51 = { by lemma 46 R->L }
% 102.47/13.51 converse(join(zero, composition(converse(X), zero)))
% 102.47/13.51 = { by lemma 52 R->L }
% 102.47/13.51 converse(join(composition(top, zero), composition(converse(X), zero)))
% 102.47/13.51 = { by axiom 12 (composition_distributivity_7) R->L }
% 102.47/13.51 converse(composition(join(top, converse(X)), zero))
% 102.47/13.51 = { by lemma 45 }
% 102.47/13.51 converse(composition(top, zero))
% 102.47/13.51 = { by lemma 52 }
% 102.47/13.51 converse(zero)
% 102.47/13.51
% 102.47/13.51 Lemma 55: join(converse(zero), X) = X.
% 102.47/13.51 Proof:
% 102.47/13.51 join(converse(zero), X)
% 102.47/13.51 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.51 join(X, converse(zero))
% 102.47/13.51 = { by lemma 54 R->L }
% 102.47/13.51 join(X, composition(converse(complement(sk1)), composition(sk1, composition(Y, X))))
% 102.47/13.51 = { by axiom 10 (composition_associativity_5) }
% 102.47/13.51 join(X, composition(converse(complement(sk1)), composition(composition(sk1, Y), X)))
% 102.47/13.51 = { by axiom 10 (composition_associativity_5) }
% 102.47/13.51 join(X, composition(composition(converse(complement(sk1)), composition(sk1, Y)), X))
% 102.47/13.51 = { by lemma 54 }
% 102.47/13.51 join(X, composition(converse(zero), X))
% 102.47/13.51 = { by lemma 50 R->L }
% 102.47/13.51 composition(join(one, converse(zero)), X)
% 102.47/13.51 = { by lemma 31 R->L }
% 102.47/13.51 composition(join(converse(one), converse(zero)), X)
% 102.47/13.51 = { by axiom 7 (converse_additivity_9) R->L }
% 102.47/13.51 composition(converse(join(one, zero)), X)
% 102.47/13.51 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.51 composition(converse(join(zero, one)), X)
% 102.47/13.51 = { by lemma 46 }
% 102.47/13.51 composition(converse(one), X)
% 102.47/13.51 = { by lemma 17 }
% 102.47/13.51 X
% 102.47/13.51
% 102.47/13.51 Lemma 56: join(meet(X, Y), meet(Y, complement(X))) = Y.
% 102.47/13.51 Proof:
% 102.47/13.51 join(meet(X, Y), meet(Y, complement(X)))
% 102.47/13.51 = { by lemma 37 }
% 102.47/13.51 join(meet(Y, X), meet(Y, complement(X)))
% 102.47/13.51 = { by lemma 39 }
% 102.47/13.51 Y
% 102.47/13.51
% 102.47/13.51 Lemma 57: join(meet(X, Y), meet(complement(X), Y)) = Y.
% 102.47/13.51 Proof:
% 102.47/13.51 join(meet(X, Y), meet(complement(X), Y))
% 102.47/13.51 = { by lemma 37 }
% 102.47/13.51 join(meet(X, Y), meet(Y, complement(X)))
% 102.47/13.51 = { by lemma 56 }
% 102.47/13.51 Y
% 102.47/13.51
% 102.47/13.51 Lemma 58: complement(join(complement(X), meet(Y, Z))) = meet(X, join(complement(Y), complement(Z))).
% 102.47/13.51 Proof:
% 102.47/13.51 complement(join(complement(X), meet(Y, Z)))
% 102.47/13.51 = { by lemma 37 }
% 102.47/13.51 complement(join(complement(X), meet(Z, Y)))
% 102.47/13.51 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.51 complement(join(meet(Z, Y), complement(X)))
% 102.47/13.51 = { by axiom 11 (maddux4_definiton_of_meet_4) }
% 102.47/13.51 complement(join(complement(join(complement(Z), complement(Y))), complement(X)))
% 102.47/13.51 = { by axiom 11 (maddux4_definiton_of_meet_4) R->L }
% 102.47/13.51 meet(join(complement(Z), complement(Y)), X)
% 102.47/13.51 = { by lemma 37 R->L }
% 102.47/13.51 meet(X, join(complement(Z), complement(Y)))
% 102.47/13.51 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.51 meet(X, join(complement(Y), complement(Z)))
% 102.47/13.51
% 102.47/13.51 Lemma 59: join(complement(X), complement(Y)) = complement(meet(X, Y)).
% 102.47/13.51 Proof:
% 102.47/13.51 join(complement(X), complement(Y))
% 102.47/13.51 = { by lemma 49 R->L }
% 102.47/13.51 meet(top, join(complement(X), complement(Y)))
% 102.47/13.51 = { by lemma 58 R->L }
% 102.47/13.51 complement(join(complement(top), meet(X, Y)))
% 102.47/13.51 = { by lemma 15 }
% 102.47/13.51 complement(join(zero, meet(X, Y)))
% 102.47/13.51 = { by lemma 37 R->L }
% 102.47/13.51 complement(join(zero, meet(Y, X)))
% 102.47/13.51 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.51 complement(join(meet(Y, X), zero))
% 102.47/13.51 = { by lemma 44 }
% 102.47/13.51 complement(meet(Y, X))
% 102.47/13.51 = { by lemma 37 R->L }
% 102.47/13.51 complement(meet(X, Y))
% 102.47/13.51
% 102.47/13.51 Lemma 60: complement(meet(X, complement(Y))) = join(Y, complement(X)).
% 102.47/13.51 Proof:
% 102.47/13.51 complement(meet(X, complement(Y)))
% 102.47/13.51 = { by lemma 37 }
% 102.47/13.51 complement(meet(complement(Y), X))
% 102.47/13.51 = { by lemma 41 R->L }
% 102.47/13.51 complement(meet(join(zero, complement(Y)), X))
% 102.47/13.51 = { by lemma 59 R->L }
% 102.47/13.51 join(complement(join(zero, complement(Y))), complement(X))
% 102.47/13.51 = { by lemma 38 }
% 102.47/13.51 join(meet(Y, top), complement(X))
% 102.47/13.51 = { by lemma 48 }
% 102.47/13.51 join(Y, complement(X))
% 102.47/13.51
% 102.47/13.51 Lemma 61: meet(meet(X, Y), Z) = meet(X, meet(Z, Y)).
% 102.47/13.51 Proof:
% 102.47/13.51 meet(meet(X, Y), Z)
% 102.47/13.51 = { by lemma 37 }
% 102.47/13.51 meet(Z, meet(X, Y))
% 102.47/13.51 = { by lemma 47 R->L }
% 102.47/13.51 meet(meet(Z, meet(X, Y)), meet(Z, meet(X, Y)))
% 102.47/13.51 = { by lemma 36 R->L }
% 102.47/13.51 complement(complement(meet(Z, meet(X, Y))))
% 102.47/13.51 = { by lemma 37 }
% 102.47/13.51 complement(complement(meet(Z, meet(Y, X))))
% 102.47/13.51 = { by lemma 59 R->L }
% 102.47/13.51 complement(join(complement(Z), complement(meet(Y, X))))
% 102.47/13.51 = { by lemma 59 R->L }
% 102.47/13.51 complement(join(complement(Z), join(complement(Y), complement(X))))
% 102.47/13.51 = { by axiom 8 (maddux2_join_associativity_2) }
% 102.47/13.51 complement(join(join(complement(Z), complement(Y)), complement(X)))
% 102.47/13.51 = { by lemma 60 R->L }
% 102.47/13.51 complement(complement(meet(X, complement(join(complement(Z), complement(Y))))))
% 102.47/13.51 = { by axiom 11 (maddux4_definiton_of_meet_4) R->L }
% 102.47/13.51 complement(complement(meet(X, meet(Z, Y))))
% 102.47/13.51 = { by lemma 37 R->L }
% 102.47/13.51 complement(complement(meet(X, meet(Y, Z))))
% 102.47/13.51 = { by lemma 42 }
% 102.47/13.51 meet(X, meet(Y, Z))
% 102.47/13.51 = { by lemma 37 R->L }
% 102.47/13.51 meet(X, meet(Z, Y))
% 102.47/13.51
% 102.47/13.51 Lemma 62: join(X, converse(join(Y, complement(converse(X))))) = top.
% 102.47/13.51 Proof:
% 102.47/13.51 join(X, converse(join(Y, complement(converse(X)))))
% 102.47/13.51 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.51 join(X, converse(join(complement(converse(X)), Y)))
% 102.47/13.51 = { by lemma 33 R->L }
% 102.47/13.51 converse(join(converse(X), join(complement(converse(X)), Y)))
% 102.47/13.51 = { by lemma 28 }
% 102.47/13.51 converse(top)
% 102.47/13.51 = { by lemma 35 }
% 102.47/13.51 top
% 102.47/13.51
% 102.47/13.51 Lemma 63: meet(X, converse(complement(converse(complement(X))))) = X.
% 102.47/13.51 Proof:
% 102.47/13.51 meet(X, converse(complement(converse(complement(X)))))
% 102.47/13.51 = { by lemma 20 R->L }
% 102.47/13.51 meet(X, converse(join(complement(converse(complement(X))), complement(converse(complement(X))))))
% 102.47/13.51 = { by lemma 44 R->L }
% 102.47/13.51 join(meet(X, converse(join(complement(converse(complement(X))), complement(converse(complement(X)))))), zero)
% 102.47/13.51 = { by lemma 15 R->L }
% 102.47/13.51 join(meet(X, converse(join(complement(converse(complement(X))), complement(converse(complement(X)))))), complement(top))
% 102.47/13.51 = { by lemma 62 R->L }
% 102.47/13.51 join(meet(X, converse(join(complement(converse(complement(X))), complement(converse(complement(X)))))), complement(join(complement(X), converse(join(complement(converse(complement(X))), complement(converse(complement(X))))))))
% 102.47/13.51 = { by lemma 21 }
% 102.47/13.52 X
% 102.47/13.52
% 102.47/13.52 Lemma 64: complement(converse(complement(X))) = converse(X).
% 102.47/13.52 Proof:
% 102.47/13.52 complement(converse(complement(X)))
% 102.47/13.52 = { by axiom 1 (converse_idempotence_8) R->L }
% 102.47/13.52 converse(converse(complement(converse(complement(X)))))
% 102.47/13.52 = { by lemma 57 R->L }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), meet(complement(X), converse(complement(converse(complement(X)))))))
% 102.47/13.52 = { by axiom 1 (converse_idempotence_8) R->L }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), meet(converse(converse(complement(X))), converse(complement(converse(complement(X)))))))
% 102.47/13.52 = { by lemma 49 R->L }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), meet(converse(converse(complement(X))), meet(top, converse(complement(converse(complement(X))))))))
% 102.47/13.52 = { by lemma 61 R->L }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), meet(meet(converse(converse(complement(X))), converse(complement(converse(complement(X))))), top)))
% 102.47/13.52 = { by lemma 28 R->L }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), meet(meet(converse(converse(complement(X))), converse(complement(converse(complement(X))))), join(converse(meet(converse(complement(converse(complement(converse(complement(X)))))), converse(complement(X)))), join(complement(converse(meet(converse(complement(converse(complement(converse(complement(X)))))), converse(complement(X))))), converse(complement(join(complement(converse(complement(converse(complement(converse(complement(X))))))), converse(complement(X))))))))))
% 102.47/13.52 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), meet(meet(converse(converse(complement(X))), converse(complement(converse(complement(X))))), join(converse(meet(converse(complement(converse(complement(converse(complement(X)))))), converse(complement(X)))), join(converse(complement(join(complement(converse(complement(converse(complement(converse(complement(X))))))), converse(complement(X))))), complement(converse(meet(converse(complement(converse(complement(converse(complement(X)))))), converse(complement(X))))))))))
% 102.47/13.52 = { by axiom 8 (maddux2_join_associativity_2) }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), meet(meet(converse(converse(complement(X))), converse(complement(converse(complement(X))))), join(join(converse(meet(converse(complement(converse(complement(converse(complement(X)))))), converse(complement(X)))), converse(complement(join(complement(converse(complement(converse(complement(converse(complement(X))))))), converse(complement(X)))))), complement(converse(meet(converse(complement(converse(complement(converse(complement(X)))))), converse(complement(X)))))))))
% 102.47/13.52 = { by axiom 7 (converse_additivity_9) R->L }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), meet(meet(converse(converse(complement(X))), converse(complement(converse(complement(X))))), join(converse(join(meet(converse(complement(converse(complement(converse(complement(X)))))), converse(complement(X))), complement(join(complement(converse(complement(converse(complement(converse(complement(X))))))), converse(complement(X)))))), complement(converse(meet(converse(complement(converse(complement(converse(complement(X)))))), converse(complement(X)))))))))
% 102.47/13.52 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), meet(meet(converse(converse(complement(X))), converse(complement(converse(complement(X))))), join(complement(converse(meet(converse(complement(converse(complement(converse(complement(X)))))), converse(complement(X))))), converse(join(meet(converse(complement(converse(complement(converse(complement(X)))))), converse(complement(X))), complement(join(complement(converse(complement(converse(complement(converse(complement(X))))))), converse(complement(X))))))))))
% 102.47/13.52 = { by lemma 21 }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), meet(meet(converse(converse(complement(X))), converse(complement(converse(complement(X))))), join(complement(converse(meet(converse(complement(converse(complement(converse(complement(X)))))), converse(complement(X))))), converse(converse(complement(converse(complement(converse(complement(X)))))))))))
% 102.47/13.52 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), meet(meet(converse(converse(complement(X))), converse(complement(converse(complement(X))))), join(converse(converse(complement(converse(complement(converse(complement(X))))))), complement(converse(meet(converse(complement(converse(complement(converse(complement(X)))))), converse(complement(X)))))))))
% 102.47/13.52 = { by axiom 1 (converse_idempotence_8) }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), meet(meet(converse(converse(complement(X))), converse(complement(converse(complement(X))))), join(complement(converse(complement(converse(complement(X))))), complement(converse(meet(converse(complement(converse(complement(converse(complement(X)))))), converse(complement(X)))))))))
% 102.47/13.52 = { by lemma 37 R->L }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), meet(meet(converse(converse(complement(X))), converse(complement(converse(complement(X))))), join(complement(converse(complement(converse(complement(X))))), complement(converse(meet(converse(complement(X)), converse(complement(converse(complement(converse(complement(X)))))))))))))
% 102.47/13.52 = { by lemma 63 }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), meet(meet(converse(converse(complement(X))), converse(complement(converse(complement(X))))), join(complement(converse(complement(converse(complement(X))))), complement(converse(converse(complement(X))))))))
% 102.47/13.52 = { by lemma 59 }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), meet(meet(converse(converse(complement(X))), converse(complement(converse(complement(X))))), complement(meet(converse(complement(converse(complement(X)))), converse(converse(complement(X))))))))
% 102.47/13.52 = { by lemma 37 R->L }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), meet(meet(converse(converse(complement(X))), converse(complement(converse(complement(X))))), complement(meet(converse(converse(complement(X))), converse(complement(converse(complement(X)))))))))
% 102.47/13.52 = { by axiom 5 (def_zero_13) R->L }
% 102.47/13.52 converse(join(meet(X, converse(complement(converse(complement(X))))), zero))
% 102.47/13.52 = { by lemma 44 }
% 102.47/13.52 converse(meet(X, converse(complement(converse(complement(X))))))
% 102.47/13.52 = { by lemma 63 }
% 102.47/13.52 converse(X)
% 102.47/13.52
% 102.47/13.52 Lemma 65: converse(composition(X, converse(Y))) = composition(Y, converse(X)).
% 102.47/13.52 Proof:
% 102.47/13.52 converse(composition(X, converse(Y)))
% 102.47/13.52 = { by axiom 9 (converse_multiplicativity_10) }
% 102.47/13.52 composition(converse(converse(Y)), converse(X))
% 102.47/13.52 = { by axiom 1 (converse_idempotence_8) }
% 102.47/13.52 composition(Y, converse(X))
% 102.47/13.52
% 102.47/13.52 Lemma 66: composition(complement(sk1), top) = complement(sk1).
% 102.47/13.52 Proof:
% 102.47/13.52 composition(complement(sk1), top)
% 102.47/13.52 = { by lemma 35 R->L }
% 102.47/13.52 composition(complement(sk1), converse(top))
% 102.47/13.52 = { by lemma 65 R->L }
% 102.47/13.52 converse(composition(top, converse(complement(sk1))))
% 102.47/13.52 = { by lemma 51 R->L }
% 102.47/13.52 converse(join(converse(complement(sk1)), composition(top, converse(complement(sk1)))))
% 102.47/13.52 = { by lemma 33 }
% 102.47/13.52 join(complement(sk1), converse(composition(top, converse(complement(sk1)))))
% 102.47/13.52 = { by lemma 65 }
% 102.47/13.52 join(complement(sk1), composition(complement(sk1), converse(top)))
% 102.47/13.52 = { by lemma 35 }
% 102.47/13.52 join(complement(sk1), composition(complement(sk1), top))
% 102.47/13.52 = { by lemma 30 R->L }
% 102.47/13.52 join(complement(sk1), composition(complement(sk1), complement(zero)))
% 102.47/13.52 = { by lemma 55 R->L }
% 102.47/13.52 join(complement(sk1), composition(complement(sk1), complement(join(converse(zero), zero))))
% 102.47/13.52 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.52 join(complement(sk1), composition(complement(sk1), complement(join(zero, converse(zero)))))
% 102.47/13.52 = { by lemma 22 R->L }
% 102.47/13.52 join(complement(sk1), composition(complement(sk1), complement(join(zero, join(zero, meet(converse(zero), converse(zero)))))))
% 102.47/13.52 = { by axiom 11 (maddux4_definiton_of_meet_4) }
% 102.47/13.52 join(complement(sk1), composition(complement(sk1), complement(join(zero, join(zero, complement(join(complement(converse(zero)), complement(converse(zero)))))))))
% 102.47/13.52 = { by lemma 20 R->L }
% 102.47/13.52 join(complement(sk1), composition(complement(sk1), complement(join(zero, join(zero, join(complement(join(complement(converse(zero)), complement(converse(zero)))), complement(join(complement(converse(zero)), complement(converse(zero))))))))))
% 102.47/13.52 = { by axiom 11 (maddux4_definiton_of_meet_4) R->L }
% 102.47/13.52 join(complement(sk1), composition(complement(sk1), complement(join(zero, join(zero, join(meet(converse(zero), converse(zero)), complement(join(complement(converse(zero)), complement(converse(zero))))))))))
% 102.47/13.52 = { by axiom 11 (maddux4_definiton_of_meet_4) R->L }
% 102.47/13.52 join(complement(sk1), composition(complement(sk1), complement(join(zero, join(zero, join(meet(converse(zero), converse(zero)), meet(converse(zero), converse(zero))))))))
% 102.47/13.52 = { by lemma 23 }
% 102.47/13.52 join(complement(sk1), composition(complement(sk1), complement(join(zero, join(meet(converse(zero), converse(zero)), converse(zero))))))
% 102.47/13.52 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.52 join(complement(sk1), composition(complement(sk1), complement(join(zero, join(converse(zero), meet(converse(zero), converse(zero)))))))
% 102.47/13.52 = { by lemma 23 }
% 102.47/13.52 join(complement(sk1), composition(complement(sk1), complement(join(converse(zero), converse(zero)))))
% 102.47/13.52 = { by lemma 55 }
% 102.47/13.52 join(complement(sk1), composition(complement(sk1), complement(converse(zero))))
% 102.47/13.52 = { by axiom 1 (converse_idempotence_8) R->L }
% 102.47/13.52 join(complement(sk1), composition(converse(converse(complement(sk1))), complement(converse(zero))))
% 102.47/13.52 = { by lemma 53 R->L }
% 102.47/13.52 join(complement(sk1), composition(converse(converse(complement(sk1))), complement(converse(composition(converse(sk1), complement(sk1))))))
% 102.47/13.52 = { by lemma 16 }
% 102.47/13.52 join(complement(sk1), composition(converse(converse(complement(sk1))), complement(composition(converse(complement(sk1)), sk1))))
% 102.47/13.52 = { by lemma 19 }
% 102.47/13.52 complement(sk1)
% 102.47/13.52
% 102.47/13.52 Lemma 67: complement(meet(complement(X), Y)) = join(X, complement(Y)).
% 102.47/13.52 Proof:
% 102.47/13.52 complement(meet(complement(X), Y))
% 102.47/13.52 = { by lemma 37 }
% 102.47/13.52 complement(meet(Y, complement(X)))
% 102.47/13.52 = { by lemma 60 }
% 102.47/13.52 join(X, complement(Y))
% 102.47/13.52
% 102.47/13.52 Lemma 68: join(composition(X, Y), join(Z, composition(W, Y))) = join(Z, composition(join(X, W), Y)).
% 102.47/13.52 Proof:
% 102.47/13.52 join(composition(X, Y), join(Z, composition(W, Y)))
% 102.47/13.52 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.52 join(composition(X, Y), join(composition(W, Y), Z))
% 102.47/13.52 = { by axiom 8 (maddux2_join_associativity_2) }
% 102.47/13.52 join(join(composition(X, Y), composition(W, Y)), Z)
% 102.47/13.52 = { by axiom 12 (composition_distributivity_7) R->L }
% 102.47/13.52 join(composition(join(X, W), Y), Z)
% 102.47/13.52 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.52 join(Z, composition(join(X, W), Y))
% 102.47/13.52
% 102.47/13.52 Lemma 69: join(complement(composition(X, Y)), composition(join(X, Z), Y)) = top.
% 102.47/13.52 Proof:
% 102.47/13.52 join(complement(composition(X, Y)), composition(join(X, Z), Y))
% 102.47/13.52 = { by lemma 68 R->L }
% 102.47/13.52 join(composition(X, Y), join(complement(composition(X, Y)), composition(Z, Y)))
% 102.47/13.52 = { by lemma 28 }
% 102.47/13.52 top
% 102.47/13.52
% 102.47/13.52 Lemma 70: meet(X, join(Y, complement(X))) = meet(X, Y).
% 102.47/13.52 Proof:
% 102.47/13.52 meet(X, join(Y, complement(X)))
% 102.47/13.52 = { by lemma 67 R->L }
% 102.47/13.52 meet(X, complement(meet(complement(Y), X)))
% 102.47/13.52 = { by lemma 39 R->L }
% 102.47/13.52 join(meet(meet(X, complement(meet(complement(Y), X))), Y), meet(meet(X, complement(meet(complement(Y), X))), complement(Y)))
% 102.47/13.52 = { by lemma 37 R->L }
% 102.47/13.52 join(meet(meet(X, complement(meet(complement(Y), X))), Y), meet(complement(Y), meet(X, complement(meet(complement(Y), X)))))
% 102.47/13.52 = { by lemma 59 R->L }
% 102.47/13.52 join(meet(meet(X, complement(meet(complement(Y), X))), Y), meet(complement(Y), meet(X, join(complement(complement(Y)), complement(X)))))
% 102.47/13.52 = { by axiom 11 (maddux4_definiton_of_meet_4) }
% 102.47/13.52 join(meet(meet(X, complement(meet(complement(Y), X))), Y), complement(join(complement(complement(Y)), complement(meet(X, join(complement(complement(Y)), complement(X)))))))
% 102.47/13.52 = { by lemma 59 R->L }
% 102.47/13.52 join(meet(meet(X, complement(meet(complement(Y), X))), Y), complement(join(complement(complement(Y)), join(complement(X), complement(join(complement(complement(Y)), complement(X)))))))
% 102.47/13.52 = { by axiom 8 (maddux2_join_associativity_2) }
% 102.47/13.52 join(meet(meet(X, complement(meet(complement(Y), X))), Y), complement(join(join(complement(complement(Y)), complement(X)), complement(join(complement(complement(Y)), complement(X))))))
% 102.47/13.52 = { by axiom 6 (def_top_12) R->L }
% 102.47/13.52 join(meet(meet(X, complement(meet(complement(Y), X))), Y), complement(top))
% 102.47/13.52 = { by lemma 15 }
% 102.47/13.52 join(meet(meet(X, complement(meet(complement(Y), X))), Y), zero)
% 102.47/13.52 = { by lemma 44 }
% 102.47/13.52 meet(meet(X, complement(meet(complement(Y), X))), Y)
% 102.47/13.52 = { by lemma 61 }
% 102.47/13.52 meet(X, meet(Y, complement(meet(complement(Y), X))))
% 102.47/13.52 = { by lemma 67 }
% 102.47/13.52 meet(X, meet(Y, join(Y, complement(X))))
% 102.47/13.52 = { by lemma 60 R->L }
% 102.47/13.52 meet(X, meet(Y, complement(meet(X, complement(Y)))))
% 102.47/13.52 = { by lemma 59 R->L }
% 102.47/13.52 meet(X, meet(Y, join(complement(X), complement(complement(Y)))))
% 102.47/13.52 = { by lemma 58 R->L }
% 102.47/13.52 meet(X, complement(join(complement(Y), meet(X, complement(Y)))))
% 102.47/13.52 = { by lemma 41 R->L }
% 102.47/13.52 meet(X, join(zero, complement(join(complement(Y), meet(X, complement(Y))))))
% 102.47/13.52 = { by lemma 15 R->L }
% 102.47/13.52 meet(X, join(complement(top), complement(join(complement(Y), meet(X, complement(Y))))))
% 102.47/13.52 = { by lemma 27 R->L }
% 102.47/13.52 meet(X, join(complement(join(complement(X), top)), complement(join(complement(Y), meet(X, complement(Y))))))
% 102.47/13.52 = { by lemma 24 R->L }
% 102.47/13.52 meet(X, join(complement(join(complement(Y), join(complement(X), complement(complement(Y))))), complement(join(complement(Y), meet(X, complement(Y))))))
% 102.47/13.52 = { by lemma 59 }
% 102.47/13.52 meet(X, join(complement(join(complement(Y), complement(meet(X, complement(Y))))), complement(join(complement(Y), meet(X, complement(Y))))))
% 102.47/13.52 = { by lemma 37 R->L }
% 102.47/13.52 meet(X, join(complement(join(complement(Y), complement(meet(complement(Y), X)))), complement(join(complement(Y), meet(X, complement(Y))))))
% 102.47/13.52 = { by axiom 11 (maddux4_definiton_of_meet_4) R->L }
% 102.47/13.52 meet(X, join(meet(Y, meet(complement(Y), X)), complement(join(complement(Y), meet(X, complement(Y))))))
% 102.47/13.52 = { by lemma 37 R->L }
% 102.47/13.53 meet(X, join(meet(Y, meet(X, complement(Y))), complement(join(complement(Y), meet(X, complement(Y))))))
% 102.47/13.53 = { by lemma 21 }
% 102.47/13.53 meet(X, Y)
% 102.47/13.53
% 102.47/13.53 Lemma 71: meet(X, join(complement(X), Y)) = meet(X, Y).
% 102.47/13.53 Proof:
% 102.47/13.53 meet(X, join(complement(X), Y))
% 102.47/13.53 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.53 meet(X, join(Y, complement(X)))
% 102.47/13.53 = { by lemma 70 }
% 102.47/13.53 meet(X, Y)
% 102.47/13.53
% 102.47/13.53 Lemma 72: composition(join(X, complement(sk1)), top) = join(complement(sk1), composition(X, top)).
% 102.47/13.53 Proof:
% 102.47/13.53 composition(join(X, complement(sk1)), top)
% 102.47/13.53 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.53 composition(join(complement(sk1), X), top)
% 102.47/13.53 = { by axiom 12 (composition_distributivity_7) }
% 102.47/13.53 join(composition(complement(sk1), top), composition(X, top))
% 102.47/13.53 = { by lemma 66 }
% 102.47/13.53 join(complement(sk1), composition(X, top))
% 102.47/13.53
% 102.47/13.53 Lemma 73: join(complement(X), meet(X, one)) = join(one, complement(X)).
% 102.47/13.53 Proof:
% 102.47/13.53 join(complement(X), meet(X, one))
% 102.47/13.53 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.53 join(meet(X, one), complement(X))
% 102.47/13.53 = { by lemma 71 R->L }
% 102.47/13.53 join(meet(X, join(complement(X), one)), complement(X))
% 102.47/13.53 = { by lemma 21 R->L }
% 102.47/13.53 join(meet(X, join(complement(X), one)), join(meet(complement(X), converse(join(one, complement(converse(complement(complement(X))))))), complement(join(complement(complement(X)), converse(join(one, complement(converse(complement(complement(X))))))))))
% 102.47/13.53 = { by lemma 62 }
% 102.47/13.53 join(meet(X, join(complement(X), one)), join(meet(complement(X), converse(join(one, complement(converse(complement(complement(X))))))), complement(top)))
% 102.47/13.53 = { by lemma 15 }
% 102.47/13.53 join(meet(X, join(complement(X), one)), join(meet(complement(X), converse(join(one, complement(converse(complement(complement(X))))))), zero))
% 102.47/13.53 = { by lemma 44 }
% 102.47/13.53 join(meet(X, join(complement(X), one)), meet(complement(X), converse(join(one, complement(converse(complement(complement(X))))))))
% 102.47/13.53 = { by lemma 64 }
% 102.47/13.53 join(meet(X, join(complement(X), one)), meet(complement(X), converse(join(one, converse(complement(X))))))
% 102.47/13.53 = { by lemma 32 }
% 102.47/13.53 join(meet(X, join(complement(X), one)), meet(complement(X), join(complement(X), converse(one))))
% 102.47/13.53 = { by lemma 31 }
% 102.47/13.53 join(meet(X, join(complement(X), one)), meet(complement(X), join(complement(X), one)))
% 102.47/13.53 = { by lemma 57 }
% 102.47/13.53 join(complement(X), one)
% 102.47/13.53 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.53 join(one, complement(X))
% 102.47/13.53
% 102.47/13.53 Lemma 74: join(complement(sk1), composition(join(X, complement(sk1)), Y)) = join(complement(sk1), composition(X, Y)).
% 102.47/13.53 Proof:
% 102.47/13.53 join(complement(sk1), composition(join(X, complement(sk1)), Y))
% 102.47/13.53 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.53 join(complement(sk1), composition(join(complement(sk1), X), Y))
% 102.47/13.53 = { by lemma 66 R->L }
% 102.47/13.53 join(composition(complement(sk1), top), composition(join(complement(sk1), X), Y))
% 102.47/13.53 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.53 join(composition(complement(sk1), top), composition(join(X, complement(sk1)), Y))
% 102.47/13.53 = { by lemma 68 R->L }
% 102.47/13.53 join(composition(X, Y), join(composition(complement(sk1), top), composition(complement(sk1), Y)))
% 102.47/13.53 = { by axiom 1 (converse_idempotence_8) R->L }
% 102.47/13.53 join(composition(X, Y), join(composition(complement(sk1), top), composition(complement(sk1), converse(converse(Y)))))
% 102.47/13.53 = { by axiom 1 (converse_idempotence_8) R->L }
% 102.47/13.53 join(composition(X, Y), converse(converse(join(composition(complement(sk1), top), composition(complement(sk1), converse(converse(Y)))))))
% 102.47/13.53 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.53 join(composition(X, Y), converse(converse(join(composition(complement(sk1), converse(converse(Y))), composition(complement(sk1), top)))))
% 102.47/13.53 = { by axiom 7 (converse_additivity_9) }
% 102.47/13.53 join(composition(X, Y), converse(join(converse(composition(complement(sk1), converse(converse(Y)))), converse(composition(complement(sk1), top)))))
% 102.47/13.53 = { by lemma 65 }
% 102.47/13.53 join(composition(X, Y), converse(join(composition(converse(Y), converse(complement(sk1))), converse(composition(complement(sk1), top)))))
% 102.47/13.53 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.53 join(composition(X, Y), converse(join(converse(composition(complement(sk1), top)), composition(converse(Y), converse(complement(sk1))))))
% 102.47/13.53 = { by axiom 9 (converse_multiplicativity_10) }
% 102.47/13.53 join(composition(X, Y), converse(join(composition(converse(top), converse(complement(sk1))), composition(converse(Y), converse(complement(sk1))))))
% 102.47/13.53 = { by axiom 12 (composition_distributivity_7) R->L }
% 102.47/13.53 join(composition(X, Y), converse(composition(join(converse(top), converse(Y)), converse(complement(sk1)))))
% 102.47/13.53 = { by axiom 2 (maddux1_join_commutativity_1) R->L }
% 102.47/13.53 join(composition(X, Y), converse(composition(join(converse(Y), converse(top)), converse(complement(sk1)))))
% 102.47/13.53 = { by lemma 32 R->L }
% 102.47/13.53 join(composition(X, Y), converse(composition(converse(join(top, converse(converse(Y)))), converse(complement(sk1)))))
% 102.47/13.53 = { by axiom 9 (converse_multiplicativity_10) R->L }
% 102.47/13.53 join(composition(X, Y), converse(converse(composition(complement(sk1), join(top, converse(converse(Y)))))))
% 102.47/13.53 = { by axiom 1 (converse_idempotence_8) }
% 102.47/13.53 join(composition(X, Y), composition(complement(sk1), join(top, converse(converse(Y)))))
% 102.47/13.53 = { by axiom 1 (converse_idempotence_8) }
% 102.47/13.53 join(composition(X, Y), composition(complement(sk1), join(top, Y)))
% 102.47/13.53 = { by lemma 45 }
% 102.47/13.53 join(composition(X, Y), composition(complement(sk1), top))
% 102.47/13.53 = { by lemma 66 }
% 102.47/13.53 join(composition(X, Y), complement(sk1))
% 102.47/13.53 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.53 join(complement(sk1), composition(X, Y))
% 102.47/13.53
% 102.47/13.53 Lemma 75: composition(meet(one, sk1), X) = meet(X, sk1).
% 102.47/13.53 Proof:
% 102.47/13.53 composition(meet(one, sk1), X)
% 102.47/13.53 = { by lemma 48 R->L }
% 102.47/13.53 meet(composition(meet(one, sk1), X), top)
% 102.47/13.53 = { by lemma 35 R->L }
% 102.47/13.53 meet(composition(meet(one, sk1), X), converse(top))
% 102.47/13.53 = { by lemma 69 R->L }
% 102.47/13.53 meet(composition(meet(one, sk1), X), converse(join(complement(composition(converse(X), converse(meet(one, sk1)))), composition(join(converse(X), complement(converse(X))), converse(meet(one, sk1))))))
% 102.47/13.53 = { by axiom 6 (def_top_12) R->L }
% 102.47/13.53 meet(composition(meet(one, sk1), X), converse(join(complement(composition(converse(X), converse(meet(one, sk1)))), composition(top, converse(meet(one, sk1))))))
% 102.47/13.53 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.53 meet(composition(meet(one, sk1), X), converse(join(composition(top, converse(meet(one, sk1))), complement(composition(converse(X), converse(meet(one, sk1)))))))
% 102.47/13.53 = { by axiom 9 (converse_multiplicativity_10) R->L }
% 102.47/13.53 meet(composition(meet(one, sk1), X), converse(join(composition(top, converse(meet(one, sk1))), complement(converse(composition(meet(one, sk1), X))))))
% 102.47/13.53 = { by lemma 35 R->L }
% 102.47/13.53 meet(composition(meet(one, sk1), X), converse(join(composition(converse(top), converse(meet(one, sk1))), complement(converse(composition(meet(one, sk1), X))))))
% 102.47/13.53 = { by axiom 9 (converse_multiplicativity_10) R->L }
% 102.47/13.53 meet(composition(meet(one, sk1), X), converse(join(converse(composition(meet(one, sk1), top)), complement(converse(composition(meet(one, sk1), X))))))
% 102.47/13.53 = { by lemma 64 R->L }
% 102.47/13.53 meet(composition(meet(one, sk1), X), converse(join(converse(composition(meet(one, sk1), top)), complement(complement(converse(complement(composition(meet(one, sk1), X))))))))
% 102.47/13.53 = { by lemma 36 }
% 102.47/13.53 meet(composition(meet(one, sk1), X), converse(join(converse(composition(meet(one, sk1), top)), meet(converse(complement(composition(meet(one, sk1), X))), converse(complement(composition(meet(one, sk1), X)))))))
% 102.47/13.53 = { by lemma 47 }
% 102.47/13.53 meet(composition(meet(one, sk1), X), converse(join(converse(composition(meet(one, sk1), top)), converse(complement(composition(meet(one, sk1), X))))))
% 102.47/13.53 = { by axiom 7 (converse_additivity_9) R->L }
% 102.47/13.53 meet(composition(meet(one, sk1), X), converse(converse(join(composition(meet(one, sk1), top), complement(composition(meet(one, sk1), X))))))
% 102.47/13.53 = { by axiom 1 (converse_idempotence_8) }
% 102.47/13.53 meet(composition(meet(one, sk1), X), join(composition(meet(one, sk1), top), complement(composition(meet(one, sk1), X))))
% 102.47/13.53 = { by lemma 70 }
% 102.47/13.53 meet(composition(meet(one, sk1), X), composition(meet(one, sk1), top))
% 102.47/13.53 = { by lemma 48 R->L }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(composition(meet(one, sk1), top), top))
% 102.47/13.53 = { by lemma 69 R->L }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(composition(meet(one, sk1), top), join(complement(composition(meet(one, sk1), top)), composition(join(meet(one, sk1), meet(sk1, complement(one))), top))))
% 102.47/13.53 = { by lemma 56 }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(composition(meet(one, sk1), top), join(complement(composition(meet(one, sk1), top)), composition(sk1, top))))
% 102.47/13.53 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(composition(meet(one, sk1), top), join(composition(sk1, top), complement(composition(meet(one, sk1), top)))))
% 102.47/13.53 = { by lemma 37 R->L }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(composition(meet(one, sk1), top), join(composition(sk1, top), complement(composition(meet(sk1, one), top)))))
% 102.47/13.53 = { by axiom 4 (goals_14) }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(composition(meet(one, sk1), top), join(sk1, complement(composition(meet(sk1, one), top)))))
% 102.47/13.53 = { by lemma 37 R->L }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(composition(meet(one, sk1), top), join(sk1, complement(composition(meet(one, sk1), top)))))
% 102.47/13.53 = { by lemma 70 }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(composition(meet(one, sk1), top), sk1))
% 102.47/13.53 = { by lemma 37 R->L }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(sk1, composition(meet(one, sk1), top)))
% 102.47/13.53 = { by lemma 71 R->L }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(sk1, join(complement(sk1), composition(meet(one, sk1), top))))
% 102.47/13.53 = { by lemma 37 }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(sk1, join(complement(sk1), composition(meet(sk1, one), top))))
% 102.47/13.53 = { by lemma 72 R->L }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(sk1, composition(join(meet(sk1, one), complement(sk1)), top)))
% 102.47/13.53 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(sk1, composition(join(complement(sk1), meet(sk1, one)), top)))
% 102.47/13.53 = { by lemma 73 }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(sk1, composition(join(one, complement(sk1)), top)))
% 102.47/13.53 = { by lemma 72 }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(sk1, join(complement(sk1), composition(one, top))))
% 102.47/13.53 = { by lemma 18 }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(sk1, join(complement(sk1), top)))
% 102.47/13.53 = { by lemma 27 }
% 102.47/13.53 meet(composition(meet(one, sk1), X), meet(sk1, top))
% 102.47/13.53 = { by lemma 48 }
% 102.47/13.53 meet(composition(meet(one, sk1), X), sk1)
% 102.47/13.53 = { by lemma 37 R->L }
% 102.47/13.53 meet(sk1, composition(meet(one, sk1), X))
% 102.47/13.53 = { by lemma 71 R->L }
% 102.47/13.53 meet(sk1, join(complement(sk1), composition(meet(one, sk1), X)))
% 102.47/13.53 = { by lemma 37 }
% 102.47/13.53 meet(sk1, join(complement(sk1), composition(meet(sk1, one), X)))
% 102.47/13.53 = { by lemma 74 R->L }
% 102.47/13.53 meet(sk1, join(complement(sk1), composition(join(meet(sk1, one), complement(sk1)), X)))
% 102.47/13.53 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.53 meet(sk1, join(complement(sk1), composition(join(complement(sk1), meet(sk1, one)), X)))
% 102.47/13.53 = { by lemma 73 }
% 102.47/13.53 meet(sk1, join(complement(sk1), composition(join(one, complement(sk1)), X)))
% 102.47/13.53 = { by lemma 74 }
% 102.47/13.53 meet(sk1, join(complement(sk1), composition(one, X)))
% 102.47/13.53 = { by lemma 18 }
% 102.47/13.53 meet(sk1, join(complement(sk1), X))
% 102.47/13.53 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.53 meet(sk1, join(X, complement(sk1)))
% 102.47/13.53 = { by lemma 70 }
% 102.47/13.53 meet(sk1, X)
% 102.47/13.53 = { by lemma 37 R->L }
% 102.47/13.53 meet(X, sk1)
% 102.47/13.53
% 102.47/13.53 Lemma 76: composition(meet(X, sk1), Y) = meet(sk1, composition(X, Y)).
% 102.47/13.53 Proof:
% 102.47/13.53 composition(meet(X, sk1), Y)
% 102.47/13.53 = { by lemma 75 R->L }
% 102.47/13.53 composition(composition(meet(one, sk1), X), Y)
% 102.47/13.53 = { by axiom 10 (composition_associativity_5) R->L }
% 102.47/13.53 composition(meet(one, sk1), composition(X, Y))
% 102.47/13.53 = { by lemma 75 }
% 102.47/13.53 meet(composition(X, Y), sk1)
% 102.47/13.53 = { by lemma 37 R->L }
% 102.47/13.53 meet(sk1, composition(X, Y))
% 102.47/13.53
% 102.47/13.53 Goal 1 (goals_15): tuple(join(meet(sk1, composition(sk2, sk3)), composition(meet(sk1, sk2), sk3)), join(composition(meet(sk1, sk2), sk3), meet(sk1, composition(sk2, sk3)))) = tuple(composition(meet(sk1, sk2), sk3), meet(sk1, composition(sk2, sk3))).
% 102.47/13.53 Proof:
% 102.47/13.53 tuple(join(meet(sk1, composition(sk2, sk3)), composition(meet(sk1, sk2), sk3)), join(composition(meet(sk1, sk2), sk3), meet(sk1, composition(sk2, sk3))))
% 102.47/13.53 = { by axiom 2 (maddux1_join_commutativity_1) }
% 102.47/13.53 tuple(join(meet(sk1, composition(sk2, sk3)), composition(meet(sk1, sk2), sk3)), join(meet(sk1, composition(sk2, sk3)), composition(meet(sk1, sk2), sk3)))
% 102.47/13.53 = { by lemma 37 R->L }
% 102.47/13.53 tuple(join(meet(sk1, composition(sk2, sk3)), composition(meet(sk2, sk1), sk3)), join(meet(sk1, composition(sk2, sk3)), composition(meet(sk1, sk2), sk3)))
% 102.47/13.53 = { by lemma 37 R->L }
% 102.47/13.53 tuple(join(meet(sk1, composition(sk2, sk3)), composition(meet(sk2, sk1), sk3)), join(meet(sk1, composition(sk2, sk3)), composition(meet(sk2, sk1), sk3)))
% 102.47/13.53 = { by lemma 76 }
% 102.47/13.53 tuple(join(meet(sk1, composition(sk2, sk3)), meet(sk1, composition(sk2, sk3))), join(meet(sk1, composition(sk2, sk3)), composition(meet(sk2, sk1), sk3)))
% 102.47/13.53 = { by lemma 76 }
% 102.47/13.53 tuple(join(meet(sk1, composition(sk2, sk3)), meet(sk1, composition(sk2, sk3))), join(meet(sk1, composition(sk2, sk3)), meet(sk1, composition(sk2, sk3))))
% 102.47/13.53 = { by lemma 43 }
% 102.47/13.53 tuple(meet(sk1, composition(sk2, sk3)), join(meet(sk1, composition(sk2, sk3)), meet(sk1, composition(sk2, sk3))))
% 102.47/13.53 = { by lemma 43 }
% 102.47/13.53 tuple(meet(sk1, composition(sk2, sk3)), meet(sk1, composition(sk2, sk3)))
% 102.47/13.53 = { by lemma 76 R->L }
% 102.47/13.53 tuple(composition(meet(sk2, sk1), sk3), meet(sk1, composition(sk2, sk3)))
% 102.47/13.53 = { by lemma 37 }
% 102.47/13.53 tuple(composition(meet(sk1, sk2), sk3), meet(sk1, composition(sk2, sk3)))
% 102.47/13.53 % SZS output end Proof
% 102.47/13.54
% 102.47/13.54 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------