TSTP Solution File: REL043+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL043+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 22:01:34 EST 2010
% Result : Theorem 7.13s
% Output : Solution 7.13s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP13632/REL043+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13632/REL043+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13632/REL043+2.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 13728
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.90 CPU 4.01 WC
% PrfWatch: 5.89 CPU 6.02 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(2, axiom,![X1]:![X2]:![X3]:join(X1,join(X2,X3))=join(join(X1,X2),X3),file('/tmp/SRASS.s.p', maddux2_join_associativity)).
% fof(3, axiom,![X1]:![X2]:X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),file('/tmp/SRASS.s.p', maddux3_a_kind_of_de_Morgan)).
% fof(5, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(6, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(7, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(8, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(9, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(10, axiom,![X1]:![X2]:![X3]:join(meet(composition(X1,X2),X3),composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))))=composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))),file('/tmp/SRASS.s.p', dedekind_law)).
% fof(13, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(14, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(15, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(16, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(17, conjecture,![X1]:![X2]:![X3]:(join(composition(X1,converse(X2)),X3)=X3=>join(composition(complement(X3),X2),complement(X1))=complement(X1)),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:![X2]:![X3]:(join(composition(X1,converse(X2)),X3)=X3=>join(composition(complement(X3),X2),complement(X1))=complement(X1))),inference(assume_negation,[status(cth)],[17])).
% fof(19, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(20,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[2])).
% cnf(22,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[3])).
% cnf(24,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[23])).
% fof(27, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[5])).
% cnf(28,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(30,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[7])).
% cnf(32,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[8])).
% cnf(34,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[9])).
% cnf(36,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X4]:![X5]:![X6]:join(meet(composition(X4,X5),X6),composition(meet(X4,composition(X6,converse(X5))),meet(X5,composition(converse(X4),X6))))=composition(meet(X4,composition(X6,converse(X5))),meet(X5,composition(converse(X4),X6))),inference(variable_rename,[status(thm)],[10])).
% cnf(38,plain,(join(meet(composition(X1,X2),X3),composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))))=composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3)))),inference(split_conjunct,[status(thm)],[37])).
% fof(43, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[13])).
% cnf(44,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[14])).
% cnf(46,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[15])).
% cnf(48,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[49])).
% fof(51, negated_conjecture,?[X1]:?[X2]:?[X3]:(join(composition(X1,converse(X2)),X3)=X3&~(join(composition(complement(X3),X2),complement(X1))=complement(X1))),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,?[X4]:?[X5]:?[X6]:(join(composition(X4,converse(X5)),X6)=X6&~(join(composition(complement(X6),X5),complement(X4))=complement(X4))),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,(join(composition(esk1_0,converse(esk2_0)),esk3_0)=esk3_0&~(join(composition(complement(esk3_0),esk2_0),complement(esk1_0))=complement(esk1_0))),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(join(composition(complement(esk3_0),esk2_0),complement(esk1_0))!=complement(esk1_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,negated_conjecture,(join(composition(esk1_0,converse(esk2_0)),esk3_0)=esk3_0),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[50,44,theory(equality)]),['unfolding']).
% cnf(59,plain,(join(complement(join(complement(composition(X1,X2)),complement(X3))),composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3))))))=composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[38,44,theory(equality)]),44,theory(equality)]),44,theory(equality)]),44,theory(equality)]),44,theory(equality)]),['unfolding']).
% cnf(60,negated_conjecture,(join(complement(esk1_0),composition(complement(esk3_0),esk2_0))!=complement(esk1_0)),inference(rw,[status(thm)],[54,20,theory(equality)])).
% cnf(61,negated_conjecture,(join(esk3_0,composition(esk1_0,converse(esk2_0)))=esk3_0),inference(rw,[status(thm)],[55,20,theory(equality)])).
% cnf(64,plain,(converse(top)=join(converse(X1),converse(complement(X1)))),inference(spm,[status(thm)],[32,46,theory(equality)])).
% cnf(71,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[34,48,theory(equality)])).
% cnf(73,plain,(complement(top)=zero),inference(rw,[status(thm)],[56,46,theory(equality)])).
% cnf(75,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[46,22,theory(equality)])).
% cnf(81,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[22,46,theory(equality)])).
% cnf(117,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[36,20,theory(equality)])).
% cnf(134,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[24,20,theory(equality)])).
% cnf(296,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[71,30,theory(equality)])).
% cnf(313,plain,(one=converse(one)),inference(spm,[status(thm)],[48,296,theory(equality)])).
% cnf(344,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[296,313,theory(equality)])).
% cnf(358,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[117,344,theory(equality)])).
% cnf(370,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[358,313,theory(equality)]),344,theory(equality)])).
% cnf(394,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[134,370,theory(equality)])).
% cnf(403,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[370,73,theory(equality)])).
% cnf(407,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[394,46,theory(equality)]),73,theory(equality)])).
% cnf(419,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[22,403,theory(equality)])).
% cnf(425,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[407,20,theory(equality)])).
% cnf(464,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[419,425,theory(equality)])).
% cnf(475,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[20,464,theory(equality)])).
% cnf(476,plain,(converse(X1)=join(converse(zero),converse(X1))),inference(spm,[status(thm)],[32,464,theory(equality)])).
% cnf(484,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[425,464,theory(equality)])).
% cnf(504,plain,(join(complement(join(complement(composition(complement(X1),X2)),complement(X3))),composition(complement(join(X1,complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(complement(X1)),X3))))))=composition(complement(join(X1,complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(complement(X1)),X3)))))),inference(spm,[status(thm)],[59,484,theory(equality)])).
% cnf(506,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[370,484,theory(equality)])).
% cnf(530,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[22,506,theory(equality)])).
% cnf(582,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[530,134,theory(equality)])).
% cnf(587,plain,(join(X1,top)=top),inference(spm,[status(thm)],[530,46,theory(equality)])).
% cnf(588,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[530,20,theory(equality)])).
% cnf(612,plain,(top=join(top,X1)),inference(spm,[status(thm)],[20,587,theory(equality)])).
% cnf(613,plain,(converse(top)=join(converse(X1),converse(top))),inference(spm,[status(thm)],[32,587,theory(equality)])).
% cnf(615,plain,(composition(top,X2)=join(composition(X1,X2),composition(top,X2))),inference(spm,[status(thm)],[28,587,theory(equality)])).
% cnf(642,plain,(join(converse(zero),X1)=X1),inference(spm,[status(thm)],[476,30,theory(equality)])).
% cnf(658,plain,(zero=converse(zero)),inference(spm,[status(thm)],[475,642,theory(equality)])).
% cnf(702,plain,(join(X1,converse(top))=converse(top)),inference(spm,[status(thm)],[613,30,theory(equality)])).
% cnf(718,plain,(converse(top)=top),inference(spm,[status(thm)],[612,702,theory(equality)])).
% cnf(800,plain,(join(X1,join(complement(X1),X2))=top),inference(rw,[status(thm)],[81,612,theory(equality)])).
% cnf(824,plain,(join(join(complement(X1),X2),X1)=top),inference(spm,[status(thm)],[800,134,theory(equality)])).
% cnf(847,plain,(join(complement(X1),join(X2,X1))=top),inference(rw,[status(thm)],[824,22,theory(equality)])).
% cnf(968,negated_conjecture,(join(complement(composition(esk1_0,converse(esk2_0))),esk3_0)=top),inference(spm,[status(thm)],[847,61,theory(equality)])).
% cnf(1025,negated_conjecture,(join(esk3_0,complement(composition(esk1_0,converse(esk2_0))))=top),inference(rw,[status(thm)],[968,20,theory(equality)])).
% cnf(1041,plain,(join(converse(X1),converse(complement(X1)))=top),inference(rw,[status(thm)],[64,718,theory(equality)])).
% cnf(1055,plain,(join(X1,converse(complement(converse(X1))))=top),inference(spm,[status(thm)],[1041,30,theory(equality)])).
% cnf(1141,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[582,20,theory(equality)])).
% cnf(1169,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1141,588,theory(equality)])).
% cnf(1268,plain,(join(X1,X3)=join(X1,join(complement(join(X2,complement(X1))),X3))),inference(spm,[status(thm)],[22,1169,theory(equality)])).
% cnf(1278,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1169,484,theory(equality)])).
% cnf(1655,plain,(join(X1,join(X2,complement(join(X2,X1))))=top),inference(spm,[status(thm)],[75,20,theory(equality)])).
% cnf(3991,plain,(join(X1,composition(top,X1))=composition(top,X1)),inference(spm,[status(thm)],[615,344,theory(equality)])).
% cnf(4009,plain,(composition(top,top)=top),inference(spm,[status(thm)],[612,3991,theory(equality)])).
% cnf(4049,plain,(join(complement(top),composition(converse(top),complement(top)))=complement(top)),inference(spm,[status(thm)],[117,4009,theory(equality)])).
% cnf(4064,plain,(composition(top,zero)=complement(top)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[4049,73,theory(equality)]),718,theory(equality)]),73,theory(equality)]),464,theory(equality)])).
% cnf(4065,plain,(composition(top,zero)=zero),inference(rw,[status(thm)],[4064,73,theory(equality)])).
% cnf(4080,plain,(join(composition(X1,zero),zero)=zero),inference(spm,[status(thm)],[615,4065,theory(equality)])).
% cnf(4098,plain,(composition(X1,zero)=zero),inference(rw,[status(thm)],[4080,475,theory(equality)])).
% cnf(4149,plain,(converse(zero)=composition(converse(zero),converse(X1))),inference(spm,[status(thm)],[34,4098,theory(equality)])).
% cnf(4184,plain,(zero=composition(converse(zero),converse(X1))),inference(rw,[status(thm)],[4149,658,theory(equality)])).
% cnf(4185,plain,(zero=composition(zero,converse(X1))),inference(rw,[status(thm)],[4184,658,theory(equality)])).
% cnf(4218,plain,(composition(zero,X1)=zero),inference(spm,[status(thm)],[4185,30,theory(equality)])).
% cnf(23442,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),complement(complement(X1)))))),inference(spm,[status(thm)],[1268,134,theory(equality)])).
% cnf(23697,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),X1)))),inference(rw,[status(thm)],[23442,484,theory(equality)])).
% cnf(23796,plain,(join(X1,complement(join(X2,X1)))=join(X1,complement(X2))),inference(spm,[status(thm)],[23697,484,theory(equality)])).
% cnf(24242,plain,(join(converse(complement(X1)),complement(top))=join(converse(complement(X1)),complement(converse(X1)))),inference(spm,[status(thm)],[23796,1041,theory(equality)])).
% cnf(24295,plain,(join(converse(complement(converse(X1))),complement(top))=join(converse(complement(converse(X1))),complement(X1))),inference(spm,[status(thm)],[23796,1055,theory(equality)])).
% cnf(24322,plain,(join(join(X1,complement(join(X1,X2))),complement(top))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(spm,[status(thm)],[23796,1655,theory(equality)])).
% cnf(24442,plain,(converse(complement(X1))=join(converse(complement(X1)),complement(converse(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[24242,73,theory(equality)]),475,theory(equality)])).
% cnf(24516,plain,(converse(complement(converse(X1)))=join(converse(complement(converse(X1))),complement(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[24295,73,theory(equality)]),475,theory(equality)])).
% cnf(24562,plain,(join(X1,complement(join(X1,X2)))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[24322,73,theory(equality)]),22,theory(equality)]),475,theory(equality)])).
% cnf(24563,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[24562,22,theory(equality)]),20,theory(equality)]),1278,theory(equality)])).
% cnf(25180,plain,(join(complement(converse(X1)),converse(complement(X1)))=converse(complement(X1))),inference(rw,[status(thm)],[24442,20,theory(equality)])).
% cnf(25270,plain,(join(complement(X1),converse(complement(converse(X1))))=converse(complement(converse(X1)))),inference(rw,[status(thm)],[24516,20,theory(equality)])).
% cnf(25271,plain,(converse(converse(complement(converse(X1))))=join(converse(complement(X1)),converse(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[32,25270,theory(equality)])).
% cnf(25322,plain,(complement(converse(X1))=join(converse(complement(X1)),converse(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[25271,30,theory(equality)])).
% cnf(25323,plain,(complement(converse(X1))=converse(complement(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[25322,30,theory(equality)]),20,theory(equality)]),25180,theory(equality)])).
% cnf(195656,plain,(join(complement(join(complement(composition(complement(X1),X2)),complement(X3))),composition(complement(join(X1,complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(complement(converse(X1)),X3))))))=composition(complement(join(X1,complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(complement(X1)),X3)))))),inference(rw,[status(thm)],[504,25323,theory(equality)])).
% cnf(195657,plain,(join(complement(join(complement(composition(complement(X1),X2)),complement(X3))),composition(complement(join(X1,complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(complement(converse(X1)),X3))))))=composition(complement(join(X1,complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(complement(converse(X1)),X3)))))),inference(rw,[status(thm)],[195656,25323,theory(equality)])).
% cnf(195786,negated_conjecture,(join(complement(join(complement(composition(complement(esk3_0),esk2_0)),complement(esk1_0))),composition(complement(top),complement(join(complement(esk2_0),complement(composition(complement(converse(esk3_0)),esk1_0))))))=composition(complement(top),complement(join(complement(esk2_0),complement(composition(complement(converse(esk3_0)),esk1_0)))))),inference(spm,[status(thm)],[195657,1025,theory(equality)])).
% cnf(196104,negated_conjecture,(complement(join(complement(composition(complement(esk3_0),esk2_0)),complement(esk1_0)))=composition(complement(top),complement(join(complement(esk2_0),complement(composition(complement(converse(esk3_0)),esk1_0)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[195786,73,theory(equality)]),4218,theory(equality)]),475,theory(equality)])).
% cnf(196105,negated_conjecture,(complement(join(complement(composition(complement(esk3_0),esk2_0)),complement(esk1_0)))=zero),inference(rw,[status(thm)],[inference(rw,[status(thm)],[196104,73,theory(equality)]),4218,theory(equality)])).
% cnf(196371,negated_conjecture,(complement(join(complement(esk1_0),complement(composition(complement(esk3_0),esk2_0))))=zero),inference(rw,[status(thm)],[196105,20,theory(equality)])).
% cnf(196644,negated_conjecture,(join(complement(esk1_0),zero)=join(complement(esk1_0),complement(complement(composition(complement(esk3_0),esk2_0))))),inference(spm,[status(thm)],[24563,196371,theory(equality)])).
% cnf(197113,negated_conjecture,(complement(esk1_0)=join(complement(esk1_0),complement(complement(composition(complement(esk3_0),esk2_0))))),inference(rw,[status(thm)],[196644,475,theory(equality)])).
% cnf(197114,negated_conjecture,(complement(esk1_0)=join(complement(esk1_0),composition(complement(esk3_0),esk2_0))),inference(rw,[status(thm)],[197113,484,theory(equality)])).
% cnf(197115,negated_conjecture,($false),inference(sr,[status(thm)],[197114,60,theory(equality)])).
% cnf(197116,negated_conjecture,($false),197115,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3303
% # ...of these trivial : 2134
% # ...subsumed : 496
% # ...remaining for further processing: 673
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 158
% # Generated clauses : 90229
% # ...of the previous two non-trivial : 44455
% # Contextual simplify-reflections : 0
% # Paramodulations : 90229
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 515
% # Positive orientable unit clauses: 510
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 32954
% # ...number of literals in the above : 32954
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 23
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3437
% # Indexed BW rewrite successes : 247
% # Backwards rewriting index: 472 leaves, 2.63+/-4.713 terms/leaf
% # Paramod-from index: 248 leaves, 2.08+/-2.505 terms/leaf
% # Paramod-into index: 434 leaves, 2.65+/-4.817 terms/leaf
% # -------------------------------------------------
% # User time : 3.040 s
% # System time : 0.125 s
% # Total time : 3.165 s
% # Maximum resident set size: 0 pages
% PrfWatch: 6.31 CPU 6.45 WC
% FINAL PrfWatch: 6.31 CPU 6.45 WC
% SZS output end Solution for /tmp/SystemOnTPTP13632/REL043+2.tptp
%
%------------------------------------------------------------------------------