%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL470+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 : art01.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:30:52 EST 2010
% Result : Theorem 56.49s
% Output : Solution 56.49s
% 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/SystemOnTPTP8486/LCL470+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8486/LCL470+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8486/LCL470+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 8582
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.03 WC
% PrfWatch: 3.92 CPU 4.04 WC
% PrfWatch: 5.91 CPU 6.04 WC
% PrfWatch: 7.88 CPU 8.05 WC
% PrfWatch: 9.88 CPU 10.06 WC
% PrfWatch: 11.86 CPU 12.07 WC
% PrfWatch: 13.85 CPU 14.07 WC
% PrfWatch: 15.85 CPU 16.08 WC
% PrfWatch: 17.83 CPU 18.09 WC
% PrfWatch: 19.82 CPU 20.09 WC
% PrfWatch: 21.81 CPU 22.10 WC
% PrfWatch: 23.80 CPU 24.11 WC
% PrfWatch: 25.79 CPU 26.11 WC
% PrfWatch: 27.78 CPU 28.12 WC
% PrfWatch: 29.77 CPU 30.13 WC
% PrfWatch: 31.74 CPU 32.14 WC
% PrfWatch: 33.73 CPU 34.14 WC
% PrfWatch: 35.53 CPU 36.16 WC
% PrfWatch: 37.11 CPU 38.17 WC
% PrfWatch: 38.96 CPU 40.18 WC
% PrfWatch: 40.95 CPU 42.18 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 42.92 CPU 44.19 WC
% PrfWatch: 44.91 CPU 46.20 WC
% PrfWatch: 46.90 CPU 48.20 WC
% PrfWatch: 48.50 CPU 50.21 WC
% PrfWatch: 50.15 CPU 52.22 WC
% PrfWatch: 52.14 CPU 54.23 WC
% PrfWatch: 54.13 CPU 56.23 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,(or_2<=>![X1]:![X2]:is_a_theorem(implies(X2,or(X1,X2)))),file('/tmp/SRASS.s.p', or_2)).
% fof(2, axiom,modus_ponens,file('/tmp/SRASS.s.p', luka_modus_ponens)).
% fof(3, axiom,cn1,file('/tmp/SRASS.s.p', luka_cn1)).
% fof(4, axiom,cn2,file('/tmp/SRASS.s.p', luka_cn2)).
% fof(5, axiom,cn3,file('/tmp/SRASS.s.p', luka_cn3)).
% fof(13, axiom,op_or,file('/tmp/SRASS.s.p', luka_op_or)).
% fof(17, axiom,op_implies_and,file('/tmp/SRASS.s.p', hilbert_op_implies_and)).
% fof(19, 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(23, axiom,(cn1<=>![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6))))),file('/tmp/SRASS.s.p', cn1)).
% fof(24, axiom,(op_or=>![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_or)).
% fof(35, axiom,(cn2<=>![X4]:![X5]:is_a_theorem(implies(X4,implies(not(X4),X5)))),file('/tmp/SRASS.s.p', cn2)).
% fof(36, axiom,(cn3<=>![X4]:is_a_theorem(implies(implies(not(X4),X4),X4))),file('/tmp/SRASS.s.p', cn3)).
% fof(39, axiom,(op_implies_and=>![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(43, conjecture,or_2,file('/tmp/SRASS.s.p', hilbert_or_2)).
% fof(44, negated_conjecture,~(or_2),inference(assume_negation,[status(cth)],[43])).
% fof(45, negated_conjecture,~(or_2),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(46, plain,((~(or_2)|![X1]:![X2]:is_a_theorem(implies(X2,or(X1,X2))))&(?[X1]:?[X2]:~(is_a_theorem(implies(X2,or(X1,X2))))|or_2)),inference(fof_nnf,[status(thm)],[1])).
% fof(47, plain,((~(or_2)|![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4))))&(?[X5]:?[X6]:~(is_a_theorem(implies(X6,or(X5,X6))))|or_2)),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,((~(or_2)|![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4))))&(~(is_a_theorem(implies(esk2_0,or(esk1_0,esk2_0))))|or_2)),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X3]:![X4]:((is_a_theorem(implies(X4,or(X3,X4)))|~(or_2))&(~(is_a_theorem(implies(esk2_0,or(esk1_0,esk2_0))))|or_2)),inference(shift_quantors,[status(thm)],[48])).
% cnf(50,plain,(or_2|~is_a_theorem(implies(esk2_0,or(esk1_0,esk2_0)))),inference(split_conjunct,[status(thm)],[49])).
% cnf(52,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[2])).
% cnf(53,plain,(cn1),inference(split_conjunct,[status(thm)],[3])).
% cnf(54,plain,(cn2),inference(split_conjunct,[status(thm)],[4])).
% cnf(55,plain,(cn3),inference(split_conjunct,[status(thm)],[5])).
% cnf(98,plain,(op_or),inference(split_conjunct,[status(thm)],[13])).
% cnf(102,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[17])).
% fof(104, 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)],[19])).
% fof(105, 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)],[104])).
% fof(106, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(((is_a_theorem(esk19_0)&is_a_theorem(implies(esk19_0,esk20_0)))&~(is_a_theorem(esk20_0)))|modus_ponens)),inference(skolemize,[status(esa)],[105])).
% fof(107, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk19_0)&is_a_theorem(implies(esk19_0,esk20_0)))&~(is_a_theorem(esk20_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[106])).
% fof(108, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk19_0)|modus_ponens)&(is_a_theorem(implies(esk19_0,esk20_0))|modus_ponens))&(~(is_a_theorem(esk20_0))|modus_ponens))),inference(distribute,[status(thm)],[107])).
% cnf(112,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[108])).
% fof(131, plain,((~(cn1)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))))&(?[X4]:?[X5]:?[X6]:~(is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))))|cn1)),inference(fof_nnf,[status(thm)],[23])).
% fof(132, plain,((~(cn1)|![X7]:![X8]:![X9]:is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9)))))&(?[X10]:?[X11]:?[X12]:~(is_a_theorem(implies(implies(X10,X11),implies(implies(X11,X12),implies(X10,X12)))))|cn1)),inference(variable_rename,[status(thm)],[131])).
% fof(133, plain,((~(cn1)|![X7]:![X8]:![X9]:is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9)))))&(~(is_a_theorem(implies(implies(esk28_0,esk29_0),implies(implies(esk29_0,esk30_0),implies(esk28_0,esk30_0)))))|cn1)),inference(skolemize,[status(esa)],[132])).
% fof(134, plain,![X7]:![X8]:![X9]:((is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9))))|~(cn1))&(~(is_a_theorem(implies(implies(esk28_0,esk29_0),implies(implies(esk29_0,esk30_0),implies(esk28_0,esk30_0)))))|cn1)),inference(shift_quantors,[status(thm)],[133])).
% cnf(136,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~cn1),inference(split_conjunct,[status(thm)],[134])).
% fof(137, plain,(~(op_or)|![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[24])).
% fof(138, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[137])).
% fof(139, plain,![X3]:![X4]:(or(X3,X4)=not(and(not(X3),not(X4)))|~(op_or)),inference(shift_quantors,[status(thm)],[138])).
% cnf(140,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[139])).
% fof(199, plain,((~(cn2)|![X4]:![X5]:is_a_theorem(implies(X4,implies(not(X4),X5))))&(?[X4]:?[X5]:~(is_a_theorem(implies(X4,implies(not(X4),X5))))|cn2)),inference(fof_nnf,[status(thm)],[35])).
% fof(200, plain,((~(cn2)|![X6]:![X7]:is_a_theorem(implies(X6,implies(not(X6),X7))))&(?[X8]:?[X9]:~(is_a_theorem(implies(X8,implies(not(X8),X9))))|cn2)),inference(variable_rename,[status(thm)],[199])).
% fof(201, plain,((~(cn2)|![X6]:![X7]:is_a_theorem(implies(X6,implies(not(X6),X7))))&(~(is_a_theorem(implies(esk48_0,implies(not(esk48_0),esk49_0))))|cn2)),inference(skolemize,[status(esa)],[200])).
% fof(202, plain,![X6]:![X7]:((is_a_theorem(implies(X6,implies(not(X6),X7)))|~(cn2))&(~(is_a_theorem(implies(esk48_0,implies(not(esk48_0),esk49_0))))|cn2)),inference(shift_quantors,[status(thm)],[201])).
% cnf(204,plain,(is_a_theorem(implies(X1,implies(not(X1),X2)))|~cn2),inference(split_conjunct,[status(thm)],[202])).
% fof(205, plain,((~(cn3)|![X4]:is_a_theorem(implies(implies(not(X4),X4),X4)))&(?[X4]:~(is_a_theorem(implies(implies(not(X4),X4),X4)))|cn3)),inference(fof_nnf,[status(thm)],[36])).
% fof(206, plain,((~(cn3)|![X5]:is_a_theorem(implies(implies(not(X5),X5),X5)))&(?[X6]:~(is_a_theorem(implies(implies(not(X6),X6),X6)))|cn3)),inference(variable_rename,[status(thm)],[205])).
% fof(207, plain,((~(cn3)|![X5]:is_a_theorem(implies(implies(not(X5),X5),X5)))&(~(is_a_theorem(implies(implies(not(esk50_0),esk50_0),esk50_0)))|cn3)),inference(skolemize,[status(esa)],[206])).
% fof(208, plain,![X5]:((is_a_theorem(implies(implies(not(X5),X5),X5))|~(cn3))&(~(is_a_theorem(implies(implies(not(esk50_0),esk50_0),esk50_0)))|cn3)),inference(shift_quantors,[status(thm)],[207])).
% cnf(210,plain,(is_a_theorem(implies(implies(not(X1),X1),X1))|~cn3),inference(split_conjunct,[status(thm)],[208])).
% fof(221, plain,(~(op_implies_and)|![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),inference(fof_nnf,[status(thm)],[39])).
% fof(222, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(variable_rename,[status(thm)],[221])).
% fof(223, plain,![X3]:![X4]:(implies(X3,X4)=not(and(X3,not(X4)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[222])).
% cnf(224,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[223])).
% cnf(238,negated_conjecture,(~or_2),inference(split_conjunct,[status(thm)],[45])).
% cnf(244,plain,(~is_a_theorem(implies(esk2_0,or(esk1_0,esk2_0)))),inference(sr,[status(thm)],[50,238,theory(equality)])).
% cnf(251,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[224,102,theory(equality)])).
% cnf(252,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[251,theory(equality)])).
% cnf(254,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[112,52,theory(equality)])).
% cnf(255,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[254,theory(equality)])).
% cnf(256,plain,(is_a_theorem(implies(X1,implies(not(X1),X2)))|$false),inference(rw,[status(thm)],[204,54,theory(equality)])).
% cnf(257,plain,(is_a_theorem(implies(X1,implies(not(X1),X2)))),inference(cn,[status(thm)],[256,theory(equality)])).
% cnf(260,plain,(is_a_theorem(implies(implies(not(X1),X1),X1))|$false),inference(rw,[status(thm)],[210,55,theory(equality)])).
% cnf(261,plain,(is_a_theorem(implies(implies(not(X1),X1),X1))),inference(cn,[status(thm)],[260,theory(equality)])).
% cnf(265,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[140,252,theory(equality)])).
% cnf(266,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[265,98,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(X1)|~is_a_theorem(or(X2,X1))|~is_a_theorem(not(X2))),inference(spm,[status(thm)],[255,267,theory(equality)])).
% cnf(269,plain,(implies(implies(X1,X2),X3)=or(and(X1,not(X2)),X3)),inference(spm,[status(thm)],[267,252,theory(equality)])).
% cnf(270,plain,(is_a_theorem(implies(or(X1,X1),X1))),inference(rw,[status(thm)],[261,267,theory(equality)])).
% cnf(271,plain,(is_a_theorem(implies(X1,or(X1,X2)))),inference(rw,[status(thm)],[257,267,theory(equality)])).
% cnf(279,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|$false),inference(rw,[status(thm)],[136,53,theory(equality)])).
% cnf(280,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))),inference(cn,[status(thm)],[279,theory(equality)])).
% cnf(281,plain,(is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))|~is_a_theorem(implies(X3,X1))),inference(spm,[status(thm)],[255,280,theory(equality)])).
% cnf(282,plain,(is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X3),or(X1,X3))))),inference(spm,[status(thm)],[280,267,theory(equality)])).
% cnf(283,plain,(is_a_theorem(implies(implies(X1,not(X2)),implies(or(X2,X3),implies(X1,X3))))),inference(spm,[status(thm)],[280,267,theory(equality)])).
% cnf(287,plain,(is_a_theorem(implies(or(X1,X2),implies(implies(X2,X3),or(X1,X3))))),inference(rw,[status(thm)],[282,267,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)],[268,252,theory(equality)])).
% cnf(312,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(or(X2,X2),not(X2)),X1))),inference(spm,[status(thm)],[306,270,theory(equality)])).
% cnf(333,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(or(X2,X2),X2),X1))),inference(rw,[status(thm)],[312,269,theory(equality)])).
% cnf(338,plain,(is_a_theorem(implies(implies(X1,X2),implies(or(X1,X1),X2)))),inference(spm,[status(thm)],[333,280,theory(equality)])).
% cnf(404,plain,(is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4)))),inference(spm,[status(thm)],[281,280,theory(equality)])).
% cnf(405,plain,(is_a_theorem(implies(implies(implies(or(X1,X1),X2),X3),implies(implies(X1,X2),X3)))),inference(spm,[status(thm)],[281,338,theory(equality)])).
% cnf(411,plain,(is_a_theorem(implies(implies(or(X1,X2),X3),implies(X1,X3)))),inference(spm,[status(thm)],[281,271,theory(equality)])).
% cnf(414,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(or(X1,X3),X2))),inference(spm,[status(thm)],[255,411,theory(equality)])).
% cnf(495,plain,(is_a_theorem(implies(X1,implies(implies(X2,X3),or(X1,X3))))),inference(spm,[status(thm)],[414,287,theory(equality)])).
% cnf(504,plain,(is_a_theorem(implies(implies(implies(implies(X1,X2),or(X3,X2)),X4),implies(X3,X4)))),inference(spm,[status(thm)],[281,495,theory(equality)])).
% cnf(579,plain,(is_a_theorem(implies(or(X1,X2),implies(or(not(X1),not(X1)),X2)))),inference(spm,[status(thm)],[333,283,theory(equality)])).
% cnf(592,plain,(is_a_theorem(implies(X1,implies(or(not(X1),not(X1)),X2)))),inference(spm,[status(thm)],[414,579,theory(equality)])).
% cnf(604,plain,(is_a_theorem(implies(implies(implies(or(not(X1),not(X1)),X2),X3),implies(X1,X3)))),inference(spm,[status(thm)],[281,592,theory(equality)])).
% cnf(1218,plain,(is_a_theorem(implies(implies(X1,X2),X3))|~is_a_theorem(implies(implies(or(X1,X1),X2),X3))),inference(spm,[status(thm)],[255,405,theory(equality)])).
% cnf(1340,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(implies(implies(X3,X4),or(X1,X4)),X2))),inference(spm,[status(thm)],[255,504,theory(equality)])).
% cnf(1886,plain,(is_a_theorem(implies(X1,implies(X2,or(X1,X3))))),inference(spm,[status(thm)],[1340,604,theory(equality)])).
% cnf(1908,plain,(is_a_theorem(implies(implies(implies(X1,or(X2,X3)),X4),implies(X2,X4)))),inference(spm,[status(thm)],[281,1886,theory(equality)])).
% cnf(1912,plain,(is_a_theorem(implies(X1,or(X2,or(X1,X3))))),inference(spm,[status(thm)],[1886,267,theory(equality)])).
% cnf(2045,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(implies(X3,or(X1,X4)),X2))),inference(spm,[status(thm)],[255,1908,theory(equality)])).
% cnf(2124,plain,(is_a_theorem(implies(implies(or(X1,or(X2,X3)),X4),implies(X2,X4)))),inference(spm,[status(thm)],[281,1912,theory(equality)])).
% cnf(2405,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(or(X3,or(X1,X4)),X2))),inference(spm,[status(thm)],[255,2124,theory(equality)])).
% cnf(2774,plain,(is_a_theorem(implies(X1,implies(implies(or(X1,X2),X3),or(X4,X3))))),inference(spm,[status(thm)],[2405,287,theory(equality)])).
% cnf(2933,plain,(is_a_theorem(implies(implies(or(implies(or(X1,X1),X1),X2),X3),or(X4,X3)))),inference(spm,[status(thm)],[333,2774,theory(equality)])).
% cnf(5248,plain,(is_a_theorem(implies(implies(or(X1,X2),X3),implies(implies(or(implies(or(X4,X4),X4),X5),X2),X3)))),inference(spm,[status(thm)],[281,2933,theory(equality)])).
% cnf(8950,plain,(is_a_theorem(implies(implies(X1,X2),X3))|~is_a_theorem(implies(implies(implies(X2,X4),implies(X1,X4)),X3))),inference(spm,[status(thm)],[255,404,theory(equality)])).
% cnf(872512,plain,(is_a_theorem(implies(implies(or(implies(or(X1,X1),X1),X2),X3),X3))),inference(spm,[status(thm)],[333,5248,theory(equality)])).
% cnf(872640,plain,(is_a_theorem(implies(implies(implies(or(X1,X1),X1),X2),X2))),inference(spm,[status(thm)],[1218,872512,theory(equality)])).
% cnf(1156856,plain,(is_a_theorem(implies(implies(X1,or(X2,X2)),implies(X1,X2)))),inference(spm,[status(thm)],[8950,872640,theory(equality)])).
% cnf(1158700,plain,(is_a_theorem(implies(X1,implies(X2,X1)))),inference(spm,[status(thm)],[2045,1156856,theory(equality)])).
% cnf(1158918,plain,(is_a_theorem(implies(X1,or(X2,X1)))),inference(spm,[status(thm)],[1158700,267,theory(equality)])).
% cnf(1159454,plain,($false),inference(rw,[status(thm)],[244,1158918,theory(equality)])).
% cnf(1159455,plain,($false),inference(cn,[status(thm)],[1159454,theory(equality)])).
% cnf(1159456,plain,($false),1159455,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 34990
% # ...of these trivial : 22243
% # ...subsumed : 4357
% # ...remaining for further processing: 8390
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 134
% # Generated clauses : 744485
% # ...of the previous two non-trivial : 396352
% # Contextual simplify-reflections : 177
% # Paramodulations : 744485
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 8246
% # Positive orientable unit clauses: 6885
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 1357
% # Current number of unprocessed clauses: 358593
% # ...number of literals in the above : 431271
% # Clause-clause subsumption calls (NU) : 130780
% # Rec. Clause-clause subsumption calls : 130780
% # Unit Clause-clause subsumption calls : 10170
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2705018
% # Indexed BW rewrite successes : 133
% # Backwards rewriting index: 1369 leaves, 16.16+/-65.244 terms/leaf
% # Paramod-from index: 100 leaves, 69.76+/-182.724 terms/leaf
% # Paramod-into index: 1306 leaves, 16.46+/-66.196 terms/leaf
% # -------------------------------------------------
% # User time : 41.464 s
% # System time : 0.999 s
% # Total time : 42.463 s
% # Maximum resident set size: 0 pages
% PrfWatch: 55.28 CPU 57.39 WC
% FINAL PrfWatch: 55.28 CPU 57.39 WC
% SZS output end Solution for /tmp/SystemOnTPTP8486/LCL470+1.tptp
%
%------------------------------------------------------------------------------