TSTP Solution File: LCL515+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL515+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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 13:45:06 EST 2010
% Result : Theorem 38.46s
% Output : Solution 38.46s
% 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/SystemOnTPTP31856/LCL515+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31856/LCL515+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31856/LCL515+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 31952
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.02 WC
% PrfWatch: 3.92 CPU 4.03 WC
% PrfWatch: 5.92 CPU 6.03 WC
% PrfWatch: 7.91 CPU 8.04 WC
% PrfWatch: 9.90 CPU 10.04 WC
% PrfWatch: 11.89 CPU 12.05 WC
% PrfWatch: 13.88 CPU 14.05 WC
% PrfWatch: 15.88 CPU 16.06 WC
% PrfWatch: 17.87 CPU 18.06 WC
% PrfWatch: 19.78 CPU 20.11 WC
% PrfWatch: 21.37 CPU 22.19 WC
% PrfWatch: 23.24 CPU 24.19 WC
% PrfWatch: 25.23 CPU 26.20 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 27.21 CPU 28.20 WC
% PrfWatch: 29.20 CPU 30.21 WC
% PrfWatch: 31.20 CPU 32.21 WC
% PrfWatch: 33.17 CPU 34.21 WC
% PrfWatch: 35.17 CPU 36.22 WC
% PrfWatch: 37.16 CPU 38.22 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,(cn1<=>![X1]:![X2]:![X3]:is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))),file('/tmp/SRASS.s.p', cn1)).
% fof(2, axiom,modus_ponens,file('/tmp/SRASS.s.p', rosser_modus_ponens)).
% fof(3, axiom,kn1,file('/tmp/SRASS.s.p', rosser_kn1)).
% fof(4, axiom,kn2,file('/tmp/SRASS.s.p', rosser_kn2)).
% fof(5, axiom,kn3,file('/tmp/SRASS.s.p', rosser_kn3)).
% fof(6, axiom,op_implies_and,file('/tmp/SRASS.s.p', rosser_op_implies_and)).
% fof(7, axiom,op_equiv,file('/tmp/SRASS.s.p', rosser_op_equiv)).
% fof(8, axiom,substitution_of_equivalents,file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(10, axiom,(modus_ponens<=>![X4]:![X5]:((is_a_theorem(X4)&is_a_theorem(implies(X4,X5)))=>is_a_theorem(X5))),file('/tmp/SRASS.s.p', modus_ponens)).
% fof(14, axiom,op_or,file('/tmp/SRASS.s.p', rosser_op_or)).
% fof(22, axiom,(kn1<=>![X1]:is_a_theorem(implies(X1,and(X1,X1)))),file('/tmp/SRASS.s.p', kn1)).
% fof(23, axiom,(kn2<=>![X1]:![X2]:is_a_theorem(implies(and(X1,X2),X1))),file('/tmp/SRASS.s.p', kn2)).
% fof(29, axiom,(op_or=>![X4]:![X5]:or(X4,X5)=not(and(not(X4),not(X5)))),file('/tmp/SRASS.s.p', op_or)).
% fof(31, axiom,(substitution_of_equivalents<=>![X4]:![X5]:(is_a_theorem(equiv(X4,X5))=>X4=X5)),file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(38, axiom,(kn3<=>![X1]:![X2]:![X3]:is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))),file('/tmp/SRASS.s.p', kn3)).
% fof(39, axiom,(op_implies_and=>![X4]:![X5]:implies(X4,X5)=not(and(X4,not(X5)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(41, axiom,(op_equiv=>![X4]:![X5]:equiv(X4,X5)=and(implies(X4,X5),implies(X5,X4))),file('/tmp/SRASS.s.p', op_equiv)).
% fof(43, conjecture,cn1,file('/tmp/SRASS.s.p', luka_cn1)).
% fof(44, negated_conjecture,~(cn1),inference(assume_negation,[status(cth)],[43])).
% fof(45, negated_conjecture,~(cn1),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(46, plain,((~(cn1)|![X1]:![X2]:![X3]:is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))&(?[X1]:?[X2]:?[X3]:~(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))|cn1)),inference(fof_nnf,[status(thm)],[1])).
% fof(47, plain,((~(cn1)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))))&(?[X7]:?[X8]:?[X9]:~(is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9)))))|cn1)),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,((~(cn1)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))))&(~(is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))))|cn1)),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X4]:![X5]:![X6]:((is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6))))|~(cn1))&(~(is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))))|cn1)),inference(shift_quantors,[status(thm)],[48])).
% cnf(50,plain,(cn1|~is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0))))),inference(split_conjunct,[status(thm)],[49])).
% cnf(52,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[2])).
% cnf(53,plain,(kn1),inference(split_conjunct,[status(thm)],[3])).
% cnf(54,plain,(kn2),inference(split_conjunct,[status(thm)],[4])).
% cnf(55,plain,(kn3),inference(split_conjunct,[status(thm)],[5])).
% cnf(56,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[6])).
% cnf(57,plain,(op_equiv),inference(split_conjunct,[status(thm)],[7])).
% cnf(58,plain,(substitution_of_equivalents),inference(split_conjunct,[status(thm)],[8])).
% fof(60, plain,((~(modus_ponens)|![X4]:![X5]:((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5)))&(?[X4]:?[X5]:((is_a_theorem(X4)&is_a_theorem(implies(X4,X5)))&~(is_a_theorem(X5)))|modus_ponens)),inference(fof_nnf,[status(thm)],[10])).
% fof(61, plain,((~(modus_ponens)|![X6]:![X7]:((~(is_a_theorem(X6))|~(is_a_theorem(implies(X6,X7))))|is_a_theorem(X7)))&(?[X8]:?[X9]:((is_a_theorem(X8)&is_a_theorem(implies(X8,X9)))&~(is_a_theorem(X9)))|modus_ponens)),inference(variable_rename,[status(thm)],[60])).
% fof(62, plain,((~(modus_ponens)|![X6]:![X7]:((~(is_a_theorem(X6))|~(is_a_theorem(implies(X6,X7))))|is_a_theorem(X7)))&(((is_a_theorem(esk4_0)&is_a_theorem(implies(esk4_0,esk5_0)))&~(is_a_theorem(esk5_0)))|modus_ponens)),inference(skolemize,[status(esa)],[61])).
% fof(63, plain,![X6]:![X7]:((((~(is_a_theorem(X6))|~(is_a_theorem(implies(X6,X7))))|is_a_theorem(X7))|~(modus_ponens))&(((is_a_theorem(esk4_0)&is_a_theorem(implies(esk4_0,esk5_0)))&~(is_a_theorem(esk5_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[62])).
% fof(64, plain,![X6]:![X7]:((((~(is_a_theorem(X6))|~(is_a_theorem(implies(X6,X7))))|is_a_theorem(X7))|~(modus_ponens))&(((is_a_theorem(esk4_0)|modus_ponens)&(is_a_theorem(implies(esk4_0,esk5_0))|modus_ponens))&(~(is_a_theorem(esk5_0))|modus_ponens))),inference(distribute,[status(thm)],[63])).
% cnf(68,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[64])).
% cnf(87,plain,(op_or),inference(split_conjunct,[status(thm)],[14])).
% fof(125, plain,((~(kn1)|![X1]:is_a_theorem(implies(X1,and(X1,X1))))&(?[X1]:~(is_a_theorem(implies(X1,and(X1,X1))))|kn1)),inference(fof_nnf,[status(thm)],[22])).
% fof(126, plain,((~(kn1)|![X2]:is_a_theorem(implies(X2,and(X2,X2))))&(?[X3]:~(is_a_theorem(implies(X3,and(X3,X3))))|kn1)),inference(variable_rename,[status(thm)],[125])).
% fof(127, plain,((~(kn1)|![X2]:is_a_theorem(implies(X2,and(X2,X2))))&(~(is_a_theorem(implies(esk26_0,and(esk26_0,esk26_0))))|kn1)),inference(skolemize,[status(esa)],[126])).
% fof(128, plain,![X2]:((is_a_theorem(implies(X2,and(X2,X2)))|~(kn1))&(~(is_a_theorem(implies(esk26_0,and(esk26_0,esk26_0))))|kn1)),inference(shift_quantors,[status(thm)],[127])).
% cnf(130,plain,(is_a_theorem(implies(X1,and(X1,X1)))|~kn1),inference(split_conjunct,[status(thm)],[128])).
% fof(131, plain,((~(kn2)|![X1]:![X2]:is_a_theorem(implies(and(X1,X2),X1)))&(?[X1]:?[X2]:~(is_a_theorem(implies(and(X1,X2),X1)))|kn2)),inference(fof_nnf,[status(thm)],[23])).
% fof(132, plain,((~(kn2)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3)))&(?[X5]:?[X6]:~(is_a_theorem(implies(and(X5,X6),X5)))|kn2)),inference(variable_rename,[status(thm)],[131])).
% fof(133, plain,((~(kn2)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3)))&(~(is_a_theorem(implies(and(esk27_0,esk28_0),esk27_0)))|kn2)),inference(skolemize,[status(esa)],[132])).
% fof(134, plain,![X3]:![X4]:((is_a_theorem(implies(and(X3,X4),X3))|~(kn2))&(~(is_a_theorem(implies(and(esk27_0,esk28_0),esk27_0)))|kn2)),inference(shift_quantors,[status(thm)],[133])).
% cnf(136,plain,(is_a_theorem(implies(and(X1,X2),X1))|~kn2),inference(split_conjunct,[status(thm)],[134])).
% fof(167, plain,(~(op_or)|![X4]:![X5]:or(X4,X5)=not(and(not(X4),not(X5)))),inference(fof_nnf,[status(thm)],[29])).
% fof(168, plain,(~(op_or)|![X6]:![X7]:or(X6,X7)=not(and(not(X6),not(X7)))),inference(variable_rename,[status(thm)],[167])).
% fof(169, plain,![X6]:![X7]:(or(X6,X7)=not(and(not(X6),not(X7)))|~(op_or)),inference(shift_quantors,[status(thm)],[168])).
% cnf(170,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[169])).
% fof(175, plain,((~(substitution_of_equivalents)|![X4]:![X5]:(~(is_a_theorem(equiv(X4,X5)))|X4=X5))&(?[X4]:?[X5]:(is_a_theorem(equiv(X4,X5))&~(X4=X5))|substitution_of_equivalents)),inference(fof_nnf,[status(thm)],[31])).
% fof(176, plain,((~(substitution_of_equivalents)|![X6]:![X7]:(~(is_a_theorem(equiv(X6,X7)))|X6=X7))&(?[X8]:?[X9]:(is_a_theorem(equiv(X8,X9))&~(X8=X9))|substitution_of_equivalents)),inference(variable_rename,[status(thm)],[175])).
% fof(177, plain,((~(substitution_of_equivalents)|![X6]:![X7]:(~(is_a_theorem(equiv(X6,X7)))|X6=X7))&((is_a_theorem(equiv(esk40_0,esk41_0))&~(esk40_0=esk41_0))|substitution_of_equivalents)),inference(skolemize,[status(esa)],[176])).
% fof(178, plain,![X6]:![X7]:(((~(is_a_theorem(equiv(X6,X7)))|X6=X7)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk40_0,esk41_0))&~(esk40_0=esk41_0))|substitution_of_equivalents)),inference(shift_quantors,[status(thm)],[177])).
% fof(179, plain,![X6]:![X7]:(((~(is_a_theorem(equiv(X6,X7)))|X6=X7)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk40_0,esk41_0))|substitution_of_equivalents)&(~(esk40_0=esk41_0)|substitution_of_equivalents))),inference(distribute,[status(thm)],[178])).
% cnf(182,plain,(X1=X2|~substitution_of_equivalents|~is_a_theorem(equiv(X1,X2))),inference(split_conjunct,[status(thm)],[179])).
% fof(219, plain,((~(kn3)|![X1]:![X2]:![X3]:is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1))))))&(?[X1]:?[X2]:?[X3]:~(is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1))))))|kn3)),inference(fof_nnf,[status(thm)],[38])).
% fof(220, plain,((~(kn3)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(not(and(X5,X6)),not(and(X6,X4))))))&(?[X7]:?[X8]:?[X9]:~(is_a_theorem(implies(implies(X7,X8),implies(not(and(X8,X9)),not(and(X9,X7))))))|kn3)),inference(variable_rename,[status(thm)],[219])).
% fof(221, plain,((~(kn3)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(not(and(X5,X6)),not(and(X6,X4))))))&(~(is_a_theorem(implies(implies(esk53_0,esk54_0),implies(not(and(esk54_0,esk55_0)),not(and(esk55_0,esk53_0))))))|kn3)),inference(skolemize,[status(esa)],[220])).
% fof(222, plain,![X4]:![X5]:![X6]:((is_a_theorem(implies(implies(X4,X5),implies(not(and(X5,X6)),not(and(X6,X4)))))|~(kn3))&(~(is_a_theorem(implies(implies(esk53_0,esk54_0),implies(not(and(esk54_0,esk55_0)),not(and(esk55_0,esk53_0))))))|kn3)),inference(shift_quantors,[status(thm)],[221])).
% cnf(224,plain,(is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))|~kn3),inference(split_conjunct,[status(thm)],[222])).
% fof(225, plain,(~(op_implies_and)|![X4]:![X5]:implies(X4,X5)=not(and(X4,not(X5)))),inference(fof_nnf,[status(thm)],[39])).
% fof(226, plain,(~(op_implies_and)|![X6]:![X7]:implies(X6,X7)=not(and(X6,not(X7)))),inference(variable_rename,[status(thm)],[225])).
% fof(227, plain,![X6]:![X7]:(implies(X6,X7)=not(and(X6,not(X7)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[226])).
% cnf(228,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[227])).
% fof(233, plain,(~(op_equiv)|![X4]:![X5]:equiv(X4,X5)=and(implies(X4,X5),implies(X5,X4))),inference(fof_nnf,[status(thm)],[41])).
% fof(234, plain,(~(op_equiv)|![X6]:![X7]:equiv(X6,X7)=and(implies(X6,X7),implies(X7,X6))),inference(variable_rename,[status(thm)],[233])).
% fof(235, plain,![X6]:![X7]:(equiv(X6,X7)=and(implies(X6,X7),implies(X7,X6))|~(op_equiv)),inference(shift_quantors,[status(thm)],[234])).
% cnf(236,plain,(equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv),inference(split_conjunct,[status(thm)],[235])).
% cnf(238,negated_conjecture,(~cn1),inference(split_conjunct,[status(thm)],[45])).
% cnf(248,plain,(X1=X2|$false|~is_a_theorem(equiv(X1,X2))),inference(rw,[status(thm)],[182,58,theory(equality)])).
% cnf(249,plain,(X1=X2|~is_a_theorem(equiv(X1,X2))),inference(cn,[status(thm)],[248,theory(equality)])).
% cnf(250,plain,(is_a_theorem(implies(X1,and(X1,X1)))|$false),inference(rw,[status(thm)],[130,53,theory(equality)])).
% cnf(251,plain,(is_a_theorem(implies(X1,and(X1,X1)))),inference(cn,[status(thm)],[250,theory(equality)])).
% cnf(252,plain,(is_a_theorem(implies(and(X1,X2),X1))|$false),inference(rw,[status(thm)],[136,54,theory(equality)])).
% cnf(253,plain,(is_a_theorem(implies(and(X1,X2),X1))),inference(cn,[status(thm)],[252,theory(equality)])).
% cnf(257,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[228,56,theory(equality)])).
% cnf(258,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[257,theory(equality)])).
% cnf(259,plain,(not(and(X1,implies(X2,X3)))=implies(X1,and(X2,not(X3)))),inference(spm,[status(thm)],[258,258,theory(equality)])).
% cnf(260,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[68,52,theory(equality)])).
% cnf(261,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[260,theory(equality)])).
% cnf(263,plain,(is_a_theorem(and(X1,X1))|~is_a_theorem(X1)),inference(spm,[status(thm)],[261,251,theory(equality)])).
% cnf(264,plain,(~is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0))))),inference(sr,[status(thm)],[50,238,theory(equality)])).
% cnf(265,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[170,258,theory(equality)])).
% cnf(266,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[265,87,theory(equality)])).
% cnf(267,plain,(implies(not(X1),X2)=or(X1,X2)),inference(cn,[status(thm)],[266,theory(equality)])).
% cnf(268,plain,(is_a_theorem(or(X1,and(not(X1),not(X1))))),inference(spm,[status(thm)],[251,267,theory(equality)])).
% cnf(269,plain,(is_a_theorem(X1)|~is_a_theorem(or(X2,X1))|~is_a_theorem(not(X2))),inference(spm,[status(thm)],[261,267,theory(equality)])).
% cnf(270,plain,(implies(implies(X1,X2),X3)=or(and(X1,not(X2)),X3)),inference(spm,[status(thm)],[267,258,theory(equality)])).
% cnf(278,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)|$false),inference(rw,[status(thm)],[236,57,theory(equality)])).
% cnf(279,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)),inference(cn,[status(thm)],[278,theory(equality)])).
% cnf(283,plain,(and(or(X1,X2),implies(X2,not(X1)))=equiv(not(X1),X2)),inference(spm,[status(thm)],[279,267,theory(equality)])).
% cnf(285,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|~kn3),inference(rw,[status(thm)],[224,267,theory(equality)])).
% cnf(286,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|$false),inference(rw,[status(thm)],[285,55,theory(equality)])).
% cnf(287,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))),inference(cn,[status(thm)],[286,theory(equality)])).
% cnf(288,plain,(is_a_theorem(or(and(X1,X2),not(and(X2,X3))))|~is_a_theorem(implies(X3,X1))),inference(spm,[status(thm)],[261,287,theory(equality)])).
% cnf(290,plain,(is_a_theorem(implies(implies(not(X1),X2),or(and(X2,X3),implies(X3,X1))))),inference(spm,[status(thm)],[287,258,theory(equality)])).
% cnf(293,plain,(is_a_theorem(implies(or(X1,X2),or(and(X2,X3),implies(X3,X1))))),inference(rw,[status(thm)],[290,267,theory(equality)])).
% cnf(305,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,not(X3)),X1))|~is_a_theorem(implies(X2,X3))),inference(spm,[status(thm)],[269,258,theory(equality)])).
% cnf(306,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,implies(X3,X4)),X1))|~is_a_theorem(implies(X2,and(X3,not(X4))))),inference(spm,[status(thm)],[269,259,theory(equality)])).
% cnf(308,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(and(X2,X3),not(X2)),X1))),inference(spm,[status(thm)],[305,253,theory(equality)])).
% cnf(310,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,not(and(X2,X2))),X1))),inference(spm,[status(thm)],[305,251,theory(equality)])).
% cnf(318,plain,(is_a_theorem(and(not(and(and(X1,X2),not(X1))),not(and(and(X1,X2),not(X1)))))),inference(spm,[status(thm)],[308,268,theory(equality)])).
% cnf(324,plain,(is_a_theorem(and(implies(and(X1,X2),X1),implies(and(X1,X2),X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[318,258,theory(equality)]),258,theory(equality)])).
% cnf(355,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),not(and(not(X3),X1)))))),inference(spm,[status(thm)],[287,270,theory(equality)])).
% cnf(358,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,and(X2,X2)),X1))),inference(rw,[status(thm)],[310,270,theory(equality)])).
% cnf(360,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(and(X2,X3),X2),X1))),inference(rw,[status(thm)],[308,270,theory(equality)])).
% cnf(369,plain,(is_a_theorem(or(and(and(X1,X1),X2),not(and(X2,X1))))),inference(spm,[status(thm)],[358,287,theory(equality)])).
% cnf(373,plain,(is_a_theorem(or(and(X1,X2),not(and(X2,and(X1,X3)))))),inference(spm,[status(thm)],[360,287,theory(equality)])).
% cnf(521,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(and(and(X2,not(X3)),X4),implies(X2,X3)),X1))),inference(spm,[status(thm)],[306,253,theory(equality)])).
% cnf(525,plain,(is_a_theorem(or(and(X1,X2),not(and(X2,not(X3)))))|~is_a_theorem(or(X3,X1))),inference(spm,[status(thm)],[288,267,theory(equality)])).
% cnf(533,plain,(is_a_theorem(or(and(X1,X2),implies(X2,X3)))|~is_a_theorem(or(X3,X1))),inference(rw,[status(thm)],[525,258,theory(equality)])).
% cnf(565,plain,(is_a_theorem(or(and(and(not(X1),not(X1)),X2),implies(X2,X1)))),inference(spm,[status(thm)],[533,268,theory(equality)])).
% cnf(568,plain,(is_a_theorem(or(and(and(not(X1),not(X1)),not(X2)),or(X2,X1)))),inference(spm,[status(thm)],[565,267,theory(equality)])).
% cnf(575,plain,(is_a_theorem(implies(implies(and(not(X1),not(X1)),X2),or(X2,X1)))),inference(rw,[status(thm)],[568,270,theory(equality)])).
% cnf(703,plain,(is_a_theorem(implies(or(X1,X2),or(and(X2,not(X3)),or(X3,X1))))),inference(spm,[status(thm)],[293,267,theory(equality)])).
% cnf(710,plain,(is_a_theorem(implies(or(X1,X2),implies(implies(X2,X3),or(X3,X1))))),inference(rw,[status(thm)],[703,270,theory(equality)])).
% cnf(727,plain,(is_a_theorem(not(and(implies(X1,X2),and(X1,not(X2)))))),inference(spm,[status(thm)],[521,369,theory(equality)])).
% cnf(732,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(implies(X2,X3),and(X2,not(X3))),X1))),inference(spm,[status(thm)],[269,727,theory(equality)])).
% cnf(2690,plain,(is_a_theorem(implies(implies(X1,X2),not(and(not(X2),X3))))|~is_a_theorem(implies(X3,X1))),inference(spm,[status(thm)],[261,355,theory(equality)])).
% cnf(2693,plain,(is_a_theorem(implies(implies(and(X1,X1),X2),not(and(not(X2),X1))))),inference(spm,[status(thm)],[358,355,theory(equality)])).
% cnf(2703,plain,(is_a_theorem(implies(implies(X1,not(X2)),implies(or(X2,X3),not(and(not(X3),X1)))))),inference(spm,[status(thm)],[355,267,theory(equality)])).
% cnf(2729,plain,(is_a_theorem(not(and(not(X1),X1)))),inference(spm,[status(thm)],[360,2693,theory(equality)])).
% cnf(2744,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(not(X2),X2),X1))),inference(spm,[status(thm)],[269,2729,theory(equality)])).
% cnf(2748,plain,(is_a_theorem(implies(not(not(X1)),X1))),inference(spm,[status(thm)],[2729,258,theory(equality)])).
% cnf(2752,plain,(is_a_theorem(or(not(X1),X1))),inference(rw,[status(thm)],[2748,267,theory(equality)])).
% cnf(2756,plain,(is_a_theorem(or(and(X1,X2),implies(X2,not(X1))))),inference(spm,[status(thm)],[533,2752,theory(equality)])).
% cnf(2761,plain,(is_a_theorem(or(and(implies(X1,not(X2)),X3),implies(X3,and(X2,X1))))),inference(spm,[status(thm)],[533,2756,theory(equality)])).
% cnf(2820,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(not(not(X2)),X2),X1))),inference(spm,[status(thm)],[2744,270,theory(equality)])).
% cnf(2822,plain,(is_a_theorem(not(and(X1,and(not(X1),X2))))),inference(spm,[status(thm)],[2744,373,theory(equality)])).
% cnf(2833,plain,(is_a_theorem(implies(X1,not(not(X1))))),inference(spm,[status(thm)],[2744,2756,theory(equality)])).
% cnf(2834,plain,(is_a_theorem(X1)|~is_a_theorem(implies(or(not(X2),X2),X1))),inference(rw,[status(thm)],[2820,267,theory(equality)])).
% cnf(2844,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[261,2833,theory(equality)])).
% cnf(2846,plain,(is_a_theorem(or(and(not(not(X1)),X2),not(and(X2,X1))))),inference(spm,[status(thm)],[288,2833,theory(equality)])).
% cnf(2851,plain,(is_a_theorem(X1)|~is_a_theorem(or(not(X2),X1))|~is_a_theorem(X2)),inference(spm,[status(thm)],[269,2844,theory(equality)])).
% cnf(2853,plain,(is_a_theorem(not(implies(X1,X2)))|~is_a_theorem(and(X1,not(X2)))),inference(spm,[status(thm)],[2844,258,theory(equality)])).
% cnf(2855,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,and(not(X2),X3)),X1))),inference(spm,[status(thm)],[269,2822,theory(equality)])).
% cnf(2879,plain,(is_a_theorem(X1)|~is_a_theorem(implies(or(implies(X2,X3),and(X2,not(X3))),X1))),inference(spm,[status(thm)],[2834,258,theory(equality)])).
% cnf(2882,plain,(is_a_theorem(not(not(or(not(X1),X1))))),inference(spm,[status(thm)],[2834,2833,theory(equality)])).
% cnf(3492,plain,(is_a_theorem(not(and(and(not(X1),X2),and(X1,X3))))),inference(spm,[status(thm)],[2855,373,theory(equality)])).
% cnf(3545,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(and(not(X2),X3),and(X2,X4)),X1))),inference(spm,[status(thm)],[269,3492,theory(equality)])).
% cnf(4331,plain,(is_a_theorem(implies(and(X1,not(not(X2))),and(X2,X1)))),inference(spm,[status(thm)],[732,2761,theory(equality)])).
% cnf(4356,plain,(is_a_theorem(and(X1,X2))|~is_a_theorem(and(X2,not(not(X1))))),inference(spm,[status(thm)],[261,4331,theory(equality)])).
% cnf(4370,plain,(is_a_theorem(and(X1,not(not(X1))))|~is_a_theorem(not(not(X1)))),inference(spm,[status(thm)],[4356,263,theory(equality)])).
% cnf(4373,plain,(is_a_theorem(and(X1,not(not(X1))))|~is_a_theorem(X1)),inference(spm,[status(thm)],[4370,2844,theory(equality)])).
% cnf(4381,plain,(is_a_theorem(and(or(not(X1),X1),not(not(or(not(X1),X1)))))),inference(spm,[status(thm)],[4370,2882,theory(equality)])).
% cnf(4406,plain,(is_a_theorem(not(implies(X1,not(X1))))|~is_a_theorem(X1)),inference(spm,[status(thm)],[2853,4373,theory(equality)])).
% cnf(4447,plain,(is_a_theorem(X1)|~is_a_theorem(or(implies(X2,not(X2)),X1))|~is_a_theorem(X2)),inference(spm,[status(thm)],[269,4406,theory(equality)])).
% cnf(5191,plain,(is_a_theorem(or(and(and(X1,not(X2)),X3),implies(X3,implies(X1,X2))))),inference(spm,[status(thm)],[2879,293,theory(equality)])).
% cnf(7259,plain,(is_a_theorem(implies(and(X1,X2),implies(not(X1),X3)))),inference(spm,[status(thm)],[3545,5191,theory(equality)])).
% cnf(7262,plain,(is_a_theorem(implies(and(X1,X2),or(X1,X3)))),inference(rw,[status(thm)],[7259,267,theory(equality)])).
% cnf(7263,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(and(X1,X3))),inference(spm,[status(thm)],[261,7262,theory(equality)])).
% cnf(7295,plain,(is_a_theorem(or(or(not(X1),X1),X2))),inference(spm,[status(thm)],[7263,4381,theory(equality)])).
% cnf(7299,plain,(is_a_theorem(or(implies(and(X1,X2),X1),X3))),inference(spm,[status(thm)],[7263,324,theory(equality)])).
% cnf(7309,plain,(is_a_theorem(or(and(X1,X2),implies(X2,or(not(X3),X3))))),inference(spm,[status(thm)],[533,7295,theory(equality)])).
% cnf(7602,plain,(is_a_theorem(or(and(X1,X2),implies(X2,implies(and(X3,X4),X3))))),inference(spm,[status(thm)],[533,7299,theory(equality)])).
% cnf(8301,plain,(is_a_theorem(implies(X1,or(not(X2),X2)))),inference(spm,[status(thm)],[2744,7309,theory(equality)])).
% cnf(8347,plain,(is_a_theorem(or(X1,or(not(X2),X2)))),inference(spm,[status(thm)],[8301,267,theory(equality)])).
% cnf(8503,plain,(is_a_theorem(or(and(or(not(X1),X1),X2),implies(X2,X3)))),inference(spm,[status(thm)],[533,8347,theory(equality)])).
% cnf(9509,plain,(is_a_theorem(implies(X1,implies(and(X2,X3),X2)))),inference(spm,[status(thm)],[2744,7602,theory(equality)])).
% cnf(9756,plain,(is_a_theorem(or(X1,implies(and(X2,X3),X2)))),inference(spm,[status(thm)],[9509,267,theory(equality)])).
% cnf(11236,plain,(is_a_theorem(or(and(implies(and(X1,X2),X1),X3),implies(X3,X4)))),inference(spm,[status(thm)],[533,9756,theory(equality)])).
% cnf(11316,plain,(is_a_theorem(or(and(implies(X1,X2),X3),implies(X3,and(implies(and(X4,X5),X4),X1))))),inference(spm,[status(thm)],[533,11236,theory(equality)])).
% cnf(13181,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(implies(and(not(X2),not(X2)),X1))),inference(spm,[status(thm)],[261,575,theory(equality)])).
% cnf(14244,plain,(is_a_theorem(or(and(X1,not(not(X1))),not(X1)))),inference(spm,[status(thm)],[13181,4331,theory(equality)])).
% cnf(14265,plain,(is_a_theorem(implies(implies(X1,not(X1)),not(X1)))),inference(rw,[status(thm)],[14244,270,theory(equality)])).
% cnf(14296,plain,(is_a_theorem(or(and(not(X1),X2),not(and(X2,implies(X1,not(X1))))))),inference(spm,[status(thm)],[288,14265,theory(equality)])).
% cnf(14306,plain,(is_a_theorem(or(and(not(X1),X2),implies(X2,and(X1,not(not(X1))))))),inference(rw,[status(thm)],[14296,259,theory(equality)])).
% cnf(18294,plain,(is_a_theorem(implies(X1,and(X1,not(not(X1)))))),inference(spm,[status(thm)],[2744,14306,theory(equality)])).
% cnf(18368,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,implies(X2,not(X2))),X1))),inference(spm,[status(thm)],[306,18294,theory(equality)])).
% cnf(18588,plain,(is_a_theorem(not(and(implies(X1,not(X1)),and(X1,X2))))),inference(spm,[status(thm)],[18368,373,theory(equality)])).
% cnf(18718,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(implies(X2,not(X2)),and(X2,X3)),X1))),inference(spm,[status(thm)],[269,18588,theory(equality)])).
% cnf(25625,plain,(is_a_theorem(implies(implies(X1,X2),or(X2,not(X1))))),inference(spm,[status(thm)],[2834,710,theory(equality)])).
% cnf(25645,plain,(is_a_theorem(or(X1,not(X2)))|~is_a_theorem(implies(X2,X1))),inference(spm,[status(thm)],[261,25625,theory(equality)])).
% cnf(25650,plain,(is_a_theorem(or(X1,not(and(X1,X2))))),inference(spm,[status(thm)],[360,25625,theory(equality)])).
% cnf(25703,plain,(is_a_theorem(not(and(not(X1),X2)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[2851,25650,theory(equality)])).
% cnf(25779,plain,(is_a_theorem(or(X1,implies(X1,X2)))),inference(spm,[status(thm)],[25650,258,theory(equality)])).
% cnf(29272,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(not(X2),X3),X1))|~is_a_theorem(X2)),inference(spm,[status(thm)],[269,25703,theory(equality)])).
% cnf(29408,plain,(is_a_theorem(not(and(X1,X2)))|~is_a_theorem(not(X2))),inference(spm,[status(thm)],[29272,2846,theory(equality)])).
% cnf(29657,plain,(is_a_theorem(not(and(X1,not(X2))))|~is_a_theorem(X2)),inference(spm,[status(thm)],[29408,2844,theory(equality)])).
% cnf(29888,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(X2)),inference(rw,[status(thm)],[29657,258,theory(equality)])).
% cnf(30032,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(X2)),inference(spm,[status(thm)],[29888,267,theory(equality)])).
% cnf(30318,plain,(is_a_theorem(or(and(X1,X2),implies(X2,X3)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[533,30032,theory(equality)])).
% cnf(233056,plain,(is_a_theorem(implies(and(X1,X2),and(X1,X1)))),inference(spm,[status(thm)],[18718,2761,theory(equality)])).
% cnf(233299,plain,(is_a_theorem(or(and(not(X1),not(X1)),X1))),inference(spm,[status(thm)],[13181,233056,theory(equality)])).
% cnf(233317,plain,(is_a_theorem(implies(or(X1,X1),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[233299,270,theory(equality)]),267,theory(equality)])).
% cnf(233325,plain,(is_a_theorem(or(X1,not(or(X1,X1))))),inference(spm,[status(thm)],[25645,233317,theory(equality)])).
% cnf(233494,plain,(is_a_theorem(or(and(not(or(X1,X1)),X2),implies(X2,X1)))),inference(spm,[status(thm)],[533,233325,theory(equality)])).
% cnf(357561,plain,(is_a_theorem(implies(implies(not(not(X1)),X2),not(and(not(X2),X1))))),inference(spm,[status(thm)],[2690,2833,theory(equality)])).
% cnf(358209,plain,(is_a_theorem(implies(or(not(X1),X2),not(and(not(X2),X1))))),inference(rw,[status(thm)],[357561,267,theory(equality)])).
% cnf(358410,plain,(is_a_theorem(not(and(not(X1),X2)))|~is_a_theorem(or(not(X2),X1))),inference(spm,[status(thm)],[261,358209,theory(equality)])).
% cnf(361906,plain,(is_a_theorem(not(and(not(implies(not(X1),X2)),X1)))),inference(spm,[status(thm)],[358410,25779,theory(equality)])).
% cnf(362328,plain,(is_a_theorem(not(and(not(or(X1,X2)),X1)))),inference(rw,[status(thm)],[361906,267,theory(equality)])).
% cnf(362721,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(not(or(X2,X3)),X2),X1))),inference(spm,[status(thm)],[269,362328,theory(equality)])).
% cnf(385789,plain,(is_a_theorem(implies(X1,X1))),inference(spm,[status(thm)],[362721,233494,theory(equality)])).
% cnf(386320,plain,(is_a_theorem(or(and(X1,X2),not(and(X2,X1))))),inference(spm,[status(thm)],[288,385789,theory(equality)])).
% cnf(386321,plain,(is_a_theorem(implies(implies(X1,X2),not(and(not(X2),X1))))),inference(spm,[status(thm)],[2690,385789,theory(equality)])).
% cnf(390933,plain,(is_a_theorem(not(and(implies(X1,not(X1)),X1)))),inference(spm,[status(thm)],[18368,386320,theory(equality)])).
% cnf(391159,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(implies(X2,not(X2)),X2),X1))),inference(spm,[status(thm)],[269,390933,theory(equality)])).
% cnf(396101,plain,(is_a_theorem(not(and(not(X1),X2)))|~is_a_theorem(implies(X2,X1))),inference(spm,[status(thm)],[261,386321,theory(equality)])).
% cnf(486307,plain,(is_a_theorem(not(and(not(X1),not(X2))))|~is_a_theorem(or(X2,X1))),inference(spm,[status(thm)],[396101,267,theory(equality)])).
% cnf(487481,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X2,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[486307,258,theory(equality)]),267,theory(equality)])).
% cnf(488840,plain,(is_a_theorem(or(implies(X1,X2),and(or(not(X3),X3),X1)))),inference(spm,[status(thm)],[487481,8503,theory(equality)])).
% cnf(524055,plain,(is_a_theorem(and(or(not(X1),X1),X2))|~is_a_theorem(X2)),inference(spm,[status(thm)],[4447,488840,theory(equality)])).
% cnf(613572,plain,(is_a_theorem(equiv(not(not(X1)),X1))|~is_a_theorem(implies(X1,not(not(X1))))),inference(spm,[status(thm)],[524055,283,theory(equality)])).
% cnf(613592,plain,(is_a_theorem(equiv(not(not(X1)),X1))|$false),inference(rw,[status(thm)],[613572,2833,theory(equality)])).
% cnf(613593,plain,(is_a_theorem(equiv(not(not(X1)),X1))),inference(cn,[status(thm)],[613592,theory(equality)])).
% cnf(613617,plain,(not(not(X1))=X1),inference(spm,[status(thm)],[249,613593,theory(equality)])).
% cnf(613796,plain,(implies(X1,X2)=or(not(X1),X2)),inference(spm,[status(thm)],[267,613617,theory(equality)])).
% cnf(614763,plain,(not(and(X1,X2))=implies(X1,not(X2))),inference(spm,[status(thm)],[258,613617,theory(equality)])).
% cnf(615011,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,not(X2)),X1))),inference(spm,[status(thm)],[2744,613617,theory(equality)])).
% cnf(619101,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,X2),X1))),inference(rw,[status(thm)],[615011,270,theory(equality)])).
% cnf(621066,plain,(is_a_theorem(implies(or(X1,X2),not(and(not(X2),not(X1)))))),inference(spm,[status(thm)],[619101,2703,theory(equality)])).
% cnf(621421,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[621066,258,theory(equality)]),267,theory(equality)])).
% cnf(622259,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),or(X3,not(X1)))))),inference(spm,[status(thm)],[710,613796,theory(equality)])).
% cnf(679900,plain,(is_a_theorem(implies(X1,and(implies(and(X2,X3),X2),X1)))),inference(spm,[status(thm)],[391159,11316,theory(equality)])).
% cnf(679949,plain,(is_a_theorem(and(implies(and(X1,X2),X1),implies(X3,and(X3,X3))))),inference(spm,[status(thm)],[358,679900,theory(equality)])).
% cnf(756668,plain,(is_a_theorem(equiv(and(X1,X1),X1))),inference(spm,[status(thm)],[679949,279,theory(equality)])).
% cnf(756679,plain,(and(X1,X1)=X1),inference(spm,[status(thm)],[249,756668,theory(equality)])).
% cnf(757899,plain,(not(X1)=implies(X1,not(X1))),inference(spm,[status(thm)],[614763,756679,theory(equality)])).
% cnf(771766,plain,(is_a_theorem(or(and(X1,X2),not(X2)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[30318,757899,theory(equality)])).
% cnf(812450,plain,(is_a_theorem(or(not(X1),and(X2,X1)))|~is_a_theorem(X2)),inference(spm,[status(thm)],[487481,771766,theory(equality)])).
% cnf(812497,plain,(is_a_theorem(implies(X1,and(X2,X1)))|~is_a_theorem(X2)),inference(rw,[status(thm)],[812450,613796,theory(equality)])).
% cnf(812560,plain,(is_a_theorem(and(X1,X2))|~is_a_theorem(X2)|~is_a_theorem(X1)),inference(spm,[status(thm)],[261,812497,theory(equality)])).
% cnf(812676,plain,(is_a_theorem(equiv(X1,X2))|~is_a_theorem(implies(X2,X1))|~is_a_theorem(implies(X1,X2))),inference(spm,[status(thm)],[812560,279,theory(equality)])).
% cnf(813564,plain,(is_a_theorem(equiv(or(X1,X2),or(X2,X1)))|~is_a_theorem(implies(or(X1,X2),or(X2,X1)))),inference(spm,[status(thm)],[812676,621421,theory(equality)])).
% cnf(814095,plain,(is_a_theorem(equiv(or(X1,X2),or(X2,X1)))|$false),inference(rw,[status(thm)],[813564,621421,theory(equality)])).
% cnf(814096,plain,(is_a_theorem(equiv(or(X1,X2),or(X2,X1)))),inference(cn,[status(thm)],[814095,theory(equality)])).
% cnf(815126,plain,(or(X1,X2)=or(X2,X1)),inference(spm,[status(thm)],[249,814096,theory(equality)])).
% cnf(815178,plain,(or(X2,not(X1))=implies(X1,X2)),inference(spm,[status(thm)],[613796,815126,theory(equality)])).
% cnf(949081,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))),inference(rw,[status(thm)],[622259,815178,theory(equality)])).
% cnf(949185,plain,($false),inference(rw,[status(thm)],[264,949081,theory(equality)])).
% cnf(949186,plain,($false),inference(cn,[status(thm)],[949185,theory(equality)])).
% cnf(949187,plain,($false),949186,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 29315
% # ...of these trivial : 5190
% # ...subsumed : 14525
% # ...remaining for further processing: 9600
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 154
% # Backward-rewritten : 8183
% # Generated clauses : 613858
% # ...of the previous two non-trivial : 355791
% # Contextual simplify-reflections : 288
% # Paramodulations : 613858
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1263
% # Positive orientable unit clauses: 888
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 4
% # Non-unit-clauses : 366
% # Current number of unprocessed clauses: 51997
% # ...number of literals in the above : 109145
% # Clause-clause subsumption calls (NU) : 187619
% # Rec. Clause-clause subsumption calls : 187597
% # Unit Clause-clause subsumption calls : 30749
% # Rewrite failures with RHS unbound : 44
% # Indexed BW rewrite attempts : 1255055
% # Indexed BW rewrite successes : 7417
% # Backwards rewriting index: 701 leaves, 4.22+/-9.291 terms/leaf
% # Paramod-from index: 104 leaves, 8.89+/-19.448 terms/leaf
% # Paramod-into index: 666 leaves, 4.29+/-9.438 terms/leaf
% # -------------------------------------------------
% # User time : 26.143 s
% # System time : 0.750 s
% # Total time : 26.893 s
% # Maximum resident set size: 0 pages
% PrfWatch: 37.50 CPU 38.58 WC
% FINAL PrfWatch: 37.50 CPU 38.58 WC
% SZS output end Solution for /tmp/SystemOnTPTP31856/LCL515+1.tptp
%
%------------------------------------------------------------------------------