TSTP Solution File: LCL502+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL502+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 13:47:22 EST 2010
% Result : Theorem 34.90s
% Output : Solution 34.90s
% 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/SystemOnTPTP7429/LCL502+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7429/LCL502+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7429/LCL502+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 7561
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.95 CPU 2.03 WC
% PrfWatch: 3.94 CPU 4.04 WC
% PrfWatch: 5.76 CPU 6.04 WC
% PrfWatch: 7.61 CPU 8.05 WC
% PrfWatch: 9.61 CPU 10.06 WC
% PrfWatch: 11.60 CPU 12.06 WC
% PrfWatch: 13.48 CPU 14.07 WC
% PrfWatch: 15.27 CPU 16.08 WC
% PrfWatch: 17.26 CPU 18.08 WC
% PrfWatch: 19.26 CPU 20.09 WC
% PrfWatch: 21.25 CPU 22.10 WC
% PrfWatch: 23.24 CPU 24.10 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 25.25 CPU 26.11 WC
% PrfWatch: 27.24 CPU 28.11 WC
% PrfWatch: 29.23 CPU 30.12 WC
% PrfWatch: 31.22 CPU 32.13 WC
% PrfWatch: 33.21 CPU 34.13 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,(modus_tollens<=>![X1]:![X2]:is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2)))),file('/tmp/SRASS.s.p', modus_tollens)).
% fof(2, axiom,op_implies_and,file('/tmp/SRASS.s.p', rosser_op_implies_and)).
% fof(3, axiom,modus_ponens,file('/tmp/SRASS.s.p', rosser_modus_ponens)).
% fof(4, axiom,kn1,file('/tmp/SRASS.s.p', rosser_kn1)).
% fof(5, axiom,kn2,file('/tmp/SRASS.s.p', rosser_kn2)).
% fof(6, axiom,kn3,file('/tmp/SRASS.s.p', rosser_kn3)).
% fof(10, axiom,op_or,file('/tmp/SRASS.s.p', rosser_op_or)).
% fof(11, axiom,op_equiv,file('/tmp/SRASS.s.p', rosser_op_equiv)).
% fof(12, axiom,substitution_of_equivalents,file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(15, axiom,(kn3<=>![X3]:![X4]:![X5]:is_a_theorem(implies(implies(X3,X4),implies(not(and(X4,X5)),not(and(X5,X3)))))),file('/tmp/SRASS.s.p', kn3)).
% fof(16, axiom,(modus_ponens<=>![X1]:![X2]:((is_a_theorem(X1)&is_a_theorem(implies(X1,X2)))=>is_a_theorem(X2))),file('/tmp/SRASS.s.p', modus_ponens)).
% fof(24, axiom,(op_equiv=>![X1]:![X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))),file('/tmp/SRASS.s.p', op_equiv)).
% fof(28, axiom,(kn1<=>![X3]:is_a_theorem(implies(X3,and(X3,X3)))),file('/tmp/SRASS.s.p', kn1)).
% fof(29, axiom,(kn2<=>![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3))),file('/tmp/SRASS.s.p', kn2)).
% fof(35, axiom,(op_implies_and=>![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(40, axiom,(op_or=>![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_or)).
% fof(42, axiom,(substitution_of_equivalents<=>![X1]:![X2]:(is_a_theorem(equiv(X1,X2))=>X1=X2)),file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(43, conjecture,modus_tollens,file('/tmp/SRASS.s.p', hilbert_modus_tollens)).
% fof(44, negated_conjecture,~(modus_tollens),inference(assume_negation,[status(cth)],[43])).
% fof(45, negated_conjecture,~(modus_tollens),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(46, plain,((~(modus_tollens)|![X1]:![X2]:is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2))))&(?[X1]:?[X2]:~(is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2))))|modus_tollens)),inference(fof_nnf,[status(thm)],[1])).
% fof(47, plain,((~(modus_tollens)|![X3]:![X4]:is_a_theorem(implies(implies(not(X4),not(X3)),implies(X3,X4))))&(?[X5]:?[X6]:~(is_a_theorem(implies(implies(not(X6),not(X5)),implies(X5,X6))))|modus_tollens)),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,((~(modus_tollens)|![X3]:![X4]:is_a_theorem(implies(implies(not(X4),not(X3)),implies(X3,X4))))&(~(is_a_theorem(implies(implies(not(esk2_0),not(esk1_0)),implies(esk1_0,esk2_0))))|modus_tollens)),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X3]:![X4]:((is_a_theorem(implies(implies(not(X4),not(X3)),implies(X3,X4)))|~(modus_tollens))&(~(is_a_theorem(implies(implies(not(esk2_0),not(esk1_0)),implies(esk1_0,esk2_0))))|modus_tollens)),inference(shift_quantors,[status(thm)],[48])).
% cnf(50,plain,(modus_tollens|~is_a_theorem(implies(implies(not(esk2_0),not(esk1_0)),implies(esk1_0,esk2_0)))),inference(split_conjunct,[status(thm)],[49])).
% cnf(52,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[2])).
% cnf(53,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[3])).
% cnf(54,plain,(kn1),inference(split_conjunct,[status(thm)],[4])).
% cnf(55,plain,(kn2),inference(split_conjunct,[status(thm)],[5])).
% cnf(56,plain,(kn3),inference(split_conjunct,[status(thm)],[6])).
% cnf(70,plain,(op_or),inference(split_conjunct,[status(thm)],[10])).
% cnf(71,plain,(op_equiv),inference(split_conjunct,[status(thm)],[11])).
% cnf(72,plain,(substitution_of_equivalents),inference(split_conjunct,[status(thm)],[12])).
% fof(75, plain,((~(kn3)|![X3]:![X4]:![X5]:is_a_theorem(implies(implies(X3,X4),implies(not(and(X4,X5)),not(and(X5,X3))))))&(?[X3]:?[X4]:?[X5]:~(is_a_theorem(implies(implies(X3,X4),implies(not(and(X4,X5)),not(and(X5,X3))))))|kn3)),inference(fof_nnf,[status(thm)],[15])).
% fof(76, plain,((~(kn3)|![X6]:![X7]:![X8]:is_a_theorem(implies(implies(X6,X7),implies(not(and(X7,X8)),not(and(X8,X6))))))&(?[X9]:?[X10]:?[X11]:~(is_a_theorem(implies(implies(X9,X10),implies(not(and(X10,X11)),not(and(X11,X9))))))|kn3)),inference(variable_rename,[status(thm)],[75])).
% fof(77, plain,((~(kn3)|![X6]:![X7]:![X8]:is_a_theorem(implies(implies(X6,X7),implies(not(and(X7,X8)),not(and(X8,X6))))))&(~(is_a_theorem(implies(implies(esk6_0,esk7_0),implies(not(and(esk7_0,esk8_0)),not(and(esk8_0,esk6_0))))))|kn3)),inference(skolemize,[status(esa)],[76])).
% fof(78, plain,![X6]:![X7]:![X8]:((is_a_theorem(implies(implies(X6,X7),implies(not(and(X7,X8)),not(and(X8,X6)))))|~(kn3))&(~(is_a_theorem(implies(implies(esk6_0,esk7_0),implies(not(and(esk7_0,esk8_0)),not(and(esk8_0,esk6_0))))))|kn3)),inference(shift_quantors,[status(thm)],[77])).
% cnf(80,plain,(is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))|~kn3),inference(split_conjunct,[status(thm)],[78])).
% fof(81, plain,((~(modus_ponens)|![X1]:![X2]:((~(is_a_theorem(X1))|~(is_a_theorem(implies(X1,X2))))|is_a_theorem(X2)))&(?[X1]:?[X2]:((is_a_theorem(X1)&is_a_theorem(implies(X1,X2)))&~(is_a_theorem(X2)))|modus_ponens)),inference(fof_nnf,[status(thm)],[16])).
% fof(82, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(?[X5]:?[X6]:((is_a_theorem(X5)&is_a_theorem(implies(X5,X6)))&~(is_a_theorem(X6)))|modus_ponens)),inference(variable_rename,[status(thm)],[81])).
% fof(83, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(((is_a_theorem(esk9_0)&is_a_theorem(implies(esk9_0,esk10_0)))&~(is_a_theorem(esk10_0)))|modus_ponens)),inference(skolemize,[status(esa)],[82])).
% fof(84, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk9_0)&is_a_theorem(implies(esk9_0,esk10_0)))&~(is_a_theorem(esk10_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[83])).
% fof(85, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk9_0)|modus_ponens)&(is_a_theorem(implies(esk9_0,esk10_0))|modus_ponens))&(~(is_a_theorem(esk10_0))|modus_ponens))),inference(distribute,[status(thm)],[84])).
% cnf(89,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[85])).
% fof(132, plain,(~(op_equiv)|![X1]:![X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))),inference(fof_nnf,[status(thm)],[24])).
% fof(133, plain,(~(op_equiv)|![X3]:![X4]:equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))),inference(variable_rename,[status(thm)],[132])).
% fof(134, plain,![X3]:![X4]:(equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))|~(op_equiv)),inference(shift_quantors,[status(thm)],[133])).
% cnf(135,plain,(equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv),inference(split_conjunct,[status(thm)],[134])).
% fof(154, plain,((~(kn1)|![X3]:is_a_theorem(implies(X3,and(X3,X3))))&(?[X3]:~(is_a_theorem(implies(X3,and(X3,X3))))|kn1)),inference(fof_nnf,[status(thm)],[28])).
% fof(155, plain,((~(kn1)|![X4]:is_a_theorem(implies(X4,and(X4,X4))))&(?[X5]:~(is_a_theorem(implies(X5,and(X5,X5))))|kn1)),inference(variable_rename,[status(thm)],[154])).
% fof(156, plain,((~(kn1)|![X4]:is_a_theorem(implies(X4,and(X4,X4))))&(~(is_a_theorem(implies(esk34_0,and(esk34_0,esk34_0))))|kn1)),inference(skolemize,[status(esa)],[155])).
% fof(157, plain,![X4]:((is_a_theorem(implies(X4,and(X4,X4)))|~(kn1))&(~(is_a_theorem(implies(esk34_0,and(esk34_0,esk34_0))))|kn1)),inference(shift_quantors,[status(thm)],[156])).
% cnf(159,plain,(is_a_theorem(implies(X1,and(X1,X1)))|~kn1),inference(split_conjunct,[status(thm)],[157])).
% fof(160, plain,((~(kn2)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3)))&(?[X3]:?[X4]:~(is_a_theorem(implies(and(X3,X4),X3)))|kn2)),inference(fof_nnf,[status(thm)],[29])).
% fof(161, plain,((~(kn2)|![X5]:![X6]:is_a_theorem(implies(and(X5,X6),X5)))&(?[X7]:?[X8]:~(is_a_theorem(implies(and(X7,X8),X7)))|kn2)),inference(variable_rename,[status(thm)],[160])).
% fof(162, plain,((~(kn2)|![X5]:![X6]:is_a_theorem(implies(and(X5,X6),X5)))&(~(is_a_theorem(implies(and(esk35_0,esk36_0),esk35_0)))|kn2)),inference(skolemize,[status(esa)],[161])).
% fof(163, plain,![X5]:![X6]:((is_a_theorem(implies(and(X5,X6),X5))|~(kn2))&(~(is_a_theorem(implies(and(esk35_0,esk36_0),esk35_0)))|kn2)),inference(shift_quantors,[status(thm)],[162])).
% cnf(165,plain,(is_a_theorem(implies(and(X1,X2),X1))|~kn2),inference(split_conjunct,[status(thm)],[163])).
% fof(196, plain,(~(op_implies_and)|![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),inference(fof_nnf,[status(thm)],[35])).
% fof(197, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(variable_rename,[status(thm)],[196])).
% fof(198, plain,![X3]:![X4]:(implies(X3,X4)=not(and(X3,not(X4)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[197])).
% cnf(199,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[198])).
% fof(222, plain,(~(op_or)|![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[40])).
% fof(223, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[222])).
% fof(224, plain,![X3]:![X4]:(or(X3,X4)=not(and(not(X3),not(X4)))|~(op_or)),inference(shift_quantors,[status(thm)],[223])).
% cnf(225,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[224])).
% fof(230, plain,((~(substitution_of_equivalents)|![X1]:![X2]:(~(is_a_theorem(equiv(X1,X2)))|X1=X2))&(?[X1]:?[X2]:(is_a_theorem(equiv(X1,X2))&~(X1=X2))|substitution_of_equivalents)),inference(fof_nnf,[status(thm)],[42])).
% fof(231, plain,((~(substitution_of_equivalents)|![X3]:![X4]:(~(is_a_theorem(equiv(X3,X4)))|X3=X4))&(?[X5]:?[X6]:(is_a_theorem(equiv(X5,X6))&~(X5=X6))|substitution_of_equivalents)),inference(variable_rename,[status(thm)],[230])).
% fof(232, plain,((~(substitution_of_equivalents)|![X3]:![X4]:(~(is_a_theorem(equiv(X3,X4)))|X3=X4))&((is_a_theorem(equiv(esk54_0,esk55_0))&~(esk54_0=esk55_0))|substitution_of_equivalents)),inference(skolemize,[status(esa)],[231])).
% fof(233, plain,![X3]:![X4]:(((~(is_a_theorem(equiv(X3,X4)))|X3=X4)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk54_0,esk55_0))&~(esk54_0=esk55_0))|substitution_of_equivalents)),inference(shift_quantors,[status(thm)],[232])).
% fof(234, plain,![X3]:![X4]:(((~(is_a_theorem(equiv(X3,X4)))|X3=X4)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk54_0,esk55_0))|substitution_of_equivalents)&(~(esk54_0=esk55_0)|substitution_of_equivalents))),inference(distribute,[status(thm)],[233])).
% cnf(237,plain,(X1=X2|~substitution_of_equivalents|~is_a_theorem(equiv(X1,X2))),inference(split_conjunct,[status(thm)],[234])).
% cnf(238,negated_conjecture,(~modus_tollens),inference(split_conjunct,[status(thm)],[45])).
% cnf(249,plain,(X1=X2|$false|~is_a_theorem(equiv(X1,X2))),inference(rw,[status(thm)],[237,72,theory(equality)])).
% cnf(250,plain,(X1=X2|~is_a_theorem(equiv(X1,X2))),inference(cn,[status(thm)],[249,theory(equality)])).
% cnf(251,plain,(is_a_theorem(implies(X1,and(X1,X1)))|$false),inference(rw,[status(thm)],[159,54,theory(equality)])).
% cnf(252,plain,(is_a_theorem(implies(X1,and(X1,X1)))),inference(cn,[status(thm)],[251,theory(equality)])).
% cnf(253,plain,(is_a_theorem(implies(and(X1,X2),X1))|$false),inference(rw,[status(thm)],[165,55,theory(equality)])).
% cnf(254,plain,(is_a_theorem(implies(and(X1,X2),X1))),inference(cn,[status(thm)],[253,theory(equality)])).
% cnf(258,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[199,52,theory(equality)])).
% cnf(259,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[258,theory(equality)])).
% cnf(260,plain,(not(and(X1,implies(X2,X3)))=implies(X1,and(X2,not(X3)))),inference(spm,[status(thm)],[259,259,theory(equality)])).
% cnf(261,plain,(~is_a_theorem(implies(implies(not(esk2_0),not(esk1_0)),implies(esk1_0,esk2_0)))),inference(sr,[status(thm)],[50,238,theory(equality)])).
% cnf(262,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[89,53,theory(equality)])).
% cnf(263,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[262,theory(equality)])).
% cnf(265,plain,(is_a_theorem(and(X1,X1))|~is_a_theorem(X1)),inference(spm,[status(thm)],[263,252,theory(equality)])).
% cnf(266,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[225,259,theory(equality)])).
% cnf(267,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[266,70,theory(equality)])).
% cnf(268,plain,(implies(not(X1),X2)=or(X1,X2)),inference(cn,[status(thm)],[267,theory(equality)])).
% cnf(269,plain,(is_a_theorem(or(X1,and(not(X1),not(X1))))),inference(spm,[status(thm)],[252,268,theory(equality)])).
% cnf(270,plain,(is_a_theorem(X1)|~is_a_theorem(or(X2,X1))|~is_a_theorem(not(X2))),inference(spm,[status(thm)],[263,268,theory(equality)])).
% cnf(271,plain,(implies(implies(X1,X2),X3)=or(and(X1,not(X2)),X3)),inference(spm,[status(thm)],[268,259,theory(equality)])).
% cnf(274,plain,(~is_a_theorem(implies(or(esk2_0,not(esk1_0)),implies(esk1_0,esk2_0)))),inference(rw,[status(thm)],[261,268,theory(equality)])).
% cnf(280,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)|$false),inference(rw,[status(thm)],[135,71,theory(equality)])).
% cnf(281,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)),inference(cn,[status(thm)],[280,theory(equality)])).
% cnf(285,plain,(and(or(X1,X2),implies(X2,not(X1)))=equiv(not(X1),X2)),inference(spm,[status(thm)],[281,268,theory(equality)])).
% cnf(286,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|~kn3),inference(rw,[status(thm)],[80,268,theory(equality)])).
% cnf(287,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|$false),inference(rw,[status(thm)],[286,56,theory(equality)])).
% cnf(288,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))),inference(cn,[status(thm)],[287,theory(equality)])).
% cnf(289,plain,(is_a_theorem(or(and(X1,X2),not(and(X2,X3))))|~is_a_theorem(implies(X3,X1))),inference(spm,[status(thm)],[263,288,theory(equality)])).
% cnf(291,plain,(is_a_theorem(implies(implies(not(X1),X2),or(and(X2,X3),implies(X3,X1))))),inference(spm,[status(thm)],[288,259,theory(equality)])).
% cnf(294,plain,(is_a_theorem(implies(or(X1,X2),or(and(X2,X3),implies(X3,X1))))),inference(rw,[status(thm)],[291,268,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)],[270,260,theory(equality)])).
% cnf(307,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,not(X3)),X1))|~is_a_theorem(implies(X2,X3))),inference(spm,[status(thm)],[270,259,theory(equality)])).
% cnf(309,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(and(X2,X3),not(X2)),X1))),inference(spm,[status(thm)],[307,254,theory(equality)])).
% cnf(311,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,not(and(X2,X2))),X1))),inference(spm,[status(thm)],[307,252,theory(equality)])).
% cnf(319,plain,(is_a_theorem(and(not(and(and(X1,X2),not(X1))),not(and(and(X1,X2),not(X1)))))),inference(spm,[status(thm)],[309,269,theory(equality)])).
% cnf(325,plain,(is_a_theorem(and(implies(and(X1,X2),X1),implies(and(X1,X2),X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[319,259,theory(equality)]),259,theory(equality)])).
% cnf(356,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),not(and(not(X3),X1)))))),inference(spm,[status(thm)],[288,271,theory(equality)])).
% cnf(359,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,and(X2,X2)),X1))),inference(rw,[status(thm)],[311,271,theory(equality)])).
% cnf(362,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(and(X2,X3),X2),X1))),inference(rw,[status(thm)],[309,271,theory(equality)])).
% cnf(370,plain,(is_a_theorem(or(and(and(X1,X1),X2),not(and(X2,X1))))),inference(spm,[status(thm)],[359,288,theory(equality)])).
% cnf(374,plain,(is_a_theorem(or(and(X1,X2),not(and(X2,and(X1,X3)))))),inference(spm,[status(thm)],[362,288,theory(equality)])).
% cnf(522,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,254,theory(equality)])).
% cnf(526,plain,(is_a_theorem(or(and(X1,X2),not(and(X2,not(X3)))))|~is_a_theorem(or(X3,X1))),inference(spm,[status(thm)],[289,268,theory(equality)])).
% cnf(534,plain,(is_a_theorem(or(and(X1,X2),implies(X2,X3)))|~is_a_theorem(or(X3,X1))),inference(rw,[status(thm)],[526,259,theory(equality)])).
% cnf(566,plain,(is_a_theorem(or(and(and(not(X1),not(X1)),X2),implies(X2,X1)))),inference(spm,[status(thm)],[534,269,theory(equality)])).
% cnf(569,plain,(is_a_theorem(or(and(and(not(X1),not(X1)),not(X2)),or(X2,X1)))),inference(spm,[status(thm)],[566,268,theory(equality)])).
% cnf(576,plain,(is_a_theorem(implies(implies(and(not(X1),not(X1)),X2),or(X2,X1)))),inference(rw,[status(thm)],[569,271,theory(equality)])).
% cnf(704,plain,(is_a_theorem(implies(or(X1,X2),or(and(X2,not(X3)),or(X3,X1))))),inference(spm,[status(thm)],[294,268,theory(equality)])).
% cnf(711,plain,(is_a_theorem(implies(or(X1,X2),implies(implies(X2,X3),or(X3,X1))))),inference(rw,[status(thm)],[704,271,theory(equality)])).
% cnf(728,plain,(is_a_theorem(not(and(implies(X1,X2),and(X1,not(X2)))))),inference(spm,[status(thm)],[522,370,theory(equality)])).
% cnf(733,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(implies(X2,X3),and(X2,not(X3))),X1))),inference(spm,[status(thm)],[270,728,theory(equality)])).
% cnf(2691,plain,(is_a_theorem(implies(implies(X1,X2),not(and(not(X2),X3))))|~is_a_theorem(implies(X3,X1))),inference(spm,[status(thm)],[263,356,theory(equality)])).
% cnf(2694,plain,(is_a_theorem(implies(implies(and(X1,X1),X2),not(and(not(X2),X1))))),inference(spm,[status(thm)],[359,356,theory(equality)])).
% cnf(2706,plain,(is_a_theorem(implies(implies(X1,not(X2)),implies(or(X2,X3),not(and(not(X3),X1)))))),inference(spm,[status(thm)],[356,268,theory(equality)])).
% cnf(2730,plain,(is_a_theorem(not(and(not(X1),X1)))),inference(spm,[status(thm)],[362,2694,theory(equality)])).
% cnf(2745,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(not(X2),X2),X1))),inference(spm,[status(thm)],[270,2730,theory(equality)])).
% cnf(2750,plain,(is_a_theorem(implies(not(not(X1)),X1))),inference(spm,[status(thm)],[2730,259,theory(equality)])).
% cnf(2754,plain,(is_a_theorem(or(not(X1),X1))),inference(rw,[status(thm)],[2750,268,theory(equality)])).
% cnf(2757,plain,(is_a_theorem(or(and(X1,X2),implies(X2,not(X1))))),inference(spm,[status(thm)],[534,2754,theory(equality)])).
% cnf(2762,plain,(is_a_theorem(or(and(implies(X1,not(X2)),X3),implies(X3,and(X2,X1))))),inference(spm,[status(thm)],[534,2757,theory(equality)])).
% cnf(2821,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(not(not(X2)),X2),X1))),inference(spm,[status(thm)],[2745,271,theory(equality)])).
% cnf(2831,plain,(is_a_theorem(implies(X1,not(not(X1))))),inference(spm,[status(thm)],[2745,2757,theory(equality)])).
% cnf(2832,plain,(is_a_theorem(not(and(X1,and(not(X1),X2))))),inference(spm,[status(thm)],[2745,374,theory(equality)])).
% cnf(2835,plain,(is_a_theorem(X1)|~is_a_theorem(implies(or(not(X2),X2),X1))),inference(rw,[status(thm)],[2821,268,theory(equality)])).
% cnf(2845,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[263,2831,theory(equality)])).
% cnf(2847,plain,(is_a_theorem(or(and(not(not(X1)),X2),not(and(X2,X1))))),inference(spm,[status(thm)],[289,2831,theory(equality)])).
% cnf(2852,plain,(is_a_theorem(X1)|~is_a_theorem(or(not(X2),X1))|~is_a_theorem(X2)),inference(spm,[status(thm)],[270,2845,theory(equality)])).
% cnf(2855,plain,(is_a_theorem(not(implies(X1,X2)))|~is_a_theorem(and(X1,not(X2)))),inference(spm,[status(thm)],[2845,259,theory(equality)])).
% cnf(2856,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,and(not(X2),X3)),X1))),inference(spm,[status(thm)],[270,2832,theory(equality)])).
% cnf(3087,plain,(is_a_theorem(X1)|~is_a_theorem(implies(or(implies(X2,X3),and(X2,not(X3))),X1))),inference(spm,[status(thm)],[2835,259,theory(equality)])).
% cnf(3089,plain,(is_a_theorem(and(or(not(X1),X1),or(not(X1),X1)))),inference(spm,[status(thm)],[2835,252,theory(equality)])).
% cnf(3507,plain,(is_a_theorem(not(and(and(not(X1),X2),and(X1,X3))))),inference(spm,[status(thm)],[2856,374,theory(equality)])).
% cnf(3555,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(and(not(X2),X3),and(X2,X4)),X1))),inference(spm,[status(thm)],[270,3507,theory(equality)])).
% cnf(4333,plain,(is_a_theorem(implies(and(X1,not(not(X2))),and(X2,X1)))),inference(spm,[status(thm)],[733,2762,theory(equality)])).
% cnf(4358,plain,(is_a_theorem(and(X1,X2))|~is_a_theorem(and(X2,not(not(X1))))),inference(spm,[status(thm)],[263,4333,theory(equality)])).
% cnf(4372,plain,(is_a_theorem(and(X1,not(not(X1))))|~is_a_theorem(not(not(X1)))),inference(spm,[status(thm)],[4358,265,theory(equality)])).
% cnf(4375,plain,(is_a_theorem(and(X1,not(not(X1))))|~is_a_theorem(X1)),inference(spm,[status(thm)],[4372,2845,theory(equality)])).
% cnf(4408,plain,(is_a_theorem(not(implies(X1,not(X1))))|~is_a_theorem(X1)),inference(spm,[status(thm)],[2855,4375,theory(equality)])).
% cnf(4449,plain,(is_a_theorem(X1)|~is_a_theorem(or(implies(X2,not(X2)),X1))|~is_a_theorem(X2)),inference(spm,[status(thm)],[270,4408,theory(equality)])).
% cnf(5192,plain,(is_a_theorem(or(and(and(X1,not(X2)),X3),implies(X3,implies(X1,X2))))),inference(spm,[status(thm)],[3087,294,theory(equality)])).
% cnf(7265,plain,(is_a_theorem(implies(and(X1,X2),implies(not(X1),X3)))),inference(spm,[status(thm)],[3555,5192,theory(equality)])).
% cnf(7272,plain,(is_a_theorem(implies(and(X1,X2),or(X1,X3)))),inference(rw,[status(thm)],[7265,268,theory(equality)])).
% cnf(7274,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(and(X1,X3))),inference(spm,[status(thm)],[263,7272,theory(equality)])).
% cnf(7305,plain,(is_a_theorem(or(or(not(X1),X1),X2))),inference(spm,[status(thm)],[7274,3089,theory(equality)])).
% cnf(7308,plain,(is_a_theorem(or(implies(and(X1,X2),X1),X3))),inference(spm,[status(thm)],[7274,325,theory(equality)])).
% cnf(7320,plain,(is_a_theorem(or(and(X1,X2),implies(X2,or(not(X3),X3))))),inference(spm,[status(thm)],[534,7305,theory(equality)])).
% cnf(7589,plain,(is_a_theorem(or(and(X1,X2),implies(X2,implies(and(X3,X4),X3))))),inference(spm,[status(thm)],[534,7308,theory(equality)])).
% cnf(8306,plain,(is_a_theorem(implies(X1,or(not(X2),X2)))),inference(spm,[status(thm)],[2745,7320,theory(equality)])).
% cnf(8353,plain,(is_a_theorem(or(X1,or(not(X2),X2)))),inference(spm,[status(thm)],[8306,268,theory(equality)])).
% cnf(8508,plain,(is_a_theorem(or(and(or(not(X1),X1),X2),implies(X2,X3)))),inference(spm,[status(thm)],[534,8353,theory(equality)])).
% cnf(9098,plain,(is_a_theorem(implies(X1,implies(and(X2,X3),X2)))),inference(spm,[status(thm)],[2745,7589,theory(equality)])).
% cnf(9153,plain,(is_a_theorem(or(X1,implies(and(X2,X3),X2)))),inference(spm,[status(thm)],[9098,268,theory(equality)])).
% cnf(10322,plain,(is_a_theorem(or(and(implies(and(X1,X2),X1),X3),implies(X3,X4)))),inference(spm,[status(thm)],[534,9153,theory(equality)])).
% cnf(10400,plain,(is_a_theorem(or(and(implies(X1,X2),X3),implies(X3,and(implies(and(X4,X5),X4),X1))))),inference(spm,[status(thm)],[534,10322,theory(equality)])).
% cnf(13189,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(implies(and(not(X2),not(X2)),X1))),inference(spm,[status(thm)],[263,576,theory(equality)])).
% cnf(14247,plain,(is_a_theorem(or(and(X1,not(not(X1))),not(X1)))),inference(spm,[status(thm)],[13189,4333,theory(equality)])).
% cnf(14272,plain,(is_a_theorem(implies(implies(X1,not(X1)),not(X1)))),inference(rw,[status(thm)],[14247,271,theory(equality)])).
% cnf(14304,plain,(is_a_theorem(or(and(not(X1),X2),not(and(X2,implies(X1,not(X1))))))),inference(spm,[status(thm)],[289,14272,theory(equality)])).
% cnf(14314,plain,(is_a_theorem(or(and(not(X1),X2),implies(X2,and(X1,not(not(X1))))))),inference(rw,[status(thm)],[14304,260,theory(equality)])).
% cnf(18302,plain,(is_a_theorem(implies(X1,and(X1,not(not(X1)))))),inference(spm,[status(thm)],[2745,14314,theory(equality)])).
% cnf(18376,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,implies(X2,not(X2))),X1))),inference(spm,[status(thm)],[306,18302,theory(equality)])).
% cnf(18636,plain,(is_a_theorem(not(and(implies(X1,not(X1)),and(X1,X2))))),inference(spm,[status(thm)],[18376,374,theory(equality)])).
% cnf(18757,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(implies(X2,not(X2)),and(X2,X3)),X1))),inference(spm,[status(thm)],[270,18636,theory(equality)])).
% cnf(25633,plain,(is_a_theorem(implies(implies(X1,X2),or(X2,not(X1))))),inference(spm,[status(thm)],[2835,711,theory(equality)])).
% cnf(25653,plain,(is_a_theorem(or(X1,not(X2)))|~is_a_theorem(implies(X2,X1))),inference(spm,[status(thm)],[263,25633,theory(equality)])).
% cnf(25658,plain,(is_a_theorem(or(X1,not(and(X1,X2))))),inference(spm,[status(thm)],[362,25633,theory(equality)])).
% cnf(25760,plain,(is_a_theorem(not(and(not(X1),X2)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[2852,25658,theory(equality)])).
% cnf(25788,plain,(is_a_theorem(or(X1,implies(X1,X2)))),inference(spm,[status(thm)],[25658,259,theory(equality)])).
% cnf(29284,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(not(X2),X3),X1))|~is_a_theorem(X2)),inference(spm,[status(thm)],[270,25760,theory(equality)])).
% cnf(29455,plain,(is_a_theorem(not(and(X1,X2)))|~is_a_theorem(not(X2))),inference(spm,[status(thm)],[29284,2847,theory(equality)])).
% cnf(29833,plain,(is_a_theorem(not(and(X1,not(X2))))|~is_a_theorem(X2)),inference(spm,[status(thm)],[29455,2845,theory(equality)])).
% cnf(29907,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(X2)),inference(rw,[status(thm)],[29833,259,theory(equality)])).
% cnf(30048,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(X2)),inference(spm,[status(thm)],[29907,268,theory(equality)])).
% cnf(30331,plain,(is_a_theorem(or(and(X1,X2),implies(X2,X3)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[534,30048,theory(equality)])).
% cnf(234119,plain,(is_a_theorem(implies(and(X1,X2),and(X1,X1)))),inference(spm,[status(thm)],[18757,2762,theory(equality)])).
% cnf(234366,plain,(is_a_theorem(or(and(not(X1),not(X1)),X1))),inference(spm,[status(thm)],[13189,234119,theory(equality)])).
% cnf(234384,plain,(is_a_theorem(implies(or(X1,X1),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[234366,271,theory(equality)]),268,theory(equality)])).
% cnf(234392,plain,(is_a_theorem(or(X1,not(or(X1,X1))))),inference(spm,[status(thm)],[25653,234384,theory(equality)])).
% cnf(234561,plain,(is_a_theorem(or(and(not(or(X1,X1)),X2),implies(X2,X1)))),inference(spm,[status(thm)],[534,234392,theory(equality)])).
% cnf(358967,plain,(is_a_theorem(implies(implies(not(not(X1)),X2),not(and(not(X2),X1))))),inference(spm,[status(thm)],[2691,2831,theory(equality)])).
% cnf(359390,plain,(is_a_theorem(implies(or(not(X1),X2),not(and(not(X2),X1))))),inference(rw,[status(thm)],[358967,268,theory(equality)])).
% cnf(359588,plain,(is_a_theorem(not(and(not(X1),X2)))|~is_a_theorem(or(not(X2),X1))),inference(spm,[status(thm)],[263,359390,theory(equality)])).
% cnf(362890,plain,(is_a_theorem(not(and(not(implies(not(X1),X2)),X1)))),inference(spm,[status(thm)],[359588,25788,theory(equality)])).
% cnf(363512,plain,(is_a_theorem(not(and(not(or(X1,X2)),X1)))),inference(rw,[status(thm)],[362890,268,theory(equality)])).
% cnf(363900,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(not(or(X2,X3)),X2),X1))),inference(spm,[status(thm)],[270,363512,theory(equality)])).
% cnf(387148,plain,(is_a_theorem(implies(X1,X1))),inference(spm,[status(thm)],[363900,234561,theory(equality)])).
% cnf(387499,plain,(is_a_theorem(or(and(X1,X2),not(and(X2,X1))))),inference(spm,[status(thm)],[289,387148,theory(equality)])).
% cnf(387500,plain,(is_a_theorem(implies(implies(X1,X2),not(and(not(X2),X1))))),inference(spm,[status(thm)],[2691,387148,theory(equality)])).
% cnf(392112,plain,(is_a_theorem(not(and(implies(X1,not(X1)),X1)))),inference(spm,[status(thm)],[18376,387499,theory(equality)])).
% cnf(392338,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(implies(X2,not(X2)),X2),X1))),inference(spm,[status(thm)],[270,392112,theory(equality)])).
% cnf(397280,plain,(is_a_theorem(not(and(not(X1),X2)))|~is_a_theorem(implies(X2,X1))),inference(spm,[status(thm)],[263,387500,theory(equality)])).
% cnf(491054,plain,(is_a_theorem(not(and(not(X1),not(X2))))|~is_a_theorem(or(X2,X1))),inference(spm,[status(thm)],[397280,268,theory(equality)])).
% cnf(492228,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X2,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[491054,259,theory(equality)]),268,theory(equality)])).
% cnf(493066,plain,(is_a_theorem(or(implies(X1,X2),and(or(not(X3),X3),X1)))),inference(spm,[status(thm)],[492228,8508,theory(equality)])).
% cnf(516425,plain,(is_a_theorem(and(or(not(X1),X1),X2))|~is_a_theorem(X2)),inference(spm,[status(thm)],[4449,493066,theory(equality)])).
% cnf(618365,plain,(is_a_theorem(equiv(not(not(X1)),X1))|~is_a_theorem(implies(X1,not(not(X1))))),inference(spm,[status(thm)],[516425,285,theory(equality)])).
% cnf(618385,plain,(is_a_theorem(equiv(not(not(X1)),X1))|$false),inference(rw,[status(thm)],[618365,2831,theory(equality)])).
% cnf(618386,plain,(is_a_theorem(equiv(not(not(X1)),X1))),inference(cn,[status(thm)],[618385,theory(equality)])).
% cnf(619378,plain,(not(not(X1))=X1),inference(spm,[status(thm)],[250,618386,theory(equality)])).
% cnf(619402,plain,(implies(X1,X2)=or(not(X1),X2)),inference(spm,[status(thm)],[268,619378,theory(equality)])).
% cnf(620369,plain,(not(and(X1,X2))=implies(X1,not(X2))),inference(spm,[status(thm)],[259,619378,theory(equality)])).
% cnf(620615,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,not(X2)),X1))),inference(spm,[status(thm)],[2745,619378,theory(equality)])).
% cnf(624709,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,X2),X1))),inference(rw,[status(thm)],[620615,271,theory(equality)])).
% cnf(626186,plain,(is_a_theorem(implies(or(X1,X2),not(and(not(X2),not(X1)))))),inference(spm,[status(thm)],[624709,2706,theory(equality)])).
% cnf(626547,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[626186,259,theory(equality)]),268,theory(equality)])).
% cnf(683644,plain,(is_a_theorem(implies(X1,and(implies(and(X2,X3),X2),X1)))),inference(spm,[status(thm)],[392338,10400,theory(equality)])).
% cnf(685584,plain,(is_a_theorem(and(implies(and(X1,X2),X1),implies(X3,and(X3,X3))))),inference(spm,[status(thm)],[359,683644,theory(equality)])).
% cnf(762319,plain,(is_a_theorem(equiv(and(X1,X1),X1))),inference(spm,[status(thm)],[685584,281,theory(equality)])).
% cnf(762330,plain,(and(X1,X1)=X1),inference(spm,[status(thm)],[250,762319,theory(equality)])).
% cnf(763470,plain,(not(X1)=implies(X1,not(X1))),inference(spm,[status(thm)],[620369,762330,theory(equality)])).
% cnf(777788,plain,(is_a_theorem(or(and(X1,X2),not(X2)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[30331,763470,theory(equality)])).
% cnf(817960,plain,(is_a_theorem(or(not(X1),and(X2,X1)))|~is_a_theorem(X2)),inference(spm,[status(thm)],[492228,777788,theory(equality)])).
% cnf(818007,plain,(is_a_theorem(implies(X1,and(X2,X1)))|~is_a_theorem(X2)),inference(rw,[status(thm)],[817960,619402,theory(equality)])).
% cnf(818061,plain,(is_a_theorem(and(X1,X2))|~is_a_theorem(X2)|~is_a_theorem(X1)),inference(spm,[status(thm)],[263,818007,theory(equality)])).
% cnf(818212,plain,(is_a_theorem(equiv(X1,X2))|~is_a_theorem(implies(X2,X1))|~is_a_theorem(implies(X1,X2))),inference(spm,[status(thm)],[818061,281,theory(equality)])).
% cnf(819051,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)],[818212,626547,theory(equality)])).
% cnf(819602,plain,(is_a_theorem(equiv(or(X1,X2),or(X2,X1)))|$false),inference(rw,[status(thm)],[819051,626547,theory(equality)])).
% cnf(819603,plain,(is_a_theorem(equiv(or(X1,X2),or(X2,X1)))),inference(cn,[status(thm)],[819602,theory(equality)])).
% cnf(819660,plain,(or(X1,X2)=or(X2,X1)),inference(spm,[status(thm)],[250,819603,theory(equality)])).
% cnf(820836,plain,(or(X2,not(X1))=implies(X1,X2)),inference(spm,[status(thm)],[619402,819660,theory(equality)])).
% cnf(844710,plain,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[274,820836,theory(equality)]),387148,theory(equality)])).
% cnf(844711,plain,($false),inference(cn,[status(thm)],[844710,theory(equality)])).
% cnf(844712,plain,($false),844711,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 24473
% # ...of these trivial : 4913
% # ...subsumed : 10222
% # ...remaining for further processing: 9338
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 149
% # Backward-rewritten : 7930
% # Generated clauses : 550957
% # ...of the previous two non-trivial : 312718
% # Contextual simplify-reflections : 159
% # Paramodulations : 550957
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1259
% # Positive orientable unit clauses: 954
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 3
% # Non-unit-clauses : 299
% # Current number of unprocessed clauses: 15911
% # ...number of literals in the above : 19975
% # Clause-clause subsumption calls (NU) : 165471
% # Rec. Clause-clause subsumption calls : 165455
% # Unit Clause-clause subsumption calls : 31454
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1247517
% # Indexed BW rewrite successes : 7320
% # Backwards rewriting index: 657 leaves, 4.58+/-10.109 terms/leaf
% # Paramod-from index: 84 leaves, 11.62+/-22.871 terms/leaf
% # Paramod-into index: 637 leaves, 4.61+/-10.187 terms/leaf
% # -------------------------------------------------
% # User time : 23.959 s
% # System time : 0.675 s
% # Total time : 24.634 s
% # Maximum resident set size: 0 pages
% PrfWatch: 33.71 CPU 34.66 WC
% FINAL PrfWatch: 33.71 CPU 34.66 WC
% SZS output end Solution for /tmp/SystemOnTPTP7429/LCL502+1.tptp
%
%------------------------------------------------------------------------------