TSTP Solution File: REL027+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL027+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 : art02.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:48 EST 2010
% Result : Theorem 1.93s
% Output : Solution 1.93s
% 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/SystemOnTPTP4256/REL027+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4256/REL027+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4256/REL027+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 4352
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 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(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]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(11, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(12, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(13, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(14, conjecture,![X1]:(join(X1,one)=one=>(join(meet(complement(composition(X1,top)),one),meet(complement(X1),one))=meet(complement(X1),one)&join(meet(complement(X1),one),meet(complement(composition(X1,top)),one))=meet(complement(composition(X1,top)),one))),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:(join(X1,one)=one=>(join(meet(complement(composition(X1,top)),one),meet(complement(X1),one))=meet(complement(X1),one)&join(meet(complement(X1),one),meet(complement(composition(X1,top)),one))=meet(complement(composition(X1,top)),one)))),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,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[22])).
% fof(26, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(29,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[8])).
% cnf(31,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[9])).
% cnf(33,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[10])).
% cnf(35,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[11])).
% cnf(37,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[12])).
% cnf(39,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[13])).
% cnf(41,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[40])).
% fof(42, negated_conjecture,?[X1]:(join(X1,one)=one&(~(join(meet(complement(composition(X1,top)),one),meet(complement(X1),one))=meet(complement(X1),one))|~(join(meet(complement(X1),one),meet(complement(composition(X1,top)),one))=meet(complement(composition(X1,top)),one)))),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X2]:(join(X2,one)=one&(~(join(meet(complement(composition(X2,top)),one),meet(complement(X2),one))=meet(complement(X2),one))|~(join(meet(complement(X2),one),meet(complement(composition(X2,top)),one))=meet(complement(composition(X2,top)),one)))),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,(join(esk1_0,one)=one&(~(join(meet(complement(composition(esk1_0,top)),one),meet(complement(esk1_0),one))=meet(complement(esk1_0),one))|~(join(meet(complement(esk1_0),one),meet(complement(composition(esk1_0,top)),one))=meet(complement(composition(esk1_0,top)),one)))),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(join(meet(complement(esk1_0),one),meet(complement(composition(esk1_0,top)),one))!=meet(complement(composition(esk1_0,top)),one)|join(meet(complement(composition(esk1_0,top)),one),meet(complement(esk1_0),one))!=meet(complement(esk1_0),one)),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,negated_conjecture,(join(esk1_0,one)=one),inference(split_conjunct,[status(thm)],[44])).
% cnf(47,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[35,23,theory(equality)]),['unfolding']).
% cnf(48,negated_conjecture,(join(complement(join(complement(complement(composition(esk1_0,top))),complement(one))),complement(join(complement(complement(esk1_0)),complement(one))))!=complement(join(complement(complement(esk1_0)),complement(one)))|join(complement(join(complement(complement(esk1_0)),complement(one))),complement(join(complement(complement(composition(esk1_0,top))),complement(one))))!=complement(join(complement(complement(composition(esk1_0,top))),complement(one)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[45,23,theory(equality)]),23,theory(equality)]),23,theory(equality)]),23,theory(equality)]),23,theory(equality)]),23,theory(equality)]),['unfolding']).
% cnf(49,negated_conjecture,(join(complement(join(complement(one),complement(complement(esk1_0)))),complement(join(complement(one),complement(complement(composition(esk1_0,top))))))!=complement(join(complement(complement(composition(esk1_0,top))),complement(one)))|join(complement(join(complement(complement(composition(esk1_0,top))),complement(one))),complement(join(complement(complement(esk1_0)),complement(one))))!=complement(join(complement(complement(esk1_0)),complement(one)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[48,17,theory(equality)]),17,theory(equality)])).
% cnf(50,negated_conjecture,(join(complement(join(complement(one),complement(complement(esk1_0)))),complement(join(complement(one),complement(complement(composition(esk1_0,top))))))!=complement(join(complement(one),complement(complement(composition(esk1_0,top)))))|join(complement(join(complement(complement(composition(esk1_0,top))),complement(one))),complement(join(complement(complement(esk1_0)),complement(one))))!=complement(join(complement(complement(esk1_0)),complement(one)))),inference(rw,[status(thm)],[49,17,theory(equality)])).
% cnf(51,negated_conjecture,(join(complement(join(complement(one),complement(complement(esk1_0)))),complement(join(complement(one),complement(complement(composition(esk1_0,top))))))!=complement(join(complement(one),complement(complement(composition(esk1_0,top)))))|join(complement(join(complement(one),complement(complement(esk1_0)))),complement(join(complement(one),complement(complement(composition(esk1_0,top))))))!=complement(join(complement(complement(esk1_0)),complement(one)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[50,17,theory(equality)]),17,theory(equality)]),17,theory(equality)])).
% cnf(52,negated_conjecture,(join(complement(join(complement(one),complement(complement(esk1_0)))),complement(join(complement(one),complement(complement(composition(esk1_0,top))))))!=complement(join(complement(one),complement(complement(composition(esk1_0,top)))))|join(complement(join(complement(one),complement(complement(esk1_0)))),complement(join(complement(one),complement(complement(composition(esk1_0,top))))))!=complement(join(complement(one),complement(complement(esk1_0))))),inference(rw,[status(thm)],[51,17,theory(equality)])).
% cnf(54,negated_conjecture,(converse(one)=join(converse(esk1_0),converse(one))),inference(spm,[status(thm)],[39,46,theory(equality)])).
% cnf(55,plain,(converse(top)=join(converse(X1),converse(complement(X1)))),inference(spm,[status(thm)],[39,31,theory(equality)])).
% cnf(62,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[41,27,theory(equality)])).
% cnf(64,plain,(complement(top)=zero),inference(rw,[status(thm)],[47,31,theory(equality)])).
% cnf(71,negated_conjecture,(join(one,X1)=join(esk1_0,join(one,X1))),inference(spm,[status(thm)],[19,46,theory(equality)])).
% cnf(72,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[19,31,theory(equality)])).
% cnf(73,plain,(join(join(X2,X1),X3)=join(X1,join(X2,X3))),inference(spm,[status(thm)],[19,17,theory(equality)])).
% cnf(79,plain,(join(X2,join(X1,X3))=join(X1,join(X2,X3))),inference(rw,[status(thm)],[73,19,theory(equality)])).
% cnf(93,negated_conjecture,(composition(one,X1)=join(composition(esk1_0,X1),composition(one,X1))),inference(spm,[status(thm)],[29,46,theory(equality)])).
% cnf(95,plain,(composition(top,X2)=join(composition(X1,X2),composition(complement(X1),X2))),inference(spm,[status(thm)],[29,31,theory(equality)])).
% cnf(107,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[33,17,theory(equality)])).
% cnf(108,plain,(converse(complement(X1))=join(converse(complement(X1)),converse(composition(converse(X2),complement(composition(X2,X1)))))),inference(spm,[status(thm)],[39,107,theory(equality)])).
% cnf(118,plain,(converse(complement(X1))=join(converse(complement(X1)),composition(converse(complement(composition(X2,X1))),X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[108,41,theory(equality)]),37,theory(equality)])).
% cnf(124,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[21,17,theory(equality)])).
% cnf(132,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X2),complement(X1))))=X1),inference(spm,[status(thm)],[124,17,theory(equality)])).
% cnf(162,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[62,37,theory(equality)])).
% cnf(168,plain,(one=converse(one)),inference(spm,[status(thm)],[27,162,theory(equality)])).
% cnf(181,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[162,168,theory(equality)])).
% cnf(185,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[107,181,theory(equality)])).
% cnf(189,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[185,168,theory(equality)]),181,theory(equality)])).
% cnf(190,negated_conjecture,(join(one,converse(esk1_0))=converse(one)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[54,168,theory(equality)]),17,theory(equality)])).
% cnf(191,negated_conjecture,(join(one,converse(esk1_0))=one),inference(rw,[status(thm)],[190,168,theory(equality)])).
% cnf(194,negated_conjecture,(composition(one,X1)=join(composition(one,X1),composition(converse(esk1_0),X1))),inference(spm,[status(thm)],[29,191,theory(equality)])).
% cnf(197,negated_conjecture,(X1=join(composition(one,X1),composition(converse(esk1_0),X1))),inference(rw,[status(thm)],[194,181,theory(equality)])).
% cnf(198,negated_conjecture,(X1=join(X1,composition(converse(esk1_0),X1))),inference(rw,[status(thm)],[197,181,theory(equality)])).
% cnf(209,negated_conjecture,(join(esk1_0,join(X1,one))=join(X1,one)),inference(spm,[status(thm)],[71,17,theory(equality)])).
% cnf(228,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[124,189,theory(equality)])).
% cnf(230,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[189,64,theory(equality)])).
% cnf(234,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[228,31,theory(equality)]),64,theory(equality)])).
% cnf(237,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[19,230,theory(equality)])).
% cnf(243,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[234,17,theory(equality)])).
% cnf(282,negated_conjecture,(converse(X1)=join(converse(X1),converse(composition(converse(esk1_0),X1)))),inference(spm,[status(thm)],[39,198,theory(equality)])).
% cnf(288,negated_conjecture,(converse(X1)=join(converse(X1),composition(converse(X1),esk1_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[282,41,theory(equality)]),37,theory(equality)])).
% cnf(308,negated_conjecture,(join(top,one)=join(complement(esk1_0),one)),inference(spm,[status(thm)],[209,72,theory(equality)])).
% cnf(324,plain,(join(X1,complement(X1))=join(top,complement(X1))),inference(spm,[status(thm)],[72,189,theory(equality)])).
% cnf(335,plain,(top=join(top,complement(X1))),inference(rw,[status(thm)],[324,31,theory(equality)])).
% cnf(343,negated_conjecture,(join(one,complement(esk1_0))=join(top,one)),inference(rw,[status(thm)],[308,17,theory(equality)])).
% cnf(392,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[237,243,theory(equality)])).
% cnf(411,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[17,392,theory(equality)])).
% cnf(412,plain,(converse(X1)=join(converse(zero),converse(X1))),inference(spm,[status(thm)],[39,392,theory(equality)])).
% cnf(420,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[243,392,theory(equality)])).
% cnf(439,plain,(join(complement(join(X1,X2)),complement(join(X1,complement(X2))))=complement(X1)),inference(spm,[status(thm)],[124,420,theory(equality)])).
% cnf(441,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[189,420,theory(equality)])).
% cnf(442,plain,(join(top,X1)=top),inference(spm,[status(thm)],[335,420,theory(equality)])).
% cnf(446,negated_conjecture,(join(complement(join(esk1_0,complement(one))),complement(join(complement(one),composition(esk1_0,top))))!=complement(join(complement(one),complement(complement(composition(esk1_0,top)))))|join(complement(join(complement(one),complement(complement(esk1_0)))),complement(join(complement(one),complement(complement(composition(esk1_0,top))))))!=complement(join(complement(one),complement(complement(esk1_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[52,420,theory(equality)]),17,theory(equality)]),420,theory(equality)])).
% cnf(447,negated_conjecture,(join(complement(join(esk1_0,complement(one))),complement(join(complement(one),composition(esk1_0,top))))!=complement(join(complement(one),composition(esk1_0,top)))|join(complement(join(complement(one),complement(complement(esk1_0)))),complement(join(complement(one),complement(complement(composition(esk1_0,top))))))!=complement(join(complement(one),complement(complement(esk1_0))))),inference(rw,[status(thm)],[446,420,theory(equality)])).
% cnf(448,negated_conjecture,(join(complement(join(esk1_0,complement(one))),complement(join(complement(one),composition(esk1_0,top))))!=complement(join(complement(one),composition(esk1_0,top)))|join(complement(join(esk1_0,complement(one))),complement(join(complement(one),composition(esk1_0,top))))!=complement(join(complement(one),complement(complement(esk1_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[447,420,theory(equality)]),17,theory(equality)]),420,theory(equality)])).
% cnf(449,negated_conjecture,(join(complement(join(esk1_0,complement(one))),complement(join(complement(one),composition(esk1_0,top))))!=complement(join(complement(one),composition(esk1_0,top)))|join(complement(join(esk1_0,complement(one))),complement(join(complement(one),composition(esk1_0,top))))!=complement(join(esk1_0,complement(one)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[448,420,theory(equality)]),17,theory(equality)])).
% cnf(461,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[19,441,theory(equality)])).
% cnf(507,plain,(top=join(X1,top)),inference(spm,[status(thm)],[17,442,theory(equality)])).
% cnf(512,plain,(join(X1,join(complement(X1),X2))=top),inference(rw,[status(thm)],[72,442,theory(equality)])).
% cnf(516,negated_conjecture,(join(one,complement(esk1_0))=top),inference(rw,[status(thm)],[343,442,theory(equality)])).
% cnf(529,plain,(join(one,converse(complement(one)))=converse(top)),inference(spm,[status(thm)],[55,168,theory(equality)])).
% cnf(555,negated_conjecture,(composition(top,X1)=join(composition(one,X1),composition(complement(esk1_0),X1))),inference(spm,[status(thm)],[29,516,theory(equality)])).
% cnf(559,negated_conjecture,(composition(top,X1)=join(X1,composition(complement(esk1_0),X1))),inference(rw,[status(thm)],[555,181,theory(equality)])).
% cnf(574,plain,(join(converse(zero),X1)=X1),inference(spm,[status(thm)],[412,37,theory(equality)])).
% cnf(582,plain,(zero=converse(zero)),inference(spm,[status(thm)],[411,574,theory(equality)])).
% cnf(629,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[461,124,theory(equality)])).
% cnf(635,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[461,17,theory(equality)])).
% cnf(733,plain,(join(complement(X1),join(X1,X2))=top),inference(spm,[status(thm)],[512,420,theory(equality)])).
% cnf(882,plain,(join(complement(one),converse(top))=top),inference(spm,[status(thm)],[733,529,theory(equality)])).
% cnf(912,plain,(converse(top)=join(converse(complement(one)),converse(converse(top)))),inference(spm,[status(thm)],[39,882,theory(equality)])).
% cnf(920,plain,(converse(top)=top),inference(rw,[status(thm)],[inference(rw,[status(thm)],[912,37,theory(equality)]),507,theory(equality)])).
% cnf(932,plain,(join(one,converse(complement(one)))=top),inference(rw,[status(thm)],[529,920,theory(equality)])).
% cnf(937,plain,(join(converse(X1),converse(complement(X1)))=top),inference(rw,[status(thm)],[55,920,theory(equality)])).
% cnf(941,plain,(composition(top,X1)=join(composition(one,X1),composition(converse(complement(one)),X1))),inference(spm,[status(thm)],[29,932,theory(equality)])).
% cnf(949,plain,(composition(top,X1)=join(X1,composition(converse(complement(one)),X1))),inference(rw,[status(thm)],[941,181,theory(equality)])).
% cnf(1117,plain,(join(X1,converse(complement(converse(X1))))=top),inference(spm,[status(thm)],[937,37,theory(equality)])).
% cnf(1430,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[629,17,theory(equality)])).
% cnf(1460,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1430,635,theory(equality)])).
% cnf(1524,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1460,420,theory(equality)])).
% cnf(1903,negated_conjecture,(join(complement(X1),composition(top,X1))=top),inference(spm,[status(thm)],[733,559,theory(equality)])).
% cnf(2037,negated_conjecture,(join(top,X2)=join(complement(X1),join(composition(top,X1),X2))),inference(spm,[status(thm)],[19,1903,theory(equality)])).
% cnf(2056,negated_conjecture,(top=join(complement(X1),join(composition(top,X1),X2))),inference(rw,[status(thm)],[2037,442,theory(equality)])).
% cnf(5408,negated_conjecture,(join(X1,composition(esk1_0,X1))=composition(one,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[93,181,theory(equality)]),17,theory(equality)])).
% cnf(5409,negated_conjecture,(join(X1,composition(esk1_0,X1))=X1),inference(rw,[status(thm)],[5408,181,theory(equality)])).
% cnf(5423,negated_conjecture,(join(X1,X2)=join(X1,join(composition(esk1_0,X1),X2))),inference(spm,[status(thm)],[19,5409,theory(equality)])).
% cnf(6384,negated_conjecture,(join(X1,composition(X1,esk1_0))=X1),inference(spm,[status(thm)],[288,37,theory(equality)])).
% cnf(6431,negated_conjecture,(join(X1,X2)=join(X1,join(composition(X1,esk1_0),X2))),inference(spm,[status(thm)],[19,6384,theory(equality)])).
% cnf(6441,negated_conjecture,(join(X1,X2)=join(X2,join(X1,composition(X2,esk1_0)))),inference(spm,[status(thm)],[79,6384,theory(equality)])).
% cnf(7673,plain,(join(converse(zero),composition(converse(complement(composition(X1,top))),X1))=converse(zero)),inference(spm,[status(thm)],[118,64,theory(equality)])).
% cnf(7718,plain,(composition(converse(complement(composition(X1,top))),X1)=converse(zero)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[7673,582,theory(equality)]),392,theory(equality)])).
% cnf(7719,plain,(composition(converse(complement(composition(X1,top))),X1)=zero),inference(rw,[status(thm)],[7718,582,theory(equality)])).
% cnf(8357,negated_conjecture,(join(X1,top)=join(X1,complement(composition(esk1_0,X1)))),inference(spm,[status(thm)],[5423,31,theory(equality)])).
% cnf(8440,negated_conjecture,(top=join(X1,complement(composition(esk1_0,X1)))),inference(rw,[status(thm)],[8357,507,theory(equality)])).
% cnf(8466,negated_conjecture,(converse(top)=join(converse(X1),converse(complement(composition(esk1_0,X1))))),inference(spm,[status(thm)],[39,8440,theory(equality)])).
% cnf(8503,negated_conjecture,(top=join(converse(X1),converse(complement(composition(esk1_0,X1))))),inference(rw,[status(thm)],[8466,920,theory(equality)])).
% cnf(9269,negated_conjecture,(join(X1,composition(top,esk1_0))=join(X1,composition(complement(X1),esk1_0))),inference(spm,[status(thm)],[6431,95,theory(equality)])).
% cnf(9920,negated_conjecture,(join(converse(complement(one)),composition(top,esk1_0))=join(esk1_0,converse(complement(one)))),inference(spm,[status(thm)],[6441,949,theory(equality)])).
% cnf(10175,negated_conjecture,(join(composition(top,esk1_0),converse(complement(one)))=join(esk1_0,converse(complement(one)))),inference(rw,[status(thm)],[9920,17,theory(equality)])).
% cnf(10176,negated_conjecture,(converse(join(esk1_0,converse(complement(one))))=join(converse(composition(top,esk1_0)),converse(converse(complement(one))))),inference(spm,[status(thm)],[39,10175,theory(equality)])).
% cnf(10193,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)],[10176,39,theory(equality)]),37,theory(equality)])).
% cnf(10194,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)],[10193,41,theory(equality)]),920,theory(equality)]),37,theory(equality)])).
% cnf(13197,negated_conjecture,(join(complement(one),composition(converse(esk1_0),top))=join(converse(esk1_0),complement(one))),inference(rw,[status(thm)],[10194,17,theory(equality)])).
% cnf(13198,negated_conjecture,(join(complement(one),composition(converse(esk1_0),top))=join(complement(one),converse(esk1_0))),inference(rw,[status(thm)],[13197,17,theory(equality)])).
% cnf(20440,negated_conjecture,(join(X1,converse(complement(composition(esk1_0,converse(X1)))))=top),inference(spm,[status(thm)],[8503,37,theory(equality)])).
% cnf(31893,plain,(join(complement(complement(X1)),complement(join(complement(complement(join(X1,complement(X2)))),complement(join(X1,X2)))))=join(X1,X2)),inference(spm,[status(thm)],[132,439,theory(equality)])).
% cnf(32244,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)],[31893,420,theory(equality)]),420,theory(equality)]),19,theory(equality)]),1524,theory(equality)])).
% cnf(32653,plain,(join(X1,complement(join(X1,X2)))=join(X1,join(X1,complement(X2)))),inference(spm,[status(thm)],[32244,32244,theory(equality)])).
% cnf(32794,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[32653,461,theory(equality)])).
% cnf(32986,plain,(join(converse(X1),complement(top))=join(converse(X1),complement(converse(complement(X1))))),inference(spm,[status(thm)],[32794,937,theory(equality)])).
% cnf(33134,plain,(join(X1,complement(top))=join(X1,complement(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[32794,1117,theory(equality)])).
% cnf(33203,plain,(join(X1,complement(join(X2,X1)))=join(X1,complement(X2))),inference(spm,[status(thm)],[32794,17,theory(equality)])).
% cnf(33291,plain,(converse(X1)=join(converse(X1),complement(converse(complement(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[32986,64,theory(equality)]),411,theory(equality)])).
% cnf(33478,plain,(X1=join(X1,complement(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[33134,64,theory(equality)]),411,theory(equality)])).
% cnf(34800,plain,(converse(converse(X1))=join(converse(converse(X1)),converse(complement(converse(complement(X1)))))),inference(spm,[status(thm)],[39,33291,theory(equality)])).
% cnf(34845,plain,(X1=join(converse(converse(X1)),converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[34800,37,theory(equality)])).
% cnf(34846,plain,(X1=join(X1,converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[34845,37,theory(equality)])).
% cnf(34950,plain,(join(complement(X1),converse(complement(converse(X1))))=complement(X1)),inference(spm,[status(thm)],[34846,420,theory(equality)])).
% cnf(35149,plain,(join(complement(converse(complement(converse(X1)))),complement(complement(X1)))=complement(converse(complement(converse(X1))))),inference(spm,[status(thm)],[1524,34950,theory(equality)])).
% cnf(35199,plain,(X1=complement(converse(complement(converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[35149,420,theory(equality)]),17,theory(equality)]),33478,theory(equality)])).
% cnf(35254,plain,(complement(X1)=converse(complement(converse(X1)))),inference(spm,[status(thm)],[420,35199,theory(equality)])).
% cnf(35351,plain,(converse(complement(X1))=complement(converse(X1))),inference(spm,[status(thm)],[37,35254,theory(equality)])).
% cnf(35468,negated_conjecture,(join(X1,complement(composition(X1,converse(esk1_0))))=top),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[20440,35351,theory(equality)]),41,theory(equality)]),37,theory(equality)])).
% cnf(35472,plain,(composition(complement(composition(top,converse(X1))),X1)=zero),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[7719,35351,theory(equality)]),41,theory(equality)]),920,theory(equality)])).
% cnf(35555,negated_conjecture,(join(X1,complement(top))=join(X1,complement(complement(composition(X1,converse(esk1_0)))))),inference(spm,[status(thm)],[32794,35468,theory(equality)])).
% cnf(35639,negated_conjecture,(X1=join(X1,complement(complement(composition(X1,converse(esk1_0)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[35555,64,theory(equality)]),411,theory(equality)])).
% cnf(35640,negated_conjecture,(X1=join(X1,composition(X1,converse(esk1_0)))),inference(rw,[status(thm)],[35639,420,theory(equality)])).
% cnf(35721,negated_conjecture,(join(X1,X2)=join(X2,join(X1,composition(X2,converse(esk1_0))))),inference(spm,[status(thm)],[79,35640,theory(equality)])).
% cnf(35834,negated_conjecture,(join(composition(top,converse(esk1_0)),zero)=join(composition(top,converse(esk1_0)),composition(top,esk1_0))),inference(spm,[status(thm)],[9269,35472,theory(equality)])).
% cnf(35892,negated_conjecture,(composition(top,converse(esk1_0))=join(composition(top,converse(esk1_0)),composition(top,esk1_0))),inference(rw,[status(thm)],[35834,411,theory(equality)])).
% cnf(47282,negated_conjecture,(join(composition(top,esk1_0),composition(top,converse(esk1_0)))=composition(top,converse(esk1_0))),inference(rw,[status(thm)],[35892,17,theory(equality)])).
% cnf(47311,negated_conjecture,(join(complement(esk1_0),composition(top,converse(esk1_0)))=top),inference(spm,[status(thm)],[2056,47282,theory(equality)])).
% cnf(47933,negated_conjecture,(join(complement(esk1_0),composition(top,converse(esk1_0)))=join(converse(esk1_0),complement(esk1_0))),inference(spm,[status(thm)],[35721,559,theory(equality)])).
% cnf(48105,negated_conjecture,(top=join(converse(esk1_0),complement(esk1_0))),inference(rw,[status(thm)],[47933,47311,theory(equality)])).
% cnf(48106,negated_conjecture,(top=join(complement(esk1_0),converse(esk1_0))),inference(rw,[status(thm)],[48105,17,theory(equality)])).
% cnf(48128,negated_conjecture,(join(converse(esk1_0),complement(top))=join(converse(esk1_0),complement(complement(esk1_0)))),inference(spm,[status(thm)],[33203,48106,theory(equality)])).
% cnf(48174,negated_conjecture,(converse(esk1_0)=join(converse(esk1_0),complement(complement(esk1_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[48128,64,theory(equality)]),411,theory(equality)])).
% cnf(48175,negated_conjecture,(converse(esk1_0)=join(esk1_0,converse(esk1_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[48174,420,theory(equality)]),17,theory(equality)])).
% cnf(48202,negated_conjecture,(converse(converse(esk1_0))=join(converse(esk1_0),converse(converse(esk1_0)))),inference(spm,[status(thm)],[39,48175,theory(equality)])).
% cnf(48231,negated_conjecture,(esk1_0=join(converse(esk1_0),converse(converse(esk1_0)))),inference(rw,[status(thm)],[48202,37,theory(equality)])).
% cnf(48232,negated_conjecture,(esk1_0=converse(esk1_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[48231,37,theory(equality)]),17,theory(equality)]),48175,theory(equality)])).
% cnf(48312,negated_conjecture,(join(complement(one),composition(esk1_0,top))=join(complement(one),converse(esk1_0))),inference(rw,[status(thm)],[13198,48232,theory(equality)])).
% cnf(48313,negated_conjecture,(join(complement(one),composition(esk1_0,top))=join(esk1_0,complement(one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[48312,48232,theory(equality)]),17,theory(equality)])).
% cnf(49297,negated_conjecture,(complement(join(esk1_0,complement(one)))!=complement(join(complement(one),composition(esk1_0,top)))|join(complement(join(esk1_0,complement(one))),complement(join(complement(one),composition(esk1_0,top))))!=complement(join(esk1_0,complement(one)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[449,48313,theory(equality)]),441,theory(equality)])).
% cnf(49298,negated_conjecture,($false|join(complement(join(esk1_0,complement(one))),complement(join(complement(one),composition(esk1_0,top))))!=complement(join(esk1_0,complement(one)))),inference(rw,[status(thm)],[49297,48313,theory(equality)])).
% cnf(49299,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[49298,48313,theory(equality)]),441,theory(equality)])).
% cnf(49300,negated_conjecture,($false),inference(cn,[status(thm)],[49299,theory(equality)])).
% cnf(49301,negated_conjecture,($false),49300,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1633
% # ...of these trivial : 930
% # ...subsumed : 230
% # ...remaining for further processing: 473
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 248
% # Generated clauses : 24702
% # ...of the previous two non-trivial : 10608
% # Contextual simplify-reflections : 0
% # Paramodulations : 24702
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 225
% # Positive orientable unit clauses: 221
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 4423
% # ...number of literals in the above : 4423
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1505
% # Indexed BW rewrite successes : 294
% # Backwards rewriting index: 257 leaves, 1.68+/-1.343 terms/leaf
% # Paramod-from index: 138 leaves, 1.64+/-1.267 terms/leaf
% # Paramod-into index: 246 leaves, 1.67+/-1.320 terms/leaf
% # -------------------------------------------------
% # User time : 0.486 s
% # System time : 0.027 s
% # Total time : 0.513 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.13 CPU 1.22 WC
% FINAL PrfWatch: 1.13 CPU 1.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP4256/REL027+2.tptp
%
%------------------------------------------------------------------------------