%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL027+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 : art01.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:47:58 EST 2010
% Result : Theorem 1.67s
% Output : Solution 1.67s
% 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/SystemOnTPTP26824/REL027+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26824/REL027+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26824/REL027+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 26920
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.01 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # 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]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% 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]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% 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]:(join(X1,one)=one=>meet(complement(composition(X1,top)),one)=meet(complement(X1),one)),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:(join(X1,one)=one=>meet(complement(composition(X1,top)),one)=meet(complement(X1),one))),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,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[8])).
% cnf(34,plain,(top=join(X1,complement(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,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[13])).
% cnf(44,plain,(zero=meet(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]:(join(X1,one)=one&~(meet(complement(composition(X1,top)),one)=meet(complement(X1),one))),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,?[X2]:(join(X2,one)=one&~(meet(complement(composition(X2,top)),one)=meet(complement(X2),one))),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,(join(esk1_0,one)=one&~(meet(complement(composition(esk1_0,top)),one)=meet(complement(esk1_0),one))),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(meet(complement(composition(esk1_0,top)),one)!=meet(complement(esk1_0),one)),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)],[44,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)],[38,26,theory(equality)]),26,theory(equality)]),26,theory(equality)]),26,theory(equality)]),26,theory(equality)]),['unfolding']).
% cnf(60,negated_conjecture,(complement(join(complement(complement(composition(esk1_0,top))),complement(one)))!=complement(join(complement(complement(esk1_0)),complement(one)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[54,26,theory(equality)]),26,theory(equality)]),['unfolding']).
% cnf(61,negated_conjecture,(complement(join(complement(one),complement(complement(composition(esk1_0,top)))))!=complement(join(complement(complement(esk1_0)),complement(one)))),inference(rw,[status(thm)],[60,20,theory(equality)])).
% cnf(62,negated_conjecture,(complement(join(complement(one),complement(complement(composition(esk1_0,top)))))!=complement(join(complement(one),complement(complement(esk1_0))))),inference(rw,[status(thm)],[61,20,theory(equality)])).
% cnf(64,negated_conjecture,(converse(one)=join(converse(esk1_0),converse(one))),inference(spm,[status(thm)],[48,55,theory(equality)])).
% cnf(65,plain,(converse(top)=join(converse(X1),converse(complement(X1)))),inference(spm,[status(thm)],[48,34,theory(equality)])).
% cnf(72,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[50,30,theory(equality)])).
% cnf(74,plain,(complement(top)=zero),inference(rw,[status(thm)],[56,34,theory(equality)])).
% cnf(82,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[22,34,theory(equality)])).
% cnf(83,plain,(join(join(X2,X1),X3)=join(X1,join(X2,X3))),inference(spm,[status(thm)],[22,20,theory(equality)])).
% cnf(89,plain,(join(X2,join(X1,X3))=join(X1,join(X2,X3))),inference(rw,[status(thm)],[83,22,theory(equality)])).
% cnf(103,negated_conjecture,(composition(one,X1)=join(composition(esk1_0,X1),composition(one,X1))),inference(spm,[status(thm)],[32,55,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(297,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[72,46,theory(equality)])).
% cnf(321,plain,(one=converse(one)),inference(spm,[status(thm)],[30,297,theory(equality)])).
% cnf(350,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[297,321,theory(equality)])).
% cnf(351,negated_conjecture,(join(one,converse(esk1_0))=converse(one)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[64,321,theory(equality)]),20,theory(equality)])).
% cnf(352,negated_conjecture,(join(one,converse(esk1_0))=one),inference(rw,[status(thm)],[351,321,theory(equality)])).
% cnf(366,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[117,350,theory(equality)])).
% cnf(378,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[366,321,theory(equality)]),350,theory(equality)])).
% cnf(380,negated_conjecture,(join(one,X1)=join(one,join(converse(esk1_0),X1))),inference(spm,[status(thm)],[22,352,theory(equality)])).
% cnf(381,negated_conjecture,(composition(one,X1)=join(composition(one,X1),composition(converse(esk1_0),X1))),inference(spm,[status(thm)],[32,352,theory(equality)])).
% cnf(384,negated_conjecture,(X1=join(composition(one,X1),composition(converse(esk1_0),X1))),inference(rw,[status(thm)],[381,350,theory(equality)])).
% cnf(385,negated_conjecture,(X1=join(X1,composition(converse(esk1_0),X1))),inference(rw,[status(thm)],[384,350,theory(equality)])).
% cnf(392,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[134,378,theory(equality)])).
% cnf(401,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[378,74,theory(equality)])).
% cnf(405,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[392,34,theory(equality)]),74,theory(equality)])).
% cnf(417,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[22,401,theory(equality)])).
% cnf(423,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[405,20,theory(equality)])).
% cnf(464,negated_conjecture,(converse(X1)=join(converse(X1),converse(composition(converse(esk1_0),X1)))),inference(spm,[status(thm)],[48,385,theory(equality)])).
% cnf(469,negated_conjecture,(converse(X1)=join(converse(X1),composition(converse(X1),esk1_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[464,50,theory(equality)]),46,theory(equality)])).
% cnf(489,plain,(join(X1,complement(X1))=join(top,complement(X1))),inference(spm,[status(thm)],[82,378,theory(equality)])).
% cnf(502,plain,(top=join(top,complement(X1))),inference(rw,[status(thm)],[489,34,theory(equality)])).
% cnf(540,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[417,423,theory(equality)])).
% cnf(567,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[423,540,theory(equality)])).
% cnf(606,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[378,567,theory(equality)])).
% cnf(607,plain,(join(top,X1)=top),inference(spm,[status(thm)],[502,567,theory(equality)])).
% cnf(616,negated_conjecture,(complement(join(complement(one),composition(esk1_0,top)))!=complement(join(complement(one),complement(complement(esk1_0))))),inference(rw,[status(thm)],[62,567,theory(equality)])).
% cnf(617,negated_conjecture,(complement(join(complement(one),composition(esk1_0,top)))!=complement(join(esk1_0,complement(one)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[616,567,theory(equality)]),20,theory(equality)])).
% cnf(635,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[22,606,theory(equality)])).
% cnf(703,plain,(top=join(X1,top)),inference(spm,[status(thm)],[20,607,theory(equality)])).
% cnf(708,plain,(join(X1,join(complement(X1),X2))=top),inference(rw,[status(thm)],[82,607,theory(equality)])).
% cnf(721,plain,(join(one,converse(complement(one)))=converse(top)),inference(spm,[status(thm)],[65,321,theory(equality)])).
% cnf(838,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[635,134,theory(equality)])).
% cnf(846,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[635,20,theory(equality)])).
% cnf(945,plain,(join(complement(X1),join(X1,X2))=top),inference(spm,[status(thm)],[708,567,theory(equality)])).
% cnf(1120,plain,(join(complement(one),converse(top))=top),inference(spm,[status(thm)],[945,721,theory(equality)])).
% cnf(1150,plain,(converse(top)=join(converse(complement(one)),converse(converse(top)))),inference(spm,[status(thm)],[48,1120,theory(equality)])).
% cnf(1158,plain,(converse(top)=top),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1150,46,theory(equality)]),703,theory(equality)])).
% cnf(1176,plain,(join(one,converse(complement(one)))=top),inference(rw,[status(thm)],[721,1158,theory(equality)])).
% cnf(1187,plain,(composition(top,X1)=join(composition(one,X1),composition(converse(complement(one)),X1))),inference(spm,[status(thm)],[32,1176,theory(equality)])).
% cnf(1195,plain,(composition(top,X1)=join(X1,composition(converse(complement(one)),X1))),inference(rw,[status(thm)],[1187,350,theory(equality)])).
% cnf(1658,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[838,20,theory(equality)])).
% cnf(1690,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1658,846,theory(equality)])).
% cnf(1767,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1690,567,theory(equality)])).
% cnf(1821,negated_conjecture,(converse(join(one,X1))=join(converse(one),converse(join(converse(esk1_0),X1)))),inference(spm,[status(thm)],[48,380,theory(equality)])).
% cnf(1844,negated_conjecture,(join(one,converse(X1))=join(converse(one),converse(join(converse(esk1_0),X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1821,48,theory(equality)]),321,theory(equality)])).
% cnf(1845,negated_conjecture,(join(one,converse(X1))=join(one,join(esk1_0,converse(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1844,321,theory(equality)]),48,theory(equality)]),46,theory(equality)])).
% cnf(1952,negated_conjecture,(join(one,join(esk1_0,X1))=join(one,X1)),inference(spm,[status(thm)],[1845,46,theory(equality)])).
% cnf(2125,negated_conjecture,(join(one,esk1_0)=join(one,composition(converse(esk1_0),esk1_0))),inference(spm,[status(thm)],[1952,385,theory(equality)])).
% cnf(2156,negated_conjecture,(one=join(one,composition(converse(esk1_0),esk1_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2125,20,theory(equality)]),55,theory(equality)])).
% cnf(3568,negated_conjecture,(join(complement(composition(converse(esk1_0),esk1_0)),complement(one))=complement(composition(converse(esk1_0),esk1_0))),inference(spm,[status(thm)],[1767,2156,theory(equality)])).
% cnf(5892,negated_conjecture,(join(X1,composition(esk1_0,X1))=composition(one,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[103,350,theory(equality)]),20,theory(equality)])).
% cnf(5893,negated_conjecture,(join(X1,composition(esk1_0,X1))=X1),inference(rw,[status(thm)],[5892,350,theory(equality)])).
% cnf(5895,negated_conjecture,(join(one,converse(esk1_0))=join(one,composition(esk1_0,converse(esk1_0)))),inference(spm,[status(thm)],[380,5893,theory(equality)])).
% cnf(5907,negated_conjecture,(join(X1,X2)=join(X1,join(composition(esk1_0,X1),X2))),inference(spm,[status(thm)],[22,5893,theory(equality)])).
% cnf(5924,negated_conjecture,(one=join(one,composition(esk1_0,converse(esk1_0)))),inference(rw,[status(thm)],[5895,352,theory(equality)])).
% cnf(5946,negated_conjecture,(composition(one,X1)=join(composition(one,X1),composition(composition(esk1_0,converse(esk1_0)),X1))),inference(spm,[status(thm)],[32,5924,theory(equality)])).
% cnf(5961,negated_conjecture,(X1=join(composition(one,X1),composition(composition(esk1_0,converse(esk1_0)),X1))),inference(rw,[status(thm)],[5946,350,theory(equality)])).
% cnf(5962,negated_conjecture,(X1=join(X1,composition(esk1_0,composition(converse(esk1_0),X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5961,350,theory(equality)]),28,theory(equality)])).
% cnf(7375,negated_conjecture,(join(X1,composition(X1,esk1_0))=X1),inference(spm,[status(thm)],[469,46,theory(equality)])).
% cnf(7432,negated_conjecture,(join(X1,X2)=join(X2,join(X1,composition(X2,esk1_0)))),inference(spm,[status(thm)],[89,7375,theory(equality)])).
% cnf(8644,negated_conjecture,(join(X1,composition(esk1_0,X1))=join(X1,composition(composition(esk1_0,X1),esk1_0))),inference(spm,[status(thm)],[5907,7375,theory(equality)])).
% cnf(8725,negated_conjecture,(X1=join(X1,composition(composition(esk1_0,X1),esk1_0))),inference(rw,[status(thm)],[8644,5893,theory(equality)])).
% cnf(8726,negated_conjecture,(X1=join(X1,composition(esk1_0,composition(X1,esk1_0)))),inference(rw,[status(thm)],[8725,28,theory(equality)])).
% cnf(10154,negated_conjecture,(join(complement(one),complement(composition(converse(esk1_0),esk1_0)))=complement(composition(converse(esk1_0),esk1_0))),inference(rw,[status(thm)],[3568,20,theory(equality)])).
% cnf(10178,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,10154,theory(equality)])).
% cnf(10197,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)],[10178,30,theory(equality)]),606,theory(equality)]),567,theory(equality)]),321,theory(equality)]),30,theory(equality)]),606,theory(equality)]),567,theory(equality)]),567,theory(equality)])).
% cnf(10198,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)],[10197,321,theory(equality)]),30,theory(equality)]),606,theory(equality)]),567,theory(equality)]),567,theory(equality)])).
% cnf(11033,negated_conjecture,(join(converse(complement(one)),composition(top,esk1_0))=join(esk1_0,converse(complement(one)))),inference(spm,[status(thm)],[7432,1195,theory(equality)])).
% cnf(12691,negated_conjecture,(join(composition(top,esk1_0),converse(complement(one)))=join(esk1_0,converse(complement(one)))),inference(rw,[status(thm)],[11033,20,theory(equality)])).
% cnf(12692,negated_conjecture,(converse(join(esk1_0,converse(complement(one))))=join(converse(composition(top,esk1_0)),converse(converse(complement(one))))),inference(spm,[status(thm)],[48,12691,theory(equality)])).
% cnf(12709,negated_conjecture,(join(converse(esk1_0),complement(one))=join(converse(composition(top,esk1_0)),converse(converse(complement(one))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[12692,48,theory(equality)]),46,theory(equality)])).
% cnf(12710,negated_conjecture,(join(converse(esk1_0),complement(one))=join(composition(converse(esk1_0),top),complement(one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[12709,50,theory(equality)]),1158,theory(equality)]),46,theory(equality)])).
% cnf(14053,negated_conjecture,(join(complement(one),composition(converse(esk1_0),top))=join(converse(esk1_0),complement(one))),inference(rw,[status(thm)],[12710,20,theory(equality)])).
% cnf(14054,negated_conjecture,(join(complement(one),composition(converse(esk1_0),top))=join(complement(one),converse(esk1_0))),inference(rw,[status(thm)],[14053,20,theory(equality)])).
% cnf(26671,negated_conjecture,(esk1_0=composition(esk1_0,composition(converse(esk1_0),esk1_0))),inference(rw,[status(thm)],[10198,5962,theory(equality)])).
% cnf(26697,negated_conjecture,(join(converse(esk1_0),esk1_0)=converse(esk1_0)),inference(spm,[status(thm)],[8726,26671,theory(equality)])).
% cnf(26714,negated_conjecture,(join(esk1_0,converse(esk1_0))=converse(esk1_0)),inference(rw,[status(thm)],[26697,20,theory(equality)])).
% cnf(26717,negated_conjecture,(converse(converse(esk1_0))=join(converse(esk1_0),converse(converse(esk1_0)))),inference(spm,[status(thm)],[48,26714,theory(equality)])).
% cnf(26736,negated_conjecture,(esk1_0=join(converse(esk1_0),converse(converse(esk1_0)))),inference(rw,[status(thm)],[26717,46,theory(equality)])).
% cnf(26737,negated_conjecture,(esk1_0=converse(esk1_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[26736,46,theory(equality)]),20,theory(equality)]),26714,theory(equality)])).
% cnf(26780,negated_conjecture,(join(complement(one),composition(esk1_0,top))=join(complement(one),converse(esk1_0))),inference(rw,[status(thm)],[14054,26737,theory(equality)])).
% cnf(26781,negated_conjecture,(join(complement(one),composition(esk1_0,top))=join(esk1_0,complement(one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[26780,26737,theory(equality)]),20,theory(equality)])).
% cnf(27722,negated_conjecture,($false),inference(rw,[status(thm)],[617,26781,theory(equality)])).
% cnf(27723,negated_conjecture,($false),inference(cn,[status(thm)],[27722,theory(equality)])).
% cnf(27724,negated_conjecture,($false),27723,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 931
% # ...of these trivial : 408
% # ...subsumed : 165
% # ...remaining for further processing: 358
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 203
% # Generated clauses : 13917
% # ...of the previous two non-trivial : 6414
% # Contextual simplify-reflections : 0
% # Paramodulations : 13917
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 155
% # Positive orientable unit clauses: 151
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 2672
% # ...number of literals in the above : 2672
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 18
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 971
% # Indexed BW rewrite successes : 269
% # Backwards rewriting index: 208 leaves, 1.59+/-1.189 terms/leaf
% # Paramod-from index: 109 leaves, 1.44+/-0.962 terms/leaf
% # Paramod-into index: 198 leaves, 1.57+/-1.160 terms/leaf
% # -------------------------------------------------
% # User time : 0.296 s
% # System time : 0.016 s
% # Total time : 0.312 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.73 CPU 0.89 WC
% FINAL PrfWatch: 0.73 CPU 0.89 WC
% SZS output end Solution for /tmp/SystemOnTPTP26824/REL027+3.tptp
%
%------------------------------------------------------------------------------