TSTP Solution File: REL044+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL044+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 : 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 22:02:16 EST 2010
% Result : Theorem 2.37s
% Output : Solution 2.37s
% 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/SystemOnTPTP13891/REL044+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13891/REL044+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13891/REL044+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 13987
% 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]:![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(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]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(7, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% 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]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(11, axiom,![X1]:![X2]:![X3]:join(meet(composition(X1,X2),X3),meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3))=meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3),file('/tmp/SRASS.s.p', modular_law_1)).
% 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]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(15, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(16, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(17, conjecture,![X1]:![X2]:![X3]:(join(composition(complement(X1),X2),complement(X3))=complement(X3)=>join(composition(X3,converse(X2)),X1)=X1),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:![X2]:![X3]:(join(composition(complement(X1),X2),complement(X3))=complement(X3)=>join(composition(X3,converse(X2)),X1)=X1)),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,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[3])).
% cnf(24,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[23])).
% 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,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(30,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[7])).
% cnf(32,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[8])).
% cnf(34,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[9])).
% cnf(36,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[35])).
% fof(39, plain,![X4]:![X5]:![X6]:join(meet(composition(X4,X5),X6),meet(composition(X4,meet(X5,composition(converse(X4),X6))),X6))=meet(composition(X4,meet(X5,composition(converse(X4),X6))),X6),inference(variable_rename,[status(thm)],[11])).
% cnf(40,plain,(join(meet(composition(X1,X2),X3),meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3))=meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3)),inference(split_conjunct,[status(thm)],[39])).
% 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]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[14])).
% cnf(46,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[15])).
% cnf(48,plain,(composition(X1,one)=X1),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]:?[X3]:(join(composition(complement(X1),X2),complement(X3))=complement(X3)&~(join(composition(X3,converse(X2)),X1)=X1)),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,?[X4]:?[X5]:?[X6]:(join(composition(complement(X4),X5),complement(X6))=complement(X6)&~(join(composition(X6,converse(X5)),X4)=X4)),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,(join(composition(complement(esk1_0),esk2_0),complement(esk3_0))=complement(esk3_0)&~(join(composition(esk3_0,converse(esk2_0)),esk1_0)=esk1_0)),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(join(composition(esk3_0,converse(esk2_0)),esk1_0)!=esk1_0),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,negated_conjecture,(join(composition(complement(esk1_0),esk2_0),complement(esk3_0))=complement(esk3_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[50,44,theory(equality)]),['unfolding']).
% cnf(57,plain,(join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3))))=complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[40,44,theory(equality)]),44,theory(equality)]),44,theory(equality)]),44,theory(equality)]),44,theory(equality)]),['unfolding']).
% cnf(60,negated_conjecture,(join(esk1_0,composition(esk3_0,converse(esk2_0)))!=esk1_0),inference(rw,[status(thm)],[54,20,theory(equality)])).
% cnf(62,plain,(converse(top)=join(converse(X1),converse(complement(X1)))),inference(spm,[status(thm)],[32,46,theory(equality)])).
% cnf(69,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[34,48,theory(equality)])).
% cnf(71,plain,(complement(top)=zero),inference(rw,[status(thm)],[56,46,theory(equality)])).
% cnf(73,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[46,22,theory(equality)])).
% cnf(78,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[22,46,theory(equality)])).
% cnf(79,plain,(join(join(X2,X1),X3)=join(X1,join(X2,X3))),inference(spm,[status(thm)],[22,20,theory(equality)])).
% cnf(85,plain,(join(X2,join(X1,X3))=join(X1,join(X2,X3))),inference(rw,[status(thm)],[79,22,theory(equality)])).
% cnf(112,negated_conjecture,(join(complement(esk3_0),composition(complement(esk1_0),esk2_0))=complement(esk3_0)),inference(rw,[status(thm)],[55,20,theory(equality)])).
% cnf(118,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[36,20,theory(equality)])).
% cnf(135,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[24,20,theory(equality)])).
% cnf(148,plain,(join(complement(join(X2,complement(X1))),complement(join(complement(X1),complement(X2))))=X1),inference(spm,[status(thm)],[135,20,theory(equality)])).
% cnf(154,plain,(join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))))))=complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3)))),inference(rw,[status(thm)],[57,20,theory(equality)])).
% cnf(155,plain,(join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))))))=complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3))))))))),inference(rw,[status(thm)],[154,20,theory(equality)])).
% cnf(159,plain,(join(complement(complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3))))))))),complement(join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3))))))))))))=join(complement(composition(X1,X2)),complement(X3))),inference(spm,[status(thm)],[135,155,theory(equality)])).
% cnf(161,plain,(join(complement(join(complement(composition(converse(X1),X2)),complement(X3))),complement(join(complement(X3),complement(composition(converse(X1),complement(join(complement(X2),complement(composition(X1,X3)))))))))=complement(join(complement(X3),complement(composition(converse(X1),complement(join(complement(X2),complement(composition(X1,X3))))))))),inference(spm,[status(thm)],[155,30,theory(equality)])).
% cnf(298,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[69,30,theory(equality)])).
% cnf(315,plain,(one=converse(one)),inference(spm,[status(thm)],[48,298,theory(equality)])).
% cnf(346,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[298,315,theory(equality)])).
% cnf(360,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[118,346,theory(equality)])).
% cnf(372,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[360,315,theory(equality)]),346,theory(equality)])).
% cnf(377,plain,(join(one,converse(complement(one)))=converse(top)),inference(spm,[status(thm)],[62,315,theory(equality)])).
% cnf(390,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[135,372,theory(equality)])).
% cnf(399,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[372,71,theory(equality)])).
% cnf(403,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[390,46,theory(equality)]),71,theory(equality)])).
% cnf(415,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[22,399,theory(equality)])).
% cnf(421,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[403,20,theory(equality)])).
% cnf(469,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[415,421,theory(equality)])).
% cnf(479,plain,(complement(zero)=top),inference(spm,[status(thm)],[46,469,theory(equality)])).
% cnf(480,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[20,469,theory(equality)])).
% cnf(489,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[421,469,theory(equality)])).
% cnf(513,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[372,489,theory(equality)])).
% cnf(537,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[22,513,theory(equality)])).
% cnf(586,plain,(join(converse(X1),converse(top))=converse(top)),inference(spm,[status(thm)],[537,62,theory(equality)])).
% cnf(590,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[537,135,theory(equality)])).
% cnf(595,plain,(join(X1,top)=top),inference(spm,[status(thm)],[537,46,theory(equality)])).
% cnf(596,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[537,20,theory(equality)])).
% cnf(620,plain,(top=join(top,X1)),inference(spm,[status(thm)],[20,595,theory(equality)])).
% cnf(623,plain,(composition(top,X2)=join(composition(X1,X2),composition(top,X2))),inference(spm,[status(thm)],[28,595,theory(equality)])).
% cnf(716,plain,(join(X1,converse(top))=converse(top)),inference(spm,[status(thm)],[586,30,theory(equality)])).
% cnf(725,plain,(converse(top)=top),inference(spm,[status(thm)],[620,716,theory(equality)])).
% cnf(748,plain,(join(one,converse(complement(one)))=top),inference(rw,[status(thm)],[377,725,theory(equality)])).
% cnf(749,plain,(join(converse(X1),converse(complement(X1)))=top),inference(rw,[status(thm)],[62,725,theory(equality)])).
% cnf(757,plain,(composition(top,X1)=join(composition(one,X1),composition(converse(complement(one)),X1))),inference(spm,[status(thm)],[28,748,theory(equality)])).
% cnf(762,plain,(composition(top,X1)=join(X1,composition(converse(complement(one)),X1))),inference(rw,[status(thm)],[757,346,theory(equality)])).
% cnf(873,plain,(join(X1,join(complement(X1),X2))=top),inference(rw,[status(thm)],[78,620,theory(equality)])).
% cnf(899,plain,(join(join(complement(X1),X2),X1)=top),inference(spm,[status(thm)],[873,135,theory(equality)])).
% cnf(924,plain,(join(complement(X1),join(X2,X1))=top),inference(rw,[status(thm)],[899,22,theory(equality)])).
% cnf(1126,negated_conjecture,(join(complement(composition(complement(esk1_0),esk2_0)),complement(esk3_0))=top),inference(spm,[status(thm)],[924,112,theory(equality)])).
% cnf(1189,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[590,20,theory(equality)])).
% cnf(1200,plain,(converse(X1)=join(converse(X1),converse(complement(join(complement(X1),X2))))),inference(spm,[status(thm)],[32,1189,theory(equality)])).
% cnf(1201,plain,(join(X1,X3)=join(X1,join(complement(join(complement(X1),X2)),X3))),inference(spm,[status(thm)],[22,1189,theory(equality)])).
% cnf(1218,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1189,596,theory(equality)])).
% cnf(1286,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1218,489,theory(equality)])).
% cnf(1334,negated_conjecture,(join(complement(esk3_0),complement(composition(complement(esk1_0),esk2_0)))=top),inference(rw,[status(thm)],[1126,20,theory(equality)])).
% cnf(1361,plain,(composition(top,top)=top),inference(spm,[status(thm)],[620,762,theory(equality)])).
% cnf(1386,plain,(join(complement(top),composition(converse(top),complement(top)))=complement(top)),inference(spm,[status(thm)],[118,1361,theory(equality)])).
% cnf(1395,plain,(composition(top,zero)=complement(top)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1386,71,theory(equality)]),725,theory(equality)]),71,theory(equality)]),469,theory(equality)])).
% cnf(1396,plain,(composition(top,zero)=zero),inference(rw,[status(thm)],[1395,71,theory(equality)])).
% cnf(1471,plain,(join(X1,join(X2,complement(join(X2,X1))))=top),inference(spm,[status(thm)],[73,20,theory(equality)])).
% cnf(4181,plain,(join(composition(X1,zero),zero)=zero),inference(spm,[status(thm)],[623,1396,theory(equality)])).
% cnf(4217,plain,(composition(X1,zero)=zero),inference(rw,[status(thm)],[4181,480,theory(equality)])).
% cnf(21152,plain,(join(X1,converse(complement(join(complement(converse(X1)),X2))))=X1),inference(spm,[status(thm)],[1200,30,theory(equality)])).
% cnf(21575,plain,(join(X1,converse(complement(join(X2,complement(converse(X1))))))=X1),inference(spm,[status(thm)],[21152,596,theory(equality)])).
% cnf(24910,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),complement(complement(X1)))))),inference(spm,[status(thm)],[1201,148,theory(equality)])).
% cnf(25038,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),X1)))),inference(rw,[status(thm)],[24910,489,theory(equality)])).
% cnf(25191,plain,(join(X1,complement(join(X2,X1)))=join(X1,complement(X2))),inference(spm,[status(thm)],[25038,489,theory(equality)])).
% cnf(25665,plain,(join(converse(complement(X1)),complement(top))=join(converse(complement(X1)),complement(converse(X1)))),inference(spm,[status(thm)],[25191,749,theory(equality)])).
% cnf(25753,plain,(join(join(X1,complement(join(X1,X2))),complement(top))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(spm,[status(thm)],[25191,1471,theory(equality)])).
% cnf(25868,plain,(converse(complement(X1))=join(converse(complement(X1)),complement(converse(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[25665,71,theory(equality)]),480,theory(equality)])).
% cnf(26000,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)],[25753,71,theory(equality)]),22,theory(equality)]),480,theory(equality)])).
% cnf(26001,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[26000,22,theory(equality)]),20,theory(equality)]),1286,theory(equality)])).
% cnf(26126,plain,(join(converse(X1),complement(top))=join(converse(X1),complement(converse(complement(X1))))),inference(spm,[status(thm)],[26001,749,theory(equality)])).
% cnf(26345,plain,(converse(X1)=join(converse(X1),complement(converse(complement(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[26126,71,theory(equality)]),480,theory(equality)])).
% cnf(26878,plain,(join(complement(X1),converse(complement(converse(X1))))=complement(X1)),inference(spm,[status(thm)],[21575,26345,theory(equality)])).
% cnf(27304,plain,(join(complement(converse(X1)),converse(complement(X1)))=converse(complement(X1))),inference(rw,[status(thm)],[25868,20,theory(equality)])).
% cnf(27522,plain,(join(complement(converse(X1)),converse(complement(X1)))=complement(converse(X1))),inference(spm,[status(thm)],[26878,30,theory(equality)])).
% cnf(27570,plain,(converse(complement(X1))=complement(converse(X1))),inference(rw,[status(thm)],[27522,27304,theory(equality)])).
% cnf(36866,plain,(join(complement(X3),join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(join(complement(X3),join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))))))))=join(complement(composition(X1,X2)),complement(X3))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[159,489,theory(equality)]),489,theory(equality)]),85,theory(equality)]),22,theory(equality)])).
% cnf(38266,negated_conjecture,(join(complement(join(complement(composition(converse(complement(esk1_0)),esk3_0)),complement(esk2_0))),complement(join(complement(esk2_0),complement(composition(converse(complement(esk1_0)),complement(top))))))=complement(join(complement(esk2_0),complement(composition(converse(complement(esk1_0)),complement(top)))))),inference(spm,[status(thm)],[161,1334,theory(equality)])).
% cnf(38499,negated_conjecture,(complement(join(complement(composition(complement(converse(esk1_0)),esk3_0)),complement(esk2_0)))=complement(join(complement(esk2_0),complement(composition(converse(complement(esk1_0)),complement(top)))))),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)],[38266,27570,theory(equality)]),27570,theory(equality)]),71,theory(equality)]),4217,theory(equality)]),479,theory(equality)]),595,theory(equality)]),71,theory(equality)]),480,theory(equality)])).
% cnf(38500,negated_conjecture,(complement(join(complement(composition(complement(converse(esk1_0)),esk3_0)),complement(esk2_0)))=zero),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[38499,27570,theory(equality)]),71,theory(equality)]),4217,theory(equality)]),479,theory(equality)]),595,theory(equality)]),71,theory(equality)])).
% cnf(51629,negated_conjecture,(complement(join(complement(esk2_0),complement(composition(complement(converse(esk1_0)),esk3_0))))=zero),inference(rw,[status(thm)],[38500,20,theory(equality)])).
% cnf(51630,negated_conjecture,(join(join(complement(esk2_0),complement(composition(complement(converse(esk1_0)),esk3_0))),zero)=top),inference(spm,[status(thm)],[46,51629,theory(equality)])).
% cnf(51784,negated_conjecture,(join(complement(esk2_0),complement(composition(complement(converse(esk1_0)),esk3_0)))=top),inference(rw,[status(thm)],[inference(rw,[status(thm)],[51630,22,theory(equality)]),480,theory(equality)])).
% cnf(52143,negated_conjecture,(converse(top)=join(converse(complement(esk2_0)),converse(complement(composition(complement(converse(esk1_0)),esk3_0))))),inference(spm,[status(thm)],[32,51784,theory(equality)])).
% cnf(52207,negated_conjecture,(top=join(converse(complement(esk2_0)),converse(complement(composition(complement(converse(esk1_0)),esk3_0))))),inference(rw,[status(thm)],[52143,725,theory(equality)])).
% cnf(52208,negated_conjecture,(top=join(complement(converse(esk2_0)),complement(composition(converse(esk3_0),complement(esk1_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[52207,27570,theory(equality)]),27570,theory(equality)]),34,theory(equality)]),27570,theory(equality)]),30,theory(equality)])).
% cnf(57915,negated_conjecture,(join(complement(complement(esk1_0)),join(complement(composition(esk3_0,complement(top))),complement(join(complement(complement(esk1_0)),join(complement(join(complement(composition(esk3_0,converse(esk2_0))),complement(complement(esk1_0)))),complement(composition(esk3_0,complement(top))))))))=join(complement(composition(esk3_0,converse(esk2_0))),complement(complement(esk1_0)))),inference(spm,[status(thm)],[36866,52208,theory(equality)])).
% cnf(58008,negated_conjecture,(top=join(complement(composition(esk3_0,converse(esk2_0))),complement(complement(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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[57915,489,theory(equality)]),71,theory(equality)]),4217,theory(equality)]),479,theory(equality)]),489,theory(equality)]),489,theory(equality)]),71,theory(equality)]),4217,theory(equality)]),479,theory(equality)]),595,theory(equality)]),595,theory(equality)]),71,theory(equality)]),480,theory(equality)]),595,theory(equality)])).
% cnf(58009,negated_conjecture,(top=join(complement(composition(esk3_0,converse(esk2_0))),esk1_0)),inference(rw,[status(thm)],[58008,489,theory(equality)])).
% cnf(58018,negated_conjecture,(join(esk1_0,complement(composition(esk3_0,converse(esk2_0))))=top),inference(rw,[status(thm)],[58009,20,theory(equality)])).
% cnf(58032,negated_conjecture,(join(esk1_0,complement(top))=join(esk1_0,complement(complement(composition(esk3_0,converse(esk2_0)))))),inference(spm,[status(thm)],[26001,58018,theory(equality)])).
% cnf(58079,negated_conjecture,(esk1_0=join(esk1_0,complement(complement(composition(esk3_0,converse(esk2_0)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[58032,71,theory(equality)]),480,theory(equality)])).
% cnf(58080,negated_conjecture,(esk1_0=join(esk1_0,composition(esk3_0,converse(esk2_0)))),inference(rw,[status(thm)],[58079,489,theory(equality)])).
% cnf(58081,negated_conjecture,($false),inference(sr,[status(thm)],[58080,60,theory(equality)])).
% cnf(58082,negated_conjecture,($false),58081,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1507
% # ...of these trivial : 877
% # ...subsumed : 237
% # ...remaining for further processing: 393
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 116
% # Generated clauses : 28235
% # ...of the previous two non-trivial : 12939
% # Contextual simplify-reflections : 0
% # Paramodulations : 28235
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 277
% # Positive orientable unit clauses: 272
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 9200
% # ...number of literals in the above : 9200
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 19
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1339
% # Indexed BW rewrite successes : 196
% # Backwards rewriting index: 321 leaves, 2.11+/-2.906 terms/leaf
% # Paramod-from index: 161 leaves, 1.73+/-1.811 terms/leaf
% # Paramod-into index: 302 leaves, 2.10+/-2.941 terms/leaf
% # -------------------------------------------------
% # User time : 0.706 s
% # System time : 0.025 s
% # Total time : 0.731 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.56 CPU 1.64 WC
% FINAL PrfWatch: 1.56 CPU 1.64 WC
% SZS output end Solution for /tmp/SystemOnTPTP13891/REL044+2.tptp
%
%------------------------------------------------------------------------------