TSTP Solution File: REL041+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL041+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:00:36 EST 2010
% Result : Theorem 5.66s
% Output : Solution 5.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/SystemOnTPTP13112/REL041+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13112/REL041+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13112/REL041+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 13208
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.92 CPU 4.01 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(14, 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(16, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(17, conjecture,![X1]:(join(composition(converse(X1),X1),one)=one=>![X2]:meet(composition(X1,X2),composition(X1,complement(X2)))=zero),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:(join(composition(converse(X1),X1),one)=one=>![X2]:meet(composition(X1,X2),composition(X1,complement(X2)))=zero)),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(27, plain,![X4]:![X5]:![X6]:composition(X4,composition(X5,X6))=composition(composition(X4,X5),X6),inference(variable_rename,[status(thm)],[5])).
% cnf(28,plain,(composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[27])).
% 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(45, 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)],[14])).
% cnf(46,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)],[45])).
% 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]:(join(composition(converse(X1),X1),one)=one&?[X2]:~(meet(composition(X1,X2),composition(X1,complement(X2)))=zero)),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,?[X3]:(join(composition(converse(X3),X3),one)=one&?[X4]:~(meet(composition(X3,X4),composition(X3,complement(X4)))=zero)),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,(join(composition(converse(esk1_0),esk1_0),one)=one&~(meet(composition(esk1_0,esk2_0),composition(esk1_0,complement(esk2_0)))=zero)),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(meet(composition(esk1_0,esk2_0),composition(esk1_0,complement(esk2_0)))!=zero),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,negated_conjecture,(join(composition(converse(esk1_0),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)],[42,26,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)],[46,26,theory(equality)]),26,theory(equality)]),26,theory(equality)]),26,theory(equality)]),26,theory(equality)]),['unfolding']).
% cnf(60,negated_conjecture,(complement(join(complement(composition(esk1_0,esk2_0)),complement(composition(esk1_0,complement(esk2_0)))))!=zero),inference(rw,[status(thm)],[54,26,theory(equality)]),['unfolding']).
% cnf(61,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)],[56,50,theory(equality)])).
% cnf(75,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[50,22,theory(equality)])).
% cnf(76,plain,(join(X1,join(X2,X3))=join(X3,join(X1,X2))),inference(spm,[status(thm)],[20,22,theory(equality)])).
% cnf(82,plain,(join(join(X2,X1),X3)=join(X1,join(X2,X3))),inference(spm,[status(thm)],[22,20,theory(equality)])).
% cnf(88,plain,(join(X2,join(X1,X3))=join(X1,join(X2,X3))),inference(rw,[status(thm)],[82,22,theory(equality)])).
% cnf(102,negated_conjecture,(composition(one,X1)=join(composition(one,X1),composition(composition(converse(esk1_0),esk1_0),X1))),inference(spm,[status(thm)],[32,61,theory(equality)])).
% cnf(112,negated_conjecture,(composition(one,X1)=join(composition(one,X1),composition(converse(esk1_0),composition(esk1_0,X1)))),inference(rw,[status(thm)],[102,28,theory(equality)])).
% cnf(117,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[40,20,theory(equality)])).
% cnf(134,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[24,20,theory(equality)])).
% cnf(152,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(153,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)],[152,20,theory(equality)])).
% cnf(158,plain,(join(complement(join(complement(join(complement(composition(X1,X2)),complement(X3))),join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),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)],[134,153,theory(equality)])).
% cnf(296,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[71,34,theory(equality)])).
% cnf(315,plain,(one=converse(one)),inference(spm,[status(thm)],[30,296,theory(equality)])).
% cnf(344,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[296,315,theory(equality)])).
% cnf(358,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[117,344,theory(equality)])).
% cnf(370,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[358,315,theory(equality)]),344,theory(equality)])).
% cnf(396,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[134,370,theory(equality)])).
% cnf(405,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[370,73,theory(equality)])).
% cnf(409,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[396,50,theory(equality)]),73,theory(equality)])).
% cnf(421,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[22,405,theory(equality)])).
% cnf(427,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[409,20,theory(equality)])).
% cnf(466,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[421,427,theory(equality)])).
% cnf(476,plain,(complement(zero)=top),inference(spm,[status(thm)],[50,466,theory(equality)])).
% cnf(477,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[20,466,theory(equality)])).
% cnf(486,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[427,466,theory(equality)])).
% cnf(508,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[370,486,theory(equality)])).
% cnf(532,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[22,508,theory(equality)])).
% cnf(584,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[532,134,theory(equality)])).
% cnf(589,plain,(join(X1,top)=top),inference(spm,[status(thm)],[532,50,theory(equality)])).
% cnf(590,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[532,20,theory(equality)])).
% cnf(614,plain,(top=join(top,X1)),inference(spm,[status(thm)],[20,589,theory(equality)])).
% cnf(615,plain,(converse(top)=join(converse(X1),converse(top))),inference(spm,[status(thm)],[36,589,theory(equality)])).
% cnf(617,plain,(composition(top,X2)=join(composition(X1,X2),composition(top,X2))),inference(spm,[status(thm)],[32,589,theory(equality)])).
% cnf(714,plain,(join(X1,converse(top))=converse(top)),inference(spm,[status(thm)],[615,34,theory(equality)])).
% cnf(723,plain,(converse(top)=top),inference(spm,[status(thm)],[614,714,theory(equality)])).
% cnf(745,plain,(join(converse(X1),converse(complement(X1)))=top),inference(rw,[status(thm)],[64,723,theory(equality)])).
% cnf(814,plain,(join(one,converse(complement(one)))=top),inference(spm,[status(thm)],[745,315,theory(equality)])).
% cnf(856,plain,(composition(top,X1)=join(composition(one,X1),composition(converse(complement(one)),X1))),inference(spm,[status(thm)],[32,814,theory(equality)])).
% cnf(862,plain,(composition(top,X1)=join(X1,composition(converse(complement(one)),X1))),inference(rw,[status(thm)],[856,344,theory(equality)])).
% cnf(1180,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[584,20,theory(equality)])).
% cnf(1209,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1180,590,theory(equality)])).
% cnf(1266,plain,(join(X1,X3)=join(X1,join(complement(join(X2,complement(X1))),X3))),inference(spm,[status(thm)],[22,1209,theory(equality)])).
% cnf(1276,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1209,486,theory(equality)])).
% cnf(1506,plain,(composition(top,top)=top),inference(spm,[status(thm)],[614,862,theory(equality)])).
% cnf(1534,plain,(join(complement(top),composition(converse(top),complement(top)))=complement(top)),inference(spm,[status(thm)],[117,1506,theory(equality)])).
% cnf(1543,plain,(composition(top,zero)=complement(top)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1534,73,theory(equality)]),723,theory(equality)]),73,theory(equality)]),466,theory(equality)])).
% cnf(1544,plain,(composition(top,zero)=zero),inference(rw,[status(thm)],[1543,73,theory(equality)])).
% cnf(2075,plain,(join(X1,join(X2,complement(join(X2,X1))))=top),inference(spm,[status(thm)],[75,20,theory(equality)])).
% cnf(4832,plain,(join(composition(X1,zero),zero)=zero),inference(spm,[status(thm)],[617,1544,theory(equality)])).
% cnf(4868,plain,(composition(X1,zero)=zero),inference(rw,[status(thm)],[4832,477,theory(equality)])).
% cnf(6443,negated_conjecture,(join(X1,composition(converse(esk1_0),composition(esk1_0,X1)))=composition(one,X1)),inference(rw,[status(thm)],[112,344,theory(equality)])).
% cnf(6444,negated_conjecture,(join(X1,composition(converse(esk1_0),composition(esk1_0,X1)))=X1),inference(rw,[status(thm)],[6443,344,theory(equality)])).
% cnf(25379,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),complement(complement(X1)))))),inference(spm,[status(thm)],[1266,134,theory(equality)])).
% cnf(25636,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),X1)))),inference(rw,[status(thm)],[25379,486,theory(equality)])).
% cnf(25737,plain,(join(X1,complement(join(X2,X1)))=join(X1,complement(X2))),inference(spm,[status(thm)],[25636,486,theory(equality)])).
% cnf(26803,plain,(join(join(X1,complement(join(X1,X2))),complement(top))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(spm,[status(thm)],[25737,2075,theory(equality)])).
% cnf(27049,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)],[26803,73,theory(equality)]),22,theory(equality)]),477,theory(equality)])).
% cnf(27050,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[27049,22,theory(equality)]),20,theory(equality)]),1276,theory(equality)])).
% cnf(27263,negated_conjecture,(join(X1,complement(X1))=join(X1,complement(composition(converse(esk1_0),composition(esk1_0,X1))))),inference(spm,[status(thm)],[27050,6444,theory(equality)])).
% cnf(27514,negated_conjecture,(top=join(X1,complement(composition(converse(esk1_0),composition(esk1_0,X1))))),inference(rw,[status(thm)],[27263,50,theory(equality)])).
% cnf(38927,plain,(join(complement(X3),join(complement(composition(X1,X2)),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)],[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)],[158,88,theory(equality)]),486,theory(equality)]),76,theory(equality)]),20,theory(equality)]),27050,theory(equality)]),88,theory(equality)]),25737,theory(equality)]),486,theory(equality)]),76,theory(equality)]),20,theory(equality)]),532,theory(equality)])).
% cnf(39020,negated_conjecture,(join(complement(composition(esk1_0,complement(X1))),join(complement(composition(esk1_0,X1)),complement(composition(esk1_0,complement(top)))))=join(complement(composition(esk1_0,X1)),complement(composition(esk1_0,complement(X1))))),inference(spm,[status(thm)],[38927,27514,theory(equality)])).
% cnf(39163,negated_conjecture,(top=join(complement(composition(esk1_0,X1)),complement(composition(esk1_0,complement(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[39020,73,theory(equality)]),4868,theory(equality)]),476,theory(equality)]),589,theory(equality)]),589,theory(equality)])).
% cnf(154406,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[60,39163,theory(equality)]),73,theory(equality)])).
% cnf(154407,negated_conjecture,($false),inference(cn,[status(thm)],[154406,theory(equality)])).
% cnf(154408,negated_conjecture,($false),154407,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2529
% # ...of these trivial : 1485
% # ...subsumed : 416
% # ...remaining for further processing: 628
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 222
% # Generated clauses : 71282
% # ...of the previous two non-trivial : 35562
% # Contextual simplify-reflections : 0
% # Paramodulations : 71282
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 406
% # Positive orientable unit clauses: 402
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 25427
% # ...number of literals in the above : 25427
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 21
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2682
% # Indexed BW rewrite successes : 250
% # Backwards rewriting index: 379 leaves, 2.62+/-4.631 terms/leaf
% # Paramod-from index: 203 leaves, 2.01+/-2.419 terms/leaf
% # Paramod-into index: 362 leaves, 2.62+/-4.677 terms/leaf
% # -------------------------------------------------
% # User time : 2.327 s
% # System time : 0.102 s
% # Total time : 2.429 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.85 CPU 4.97 WC
% FINAL PrfWatch: 4.85 CPU 4.97 WC
% SZS output end Solution for /tmp/SystemOnTPTP13112/REL041+2.tptp
%
%------------------------------------------------------------------------------