TSTP Solution File: REL025+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL025+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 21:51:18 EST 2010
% Result : Theorem 3.61s
% Output : Solution 3.61s
% 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/SystemOnTPTP31220/REL025+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31220/REL025+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31220/REL025+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 31352
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.93 CPU 2.01 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]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(4, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(5, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(6, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(7, axiom,![X1]:![X2]:![X3]:composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3),file('/tmp/SRASS.s.p', composition_associativity)).
% 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]: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(10, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(11, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(12, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(13, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(14, conjecture,![X1]:((join(X1,one)=one=>join(converse(X1),X1)=X1)&(join(X1,one)=one=>join(X1,converse(X1))=converse(X1))),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:((join(X1,one)=one=>join(converse(X1),X1)=X1)&(join(X1,one)=one=>join(X1,converse(X1))=converse(X1)))),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(17,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:composition(X4,composition(X5,X6))=composition(composition(X4,X5),X6),inference(variable_rename,[status(thm)],[7])).
% cnf(29,plain,(composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[8])).
% cnf(31,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[9])).
% cnf(33,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[10])).
% cnf(35,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[11])).
% cnf(37,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[12])).
% cnf(39,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[13])).
% cnf(41,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[40])).
% fof(42, negated_conjecture,?[X1]:((join(X1,one)=one&~(join(converse(X1),X1)=X1))|(join(X1,one)=one&~(join(X1,converse(X1))=converse(X1)))),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X2]:((join(X2,one)=one&~(join(converse(X2),X2)=X2))|(join(X2,one)=one&~(join(X2,converse(X2))=converse(X2)))),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,((join(esk1_0,one)=one&~(join(converse(esk1_0),esk1_0)=esk1_0))|(join(esk1_0,one)=one&~(join(esk1_0,converse(esk1_0))=converse(esk1_0)))),inference(skolemize,[status(esa)],[43])).
% fof(45, negated_conjecture,(((join(esk1_0,one)=one|join(esk1_0,one)=one)&(~(join(esk1_0,converse(esk1_0))=converse(esk1_0))|join(esk1_0,one)=one))&((join(esk1_0,one)=one|~(join(converse(esk1_0),esk1_0)=esk1_0))&(~(join(esk1_0,converse(esk1_0))=converse(esk1_0))|~(join(converse(esk1_0),esk1_0)=esk1_0)))),inference(distribute,[status(thm)],[44])).
% cnf(46,negated_conjecture,(join(converse(esk1_0),esk1_0)!=esk1_0|join(esk1_0,converse(esk1_0))!=converse(esk1_0)),inference(split_conjunct,[status(thm)],[45])).
% cnf(49,negated_conjecture,(join(esk1_0,one)=one|join(esk1_0,one)=one),inference(split_conjunct,[status(thm)],[45])).
% cnf(50,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[41,37,theory(equality)]),['unfolding']).
% cnf(51,negated_conjecture,(join(esk1_0,converse(esk1_0))!=converse(esk1_0)|join(esk1_0,converse(esk1_0))!=esk1_0),inference(rw,[status(thm)],[46,17,theory(equality)])).
% cnf(54,plain,(join(converse(X1),X2)=converse(join(X1,converse(X2)))),inference(spm,[status(thm)],[23,21,theory(equality)])).
% cnf(55,plain,(join(X1,converse(X2))=converse(join(converse(X1),X2))),inference(spm,[status(thm)],[23,21,theory(equality)])).
% cnf(58,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[27,21,theory(equality)])).
% cnf(60,plain,(complement(top)=zero),inference(rw,[status(thm)],[50,39,theory(equality)])).
% cnf(68,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[19,39,theory(equality)])).
% cnf(69,plain,(join(join(X2,X1),X3)=join(X1,join(X2,X3))),inference(spm,[status(thm)],[19,17,theory(equality)])).
% cnf(73,plain,(join(X2,join(X1,X3))=join(X1,join(X2,X3))),inference(rw,[status(thm)],[69,19,theory(equality)])).
% cnf(100,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[31,17,theory(equality)])).
% cnf(108,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[33,17,theory(equality)])).
% cnf(109,plain,(join(X1,X3)=join(complement(join(complement(X1),X2)),join(complement(join(complement(X1),complement(X2))),X3))),inference(spm,[status(thm)],[19,108,theory(equality)])).
% cnf(114,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X2),complement(X1))))=X1),inference(spm,[status(thm)],[108,17,theory(equality)])).
% cnf(166,plain,(converse(top)=join(X1,converse(complement(converse(X1))))),inference(spm,[status(thm)],[55,39,theory(equality)])).
% cnf(258,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[58,25,theory(equality)])).
% cnf(267,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[258,21,theory(equality)])).
% cnf(271,plain,(one=converse(one)),inference(spm,[status(thm)],[25,267,theory(equality)])).
% cnf(289,plain,(join(converse(X1),one)=converse(join(X1,one))),inference(spm,[status(thm)],[23,271,theory(equality)])).
% cnf(293,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[267,271,theory(equality)])).
% cnf(299,plain,(join(X1,composition(X2,X1))=composition(join(one,X2),X1)),inference(spm,[status(thm)],[35,293,theory(equality)])).
% cnf(300,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[100,293,theory(equality)])).
% cnf(304,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[300,271,theory(equality)]),293,theory(equality)])).
% cnf(311,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[108,304,theory(equality)])).
% cnf(313,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[304,60,theory(equality)])).
% cnf(317,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[311,39,theory(equality)]),60,theory(equality)])).
% cnf(319,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[19,313,theory(equality)])).
% cnf(324,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[317,17,theory(equality)])).
% cnf(350,plain,(converse(join(X1,one))=join(one,converse(X1))),inference(rw,[status(thm)],[289,17,theory(equality)])).
% cnf(361,negated_conjecture,(converse(one)=join(one,converse(esk1_0))),inference(spm,[status(thm)],[350,49,theory(equality)])).
% cnf(372,negated_conjecture,(one=join(one,converse(esk1_0))),inference(rw,[status(thm)],[361,271,theory(equality)])).
% cnf(413,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[319,324,theory(equality)])).
% cnf(420,plain,(complement(zero)=top),inference(spm,[status(thm)],[39,413,theory(equality)])).
% cnf(424,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[17,413,theory(equality)])).
% cnf(431,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[324,413,theory(equality)])).
% cnf(447,plain,(join(complement(join(X1,X2)),complement(join(X1,complement(X2))))=complement(X1)),inference(spm,[status(thm)],[108,431,theory(equality)])).
% cnf(448,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[304,431,theory(equality)])).
% cnf(469,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[19,448,theory(equality)])).
% cnf(632,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[469,108,theory(equality)])).
% cnf(640,plain,(join(X1,top)=top),inference(spm,[status(thm)],[469,39,theory(equality)])).
% cnf(641,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[469,17,theory(equality)])).
% cnf(675,plain,(converse(top)=join(X1,converse(top))),inference(spm,[status(thm)],[55,640,theory(equality)])).
% cnf(677,plain,(top=join(top,X1)),inference(spm,[status(thm)],[17,640,theory(equality)])).
% cnf(720,plain,(converse(top)=top),inference(spm,[status(thm)],[677,675,theory(equality)])).
% cnf(746,plain,(composition(top,converse(X1))=converse(composition(X1,top))),inference(spm,[status(thm)],[27,720,theory(equality)])).
% cnf(748,plain,(converse(composition(top,X1))=composition(converse(X1),top)),inference(spm,[status(thm)],[58,720,theory(equality)])).
% cnf(753,plain,(join(complement(X1),composition(top,complement(composition(top,X1))))=complement(X1)),inference(spm,[status(thm)],[100,720,theory(equality)])).
% cnf(832,plain,(composition(top,top)=converse(composition(top,top))),inference(spm,[status(thm)],[746,720,theory(equality)])).
% cnf(840,plain,(composition(top,join(converse(X1),X2))=converse(composition(join(X1,converse(X2)),top))),inference(spm,[status(thm)],[746,54,theory(equality)])).
% cnf(851,plain,(join(complement(top),composition(converse(converse(X1)),complement(converse(composition(top,X1)))))=complement(top)),inference(spm,[status(thm)],[100,748,theory(equality)])).
% cnf(864,plain,(composition(X1,complement(converse(composition(top,X1))))=complement(top)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[851,60,theory(equality)]),21,theory(equality)]),413,theory(equality)])).
% cnf(865,plain,(composition(X1,complement(converse(composition(top,X1))))=zero),inference(rw,[status(thm)],[864,60,theory(equality)])).
% cnf(1087,plain,(join(X1,converse(complement(converse(X1))))=top),inference(rw,[status(thm)],[166,720,theory(equality)])).
% cnf(1136,plain,(join(X1,join(complement(X1),X2))=top),inference(rw,[status(thm)],[68,677,theory(equality)])).
% cnf(1159,plain,(join(X1,join(X2,complement(X1)))=top),inference(spm,[status(thm)],[1136,641,theory(equality)])).
% cnf(1294,plain,(join(top,X3)=join(X1,join(join(X2,complement(X1)),X3))),inference(spm,[status(thm)],[19,1159,theory(equality)])).
% cnf(1319,plain,(top=join(X1,join(join(X2,complement(X1)),X3))),inference(rw,[status(thm)],[1294,677,theory(equality)])).
% cnf(1320,plain,(top=join(X1,join(X2,join(complement(X1),X3)))),inference(rw,[status(thm)],[1319,19,theory(equality)])).
% cnf(1697,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[632,17,theory(equality)])).
% cnf(1728,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1697,641,theory(equality)])).
% cnf(1780,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1728,431,theory(equality)])).
% cnf(2365,plain,(composition(top,complement(composition(top,top)))=zero),inference(spm,[status(thm)],[865,832,theory(equality)])).
% cnf(2402,plain,(join(zero,composition(X1,complement(composition(top,top))))=composition(join(top,X1),complement(composition(top,top)))),inference(spm,[status(thm)],[35,2365,theory(equality)])).
% cnf(2406,plain,(composition(X1,complement(composition(top,top)))=composition(join(top,X1),complement(composition(top,top)))),inference(rw,[status(thm)],[2402,413,theory(equality)])).
% cnf(2407,plain,(composition(X1,complement(composition(top,top)))=zero),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2406,677,theory(equality)]),2365,theory(equality)])).
% cnf(2415,plain,(zero=complement(composition(top,top))),inference(spm,[status(thm)],[293,2407,theory(equality)])).
% cnf(2494,plain,(join(composition(top,top),zero)=top),inference(spm,[status(thm)],[39,2415,theory(equality)])).
% cnf(2507,plain,(composition(top,top)=top),inference(rw,[status(thm)],[2494,424,theory(equality)])).
% cnf(2519,plain,(composition(top,X1)=composition(top,composition(top,X1))),inference(spm,[status(thm)],[29,2507,theory(equality)])).
% cnf(16395,plain,(converse(join(top,composition(converse(X1),top)))=composition(top,join(converse(one),X1))),inference(spm,[status(thm)],[840,299,theory(equality)])).
% cnf(16454,plain,(join(X1,composition(top,X1))=composition(top,X1)),inference(spm,[status(thm)],[299,640,theory(equality)])).
% cnf(16491,negated_conjecture,(join(X1,composition(converse(esk1_0),X1))=composition(one,X1)),inference(spm,[status(thm)],[299,372,theory(equality)])).
% cnf(16564,plain,(top=composition(top,join(converse(one),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[16395,748,theory(equality)]),677,theory(equality)]),720,theory(equality)])).
% cnf(16565,plain,(top=composition(top,join(one,X1))),inference(rw,[status(thm)],[16564,271,theory(equality)])).
% cnf(16593,negated_conjecture,(join(X1,composition(converse(esk1_0),X1))=X1),inference(rw,[status(thm)],[16491,293,theory(equality)])).
% cnf(16618,plain,(composition(top,X2)=composition(top,composition(join(one,X1),X2))),inference(spm,[status(thm)],[29,16565,theory(equality)])).
% cnf(17086,plain,(join(X1,join(X2,composition(top,complement(X1))))=top),inference(spm,[status(thm)],[1320,16454,theory(equality)])).
% cnf(17226,negated_conjecture,(converse(converse(X1))=join(X1,converse(composition(converse(esk1_0),converse(X1))))),inference(spm,[status(thm)],[55,16593,theory(equality)])).
% cnf(17308,negated_conjecture,(X1=join(X1,converse(composition(converse(esk1_0),converse(X1))))),inference(rw,[status(thm)],[17226,21,theory(equality)])).
% cnf(17309,negated_conjecture,(X1=join(X1,composition(X1,esk1_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[17308,27,theory(equality)]),21,theory(equality)])).
% cnf(17393,negated_conjecture,(join(complement(composition(X1,esk1_0)),complement(X1))=complement(composition(X1,esk1_0))),inference(spm,[status(thm)],[1780,17309,theory(equality)])).
% cnf(17396,negated_conjecture,(join(X1,X2)=join(X2,join(X1,composition(X2,esk1_0)))),inference(spm,[status(thm)],[73,17309,theory(equality)])).
% cnf(22346,negated_conjecture,(join(X1,composition(join(X2,X1),esk1_0))=join(composition(X2,esk1_0),X1)),inference(spm,[status(thm)],[17396,35,theory(equality)])).
% cnf(25646,plain,(top=join(X1,composition(top,complement(complement(join(complement(X1),X2)))))),inference(spm,[status(thm)],[109,17086,theory(equality)])).
% cnf(25769,plain,(top=join(X1,composition(top,join(complement(X1),X2)))),inference(rw,[status(thm)],[25646,431,theory(equality)])).
% cnf(37520,plain,(join(complement(X1),composition(top,join(X1,X2)))=top),inference(spm,[status(thm)],[25769,431,theory(equality)])).
% cnf(45466,negated_conjecture,(join(complement(X1),composition(top,join(X2,X1)))=top),inference(spm,[status(thm)],[37520,17396,theory(equality)])).
% cnf(50803,negated_conjecture,(join(complement(composition(X1,X2)),composition(top,composition(join(one,X1),X2)))=top),inference(spm,[status(thm)],[45466,299,theory(equality)])).
% cnf(51102,negated_conjecture,(join(complement(composition(X1,X2)),composition(top,X2))=top),inference(rw,[status(thm)],[50803,16618,theory(equality)])).
% cnf(51654,negated_conjecture,(join(composition(top,X2),complement(composition(X1,X2)))=top),inference(rw,[status(thm)],[51102,17,theory(equality)])).
% cnf(64478,plain,(join(complement(complement(X1)),complement(join(complement(complement(join(X1,complement(X2)))),complement(join(X1,X2)))))=join(X1,X2)),inference(spm,[status(thm)],[114,447,theory(equality)])).
% cnf(64910,plain,(join(X1,complement(join(X1,complement(X2))))=join(X1,X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[64478,431,theory(equality)]),431,theory(equality)]),19,theory(equality)]),1780,theory(equality)])).
% cnf(65990,plain,(join(X1,complement(join(X1,X2)))=join(X1,join(X1,complement(X2)))),inference(spm,[status(thm)],[64910,64910,theory(equality)])).
% cnf(66167,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[65990,469,theory(equality)])).
% cnf(66644,plain,(join(X1,complement(top))=join(X1,complement(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[66167,1087,theory(equality)])).
% cnf(67080,plain,(X1=join(X1,complement(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[66644,60,theory(equality)]),424,theory(equality)])).
% cnf(69238,plain,(converse(converse(X1))=join(X1,converse(complement(converse(complement(converse(converse(X1)))))))),inference(spm,[status(thm)],[55,67080,theory(equality)])).
% cnf(69395,plain,(X1=join(X1,converse(complement(converse(complement(converse(converse(X1)))))))),inference(rw,[status(thm)],[69238,21,theory(equality)])).
% cnf(69396,plain,(X1=join(X1,converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[69395,21,theory(equality)])).
% cnf(69571,plain,(join(complement(X1),converse(complement(converse(X1))))=complement(X1)),inference(spm,[status(thm)],[69396,431,theory(equality)])).
% cnf(70409,plain,(join(complement(converse(complement(converse(X1)))),complement(complement(X1)))=complement(converse(complement(converse(X1))))),inference(spm,[status(thm)],[1780,69571,theory(equality)])).
% cnf(70500,plain,(X1=complement(converse(complement(converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[70409,431,theory(equality)]),17,theory(equality)]),67080,theory(equality)])).
% cnf(70548,plain,(complement(X1)=converse(complement(converse(X1)))),inference(spm,[status(thm)],[431,70500,theory(equality)])).
% cnf(70702,plain,(converse(complement(X1))=complement(converse(X1))),inference(spm,[status(thm)],[21,70548,theory(equality)])).
% cnf(70934,plain,(complement(join(converse(X1),X2))=converse(complement(join(X1,converse(X2))))),inference(spm,[status(thm)],[70702,54,theory(equality)])).
% cnf(73694,plain,(join(complement(composition(top,X1)),composition(top,complement(composition(top,X1))))=complement(composition(top,X1))),inference(spm,[status(thm)],[753,2519,theory(equality)])).
% cnf(73764,plain,(composition(top,complement(composition(top,X1)))=complement(composition(top,X1))),inference(rw,[status(thm)],[73694,16454,theory(equality)])).
% cnf(74215,negated_conjecture,(join(complement(X1),composition(top,esk1_0))=join(composition(X1,esk1_0),complement(X1))),inference(spm,[status(thm)],[22346,39,theory(equality)])).
% cnf(90641,negated_conjecture,(join(complement(X1),complement(composition(X1,esk1_0)))=complement(composition(X1,esk1_0))),inference(rw,[status(thm)],[17393,17,theory(equality)])).
% cnf(105843,negated_conjecture,(join(complement(X1),composition(X1,esk1_0))=join(complement(X1),composition(top,esk1_0))),inference(rw,[status(thm)],[74215,17,theory(equality)])).
% cnf(105855,negated_conjecture,(join(complement(X1),complement(join(complement(X1),composition(X1,esk1_0))))=join(complement(X1),complement(composition(top,esk1_0)))),inference(spm,[status(thm)],[66167,105843,theory(equality)])).
% cnf(105984,negated_conjecture,(complement(composition(X1,esk1_0))=join(complement(X1),complement(composition(top,esk1_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[105855,66167,theory(equality)]),90641,theory(equality)])).
% cnf(113013,negated_conjecture,(join(X1,complement(composition(top,esk1_0)))=complement(composition(complement(X1),esk1_0))),inference(spm,[status(thm)],[105984,431,theory(equality)])).
% cnf(113091,negated_conjecture,(complement(join(X1,complement(composition(top,esk1_0))))=composition(complement(X1),esk1_0)),inference(spm,[status(thm)],[431,113013,theory(equality)])).
% cnf(114886,negated_conjecture,(complement(top)=composition(complement(composition(top,esk1_0)),esk1_0)),inference(spm,[status(thm)],[113091,51654,theory(equality)])).
% cnf(115002,negated_conjecture,(zero=composition(complement(composition(top,esk1_0)),esk1_0)),inference(rw,[status(thm)],[114886,60,theory(equality)])).
% cnf(115109,negated_conjecture,(join(complement(esk1_0),composition(converse(complement(composition(top,esk1_0))),complement(zero)))=complement(esk1_0)),inference(spm,[status(thm)],[100,115002,theory(equality)])).
% cnf(115150,negated_conjecture,(join(complement(esk1_0),converse(complement(composition(top,esk1_0))))=complement(esk1_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[115109,420,theory(equality)]),748,theory(equality)]),73764,theory(equality)])).
% cnf(118240,negated_conjecture,(converse(complement(complement(esk1_0)))=complement(join(converse(complement(esk1_0)),complement(composition(top,esk1_0))))),inference(spm,[status(thm)],[70934,115150,theory(equality)])).
% cnf(118296,negated_conjecture,(converse(esk1_0)=complement(join(converse(complement(esk1_0)),complement(composition(top,esk1_0))))),inference(rw,[status(thm)],[118240,431,theory(equality)])).
% cnf(118297,negated_conjecture,(converse(esk1_0)=composition(converse(esk1_0),esk1_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[118296,113091,theory(equality)]),70702,theory(equality)]),431,theory(equality)])).
% cnf(118358,negated_conjecture,(converse(converse(esk1_0))=composition(converse(esk1_0),esk1_0)),inference(spm,[status(thm)],[58,118297,theory(equality)])).
% cnf(118413,negated_conjecture,(esk1_0=composition(converse(esk1_0),esk1_0)),inference(rw,[status(thm)],[118358,21,theory(equality)])).
% cnf(118414,negated_conjecture,(esk1_0=converse(esk1_0)),inference(rw,[status(thm)],[118413,118297,theory(equality)])).
% cnf(118539,negated_conjecture,(esk1_0!=converse(esk1_0)|join(esk1_0,converse(esk1_0))!=esk1_0),inference(rw,[status(thm)],[inference(rw,[status(thm)],[51,118414,theory(equality)]),448,theory(equality)])).
% cnf(118540,negated_conjecture,($false|join(esk1_0,converse(esk1_0))!=esk1_0),inference(rw,[status(thm)],[118539,118414,theory(equality)])).
% cnf(118541,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[118540,118414,theory(equality)]),448,theory(equality)])).
% cnf(118542,negated_conjecture,($false),inference(cn,[status(thm)],[118541,theory(equality)])).
% cnf(118543,negated_conjecture,($false),118542,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2742
% # ...of these trivial : 1771
% # ...subsumed : 293
% # ...remaining for further processing: 678
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 262
% # Generated clauses : 59661
% # ...of the previous two non-trivial : 27054
% # Contextual simplify-reflections : 0
% # Paramodulations : 59661
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 416
% # Positive orientable unit clauses: 409
% # Positive unorientable unit clauses: 7
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 15411
% # ...number of literals in the above : 15411
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 53
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2955
% # Indexed BW rewrite successes : 263
% # Backwards rewriting index: 450 leaves, 1.82+/-1.787 terms/leaf
% # Paramod-from index: 250 leaves, 1.68+/-1.667 terms/leaf
% # Paramod-into index: 412 leaves, 1.79+/-1.747 terms/leaf
% # -------------------------------------------------
% # User time : 1.163 s
% # System time : 0.064 s
% # Total time : 1.227 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.57 CPU 2.67 WC
% FINAL PrfWatch: 2.57 CPU 2.67 WC
% SZS output end Solution for /tmp/SystemOnTPTP31220/REL025+2.tptp
%
%------------------------------------------------------------------------------