TSTP Solution File: REL042+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL042+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 : art07.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:00:47 EST 2010
% Result : Theorem 31.66s
% Output : Solution 31.66s
% 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/SystemOnTPTP13151/REL042+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13151/REL042+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13151/REL042+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 13247
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.02 WC
% PrfWatch: 3.91 CPU 4.03 WC
% PrfWatch: 5.59 CPU 6.03 WC
% PrfWatch: 7.18 CPU 8.04 WC
% PrfWatch: 9.13 CPU 10.04 WC
% PrfWatch: 11.10 CPU 12.05 WC
% PrfWatch: 13.09 CPU 14.05 WC
% PrfWatch: 15.08 CPU 16.06 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 17.06 CPU 18.06 WC
% PrfWatch: 19.05 CPU 20.07 WC
% PrfWatch: 21.05 CPU 22.07 WC
% PrfWatch: 23.04 CPU 24.08 WC
% PrfWatch: 25.03 CPU 26.08 WC
% PrfWatch: 27.03 CPU 28.08 WC
% PrfWatch: 29.02 CPU 30.09 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]: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(4, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(5, axiom,![X1]:![X2]:![X3]:composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3),file('/tmp/SRASS.s.p', composition_associativity)).
% fof(6, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(7, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(8, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(9, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(10, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(11, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(12, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(13, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(14, conjecture,![X1]:(![X2]:meet(composition(X1,X2),composition(X1,complement(X2)))=zero=>join(composition(converse(X1),X1),one)=one),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:(![X2]:meet(composition(X1,X2),composition(X1,complement(X2)))=zero=>join(composition(converse(X1),X1),one)=one)),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,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:composition(X4,composition(X5,X6))=composition(composition(X4,X5),X6),inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(29,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[8])).
% cnf(31,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[9])).
% cnf(33,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[10])).
% cnf(35,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[11])).
% cnf(37,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[12])).
% cnf(39,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[13])).
% cnf(41,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[40])).
% fof(42, negated_conjecture,?[X1]:(![X2]:meet(composition(X1,X2),composition(X1,complement(X2)))=zero&~(join(composition(converse(X1),X1),one)=one)),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X3]:(![X4]:meet(composition(X3,X4),composition(X3,complement(X4)))=zero&~(join(composition(converse(X3),X3),one)=one)),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,(![X4]:meet(composition(esk1_0,X4),composition(esk1_0,complement(X4)))=zero&~(join(composition(converse(esk1_0),esk1_0),one)=one)),inference(skolemize,[status(esa)],[43])).
% fof(45, negated_conjecture,![X4]:(meet(composition(esk1_0,X4),composition(esk1_0,complement(X4)))=zero&~(join(composition(converse(esk1_0),esk1_0),one)=one)),inference(shift_quantors,[status(thm)],[44])).
% cnf(46,negated_conjecture,(join(composition(converse(esk1_0),esk1_0),one)!=one),inference(split_conjunct,[status(thm)],[45])).
% cnf(47,negated_conjecture,(meet(composition(esk1_0,X1),composition(esk1_0,complement(X1)))=zero),inference(split_conjunct,[status(thm)],[45])).
% cnf(48,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[39,23,theory(equality)]),['unfolding']).
% cnf(49,negated_conjecture,(complement(join(complement(composition(esk1_0,X1)),complement(composition(esk1_0,complement(X1)))))=zero),inference(rw,[status(thm)],[47,23,theory(equality)]),['unfolding']).
% cnf(50,negated_conjecture,(join(one,composition(converse(esk1_0),esk1_0))!=one),inference(rw,[status(thm)],[46,17,theory(equality)])).
% cnf(53,plain,(join(converse(X1),X2)=converse(join(X1,converse(X2)))),inference(spm,[status(thm)],[33,31,theory(equality)])).
% cnf(54,plain,(join(X1,converse(X2))=converse(join(converse(X1),X2))),inference(spm,[status(thm)],[33,31,theory(equality)])).
% cnf(57,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[35,31,theory(equality)])).
% cnf(58,plain,(composition(X1,converse(X2))=converse(composition(X2,converse(X1)))),inference(spm,[status(thm)],[35,31,theory(equality)])).
% cnf(82,plain,(converse(top)=join(X1,converse(complement(converse(X1))))),inference(spm,[status(thm)],[54,41,theory(equality)])).
% cnf(95,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[41,19,theory(equality)])).
% cnf(100,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[19,41,theory(equality)])).
% cnf(121,plain,(join(composition(converse(X2),X1),converse(X3))=converse(join(composition(converse(X1),X2),X3))),inference(spm,[status(thm)],[33,57,theory(equality)])).
% cnf(131,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[57,27,theory(equality)])).
% cnf(139,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[131,31,theory(equality)])).
% cnf(143,plain,(one=converse(one)),inference(spm,[status(thm)],[27,139,theory(equality)])).
% cnf(160,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[139,143,theory(equality)])).
% cnf(222,plain,(complement(top)=zero),inference(rw,[status(thm)],[48,41,theory(equality)])).
% cnf(292,plain,(join(X1,top)=join(top,complement(complement(X1)))),inference(spm,[status(thm)],[100,41,theory(equality)])).
% cnf(399,plain,(join(composition(X1,converse(X2)),converse(composition(X2,X3)))=composition(join(X1,converse(X3)),converse(X2))),inference(spm,[status(thm)],[29,35,theory(equality)])).
% cnf(400,plain,(join(composition(X1,X2),X2)=composition(join(X1,one),X2)),inference(spm,[status(thm)],[29,160,theory(equality)])).
% cnf(404,plain,(join(X1,composition(X2,X1))=composition(join(one,X2),X1)),inference(spm,[status(thm)],[29,160,theory(equality)])).
% cnf(534,plain,(join(X1,join(X2,complement(join(X2,X1))))=top),inference(spm,[status(thm)],[95,17,theory(equality)])).
% cnf(676,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[37,17,theory(equality)])).
% cnf(682,plain,(join(complement(converse(X1)),composition(converse(converse(X2)),complement(converse(composition(X1,X2)))))=complement(converse(X1))),inference(spm,[status(thm)],[676,35,theory(equality)])).
% cnf(683,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[676,160,theory(equality)])).
% cnf(684,plain,(join(complement(X1),composition(converse(composition(X2,X3)),complement(composition(X2,composition(X3,X1)))))=complement(X1)),inference(spm,[status(thm)],[676,25,theory(equality)])).
% cnf(685,plain,(join(complement(one),composition(converse(X1),complement(X1)))=complement(one)),inference(spm,[status(thm)],[676,27,theory(equality)])).
% cnf(694,plain,(join(zero,composition(converse(X1),complement(composition(X1,top))))=zero),inference(spm,[status(thm)],[676,222,theory(equality)])).
% cnf(699,plain,(join(complement(converse(X1)),composition(X2,complement(converse(composition(X1,X2)))))=complement(converse(X1))),inference(rw,[status(thm)],[682,31,theory(equality)])).
% cnf(700,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[683,143,theory(equality)]),160,theory(equality)])).
% cnf(706,plain,(join(complement(X1),join(complement(X1),complement(complement(X1))))=top),inference(spm,[status(thm)],[95,700,theory(equality)])).
% cnf(713,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[700,222,theory(equality)])).
% cnf(716,plain,(join(complement(X1),top)=top),inference(rw,[status(thm)],[706,41,theory(equality)])).
% cnf(726,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[19,713,theory(equality)])).
% cnf(735,plain,(join(top,complement(X1))=top),inference(rw,[status(thm)],[716,17,theory(equality)])).
% cnf(745,plain,(top=join(X1,top)),inference(rw,[status(thm)],[292,735,theory(equality)])).
% cnf(758,plain,(top=join(top,X1)),inference(spm,[status(thm)],[17,745,theory(equality)])).
% cnf(778,plain,(top=converse(top)),inference(spm,[status(thm)],[82,758,theory(equality)])).
% cnf(833,plain,(join(X1,converse(complement(converse(X1))))=top),inference(rw,[status(thm)],[82,778,theory(equality)])).
% cnf(975,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[21,17,theory(equality)])).
% cnf(987,plain,(join(complement(join(complement(X1),complement(X1))),complement(top))=X1),inference(spm,[status(thm)],[975,41,theory(equality)])).
% cnf(1003,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[987,700,theory(equality)]),222,theory(equality)])).
% cnf(1012,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[1003,17,theory(equality)])).
% cnf(1040,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[726,1012,theory(equality)])).
% cnf(1066,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[17,1040,theory(equality)])).
% cnf(1074,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[1012,1040,theory(equality)])).
% cnf(1103,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[700,1074,theory(equality)])).
% cnf(1143,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[19,1103,theory(equality)])).
% cnf(1241,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[1143,975,theory(equality)])).
% cnf(1250,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[1143,17,theory(equality)])).
% cnf(1356,negated_conjecture,(complement(join(complement(esk1_0),complement(composition(esk1_0,complement(one)))))=zero),inference(spm,[status(thm)],[49,27,theory(equality)])).
% cnf(1627,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[1241,17,theory(equality)])).
% cnf(1647,plain,(join(complement(X1),complement(join(X1,X2)))=complement(X1)),inference(spm,[status(thm)],[1627,1074,theory(equality)])).
% cnf(1658,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1627,1250,theory(equality)])).
% cnf(1708,plain,(join(X1,X3)=join(X1,join(complement(join(X2,complement(X1))),X3))),inference(spm,[status(thm)],[19,1658,theory(equality)])).
% cnf(1720,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1658,1074,theory(equality)])).
% cnf(7693,plain,(join(complement(composition(converse(X1),complement(X1))),complement(complement(one)))=complement(composition(converse(X1),complement(X1)))),inference(spm,[status(thm)],[1720,685,theory(equality)])).
% cnf(7709,plain,(join(complement(one),composition(converse(complement(X1)),X1))=complement(one)),inference(spm,[status(thm)],[685,1074,theory(equality)])).
% cnf(7745,plain,(join(complement(composition(converse(X1),complement(X1))),one)=complement(composition(converse(X1),complement(X1)))),inference(rw,[status(thm)],[7693,1074,theory(equality)])).
% cnf(9417,plain,(join(complement(one),converse(complement(one)))=complement(one)),inference(spm,[status(thm)],[7709,27,theory(equality)])).
% cnf(9459,plain,(converse(complement(one))=join(converse(complement(one)),complement(one))),inference(spm,[status(thm)],[53,9417,theory(equality)])).
% cnf(9530,plain,(complement(one)=converse(complement(one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[9459,17,theory(equality)]),9417,theory(equality)])).
% cnf(11351,plain,(composition(converse(X1),complement(composition(X1,top)))=zero),inference(rw,[status(thm)],[694,1040,theory(equality)])).
% cnf(11972,plain,(join(X2,composition(X1,X2))=composition(join(X1,one),X2)),inference(rw,[status(thm)],[400,17,theory(equality)])).
% cnf(12024,plain,(join(X1,composition(top,X1))=composition(top,X1)),inference(spm,[status(thm)],[11972,758,theory(equality)])).
% cnf(12091,plain,(converse(composition(top,converse(X1)))=join(X1,converse(composition(top,converse(X1))))),inference(spm,[status(thm)],[54,12024,theory(equality)])).
% cnf(12137,plain,(composition(X1,top)=join(X1,converse(composition(top,converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[12091,58,theory(equality)]),778,theory(equality)])).
% cnf(12138,plain,(composition(X1,top)=join(X1,composition(X1,top))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[12137,58,theory(equality)]),778,theory(equality)])).
% cnf(12198,plain,(join(complement(X1),complement(composition(X1,top)))=complement(X1)),inference(spm,[status(thm)],[1647,12138,theory(equality)])).
% cnf(19538,negated_conjecture,(join(join(complement(esk1_0),complement(composition(esk1_0,complement(one)))),zero)=top),inference(spm,[status(thm)],[41,1356,theory(equality)])).
% cnf(19590,negated_conjecture,(join(complement(esk1_0),complement(composition(esk1_0,complement(one))))=top),inference(rw,[status(thm)],[inference(rw,[status(thm)],[19538,19,theory(equality)]),1066,theory(equality)])).
% cnf(19669,negated_conjecture,(join(complement(top),complement(join(complement(esk1_0),complement(complement(composition(esk1_0,complement(one)))))))=esk1_0),inference(spm,[status(thm)],[975,19590,theory(equality)])).
% cnf(19706,negated_conjecture,(complement(join(complement(esk1_0),composition(esk1_0,complement(one))))=esk1_0),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[19669,222,theory(equality)]),1074,theory(equality)]),1040,theory(equality)])).
% cnf(19723,negated_conjecture,(complement(esk1_0)=join(complement(esk1_0),composition(esk1_0,complement(one)))),inference(spm,[status(thm)],[1074,19706,theory(equality)])).
% cnf(19803,negated_conjecture,(join(complement(composition(esk1_0,complement(one))),complement(complement(esk1_0)))=complement(composition(esk1_0,complement(one)))),inference(spm,[status(thm)],[1720,19723,theory(equality)])).
% cnf(19827,negated_conjecture,(join(complement(composition(esk1_0,complement(one))),esk1_0)=complement(composition(esk1_0,complement(one)))),inference(rw,[status(thm)],[19803,1074,theory(equality)])).
% cnf(20490,negated_conjecture,(join(esk1_0,complement(composition(esk1_0,complement(one))))=complement(composition(esk1_0,complement(one)))),inference(rw,[status(thm)],[19827,17,theory(equality)])).
% cnf(21400,plain,(join(X1,composition(converse(complement(converse(one))),X1))=composition(top,X1)),inference(spm,[status(thm)],[404,833,theory(equality)])).
% cnf(21548,plain,(join(X1,composition(complement(one),X1))=composition(top,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[21400,143,theory(equality)]),9530,theory(equality)])).
% cnf(21625,plain,(converse(composition(top,converse(X1)))=join(X1,converse(composition(complement(one),converse(X1))))),inference(spm,[status(thm)],[54,21548,theory(equality)])).
% cnf(21694,plain,(composition(X1,top)=join(X1,converse(composition(complement(one),converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[21625,58,theory(equality)]),778,theory(equality)])).
% cnf(21695,plain,(composition(X1,top)=join(X1,composition(X1,complement(one)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[21694,58,theory(equality)]),9530,theory(equality)])).
% cnf(36165,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)],[121,399,theory(equality)])).
% cnf(36302,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)],[36165,33,theory(equality)]),35,theory(equality)]),31,theory(equality)])).
% cnf(36303,plain,(composition(X2,join(X1,X3))=join(composition(X2,X1),composition(X2,X3))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[36302,31,theory(equality)]),31,theory(equality)])).
% cnf(37016,plain,(join(composition(X1,X2),X1)=composition(X1,join(X2,one))),inference(spm,[status(thm)],[36303,27,theory(equality)])).
% cnf(37045,plain,(join(zero,composition(converse(X1),X2))=composition(converse(X1),join(complement(composition(X1,top)),X2))),inference(spm,[status(thm)],[36303,11351,theory(equality)])).
% cnf(37212,plain,(composition(converse(X1),X2)=composition(converse(X1),join(complement(composition(X1,top)),X2))),inference(rw,[status(thm)],[37045,1040,theory(equality)])).
% cnf(40410,plain,(join(X1,composition(X1,X2))=composition(X1,join(X2,one))),inference(rw,[status(thm)],[37016,17,theory(equality)])).
% cnf(61163,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),complement(complement(X1)))))),inference(spm,[status(thm)],[1708,975,theory(equality)])).
% cnf(61499,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),X1)))),inference(rw,[status(thm)],[61163,1074,theory(equality)])).
% cnf(62342,plain,(join(X1,complement(join(X2,X1)))=join(X1,complement(X2))),inference(spm,[status(thm)],[61499,1074,theory(equality)])).
% cnf(63050,plain,(join(join(X1,complement(join(X1,X2))),complement(top))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(spm,[status(thm)],[62342,534,theory(equality)])).
% cnf(63319,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)],[63050,222,theory(equality)]),19,theory(equality)]),1066,theory(equality)])).
% cnf(63320,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[63319,19,theory(equality)]),17,theory(equality)]),1720,theory(equality)])).
% cnf(63543,plain,(join(X1,complement(top))=join(X1,complement(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[63320,833,theory(equality)])).
% cnf(63571,plain,(join(X1,complement(composition(X1,top)))=join(X1,complement(composition(X1,complement(one))))),inference(spm,[status(thm)],[63320,21695,theory(equality)])).
% cnf(63807,plain,(X1=join(X1,complement(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[63543,222,theory(equality)]),1066,theory(equality)])).
% cnf(63915,plain,(converse(converse(X1))=join(X1,converse(complement(converse(complement(converse(converse(X1)))))))),inference(spm,[status(thm)],[54,63807,theory(equality)])).
% cnf(64067,plain,(X1=join(X1,converse(complement(converse(complement(converse(converse(X1)))))))),inference(rw,[status(thm)],[63915,31,theory(equality)])).
% cnf(64068,plain,(X1=join(X1,converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[64067,31,theory(equality)])).
% cnf(64327,plain,(join(complement(X1),converse(complement(converse(X1))))=complement(X1)),inference(spm,[status(thm)],[64068,1074,theory(equality)])).
% cnf(64622,plain,(join(complement(converse(complement(converse(X1)))),complement(complement(X1)))=complement(converse(complement(converse(X1))))),inference(spm,[status(thm)],[1720,64327,theory(equality)])).
% cnf(64721,plain,(X1=complement(converse(complement(converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[64622,1074,theory(equality)]),17,theory(equality)]),63807,theory(equality)])).
% cnf(64774,plain,(complement(X1)=converse(complement(converse(X1)))),inference(spm,[status(thm)],[1074,64721,theory(equality)])).
% cnf(64930,plain,(converse(complement(X1))=complement(converse(X1))),inference(spm,[status(thm)],[31,64774,theory(equality)])).
% cnf(65068,plain,(converse(composition(complement(converse(X1)),X2))=composition(converse(X2),complement(X1))),inference(spm,[status(thm)],[57,64930,theory(equality)])).
% cnf(68380,plain,(join(complement(converse(complement(converse(X1)))),composition(X2,complement(composition(converse(X2),complement(X1)))))=complement(converse(complement(converse(X1))))),inference(spm,[status(thm)],[699,65068,theory(equality)])).
% cnf(68605,plain,(join(X1,composition(X2,complement(composition(converse(X2),complement(X1)))))=complement(converse(complement(converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[68380,64930,theory(equality)]),31,theory(equality)]),1074,theory(equality)])).
% cnf(68606,plain,(join(X1,composition(X2,complement(composition(converse(X2),complement(X1)))))=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[68605,64930,theory(equality)]),31,theory(equality)]),1074,theory(equality)])).
% cnf(69343,negated_conjecture,(join(esk1_0,complement(composition(esk1_0,top)))=complement(composition(esk1_0,complement(one)))),inference(rw,[status(thm)],[20490,63571,theory(equality)])).
% cnf(69496,negated_conjecture,(complement(join(esk1_0,complement(composition(esk1_0,top))))=composition(esk1_0,complement(one))),inference(spm,[status(thm)],[1074,69343,theory(equality)])).
% cnf(69711,negated_conjecture,(join(complement(composition(esk1_0,top)),composition(esk1_0,complement(one)))=join(complement(composition(esk1_0,top)),complement(esk1_0))),inference(spm,[status(thm)],[62342,69496,theory(equality)])).
% cnf(73979,negated_conjecture,(join(complement(composition(esk1_0,top)),composition(esk1_0,complement(one)))=complement(esk1_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[69711,17,theory(equality)]),12198,theory(equality)])).
% cnf(81401,plain,(join(one,complement(composition(converse(X1),complement(X1))))=complement(composition(converse(X1),complement(X1)))),inference(rw,[status(thm)],[7745,17,theory(equality)])).
% cnf(122137,plain,(X1=composition(X1,join(complement(composition(converse(X1),complement(X1))),one))),inference(spm,[status(thm)],[40410,68606,theory(equality)])).
% cnf(122342,plain,(X1=composition(X1,complement(composition(converse(X1),complement(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[122137,17,theory(equality)]),81401,theory(equality)])).
% cnf(1072490,negated_conjecture,(composition(converse(esk1_0),complement(esk1_0))=composition(converse(esk1_0),composition(esk1_0,complement(one)))),inference(spm,[status(thm)],[37212,73979,theory(equality)])).
% cnf(1073628,negated_conjecture,(join(complement(complement(one)),composition(converse(composition(converse(esk1_0),esk1_0)),complement(composition(converse(esk1_0),complement(esk1_0)))))=complement(complement(one))),inference(spm,[status(thm)],[684,1072490,theory(equality)])).
% cnf(1073725,negated_conjecture,(join(one,composition(converse(esk1_0),esk1_0))=complement(complement(one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1073628,1074,theory(equality)]),57,theory(equality)]),25,theory(equality)]),122342,theory(equality)])).
% cnf(1073726,negated_conjecture,(join(one,composition(converse(esk1_0),esk1_0))=one),inference(rw,[status(thm)],[1073725,1074,theory(equality)])).
% cnf(1073727,negated_conjecture,($false),inference(sr,[status(thm)],[1073726,50,theory(equality)])).
% cnf(1073728,negated_conjecture,($false),1073727,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 11877
% # ...of these trivial : 9040
% # ...subsumed : 1121
% # ...remaining for further processing: 1716
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 390
% # Generated clauses : 528267
% # ...of the previous two non-trivial : 248038
% # Contextual simplify-reflections : 0
% # Paramodulations : 528267
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1326
% # Positive orientable unit clauses: 1316
% # Positive unorientable unit clauses: 9
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 201195
% # ...number of literals in the above : 201195
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 59
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 12821
% # Indexed BW rewrite successes : 500
% # Backwards rewriting index: 876 leaves, 3.24+/-4.441 terms/leaf
% # Paramod-from index: 494 leaves, 2.69+/-3.119 terms/leaf
% # Paramod-into index: 800 leaves, 3.03+/-4.060 terms/leaf
% # -------------------------------------------------
% # User time : 15.030 s
% # System time : 0.616 s
% # Total time : 15.646 s
% # Maximum resident set size: 0 pages
% PrfWatch: 30.78 CPU 31.86 WC
% FINAL PrfWatch: 30.78 CPU 31.86 WC
% SZS output end Solution for /tmp/SystemOnTPTP13151/REL042+1.tptp
%
%------------------------------------------------------------------------------