TSTP Solution File: REL019+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL019+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 : art09.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:42:04 EST 2010
% Result : Theorem 16.64s
% Output : Solution 16.64s
% 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/SystemOnTPTP3910/REL019+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3910/REL019+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3910/REL019+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 4006
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% PrfWatch: 3.91 CPU 4.01 WC
% PrfWatch: 5.90 CPU 6.02 WC
% # Preprocessing time : 0.010 s
% PrfWatch: 7.90 CPU 8.03 WC
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 9.87 CPU 10.03 WC
% PrfWatch: 11.86 CPU 12.04 WC
% PrfWatch: 13.86 CPU 14.04 WC
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(3, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(4, axiom,![X1]:![X2]:![X3]:join(X1,join(X2,X3))=join(join(X1,X2),X3),file('/tmp/SRASS.s.p', maddux2_join_associativity)).
% fof(5, 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(6, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(7, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(8, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(9, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(10, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(11, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% 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]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(14, conjecture,![X1]:![X2]:((composition(X1,top)=X1&composition(X2,top)=X2)=>composition(meet(X1,X2),top)=meet(X1,X2)),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:![X2]:((composition(X1,top)=X1&composition(X2,top)=X2)=>composition(meet(X1,X2),top)=meet(X1,X2))),inference(assume_negation,[status(cth)],[14])).
% fof(18, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[7])).
% cnf(29,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[8])).
% cnf(31,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[9])).
% cnf(33,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[10])).
% cnf(35,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[11])).
% cnf(37,plain,(zero=meet(X1,complement(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]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[13])).
% cnf(41,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[40])).
% fof(42, negated_conjecture,?[X1]:?[X2]:((composition(X1,top)=X1&composition(X2,top)=X2)&~(composition(meet(X1,X2),top)=meet(X1,X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X3]:?[X4]:((composition(X3,top)=X3&composition(X4,top)=X4)&~(composition(meet(X3,X4),top)=meet(X3,X4))),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,((composition(esk1_0,top)=esk1_0&composition(esk2_0,top)=esk2_0)&~(composition(meet(esk1_0,esk2_0),top)=meet(esk1_0,esk2_0))),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(composition(meet(esk1_0,esk2_0),top)!=meet(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,negated_conjecture,(composition(esk2_0,top)=esk2_0),inference(split_conjunct,[status(thm)],[44])).
% cnf(47,negated_conjecture,(composition(esk1_0,top)=esk1_0),inference(split_conjunct,[status(thm)],[44])).
% cnf(48,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[37,33,theory(equality)]),['unfolding']).
% cnf(49,negated_conjecture,(composition(complement(join(complement(esk1_0),complement(esk2_0))),top)!=complement(join(complement(esk1_0),complement(esk2_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[45,33,theory(equality)]),33,theory(equality)]),['unfolding']).
% cnf(50,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[31,27,theory(equality)])).
% cnf(51,plain,(composition(X1,converse(X2))=converse(composition(X2,converse(X1)))),inference(spm,[status(thm)],[31,27,theory(equality)])).
% cnf(55,plain,(join(X1,converse(X2))=converse(join(converse(X1),X2))),inference(spm,[status(thm)],[39,27,theory(equality)])).
% cnf(63,plain,(join(converse(X1),composition(converse(X3),X2))=converse(join(X1,composition(converse(X2),X3)))),inference(spm,[status(thm)],[39,50,theory(equality)])).
% cnf(65,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[50,35,theory(equality)])).
% cnf(69,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[65,27,theory(equality)])).
% cnf(72,plain,(one=converse(one)),inference(spm,[status(thm)],[35,69,theory(equality)])).
% cnf(83,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[69,72,theory(equality)])).
% cnf(103,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[29,23,theory(equality)])).
% cnf(108,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[23,29,theory(equality)])).
% cnf(160,plain,(complement(top)=zero),inference(rw,[status(thm)],[48,29,theory(equality)])).
% cnf(260,plain,(converse(top)=join(X1,converse(complement(converse(X1))))),inference(spm,[status(thm)],[55,29,theory(equality)])).
% cnf(296,plain,(join(X1,top)=join(top,complement(complement(X1)))),inference(spm,[status(thm)],[108,29,theory(equality)])).
% cnf(377,plain,(join(composition(X1,X2),X2)=composition(join(X1,one),X2)),inference(spm,[status(thm)],[19,83,theory(equality)])).
% cnf(547,plain,(join(X1,join(X2,complement(join(X2,X1))))=top),inference(spm,[status(thm)],[103,21,theory(equality)])).
% cnf(680,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[41,21,theory(equality)])).
% cnf(686,negated_conjecture,(join(complement(top),composition(converse(esk2_0),complement(esk2_0)))=complement(top)),inference(spm,[status(thm)],[680,46,theory(equality)])).
% cnf(688,negated_conjecture,(join(complement(top),composition(converse(esk1_0),complement(esk1_0)))=complement(top)),inference(spm,[status(thm)],[680,47,theory(equality)])).
% cnf(690,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[680,83,theory(equality)])).
% cnf(711,negated_conjecture,(join(zero,composition(converse(esk2_0),complement(esk2_0)))=complement(top)),inference(rw,[status(thm)],[686,160,theory(equality)])).
% cnf(712,negated_conjecture,(join(zero,composition(converse(esk2_0),complement(esk2_0)))=zero),inference(rw,[status(thm)],[711,160,theory(equality)])).
% cnf(713,negated_conjecture,(join(zero,composition(converse(esk1_0),complement(esk1_0)))=complement(top)),inference(rw,[status(thm)],[688,160,theory(equality)])).
% cnf(714,negated_conjecture,(join(zero,composition(converse(esk1_0),complement(esk1_0)))=zero),inference(rw,[status(thm)],[713,160,theory(equality)])).
% cnf(715,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[690,72,theory(equality)]),83,theory(equality)])).
% cnf(730,plain,(join(complement(X1),join(complement(X1),complement(complement(X1))))=top),inference(spm,[status(thm)],[103,715,theory(equality)])).
% cnf(737,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[715,160,theory(equality)])).
% cnf(740,plain,(join(complement(X1),top)=top),inference(rw,[status(thm)],[730,29,theory(equality)])).
% cnf(750,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[23,737,theory(equality)])).
% cnf(761,plain,(join(top,complement(X1))=top),inference(rw,[status(thm)],[740,21,theory(equality)])).
% cnf(771,plain,(top=join(X1,top)),inference(rw,[status(thm)],[296,761,theory(equality)])).
% cnf(784,plain,(top=join(top,X1)),inference(spm,[status(thm)],[21,771,theory(equality)])).
% cnf(809,plain,(top=converse(top)),inference(spm,[status(thm)],[260,784,theory(equality)])).
% cnf(819,plain,(join(X1,join(complement(X1),X2))=top),inference(rw,[status(thm)],[108,784,theory(equality)])).
% cnf(842,plain,(composition(top,converse(X1))=converse(composition(X1,top))),inference(spm,[status(thm)],[31,809,theory(equality)])).
% cnf(851,plain,(join(X1,converse(complement(converse(X1))))=top),inference(rw,[status(thm)],[260,809,theory(equality)])).
% cnf(923,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[25,21,theory(equality)])).
% cnf(934,plain,(join(complement(join(complement(X1),complement(X1))),complement(top))=X1),inference(spm,[status(thm)],[923,29,theory(equality)])).
% cnf(950,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[934,715,theory(equality)]),160,theory(equality)])).
% cnf(971,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[950,21,theory(equality)])).
% cnf(1083,plain,(join(join(complement(X1),X2),X1)=top),inference(spm,[status(thm)],[819,923,theory(equality)])).
% cnf(1105,plain,(join(complement(X1),join(X2,X1))=top),inference(rw,[status(thm)],[1083,23,theory(equality)])).
% cnf(1135,plain,(join(complement(X1),join(X1,X2))=top),inference(spm,[status(thm)],[1105,21,theory(equality)])).
% cnf(1167,plain,(join(complement(zero),X1)=top),inference(spm,[status(thm)],[1135,971,theory(equality)])).
% cnf(1223,plain,(top=complement(zero)),inference(spm,[status(thm)],[715,1167,theory(equality)])).
% cnf(1381,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[750,971,theory(equality)])).
% cnf(1403,plain,(converse(complement(converse(zero)))=top),inference(spm,[status(thm)],[851,1381,theory(equality)])).
% cnf(1414,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[21,1381,theory(equality)])).
% cnf(1424,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[971,1381,theory(equality)])).
% cnf(1509,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[715,1424,theory(equality)])).
% cnf(1567,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[23,1509,theory(equality)])).
% cnf(1615,plain,(converse(top)=complement(converse(zero))),inference(spm,[status(thm)],[27,1403,theory(equality)])).
% cnf(1628,plain,(top=complement(converse(zero))),inference(rw,[status(thm)],[1615,809,theory(equality)])).
% cnf(1639,plain,(join(complement(join(top,X1)),complement(join(top,complement(X1))))=converse(zero)),inference(spm,[status(thm)],[923,1628,theory(equality)])).
% cnf(1650,plain,(zero=converse(zero)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1639,784,theory(equality)]),160,theory(equality)]),784,theory(equality)]),160,theory(equality)]),1381,theory(equality)])).
% cnf(1711,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[1567,923,theory(equality)])).
% cnf(1725,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[1567,21,theory(equality)])).
% cnf(2121,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[1711,21,theory(equality)])).
% cnf(2154,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[2121,1725,theory(equality)])).
% cnf(2211,plain,(join(X1,X3)=join(X1,join(complement(join(X2,complement(X1))),X3))),inference(spm,[status(thm)],[23,2154,theory(equality)])).
% cnf(2223,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[2154,1424,theory(equality)])).
% cnf(2274,negated_conjecture,(composition(converse(esk2_0),complement(esk2_0))=zero),inference(rw,[status(thm)],[712,1381,theory(equality)])).
% cnf(2279,negated_conjecture,(converse(zero)=composition(converse(complement(esk2_0)),esk2_0)),inference(spm,[status(thm)],[50,2274,theory(equality)])).
% cnf(2286,negated_conjecture,(zero=composition(converse(complement(esk2_0)),esk2_0)),inference(rw,[status(thm)],[2279,1650,theory(equality)])).
% cnf(2291,negated_conjecture,(join(complement(esk2_0),composition(converse(converse(complement(esk2_0))),complement(zero)))=complement(esk2_0)),inference(spm,[status(thm)],[680,2286,theory(equality)])).
% cnf(2297,negated_conjecture,(join(complement(esk2_0),composition(complement(esk2_0),top))=complement(esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2291,27,theory(equality)]),1223,theory(equality)])).
% cnf(2304,negated_conjecture,(composition(converse(esk1_0),complement(esk1_0))=zero),inference(rw,[status(thm)],[714,1381,theory(equality)])).
% cnf(2309,negated_conjecture,(converse(zero)=composition(converse(complement(esk1_0)),esk1_0)),inference(spm,[status(thm)],[50,2304,theory(equality)])).
% cnf(2316,negated_conjecture,(zero=composition(converse(complement(esk1_0)),esk1_0)),inference(rw,[status(thm)],[2309,1650,theory(equality)])).
% cnf(2417,negated_conjecture,(join(complement(esk1_0),composition(converse(converse(complement(esk1_0))),complement(zero)))=complement(esk1_0)),inference(spm,[status(thm)],[680,2316,theory(equality)])).
% cnf(2424,negated_conjecture,(join(complement(esk1_0),composition(complement(esk1_0),top))=complement(esk1_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2417,27,theory(equality)]),1223,theory(equality)])).
% cnf(3761,plain,(converse(complement(X1))=join(converse(complement(X1)),composition(converse(complement(composition(X2,X1))),X2))),inference(spm,[status(thm)],[63,680,theory(equality)])).
% cnf(14633,plain,(join(X2,composition(X1,X2))=composition(join(X1,one),X2)),inference(rw,[status(thm)],[377,21,theory(equality)])).
% cnf(14708,plain,(join(X1,composition(top,X1))=composition(top,X1)),inference(spm,[status(thm)],[14633,784,theory(equality)])).
% cnf(14914,plain,(converse(composition(top,converse(X1)))=join(X1,converse(composition(top,converse(X1))))),inference(spm,[status(thm)],[55,14708,theory(equality)])).
% cnf(14997,plain,(composition(X1,top)=join(X1,converse(composition(top,converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[14914,51,theory(equality)]),809,theory(equality)])).
% cnf(14998,plain,(composition(X1,top)=join(X1,composition(X1,top))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[14997,51,theory(equality)]),809,theory(equality)])).
% cnf(15178,negated_conjecture,(composition(complement(esk1_0),top)=complement(esk1_0)),inference(rw,[status(thm)],[2424,14998,theory(equality)])).
% cnf(15179,negated_conjecture,(composition(complement(esk2_0),top)=complement(esk2_0)),inference(rw,[status(thm)],[2297,14998,theory(equality)])).
% cnf(15247,negated_conjecture,(join(complement(esk1_0),composition(X1,top))=composition(join(complement(esk1_0),X1),top)),inference(spm,[status(thm)],[19,15178,theory(equality)])).
% cnf(22018,negated_conjecture,(converse(join(complement(esk1_0),composition(X1,top)))=composition(top,converse(join(complement(esk1_0),X1)))),inference(spm,[status(thm)],[842,15247,theory(equality)])).
% cnf(101744,negated_conjecture,(converse(join(complement(esk1_0),complement(esk2_0)))=composition(top,converse(join(complement(esk1_0),complement(esk2_0))))),inference(spm,[status(thm)],[22018,15179,theory(equality)])).
% cnf(105544,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),complement(complement(X1)))))),inference(spm,[status(thm)],[2211,923,theory(equality)])).
% cnf(105955,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),X1)))),inference(rw,[status(thm)],[105544,1424,theory(equality)])).
% cnf(107182,plain,(join(X1,complement(join(X2,X1)))=join(X1,complement(X2))),inference(spm,[status(thm)],[105955,1424,theory(equality)])).
% cnf(107995,plain,(join(join(X1,complement(join(X1,X2))),complement(top))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(spm,[status(thm)],[107182,547,theory(equality)])).
% cnf(108371,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)],[107995,160,theory(equality)]),23,theory(equality)]),1414,theory(equality)])).
% cnf(108372,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[108371,23,theory(equality)]),21,theory(equality)]),2223,theory(equality)])).
% cnf(108734,plain,(join(X1,complement(top))=join(X1,complement(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[108372,851,theory(equality)])).
% cnf(109104,plain,(X1=join(X1,complement(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[108734,160,theory(equality)]),1414,theory(equality)])).
% cnf(109278,plain,(converse(converse(X1))=join(X1,converse(complement(converse(complement(converse(converse(X1)))))))),inference(spm,[status(thm)],[55,109104,theory(equality)])).
% cnf(109515,plain,(X1=join(X1,converse(complement(converse(complement(converse(converse(X1)))))))),inference(rw,[status(thm)],[109278,27,theory(equality)])).
% cnf(109516,plain,(X1=join(X1,converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[109515,27,theory(equality)])).
% cnf(109913,plain,(join(complement(X1),converse(complement(converse(X1))))=complement(X1)),inference(spm,[status(thm)],[109516,1424,theory(equality)])).
% cnf(112150,plain,(join(complement(converse(complement(converse(X1)))),complement(complement(X1)))=complement(converse(complement(converse(X1))))),inference(spm,[status(thm)],[2223,109913,theory(equality)])).
% cnf(112267,plain,(X1=complement(converse(complement(converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[112150,1424,theory(equality)]),21,theory(equality)]),109104,theory(equality)])).
% cnf(112329,plain,(complement(X1)=converse(complement(converse(X1)))),inference(spm,[status(thm)],[1424,112267,theory(equality)])).
% cnf(112500,plain,(converse(complement(X1))=complement(converse(X1))),inference(spm,[status(thm)],[27,112329,theory(equality)])).
% cnf(612283,plain,(join(complement(converse(X1)),composition(complement(converse(composition(X2,X1))),X2))=converse(complement(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3761,112500,theory(equality)]),112500,theory(equality)])).
% cnf(612284,plain,(join(complement(converse(X1)),composition(complement(converse(composition(X2,X1))),X2))=complement(converse(X1))),inference(rw,[status(thm)],[612283,112500,theory(equality)])).
% cnf(612613,negated_conjecture,(join(complement(converse(converse(join(complement(esk1_0),complement(esk2_0))))),composition(complement(converse(converse(join(complement(esk1_0),complement(esk2_0))))),top))=complement(converse(converse(join(complement(esk1_0),complement(esk2_0)))))),inference(spm,[status(thm)],[612284,101744,theory(equality)])).
% cnf(613800,negated_conjecture,(composition(complement(join(complement(esk1_0),complement(esk2_0))),top)=complement(converse(converse(join(complement(esk1_0),complement(esk2_0)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[612613,27,theory(equality)]),27,theory(equality)]),14998,theory(equality)])).
% cnf(613801,negated_conjecture,(composition(complement(join(complement(esk1_0),complement(esk2_0))),top)=complement(join(complement(esk1_0),complement(esk2_0)))),inference(rw,[status(thm)],[613800,27,theory(equality)])).
% cnf(613802,negated_conjecture,($false),inference(sr,[status(thm)],[613801,49,theory(equality)])).
% cnf(613803,negated_conjecture,($false),613802,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 7592
% # ...of these trivial : 4770
% # ...subsumed : 844
% # ...remaining for further processing: 1978
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 558
% # Generated clauses : 305030
% # ...of the previous two non-trivial : 139577
% # Contextual simplify-reflections : 0
% # Paramodulations : 305030
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1420
% # Positive orientable unit clauses: 1411
% # Positive unorientable unit clauses: 8
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 106846
% # ...number of literals in the above : 106846
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 53
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7371
% # Indexed BW rewrite successes : 521
% # Backwards rewriting index: 1083 leaves, 2.46+/-3.000 terms/leaf
% # Paramod-from index: 632 leaves, 2.25+/-2.406 terms/leaf
% # Paramod-into index: 991 leaves, 2.42+/-2.890 terms/leaf
% # -------------------------------------------------
% # User time : 7.454 s
% # System time : 0.343 s
% # Total time : 7.797 s
% # Maximum resident set size: 0 pages
% PrfWatch: 15.81 CPU 16.01 WC
% FINAL PrfWatch: 15.81 CPU 16.01 WC
% SZS output end Solution for /tmp/SystemOnTPTP3910/REL019+1.tptp
%
%------------------------------------------------------------------------------