TSTP Solution File: REL011+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL011+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 : 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:36:59 EST 2010
% Result : Theorem 1.81s
% Output : Solution 1.81s
% 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/SystemOnTPTP20881/REL011+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20881/REL011+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20881/REL011+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 20977
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(3, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(4, 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(7, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(8, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(9, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(10, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(11, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(12, axiom,![X1]:![X2]:![X3]:join(X1,join(X2,X3))=join(join(X1,X2),X3),file('/tmp/SRASS.s.p', maddux2_join_associativity)).
% fof(13, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(14, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(15, 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(16, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(17, conjecture,![X1]:![X2]:![X3]:(meet(X1,composition(converse(X2),X3))=zero=>meet(composition(X2,X1),X3)=zero),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:![X2]:![X3]:(meet(X1,composition(converse(X2),X3))=zero=>meet(composition(X2,X1),X3)=zero)),inference(assume_negation,[status(cth)],[17])).
% fof(21, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(22,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[3])).
% cnf(24,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[23])).
% fof(25, 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)],[4])).
% cnf(26,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)],[25])).
% fof(31, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[7])).
% cnf(32,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[8])).
% cnf(34,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[9])).
% cnf(36,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[10])).
% cnf(38,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[11])).
% cnf(40,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[12])).
% cnf(42,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[13])).
% cnf(44,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(46,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[15])).
% cnf(48,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[49])).
% fof(51, negated_conjecture,?[X1]:?[X2]:?[X3]:(meet(X1,composition(converse(X2),X3))=zero&~(meet(composition(X2,X1),X3)=zero)),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,?[X4]:?[X5]:?[X6]:(meet(X4,composition(converse(X5),X6))=zero&~(meet(composition(X5,X4),X6)=zero)),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,(meet(esk1_0,composition(converse(esk2_0),esk3_0))=zero&~(meet(composition(esk2_0,esk1_0),esk3_0)=zero)),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(meet(composition(esk2_0,esk1_0),esk3_0)!=zero),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,negated_conjecture,(meet(esk1_0,composition(converse(esk2_0),esk3_0))=zero),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[32,44,theory(equality)]),['unfolding']).
% cnf(57,negated_conjecture,(complement(join(complement(esk1_0),complement(composition(converse(esk2_0),esk3_0))))=zero),inference(rw,[status(thm)],[55,44,theory(equality)]),['unfolding']).
% cnf(60,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)],[26,44,theory(equality)]),44,theory(equality)]),44,theory(equality)]),44,theory(equality)]),44,theory(equality)]),['unfolding']).
% cnf(61,negated_conjecture,(complement(join(complement(composition(esk2_0,esk1_0)),complement(esk3_0)))!=zero),inference(rw,[status(thm)],[54,44,theory(equality)]),['unfolding']).
% cnf(62,negated_conjecture,(complement(join(complement(esk3_0),complement(composition(esk2_0,esk1_0))))!=zero),inference(rw,[status(thm)],[61,40,theory(equality)])).
% cnf(64,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[24,46,theory(equality)])).
% cnf(67,plain,(converse(top)=join(converse(X1),converse(complement(X1)))),inference(spm,[status(thm)],[34,50,theory(equality)])).
% cnf(73,plain,(complement(top)=zero),inference(rw,[status(thm)],[56,50,theory(equality)])).
% cnf(84,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[50,42,theory(equality)])).
% cnf(89,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[42,50,theory(equality)])).
% cnf(114,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[38,40,theory(equality)])).
% cnf(134,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[48,40,theory(equality)])).
% cnf(151,plain,(join(complement(join(X2,complement(X1))),complement(join(complement(X1),complement(X2))))=X1),inference(spm,[status(thm)],[134,40,theory(equality)])).
% cnf(326,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[64,22,theory(equality)])).
% cnf(342,plain,(one=converse(one)),inference(spm,[status(thm)],[46,326,theory(equality)])).
% cnf(373,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[326,342,theory(equality)])).
% cnf(387,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[114,373,theory(equality)])).
% cnf(399,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[387,342,theory(equality)]),373,theory(equality)])).
% cnf(423,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[134,399,theory(equality)])).
% cnf(432,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[399,73,theory(equality)])).
% cnf(438,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[423,50,theory(equality)]),73,theory(equality)])).
% cnf(450,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[42,432,theory(equality)])).
% cnf(458,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[438,40,theory(equality)])).
% cnf(507,plain,(join(X1,complement(X1))=join(top,complement(X1))),inference(spm,[status(thm)],[89,399,theory(equality)])).
% cnf(523,plain,(top=join(top,complement(X1))),inference(rw,[status(thm)],[507,50,theory(equality)])).
% cnf(549,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[450,458,theory(equality)])).
% cnf(559,plain,(complement(zero)=top),inference(spm,[status(thm)],[50,549,theory(equality)])).
% cnf(561,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[40,549,theory(equality)])).
% cnf(571,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[458,549,theory(equality)])).
% cnf(610,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[399,571,theory(equality)])).
% cnf(611,plain,(join(top,X1)=top),inference(spm,[status(thm)],[523,571,theory(equality)])).
% cnf(620,negated_conjecture,(complement(zero)=join(complement(esk1_0),complement(composition(converse(esk2_0),esk3_0)))),inference(spm,[status(thm)],[571,57,theory(equality)])).
% cnf(624,negated_conjecture,(top=join(complement(esk1_0),complement(composition(converse(esk2_0),esk3_0)))),inference(rw,[status(thm)],[620,559,theory(equality)])).
% cnf(638,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[42,610,theory(equality)])).
% cnf(683,plain,(top=join(X1,top)),inference(spm,[status(thm)],[40,611,theory(equality)])).
% cnf(684,plain,(converse(top)=join(converse(top),converse(X1))),inference(spm,[status(thm)],[34,611,theory(equality)])).
% cnf(686,plain,(composition(top,X2)=join(composition(top,X2),composition(X1,X2))),inference(spm,[status(thm)],[36,611,theory(equality)])).
% cnf(783,plain,(join(converse(top),X1)=converse(top)),inference(spm,[status(thm)],[684,22,theory(equality)])).
% cnf(795,plain,(converse(top)=top),inference(spm,[status(thm)],[683,783,theory(equality)])).
% cnf(817,plain,(join(converse(X1),converse(complement(X1)))=top),inference(rw,[status(thm)],[67,795,theory(equality)])).
% cnf(833,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[638,134,theory(equality)])).
% cnf(843,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[638,40,theory(equality)])).
% cnf(1146,negated_conjecture,(join(complement(top),complement(join(complement(esk1_0),complement(complement(composition(converse(esk2_0),esk3_0))))))=esk1_0),inference(spm,[status(thm)],[134,624,theory(equality)])).
% cnf(1159,negated_conjecture,(complement(join(complement(esk1_0),composition(converse(esk2_0),esk3_0)))=esk1_0),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1146,73,theory(equality)]),571,theory(equality)]),549,theory(equality)])).
% cnf(1177,plain,(join(one,converse(complement(one)))=top),inference(spm,[status(thm)],[817,342,theory(equality)])).
% cnf(1180,plain,(join(X1,converse(complement(converse(X1))))=top),inference(spm,[status(thm)],[817,22,theory(equality)])).
% cnf(1196,plain,(composition(top,X1)=join(composition(one,X1),composition(converse(complement(one)),X1))),inference(spm,[status(thm)],[36,1177,theory(equality)])).
% cnf(1204,plain,(composition(top,X1)=join(X1,composition(converse(complement(one)),X1))),inference(rw,[status(thm)],[1196,373,theory(equality)])).
% cnf(1216,negated_conjecture,(complement(esk1_0)=join(complement(esk1_0),composition(converse(esk2_0),esk3_0))),inference(spm,[status(thm)],[571,1159,theory(equality)])).
% cnf(1282,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[833,40,theory(equality)])).
% cnf(1293,plain,(join(X1,X3)=join(X1,join(complement(join(complement(X1),X2)),X3))),inference(spm,[status(thm)],[42,1282,theory(equality)])).
% cnf(1310,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1282,843,theory(equality)])).
% cnf(1380,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1310,571,theory(equality)])).
% cnf(1534,negated_conjecture,(join(complement(esk1_0),X1)=join(complement(esk1_0),join(composition(converse(esk2_0),esk3_0),X1))),inference(spm,[status(thm)],[42,1216,theory(equality)])).
% cnf(1799,plain,(join(X1,join(X2,complement(join(X2,X1))))=top),inference(spm,[status(thm)],[84,40,theory(equality)])).
% cnf(2100,plain,(composition(top,top)=top),inference(spm,[status(thm)],[611,1204,theory(equality)])).
% cnf(2363,plain,(join(complement(top),composition(converse(top),complement(top)))=complement(top)),inference(spm,[status(thm)],[114,2100,theory(equality)])).
% cnf(2374,plain,(composition(top,zero)=complement(top)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2363,73,theory(equality)]),795,theory(equality)]),73,theory(equality)]),549,theory(equality)])).
% cnf(2375,plain,(composition(top,zero)=zero),inference(rw,[status(thm)],[2374,73,theory(equality)])).
% cnf(4732,plain,(join(zero,composition(X1,zero))=zero),inference(spm,[status(thm)],[686,2375,theory(equality)])).
% cnf(4777,plain,(composition(X1,zero)=zero),inference(rw,[status(thm)],[4732,549,theory(equality)])).
% cnf(6535,negated_conjecture,(join(complement(esk1_0),top)=join(complement(esk1_0),converse(complement(converse(composition(converse(esk2_0),esk3_0)))))),inference(spm,[status(thm)],[1534,1180,theory(equality)])).
% cnf(6591,negated_conjecture,(top=join(complement(esk1_0),converse(complement(converse(composition(converse(esk2_0),esk3_0)))))),inference(rw,[status(thm)],[6535,683,theory(equality)])).
% cnf(6592,negated_conjecture,(top=join(complement(esk1_0),converse(complement(composition(converse(esk3_0),esk2_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[6591,24,theory(equality)]),22,theory(equality)])).
% cnf(6853,negated_conjecture,(converse(top)=join(converse(complement(esk1_0)),converse(converse(complement(composition(converse(esk3_0),esk2_0)))))),inference(spm,[status(thm)],[34,6592,theory(equality)])).
% cnf(6874,negated_conjecture,(top=join(converse(complement(esk1_0)),converse(converse(complement(composition(converse(esk3_0),esk2_0)))))),inference(rw,[status(thm)],[6853,795,theory(equality)])).
% cnf(6875,negated_conjecture,(top=join(converse(complement(esk1_0)),complement(composition(converse(esk3_0),esk2_0)))),inference(rw,[status(thm)],[6874,22,theory(equality)])).
% cnf(6898,negated_conjecture,(join(complement(composition(converse(esk3_0),esk2_0)),converse(complement(esk1_0)))=top),inference(rw,[status(thm)],[6875,40,theory(equality)])).
% cnf(23045,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),complement(complement(X1)))))),inference(spm,[status(thm)],[1293,151,theory(equality)])).
% cnf(23165,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),X1)))),inference(rw,[status(thm)],[23045,571,theory(equality)])).
% cnf(23351,plain,(join(X1,complement(join(X2,X1)))=join(X1,complement(X2))),inference(spm,[status(thm)],[23165,571,theory(equality)])).
% cnf(23854,plain,(join(join(X1,complement(join(X1,X2))),complement(top))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(spm,[status(thm)],[23351,1799,theory(equality)])).
% cnf(24077,plain,(join(X1,complement(join(X1,X2)))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[23854,73,theory(equality)]),42,theory(equality)]),561,theory(equality)])).
% cnf(24078,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[24077,42,theory(equality)]),40,theory(equality)]),1380,theory(equality)])).
% cnf(24264,plain,(join(converse(X1),complement(top))=join(converse(X1),complement(converse(complement(X1))))),inference(spm,[status(thm)],[24078,817,theory(equality)])).
% cnf(24320,plain,(join(X1,complement(top))=join(X1,complement(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[24078,1180,theory(equality)])).
% cnf(24477,plain,(converse(X1)=join(converse(X1),complement(converse(complement(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[24264,73,theory(equality)]),561,theory(equality)])).
% cnf(24555,plain,(X1=join(X1,complement(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[24320,73,theory(equality)]),561,theory(equality)])).
% cnf(24892,plain,(converse(converse(X1))=join(converse(converse(X1)),converse(complement(converse(complement(X1)))))),inference(spm,[status(thm)],[34,24477,theory(equality)])).
% cnf(24935,plain,(X1=join(converse(converse(X1)),converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[24892,22,theory(equality)])).
% cnf(24936,plain,(X1=join(X1,converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[24935,22,theory(equality)])).
% cnf(25027,plain,(join(complement(X1),converse(complement(converse(X1))))=complement(X1)),inference(spm,[status(thm)],[24936,571,theory(equality)])).
% cnf(25402,plain,(join(complement(converse(complement(converse(X1)))),complement(complement(X1)))=complement(converse(complement(converse(X1))))),inference(spm,[status(thm)],[1380,25027,theory(equality)])).
% cnf(25451,plain,(X1=complement(converse(complement(converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[25402,571,theory(equality)]),40,theory(equality)]),24555,theory(equality)])).
% cnf(25509,plain,(complement(X1)=converse(complement(converse(X1)))),inference(spm,[status(thm)],[571,25451,theory(equality)])).
% cnf(25633,plain,(converse(complement(X1))=complement(converse(X1))),inference(spm,[status(thm)],[22,25509,theory(equality)])).
% cnf(25787,negated_conjecture,(join(complement(converse(esk1_0)),complement(composition(converse(esk3_0),esk2_0)))=top),inference(rw,[status(thm)],[inference(rw,[status(thm)],[6898,25633,theory(equality)]),40,theory(equality)])).
% cnf(29372,negated_conjecture,(join(complement(join(complement(composition(esk3_0,converse(esk1_0))),complement(esk2_0))),composition(complement(join(complement(esk3_0),complement(composition(esk2_0,converse(converse(esk1_0)))))),complement(top)))=composition(complement(join(complement(esk3_0),complement(composition(esk2_0,converse(converse(esk1_0)))))),complement(top))),inference(spm,[status(thm)],[60,25787,theory(equality)])).
% cnf(29435,negated_conjecture,(complement(join(complement(composition(esk3_0,converse(esk1_0))),complement(esk2_0)))=composition(complement(join(complement(esk3_0),complement(composition(esk2_0,converse(converse(esk1_0)))))),complement(top))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[29372,22,theory(equality)]),73,theory(equality)]),4777,theory(equality)]),561,theory(equality)])).
% cnf(29436,negated_conjecture,(complement(join(complement(composition(esk3_0,converse(esk1_0))),complement(esk2_0)))=zero),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[29435,22,theory(equality)]),73,theory(equality)]),4777,theory(equality)])).
% cnf(32274,negated_conjecture,(complement(join(complement(esk2_0),complement(composition(esk3_0,converse(esk1_0)))))=zero),inference(rw,[status(thm)],[29436,40,theory(equality)])).
% cnf(32382,negated_conjecture,(join(complement(join(complement(composition(esk2_0,esk1_0)),complement(esk3_0))),composition(zero,complement(join(complement(esk1_0),complement(composition(converse(esk2_0),esk3_0))))))=composition(zero,complement(join(complement(esk1_0),complement(composition(converse(esk2_0),esk3_0)))))),inference(spm,[status(thm)],[60,32274,theory(equality)])).
% cnf(32515,negated_conjecture,(complement(join(complement(esk3_0),complement(composition(esk2_0,esk1_0))))=composition(zero,complement(join(complement(esk1_0),complement(composition(converse(esk2_0),esk3_0)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[32382,40,theory(equality)]),624,theory(equality)]),73,theory(equality)]),4777,theory(equality)]),561,theory(equality)])).
% cnf(32516,negated_conjecture,(complement(join(complement(esk3_0),complement(composition(esk2_0,esk1_0))))=zero),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[32515,624,theory(equality)]),73,theory(equality)]),4777,theory(equality)])).
% cnf(32517,negated_conjecture,($false),inference(sr,[status(thm)],[32516,62,theory(equality)])).
% cnf(32518,negated_conjecture,($false),32517,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 985
% # ...of these trivial : 561
% # ...subsumed : 114
% # ...remaining for further processing: 310
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 120
% # Generated clauses : 16107
% # ...of the previous two non-trivial : 7298
% # Contextual simplify-reflections : 0
% # Paramodulations : 16107
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 190
% # Positive orientable unit clauses: 185
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 4320
% # ...number of literals in the above : 4320
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 17
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 835
% # Indexed BW rewrite successes : 175
% # Backwards rewriting index: 240 leaves, 1.71+/-1.586 terms/leaf
% # Paramod-from index: 127 leaves, 1.50+/-1.374 terms/leaf
% # Paramod-into index: 232 leaves, 1.68+/-1.546 terms/leaf
% # -------------------------------------------------
% # User time : 0.357 s
% # System time : 0.020 s
% # Total time : 0.377 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.85 CPU 0.95 WC
% FINAL PrfWatch: 0.85 CPU 0.95 WC
% SZS output end Solution for /tmp/SystemOnTPTP20881/REL011+2.tptp
%
%------------------------------------------------------------------------------