TSTP Solution File: LCL507+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL507+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 : art07.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:43:37 EST 2010
% Result : Theorem 32.19s
% Output : Solution 32.19s
% 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/SystemOnTPTP12276/LCL507+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12276/LCL507+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12276/LCL507+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 12372
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.02 WC
% PrfWatch: 3.92 CPU 4.02 WC
% PrfWatch: 5.92 CPU 6.03 WC
% PrfWatch: 7.91 CPU 8.03 WC
% PrfWatch: 9.90 CPU 10.04 WC
% PrfWatch: 11.89 CPU 12.04 WC
% PrfWatch: 13.88 CPU 14.05 WC
% PrfWatch: 15.87 CPU 16.05 WC
% PrfWatch: 17.86 CPU 18.06 WC
% PrfWatch: 19.85 CPU 20.06 WC
% PrfWatch: 21.85 CPU 22.07 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 23.83 CPU 24.07 WC
% PrfWatch: 25.82 CPU 26.08 WC
% PrfWatch: 27.82 CPU 28.08 WC
% PrfWatch: 29.81 CPU 30.09 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,(and_2<=>![X1]:![X2]:is_a_theorem(implies(and(X1,X2),X2))),file('/tmp/SRASS.s.p', and_2)).
% fof(2, axiom,op_equiv,file('/tmp/SRASS.s.p', rosser_op_equiv)).
% 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,(kn1<=>![X3]:is_a_theorem(implies(X3,and(X3,X3)))),file('/tmp/SRASS.s.p', kn1)).
% fof(11, axiom,(kn2<=>![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3))),file('/tmp/SRASS.s.p', kn2)).
% fof(12, axiom,op_or,file('/tmp/SRASS.s.p', rosser_op_or)).
% fof(13, axiom,op_implies_and,file('/tmp/SRASS.s.p', rosser_op_implies_and)).
% fof(14, axiom,substitution_of_equivalents,file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(17, 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(18, 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(26, axiom,(substitution_of_equivalents<=>![X1]:![X2]:(is_a_theorem(equiv(X1,X2))=>X1=X2)),file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(27, axiom,(op_implies_and=>![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(36, axiom,(op_equiv=>![X1]:![X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))),file('/tmp/SRASS.s.p', op_equiv)).
% fof(40, axiom,(op_or=>![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_or)).
% fof(43, conjecture,and_2,file('/tmp/SRASS.s.p', hilbert_and_2)).
% fof(44, negated_conjecture,~(and_2),inference(assume_negation,[status(cth)],[43])).
% fof(45, negated_conjecture,~(and_2),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(46, plain,((~(and_2)|![X1]:![X2]:is_a_theorem(implies(and(X1,X2),X2)))&(?[X1]:?[X2]:~(is_a_theorem(implies(and(X1,X2),X2)))|and_2)),inference(fof_nnf,[status(thm)],[1])).
% fof(47, plain,((~(and_2)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X4)))&(?[X5]:?[X6]:~(is_a_theorem(implies(and(X5,X6),X6)))|and_2)),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,((~(and_2)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X4)))&(~(is_a_theorem(implies(and(esk1_0,esk2_0),esk2_0)))|and_2)),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X3]:![X4]:((is_a_theorem(implies(and(X3,X4),X4))|~(and_2))&(~(is_a_theorem(implies(and(esk1_0,esk2_0),esk2_0)))|and_2)),inference(shift_quantors,[status(thm)],[48])).
% cnf(50,plain,(and_2|~is_a_theorem(implies(and(esk1_0,esk2_0),esk2_0))),inference(split_conjunct,[status(thm)],[49])).
% cnf(52,plain,(op_equiv),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])).
% fof(70, 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)],[10])).
% fof(71, 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)],[70])).
% fof(72, plain,((~(kn1)|![X4]:is_a_theorem(implies(X4,and(X4,X4))))&(~(is_a_theorem(implies(esk7_0,and(esk7_0,esk7_0))))|kn1)),inference(skolemize,[status(esa)],[71])).
% fof(73, plain,![X4]:((is_a_theorem(implies(X4,and(X4,X4)))|~(kn1))&(~(is_a_theorem(implies(esk7_0,and(esk7_0,esk7_0))))|kn1)),inference(shift_quantors,[status(thm)],[72])).
% cnf(75,plain,(is_a_theorem(implies(X1,and(X1,X1)))|~kn1),inference(split_conjunct,[status(thm)],[73])).
% fof(76, 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)],[11])).
% fof(77, 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)],[76])).
% fof(78, plain,((~(kn2)|![X5]:![X6]:is_a_theorem(implies(and(X5,X6),X5)))&(~(is_a_theorem(implies(and(esk8_0,esk9_0),esk8_0)))|kn2)),inference(skolemize,[status(esa)],[77])).
% fof(79, plain,![X5]:![X6]:((is_a_theorem(implies(and(X5,X6),X5))|~(kn2))&(~(is_a_theorem(implies(and(esk8_0,esk9_0),esk8_0)))|kn2)),inference(shift_quantors,[status(thm)],[78])).
% cnf(81,plain,(is_a_theorem(implies(and(X1,X2),X1))|~kn2),inference(split_conjunct,[status(thm)],[79])).
% cnf(82,plain,(op_or),inference(split_conjunct,[status(thm)],[12])).
% cnf(83,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[13])).
% cnf(84,plain,(substitution_of_equivalents),inference(split_conjunct,[status(thm)],[14])).
% fof(87, 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)],[17])).
% fof(88, 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)],[87])).
% fof(89, 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(esk10_0,esk11_0),implies(not(and(esk11_0,esk12_0)),not(and(esk12_0,esk10_0))))))|kn3)),inference(skolemize,[status(esa)],[88])).
% fof(90, 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(esk10_0,esk11_0),implies(not(and(esk11_0,esk12_0)),not(and(esk12_0,esk10_0))))))|kn3)),inference(shift_quantors,[status(thm)],[89])).
% cnf(92,plain,(is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))|~kn3),inference(split_conjunct,[status(thm)],[90])).
% fof(93, 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)],[18])).
% fof(94, 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)],[93])).
% fof(95, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(((is_a_theorem(esk13_0)&is_a_theorem(implies(esk13_0,esk14_0)))&~(is_a_theorem(esk14_0)))|modus_ponens)),inference(skolemize,[status(esa)],[94])).
% fof(96, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk13_0)&is_a_theorem(implies(esk13_0,esk14_0)))&~(is_a_theorem(esk14_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[95])).
% fof(97, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk13_0)|modus_ponens)&(is_a_theorem(implies(esk13_0,esk14_0))|modus_ponens))&(~(is_a_theorem(esk14_0))|modus_ponens))),inference(distribute,[status(thm)],[96])).
% cnf(101,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[97])).
% fof(144, 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)],[26])).
% fof(145, 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)],[144])).
% fof(146, plain,((~(substitution_of_equivalents)|![X3]:![X4]:(~(is_a_theorem(equiv(X3,X4)))|X3=X4))&((is_a_theorem(equiv(esk30_0,esk31_0))&~(esk30_0=esk31_0))|substitution_of_equivalents)),inference(skolemize,[status(esa)],[145])).
% fof(147, plain,![X3]:![X4]:(((~(is_a_theorem(equiv(X3,X4)))|X3=X4)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk30_0,esk31_0))&~(esk30_0=esk31_0))|substitution_of_equivalents)),inference(shift_quantors,[status(thm)],[146])).
% fof(148, plain,![X3]:![X4]:(((~(is_a_theorem(equiv(X3,X4)))|X3=X4)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk30_0,esk31_0))|substitution_of_equivalents)&(~(esk30_0=esk31_0)|substitution_of_equivalents))),inference(distribute,[status(thm)],[147])).
% cnf(151,plain,(X1=X2|~substitution_of_equivalents|~is_a_theorem(equiv(X1,X2))),inference(split_conjunct,[status(thm)],[148])).
% fof(152, plain,(~(op_implies_and)|![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),inference(fof_nnf,[status(thm)],[27])).
% fof(153, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(variable_rename,[status(thm)],[152])).
% fof(154, plain,![X3]:![X4]:(implies(X3,X4)=not(and(X3,not(X4)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[153])).
% cnf(155,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[154])).
% fof(204, plain,(~(op_equiv)|![X1]:![X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))),inference(fof_nnf,[status(thm)],[36])).
% fof(205, plain,(~(op_equiv)|![X3]:![X4]:equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))),inference(variable_rename,[status(thm)],[204])).
% fof(206, plain,![X3]:![X4]:(equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))|~(op_equiv)),inference(shift_quantors,[status(thm)],[205])).
% cnf(207,plain,(equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv),inference(split_conjunct,[status(thm)],[206])).
% fof(226, plain,(~(op_or)|![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[40])).
% fof(227, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[226])).
% fof(228, plain,![X3]:![X4]:(or(X3,X4)=not(and(not(X3),not(X4)))|~(op_or)),inference(shift_quantors,[status(thm)],[227])).
% cnf(229,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[228])).
% cnf(238,negated_conjecture,(~and_2),inference(split_conjunct,[status(thm)],[45])).
% cnf(245,plain,(~is_a_theorem(implies(and(esk1_0,esk2_0),esk2_0))),inference(sr,[status(thm)],[50,238,theory(equality)])).
% cnf(250,plain,(X1=X2|$false|~is_a_theorem(equiv(X1,X2))),inference(rw,[status(thm)],[151,84,theory(equality)])).
% cnf(251,plain,(X1=X2|~is_a_theorem(equiv(X1,X2))),inference(cn,[status(thm)],[250,theory(equality)])).
% cnf(252,plain,(is_a_theorem(implies(X1,and(X1,X1)))|$false),inference(rw,[status(thm)],[75,54,theory(equality)])).
% cnf(253,plain,(is_a_theorem(implies(X1,and(X1,X1)))),inference(cn,[status(thm)],[252,theory(equality)])).
% cnf(254,plain,(is_a_theorem(implies(and(X1,X2),X1))|$false),inference(rw,[status(thm)],[81,55,theory(equality)])).
% cnf(255,plain,(is_a_theorem(implies(and(X1,X2),X1))),inference(cn,[status(thm)],[254,theory(equality)])).
% cnf(259,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[155,83,theory(equality)])).
% cnf(260,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[259,theory(equality)])).
% cnf(261,plain,(not(and(X1,implies(X2,X3)))=implies(X1,and(X2,not(X3)))),inference(spm,[status(thm)],[260,260,theory(equality)])).
% cnf(262,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[101,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,253,theory(equality)])).
% cnf(266,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[229,260,theory(equality)])).
% cnf(267,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[266,82,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)],[253,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,260,theory(equality)])).
% cnf(279,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)|$false),inference(rw,[status(thm)],[207,52,theory(equality)])).
% cnf(280,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)),inference(cn,[status(thm)],[279,theory(equality)])).
% cnf(284,plain,(and(or(X1,X2),implies(X2,not(X1)))=equiv(not(X1),X2)),inference(spm,[status(thm)],[280,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)],[92,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,260,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(300,plain,(not(and(X1,or(X2,X3)))=implies(X1,and(not(X2),not(X3)))),inference(spm,[status(thm)],[261,268,theory(equality)])).
% cnf(306,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,260,theory(equality)])).
% cnf(307,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,261,theory(equality)])).
% cnf(310,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(and(X2,X3),not(X2)),X1))),inference(spm,[status(thm)],[306,255,theory(equality)])).
% cnf(311,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,not(and(X2,X2))),X1))),inference(spm,[status(thm)],[306,253,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)],[310,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,260,theory(equality)]),260,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(361,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(and(X2,X3),X2),X1))),inference(rw,[status(thm)],[310,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)],[361,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)],[307,255,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,260,theory(equality)])).
% cnf(560,plain,(is_a_theorem(or(and(not(and(X1,X2)),X3),implies(X3,and(and(X2,X2),X1))))),inference(spm,[status(thm)],[534,370,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(1128,plain,(not(and(not(X1),or(X2,X3)))=or(X1,and(not(X2),not(X3)))),inference(spm,[status(thm)],[268,300,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(2730,plain,(is_a_theorem(not(and(not(X1),X1)))),inference(spm,[status(thm)],[361,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(2749,plain,(is_a_theorem(implies(not(not(X1)),X1))),inference(spm,[status(thm)],[2730,260,theory(equality)])).
% cnf(2753,plain,(is_a_theorem(or(not(X1),X1))),inference(rw,[status(thm)],[2749,268,theory(equality)])).
% cnf(2757,plain,(is_a_theorem(or(and(X1,X2),implies(X2,not(X1))))),inference(spm,[status(thm)],[534,2753,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(2823,plain,(is_a_theorem(not(and(X1,and(not(X1),X2))))),inference(spm,[status(thm)],[2745,374,theory(equality)])).
% cnf(2826,plain,(is_a_theorem(implies(and(X1,X2),and(and(X2,X2),X1)))),inference(spm,[status(thm)],[2745,560,theory(equality)])).
% cnf(2833,plain,(is_a_theorem(implies(X1,not(not(X1))))),inference(spm,[status(thm)],[2745,2757,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,2833,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(2854,plain,(is_a_theorem(not(implies(X1,X2)))|~is_a_theorem(and(X1,not(X2)))),inference(spm,[status(thm)],[2845,260,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,2823,theory(equality)])).
% cnf(2880,plain,(is_a_theorem(X1)|~is_a_theorem(implies(or(implies(X2,X3),and(X2,not(X3))),X1))),inference(spm,[status(thm)],[2835,260,theory(equality)])).
% cnf(2884,plain,(is_a_theorem(and(or(not(X1),X1),or(not(X1),X1)))),inference(spm,[status(thm)],[2835,253,theory(equality)])).
% cnf(2922,plain,(is_a_theorem(or(and(and(and(X1,X1),X2),X3),not(and(X3,and(X2,X1)))))),inference(spm,[status(thm)],[289,2826,theory(equality)])).
% cnf(3493,plain,(is_a_theorem(not(and(and(not(X1),X2),and(X1,X3))))),inference(spm,[status(thm)],[2856,374,theory(equality)])).
% cnf(3546,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(and(not(X2),X3),and(X2,X4)),X1))),inference(spm,[status(thm)],[270,3493,theory(equality)])).
% cnf(4332,plain,(is_a_theorem(implies(and(X1,not(not(X2))),and(X2,X1)))),inference(spm,[status(thm)],[733,2762,theory(equality)])).
% cnf(4357,plain,(is_a_theorem(and(X1,X2))|~is_a_theorem(and(X2,not(not(X1))))),inference(spm,[status(thm)],[263,4332,theory(equality)])).
% cnf(4371,plain,(is_a_theorem(and(X1,not(not(X1))))|~is_a_theorem(not(not(X1)))),inference(spm,[status(thm)],[4357,265,theory(equality)])).
% cnf(4374,plain,(is_a_theorem(and(X1,not(not(X1))))|~is_a_theorem(X1)),inference(spm,[status(thm)],[4371,2845,theory(equality)])).
% cnf(4407,plain,(is_a_theorem(not(implies(X1,not(X1))))|~is_a_theorem(X1)),inference(spm,[status(thm)],[2854,4374,theory(equality)])).
% cnf(4448,plain,(is_a_theorem(X1)|~is_a_theorem(or(implies(X2,not(X2)),X1))|~is_a_theorem(X2)),inference(spm,[status(thm)],[270,4407,theory(equality)])).
% cnf(5191,plain,(is_a_theorem(or(and(and(X1,not(X2)),X3),implies(X3,implies(X1,X2))))),inference(spm,[status(thm)],[2880,294,theory(equality)])).
% cnf(7260,plain,(is_a_theorem(implies(and(X1,X2),implies(not(X1),X3)))),inference(spm,[status(thm)],[3546,5191,theory(equality)])).
% cnf(7263,plain,(is_a_theorem(implies(and(X1,X2),or(X1,X3)))),inference(rw,[status(thm)],[7260,268,theory(equality)])).
% cnf(7264,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(and(X1,X3))),inference(spm,[status(thm)],[263,7263,theory(equality)])).
% cnf(7295,plain,(is_a_theorem(or(or(not(X1),X1),X2))),inference(spm,[status(thm)],[7264,2884,theory(equality)])).
% cnf(7299,plain,(is_a_theorem(or(implies(and(X1,X2),X1),X3))),inference(spm,[status(thm)],[7264,325,theory(equality)])).
% cnf(7310,plain,(is_a_theorem(or(and(X1,X2),implies(X2,or(not(X3),X3))))),inference(spm,[status(thm)],[534,7295,theory(equality)])).
% cnf(7603,plain,(is_a_theorem(or(and(X1,X2),implies(X2,implies(and(X3,X4),X3))))),inference(spm,[status(thm)],[534,7299,theory(equality)])).
% cnf(8302,plain,(is_a_theorem(implies(X1,or(not(X2),X2)))),inference(spm,[status(thm)],[2745,7310,theory(equality)])).
% cnf(8348,plain,(is_a_theorem(or(X1,or(not(X2),X2)))),inference(spm,[status(thm)],[8302,268,theory(equality)])).
% cnf(8504,plain,(is_a_theorem(or(and(or(not(X1),X1),X2),implies(X2,X3)))),inference(spm,[status(thm)],[534,8348,theory(equality)])).
% cnf(9510,plain,(is_a_theorem(implies(X1,implies(and(X2,X3),X2)))),inference(spm,[status(thm)],[2745,7603,theory(equality)])).
% cnf(9757,plain,(is_a_theorem(or(X1,implies(and(X2,X3),X2)))),inference(spm,[status(thm)],[9510,268,theory(equality)])).
% cnf(11237,plain,(is_a_theorem(or(and(implies(and(X1,X2),X1),X3),implies(X3,X4)))),inference(spm,[status(thm)],[534,9757,theory(equality)])).
% cnf(11317,plain,(is_a_theorem(or(and(implies(X1,X2),X3),implies(X3,and(implies(and(X4,X5),X4),X1))))),inference(spm,[status(thm)],[534,11237,theory(equality)])).
% cnf(13182,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(14246,plain,(is_a_theorem(or(and(X1,not(not(X1))),not(X1)))),inference(spm,[status(thm)],[13182,4332,theory(equality)])).
% cnf(14266,plain,(is_a_theorem(implies(implies(X1,not(X1)),not(X1)))),inference(rw,[status(thm)],[14246,271,theory(equality)])).
% cnf(14297,plain,(is_a_theorem(or(and(not(X1),X2),not(and(X2,implies(X1,not(X1))))))),inference(spm,[status(thm)],[289,14266,theory(equality)])).
% cnf(14307,plain,(is_a_theorem(or(and(not(X1),X2),implies(X2,and(X1,not(not(X1))))))),inference(rw,[status(thm)],[14297,261,theory(equality)])).
% cnf(18295,plain,(is_a_theorem(implies(X1,and(X1,not(not(X1)))))),inference(spm,[status(thm)],[2745,14307,theory(equality)])).
% cnf(18369,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,implies(X2,not(X2))),X1))),inference(spm,[status(thm)],[307,18295,theory(equality)])).
% cnf(18589,plain,(is_a_theorem(not(and(implies(X1,not(X1)),and(X1,X2))))),inference(spm,[status(thm)],[18369,374,theory(equality)])).
% cnf(18719,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(implies(X2,not(X2)),and(X2,X3)),X1))),inference(spm,[status(thm)],[270,18589,theory(equality)])).
% cnf(25626,plain,(is_a_theorem(implies(implies(X1,X2),or(X2,not(X1))))),inference(spm,[status(thm)],[2835,711,theory(equality)])).
% cnf(25646,plain,(is_a_theorem(or(X1,not(X2)))|~is_a_theorem(implies(X2,X1))),inference(spm,[status(thm)],[263,25626,theory(equality)])).
% cnf(25651,plain,(is_a_theorem(or(X1,not(and(X1,X2))))),inference(spm,[status(thm)],[361,25626,theory(equality)])).
% cnf(25780,plain,(is_a_theorem(or(X1,implies(X1,X2)))),inference(spm,[status(thm)],[25651,260,theory(equality)])).
% cnf(26834,plain,(is_a_theorem(or(X1,not(not(X2))))|~is_a_theorem(or(X2,X1))),inference(spm,[status(thm)],[25646,268,theory(equality)])).
% cnf(40170,plain,(is_a_theorem(or(implies(X1,not(X2)),not(not(and(X2,X1)))))),inference(spm,[status(thm)],[26834,2757,theory(equality)])).
% cnf(233055,plain,(is_a_theorem(implies(and(X1,X2),and(X1,X1)))),inference(spm,[status(thm)],[18719,2762,theory(equality)])).
% cnf(233298,plain,(is_a_theorem(or(and(not(X1),not(X1)),X1))),inference(spm,[status(thm)],[13182,233055,theory(equality)])).
% cnf(233316,plain,(is_a_theorem(implies(or(X1,X1),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[233298,271,theory(equality)]),268,theory(equality)])).
% cnf(233324,plain,(is_a_theorem(or(X1,not(or(X1,X1))))),inference(spm,[status(thm)],[25646,233316,theory(equality)])).
% cnf(233493,plain,(is_a_theorem(or(and(not(or(X1,X1)),X2),implies(X2,X1)))),inference(spm,[status(thm)],[534,233324,theory(equality)])).
% cnf(357695,plain,(is_a_theorem(implies(implies(not(not(X1)),X2),not(and(not(X2),X1))))),inference(spm,[status(thm)],[2691,2833,theory(equality)])).
% cnf(358208,plain,(is_a_theorem(implies(or(not(X1),X2),not(and(not(X2),X1))))),inference(rw,[status(thm)],[357695,268,theory(equality)])).
% cnf(358409,plain,(is_a_theorem(not(and(not(X1),X2)))|~is_a_theorem(or(not(X2),X1))),inference(spm,[status(thm)],[263,358208,theory(equality)])).
% cnf(361901,plain,(is_a_theorem(not(and(not(implies(not(X1),X2)),X1)))),inference(spm,[status(thm)],[358409,25780,theory(equality)])).
% cnf(362324,plain,(is_a_theorem(not(and(not(or(X1,X2)),X1)))),inference(rw,[status(thm)],[361901,268,theory(equality)])).
% cnf(362720,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(not(or(X2,X3)),X2),X1))),inference(spm,[status(thm)],[270,362324,theory(equality)])).
% cnf(385786,plain,(is_a_theorem(implies(X1,X1))),inference(spm,[status(thm)],[362720,233493,theory(equality)])).
% cnf(386319,plain,(is_a_theorem(or(and(X1,X2),not(and(X2,X1))))),inference(spm,[status(thm)],[289,385786,theory(equality)])).
% cnf(386320,plain,(is_a_theorem(implies(implies(X1,X2),not(and(not(X2),X1))))),inference(spm,[status(thm)],[2691,385786,theory(equality)])).
% cnf(390932,plain,(is_a_theorem(not(and(implies(X1,not(X1)),X1)))),inference(spm,[status(thm)],[18369,386319,theory(equality)])).
% cnf(391158,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(implies(X2,not(X2)),X2),X1))),inference(spm,[status(thm)],[270,390932,theory(equality)])).
% cnf(396100,plain,(is_a_theorem(not(and(not(X1),X2)))|~is_a_theorem(implies(X2,X1))),inference(spm,[status(thm)],[263,386320,theory(equality)])).
% cnf(409547,plain,(is_a_theorem(not(and(implies(not(X1),X1),and(X2,not(X1)))))),inference(spm,[status(thm)],[522,2922,theory(equality)])).
% cnf(409606,plain,(is_a_theorem(not(and(or(X1,X1),and(X2,not(X1)))))),inference(rw,[status(thm)],[409547,268,theory(equality)])).
% cnf(486294,plain,(is_a_theorem(not(and(not(X1),not(X2))))|~is_a_theorem(or(X2,X1))),inference(spm,[status(thm)],[396100,268,theory(equality)])).
% cnf(487468,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X2,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[486294,260,theory(equality)]),268,theory(equality)])).
% cnf(488752,plain,(is_a_theorem(or(not(not(and(X1,X2))),implies(X2,not(X1))))),inference(spm,[status(thm)],[487468,40170,theory(equality)])).
% cnf(489070,plain,(is_a_theorem(or(implies(X1,X2),and(or(not(X3),X3),X1)))),inference(spm,[status(thm)],[487468,8504,theory(equality)])).
% cnf(520292,plain,(is_a_theorem(implies(X1,not(X2)))|~is_a_theorem(not(and(X2,X1)))),inference(spm,[status(thm)],[2852,488752,theory(equality)])).
% cnf(520944,plain,(is_a_theorem(implies(and(X1,not(X2)),not(or(X2,X2))))),inference(spm,[status(thm)],[520292,409606,theory(equality)])).
% cnf(521720,plain,(is_a_theorem(or(not(or(X1,X1)),not(and(X2,not(X1)))))),inference(spm,[status(thm)],[25646,520944,theory(equality)])).
% cnf(521742,plain,(is_a_theorem(or(not(or(X1,X1)),implies(X2,X1)))),inference(rw,[status(thm)],[521720,260,theory(equality)])).
% cnf(521760,plain,(is_a_theorem(not(and(not(implies(X1,X2)),or(X2,X2))))),inference(spm,[status(thm)],[358409,521742,theory(equality)])).
% cnf(521789,plain,(is_a_theorem(or(implies(X1,X2),and(not(X2),not(X2))))),inference(rw,[status(thm)],[521760,1128,theory(equality)])).
% cnf(522392,plain,(is_a_theorem(or(and(not(X1),not(X1)),implies(X2,X1)))),inference(spm,[status(thm)],[487468,521789,theory(equality)])).
% cnf(522418,plain,(is_a_theorem(implies(or(X1,X1),implies(X2,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[522392,271,theory(equality)]),268,theory(equality)])).
% cnf(545267,plain,(is_a_theorem(and(or(not(X1),X1),X2))|~is_a_theorem(X2)),inference(spm,[status(thm)],[4448,489070,theory(equality)])).
% cnf(613498,plain,(is_a_theorem(equiv(not(not(X1)),X1))|~is_a_theorem(implies(X1,not(not(X1))))),inference(spm,[status(thm)],[545267,284,theory(equality)])).
% cnf(613518,plain,(is_a_theorem(equiv(not(not(X1)),X1))|$false),inference(rw,[status(thm)],[613498,2833,theory(equality)])).
% cnf(613519,plain,(is_a_theorem(equiv(not(not(X1)),X1))),inference(cn,[status(thm)],[613518,theory(equality)])).
% cnf(613676,plain,(not(not(X1))=X1),inference(spm,[status(thm)],[251,613519,theory(equality)])).
% cnf(614666,plain,(not(and(X1,X2))=implies(X1,not(X2))),inference(spm,[status(thm)],[260,613676,theory(equality)])).
% cnf(631290,plain,(not(implies(X1,not(X2)))=and(X1,X2)),inference(spm,[status(thm)],[613676,614666,theory(equality)])).
% cnf(643417,plain,(not(implies(X1,X2))=and(X1,not(X2))),inference(spm,[status(thm)],[631290,613676,theory(equality)])).
% cnf(679907,plain,(is_a_theorem(implies(X1,and(implies(and(X2,X3),X2),X1)))),inference(spm,[status(thm)],[391158,11317,theory(equality)])).
% cnf(679955,plain,(is_a_theorem(and(implies(and(X1,X2),X1),implies(X3,and(X3,X3))))),inference(spm,[status(thm)],[359,679907,theory(equality)])).
% cnf(756635,plain,(is_a_theorem(equiv(and(X1,X1),X1))),inference(spm,[status(thm)],[679955,280,theory(equality)])).
% cnf(756646,plain,(and(X1,X1)=X1),inference(spm,[status(thm)],[251,756635,theory(equality)])).
% cnf(757597,plain,(not(X1)=not(implies(not(X1),X1))),inference(spm,[status(thm)],[643417,756646,theory(equality)])).
% cnf(759238,plain,(not(X1)=not(or(X1,X1))),inference(rw,[status(thm)],[757597,268,theory(equality)])).
% cnf(761863,plain,(not(not(X1))=or(X1,X1)),inference(spm,[status(thm)],[613676,759238,theory(equality)])).
% cnf(762722,plain,(X1=or(X1,X1)),inference(rw,[status(thm)],[761863,613676,theory(equality)])).
% cnf(764386,plain,(is_a_theorem(implies(X1,implies(X2,X1)))),inference(rw,[status(thm)],[522418,762722,theory(equality)])).
% cnf(769014,plain,(is_a_theorem(or(X1,implies(X2,not(X1))))),inference(spm,[status(thm)],[764386,268,theory(equality)])).
% cnf(776272,plain,(is_a_theorem(or(and(implies(X1,not(X2)),X3),implies(X3,X2)))),inference(spm,[status(thm)],[534,769014,theory(equality)])).
% cnf(777685,plain,(is_a_theorem(implies(and(not(implies(X1,not(X2))),X3),X2))),inference(spm,[status(thm)],[2856,776272,theory(equality)])).
% cnf(777704,plain,(is_a_theorem(implies(and(and(X1,X2),X3),X2))),inference(rw,[status(thm)],[777685,631290,theory(equality)])).
% cnf(777729,plain,(is_a_theorem(implies(and(X1,X2),X2))),inference(spm,[status(thm)],[777704,756646,theory(equality)])).
% cnf(777853,plain,($false),inference(rw,[status(thm)],[245,777729,theory(equality)])).
% cnf(777854,plain,($false),inference(cn,[status(thm)],[777853,theory(equality)])).
% cnf(777855,plain,($false),777854,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 23017
% # ...of these trivial : 4793
% # ...subsumed : 9602
% # ...remaining for further processing: 8622
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 145
% # Backward-rewritten : 6952
% # Generated clauses : 509132
% # ...of the previous two non-trivial : 290819
% # Contextual simplify-reflections : 119
% # Paramodulations : 509132
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1525
% # Positive orientable unit clauses: 1208
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 315
% # Current number of unprocessed clauses: 14605
% # ...number of literals in the above : 17702
% # Clause-clause subsumption calls (NU) : 160858
% # Rec. Clause-clause subsumption calls : 160858
% # Unit Clause-clause subsumption calls : 29691
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1163741
% # Indexed BW rewrite successes : 3252
% # Backwards rewriting index: 832 leaves, 4.47+/-11.017 terms/leaf
% # Paramod-from index: 93 leaves, 13.20+/-26.986 terms/leaf
% # Paramod-into index: 819 leaves, 4.47+/-11.034 terms/leaf
% # -------------------------------------------------
% # User time : 21.841 s
% # System time : 0.689 s
% # Total time : 22.530 s
% # Maximum resident set size: 0 pages
% PrfWatch: 31.27 CPU 31.56 WC
% FINAL PrfWatch: 31.27 CPU 31.56 WC
% SZS output end Solution for /tmp/SystemOnTPTP12276/LCL507+1.tptp
%
%------------------------------------------------------------------------------