TSTP Solution File: REL042+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL042+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:01:02 EST 2010
% Result : Theorem 5.21s
% Output : Solution 5.21s
% 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/SystemOnTPTP13373/REL042+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13373/REL042+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13373/REL042+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 13469
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.91 CPU 4.03 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(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(16, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(17, 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(18, 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)],[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(25, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[4])).
% cnf(26,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[25])).
% fof(29, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(30,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(32,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[8])).
% cnf(34,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[9])).
% cnf(36,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[10])).
% cnf(38,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[11])).
% cnf(40,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[12])).
% cnf(42,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[41])).
% fof(49, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[49])).
% fof(51, 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)],[18])).
% fof(52, 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)],[51])).
% fof(53, 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)],[52])).
% fof(54, 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)],[53])).
% cnf(55,negated_conjecture,(join(composition(converse(esk1_0),esk1_0),one)!=one),inference(split_conjunct,[status(thm)],[54])).
% cnf(56,negated_conjecture,(meet(composition(esk1_0,X1),composition(esk1_0,complement(X1)))=zero),inference(split_conjunct,[status(thm)],[54])).
% cnf(57,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[42,26,theory(equality)]),['unfolding']).
% cnf(58,negated_conjecture,(complement(join(complement(composition(esk1_0,X1)),complement(composition(esk1_0,complement(X1)))))=zero),inference(rw,[status(thm)],[56,26,theory(equality)]),['unfolding']).
% cnf(62,negated_conjecture,(join(one,composition(converse(esk1_0),esk1_0))!=one),inference(rw,[status(thm)],[55,20,theory(equality)])).
% cnf(64,plain,(converse(top)=join(converse(X1),converse(complement(X1)))),inference(spm,[status(thm)],[36,50,theory(equality)])).
% cnf(71,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[38,30,theory(equality)])).
% cnf(73,plain,(complement(top)=zero),inference(rw,[status(thm)],[57,50,theory(equality)])).
% cnf(75,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[50,22,theory(equality)])).
% cnf(80,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[22,50,theory(equality)])).
% cnf(114,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[40,20,theory(equality)])).
% cnf(115,plain,(converse(complement(X1))=join(converse(complement(X1)),converse(composition(converse(X2),complement(composition(X2,X1)))))),inference(spm,[status(thm)],[36,114,theory(equality)])).
% cnf(125,plain,(converse(complement(X1))=join(converse(complement(X1)),composition(converse(complement(composition(X2,X1))),X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[115,38,theory(equality)]),34,theory(equality)])).
% cnf(131,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[24,20,theory(equality)])).
% cnf(157,negated_conjecture,(complement(join(complement(esk1_0),complement(composition(esk1_0,complement(one)))))=zero),inference(spm,[status(thm)],[58,30,theory(equality)])).
% cnf(331,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[71,34,theory(equality)])).
% cnf(350,plain,(one=converse(one)),inference(spm,[status(thm)],[30,331,theory(equality)])).
% cnf(379,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[331,350,theory(equality)])).
% cnf(393,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[114,379,theory(equality)])).
% cnf(405,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[393,350,theory(equality)]),379,theory(equality)])).
% cnf(412,plain,(join(one,converse(complement(one)))=converse(top)),inference(spm,[status(thm)],[64,350,theory(equality)])).
% cnf(425,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[131,405,theory(equality)])).
% cnf(434,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[405,73,theory(equality)])).
% cnf(440,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[425,50,theory(equality)]),73,theory(equality)])).
% cnf(452,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[22,434,theory(equality)])).
% cnf(460,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[440,20,theory(equality)])).
% cnf(519,plain,(join(X1,complement(X1))=join(top,complement(X1))),inference(spm,[status(thm)],[80,405,theory(equality)])).
% cnf(533,plain,(top=join(top,complement(X1))),inference(rw,[status(thm)],[519,50,theory(equality)])).
% cnf(558,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[452,460,theory(equality)])).
% cnf(569,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[20,558,theory(equality)])).
% cnf(570,plain,(converse(X1)=join(converse(zero),converse(X1))),inference(spm,[status(thm)],[36,558,theory(equality)])).
% cnf(578,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[460,558,theory(equality)])).
% cnf(622,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[405,578,theory(equality)])).
% cnf(623,plain,(join(top,X1)=top),inference(spm,[status(thm)],[533,578,theory(equality)])).
% cnf(650,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[22,622,theory(equality)])).
% cnf(694,plain,(top=join(X1,top)),inference(spm,[status(thm)],[20,623,theory(equality)])).
% cnf(695,plain,(converse(top)=join(converse(top),converse(X1))),inference(spm,[status(thm)],[36,623,theory(equality)])).
% cnf(726,plain,(join(converse(zero),X1)=X1),inference(spm,[status(thm)],[570,34,theory(equality)])).
% cnf(733,plain,(zero=converse(zero)),inference(spm,[status(thm)],[569,726,theory(equality)])).
% cnf(767,plain,(join(converse(top),X1)=converse(top)),inference(spm,[status(thm)],[695,34,theory(equality)])).
% cnf(774,plain,(converse(top)=top),inference(spm,[status(thm)],[694,767,theory(equality)])).
% cnf(794,plain,(join(one,converse(complement(one)))=top),inference(rw,[status(thm)],[412,774,theory(equality)])).
% cnf(795,plain,(join(converse(X1),converse(complement(X1)))=top),inference(rw,[status(thm)],[64,774,theory(equality)])).
% cnf(803,plain,(composition(top,X1)=join(composition(one,X1),composition(converse(complement(one)),X1))),inference(spm,[status(thm)],[32,794,theory(equality)])).
% cnf(807,plain,(composition(top,X1)=join(X1,composition(converse(complement(one)),X1))),inference(rw,[status(thm)],[803,379,theory(equality)])).
% cnf(822,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[650,131,theory(equality)])).
% cnf(829,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[650,20,theory(equality)])).
% cnf(1241,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[822,20,theory(equality)])).
% cnf(1271,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1241,829,theory(equality)])).
% cnf(1364,plain,(join(X1,X3)=join(X1,join(complement(join(X2,complement(X1))),X3))),inference(spm,[status(thm)],[22,1271,theory(equality)])).
% cnf(1374,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1271,578,theory(equality)])).
% cnf(1530,negated_conjecture,(join(join(complement(esk1_0),complement(composition(esk1_0,complement(one)))),zero)=top),inference(spm,[status(thm)],[50,157,theory(equality)])).
% cnf(1556,negated_conjecture,(join(complement(esk1_0),complement(composition(esk1_0,complement(one))))=top),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1530,22,theory(equality)]),569,theory(equality)])).
% cnf(1599,negated_conjecture,(join(complement(top),complement(join(complement(esk1_0),complement(complement(composition(esk1_0,complement(one)))))))=esk1_0),inference(spm,[status(thm)],[131,1556,theory(equality)])).
% cnf(1614,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)],[1599,73,theory(equality)]),578,theory(equality)]),558,theory(equality)])).
% cnf(1627,negated_conjecture,(complement(esk1_0)=join(complement(esk1_0),composition(esk1_0,complement(one)))),inference(spm,[status(thm)],[578,1614,theory(equality)])).
% cnf(1705,plain,(join(X1,join(X2,complement(join(X2,X1))))=top),inference(spm,[status(thm)],[75,20,theory(equality)])).
% cnf(1896,negated_conjecture,(join(complement(composition(esk1_0,complement(one))),complement(complement(esk1_0)))=complement(composition(esk1_0,complement(one)))),inference(spm,[status(thm)],[1374,1627,theory(equality)])).
% cnf(1910,negated_conjecture,(join(complement(composition(esk1_0,complement(one))),esk1_0)=complement(composition(esk1_0,complement(one)))),inference(rw,[status(thm)],[1896,578,theory(equality)])).
% cnf(2493,negated_conjecture,(join(esk1_0,complement(composition(esk1_0,complement(one))))=complement(composition(esk1_0,complement(one)))),inference(rw,[status(thm)],[1910,20,theory(equality)])).
% cnf(2530,plain,(converse(composition(top,X1))=join(converse(X1),converse(composition(converse(complement(one)),X1)))),inference(spm,[status(thm)],[36,807,theory(equality)])).
% cnf(2542,plain,(composition(converse(X1),top)=join(converse(X1),converse(composition(converse(complement(one)),X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2530,38,theory(equality)]),774,theory(equality)])).
% cnf(2543,plain,(composition(converse(X1),top)=join(converse(X1),composition(converse(X1),complement(one)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2542,38,theory(equality)]),34,theory(equality)])).
% cnf(8208,plain,(join(converse(zero),composition(converse(complement(composition(X1,top))),X1))=converse(zero)),inference(spm,[status(thm)],[125,73,theory(equality)])).
% cnf(8239,plain,(composition(converse(complement(composition(X1,top))),X1)=converse(zero)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[8208,733,theory(equality)]),558,theory(equality)])).
% cnf(8240,plain,(composition(converse(complement(composition(X1,top))),X1)=zero),inference(rw,[status(thm)],[8239,733,theory(equality)])).
% cnf(11551,plain,(join(X1,composition(X1,complement(one)))=composition(X1,top)),inference(spm,[status(thm)],[2543,34,theory(equality)])).
% cnf(23845,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),complement(complement(X1)))))),inference(spm,[status(thm)],[1364,131,theory(equality)])).
% cnf(24097,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),X1)))),inference(rw,[status(thm)],[23845,578,theory(equality)])).
% cnf(24194,plain,(join(X1,complement(join(X2,X1)))=join(X1,complement(X2))),inference(spm,[status(thm)],[24097,578,theory(equality)])).
% cnf(24641,plain,(join(converse(complement(X1)),complement(top))=join(converse(complement(X1)),complement(converse(X1)))),inference(spm,[status(thm)],[24194,795,theory(equality)])).
% cnf(24720,plain,(join(join(X1,complement(join(X1,X2))),complement(top))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(spm,[status(thm)],[24194,1705,theory(equality)])).
% cnf(24827,plain,(converse(complement(X1))=join(converse(complement(X1)),complement(converse(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[24641,73,theory(equality)]),569,theory(equality)])).
% cnf(24949,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)],[24720,73,theory(equality)]),22,theory(equality)]),569,theory(equality)])).
% cnf(24950,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[24949,22,theory(equality)]),20,theory(equality)]),1374,theory(equality)])).
% cnf(25138,plain,(join(X1,complement(composition(X1,top)))=join(X1,complement(composition(X1,complement(one))))),inference(spm,[status(thm)],[24950,11551,theory(equality)])).
% cnf(25414,plain,(join(complement(converse(X1)),converse(complement(X1)))=converse(complement(X1))),inference(rw,[status(thm)],[24827,20,theory(equality)])).
% cnf(25415,plain,(converse(converse(complement(X1)))=join(converse(complement(converse(X1))),converse(converse(complement(X1))))),inference(spm,[status(thm)],[36,25414,theory(equality)])).
% cnf(25465,plain,(complement(X1)=join(converse(complement(converse(X1))),converse(converse(complement(X1))))),inference(rw,[status(thm)],[25415,34,theory(equality)])).
% cnf(25466,plain,(complement(X1)=join(converse(complement(converse(X1))),complement(X1))),inference(rw,[status(thm)],[25465,34,theory(equality)])).
% cnf(26162,plain,(join(complement(X1),converse(complement(converse(X1))))=complement(X1)),inference(rw,[status(thm)],[25466,20,theory(equality)])).
% cnf(26208,plain,(join(complement(converse(X1)),converse(complement(X1)))=complement(converse(X1))),inference(spm,[status(thm)],[26162,34,theory(equality)])).
% cnf(26257,plain,(converse(complement(X1))=complement(converse(X1))),inference(rw,[status(thm)],[26208,25414,theory(equality)])).
% cnf(26307,plain,(composition(complement(composition(top,converse(X1))),X1)=zero),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[8240,26257,theory(equality)]),38,theory(equality)]),774,theory(equality)])).
% cnf(29047,negated_conjecture,(join(esk1_0,complement(composition(esk1_0,top)))=complement(composition(esk1_0,complement(one)))),inference(rw,[status(thm)],[2493,25138,theory(equality)])).
% cnf(29141,negated_conjecture,(complement(join(esk1_0,complement(composition(esk1_0,top))))=composition(esk1_0,complement(one))),inference(spm,[status(thm)],[578,29047,theory(equality)])).
% cnf(29332,negated_conjecture,(join(complement(complement(one)),composition(converse(esk1_0),complement(complement(join(esk1_0,complement(composition(esk1_0,top)))))))=complement(complement(one))),inference(spm,[status(thm)],[114,29141,theory(equality)])).
% cnf(29364,negated_conjecture,(join(one,composition(converse(esk1_0),join(esk1_0,complement(composition(esk1_0,top)))))=complement(complement(one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[29332,578,theory(equality)]),578,theory(equality)])).
% cnf(29365,negated_conjecture,(join(one,composition(converse(esk1_0),join(esk1_0,complement(composition(esk1_0,top)))))=one),inference(rw,[status(thm)],[29364,578,theory(equality)])).
% cnf(143042,negated_conjecture,(converse(one)=join(converse(one),converse(composition(converse(esk1_0),join(esk1_0,complement(composition(esk1_0,top))))))),inference(spm,[status(thm)],[36,29365,theory(equality)])).
% cnf(143086,negated_conjecture,(one=join(converse(one),converse(composition(converse(esk1_0),join(esk1_0,complement(composition(esk1_0,top))))))),inference(rw,[status(thm)],[143042,350,theory(equality)])).
% cnf(143087,negated_conjecture,(one=join(one,composition(converse(esk1_0),esk1_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[143086,350,theory(equality)]),38,theory(equality)]),36,theory(equality)]),26257,theory(equality)]),38,theory(equality)]),774,theory(equality)]),34,theory(equality)]),32,theory(equality)]),26307,theory(equality)]),569,theory(equality)])).
% cnf(143088,negated_conjecture,($false),inference(sr,[status(thm)],[143087,62,theory(equality)])).
% cnf(143089,negated_conjecture,($false),143088,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2387
% # ...of these trivial : 1410
% # ...subsumed : 410
% # ...remaining for further processing: 567
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 182
% # Generated clauses : 65984
% # ...of the previous two non-trivial : 32121
% # Contextual simplify-reflections : 0
% # Paramodulations : 65984
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 385
% # Positive orientable unit clauses: 380
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 22825
% # ...number of literals in the above : 22825
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 24
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2321
% # Indexed BW rewrite successes : 244
% # Backwards rewriting index: 352 leaves, 2.65+/-4.458 terms/leaf
% # Paramod-from index: 190 leaves, 2.03+/-2.402 terms/leaf
% # Paramod-into index: 335 leaves, 2.64+/-4.509 terms/leaf
% # -------------------------------------------------
% # User time : 2.094 s
% # System time : 0.084 s
% # Total time : 2.178 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.40 CPU 4.52 WC
% FINAL PrfWatch: 4.40 CPU 4.52 WC
% SZS output end Solution for /tmp/SystemOnTPTP13373/REL042+2.tptp
%
%------------------------------------------------------------------------------