TSTP Solution File: REL013+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : REL013+1 : 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 : n032.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:43:53 EDT 2023
% Result : Theorem 0.13s 0.43s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : REL013+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.10 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Fri Aug 25 20:56:43 EDT 2023
% 0.10/0.29 % CPUTime :
% 0.13/0.43 Command-line arguments: --no-flatten-goal
% 0.13/0.43
% 0.13/0.43 % SZS status Theorem
% 0.13/0.43
% 0.13/0.46 % SZS output start Proof
% 0.13/0.46 Take the following subset of the input axioms:
% 0.13/0.46 fof(composition_associativity, axiom, ![X0, X1, X2]: composition(X0, composition(X1, X2))=composition(composition(X0, X1), X2)).
% 0.13/0.46 fof(composition_distributivity, axiom, ![X0_2, X1_2, X2_2]: composition(join(X0_2, X1_2), X2_2)=join(composition(X0_2, X2_2), composition(X1_2, X2_2))).
% 0.13/0.46 fof(composition_identity, axiom, ![X0_2]: composition(X0_2, one)=X0_2).
% 0.13/0.46 fof(converse_additivity, axiom, ![X0_2, X1_2]: converse(join(X0_2, X1_2))=join(converse(X0_2), converse(X1_2))).
% 0.13/0.46 fof(converse_cancellativity, axiom, ![X0_2, X1_2]: join(composition(converse(X0_2), complement(composition(X0_2, X1_2))), complement(X1_2))=complement(X1_2)).
% 0.13/0.46 fof(converse_idempotence, axiom, ![X0_2]: converse(converse(X0_2))=X0_2).
% 0.13/0.46 fof(converse_multiplicativity, axiom, ![X0_2, X1_2]: converse(composition(X0_2, X1_2))=composition(converse(X1_2), converse(X0_2))).
% 0.13/0.46 fof(def_top, axiom, ![X0_2]: top=join(X0_2, complement(X0_2))).
% 0.13/0.46 fof(def_zero, axiom, ![X0_2]: zero=meet(X0_2, complement(X0_2))).
% 0.13/0.46 fof(goals, conjecture, ![X0_2]: (composition(X0_2, zero)=zero & composition(zero, X0_2)=zero)).
% 0.13/0.46 fof(maddux1_join_commutativity, axiom, ![X0_2, X1_2]: join(X0_2, X1_2)=join(X1_2, X0_2)).
% 0.13/0.46 fof(maddux2_join_associativity, axiom, ![X0_2, X1_2, X2_2]: join(X0_2, join(X1_2, X2_2))=join(join(X0_2, X1_2), X2_2)).
% 0.13/0.46 fof(maddux3_a_kind_of_de_Morgan, axiom, ![X0_2, X1_2]: X0_2=join(complement(join(complement(X0_2), complement(X1_2))), complement(join(complement(X0_2), X1_2)))).
% 0.13/0.46 fof(maddux4_definiton_of_meet, axiom, ![X0_2, X1_2]: meet(X0_2, X1_2)=complement(join(complement(X0_2), complement(X1_2)))).
% 0.13/0.46
% 0.13/0.46 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.13/0.46 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.13/0.46 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.13/0.46 fresh(y, y, x1...xn) = u
% 0.13/0.46 C => fresh(s, t, x1...xn) = v
% 0.13/0.46 where fresh is a fresh function symbol and x1..xn are the free
% 0.13/0.46 variables of u and v.
% 0.13/0.46 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.13/0.46 input problem has no model of domain size 1).
% 0.13/0.46
% 0.13/0.46 The encoding turns the above axioms into the following unit equations and goals:
% 0.13/0.46
% 0.13/0.46 Axiom 1 (converse_idempotence): converse(converse(X)) = X.
% 0.13/0.46 Axiom 2 (composition_identity): composition(X, one) = X.
% 0.13/0.46 Axiom 3 (maddux1_join_commutativity): join(X, Y) = join(Y, X).
% 0.13/0.46 Axiom 4 (def_zero): zero = meet(X, complement(X)).
% 0.13/0.46 Axiom 5 (def_top): top = join(X, complement(X)).
% 0.13/0.46 Axiom 6 (converse_multiplicativity): converse(composition(X, Y)) = composition(converse(Y), converse(X)).
% 0.13/0.46 Axiom 7 (composition_associativity): composition(X, composition(Y, Z)) = composition(composition(X, Y), Z).
% 0.13/0.46 Axiom 8 (converse_additivity): converse(join(X, Y)) = join(converse(X), converse(Y)).
% 0.13/0.46 Axiom 9 (maddux2_join_associativity): join(X, join(Y, Z)) = join(join(X, Y), Z).
% 0.13/0.46 Axiom 10 (maddux4_definiton_of_meet): meet(X, Y) = complement(join(complement(X), complement(Y))).
% 0.13/0.46 Axiom 11 (composition_distributivity): composition(join(X, Y), Z) = join(composition(X, Z), composition(Y, Z)).
% 0.13/0.46 Axiom 12 (converse_cancellativity): join(composition(converse(X), complement(composition(X, Y))), complement(Y)) = complement(Y).
% 0.13/0.46 Axiom 13 (maddux3_a_kind_of_de_Morgan): X = join(complement(join(complement(X), complement(Y))), complement(join(complement(X), Y))).
% 0.13/0.46
% 0.13/0.46 Lemma 14: complement(top) = zero.
% 0.13/0.46 Proof:
% 0.13/0.46 complement(top)
% 0.13/0.46 = { by axiom 5 (def_top) }
% 0.13/0.46 complement(join(complement(X), complement(complement(X))))
% 0.13/0.46 = { by axiom 10 (maddux4_definiton_of_meet) R->L }
% 0.13/0.46 meet(X, complement(X))
% 0.13/0.46 = { by axiom 4 (def_zero) R->L }
% 0.13/0.46 zero
% 0.13/0.46
% 0.13/0.46 Lemma 15: join(meet(X, Y), complement(join(complement(X), Y))) = X.
% 0.13/0.46 Proof:
% 0.13/0.46 join(meet(X, Y), complement(join(complement(X), Y)))
% 0.13/0.46 = { by axiom 10 (maddux4_definiton_of_meet) }
% 0.13/0.46 join(complement(join(complement(X), complement(Y))), complement(join(complement(X), Y)))
% 0.13/0.46 = { by axiom 13 (maddux3_a_kind_of_de_Morgan) R->L }
% 0.13/0.46 X
% 0.13/0.46
% 0.13/0.46 Lemma 16: join(zero, meet(X, X)) = X.
% 0.13/0.46 Proof:
% 0.13/0.46 join(zero, meet(X, X))
% 0.13/0.46 = { by axiom 10 (maddux4_definiton_of_meet) }
% 0.13/0.46 join(zero, complement(join(complement(X), complement(X))))
% 0.13/0.46 = { by axiom 4 (def_zero) }
% 0.13/0.46 join(meet(X, complement(X)), complement(join(complement(X), complement(X))))
% 0.13/0.46 = { by lemma 15 }
% 0.13/0.46 X
% 0.13/0.46
% 0.13/0.46 Lemma 17: join(zero, join(X, meet(Y, Y))) = join(X, Y).
% 0.13/0.46 Proof:
% 0.13/0.46 join(zero, join(X, meet(Y, Y)))
% 0.13/0.46 = { by axiom 3 (maddux1_join_commutativity) R->L }
% 0.13/0.46 join(zero, join(meet(Y, Y), X))
% 0.13/0.46 = { by axiom 9 (maddux2_join_associativity) }
% 0.13/0.46 join(join(zero, meet(Y, Y)), X)
% 0.13/0.46 = { by lemma 16 }
% 0.13/0.46 join(Y, X)
% 0.13/0.47 = { by axiom 3 (maddux1_join_commutativity) }
% 0.13/0.47 join(X, Y)
% 0.13/0.47
% 0.13/0.47 Lemma 18: join(X, join(Y, complement(X))) = join(Y, top).
% 0.13/0.47 Proof:
% 0.13/0.47 join(X, join(Y, complement(X)))
% 0.13/0.47 = { by axiom 3 (maddux1_join_commutativity) R->L }
% 0.13/0.47 join(X, join(complement(X), Y))
% 0.13/0.47 = { by axiom 9 (maddux2_join_associativity) }
% 0.13/0.47 join(join(X, complement(X)), Y)
% 0.13/0.47 = { by axiom 5 (def_top) R->L }
% 0.13/0.47 join(top, Y)
% 0.13/0.47 = { by axiom 3 (maddux1_join_commutativity) }
% 0.13/0.47 join(Y, top)
% 0.13/0.47
% 0.13/0.47 Lemma 19: converse(composition(converse(X), Y)) = composition(converse(Y), X).
% 0.13/0.47 Proof:
% 0.13/0.47 converse(composition(converse(X), Y))
% 0.13/0.47 = { by axiom 6 (converse_multiplicativity) }
% 0.13/0.47 composition(converse(Y), converse(converse(X)))
% 0.13/0.47 = { by axiom 1 (converse_idempotence) }
% 0.13/0.47 composition(converse(Y), X)
% 0.13/0.47
% 0.13/0.47 Lemma 20: composition(converse(one), X) = X.
% 0.13/0.47 Proof:
% 0.13/0.47 composition(converse(one), X)
% 0.13/0.47 = { by lemma 19 R->L }
% 0.13/0.47 converse(composition(converse(X), one))
% 0.13/0.47 = { by axiom 2 (composition_identity) }
% 0.13/0.47 converse(converse(X))
% 0.13/0.47 = { by axiom 1 (converse_idempotence) }
% 0.13/0.47 X
% 0.13/0.47
% 0.13/0.47 Lemma 21: composition(one, X) = X.
% 0.13/0.47 Proof:
% 0.13/0.47 composition(one, X)
% 0.13/0.47 = { by lemma 20 R->L }
% 0.13/0.47 composition(converse(one), composition(one, X))
% 0.13/0.47 = { by axiom 7 (composition_associativity) }
% 0.13/0.47 composition(composition(converse(one), one), X)
% 0.13/0.47 = { by axiom 2 (composition_identity) }
% 0.13/0.47 composition(converse(one), X)
% 0.13/0.47 = { by lemma 20 }
% 0.13/0.47 X
% 0.13/0.47
% 0.13/0.47 Lemma 22: join(complement(X), composition(converse(Y), complement(composition(Y, X)))) = complement(X).
% 0.13/0.47 Proof:
% 0.13/0.47 join(complement(X), composition(converse(Y), complement(composition(Y, X))))
% 0.13/0.47 = { by axiom 3 (maddux1_join_commutativity) R->L }
% 0.13/0.47 join(composition(converse(Y), complement(composition(Y, X))), complement(X))
% 0.13/0.47 = { by axiom 12 (converse_cancellativity) }
% 0.13/0.47 complement(X)
% 0.13/0.47
% 0.13/0.47 Lemma 23: join(complement(X), complement(X)) = complement(X).
% 0.13/0.47 Proof:
% 0.13/0.47 join(complement(X), complement(X))
% 0.13/0.47 = { by lemma 20 R->L }
% 0.13/0.47 join(complement(X), composition(converse(one), complement(X)))
% 0.13/0.47 = { by lemma 21 R->L }
% 0.13/0.47 join(complement(X), composition(converse(one), complement(composition(one, X))))
% 0.13/0.47 = { by lemma 22 }
% 0.13/0.47 complement(X)
% 0.13/0.47
% 0.13/0.47 Lemma 24: join(top, complement(X)) = top.
% 0.13/0.47 Proof:
% 0.13/0.47 join(top, complement(X))
% 0.13/0.47 = { by axiom 3 (maddux1_join_commutativity) R->L }
% 0.13/0.47 join(complement(X), top)
% 0.13/0.47 = { by lemma 18 R->L }
% 0.13/0.47 join(X, join(complement(X), complement(X)))
% 0.13/0.47 = { by lemma 23 }
% 0.13/0.47 join(X, complement(X))
% 0.13/0.47 = { by axiom 5 (def_top) R->L }
% 0.13/0.47 top
% 0.13/0.47
% 0.13/0.47 Lemma 25: join(Y, top) = join(X, top).
% 0.13/0.47 Proof:
% 0.13/0.47 join(Y, top)
% 0.13/0.47 = { by lemma 24 R->L }
% 0.13/0.47 join(Y, join(top, complement(Y)))
% 0.13/0.47 = { by lemma 18 }
% 0.13/0.47 join(top, top)
% 0.13/0.47 = { by lemma 18 R->L }
% 0.13/0.47 join(X, join(top, complement(X)))
% 0.13/0.47 = { by lemma 24 }
% 0.13/0.47 join(X, top)
% 0.13/0.47
% 0.13/0.47 Lemma 26: join(X, top) = top.
% 0.13/0.47 Proof:
% 0.13/0.47 join(X, top)
% 0.13/0.47 = { by lemma 25 }
% 0.13/0.47 join(join(zero, zero), top)
% 0.13/0.47 = { by axiom 3 (maddux1_join_commutativity) R->L }
% 0.13/0.47 join(top, join(zero, zero))
% 0.13/0.47 = { by lemma 14 R->L }
% 0.13/0.47 join(top, join(zero, complement(top)))
% 0.13/0.47 = { by lemma 14 R->L }
% 0.13/0.47 join(top, join(complement(top), complement(top)))
% 0.13/0.47 = { by lemma 23 }
% 0.13/0.47 join(top, complement(top))
% 0.13/0.47 = { by axiom 5 (def_top) R->L }
% 0.13/0.47 top
% 0.13/0.47
% 0.13/0.47 Lemma 27: join(X, join(complement(X), Y)) = top.
% 0.13/0.47 Proof:
% 0.13/0.47 join(X, join(complement(X), Y))
% 0.13/0.47 = { by axiom 3 (maddux1_join_commutativity) R->L }
% 0.13/0.47 join(X, join(Y, complement(X)))
% 0.13/0.47 = { by lemma 18 }
% 0.13/0.47 join(Y, top)
% 0.13/0.47 = { by lemma 25 R->L }
% 0.13/0.47 join(Z, top)
% 0.13/0.47 = { by lemma 26 }
% 0.13/0.47 top
% 0.13/0.47
% 0.13/0.47 Lemma 28: join(X, complement(zero)) = top.
% 0.13/0.47 Proof:
% 0.13/0.47 join(X, complement(zero))
% 0.13/0.47 = { by axiom 3 (maddux1_join_commutativity) R->L }
% 0.13/0.47 join(complement(zero), X)
% 0.13/0.47 = { by lemma 17 R->L }
% 0.13/0.47 join(zero, join(complement(zero), meet(X, X)))
% 0.13/0.47 = { by lemma 27 }
% 0.13/0.47 top
% 0.13/0.47
% 0.13/0.47 Lemma 29: complement(complement(X)) = meet(X, X).
% 0.13/0.47 Proof:
% 0.13/0.47 complement(complement(X))
% 0.13/0.47 = { by lemma 23 R->L }
% 0.13/0.47 complement(join(complement(X), complement(X)))
% 0.13/0.47 = { by axiom 10 (maddux4_definiton_of_meet) R->L }
% 0.13/0.47 meet(X, X)
% 0.13/0.47
% 0.13/0.47 Lemma 30: complement(complement(X)) = X.
% 0.13/0.47 Proof:
% 0.13/0.47 complement(complement(X))
% 0.13/0.47 = { by lemma 15 R->L }
% 0.13/0.47 join(meet(complement(complement(X)), complement(zero)), complement(join(complement(complement(complement(X))), complement(zero))))
% 0.13/0.47 = { by axiom 10 (maddux4_definiton_of_meet) R->L }
% 0.13/0.47 join(meet(complement(complement(X)), complement(zero)), meet(complement(complement(X)), zero))
% 0.13/0.47 = { by axiom 3 (maddux1_join_commutativity) }
% 0.13/0.47 join(meet(complement(complement(X)), zero), meet(complement(complement(X)), complement(zero)))
% 0.13/0.47 = { by axiom 10 (maddux4_definiton_of_meet) }
% 0.13/0.47 join(complement(join(complement(complement(complement(X))), complement(zero))), meet(complement(complement(X)), complement(zero)))
% 0.13/0.47 = { by lemma 28 }
% 0.13/0.47 join(complement(top), meet(complement(complement(X)), complement(zero)))
% 0.13/0.47 = { by lemma 14 }
% 0.13/0.47 join(zero, meet(complement(complement(X)), complement(zero)))
% 0.13/0.47 = { by lemma 23 R->L }
% 0.13/0.47 join(zero, meet(complement(complement(X)), join(complement(zero), complement(zero))))
% 0.13/0.47 = { by lemma 28 }
% 0.13/0.47 join(zero, meet(complement(complement(X)), top))
% 0.13/0.47 = { by axiom 10 (maddux4_definiton_of_meet) }
% 0.13/0.47 join(zero, complement(join(complement(complement(complement(X))), complement(top))))
% 0.13/0.47 = { by axiom 3 (maddux1_join_commutativity) R->L }
% 0.13/0.47 join(zero, complement(join(complement(top), complement(complement(complement(X))))))
% 0.13/0.47 = { by lemma 14 }
% 0.13/0.47 join(zero, complement(join(zero, complement(complement(complement(X))))))
% 0.13/0.47 = { by lemma 29 }
% 0.13/0.47 join(zero, complement(join(zero, meet(complement(X), complement(X)))))
% 0.13/0.47 = { by lemma 16 }
% 0.13/0.47 join(zero, complement(complement(X)))
% 0.13/0.47 = { by lemma 29 }
% 0.13/0.47 join(zero, meet(X, X))
% 0.13/0.47 = { by lemma 16 }
% 0.13/0.47 X
% 0.13/0.47
% 0.13/0.47 Lemma 31: join(zero, X) = X.
% 0.13/0.47 Proof:
% 0.13/0.47 join(zero, X)
% 0.13/0.47 = { by lemma 30 R->L }
% 0.13/0.47 join(zero, complement(complement(X)))
% 0.13/0.47 = { by lemma 29 }
% 0.13/0.47 join(zero, meet(X, X))
% 0.13/0.47 = { by lemma 16 }
% 0.13/0.47 X
% 0.13/0.47
% 0.13/0.47 Lemma 32: converse(join(X, converse(Y))) = join(Y, converse(X)).
% 0.13/0.47 Proof:
% 0.13/0.47 converse(join(X, converse(Y)))
% 0.13/0.47 = { by axiom 3 (maddux1_join_commutativity) R->L }
% 0.13/0.47 converse(join(converse(Y), X))
% 0.13/0.47 = { by axiom 8 (converse_additivity) }
% 0.13/0.47 join(converse(converse(Y)), converse(X))
% 0.13/0.47 = { by axiom 1 (converse_idempotence) }
% 0.13/0.47 join(Y, converse(X))
% 0.13/0.47
% 0.13/0.47 Lemma 33: converse(join(converse(X), Y)) = join(X, converse(Y)).
% 0.13/0.47 Proof:
% 0.13/0.47 converse(join(converse(X), Y))
% 0.13/0.47 = { by axiom 3 (maddux1_join_commutativity) R->L }
% 0.13/0.47 converse(join(Y, converse(X)))
% 0.13/0.47 = { by lemma 32 }
% 0.13/0.47 join(X, converse(Y))
% 0.13/0.47
% 0.13/0.47 Lemma 34: converse(zero) = zero.
% 0.13/0.47 Proof:
% 0.13/0.47 converse(zero)
% 0.13/0.47 = { by lemma 31 R->L }
% 0.13/0.47 join(zero, converse(zero))
% 0.13/0.47 = { by lemma 33 R->L }
% 0.13/0.47 converse(join(converse(zero), zero))
% 0.13/0.47 = { by axiom 3 (maddux1_join_commutativity) R->L }
% 0.13/0.47 converse(join(zero, converse(zero)))
% 0.13/0.47 = { by lemma 16 R->L }
% 0.13/0.47 converse(join(zero, join(zero, meet(converse(zero), converse(zero)))))
% 0.13/0.47 = { by axiom 10 (maddux4_definiton_of_meet) }
% 0.13/0.47 converse(join(zero, join(zero, complement(join(complement(converse(zero)), complement(converse(zero)))))))
% 0.13/0.47 = { by lemma 23 R->L }
% 0.13/0.47 converse(join(zero, join(zero, join(complement(join(complement(converse(zero)), complement(converse(zero)))), complement(join(complement(converse(zero)), complement(converse(zero))))))))
% 0.13/0.47 = { by axiom 10 (maddux4_definiton_of_meet) R->L }
% 0.13/0.47 converse(join(zero, join(zero, join(meet(converse(zero), converse(zero)), complement(join(complement(converse(zero)), complement(converse(zero))))))))
% 0.13/0.47 = { by axiom 10 (maddux4_definiton_of_meet) R->L }
% 0.13/0.47 converse(join(zero, join(zero, join(meet(converse(zero), converse(zero)), meet(converse(zero), converse(zero))))))
% 0.13/0.47 = { by lemma 17 }
% 0.13/0.47 converse(join(zero, join(meet(converse(zero), converse(zero)), converse(zero))))
% 0.13/0.47 = { by axiom 3 (maddux1_join_commutativity) }
% 0.13/0.47 converse(join(zero, join(converse(zero), meet(converse(zero), converse(zero)))))
% 0.13/0.47 = { by lemma 17 }
% 0.13/0.47 converse(join(converse(zero), converse(zero)))
% 0.13/0.47 = { by lemma 32 }
% 0.13/0.47 join(zero, converse(converse(zero)))
% 0.13/0.47 = { by axiom 1 (converse_idempotence) }
% 0.13/0.47 join(zero, zero)
% 0.13/0.47 = { by lemma 30 R->L }
% 0.13/0.47 join(zero, complement(complement(zero)))
% 0.13/0.47 = { by lemma 30 R->L }
% 0.13/0.47 join(complement(complement(zero)), complement(complement(zero)))
% 0.13/0.47 = { by lemma 23 }
% 0.13/0.47 complement(complement(zero))
% 0.13/0.47 = { by lemma 30 }
% 0.13/0.47 zero
% 0.13/0.47
% 0.13/0.47 Lemma 35: join(top, X) = top.
% 0.13/0.47 Proof:
% 0.13/0.47 join(top, X)
% 0.13/0.47 = { by axiom 3 (maddux1_join_commutativity) R->L }
% 0.13/0.47 join(X, top)
% 0.13/0.47 = { by lemma 25 R->L }
% 0.13/0.47 join(Y, top)
% 0.13/0.47 = { by lemma 26 }
% 0.13/0.47 top
% 0.13/0.47
% 0.13/0.47 Lemma 36: join(X, composition(Y, X)) = composition(join(Y, one), X).
% 0.13/0.47 Proof:
% 0.13/0.47 join(X, composition(Y, X))
% 0.13/0.47 = { by lemma 21 R->L }
% 0.13/0.47 join(composition(one, X), composition(Y, X))
% 0.13/0.47 = { by axiom 11 (composition_distributivity) R->L }
% 0.13/0.47 composition(join(one, Y), X)
% 0.13/0.47 = { by axiom 3 (maddux1_join_commutativity) }
% 0.13/0.47 composition(join(Y, one), X)
% 0.13/0.47
% 0.13/0.47 Lemma 37: composition(top, zero) = zero.
% 0.13/0.47 Proof:
% 0.13/0.47 composition(top, zero)
% 0.13/0.47 = { by lemma 14 R->L }
% 0.13/0.47 composition(top, complement(top))
% 0.13/0.47 = { by lemma 35 R->L }
% 0.13/0.47 composition(join(top, one), complement(top))
% 0.13/0.47 = { by lemma 27 R->L }
% 0.13/0.47 composition(join(join(converse(X), join(complement(converse(X)), converse(complement(converse(complement(converse(X))))))), one), complement(top))
% 0.13/0.47 = { by lemma 33 R->L }
% 0.13/0.47 composition(join(join(converse(X), converse(join(converse(complement(converse(X))), complement(converse(complement(converse(X))))))), one), complement(top))
% 0.13/0.47 = { by axiom 5 (def_top) R->L }
% 0.13/0.47 composition(join(join(converse(X), converse(top)), one), complement(top))
% 0.13/0.47 = { by axiom 8 (converse_additivity) R->L }
% 0.13/0.47 composition(join(converse(join(X, top)), one), complement(top))
% 0.13/0.47 = { by lemma 26 }
% 0.13/0.47 composition(join(converse(top), one), complement(top))
% 0.13/0.47 = { by lemma 36 R->L }
% 0.13/0.47 join(complement(top), composition(converse(top), complement(top)))
% 0.13/0.47 = { by lemma 35 R->L }
% 0.13/0.47 join(complement(top), composition(converse(top), complement(join(top, composition(top, top)))))
% 0.13/0.47 = { by lemma 36 }
% 0.13/0.47 join(complement(top), composition(converse(top), complement(composition(join(top, one), top))))
% 0.13/0.47 = { by lemma 35 }
% 0.13/0.47 join(complement(top), composition(converse(top), complement(composition(top, top))))
% 0.13/0.47 = { by lemma 22 }
% 0.13/0.47 complement(top)
% 0.13/0.47 = { by lemma 14 }
% 0.13/0.47 zero
% 0.13/0.47
% 0.13/0.47 Lemma 38: composition(X, zero) = zero.
% 0.13/0.47 Proof:
% 0.13/0.47 composition(X, zero)
% 0.13/0.47 = { by lemma 31 R->L }
% 0.13/0.47 join(zero, composition(X, zero))
% 0.13/0.47 = { by lemma 37 R->L }
% 0.13/0.47 join(composition(top, zero), composition(X, zero))
% 0.13/0.47 = { by axiom 11 (composition_distributivity) R->L }
% 0.13/0.47 composition(join(top, X), zero)
% 0.13/0.47 = { by lemma 35 }
% 0.13/0.47 composition(top, zero)
% 0.13/0.47 = { by lemma 37 }
% 0.13/0.47 zero
% 0.13/0.47
% 0.13/0.47 Goal 1 (goals): tuple(composition(zero, x0), composition(x0_2, zero)) = tuple(zero, zero).
% 0.13/0.47 Proof:
% 0.13/0.47 tuple(composition(zero, x0), composition(x0_2, zero))
% 0.13/0.47 = { by lemma 38 }
% 0.13/0.47 tuple(composition(zero, x0), zero)
% 0.13/0.47 = { by lemma 34 R->L }
% 0.13/0.47 tuple(composition(converse(zero), x0), zero)
% 0.13/0.47 = { by lemma 19 R->L }
% 0.13/0.47 tuple(converse(composition(converse(x0), zero)), zero)
% 0.13/0.47 = { by lemma 38 }
% 0.13/0.47 tuple(converse(zero), zero)
% 0.13/0.47 = { by lemma 34 }
% 0.13/0.47 tuple(zero, zero)
% 0.13/0.47 % SZS output end Proof
% 0.13/0.47
% 0.13/0.47 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------