TSTP Solution File: REL026+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL026+3 : 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:47:04 EST 2010
% Result : Theorem 39.36s
% Output : Solution 39.36s
% 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/SystemOnTPTP7136/REL026+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7136/REL026+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7136/REL026+3.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 7232
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.94 CPU 2.02 WC
% PrfWatch: 3.92 CPU 4.03 WC
% PrfWatch: 5.91 CPU 6.03 WC
% PrfWatch: 7.90 CPU 8.04 WC
% PrfWatch: 9.88 CPU 10.04 WC
% PrfWatch: 11.87 CPU 12.05 WC
% PrfWatch: 13.85 CPU 14.05 WC
% PrfWatch: 15.84 CPU 16.05 WC
% PrfWatch: 17.83 CPU 18.06 WC
% PrfWatch: 19.80 CPU 20.06 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 21.79 CPU 22.07 WC
% PrfWatch: 23.78 CPU 24.07 WC
% PrfWatch: 25.78 CPU 26.08 WC
% PrfWatch: 27.77 CPU 28.08 WC
% PrfWatch: 29.37 CPU 30.09 WC
% PrfWatch: 31.01 CPU 32.09 WC
% PrfWatch: 33.01 CPU 34.10 WC
% PrfWatch: 35.00 CPU 36.10 WC
% PrfWatch: 36.99 CPU 38.11 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]:![X3]:composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3),file('/tmp/SRASS.s.p', composition_associativity)).
% fof(4, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% 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]:![X2]:![X3]:join(meet(composition(X1,X2),X3),composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))))=composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))),file('/tmp/SRASS.s.p', dedekind_law)).
% fof(9, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(10, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(11, 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(12, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(13, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(14, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(15, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(16, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(17, conjecture,![X1]:![X2]:(join(X1,one)=one=>meet(composition(X1,top),X2)=composition(X1,X2)),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:![X2]:(join(X1,one)=one=>meet(composition(X1,top),X2)=composition(X1,X2))),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,![X4]:![X5]:![X6]:composition(X4,composition(X5,X6))=composition(composition(X4,X5),X6),inference(variable_rename,[status(thm)],[3])).
% cnf(24,plain,(composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(26,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[25])).
% 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,![X4]:![X5]:![X6]:join(meet(composition(X4,X5),X6),composition(meet(X4,composition(X6,converse(X5))),meet(X5,composition(converse(X4),X6))))=composition(meet(X4,composition(X6,converse(X5))),meet(X5,composition(converse(X4),X6))),inference(variable_rename,[status(thm)],[6])).
% cnf(30,plain,(join(meet(composition(X1,X2),X3),composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))))=composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3)))),inference(split_conjunct,[status(thm)],[29])).
% fof(35, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[9])).
% cnf(36,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[10])).
% cnf(38,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[11])).
% cnf(40,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(42,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[13])).
% cnf(44,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[14])).
% cnf(46,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[15])).
% cnf(48,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),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]:(join(X1,one)=one&~(meet(composition(X1,top),X2)=composition(X1,X2))),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,?[X3]:?[X4]:(join(X3,one)=one&~(meet(composition(X3,top),X4)=composition(X3,X4))),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,(join(esk1_0,one)=one&~(meet(composition(esk1_0,top),esk2_0)=composition(esk1_0,esk2_0))),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(meet(composition(esk1_0,top),esk2_0)!=composition(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,negated_conjecture,(join(esk1_0,one)=one),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[50,38,theory(equality)]),['unfolding']).
% cnf(59,plain,(join(complement(join(complement(composition(X1,X2)),complement(X3))),composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3))))))=composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[30,38,theory(equality)]),38,theory(equality)]),38,theory(equality)]),38,theory(equality)]),38,theory(equality)]),['unfolding']).
% cnf(60,negated_conjecture,(complement(join(complement(composition(esk1_0,top)),complement(esk2_0)))!=composition(esk1_0,esk2_0)),inference(rw,[status(thm)],[54,38,theory(equality)]),['unfolding']).
% cnf(61,negated_conjecture,(composition(esk1_0,esk2_0)!=complement(join(complement(esk2_0),complement(composition(esk1_0,top))))),inference(rw,[status(thm)],[60,20,theory(equality)])).
% cnf(62,negated_conjecture,(join(one,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)],[44,36,theory(equality)])).
% cnf(71,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[46,26,theory(equality)])).
% cnf(73,plain,(complement(top)=zero),inference(rw,[status(thm)],[56,36,theory(equality)])).
% cnf(80,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[22,36,theory(equality)])).
% cnf(81,plain,(join(join(X2,X1),X3)=join(X1,join(X2,X3))),inference(spm,[status(thm)],[22,20,theory(equality)])).
% cnf(87,plain,(join(X2,join(X1,X3))=join(X1,join(X2,X3))),inference(rw,[status(thm)],[81,22,theory(equality)])).
% cnf(102,plain,(composition(top,X2)=join(composition(X1,X2),composition(complement(X1),X2))),inference(spm,[status(thm)],[28,36,theory(equality)])).
% cnf(114,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[48,20,theory(equality)])).
% cnf(131,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[40,20,theory(equality)])).
% cnf(135,plain,(join(complement(X1),complement(join(complement(join(complement(X1),X2)),complement(complement(join(complement(X1),complement(X2)))))))=join(complement(X1),X2)),inference(spm,[status(thm)],[131,131,theory(equality)])).
% cnf(253,negated_conjecture,(converse(one)=join(converse(one),converse(esk1_0))),inference(spm,[status(thm)],[44,62,theory(equality)])).
% cnf(254,negated_conjecture,(join(one,X1)=join(one,join(esk1_0,X1))),inference(spm,[status(thm)],[22,62,theory(equality)])).
% cnf(255,negated_conjecture,(composition(one,X1)=join(composition(one,X1),composition(esk1_0,X1))),inference(spm,[status(thm)],[28,62,theory(equality)])).
% cnf(307,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[71,42,theory(equality)])).
% cnf(322,plain,(one=converse(one)),inference(spm,[status(thm)],[26,307,theory(equality)])).
% cnf(350,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[307,322,theory(equality)])).
% cnf(351,negated_conjecture,(join(one,converse(esk1_0))=converse(one)),inference(rw,[status(thm)],[253,322,theory(equality)])).
% cnf(352,negated_conjecture,(join(one,converse(esk1_0))=one),inference(rw,[status(thm)],[351,322,theory(equality)])).
% cnf(366,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[114,350,theory(equality)])).
% cnf(378,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[366,322,theory(equality)]),350,theory(equality)])).
% cnf(380,negated_conjecture,(join(one,X1)=join(one,join(converse(esk1_0),X1))),inference(spm,[status(thm)],[22,352,theory(equality)])).
% cnf(381,negated_conjecture,(composition(one,X1)=join(composition(one,X1),composition(converse(esk1_0),X1))),inference(spm,[status(thm)],[28,352,theory(equality)])).
% cnf(384,negated_conjecture,(X1=join(composition(one,X1),composition(converse(esk1_0),X1))),inference(rw,[status(thm)],[381,350,theory(equality)])).
% cnf(385,negated_conjecture,(X1=join(X1,composition(converse(esk1_0),X1))),inference(rw,[status(thm)],[384,350,theory(equality)])).
% cnf(391,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[131,378,theory(equality)])).
% cnf(400,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[378,73,theory(equality)])).
% cnf(404,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[391,36,theory(equality)]),73,theory(equality)])).
% cnf(416,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[22,400,theory(equality)])).
% cnf(422,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[404,20,theory(equality)])).
% cnf(471,negated_conjecture,(join(one,esk1_0)=join(one,composition(converse(esk1_0),esk1_0))),inference(spm,[status(thm)],[254,385,theory(equality)])).
% cnf(475,negated_conjecture,(converse(X1)=join(converse(X1),converse(composition(converse(esk1_0),X1)))),inference(spm,[status(thm)],[44,385,theory(equality)])).
% cnf(479,negated_conjecture,(one=join(one,composition(converse(esk1_0),esk1_0))),inference(rw,[status(thm)],[471,62,theory(equality)])).
% cnf(481,negated_conjecture,(converse(X1)=join(converse(X1),composition(converse(X1),esk1_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[475,46,theory(equality)]),42,theory(equality)])).
% cnf(500,plain,(join(X1,complement(X1))=join(top,complement(X1))),inference(spm,[status(thm)],[80,378,theory(equality)])).
% cnf(514,plain,(top=join(top,complement(X1))),inference(rw,[status(thm)],[500,36,theory(equality)])).
% cnf(534,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[416,422,theory(equality)])).
% cnf(553,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[20,534,theory(equality)])).
% cnf(563,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[422,534,theory(equality)])).
% cnf(601,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[378,563,theory(equality)])).
% cnf(602,plain,(join(top,X1)=top),inference(spm,[status(thm)],[514,563,theory(equality)])).
% cnf(627,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[22,601,theory(equality)])).
% cnf(695,plain,(top=join(X1,top)),inference(spm,[status(thm)],[20,602,theory(equality)])).
% cnf(700,plain,(join(X1,join(complement(X1),X2))=top),inference(rw,[status(thm)],[80,602,theory(equality)])).
% cnf(730,plain,(join(one,converse(complement(one)))=converse(top)),inference(spm,[status(thm)],[64,322,theory(equality)])).
% cnf(826,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[627,131,theory(equality)])).
% cnf(842,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[627,20,theory(equality)])).
% cnf(942,plain,(join(complement(X1),join(X1,X2))=top),inference(spm,[status(thm)],[700,563,theory(equality)])).
% cnf(1105,plain,(join(complement(one),converse(top))=top),inference(spm,[status(thm)],[942,730,theory(equality)])).
% cnf(1132,plain,(converse(top)=join(converse(complement(one)),converse(converse(top)))),inference(spm,[status(thm)],[44,1105,theory(equality)])).
% cnf(1140,plain,(converse(top)=top),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1132,42,theory(equality)]),695,theory(equality)])).
% cnf(1158,plain,(join(converse(X1),converse(complement(X1)))=top),inference(rw,[status(thm)],[64,1140,theory(equality)])).
% cnf(1374,plain,(join(X1,converse(complement(converse(X1))))=top),inference(spm,[status(thm)],[1158,42,theory(equality)])).
% cnf(1699,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[826,20,theory(equality)])).
% cnf(1732,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1699,842,theory(equality)])).
% cnf(1810,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1732,563,theory(equality)])).
% cnf(3560,negated_conjecture,(join(complement(composition(converse(esk1_0),esk1_0)),complement(one))=complement(composition(converse(esk1_0),esk1_0))),inference(spm,[status(thm)],[1810,479,theory(equality)])).
% cnf(8150,negated_conjecture,(join(X1,composition(X1,esk1_0))=X1),inference(spm,[status(thm)],[481,42,theory(equality)])).
% cnf(8198,negated_conjecture,(join(X1,X2)=join(X1,join(composition(X1,esk1_0),X2))),inference(spm,[status(thm)],[22,8150,theory(equality)])).
% cnf(8205,negated_conjecture,(join(complement(composition(X1,esk1_0)),complement(X1))=complement(composition(X1,esk1_0))),inference(spm,[status(thm)],[1810,8150,theory(equality)])).
% cnf(8718,negated_conjecture,(join(X1,composition(esk1_0,X1))=composition(one,X1)),inference(rw,[status(thm)],[255,350,theory(equality)])).
% cnf(8719,negated_conjecture,(join(X1,composition(esk1_0,X1))=X1),inference(rw,[status(thm)],[8718,350,theory(equality)])).
% cnf(8730,negated_conjecture,(join(one,converse(esk1_0))=join(one,composition(esk1_0,converse(esk1_0)))),inference(spm,[status(thm)],[380,8719,theory(equality)])).
% cnf(8765,negated_conjecture,(one=join(one,composition(esk1_0,converse(esk1_0)))),inference(rw,[status(thm)],[8730,352,theory(equality)])).
% cnf(8794,negated_conjecture,(composition(one,X1)=join(composition(one,X1),composition(composition(esk1_0,converse(esk1_0)),X1))),inference(spm,[status(thm)],[28,8765,theory(equality)])).
% cnf(8809,negated_conjecture,(X1=join(composition(one,X1),composition(composition(esk1_0,converse(esk1_0)),X1))),inference(rw,[status(thm)],[8794,350,theory(equality)])).
% cnf(8810,negated_conjecture,(X1=join(X1,composition(esk1_0,composition(converse(esk1_0),X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[8809,350,theory(equality)]),24,theory(equality)])).
% cnf(10767,negated_conjecture,(join(X1,composition(X1,esk1_0))=join(X1,composition(esk1_0,composition(X1,esk1_0)))),inference(spm,[status(thm)],[8198,8719,theory(equality)])).
% cnf(10792,negated_conjecture,(join(X1,composition(top,esk1_0))=join(X1,composition(complement(X1),esk1_0))),inference(spm,[status(thm)],[8198,102,theory(equality)])).
% cnf(10875,negated_conjecture,(X1=join(X1,composition(esk1_0,composition(X1,esk1_0)))),inference(rw,[status(thm)],[10767,8150,theory(equality)])).
% cnf(14964,negated_conjecture,(join(complement(one),complement(composition(converse(esk1_0),esk1_0)))=complement(composition(converse(esk1_0),esk1_0))),inference(rw,[status(thm)],[3560,20,theory(equality)])).
% cnf(14990,negated_conjecture,(join(complement(join(complement(composition(esk1_0,one)),complement(esk1_0))),composition(complement(join(complement(esk1_0),complement(composition(esk1_0,converse(one))))),complement(complement(composition(converse(esk1_0),esk1_0)))))=composition(complement(join(complement(esk1_0),complement(composition(esk1_0,converse(one))))),complement(complement(composition(converse(esk1_0),esk1_0))))),inference(spm,[status(thm)],[59,14964,theory(equality)])).
% cnf(15010,negated_conjecture,(join(esk1_0,composition(esk1_0,composition(converse(esk1_0),esk1_0)))=composition(complement(join(complement(esk1_0),complement(composition(esk1_0,converse(one))))),complement(complement(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)],[14990,26,theory(equality)]),601,theory(equality)]),563,theory(equality)]),322,theory(equality)]),26,theory(equality)]),601,theory(equality)]),563,theory(equality)]),563,theory(equality)])).
% cnf(15011,negated_conjecture,(join(esk1_0,composition(esk1_0,composition(converse(esk1_0),esk1_0)))=composition(esk1_0,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)],[15010,322,theory(equality)]),26,theory(equality)]),601,theory(equality)]),563,theory(equality)]),563,theory(equality)])).
% cnf(18233,plain,(join(complement(X1),complement(join(complement(X1),complement(X2))))=join(complement(X1),X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[135,563,theory(equality)]),87,theory(equality)]),20,theory(equality)]),1810,theory(equality)])).
% cnf(18287,plain,(join(X1,complement(join(X1,complement(X2))))=join(X1,X2)),inference(spm,[status(thm)],[18233,563,theory(equality)])).
% cnf(18611,plain,(join(X1,complement(join(X1,X2)))=join(X1,join(X1,complement(X2)))),inference(spm,[status(thm)],[18287,18287,theory(equality)])).
% cnf(18719,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[18611,627,theory(equality)])).
% cnf(18886,plain,(join(converse(X1),complement(top))=join(converse(X1),complement(converse(complement(X1))))),inference(spm,[status(thm)],[18719,1158,theory(equality)])).
% cnf(18973,plain,(join(X1,complement(top))=join(X1,complement(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[18719,1374,theory(equality)])).
% cnf(19101,plain,(converse(X1)=join(converse(X1),complement(converse(complement(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[18886,73,theory(equality)]),553,theory(equality)])).
% cnf(19215,plain,(X1=join(X1,complement(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[18973,73,theory(equality)]),553,theory(equality)])).
% cnf(20198,plain,(converse(converse(X1))=join(converse(converse(X1)),converse(complement(converse(complement(X1)))))),inference(spm,[status(thm)],[44,19101,theory(equality)])).
% cnf(20235,plain,(X1=join(converse(converse(X1)),converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[20198,42,theory(equality)])).
% cnf(20236,plain,(X1=join(X1,converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[20235,42,theory(equality)])).
% cnf(20314,plain,(join(complement(X1),converse(complement(converse(X1))))=complement(X1)),inference(spm,[status(thm)],[20236,563,theory(equality)])).
% cnf(20367,plain,(join(complement(converse(complement(converse(X1)))),complement(complement(X1)))=complement(converse(complement(converse(X1))))),inference(spm,[status(thm)],[1810,20314,theory(equality)])).
% cnf(20407,plain,(X1=complement(converse(complement(converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[20367,563,theory(equality)]),20,theory(equality)]),19215,theory(equality)])).
% cnf(20454,plain,(complement(X1)=converse(complement(converse(X1)))),inference(spm,[status(thm)],[563,20407,theory(equality)])).
% cnf(20527,plain,(converse(complement(X1))=complement(converse(X1))),inference(spm,[status(thm)],[42,20454,theory(equality)])).
% cnf(25263,negated_conjecture,(join(X1,complement(join(X1,composition(top,esk1_0))))=join(X1,complement(composition(complement(X1),esk1_0)))),inference(spm,[status(thm)],[18719,10792,theory(equality)])).
% cnf(25330,negated_conjecture,(join(X1,complement(composition(top,esk1_0)))=join(X1,complement(composition(complement(X1),esk1_0)))),inference(rw,[status(thm)],[25263,18719,theory(equality)])).
% cnf(27325,negated_conjecture,(esk1_0=composition(esk1_0,composition(converse(esk1_0),esk1_0))),inference(rw,[status(thm)],[15011,8810,theory(equality)])).
% cnf(27352,negated_conjecture,(join(converse(esk1_0),esk1_0)=converse(esk1_0)),inference(spm,[status(thm)],[10875,27325,theory(equality)])).
% cnf(27370,negated_conjecture,(join(esk1_0,converse(esk1_0))=converse(esk1_0)),inference(rw,[status(thm)],[27352,20,theory(equality)])).
% cnf(27373,negated_conjecture,(converse(converse(esk1_0))=join(converse(esk1_0),converse(converse(esk1_0)))),inference(spm,[status(thm)],[44,27370,theory(equality)])).
% cnf(27392,negated_conjecture,(esk1_0=join(converse(esk1_0),converse(converse(esk1_0)))),inference(rw,[status(thm)],[27373,42,theory(equality)])).
% cnf(27393,negated_conjecture,(esk1_0=converse(esk1_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[27392,42,theory(equality)]),20,theory(equality)]),27370,theory(equality)])).
% cnf(37260,negated_conjecture,(join(complement(X1),complement(composition(X1,esk1_0)))=complement(composition(X1,esk1_0))),inference(rw,[status(thm)],[8205,20,theory(equality)])).
% cnf(37341,negated_conjecture,(join(X1,complement(composition(complement(X1),esk1_0)))=complement(composition(complement(X1),esk1_0))),inference(spm,[status(thm)],[37260,563,theory(equality)])).
% cnf(61529,negated_conjecture,(join(X1,complement(composition(top,esk1_0)))=complement(composition(complement(X1),esk1_0))),inference(rw,[status(thm)],[37341,25330,theory(equality)])).
% cnf(61557,negated_conjecture,(complement(join(X1,complement(composition(top,esk1_0))))=composition(complement(X1),esk1_0)),inference(spm,[status(thm)],[563,61529,theory(equality)])).
% cnf(61903,negated_conjecture,(converse(complement(join(X1,complement(composition(top,esk1_0)))))=composition(converse(esk1_0),converse(complement(X1)))),inference(spm,[status(thm)],[46,61557,theory(equality)])).
% cnf(61996,negated_conjecture,(complement(join(converse(X1),complement(composition(esk1_0,top))))=composition(converse(esk1_0),converse(complement(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[61903,20527,theory(equality)]),44,theory(equality)]),20527,theory(equality)]),46,theory(equality)]),27393,theory(equality)]),1140,theory(equality)])).
% cnf(61997,negated_conjecture,(complement(join(converse(X1),complement(composition(esk1_0,top))))=composition(esk1_0,complement(converse(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[61996,27393,theory(equality)]),20527,theory(equality)])).
% cnf(64066,negated_conjecture,(composition(esk1_0,complement(converse(X1)))=complement(join(complement(composition(esk1_0,top)),converse(X1)))),inference(rw,[status(thm)],[61997,20,theory(equality)])).
% cnf(64130,negated_conjecture,(composition(esk1_0,complement(X1))=complement(join(complement(composition(esk1_0,top)),X1))),inference(spm,[status(thm)],[64066,42,theory(equality)])).
% cnf(64292,negated_conjecture,(composition(esk1_0,X1)=complement(join(complement(composition(esk1_0,top)),complement(X1)))),inference(spm,[status(thm)],[64130,563,theory(equality)])).
% cnf(1084869,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[61,64292,theory(equality)]),20,theory(equality)])).
% cnf(1084870,negated_conjecture,($false),inference(cn,[status(thm)],[1084869,theory(equality)])).
% cnf(1084871,negated_conjecture,($false),1084870,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 13419
% # ...of these trivial : 8750
% # ...subsumed : 2885
% # ...remaining for further processing: 1784
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 620
% # Generated clauses : 491665
% # ...of the previous two non-trivial : 239527
% # Contextual simplify-reflections : 0
% # Paramodulations : 491665
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1164
% # Positive orientable unit clauses: 1155
% # Positive unorientable unit clauses: 9
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 158331
% # ...number of literals in the above : 158331
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 346
% # Rewrite failures with RHS unbound : 225
% # Indexed BW rewrite attempts : 26068
% # Indexed BW rewrite successes : 751
% # Backwards rewriting index: 629 leaves, 4.28+/-7.974 terms/leaf
% # Paramod-from index: 374 leaves, 3.13+/-4.539 terms/leaf
% # Paramod-into index: 601 leaves, 4.20+/-7.868 terms/leaf
% # -------------------------------------------------
% # User time : 19.237 s
% # System time : 0.763 s
% # Total time : 20.000 s
% # Maximum resident set size: 0 pages
% PrfWatch: 38.46 CPU 39.58 WC
% FINAL PrfWatch: 38.46 CPU 39.58 WC
% SZS output end Solution for /tmp/SystemOnTPTP7136/REL026+3.tptp
%
%------------------------------------------------------------------------------