TSTP Solution File: REL025+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL025+1 : 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:46:24 EST 2010
% Result : Theorem 2.44s
% Output : Solution 2.44s
% 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/SystemOnTPTP3738/REL025+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3738/REL025+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3738/REL025+1.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 3834
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 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]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(4, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(5, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(6, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(8, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(9, axiom,![X1]:![X2]:X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),file('/tmp/SRASS.s.p', maddux3_a_kind_of_de_Morgan)).
% fof(10, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(11, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(12, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(13, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(14, conjecture,![X1]:(join(X1,one)=one=>converse(X1)=X1),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:(join(X1,one)=one=>converse(X1)=X1)),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(17,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[26])).
% fof(30, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[8])).
% cnf(31,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[9])).
% cnf(33,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[10])).
% cnf(35,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[11])).
% cnf(37,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[12])).
% cnf(39,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[13])).
% cnf(41,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[40])).
% fof(42, negated_conjecture,?[X1]:(join(X1,one)=one&~(converse(X1)=X1)),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X2]:(join(X2,one)=one&~(converse(X2)=X2)),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,(join(esk1_0,one)=one&~(converse(esk1_0)=esk1_0)),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(converse(esk1_0)!=esk1_0),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)],[41,37,theory(equality)]),['unfolding']).
% cnf(48,negated_conjecture,(join(one,esk1_0)=one),inference(rw,[status(thm)],[46,17,theory(equality)])).
% cnf(51,plain,(join(converse(X1),X2)=converse(join(X1,converse(X2)))),inference(spm,[status(thm)],[23,21,theory(equality)])).
% cnf(52,plain,(join(X1,converse(X2))=converse(join(converse(X1),X2))),inference(spm,[status(thm)],[23,21,theory(equality)])).
% cnf(55,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[27,21,theory(equality)])).
% cnf(56,plain,(composition(X1,converse(X2))=converse(composition(X2,converse(X1)))),inference(spm,[status(thm)],[27,21,theory(equality)])).
% cnf(70,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[39,19,theory(equality)])).
% cnf(75,negated_conjecture,(join(one,X1)=join(one,join(esk1_0,X1))),inference(spm,[status(thm)],[19,48,theory(equality)])).
% cnf(77,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[19,39,theory(equality)])).
% cnf(78,plain,(join(join(X2,X1),X3)=join(X1,join(X2,X3))),inference(spm,[status(thm)],[19,17,theory(equality)])).
% cnf(82,plain,(join(X2,join(X1,X3))=join(X1,join(X2,X3))),inference(rw,[status(thm)],[78,19,theory(equality)])).
% cnf(107,plain,(converse(top)=join(X1,converse(complement(converse(X1))))),inference(spm,[status(thm)],[52,39,theory(equality)])).
% cnf(126,plain,(join(composition(converse(X2),X1),converse(X3))=converse(join(composition(converse(X1),X2),X3))),inference(spm,[status(thm)],[23,55,theory(equality)])).
% cnf(137,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[55,25,theory(equality)])).
% cnf(145,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[137,21,theory(equality)])).
% cnf(149,plain,(one=converse(one)),inference(spm,[status(thm)],[25,145,theory(equality)])).
% cnf(158,plain,(join(one,converse(X1))=converse(join(one,X1))),inference(spm,[status(thm)],[23,149,theory(equality)])).
% cnf(165,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[145,149,theory(equality)])).
% cnf(187,negated_conjecture,(converse(one)=join(one,converse(esk1_0))),inference(spm,[status(thm)],[158,48,theory(equality)])).
% cnf(195,negated_conjecture,(one=join(one,converse(esk1_0))),inference(rw,[status(thm)],[187,149,theory(equality)])).
% cnf(227,plain,(complement(top)=zero),inference(rw,[status(thm)],[47,39,theory(equality)])).
% cnf(243,negated_conjecture,(join(one,top)=join(one,complement(esk1_0))),inference(spm,[status(thm)],[75,39,theory(equality)])).
% cnf(250,negated_conjecture,(converse(join(one,top))=join(one,converse(complement(esk1_0)))),inference(spm,[status(thm)],[158,243,theory(equality)])).
% cnf(252,negated_conjecture,(join(one,converse(top))=join(one,converse(complement(esk1_0)))),inference(rw,[status(thm)],[250,158,theory(equality)])).
% cnf(307,plain,(join(X1,top)=join(top,complement(complement(X1)))),inference(spm,[status(thm)],[77,39,theory(equality)])).
% cnf(385,plain,(join(composition(X1,X2),X2)=composition(join(X1,one),X2)),inference(spm,[status(thm)],[35,165,theory(equality)])).
% cnf(386,plain,(join(composition(X1,converse(X2)),converse(composition(X2,X3)))=composition(join(X1,converse(X3)),converse(X2))),inference(spm,[status(thm)],[35,27,theory(equality)])).
% cnf(389,plain,(join(X1,composition(X2,X1))=composition(join(one,X2),X1)),inference(spm,[status(thm)],[35,165,theory(equality)])).
% cnf(613,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[31,17,theory(equality)])).
% cnf(618,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[613,165,theory(equality)])).
% cnf(619,plain,(join(complement(converse(X1)),composition(converse(converse(X2)),complement(converse(composition(X1,X2)))))=complement(converse(X1))),inference(spm,[status(thm)],[613,27,theory(equality)])).
% cnf(632,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[618,149,theory(equality)]),165,theory(equality)])).
% cnf(633,plain,(join(complement(converse(X1)),composition(X2,complement(converse(composition(X1,X2)))))=complement(converse(X1))),inference(rw,[status(thm)],[619,21,theory(equality)])).
% cnf(639,plain,(join(complement(X1),join(complement(X1),complement(complement(X1))))=top),inference(spm,[status(thm)],[70,632,theory(equality)])).
% cnf(643,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[632,227,theory(equality)])).
% cnf(646,plain,(join(complement(X1),top)=top),inference(rw,[status(thm)],[639,39,theory(equality)])).
% cnf(651,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[19,643,theory(equality)])).
% cnf(658,plain,(join(top,complement(X1))=top),inference(rw,[status(thm)],[646,17,theory(equality)])).
% cnf(665,plain,(top=join(X1,top)),inference(rw,[status(thm)],[307,658,theory(equality)])).
% cnf(676,plain,(top=join(top,X1)),inference(spm,[status(thm)],[17,665,theory(equality)])).
% cnf(697,plain,(top=converse(top)),inference(spm,[status(thm)],[107,676,theory(equality)])).
% cnf(706,plain,(join(X1,join(complement(X1),X2))=top),inference(rw,[status(thm)],[77,676,theory(equality)])).
% cnf(727,plain,(converse(composition(top,X1))=composition(converse(X1),top)),inference(spm,[status(thm)],[55,697,theory(equality)])).
% cnf(737,negated_conjecture,(join(one,converse(complement(esk1_0)))=top),inference(rw,[status(thm)],[inference(rw,[status(thm)],[252,697,theory(equality)]),665,theory(equality)])).
% cnf(913,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[33,17,theory(equality)])).
% cnf(924,plain,(join(complement(join(complement(X1),complement(X1))),complement(top))=X1),inference(spm,[status(thm)],[913,39,theory(equality)])).
% cnf(939,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[924,632,theory(equality)]),227,theory(equality)])).
% cnf(946,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[939,17,theory(equality)])).
% cnf(969,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[651,946,theory(equality)])).
% cnf(991,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[17,969,theory(equality)])).
% cnf(998,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[946,969,theory(equality)])).
% cnf(1026,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[632,998,theory(equality)])).
% cnf(1052,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[19,1026,theory(equality)])).
% cnf(1528,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[1052,913,theory(equality)])).
% cnf(1553,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[1052,17,theory(equality)])).
% cnf(2178,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[1528,17,theory(equality)])).
% cnf(2213,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[2178,1553,theory(equality)])).
% cnf(2286,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[2213,998,theory(equality)])).
% cnf(14710,plain,(join(X2,composition(X1,X2))=composition(join(X1,one),X2)),inference(rw,[status(thm)],[385,17,theory(equality)])).
% cnf(14775,plain,(join(X1,composition(top,X1))=composition(top,X1)),inference(spm,[status(thm)],[14710,676,theory(equality)])).
% cnf(15875,plain,(converse(composition(top,converse(X1)))=join(X1,converse(composition(top,converse(X1))))),inference(spm,[status(thm)],[52,14775,theory(equality)])).
% cnf(15922,plain,(composition(X1,top)=join(X1,converse(composition(top,converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[15875,56,theory(equality)]),697,theory(equality)])).
% cnf(15923,plain,(composition(X1,top)=join(X1,composition(X1,top))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[15922,56,theory(equality)]),697,theory(equality)])).
% cnf(15959,plain,(join(X1,composition(complement(X1),top))=top),inference(spm,[status(thm)],[706,15923,theory(equality)])).
% cnf(16377,plain,(join(complement(X1),composition(X1,top))=top),inference(spm,[status(thm)],[15959,998,theory(equality)])).
% cnf(16542,plain,(join(top,X2)=join(complement(X1),join(composition(X1,top),X2))),inference(spm,[status(thm)],[19,16377,theory(equality)])).
% cnf(16588,plain,(top=join(complement(X1),join(composition(X1,top),X2))),inference(rw,[status(thm)],[16542,676,theory(equality)])).
% cnf(21560,plain,(join(complement(X1),composition(join(X1,X2),top))=top),inference(spm,[status(thm)],[16588,35,theory(equality)])).
% cnf(27696,negated_conjecture,(join(X1,composition(esk1_0,X1))=composition(one,X1)),inference(spm,[status(thm)],[389,48,theory(equality)])).
% cnf(27721,negated_conjecture,(join(X1,composition(converse(esk1_0),X1))=composition(one,X1)),inference(spm,[status(thm)],[389,195,theory(equality)])).
% cnf(27723,negated_conjecture,(join(X1,composition(converse(complement(esk1_0)),X1))=composition(top,X1)),inference(spm,[status(thm)],[389,737,theory(equality)])).
% cnf(27884,negated_conjecture,(join(X1,composition(esk1_0,X1))=X1),inference(rw,[status(thm)],[27696,165,theory(equality)])).
% cnf(27906,negated_conjecture,(join(X1,composition(converse(esk1_0),X1))=X1),inference(rw,[status(thm)],[27721,165,theory(equality)])).
% cnf(28006,negated_conjecture,(join(X1,X2)=join(X1,join(composition(esk1_0,X1),X2))),inference(spm,[status(thm)],[19,27884,theory(equality)])).
% cnf(28161,negated_conjecture,(converse(converse(X1))=join(X1,converse(composition(converse(esk1_0),converse(X1))))),inference(spm,[status(thm)],[52,27906,theory(equality)])).
% cnf(28255,negated_conjecture,(X1=join(X1,converse(composition(converse(esk1_0),converse(X1))))),inference(rw,[status(thm)],[28161,21,theory(equality)])).
% cnf(28256,negated_conjecture,(X1=join(X1,composition(X1,esk1_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[28255,27,theory(equality)]),21,theory(equality)])).
% cnf(28355,negated_conjecture,(join(X1,X2)=join(X2,join(X1,composition(X2,esk1_0)))),inference(spm,[status(thm)],[82,28256,theory(equality)])).
% cnf(31618,plain,(converse(composition(join(converse(X1),converse(X3)),converse(X2)))=join(composition(converse(converse(X2)),X1),converse(converse(composition(X2,X3))))),inference(spm,[status(thm)],[126,386,theory(equality)])).
% cnf(31705,plain,(composition(X2,join(X1,X3))=join(composition(converse(converse(X2)),X1),converse(converse(composition(X2,X3))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[31618,23,theory(equality)]),27,theory(equality)]),21,theory(equality)])).
% cnf(31706,plain,(composition(X2,join(X1,X3))=join(composition(X2,X1),composition(X2,X3))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[31705,21,theory(equality)]),21,theory(equality)])).
% cnf(35029,negated_conjecture,(join(X1,composition(esk1_0,join(X1,X2)))=join(X1,composition(esk1_0,X2))),inference(spm,[status(thm)],[28006,31706,theory(equality)])).
% cnf(38803,negated_conjecture,(join(converse(complement(esk1_0)),composition(top,esk1_0))=join(esk1_0,converse(complement(esk1_0)))),inference(spm,[status(thm)],[28355,27723,theory(equality)])).
% cnf(45494,negated_conjecture,(join(composition(top,esk1_0),converse(complement(esk1_0)))=join(esk1_0,converse(complement(esk1_0)))),inference(rw,[status(thm)],[38803,17,theory(equality)])).
% cnf(45520,negated_conjecture,(converse(join(esk1_0,converse(complement(esk1_0))))=join(converse(composition(top,esk1_0)),complement(esk1_0))),inference(spm,[status(thm)],[51,45494,theory(equality)])).
% cnf(45537,negated_conjecture,(join(converse(esk1_0),complement(esk1_0))=join(converse(composition(top,esk1_0)),complement(esk1_0))),inference(rw,[status(thm)],[45520,51,theory(equality)])).
% cnf(45538,negated_conjecture,(join(converse(esk1_0),complement(esk1_0))=join(composition(converse(esk1_0),top),complement(esk1_0))),inference(rw,[status(thm)],[45537,727,theory(equality)])).
% cnf(50076,negated_conjecture,(join(complement(esk1_0),composition(converse(esk1_0),top))=join(converse(esk1_0),complement(esk1_0))),inference(rw,[status(thm)],[45538,17,theory(equality)])).
% cnf(50077,negated_conjecture,(join(complement(esk1_0),composition(converse(esk1_0),top))=join(complement(esk1_0),converse(esk1_0))),inference(rw,[status(thm)],[50076,17,theory(equality)])).
% cnf(59254,plain,(join(complement(converse(top)),composition(X1,complement(composition(converse(X1),top))))=complement(converse(top))),inference(spm,[status(thm)],[633,727,theory(equality)])).
% cnf(59389,plain,(composition(X1,complement(composition(converse(X1),top)))=complement(converse(top))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[59254,697,theory(equality)]),227,theory(equality)]),969,theory(equality)])).
% cnf(59390,plain,(composition(X1,complement(composition(converse(X1),top)))=zero),inference(rw,[status(thm)],[inference(rw,[status(thm)],[59389,697,theory(equality)]),227,theory(equality)])).
% cnf(67713,negated_conjecture,(join(X1,composition(esk1_0,top))=join(X1,composition(esk1_0,complement(X1)))),inference(spm,[status(thm)],[35029,39,theory(equality)])).
% cnf(68198,negated_conjecture,(join(composition(converse(esk1_0),top),zero)=join(composition(converse(esk1_0),top),composition(esk1_0,top))),inference(spm,[status(thm)],[67713,59390,theory(equality)])).
% cnf(68305,negated_conjecture,(composition(converse(esk1_0),top)=join(composition(converse(esk1_0),top),composition(esk1_0,top))),inference(rw,[status(thm)],[68198,991,theory(equality)])).
% cnf(68306,negated_conjecture,(composition(converse(esk1_0),top)=composition(join(esk1_0,converse(esk1_0)),top)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[68305,35,theory(equality)]),17,theory(equality)])).
% cnf(69093,negated_conjecture,(join(complement(esk1_0),composition(converse(esk1_0),top))=top),inference(spm,[status(thm)],[21560,68306,theory(equality)])).
% cnf(69141,negated_conjecture,(join(complement(esk1_0),converse(esk1_0))=top),inference(rw,[status(thm)],[69093,50077,theory(equality)])).
% cnf(69176,negated_conjecture,(join(complement(top),complement(join(complement(esk1_0),complement(converse(esk1_0)))))=esk1_0),inference(spm,[status(thm)],[913,69141,theory(equality)])).
% cnf(69231,negated_conjecture,(complement(join(complement(esk1_0),complement(converse(esk1_0))))=esk1_0),inference(rw,[status(thm)],[inference(rw,[status(thm)],[69176,227,theory(equality)]),969,theory(equality)])).
% cnf(73058,negated_conjecture,(join(complement(complement(converse(esk1_0))),esk1_0)=complement(complement(converse(esk1_0)))),inference(spm,[status(thm)],[2286,69231,theory(equality)])).
% cnf(73108,negated_conjecture,(join(esk1_0,converse(esk1_0))=complement(complement(converse(esk1_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[73058,998,theory(equality)]),17,theory(equality)])).
% cnf(73109,negated_conjecture,(join(esk1_0,converse(esk1_0))=converse(esk1_0)),inference(rw,[status(thm)],[73108,998,theory(equality)])).
% cnf(73144,negated_conjecture,(converse(converse(esk1_0))=join(converse(esk1_0),esk1_0)),inference(spm,[status(thm)],[51,73109,theory(equality)])).
% cnf(73174,negated_conjecture,(esk1_0=join(converse(esk1_0),esk1_0)),inference(rw,[status(thm)],[73144,21,theory(equality)])).
% cnf(73175,negated_conjecture,(esk1_0=converse(esk1_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[73174,17,theory(equality)]),73109,theory(equality)])).
% cnf(73176,negated_conjecture,($false),inference(sr,[status(thm)],[73175,45,theory(equality)])).
% cnf(73177,negated_conjecture,($false),73176,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1801
% # ...of these trivial : 1055
% # ...subsumed : 239
% # ...remaining for further processing: 507
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 93
% # Generated clauses : 36919
% # ...of the previous two non-trivial : 15792
% # Contextual simplify-reflections : 0
% # Paramodulations : 36919
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 414
% # Positive orientable unit clauses: 406
% # Positive unorientable unit clauses: 7
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 12720
% # ...number of literals in the above : 12720
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 62
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1910
% # Indexed BW rewrite successes : 337
% # Backwards rewriting index: 455 leaves, 1.89+/-1.721 terms/leaf
% # Paramod-from index: 221 leaves, 1.89+/-1.642 terms/leaf
% # Paramod-into index: 420 leaves, 1.89+/-1.730 terms/leaf
% # -------------------------------------------------
% # User time : 0.691 s
% # System time : 0.043 s
% # Total time : 0.734 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.64 CPU 1.74 WC
% FINAL PrfWatch: 1.64 CPU 1.74 WC
% SZS output end Solution for /tmp/SystemOnTPTP3738/REL025+1.tptp
%
%------------------------------------------------------------------------------