%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL030+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.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 21:49:05 EST 2010
% Result : Theorem 10.96s
% Output : Solution 10.96s
% 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/SystemOnTPTP5024/REL030+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5024/REL030+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5024/REL030+3.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 5120
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.94 CPU 2.02 WC
% PrfWatch: 3.92 CPU 4.03 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 5.60 CPU 6.03 WC
% PrfWatch: 7.18 CPU 8.04 WC
% PrfWatch: 9.17 CPU 10.04 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(4, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(5, axiom,![X1]:![X2]:![X3]:composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3),file('/tmp/SRASS.s.p', composition_associativity)).
% fof(6, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(7, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(8, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(9, 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(12, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(13, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(14, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(15, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(16, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(17, conjecture,![X1]:![X2]:![X3]:(join(X1,one)=one=>meet(composition(X1,X2),complement(X3))=meet(composition(X1,X2),complement(composition(X1,X3)))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:![X2]:![X3]:(join(X1,one)=one=>meet(composition(X1,X2),complement(X3))=meet(composition(X1,X2),complement(composition(X1,X3))))),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(25, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[4])).
% cnf(26,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X4]:![X5]:![X6]:composition(X4,composition(X5,X6))=composition(composition(X4,X5),X6),inference(variable_rename,[status(thm)],[5])).
% cnf(28,plain,(composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(30,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(32,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[8])).
% cnf(34,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, 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)],[9])).
% cnf(36,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)],[35])).
% fof(41, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[12])).
% cnf(42,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[13])).
% cnf(44,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(46,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[15])).
% cnf(48,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[49])).
% fof(51, negated_conjecture,?[X1]:?[X2]:?[X3]:(join(X1,one)=one&~(meet(composition(X1,X2),complement(X3))=meet(composition(X1,X2),complement(composition(X1,X3))))),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,?[X4]:?[X5]:?[X6]:(join(X4,one)=one&~(meet(composition(X4,X5),complement(X6))=meet(composition(X4,X5),complement(composition(X4,X6))))),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,(join(esk1_0,one)=one&~(meet(composition(esk1_0,esk2_0),complement(esk3_0))=meet(composition(esk1_0,esk2_0),complement(composition(esk1_0,esk3_0))))),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(meet(composition(esk1_0,esk2_0),complement(esk3_0))!=meet(composition(esk1_0,esk2_0),complement(composition(esk1_0,esk3_0)))),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,negated_conjecture,(join(esk1_0,one)=one),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[42,26,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)],[36,26,theory(equality)]),26,theory(equality)]),26,theory(equality)]),26,theory(equality)]),26,theory(equality)]),['unfolding']).
% cnf(60,negated_conjecture,(complement(join(complement(composition(esk1_0,esk2_0)),complement(complement(composition(esk1_0,esk3_0)))))!=complement(join(complement(composition(esk1_0,esk2_0)),complement(complement(esk3_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[54,26,theory(equality)]),26,theory(equality)]),['unfolding']).
% cnf(61,negated_conjecture,(complement(join(complement(composition(esk1_0,esk2_0)),complement(complement(composition(esk1_0,esk3_0)))))!=complement(join(complement(complement(esk3_0)),complement(composition(esk1_0,esk2_0))))),inference(rw,[status(thm)],[60,20,theory(equality)])).
% cnf(62,negated_conjecture,(join(one,esk1_0)=one),inference(rw,[status(thm)],[55,20,theory(equality)])).
% cnf(64,plain,(converse(top)=join(converse(X1),converse(complement(X1)))),inference(spm,[status(thm)],[48,44,theory(equality)])).
% cnf(71,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[50,30,theory(equality)])).
% cnf(73,plain,(complement(top)=zero),inference(rw,[status(thm)],[56,44,theory(equality)])).
% cnf(80,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[22,44,theory(equality)])).
% cnf(81,plain,(join(join(X2,X1),X3)=join(X1,join(X2,X3))),inference(spm,[status(thm)],[22,20,theory(equality)])).
% cnf(87,plain,(join(X2,join(X1,X3))=join(X1,join(X2,X3))),inference(rw,[status(thm)],[81,22,theory(equality)])).
% cnf(102,plain,(composition(top,X2)=join(composition(X1,X2),composition(complement(X1),X2))),inference(spm,[status(thm)],[32,44,theory(equality)])).
% cnf(114,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[34,20,theory(equality)])).
% cnf(115,plain,(converse(complement(X1))=join(converse(complement(X1)),converse(composition(converse(X2),complement(composition(X2,X1)))))),inference(spm,[status(thm)],[48,114,theory(equality)])).
% cnf(125,plain,(converse(complement(X1))=join(converse(complement(X1)),composition(converse(complement(composition(X2,X1))),X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[115,50,theory(equality)]),46,theory(equality)])).
% cnf(131,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[24,20,theory(equality)])).
% cnf(135,plain,(join(complement(X1),complement(join(complement(join(complement(X1),X2)),complement(complement(join(complement(X1),complement(X2)))))))=join(complement(X1),X2)),inference(spm,[status(thm)],[131,131,theory(equality)])).
% cnf(253,negated_conjecture,(converse(one)=join(converse(one),converse(esk1_0))),inference(spm,[status(thm)],[48,62,theory(equality)])).
% cnf(254,negated_conjecture,(join(one,X1)=join(one,join(esk1_0,X1))),inference(spm,[status(thm)],[22,62,theory(equality)])).
% cnf(255,negated_conjecture,(composition(one,X1)=join(composition(one,X1),composition(esk1_0,X1))),inference(spm,[status(thm)],[32,62,theory(equality)])).
% cnf(306,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[71,46,theory(equality)])).
% cnf(320,plain,(one=converse(one)),inference(spm,[status(thm)],[30,306,theory(equality)])).
% cnf(349,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[306,320,theory(equality)])).
% cnf(350,negated_conjecture,(join(one,converse(esk1_0))=converse(one)),inference(rw,[status(thm)],[253,320,theory(equality)])).
% cnf(351,negated_conjecture,(join(one,converse(esk1_0))=one),inference(rw,[status(thm)],[350,320,theory(equality)])).
% cnf(365,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[114,349,theory(equality)])).
% cnf(377,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[365,320,theory(equality)]),349,theory(equality)])).
% cnf(380,negated_conjecture,(composition(one,X1)=join(composition(one,X1),composition(converse(esk1_0),X1))),inference(spm,[status(thm)],[32,351,theory(equality)])).
% cnf(383,negated_conjecture,(X1=join(composition(one,X1),composition(converse(esk1_0),X1))),inference(rw,[status(thm)],[380,349,theory(equality)])).
% cnf(384,negated_conjecture,(X1=join(X1,composition(converse(esk1_0),X1))),inference(rw,[status(thm)],[383,349,theory(equality)])).
% cnf(390,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[131,377,theory(equality)])).
% cnf(399,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[377,73,theory(equality)])).
% cnf(403,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[390,44,theory(equality)]),73,theory(equality)])).
% cnf(415,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[22,399,theory(equality)])).
% cnf(421,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[403,20,theory(equality)])).
% cnf(439,negated_conjecture,(join(one,top)=join(one,complement(esk1_0))),inference(spm,[status(thm)],[254,44,theory(equality)])).
% cnf(448,negated_conjecture,(join(one,complement(esk1_0))=join(top,one)),inference(rw,[status(thm)],[439,20,theory(equality)])).
% cnf(470,negated_conjecture,(join(one,esk1_0)=join(one,composition(converse(esk1_0),esk1_0))),inference(spm,[status(thm)],[254,384,theory(equality)])).
% cnf(474,negated_conjecture,(converse(X1)=join(converse(X1),converse(composition(converse(esk1_0),X1)))),inference(spm,[status(thm)],[48,384,theory(equality)])).
% cnf(478,negated_conjecture,(one=join(one,composition(converse(esk1_0),esk1_0))),inference(rw,[status(thm)],[470,62,theory(equality)])).
% cnf(480,negated_conjecture,(converse(X1)=join(converse(X1),composition(converse(X1),esk1_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[474,50,theory(equality)]),46,theory(equality)])).
% cnf(507,plain,(join(X1,complement(X1))=join(top,complement(X1))),inference(spm,[status(thm)],[80,377,theory(equality)])).
% cnf(521,plain,(top=join(top,complement(X1))),inference(rw,[status(thm)],[507,44,theory(equality)])).
% cnf(545,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[415,421,theory(equality)])).
% cnf(556,plain,(complement(zero)=top),inference(spm,[status(thm)],[44,545,theory(equality)])).
% cnf(558,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[20,545,theory(equality)])).
% cnf(559,plain,(converse(X1)=join(converse(zero),converse(X1))),inference(spm,[status(thm)],[48,545,theory(equality)])).
% cnf(567,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[421,545,theory(equality)])).
% cnf(607,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[377,567,theory(equality)])).
% cnf(608,plain,(join(top,X1)=top),inference(spm,[status(thm)],[521,567,theory(equality)])).
% cnf(617,negated_conjecture,(complement(join(complement(composition(esk1_0,esk2_0)),composition(esk1_0,esk3_0)))!=complement(join(complement(complement(esk3_0)),complement(composition(esk1_0,esk2_0))))),inference(rw,[status(thm)],[61,567,theory(equality)])).
% cnf(618,negated_conjecture,(complement(join(complement(composition(esk1_0,esk2_0)),composition(esk1_0,esk3_0)))!=complement(join(esk3_0,complement(composition(esk1_0,esk2_0))))),inference(rw,[status(thm)],[617,567,theory(equality)])).
% cnf(635,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[22,607,theory(equality)])).
% cnf(691,plain,(composition(X1,X2)=join(composition(X1,X2),composition(zero,X2))),inference(spm,[status(thm)],[32,558,theory(equality)])).
% cnf(704,plain,(top=join(X1,top)),inference(spm,[status(thm)],[20,608,theory(equality)])).
% cnf(709,plain,(join(X1,join(complement(X1),X2))=top),inference(rw,[status(thm)],[80,608,theory(equality)])).
% cnf(711,negated_conjecture,(join(one,complement(esk1_0))=top),inference(rw,[status(thm)],[448,608,theory(equality)])).
% cnf(722,plain,(join(one,converse(complement(one)))=converse(top)),inference(spm,[status(thm)],[64,320,theory(equality)])).
% cnf(746,negated_conjecture,(composition(top,X1)=join(composition(one,X1),composition(complement(esk1_0),X1))),inference(spm,[status(thm)],[32,711,theory(equality)])).
% cnf(749,negated_conjecture,(composition(top,X1)=join(X1,composition(complement(esk1_0),X1))),inference(rw,[status(thm)],[746,349,theory(equality)])).
% cnf(774,plain,(join(converse(zero),X1)=X1),inference(spm,[status(thm)],[559,46,theory(equality)])).
% cnf(781,plain,(zero=converse(zero)),inference(spm,[status(thm)],[558,774,theory(equality)])).
% cnf(842,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[635,131,theory(equality)])).
% cnf(850,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[635,20,theory(equality)])).
% cnf(951,plain,(join(complement(X1),join(X1,X2))=top),inference(spm,[status(thm)],[709,567,theory(equality)])).
% cnf(1112,plain,(join(complement(one),converse(top))=top),inference(spm,[status(thm)],[951,722,theory(equality)])).
% cnf(1139,plain,(converse(top)=join(converse(complement(one)),converse(converse(top)))),inference(spm,[status(thm)],[48,1112,theory(equality)])).
% cnf(1147,plain,(converse(top)=top),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1139,46,theory(equality)]),704,theory(equality)])).
% cnf(1165,plain,(join(converse(X1),converse(complement(X1)))=top),inference(rw,[status(thm)],[64,1147,theory(equality)])).
% cnf(1533,plain,(join(X1,converse(complement(converse(X1))))=top),inference(spm,[status(thm)],[1165,46,theory(equality)])).
% cnf(1709,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[842,20,theory(equality)])).
% cnf(1742,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1709,850,theory(equality)])).
% cnf(1819,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1742,567,theory(equality)])).
% cnf(2177,negated_conjecture,(composition(top,top)=top),inference(spm,[status(thm)],[608,749,theory(equality)])).
% cnf(2192,negated_conjecture,(join(X1,composition(top,X1))=composition(top,X1)),inference(spm,[status(thm)],[635,749,theory(equality)])).
% cnf(2206,negated_conjecture,(composition(top,X1)=composition(top,composition(top,X1))),inference(spm,[status(thm)],[28,2177,theory(equality)])).
% cnf(2419,negated_conjecture,(join(complement(composition(top,X1)),composition(converse(top),complement(composition(top,X1))))=complement(composition(top,X1))),inference(spm,[status(thm)],[114,2206,theory(equality)])).
% cnf(2436,negated_conjecture,(composition(top,complement(composition(top,X1)))=complement(composition(top,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2419,1147,theory(equality)]),2192,theory(equality)])).
% cnf(3566,negated_conjecture,(join(complement(composition(converse(esk1_0),esk1_0)),complement(one))=complement(composition(converse(esk1_0),esk1_0))),inference(spm,[status(thm)],[1819,478,theory(equality)])).
% cnf(4360,negated_conjecture,(converse(complement(composition(top,X1)))=composition(converse(complement(composition(top,X1))),converse(top))),inference(spm,[status(thm)],[50,2436,theory(equality)])).
% cnf(4377,negated_conjecture,(converse(complement(composition(top,X1)))=composition(converse(complement(composition(top,X1))),top)),inference(rw,[status(thm)],[4360,1147,theory(equality)])).
% cnf(7265,plain,(join(converse(zero),composition(converse(complement(composition(X1,top))),X1))=converse(zero)),inference(spm,[status(thm)],[125,73,theory(equality)])).
% cnf(7307,plain,(composition(converse(complement(composition(X1,top))),X1)=converse(zero)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[7265,781,theory(equality)]),545,theory(equality)])).
% cnf(7308,plain,(composition(converse(complement(composition(X1,top))),X1)=zero),inference(rw,[status(thm)],[7307,781,theory(equality)])).
% cnf(7324,plain,(join(zero,composition(zero,X1))=zero),inference(spm,[status(thm)],[691,7308,theory(equality)])).
% cnf(7351,plain,(composition(zero,X1)=zero),inference(rw,[status(thm)],[7324,545,theory(equality)])).
% cnf(8203,negated_conjecture,(join(X1,composition(X1,esk1_0))=X1),inference(spm,[status(thm)],[480,46,theory(equality)])).
% cnf(8251,negated_conjecture,(join(X1,X2)=join(X1,join(composition(X1,esk1_0),X2))),inference(spm,[status(thm)],[22,8203,theory(equality)])).
% cnf(8258,negated_conjecture,(join(complement(composition(X1,esk1_0)),complement(X1))=complement(composition(X1,esk1_0))),inference(spm,[status(thm)],[1819,8203,theory(equality)])).
% cnf(8741,negated_conjecture,(join(X1,composition(esk1_0,X1))=composition(one,X1)),inference(rw,[status(thm)],[255,349,theory(equality)])).
% cnf(8742,negated_conjecture,(join(X1,composition(esk1_0,X1))=X1),inference(rw,[status(thm)],[8741,349,theory(equality)])).
% cnf(8770,negated_conjecture,(join(X1,X2)=join(X2,join(X1,composition(esk1_0,X2)))),inference(spm,[status(thm)],[87,8742,theory(equality)])).
% cnf(8840,negated_conjecture,(join(complement(one),complement(composition(converse(esk1_0),esk1_0)))=complement(composition(converse(esk1_0),esk1_0))),inference(rw,[status(thm)],[3566,20,theory(equality)])).
% cnf(8864,negated_conjecture,(join(complement(join(complement(composition(esk1_0,one)),complement(esk1_0))),composition(complement(join(complement(esk1_0),complement(composition(esk1_0,converse(one))))),complement(complement(composition(converse(esk1_0),esk1_0)))))=composition(complement(join(complement(esk1_0),complement(composition(esk1_0,converse(one))))),complement(complement(composition(converse(esk1_0),esk1_0))))),inference(spm,[status(thm)],[59,8840,theory(equality)])).
% cnf(8883,negated_conjecture,(join(esk1_0,composition(esk1_0,composition(converse(esk1_0),esk1_0)))=composition(complement(join(complement(esk1_0),complement(composition(esk1_0,converse(one))))),complement(complement(composition(converse(esk1_0),esk1_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[8864,30,theory(equality)]),607,theory(equality)]),567,theory(equality)]),320,theory(equality)]),30,theory(equality)]),607,theory(equality)]),567,theory(equality)]),567,theory(equality)])).
% cnf(8884,negated_conjecture,(join(esk1_0,composition(esk1_0,composition(converse(esk1_0),esk1_0)))=composition(esk1_0,composition(converse(esk1_0),esk1_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[8883,320,theory(equality)]),30,theory(equality)]),607,theory(equality)]),567,theory(equality)]),567,theory(equality)])).
% cnf(10862,negated_conjecture,(join(X1,composition(top,esk1_0))=join(X1,composition(complement(X1),esk1_0))),inference(spm,[status(thm)],[8251,102,theory(equality)])).
% cnf(18322,plain,(join(complement(X1),complement(join(complement(X1),complement(X2))))=join(complement(X1),X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[135,567,theory(equality)]),87,theory(equality)]),20,theory(equality)]),1819,theory(equality)])).
% cnf(18377,plain,(join(X1,complement(join(X1,complement(X2))))=join(X1,X2)),inference(spm,[status(thm)],[18322,567,theory(equality)])).
% cnf(18631,plain,(join(X1,complement(join(X1,X2)))=join(X1,join(X1,complement(X2)))),inference(spm,[status(thm)],[18377,18377,theory(equality)])).
% cnf(18739,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[18631,635,theory(equality)])).
% cnf(18883,plain,(join(converse(X1),complement(top))=join(converse(X1),complement(converse(complement(X1))))),inference(spm,[status(thm)],[18739,1165,theory(equality)])).
% cnf(18986,plain,(join(X1,complement(top))=join(X1,complement(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[18739,1533,theory(equality)])).
% cnf(19094,plain,(converse(X1)=join(converse(X1),complement(converse(complement(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[18883,73,theory(equality)]),558,theory(equality)])).
% cnf(19221,plain,(X1=join(X1,complement(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[18986,73,theory(equality)]),558,theory(equality)])).
% cnf(20218,plain,(converse(converse(X1))=join(converse(converse(X1)),converse(complement(converse(complement(X1)))))),inference(spm,[status(thm)],[48,19094,theory(equality)])).
% cnf(20255,plain,(X1=join(converse(converse(X1)),converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[20218,46,theory(equality)])).
% cnf(20256,plain,(X1=join(X1,converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[20255,46,theory(equality)])).
% cnf(20335,plain,(join(complement(X1),converse(complement(converse(X1))))=complement(X1)),inference(spm,[status(thm)],[20256,567,theory(equality)])).
% cnf(20387,plain,(join(complement(converse(complement(converse(X1)))),complement(complement(X1)))=complement(converse(complement(converse(X1))))),inference(spm,[status(thm)],[1819,20335,theory(equality)])).
% cnf(20427,plain,(X1=complement(converse(complement(converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[20387,567,theory(equality)]),20,theory(equality)]),19221,theory(equality)])).
% cnf(20474,plain,(complement(X1)=converse(complement(converse(X1)))),inference(spm,[status(thm)],[567,20427,theory(equality)])).
% cnf(20547,plain,(converse(complement(X1))=complement(converse(X1))),inference(spm,[status(thm)],[46,20474,theory(equality)])).
% cnf(20648,plain,(composition(complement(composition(top,converse(X1))),X1)=zero),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[7308,20547,theory(equality)]),50,theory(equality)]),1147,theory(equality)])).
% cnf(20651,negated_conjecture,(composition(complement(composition(converse(X1),top)),top)=converse(complement(composition(top,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[4377,20547,theory(equality)]),50,theory(equality)]),1147,theory(equality)])).
% cnf(20652,negated_conjecture,(composition(complement(composition(converse(X1),top)),top)=complement(composition(converse(X1),top))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[20651,20547,theory(equality)]),50,theory(equality)]),1147,theory(equality)])).
% cnf(23565,negated_conjecture,(join(composition(converse(esk1_0),esk1_0),composition(esk1_0,composition(converse(esk1_0),esk1_0)))=join(esk1_0,composition(converse(esk1_0),esk1_0))),inference(spm,[status(thm)],[8770,8884,theory(equality)])).
% cnf(23575,negated_conjecture,(composition(converse(esk1_0),esk1_0)=join(esk1_0,composition(converse(esk1_0),esk1_0))),inference(rw,[status(thm)],[23565,8742,theory(equality)])).
% cnf(23576,negated_conjecture,(composition(converse(esk1_0),esk1_0)=esk1_0),inference(rw,[status(thm)],[23575,384,theory(equality)])).
% cnf(23577,negated_conjecture,(converse(esk1_0)=composition(converse(esk1_0),converse(converse(esk1_0)))),inference(spm,[status(thm)],[50,23576,theory(equality)])).
% cnf(23608,negated_conjecture,(converse(esk1_0)=esk1_0),inference(rw,[status(thm)],[inference(rw,[status(thm)],[23577,46,theory(equality)]),23576,theory(equality)])).
% cnf(23636,negated_conjecture,(composition(complement(composition(top,esk1_0)),esk1_0)=zero),inference(spm,[status(thm)],[20648,23608,theory(equality)])).
% cnf(23641,negated_conjecture,(join(complement(X1),composition(esk1_0,complement(composition(esk1_0,X1))))=complement(X1)),inference(spm,[status(thm)],[114,23608,theory(equality)])).
% cnf(23867,negated_conjecture,(composition(zero,X1)=composition(complement(composition(top,esk1_0)),composition(esk1_0,X1))),inference(spm,[status(thm)],[28,23636,theory(equality)])).
% cnf(23891,negated_conjecture,(zero=composition(complement(composition(top,esk1_0)),composition(esk1_0,X1))),inference(rw,[status(thm)],[23867,7351,theory(equality)])).
% cnf(25935,negated_conjecture,(join(X1,complement(join(X1,composition(top,esk1_0))))=join(X1,complement(composition(complement(X1),esk1_0)))),inference(spm,[status(thm)],[18739,10862,theory(equality)])).
% cnf(25997,negated_conjecture,(join(X1,complement(composition(top,esk1_0)))=join(X1,complement(composition(complement(X1),esk1_0)))),inference(rw,[status(thm)],[25935,18739,theory(equality)])).
% cnf(27765,negated_conjecture,(composition(complement(composition(X1,top)),top)=complement(composition(X1,top))),inference(spm,[status(thm)],[20652,46,theory(equality)])).
% cnf(31258,negated_conjecture,(join(complement(composition(esk1_0,X1)),composition(converse(complement(composition(top,esk1_0))),complement(zero)))=complement(composition(esk1_0,X1))),inference(spm,[status(thm)],[114,23891,theory(equality)])).
% cnf(31303,negated_conjecture,(join(complement(composition(esk1_0,X1)),complement(composition(esk1_0,top)))=complement(composition(esk1_0,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[31258,20547,theory(equality)]),50,theory(equality)]),23608,theory(equality)]),1147,theory(equality)]),556,theory(equality)]),27765,theory(equality)])).
% cnf(32668,negated_conjecture,(join(complement(X1),complement(composition(X1,esk1_0)))=complement(composition(X1,esk1_0))),inference(rw,[status(thm)],[8258,20,theory(equality)])).
% cnf(32740,negated_conjecture,(join(X1,complement(composition(complement(X1),esk1_0)))=complement(composition(complement(X1),esk1_0))),inference(spm,[status(thm)],[32668,567,theory(equality)])).
% cnf(58599,negated_conjecture,(join(X1,complement(composition(top,esk1_0)))=complement(composition(complement(X1),esk1_0))),inference(rw,[status(thm)],[32740,25997,theory(equality)])).
% cnf(58624,negated_conjecture,(complement(join(X1,complement(composition(top,esk1_0))))=composition(complement(X1),esk1_0)),inference(spm,[status(thm)],[567,58599,theory(equality)])).
% cnf(58958,negated_conjecture,(converse(complement(join(X1,complement(composition(top,esk1_0)))))=composition(converse(esk1_0),converse(complement(X1)))),inference(spm,[status(thm)],[50,58624,theory(equality)])).
% cnf(59049,negated_conjecture,(complement(join(converse(X1),complement(composition(esk1_0,top))))=composition(converse(esk1_0),converse(complement(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[58958,20547,theory(equality)]),48,theory(equality)]),20547,theory(equality)]),50,theory(equality)]),23608,theory(equality)]),1147,theory(equality)])).
% cnf(59050,negated_conjecture,(complement(join(converse(X1),complement(composition(esk1_0,top))))=composition(esk1_0,complement(converse(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[59049,23608,theory(equality)]),20547,theory(equality)])).
% cnf(59903,negated_conjecture,(composition(esk1_0,complement(converse(X1)))=complement(join(complement(composition(esk1_0,top)),converse(X1)))),inference(rw,[status(thm)],[59050,20,theory(equality)])).
% cnf(59965,negated_conjecture,(composition(esk1_0,complement(X1))=complement(join(complement(composition(esk1_0,top)),X1))),inference(spm,[status(thm)],[59903,46,theory(equality)])).
% cnf(102458,negated_conjecture,(join(complement(X1),complement(join(complement(composition(esk1_0,top)),composition(esk1_0,X1))))=complement(X1)),inference(rw,[status(thm)],[23641,59965,theory(equality)])).
% cnf(102472,negated_conjecture,(join(complement(complement(join(complement(composition(esk1_0,top)),composition(esk1_0,X1)))),complement(complement(X1)))=complement(complement(join(complement(composition(esk1_0,top)),composition(esk1_0,X1))))),inference(spm,[status(thm)],[1819,102458,theory(equality)])).
% cnf(102612,negated_conjecture,(join(complement(composition(esk1_0,top)),X1)=complement(complement(join(complement(composition(esk1_0,top)),composition(esk1_0,X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[102472,567,theory(equality)]),567,theory(equality)]),22,theory(equality)]),20,theory(equality)]),8742,theory(equality)])).
% cnf(102613,negated_conjecture,(join(complement(composition(esk1_0,top)),X1)=join(complement(composition(esk1_0,top)),composition(esk1_0,X1))),inference(rw,[status(thm)],[102612,567,theory(equality)])).
% cnf(102790,negated_conjecture,(join(complement(composition(esk1_0,top)),complement(join(complement(composition(esk1_0,top)),X1)))=join(complement(composition(esk1_0,top)),complement(composition(esk1_0,X1)))),inference(spm,[status(thm)],[18739,102613,theory(equality)])).
% cnf(102862,negated_conjecture,(join(complement(composition(esk1_0,top)),complement(X1))=join(complement(composition(esk1_0,top)),complement(composition(esk1_0,X1)))),inference(rw,[status(thm)],[102790,18739,theory(equality)])).
% cnf(148987,negated_conjecture,(complement(composition(esk1_0,X1))=join(complement(composition(esk1_0,top)),complement(composition(esk1_0,X1)))),inference(spm,[status(thm)],[20,31303,theory(equality)])).
% cnf(303443,negated_conjecture,(join(complement(composition(esk1_0,top)),complement(X1))=complement(composition(esk1_0,X1))),inference(rw,[status(thm)],[148987,102862,theory(equality)])).
% cnf(304106,negated_conjecture,(complement(join(esk3_0,join(complement(esk2_0),complement(composition(esk1_0,top)))))!=complement(join(esk3_0,complement(composition(esk1_0,esk2_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[618,303443,theory(equality)]),20,theory(equality)]),22,theory(equality)]),102613,theory(equality)]),20,theory(equality)]),87,theory(equality)])).
% cnf(304107,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[304106,303443,theory(equality)]),20,theory(equality)])).
% cnf(304108,negated_conjecture,($false),inference(cn,[status(thm)],[304107,theory(equality)])).
% cnf(304109,negated_conjecture,($false),304108,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4675
% # ...of these trivial : 2628
% # ...subsumed : 1102
% # ...remaining for further processing: 945
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 317
% # Generated clauses : 140418
% # ...of the previous two non-trivial : 65557
% # Contextual simplify-reflections : 0
% # Paramodulations : 140418
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 628
% # Positive orientable unit clauses: 623
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 50747
% # ...number of literals in the above : 50747
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 56
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7349
% # Indexed BW rewrite successes : 363
% # Backwards rewriting index: 475 leaves, 3.28+/-6.591 terms/leaf
% # Paramod-from index: 255 leaves, 2.47+/-3.508 terms/leaf
% # Paramod-into index: 455 leaves, 3.28+/-6.622 terms/leaf
% # -------------------------------------------------
% # User time : 4.732 s
% # System time : 0.219 s
% # Total time : 4.951 s
% # Maximum resident set size: 0 pages
% PrfWatch: 10.13 CPU 11.03 WC
% FINAL PrfWatch: 10.13 CPU 11.03 WC
% SZS output end Solution for /tmp/SystemOnTPTP5024/REL030+3.tptp
%
%------------------------------------------------------------------------------