TSTP Solution File: LCL463+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL463+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:31:05 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/SystemOnTPTP15302/LCL463+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15302/LCL463+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15302/LCL463+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 15434
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.01 WC
% PrfWatch: 3.93 CPU 4.02 WC
% PrfWatch: 5.93 CPU 6.03 WC
% PrfWatch: 7.92 CPU 8.03 WC
% PrfWatch: 9.92 CPU 10.04 WC
% PrfWatch: 11.91 CPU 12.05 WC
% PrfWatch: 13.91 CPU 14.05 WC
% PrfWatch: 15.90 CPU 16.06 WC
% PrfWatch: 17.89 CPU 18.07 WC
% PrfWatch: 19.88 CPU 20.07 WC
% PrfWatch: 21.87 CPU 22.08 WC
% PrfWatch: 23.86 CPU 24.09 WC
% PrfWatch: 25.86 CPU 26.09 WC
% PrfWatch: 27.68 CPU 28.10 WC
% PrfWatch: 29.53 CPU 30.11 WC
% PrfWatch: 31.18 CPU 32.11 WC
% PrfWatch: 33.17 CPU 34.12 WC
% PrfWatch: 35.16 CPU 36.13 WC
% PrfWatch: 37.15 CPU 38.13 WC
% PrfWatch: 39.15 CPU 40.14 WC
% PrfWatch: 41.12 CPU 42.14 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 43.11 CPU 44.15 WC
% PrfWatch: 45.10 CPU 46.16 WC
% PrfWatch: 47.09 CPU 48.16 WC
% PrfWatch: 49.09 CPU 50.17 WC
% PrfWatch: 51.08 CPU 52.18 WC
% PrfWatch: 53.08 CPU 54.18 WC
% PrfWatch: 55.07 CPU 56.19 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,(implies_1<=>![X1]:![X2]:is_a_theorem(implies(X1,implies(X2,X1)))),file('/tmp/SRASS.s.p', implies_1)).
% 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(8, axiom,op_implies_and,file('/tmp/SRASS.s.p', hilbert_op_implies_and)).
% fof(10, 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(13, 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(14, axiom,op_or,file('/tmp/SRASS.s.p', luka_op_or)).
% fof(29, axiom,(op_or=>![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_or)).
% fof(36, axiom,(cn2<=>![X4]:![X5]:is_a_theorem(implies(X4,implies(not(X4),X5)))),file('/tmp/SRASS.s.p', cn2)).
% fof(37, 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,implies_1,file('/tmp/SRASS.s.p', hilbert_implies_1)).
% fof(44, negated_conjecture,~(implies_1),inference(assume_negation,[status(cth)],[43])).
% fof(45, negated_conjecture,~(implies_1),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(46, plain,((~(implies_1)|![X1]:![X2]:is_a_theorem(implies(X1,implies(X2,X1))))&(?[X1]:?[X2]:~(is_a_theorem(implies(X1,implies(X2,X1))))|implies_1)),inference(fof_nnf,[status(thm)],[1])).
% fof(47, plain,((~(implies_1)|![X3]:![X4]:is_a_theorem(implies(X3,implies(X4,X3))))&(?[X5]:?[X6]:~(is_a_theorem(implies(X5,implies(X6,X5))))|implies_1)),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,((~(implies_1)|![X3]:![X4]:is_a_theorem(implies(X3,implies(X4,X3))))&(~(is_a_theorem(implies(esk1_0,implies(esk2_0,esk1_0))))|implies_1)),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X3]:![X4]:((is_a_theorem(implies(X3,implies(X4,X3)))|~(implies_1))&(~(is_a_theorem(implies(esk1_0,implies(esk2_0,esk1_0))))|implies_1)),inference(shift_quantors,[status(thm)],[48])).
% cnf(50,plain,(implies_1|~is_a_theorem(implies(esk1_0,implies(esk2_0,esk1_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(58,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[8])).
% fof(60, 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)],[10])).
% fof(61, 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)],[60])).
% fof(62, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(((is_a_theorem(esk3_0)&is_a_theorem(implies(esk3_0,esk4_0)))&~(is_a_theorem(esk4_0)))|modus_ponens)),inference(skolemize,[status(esa)],[61])).
% fof(63, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk3_0)&is_a_theorem(implies(esk3_0,esk4_0)))&~(is_a_theorem(esk4_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[62])).
% fof(64, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk3_0)|modus_ponens)&(is_a_theorem(implies(esk3_0,esk4_0))|modus_ponens))&(~(is_a_theorem(esk4_0))|modus_ponens))),inference(distribute,[status(thm)],[63])).
% cnf(68,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[64])).
% fof(81, 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)],[13])).
% fof(82, 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)],[81])).
% fof(83, plain,((~(cn1)|![X7]:![X8]:![X9]:is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9)))))&(~(is_a_theorem(implies(implies(esk10_0,esk11_0),implies(implies(esk11_0,esk12_0),implies(esk10_0,esk12_0)))))|cn1)),inference(skolemize,[status(esa)],[82])).
% fof(84, plain,![X7]:![X8]:![X9]:((is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9))))|~(cn1))&(~(is_a_theorem(implies(implies(esk10_0,esk11_0),implies(implies(esk11_0,esk12_0),implies(esk10_0,esk12_0)))))|cn1)),inference(shift_quantors,[status(thm)],[83])).
% cnf(86,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~cn1),inference(split_conjunct,[status(thm)],[84])).
% cnf(87,plain,(op_or),inference(split_conjunct,[status(thm)],[14])).
% fof(167, plain,(~(op_or)|![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[29])).
% fof(168, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[167])).
% fof(169, plain,![X3]:![X4]:(or(X3,X4)=not(and(not(X3),not(X4)))|~(op_or)),inference(shift_quantors,[status(thm)],[168])).
% cnf(170,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[169])).
% fof(207, 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)],[36])).
% fof(208, 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)],[207])).
% fof(209, plain,((~(cn2)|![X6]:![X7]:is_a_theorem(implies(X6,implies(not(X6),X7))))&(~(is_a_theorem(implies(esk50_0,implies(not(esk50_0),esk51_0))))|cn2)),inference(skolemize,[status(esa)],[208])).
% fof(210, plain,![X6]:![X7]:((is_a_theorem(implies(X6,implies(not(X6),X7)))|~(cn2))&(~(is_a_theorem(implies(esk50_0,implies(not(esk50_0),esk51_0))))|cn2)),inference(shift_quantors,[status(thm)],[209])).
% cnf(212,plain,(is_a_theorem(implies(X1,implies(not(X1),X2)))|~cn2),inference(split_conjunct,[status(thm)],[210])).
% fof(213, 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)],[37])).
% fof(214, 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)],[213])).
% fof(215, plain,((~(cn3)|![X5]:is_a_theorem(implies(implies(not(X5),X5),X5)))&(~(is_a_theorem(implies(implies(not(esk52_0),esk52_0),esk52_0)))|cn3)),inference(skolemize,[status(esa)],[214])).
% fof(216, plain,![X5]:((is_a_theorem(implies(implies(not(X5),X5),X5))|~(cn3))&(~(is_a_theorem(implies(implies(not(esk52_0),esk52_0),esk52_0)))|cn3)),inference(shift_quantors,[status(thm)],[215])).
% cnf(218,plain,(is_a_theorem(implies(implies(not(X1),X1),X1))|~cn3),inference(split_conjunct,[status(thm)],[216])).
% fof(225, plain,(~(op_implies_and)|![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),inference(fof_nnf,[status(thm)],[39])).
% fof(226, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(variable_rename,[status(thm)],[225])).
% fof(227, plain,![X3]:![X4]:(implies(X3,X4)=not(and(X3,not(X4)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[226])).
% cnf(228,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[227])).
% cnf(238,negated_conjecture,(~implies_1),inference(split_conjunct,[status(thm)],[45])).
% cnf(244,plain,(~is_a_theorem(implies(esk1_0,implies(esk2_0,esk1_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)],[228,58,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)],[68,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)],[212,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)],[218,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)],[170,252,theory(equality)])).
% cnf(266,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[265,87,theory(equality)])).
% cnf(267,plain,(implies(not(X1),X2)=or(X1,X2)),inference(cn,[status(thm)],[266,theory(equality)])).
% cnf(268,plain,(is_a_theorem(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)],[86,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(311,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)],[311,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(409,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(410,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(1237,plain,(is_a_theorem(implies(implies(X1,X2),X3))|~is_a_theorem(implies(implies(or(X1,X1),X2),X3))),inference(spm,[status(thm)],[255,410,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(1891,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,1891,theory(equality)])).
% cnf(1912,plain,(is_a_theorem(implies(X1,or(X2,or(X1,X3))))),inference(spm,[status(thm)],[1891,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(2783,plain,(is_a_theorem(implies(X1,implies(implies(or(X1,X2),X3),or(X4,X3))))),inference(spm,[status(thm)],[2405,287,theory(equality)])).
% cnf(2938,plain,(is_a_theorem(implies(implies(or(implies(or(X1,X1),X1),X2),X3),or(X4,X3)))),inference(spm,[status(thm)],[333,2783,theory(equality)])).
% cnf(5276,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,2938,theory(equality)])).
% cnf(9408,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,409,theory(equality)])).
% cnf(867763,plain,(is_a_theorem(implies(implies(or(implies(or(X1,X1),X1),X2),X3),X3))),inference(spm,[status(thm)],[333,5276,theory(equality)])).
% cnf(867891,plain,(is_a_theorem(implies(implies(implies(or(X1,X1),X1),X2),X2))),inference(spm,[status(thm)],[1237,867763,theory(equality)])).
% cnf(1180069,plain,(is_a_theorem(implies(implies(X1,or(X2,X2)),implies(X1,X2)))),inference(spm,[status(thm)],[9408,867891,theory(equality)])).
% cnf(1181929,plain,(is_a_theorem(implies(X1,implies(X2,X1)))),inference(spm,[status(thm)],[2045,1180069,theory(equality)])).
% cnf(1182165,plain,($false),inference(rw,[status(thm)],[244,1181929,theory(equality)])).
% cnf(1182166,plain,($false),inference(cn,[status(thm)],[1182165,theory(equality)])).
% cnf(1182167,plain,($false),1182166,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 36370
% # ...of these trivial : 23499
% # ...subsumed : 4364
% # ...remaining for further processing: 8507
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 16
% # Backward-rewritten : 108
% # Generated clauses : 760509
% # ...of the previous two non-trivial : 408171
% # Contextual simplify-reflections : 177
% # Paramodulations : 760509
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 8383
% # Positive orientable unit clauses: 7002
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 1378
% # Current number of unprocessed clauses: 369570
% # ...number of literals in the above : 443532
% # Clause-clause subsumption calls (NU) : 133984
% # Rec. Clause-clause subsumption calls : 133984
% # Unit Clause-clause subsumption calls : 8434
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2782066
% # Indexed BW rewrite successes : 108
% # Backwards rewriting index: 1385 leaves, 16.24+/-65.696 terms/leaf
% # Paramod-from index: 99 leaves, 71.65+/-186.123 terms/leaf
% # Paramod-into index: 1323 leaves, 16.53+/-66.603 terms/leaf
% # -------------------------------------------------
% # User time : 41.667 s
% # System time : 1.120 s
% # Total time : 42.786 s
% # Maximum resident set size: 0 pages
% PrfWatch: 55.25 CPU 56.38 WC
% FINAL PrfWatch: 55.25 CPU 56.38 WC
% SZS output end Solution for /tmp/SystemOnTPTP15302/LCL463+1.tptp
%
%------------------------------------------------------------------------------