%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : LCL457+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 : art06.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:25:13 EST 2010

% Result   : Theorem 121.96s
% Output   : Solution 122.69s
% 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/SystemOnTPTP24499/LCL457+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% not found
% Adding ~C to TBU       ... ~principia_r4:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT   ... yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... r4: CSA axiom r4 found
% Looking for CSA axiom ... hilbert_modus_ponens:
%  CSA axiom hilbert_modus_ponens found
% Looking for CSA axiom ... hilbert_modus_tollens: CSA axiom hilbert_modus_tollens found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... hilbert_implies_1:
%  CSA axiom hilbert_implies_1 found
% Looking for CSA axiom ... hilbert_implies_2:
%  CSA axiom hilbert_implies_2 found
% Looking for CSA axiom ... hilbert_implies_3:
%  CSA axiom hilbert_implies_3 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... hilbert_and_1:
%  CSA axiom hilbert_and_1 found
% Looking for CSA axiom ... hilbert_and_2:
%  CSA axiom hilbert_and_2 found
% Looking for CSA axiom ... hilbert_and_3:
%  CSA axiom hilbert_and_3 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... hilbert_or_1:
%  CSA axiom hilbert_or_1 found
% Looking for CSA axiom ... hilbert_or_2:
%  CSA axiom hilbert_or_2 found
% Looking for CSA axiom ... hilbert_or_3:
%  CSA axiom hilbert_or_3 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... hilbert_equivalence_1: CSA axiom hilbert_equivalence_1 found
% Looking for CSA axiom ... hilbert_equivalence_2:
%  CSA axiom hilbert_equivalence_2 found
% Looking for CSA axiom ... hilbert_equivalence_3:
%  CSA axiom hilbert_equivalence_3 found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... principia_op_implies_or:
%  CSA axiom principia_op_implies_or found
% Looking for CSA axiom ... or_1:
%  CSA axiom or_1 found
% Looking for CSA axiom ... or_2:
%  CSA axiom or_2 found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... or_3:
%  CSA axiom or_3 found
% Looking for CSA axiom ... r1:
%  CSA axiom r1 found
% Looking for CSA axiom ... r2: CSA axiom r2 found
% ---- Iteration 8 (21 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... r3:
%  CSA axiom r3 found
% Looking for CSA axiom ... r5:
%  CSA axiom r5 found
% Looking for CSA axiom ... modus_ponens:
%  CSA axiom modus_ponens found
% ---- Iteration 9 (24 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... implies_1:
%  CSA axiom implies_1 found
% Looking for CSA axiom ... implies_2:
%  CSA axiom implies_2 found
% Looking for CSA axiom ... implies_3:
%  CSA axiom implies_3 found
% ---- Iteration 10 (27 axioms selected)
% Looking for TBU SAT   ... 
% no
% Looking for TBU UNS   ... 
% yes - theorem proved
% ---- Selection completed
% Selected axioms are   ... :implies_3:implies_2:implies_1:modus_ponens:r5:r3:r2:r1:or_3:or_2:or_1:principia_op_implies_or:hilbert_equivalence_3:hilbert_equivalence_2:hilbert_equivalence_1:hilbert_or_3:hilbert_or_2:hilbert_or_1:hilbert_and_3:hilbert_and_2:hilbert_and_1:hilbert_implies_3:hilbert_implies_2:hilbert_implies_1:hilbert_modus_tollens:hilbert_modus_ponens:r4 (27)
% Unselected axioms are ... :cn1:hilbert_op_or:hilbert_op_implies_and:hilbert_op_equiv:substitution_of_equivalents:principia_op_and:principia_op_equiv:op_or:op_and:and_1:and_2:and_3:modus_tollens:equivalence_1:equivalence_2:equivalence_3:kn1:kn2:cn2:cn3:op_implies_or:substitution_of_equivalents:kn3:op_implies_and:op_equiv (25)
% SZS status THM for /tmp/SystemOnTPTP24499/LCL457+1.tptp
% Looking for THM       ... 
% found
% SZS output start Solution for /tmp/SystemOnTPTP24499/LCL457+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC  time limit is 1200s
% TreeLimitedRun: PID is 28519
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(implies_3<=>![X1]:![X2]:![X3]:is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))),file('/tmp/SRASS.s.p', implies_3)).
% fof(4, 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(9, axiom,(or_3<=>![X1]:![X2]:![X3]:is_a_theorem(implies(implies(X1,X3),implies(implies(X2,X3),implies(or(X1,X2),X3))))),file('/tmp/SRASS.s.p', or_3)).
% fof(10, axiom,(or_2<=>![X1]:![X2]:is_a_theorem(implies(X2,or(X1,X2)))),file('/tmp/SRASS.s.p', or_2)).
% fof(11, axiom,(or_1<=>![X1]:![X2]:is_a_theorem(implies(X1,or(X1,X2)))),file('/tmp/SRASS.s.p', or_1)).
% fof(16, axiom,or_3,file('/tmp/SRASS.s.p', hilbert_or_3)).
% fof(17, axiom,or_2,file('/tmp/SRASS.s.p', hilbert_or_2)).
% fof(18, axiom,or_1,file('/tmp/SRASS.s.p', hilbert_or_1)).
% fof(22, axiom,implies_3,file('/tmp/SRASS.s.p', hilbert_implies_3)).
% fof(26, axiom,modus_ponens,file('/tmp/SRASS.s.p', hilbert_modus_ponens)).
% fof(27, axiom,(r4<=>![X4]:![X5]:![X6]:is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6))))),file('/tmp/SRASS.s.p', r4)).
% fof(28, conjecture,r4,file('/tmp/SRASS.s.p', principia_r4)).
% fof(29, negated_conjecture,~(r4),inference(assume_negation,[status(cth)],[28])).
% fof(30, negated_conjecture,~(r4),inference(fof_simplification,[status(thm)],[29,theory(equality)])).
% fof(31, plain,((~(implies_3)|![X1]:![X2]:![X3]:is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))&(?[X1]:?[X2]:?[X3]:~(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))|implies_3)),inference(fof_nnf,[status(thm)],[1])).
% fof(32, plain,((~(implies_3)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))))&(?[X7]:?[X8]:?[X9]:~(is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9)))))|implies_3)),inference(variable_rename,[status(thm)],[31])).
% fof(33, plain,((~(implies_3)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))))&(~(is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))))|implies_3)),inference(skolemize,[status(esa)],[32])).
% fof(34, plain,![X4]:![X5]:![X6]:((is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6))))|~(implies_3))&(~(is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))))|implies_3)),inference(shift_quantors,[status(thm)],[33])).
% cnf(36,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~implies_3),inference(split_conjunct,[status(thm)],[34])).
% fof(49, 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)],[4])).
% fof(50, 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)],[49])).
% fof(51, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(((is_a_theorem(esk8_0)&is_a_theorem(implies(esk8_0,esk9_0)))&~(is_a_theorem(esk9_0)))|modus_ponens)),inference(skolemize,[status(esa)],[50])).
% fof(52, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk8_0)&is_a_theorem(implies(esk8_0,esk9_0)))&~(is_a_theorem(esk9_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[51])).
% fof(53, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk8_0)|modus_ponens)&(is_a_theorem(implies(esk8_0,esk9_0))|modus_ponens))&(~(is_a_theorem(esk9_0))|modus_ponens))),inference(distribute,[status(thm)],[52])).
% cnf(57,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[53])).
% fof(82, plain,((~(or_3)|![X1]:![X2]:![X3]:is_a_theorem(implies(implies(X1,X3),implies(implies(X2,X3),implies(or(X1,X2),X3)))))&(?[X1]:?[X2]:?[X3]:~(is_a_theorem(implies(implies(X1,X3),implies(implies(X2,X3),implies(or(X1,X2),X3)))))|or_3)),inference(fof_nnf,[status(thm)],[9])).
% fof(83, plain,((~(or_3)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X6),implies(implies(X5,X6),implies(or(X4,X5),X6)))))&(?[X7]:?[X8]:?[X9]:~(is_a_theorem(implies(implies(X7,X9),implies(implies(X8,X9),implies(or(X7,X8),X9)))))|or_3)),inference(variable_rename,[status(thm)],[82])).
% fof(84, plain,((~(or_3)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X6),implies(implies(X5,X6),implies(or(X4,X5),X6)))))&(~(is_a_theorem(implies(implies(esk18_0,esk20_0),implies(implies(esk19_0,esk20_0),implies(or(esk18_0,esk19_0),esk20_0)))))|or_3)),inference(skolemize,[status(esa)],[83])).
% fof(85, plain,![X4]:![X5]:![X6]:((is_a_theorem(implies(implies(X4,X6),implies(implies(X5,X6),implies(or(X4,X5),X6))))|~(or_3))&(~(is_a_theorem(implies(implies(esk18_0,esk20_0),implies(implies(esk19_0,esk20_0),implies(or(esk18_0,esk19_0),esk20_0)))))|or_3)),inference(shift_quantors,[status(thm)],[84])).
% cnf(87,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2))))|~or_3),inference(split_conjunct,[status(thm)],[85])).
% fof(88, 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)],[10])).
% fof(89, 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)],[88])).
% fof(90, plain,((~(or_2)|![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4))))&(~(is_a_theorem(implies(esk22_0,or(esk21_0,esk22_0))))|or_2)),inference(skolemize,[status(esa)],[89])).
% fof(91, plain,![X3]:![X4]:((is_a_theorem(implies(X4,or(X3,X4)))|~(or_2))&(~(is_a_theorem(implies(esk22_0,or(esk21_0,esk22_0))))|or_2)),inference(shift_quantors,[status(thm)],[90])).
% cnf(93,plain,(is_a_theorem(implies(X1,or(X2,X1)))|~or_2),inference(split_conjunct,[status(thm)],[91])).
% fof(94, plain,((~(or_1)|![X1]:![X2]:is_a_theorem(implies(X1,or(X1,X2))))&(?[X1]:?[X2]:~(is_a_theorem(implies(X1,or(X1,X2))))|or_1)),inference(fof_nnf,[status(thm)],[11])).
% fof(95, plain,((~(or_1)|![X3]:![X4]:is_a_theorem(implies(X3,or(X3,X4))))&(?[X5]:?[X6]:~(is_a_theorem(implies(X5,or(X5,X6))))|or_1)),inference(variable_rename,[status(thm)],[94])).
% fof(96, plain,((~(or_1)|![X3]:![X4]:is_a_theorem(implies(X3,or(X3,X4))))&(~(is_a_theorem(implies(esk23_0,or(esk23_0,esk24_0))))|or_1)),inference(skolemize,[status(esa)],[95])).
% fof(97, plain,![X3]:![X4]:((is_a_theorem(implies(X3,or(X3,X4)))|~(or_1))&(~(is_a_theorem(implies(esk23_0,or(esk23_0,esk24_0))))|or_1)),inference(shift_quantors,[status(thm)],[96])).
% cnf(99,plain,(is_a_theorem(implies(X1,or(X1,X2)))|~or_1),inference(split_conjunct,[status(thm)],[97])).
% cnf(104,plain,(or_3),inference(split_conjunct,[status(thm)],[16])).
% cnf(105,plain,(or_2),inference(split_conjunct,[status(thm)],[17])).
% cnf(106,plain,(or_1),inference(split_conjunct,[status(thm)],[18])).
% cnf(110,plain,(implies_3),inference(split_conjunct,[status(thm)],[22])).
% cnf(114,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[26])).
% fof(115, plain,((~(r4)|![X4]:![X5]:![X6]:is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6)))))&(?[X4]:?[X5]:?[X6]:~(is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6)))))|r4)),inference(fof_nnf,[status(thm)],[27])).
% fof(116, plain,((~(r4)|![X7]:![X8]:![X9]:is_a_theorem(implies(or(X7,or(X8,X9)),or(X8,or(X7,X9)))))&(?[X10]:?[X11]:?[X12]:~(is_a_theorem(implies(or(X10,or(X11,X12)),or(X11,or(X10,X12)))))|r4)),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,((~(r4)|![X7]:![X8]:![X9]:is_a_theorem(implies(or(X7,or(X8,X9)),or(X8,or(X7,X9)))))&(~(is_a_theorem(implies(or(esk25_0,or(esk26_0,esk27_0)),or(esk26_0,or(esk25_0,esk27_0)))))|r4)),inference(skolemize,[status(esa)],[116])).
% fof(118, plain,![X7]:![X8]:![X9]:((is_a_theorem(implies(or(X7,or(X8,X9)),or(X8,or(X7,X9))))|~(r4))&(~(is_a_theorem(implies(or(esk25_0,or(esk26_0,esk27_0)),or(esk26_0,or(esk25_0,esk27_0)))))|r4)),inference(shift_quantors,[status(thm)],[117])).
% cnf(119,plain,(r4|~is_a_theorem(implies(or(esk25_0,or(esk26_0,esk27_0)),or(esk26_0,or(esk25_0,esk27_0))))),inference(split_conjunct,[status(thm)],[118])).
% cnf(121,negated_conjecture,(~r4),inference(split_conjunct,[status(thm)],[30])).
% cnf(126,plain,(is_a_theorem(implies(X1,or(X2,X1)))|$false),inference(rw,[status(thm)],[93,105,theory(equality)])).
% cnf(127,plain,(is_a_theorem(implies(X1,or(X2,X1)))),inference(cn,[status(thm)],[126,theory(equality)])).
% cnf(128,plain,(is_a_theorem(implies(X1,or(X1,X2)))|$false),inference(rw,[status(thm)],[99,106,theory(equality)])).
% cnf(129,plain,(is_a_theorem(implies(X1,or(X1,X2)))),inference(cn,[status(thm)],[128,theory(equality)])).
% cnf(136,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[57,114,theory(equality)])).
% cnf(137,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[136,theory(equality)])).
% cnf(149,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|$false),inference(rw,[status(thm)],[36,110,theory(equality)])).
% cnf(150,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))),inference(cn,[status(thm)],[149,theory(equality)])).
% cnf(151,plain,(~is_a_theorem(implies(or(esk25_0,or(esk26_0,esk27_0)),or(esk26_0,or(esk25_0,esk27_0))))),inference(sr,[status(thm)],[119,121,theory(equality)])).
% cnf(152,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2))))|$false),inference(rw,[status(thm)],[87,104,theory(equality)])).
% cnf(153,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2))))),inference(cn,[status(thm)],[152,theory(equality)])).
% cnf(169,plain,(is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))|~is_a_theorem(implies(X3,X1))),inference(spm,[status(thm)],[137,150,theory(equality)])).
% cnf(170,plain,(is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),X2)))|~is_a_theorem(implies(X3,X2))),inference(spm,[status(thm)],[137,153,theory(equality)])).
% cnf(211,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X3,X2))|~is_a_theorem(implies(X1,X3))),inference(spm,[status(thm)],[137,169,theory(equality)])).
% cnf(219,plain,(is_a_theorem(implies(or(X1,X2),X3))|~is_a_theorem(implies(X2,X3))|~is_a_theorem(implies(X1,X3))),inference(spm,[status(thm)],[137,170,theory(equality)])).
% cnf(223,plain,(~is_a_theorem(implies(or(esk26_0,esk27_0),or(esk26_0,or(esk25_0,esk27_0))))|~is_a_theorem(implies(esk25_0,or(esk26_0,or(esk25_0,esk27_0))))),inference(spm,[status(thm)],[151,219,theory(equality)])).
% cnf(231,plain,(~is_a_theorem(implies(esk25_0,or(esk26_0,or(esk25_0,esk27_0))))|~is_a_theorem(implies(esk27_0,or(esk26_0,or(esk25_0,esk27_0))))|~is_a_theorem(implies(esk26_0,or(esk26_0,or(esk25_0,esk27_0))))),inference(spm,[status(thm)],[223,219,theory(equality)])).
% cnf(233,plain,(~is_a_theorem(implies(esk25_0,or(esk26_0,or(esk25_0,esk27_0))))|~is_a_theorem(implies(esk27_0,or(esk26_0,or(esk25_0,esk27_0))))|$false),inference(rw,[status(thm)],[231,129,theory(equality)])).
% cnf(234,plain,(~is_a_theorem(implies(esk25_0,or(esk26_0,or(esk25_0,esk27_0))))|~is_a_theorem(implies(esk27_0,or(esk26_0,or(esk25_0,esk27_0))))),inference(cn,[status(thm)],[233,theory(equality)])).
% cnf(271,plain,(is_a_theorem(implies(X1,or(X2,X3)))|~is_a_theorem(implies(X1,X3))),inference(spm,[status(thm)],[211,127,theory(equality)])).
% cnf(296,plain,(~is_a_theorem(implies(esk25_0,or(esk26_0,or(esk25_0,esk27_0))))|~is_a_theorem(implies(esk27_0,or(esk25_0,esk27_0)))),inference(spm,[status(thm)],[234,271,theory(equality)])).
% cnf(305,plain,(~is_a_theorem(implies(esk25_0,or(esk26_0,or(esk25_0,esk27_0))))|$false),inference(rw,[status(thm)],[296,127,theory(equality)])).
% cnf(306,plain,(~is_a_theorem(implies(esk25_0,or(esk26_0,or(esk25_0,esk27_0))))),inference(cn,[status(thm)],[305,theory(equality)])).
% cnf(314,plain,(~is_a_theorem(implies(esk25_0,or(esk25_0,esk27_0)))),inference(spm,[status(thm)],[306,271,theory(equality)])).
% cnf(315,plain,($false),inference(rw,[status(thm)],[314,129,theory(equality)])).
% cnf(316,plain,($false),inference(cn,[status(thm)],[315,theory(equality)])).
% cnf(317,plain,($false),316,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 136
% # ...of these trivial                : 10
% # ...subsumed                        : 15
% # ...remaining for further processing: 111
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 1
% # Backward-rewritten                 : 10
% # Generated clauses                  : 116
% # ...of the previous two non-trivial : 100
% # Contextual simplify-reflections    : 4
% # Paramodulations                    : 116
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 69
% #    Positive orientable unit clauses: 29
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 9
% #    Non-unit-clauses                : 31
% # Current number of unprocessed clauses: 37
% # ...number of literals in the above : 92
% # Clause-clause subsumption calls (NU) : 181
% # Rec. Clause-clause subsumption calls : 179
% # Unit Clause-clause subsumption calls : 76
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 59
% # Indexed BW rewrite successes       : 3
% # Backwards rewriting index:    77 leaves,   1.77+/-1.682 terms/leaf
% # Paramod-from index:           25 leaves,   1.52+/-1.330 terms/leaf
% # Paramod-into index:           75 leaves,   1.69+/-1.575 terms/leaf
% # -------------------------------------------------
% # User time              : 0.020 s
% # System time            : 0.003 s
% # Total time             : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.24 WC
% FINAL PrfWatch: 0.11 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP24499/LCL457+1.tptp
% 
%------------------------------------------------------------------------------