TSTP Solution File: REL026+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL026+4 : 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:52:00 EST 2010
% Result : Theorem 38.02s
% Output : Solution 38.02s
% 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/SystemOnTPTP31569/REL026+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31569/REL026+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31569/REL026+4.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 31701
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.94 CPU 2.03 WC
% PrfWatch: 3.93 CPU 4.03 WC
% PrfWatch: 5.93 CPU 6.04 WC
% PrfWatch: 7.92 CPU 8.05 WC
% PrfWatch: 9.90 CPU 10.05 WC
% PrfWatch: 11.90 CPU 12.06 WC
% PrfWatch: 13.90 CPU 14.07 WC
% PrfWatch: 15.89 CPU 16.07 WC
% PrfWatch: 17.88 CPU 18.08 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 19.87 CPU 20.09 WC
% PrfWatch: 21.87 CPU 22.09 WC
% PrfWatch: 23.86 CPU 24.10 WC
% PrfWatch: 25.85 CPU 26.11 WC
% PrfWatch: 27.84 CPU 28.11 WC
% PrfWatch: 29.84 CPU 30.12 WC
% PrfWatch: 31.83 CPU 32.14 WC
% PrfWatch: 33.83 CPU 34.15 WC
% PrfWatch: 35.82 CPU 36.15 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(2, axiom,![X1]:![X2]:![X3]:join(X1,join(X2,X3))=join(join(X1,X2),X3),file('/tmp/SRASS.s.p', maddux2_join_associativity)).
% fof(3, axiom,![X1]:![X2]:![X3]:composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3),file('/tmp/SRASS.s.p', composition_associativity)).
% fof(4, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(5, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(6, 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(9, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(10, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(11, 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(12, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(13, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(14, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(15, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(16, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(17, conjecture,![X1]:![X2]:(join(X1,one)=one=>(join(meet(composition(X1,top),X2),composition(X1,X2))=composition(X1,X2)&join(composition(X1,X2),meet(composition(X1,top),X2))=meet(composition(X1,top),X2))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:![X2]:(join(X1,one)=one=>(join(meet(composition(X1,top),X2),composition(X1,X2))=composition(X1,X2)&join(composition(X1,X2),meet(composition(X1,top),X2))=meet(composition(X1,top),X2)))),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,![X4]:![X5]:![X6]:composition(X4,composition(X5,X6))=composition(composition(X4,X5),X6),inference(variable_rename,[status(thm)],[3])).
% cnf(24,plain,(composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(26,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[5])).
% cnf(28,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[27])).
% fof(29, 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)],[6])).
% cnf(30,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)],[29])).
% fof(35, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[9])).
% cnf(36,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[10])).
% cnf(38,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[11])).
% cnf(40,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(42,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[13])).
% cnf(44,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[14])).
% cnf(46,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[15])).
% cnf(48,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[49])).
% fof(51, negated_conjecture,?[X1]:?[X2]:(join(X1,one)=one&(~(join(meet(composition(X1,top),X2),composition(X1,X2))=composition(X1,X2))|~(join(composition(X1,X2),meet(composition(X1,top),X2))=meet(composition(X1,top),X2)))),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,?[X3]:?[X4]:(join(X3,one)=one&(~(join(meet(composition(X3,top),X4),composition(X3,X4))=composition(X3,X4))|~(join(composition(X3,X4),meet(composition(X3,top),X4))=meet(composition(X3,top),X4)))),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,(join(esk1_0,one)=one&(~(join(meet(composition(esk1_0,top),esk2_0),composition(esk1_0,esk2_0))=composition(esk1_0,esk2_0))|~(join(composition(esk1_0,esk2_0),meet(composition(esk1_0,top),esk2_0))=meet(composition(esk1_0,top),esk2_0)))),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(join(composition(esk1_0,esk2_0),meet(composition(esk1_0,top),esk2_0))!=meet(composition(esk1_0,top),esk2_0)|join(meet(composition(esk1_0,top),esk2_0),composition(esk1_0,esk2_0))!=composition(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,negated_conjecture,(join(esk1_0,one)=one),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[50,38,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)],[30,38,theory(equality)]),38,theory(equality)]),38,theory(equality)]),38,theory(equality)]),38,theory(equality)]),['unfolding']).
% cnf(60,negated_conjecture,(join(complement(join(complement(composition(esk1_0,top)),complement(esk2_0))),composition(esk1_0,esk2_0))!=composition(esk1_0,esk2_0)|join(composition(esk1_0,esk2_0),complement(join(complement(composition(esk1_0,top)),complement(esk2_0))))!=complement(join(complement(composition(esk1_0,top)),complement(esk2_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[54,38,theory(equality)]),38,theory(equality)]),38,theory(equality)]),['unfolding']).
% cnf(61,negated_conjecture,(join(complement(join(complement(esk2_0),complement(composition(esk1_0,top)))),composition(esk1_0,esk2_0))!=complement(join(complement(composition(esk1_0,top)),complement(esk2_0)))|join(complement(join(complement(composition(esk1_0,top)),complement(esk2_0))),composition(esk1_0,esk2_0))!=composition(esk1_0,esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[60,20,theory(equality)]),20,theory(equality)])).
% cnf(62,negated_conjecture,(join(complement(join(complement(esk2_0),complement(composition(esk1_0,top)))),composition(esk1_0,esk2_0))!=complement(join(complement(esk2_0),complement(composition(esk1_0,top))))|join(complement(join(complement(composition(esk1_0,top)),complement(esk2_0))),composition(esk1_0,esk2_0))!=composition(esk1_0,esk2_0)),inference(rw,[status(thm)],[61,20,theory(equality)])).
% cnf(63,negated_conjecture,(join(complement(join(complement(esk2_0),complement(composition(esk1_0,top)))),composition(esk1_0,esk2_0))!=complement(join(complement(esk2_0),complement(composition(esk1_0,top))))|join(complement(join(complement(esk2_0),complement(composition(esk1_0,top)))),composition(esk1_0,esk2_0))!=composition(esk1_0,esk2_0)),inference(rw,[status(thm)],[62,20,theory(equality)])).
% cnf(64,negated_conjecture,(join(one,esk1_0)=one),inference(rw,[status(thm)],[55,20,theory(equality)])).
% cnf(66,plain,(converse(top)=join(converse(X1),converse(complement(X1)))),inference(spm,[status(thm)],[44,36,theory(equality)])).
% cnf(73,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[46,26,theory(equality)])).
% cnf(75,plain,(complement(top)=zero),inference(rw,[status(thm)],[56,36,theory(equality)])).
% cnf(82,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[22,36,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(104,plain,(composition(top,X2)=join(composition(X1,X2),composition(complement(X1),X2))),inference(spm,[status(thm)],[28,36,theory(equality)])).
% cnf(116,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[48,20,theory(equality)])).
% cnf(133,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[40,20,theory(equality)])).
% cnf(137,plain,(join(complement(X1),complement(join(complement(join(complement(X1),X2)),complement(complement(join(complement(X1),complement(X2)))))))=join(complement(X1),X2)),inference(spm,[status(thm)],[133,133,theory(equality)])).
% cnf(255,negated_conjecture,(converse(one)=join(converse(one),converse(esk1_0))),inference(spm,[status(thm)],[44,64,theory(equality)])).
% cnf(256,negated_conjecture,(join(one,X1)=join(one,join(esk1_0,X1))),inference(spm,[status(thm)],[22,64,theory(equality)])).
% cnf(257,negated_conjecture,(composition(one,X1)=join(composition(one,X1),composition(esk1_0,X1))),inference(spm,[status(thm)],[28,64,theory(equality)])).
% cnf(309,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[73,42,theory(equality)])).
% cnf(324,plain,(one=converse(one)),inference(spm,[status(thm)],[26,309,theory(equality)])).
% cnf(352,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[309,324,theory(equality)])).
% cnf(353,negated_conjecture,(join(one,converse(esk1_0))=converse(one)),inference(rw,[status(thm)],[255,324,theory(equality)])).
% cnf(354,negated_conjecture,(join(one,converse(esk1_0))=one),inference(rw,[status(thm)],[353,324,theory(equality)])).
% cnf(368,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[116,352,theory(equality)])).
% cnf(380,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[368,324,theory(equality)]),352,theory(equality)])).
% cnf(382,negated_conjecture,(join(one,X1)=join(one,join(converse(esk1_0),X1))),inference(spm,[status(thm)],[22,354,theory(equality)])).
% cnf(383,negated_conjecture,(composition(one,X1)=join(composition(one,X1),composition(converse(esk1_0),X1))),inference(spm,[status(thm)],[28,354,theory(equality)])).
% cnf(386,negated_conjecture,(X1=join(composition(one,X1),composition(converse(esk1_0),X1))),inference(rw,[status(thm)],[383,352,theory(equality)])).
% cnf(387,negated_conjecture,(X1=join(X1,composition(converse(esk1_0),X1))),inference(rw,[status(thm)],[386,352,theory(equality)])).
% cnf(393,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[133,380,theory(equality)])).
% cnf(402,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[380,75,theory(equality)])).
% cnf(406,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[393,36,theory(equality)]),75,theory(equality)])).
% cnf(418,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[22,402,theory(equality)])).
% cnf(424,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[406,20,theory(equality)])).
% cnf(472,negated_conjecture,(join(one,esk1_0)=join(one,composition(converse(esk1_0),esk1_0))),inference(spm,[status(thm)],[256,387,theory(equality)])).
% cnf(476,negated_conjecture,(converse(X1)=join(converse(X1),converse(composition(converse(esk1_0),X1)))),inference(spm,[status(thm)],[44,387,theory(equality)])).
% cnf(480,negated_conjecture,(one=join(one,composition(converse(esk1_0),esk1_0))),inference(rw,[status(thm)],[472,64,theory(equality)])).
% cnf(482,negated_conjecture,(converse(X1)=join(converse(X1),composition(converse(X1),esk1_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[476,46,theory(equality)]),42,theory(equality)])).
% cnf(501,plain,(join(X1,complement(X1))=join(top,complement(X1))),inference(spm,[status(thm)],[82,380,theory(equality)])).
% cnf(515,plain,(top=join(top,complement(X1))),inference(rw,[status(thm)],[501,36,theory(equality)])).
% cnf(535,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[418,424,theory(equality)])).
% cnf(554,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[20,535,theory(equality)])).
% cnf(564,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[424,535,theory(equality)])).
% cnf(602,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[380,564,theory(equality)])).
% cnf(603,plain,(join(top,X1)=top),inference(spm,[status(thm)],[515,564,theory(equality)])).
% cnf(628,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[22,602,theory(equality)])).
% cnf(696,plain,(top=join(X1,top)),inference(spm,[status(thm)],[20,603,theory(equality)])).
% cnf(701,plain,(join(X1,join(complement(X1),X2))=top),inference(rw,[status(thm)],[82,603,theory(equality)])).
% cnf(730,plain,(join(one,converse(complement(one)))=converse(top)),inference(spm,[status(thm)],[66,324,theory(equality)])).
% cnf(827,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[628,133,theory(equality)])).
% cnf(843,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[628,20,theory(equality)])).
% cnf(943,plain,(join(complement(X1),join(X1,X2))=top),inference(spm,[status(thm)],[701,564,theory(equality)])).
% cnf(1106,plain,(join(complement(one),converse(top))=top),inference(spm,[status(thm)],[943,730,theory(equality)])).
% cnf(1133,plain,(converse(top)=join(converse(complement(one)),converse(converse(top)))),inference(spm,[status(thm)],[44,1106,theory(equality)])).
% cnf(1141,plain,(converse(top)=top),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1133,42,theory(equality)]),696,theory(equality)])).
% cnf(1159,plain,(join(converse(X1),converse(complement(X1)))=top),inference(rw,[status(thm)],[66,1141,theory(equality)])).
% cnf(1375,plain,(join(X1,converse(complement(converse(X1))))=top),inference(spm,[status(thm)],[1159,42,theory(equality)])).
% cnf(1700,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[827,20,theory(equality)])).
% cnf(1733,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1700,843,theory(equality)])).
% cnf(1811,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1733,564,theory(equality)])).
% cnf(3561,negated_conjecture,(join(complement(composition(converse(esk1_0),esk1_0)),complement(one))=complement(composition(converse(esk1_0),esk1_0))),inference(spm,[status(thm)],[1811,480,theory(equality)])).
% cnf(8151,negated_conjecture,(join(X1,composition(X1,esk1_0))=X1),inference(spm,[status(thm)],[482,42,theory(equality)])).
% cnf(8199,negated_conjecture,(join(X1,X2)=join(X1,join(composition(X1,esk1_0),X2))),inference(spm,[status(thm)],[22,8151,theory(equality)])).
% cnf(8206,negated_conjecture,(join(complement(composition(X1,esk1_0)),complement(X1))=complement(composition(X1,esk1_0))),inference(spm,[status(thm)],[1811,8151,theory(equality)])).
% cnf(8719,negated_conjecture,(join(X1,composition(esk1_0,X1))=composition(one,X1)),inference(rw,[status(thm)],[257,352,theory(equality)])).
% cnf(8720,negated_conjecture,(join(X1,composition(esk1_0,X1))=X1),inference(rw,[status(thm)],[8719,352,theory(equality)])).
% cnf(8731,negated_conjecture,(join(one,converse(esk1_0))=join(one,composition(esk1_0,converse(esk1_0)))),inference(spm,[status(thm)],[382,8720,theory(equality)])).
% cnf(8766,negated_conjecture,(one=join(one,composition(esk1_0,converse(esk1_0)))),inference(rw,[status(thm)],[8731,354,theory(equality)])).
% cnf(8795,negated_conjecture,(composition(one,X1)=join(composition(one,X1),composition(composition(esk1_0,converse(esk1_0)),X1))),inference(spm,[status(thm)],[28,8766,theory(equality)])).
% cnf(8810,negated_conjecture,(X1=join(composition(one,X1),composition(composition(esk1_0,converse(esk1_0)),X1))),inference(rw,[status(thm)],[8795,352,theory(equality)])).
% cnf(8811,negated_conjecture,(X1=join(X1,composition(esk1_0,composition(converse(esk1_0),X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[8810,352,theory(equality)]),24,theory(equality)])).
% cnf(10768,negated_conjecture,(join(X1,composition(X1,esk1_0))=join(X1,composition(esk1_0,composition(X1,esk1_0)))),inference(spm,[status(thm)],[8199,8720,theory(equality)])).
% cnf(10793,negated_conjecture,(join(X1,composition(top,esk1_0))=join(X1,composition(complement(X1),esk1_0))),inference(spm,[status(thm)],[8199,104,theory(equality)])).
% cnf(10876,negated_conjecture,(X1=join(X1,composition(esk1_0,composition(X1,esk1_0)))),inference(rw,[status(thm)],[10768,8151,theory(equality)])).
% cnf(14965,negated_conjecture,(join(complement(one),complement(composition(converse(esk1_0),esk1_0)))=complement(composition(converse(esk1_0),esk1_0))),inference(rw,[status(thm)],[3561,20,theory(equality)])).
% cnf(14991,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,14965,theory(equality)])).
% cnf(15011,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)],[14991,26,theory(equality)]),602,theory(equality)]),564,theory(equality)]),324,theory(equality)]),26,theory(equality)]),602,theory(equality)]),564,theory(equality)]),564,theory(equality)])).
% cnf(15012,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)],[15011,324,theory(equality)]),26,theory(equality)]),602,theory(equality)]),564,theory(equality)]),564,theory(equality)])).
% cnf(18234,plain,(join(complement(X1),complement(join(complement(X1),complement(X2))))=join(complement(X1),X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[137,564,theory(equality)]),89,theory(equality)]),20,theory(equality)]),1811,theory(equality)])).
% cnf(18288,plain,(join(X1,complement(join(X1,complement(X2))))=join(X1,X2)),inference(spm,[status(thm)],[18234,564,theory(equality)])).
% cnf(18612,plain,(join(X1,complement(join(X1,X2)))=join(X1,join(X1,complement(X2)))),inference(spm,[status(thm)],[18288,18288,theory(equality)])).
% cnf(18720,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[18612,628,theory(equality)])).
% cnf(18887,plain,(join(converse(X1),complement(top))=join(converse(X1),complement(converse(complement(X1))))),inference(spm,[status(thm)],[18720,1159,theory(equality)])).
% cnf(18974,plain,(join(X1,complement(top))=join(X1,complement(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[18720,1375,theory(equality)])).
% cnf(19102,plain,(converse(X1)=join(converse(X1),complement(converse(complement(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[18887,75,theory(equality)]),554,theory(equality)])).
% cnf(19216,plain,(X1=join(X1,complement(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[18974,75,theory(equality)]),554,theory(equality)])).
% cnf(20199,plain,(converse(converse(X1))=join(converse(converse(X1)),converse(complement(converse(complement(X1)))))),inference(spm,[status(thm)],[44,19102,theory(equality)])).
% cnf(20236,plain,(X1=join(converse(converse(X1)),converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[20199,42,theory(equality)])).
% cnf(20237,plain,(X1=join(X1,converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[20236,42,theory(equality)])).
% cnf(20315,plain,(join(complement(X1),converse(complement(converse(X1))))=complement(X1)),inference(spm,[status(thm)],[20237,564,theory(equality)])).
% cnf(20368,plain,(join(complement(converse(complement(converse(X1)))),complement(complement(X1)))=complement(converse(complement(converse(X1))))),inference(spm,[status(thm)],[1811,20315,theory(equality)])).
% cnf(20408,plain,(X1=complement(converse(complement(converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[20368,564,theory(equality)]),20,theory(equality)]),19216,theory(equality)])).
% cnf(20455,plain,(complement(X1)=converse(complement(converse(X1)))),inference(spm,[status(thm)],[564,20408,theory(equality)])).
% cnf(20528,plain,(converse(complement(X1))=complement(converse(X1))),inference(spm,[status(thm)],[42,20455,theory(equality)])).
% cnf(25264,negated_conjecture,(join(X1,complement(join(X1,composition(top,esk1_0))))=join(X1,complement(composition(complement(X1),esk1_0)))),inference(spm,[status(thm)],[18720,10793,theory(equality)])).
% cnf(25331,negated_conjecture,(join(X1,complement(composition(top,esk1_0)))=join(X1,complement(composition(complement(X1),esk1_0)))),inference(rw,[status(thm)],[25264,18720,theory(equality)])).
% cnf(27326,negated_conjecture,(esk1_0=composition(esk1_0,composition(converse(esk1_0),esk1_0))),inference(rw,[status(thm)],[15012,8811,theory(equality)])).
% cnf(27353,negated_conjecture,(join(converse(esk1_0),esk1_0)=converse(esk1_0)),inference(spm,[status(thm)],[10876,27326,theory(equality)])).
% cnf(27371,negated_conjecture,(join(esk1_0,converse(esk1_0))=converse(esk1_0)),inference(rw,[status(thm)],[27353,20,theory(equality)])).
% cnf(27374,negated_conjecture,(converse(converse(esk1_0))=join(converse(esk1_0),converse(converse(esk1_0)))),inference(spm,[status(thm)],[44,27371,theory(equality)])).
% cnf(27393,negated_conjecture,(esk1_0=join(converse(esk1_0),converse(converse(esk1_0)))),inference(rw,[status(thm)],[27374,42,theory(equality)])).
% cnf(27394,negated_conjecture,(esk1_0=converse(esk1_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[27393,42,theory(equality)]),20,theory(equality)]),27371,theory(equality)])).
% cnf(37261,negated_conjecture,(join(complement(X1),complement(composition(X1,esk1_0)))=complement(composition(X1,esk1_0))),inference(rw,[status(thm)],[8206,20,theory(equality)])).
% cnf(37342,negated_conjecture,(join(X1,complement(composition(complement(X1),esk1_0)))=complement(composition(complement(X1),esk1_0))),inference(spm,[status(thm)],[37261,564,theory(equality)])).
% cnf(61530,negated_conjecture,(join(X1,complement(composition(top,esk1_0)))=complement(composition(complement(X1),esk1_0))),inference(rw,[status(thm)],[37342,25331,theory(equality)])).
% cnf(61558,negated_conjecture,(complement(join(X1,complement(composition(top,esk1_0))))=composition(complement(X1),esk1_0)),inference(spm,[status(thm)],[564,61530,theory(equality)])).
% cnf(61904,negated_conjecture,(converse(complement(join(X1,complement(composition(top,esk1_0)))))=composition(converse(esk1_0),converse(complement(X1)))),inference(spm,[status(thm)],[46,61558,theory(equality)])).
% cnf(61997,negated_conjecture,(complement(join(converse(X1),complement(composition(esk1_0,top))))=composition(converse(esk1_0),converse(complement(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[61904,20528,theory(equality)]),44,theory(equality)]),20528,theory(equality)]),46,theory(equality)]),27394,theory(equality)]),1141,theory(equality)])).
% cnf(61998,negated_conjecture,(complement(join(converse(X1),complement(composition(esk1_0,top))))=composition(esk1_0,complement(converse(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[61997,27394,theory(equality)]),20528,theory(equality)])).
% cnf(64067,negated_conjecture,(composition(esk1_0,complement(converse(X1)))=complement(join(complement(composition(esk1_0,top)),converse(X1)))),inference(rw,[status(thm)],[61998,20,theory(equality)])).
% cnf(64131,negated_conjecture,(composition(esk1_0,complement(X1))=complement(join(complement(composition(esk1_0,top)),X1))),inference(spm,[status(thm)],[64067,42,theory(equality)])).
% cnf(64293,negated_conjecture,(composition(esk1_0,X1)=complement(join(complement(composition(esk1_0,top)),complement(X1)))),inference(spm,[status(thm)],[64131,564,theory(equality)])).
% cnf(1084565,negated_conjecture,($false|join(complement(join(complement(esk2_0),complement(composition(esk1_0,top)))),composition(esk1_0,esk2_0))!=composition(esk1_0,esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[63,64293,theory(equality)]),20,theory(equality)]),602,theory(equality)])).
% cnf(1084566,negated_conjecture,($false|complement(join(complement(esk2_0),complement(composition(esk1_0,top))))!=composition(esk1_0,esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1084565,64293,theory(equality)]),20,theory(equality)]),602,theory(equality)])).
% cnf(1084567,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1084566,64293,theory(equality)]),20,theory(equality)])).
% cnf(1084568,negated_conjecture,($false),inference(cn,[status(thm)],[1084567,theory(equality)])).
% cnf(1084569,negated_conjecture,($false),1084568,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 13394
% # ...of these trivial : 8727
% # ...subsumed : 2884
% # ...remaining for further processing: 1783
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 619
% # Generated clauses : 491515
% # ...of the previous two non-trivial : 239430
% # Contextual simplify-reflections : 0
% # Paramodulations : 491515
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1164
% # Positive orientable unit clauses: 1155
% # Positive unorientable unit clauses: 9
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 158310
% # ...number of literals in the above : 158310
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 346
% # Rewrite failures with RHS unbound : 225
% # Indexed BW rewrite attempts : 26084
% # Indexed BW rewrite successes : 754
% # Backwards rewriting index: 629 leaves, 4.28+/-7.971 terms/leaf
% # Paramod-from index: 374 leaves, 3.13+/-4.539 terms/leaf
% # Paramod-into index: 601 leaves, 4.20+/-7.866 terms/leaf
% # -------------------------------------------------
% # User time : 18.728 s
% # System time : 0.728 s
% # Total time : 19.456 s
% # Maximum resident set size: 0 pages
% PrfWatch: 36.88 CPU 37.26 WC
% FINAL PrfWatch: 36.88 CPU 37.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP31569/REL026+4.tptp
%
%------------------------------------------------------------------------------