%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL464+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 : art03.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:26:44 EST 2010
% Result : Theorem 158.12s
% Output : Solution 161.95s
% 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/SystemOnTPTP4842/LCL464+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~hilbert_implies_2:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ... yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... implies_2:
% CSA axiom implies_2 found
% Looking for CSA axiom ... luka_modus_ponens: CSA axiom luka_modus_ponens found
% Looking for CSA axiom ... luka_cn1: CSA axiom luka_cn1 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... luka_cn2:
% CSA axiom luka_cn2 found
% Looking for CSA axiom ... luka_cn3:
% CSA axiom luka_cn3 found
% Looking for CSA axiom ... luka_op_equiv:
% CSA axiom luka_op_equiv found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... substitution_of_equivalents:
% CSA axiom substitution_of_equivalents found
% Looking for CSA axiom ... hilbert_op_implies_and:
% CSA axiom hilbert_op_implies_and found
% Looking for CSA axiom ... hilbert_op_equiv:
% modus_ponens:
% CSA axiom modus_ponens found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... hilbert_op_equiv:
% implies_1:
% CSA axiom implies_1 found
% Looking for CSA axiom ... implies_3:
% CSA axiom implies_3 found
% Looking for CSA axiom ... cn1:
% CSA axiom cn1 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... hilbert_op_equiv:
% luka_op_or: CSA axiom luka_op_or found
% Looking for CSA axiom ... hilbert_op_or:
% CSA axiom hilbert_op_or found
% Looking for CSA axiom ... and_1:
% CSA axiom and_1 found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... hilbert_op_equiv:
% and_2:
% CSA axiom and_2 found
% Looking for CSA axiom ... and_3:
% CSA axiom and_3 found
% Looking for CSA axiom ... or_1:
% CSA axiom or_1 found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... hilbert_op_equiv:
% or_2:
% CSA axiom or_2 found
% Looking for CSA axiom ... or_3:
% CSA axiom or_3 found
% Looking for CSA axiom ... kn1:
% CSA axiom kn1 found
% ---- Iteration 8 (21 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... hilbert_op_equiv:
% kn2:
% CSA axiom kn2 found
% Looking for CSA axiom ... r1:
% CSA axiom r1 found
% Looking for CSA axiom ... r2:
% CSA axiom r2 found
% ---- Iteration 9 (24 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... hilbert_op_equiv:
% r3:
% CSA axiom r3 found
% Looking for CSA axiom ... r4:
% CSA axiom r4 found
% Looking for CSA axiom ... r5:
% CSA axiom r5 found
% ---- Iteration 10 (27 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... hilbert_op_equiv:
% op_or:
% CSA axiom op_or found
% Looking for CSA axiom ... op_and:
% CSA axiom op_and found
% Looking for CSA axiom ... substitution_of_equivalents:modus_tollens:
% CSA axiom modus_tollens found
% ---- Iteration 11 (30 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... hilbert_op_equiv:
% substitution_of_equivalents:equivalence_1:
% CSA axiom equivalence_1 found
% Looking for CSA axiom ... equivalence_2:
% CSA axiom equivalence_2 found
% Looking for CSA axiom ... equivalence_3:
% CSA axiom equivalence_3 found
% ---- Iteration 12 (33 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... hilbert_op_equiv:
% substitution_of_equivalents:cn2:
% CSA axiom cn2 found
% Looking for CSA axiom ... cn3:
% CSA axiom cn3 found
% Looking for CSA axiom ... kn3:
% CSA axiom kn3 found
% ---- Iteration 13 (36 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :kn3:cn3:cn2:equivalence_3:equivalence_2:equivalence_1:modus_tollens:op_and:op_or:r5:r4:r3:r2:r1:kn2:kn1:or_3:or_2:or_1:and_3:and_2:and_1:hilbert_op_or:luka_op_or:cn1:implies_3:implies_1:modus_ponens:hilbert_op_implies_and:substitution_of_equivalents:luka_op_equiv:luka_cn3:luka_cn2:luka_cn1:luka_modus_ponens:implies_2 (36)
% Unselected axioms are ... :hilbert_op_equiv:substitution_of_equivalents:op_implies_and:op_implies_or:op_equiv:luka_op_implies (6)
% SZS status THM for /tmp/SystemOnTPTP4842/LCL464+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP4842/LCL464+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 11829
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,(cn3<=>![X1]:is_a_theorem(implies(implies(not(X1),X1),X1))),file('/tmp/SRASS.s.p', cn3)).
% fof(3, axiom,(cn2<=>![X1]:![X2]:is_a_theorem(implies(X1,implies(not(X1),X2)))),file('/tmp/SRASS.s.p', cn2)).
% fof(25, axiom,(cn1<=>![X1]:![X2]:![X3]:is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))),file('/tmp/SRASS.s.p', cn1)).
% fof(28, axiom,(modus_ponens<=>![X4]:![X5]:((is_a_theorem(X4)&is_a_theorem(implies(X4,X5)))=>is_a_theorem(X5))),file('/tmp/SRASS.s.p', modus_ponens)).
% fof(32, axiom,cn3,file('/tmp/SRASS.s.p', luka_cn3)).
% fof(33, axiom,cn2,file('/tmp/SRASS.s.p', luka_cn2)).
% fof(34, axiom,cn1,file('/tmp/SRASS.s.p', luka_cn1)).
% fof(35, axiom,modus_ponens,file('/tmp/SRASS.s.p', luka_modus_ponens)).
% fof(36, axiom,(implies_2<=>![X4]:![X5]:is_a_theorem(implies(implies(X4,implies(X4,X5)),implies(X4,X5)))),file('/tmp/SRASS.s.p', implies_2)).
% fof(37, conjecture,implies_2,file('/tmp/SRASS.s.p', hilbert_implies_2)).
% fof(38, negated_conjecture,~(implies_2),inference(assume_negation,[status(cth)],[37])).
% fof(39, negated_conjecture,~(implies_2),inference(fof_simplification,[status(thm)],[38,theory(equality)])).
% fof(46, plain,((~(cn3)|![X1]:is_a_theorem(implies(implies(not(X1),X1),X1)))&(?[X1]:~(is_a_theorem(implies(implies(not(X1),X1),X1)))|cn3)),inference(fof_nnf,[status(thm)],[2])).
% fof(47, plain,((~(cn3)|![X2]:is_a_theorem(implies(implies(not(X2),X2),X2)))&(?[X3]:~(is_a_theorem(implies(implies(not(X3),X3),X3)))|cn3)),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,((~(cn3)|![X2]:is_a_theorem(implies(implies(not(X2),X2),X2)))&(~(is_a_theorem(implies(implies(not(esk4_0),esk4_0),esk4_0)))|cn3)),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X2]:((is_a_theorem(implies(implies(not(X2),X2),X2))|~(cn3))&(~(is_a_theorem(implies(implies(not(esk4_0),esk4_0),esk4_0)))|cn3)),inference(shift_quantors,[status(thm)],[48])).
% cnf(51,plain,(is_a_theorem(implies(implies(not(X1),X1),X1))|~cn3),inference(split_conjunct,[status(thm)],[49])).
% fof(52, plain,((~(cn2)|![X1]:![X2]:is_a_theorem(implies(X1,implies(not(X1),X2))))&(?[X1]:?[X2]:~(is_a_theorem(implies(X1,implies(not(X1),X2))))|cn2)),inference(fof_nnf,[status(thm)],[3])).
% fof(53, plain,((~(cn2)|![X3]:![X4]:is_a_theorem(implies(X3,implies(not(X3),X4))))&(?[X5]:?[X6]:~(is_a_theorem(implies(X5,implies(not(X5),X6))))|cn2)),inference(variable_rename,[status(thm)],[52])).
% fof(54, plain,((~(cn2)|![X3]:![X4]:is_a_theorem(implies(X3,implies(not(X3),X4))))&(~(is_a_theorem(implies(esk5_0,implies(not(esk5_0),esk6_0))))|cn2)),inference(skolemize,[status(esa)],[53])).
% fof(55, plain,![X3]:![X4]:((is_a_theorem(implies(X3,implies(not(X3),X4)))|~(cn2))&(~(is_a_theorem(implies(esk5_0,implies(not(esk5_0),esk6_0))))|cn2)),inference(shift_quantors,[status(thm)],[54])).
% cnf(57,plain,(is_a_theorem(implies(X1,implies(not(X1),X2)))|~cn2),inference(split_conjunct,[status(thm)],[55])).
% fof(170, plain,((~(cn1)|![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)))))|cn1)),inference(fof_nnf,[status(thm)],[25])).
% fof(171, plain,((~(cn1)|![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)))))|cn1)),inference(variable_rename,[status(thm)],[170])).
% fof(172, plain,((~(cn1)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))))&(~(is_a_theorem(implies(implies(esk42_0,esk43_0),implies(implies(esk43_0,esk44_0),implies(esk42_0,esk44_0)))))|cn1)),inference(skolemize,[status(esa)],[171])).
% fof(173, plain,![X4]:![X5]:![X6]:((is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6))))|~(cn1))&(~(is_a_theorem(implies(implies(esk42_0,esk43_0),implies(implies(esk43_0,esk44_0),implies(esk42_0,esk44_0)))))|cn1)),inference(shift_quantors,[status(thm)],[172])).
% cnf(175,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~cn1),inference(split_conjunct,[status(thm)],[173])).
% fof(188, plain,((~(modus_ponens)|![X4]:![X5]:((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5)))&(?[X4]:?[X5]:((is_a_theorem(X4)&is_a_theorem(implies(X4,X5)))&~(is_a_theorem(X5)))|modus_ponens)),inference(fof_nnf,[status(thm)],[28])).
% fof(189, plain,((~(modus_ponens)|![X6]:![X7]:((~(is_a_theorem(X6))|~(is_a_theorem(implies(X6,X7))))|is_a_theorem(X7)))&(?[X8]:?[X9]:((is_a_theorem(X8)&is_a_theorem(implies(X8,X9)))&~(is_a_theorem(X9)))|modus_ponens)),inference(variable_rename,[status(thm)],[188])).
% fof(190, plain,((~(modus_ponens)|![X6]:![X7]:((~(is_a_theorem(X6))|~(is_a_theorem(implies(X6,X7))))|is_a_theorem(X7)))&(((is_a_theorem(esk50_0)&is_a_theorem(implies(esk50_0,esk51_0)))&~(is_a_theorem(esk51_0)))|modus_ponens)),inference(skolemize,[status(esa)],[189])).
% fof(191, plain,![X6]:![X7]:((((~(is_a_theorem(X6))|~(is_a_theorem(implies(X6,X7))))|is_a_theorem(X7))|~(modus_ponens))&(((is_a_theorem(esk50_0)&is_a_theorem(implies(esk50_0,esk51_0)))&~(is_a_theorem(esk51_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[190])).
% fof(192, plain,![X6]:![X7]:((((~(is_a_theorem(X6))|~(is_a_theorem(implies(X6,X7))))|is_a_theorem(X7))|~(modus_ponens))&(((is_a_theorem(esk50_0)|modus_ponens)&(is_a_theorem(implies(esk50_0,esk51_0))|modus_ponens))&(~(is_a_theorem(esk51_0))|modus_ponens))),inference(distribute,[status(thm)],[191])).
% cnf(196,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[192])).
% cnf(200,plain,(cn3),inference(split_conjunct,[status(thm)],[32])).
% cnf(201,plain,(cn2),inference(split_conjunct,[status(thm)],[33])).
% cnf(202,plain,(cn1),inference(split_conjunct,[status(thm)],[34])).
% cnf(203,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[35])).
% fof(204, plain,((~(implies_2)|![X4]:![X5]:is_a_theorem(implies(implies(X4,implies(X4,X5)),implies(X4,X5))))&(?[X4]:?[X5]:~(is_a_theorem(implies(implies(X4,implies(X4,X5)),implies(X4,X5))))|implies_2)),inference(fof_nnf,[status(thm)],[36])).
% fof(205, plain,((~(implies_2)|![X6]:![X7]:is_a_theorem(implies(implies(X6,implies(X6,X7)),implies(X6,X7))))&(?[X8]:?[X9]:~(is_a_theorem(implies(implies(X8,implies(X8,X9)),implies(X8,X9))))|implies_2)),inference(variable_rename,[status(thm)],[204])).
% fof(206, plain,((~(implies_2)|![X6]:![X7]:is_a_theorem(implies(implies(X6,implies(X6,X7)),implies(X6,X7))))&(~(is_a_theorem(implies(implies(esk52_0,implies(esk52_0,esk53_0)),implies(esk52_0,esk53_0))))|implies_2)),inference(skolemize,[status(esa)],[205])).
% fof(207, plain,![X6]:![X7]:((is_a_theorem(implies(implies(X6,implies(X6,X7)),implies(X6,X7)))|~(implies_2))&(~(is_a_theorem(implies(implies(esk52_0,implies(esk52_0,esk53_0)),implies(esk52_0,esk53_0))))|implies_2)),inference(shift_quantors,[status(thm)],[206])).
% cnf(208,plain,(implies_2|~is_a_theorem(implies(implies(esk52_0,implies(esk52_0,esk53_0)),implies(esk52_0,esk53_0)))),inference(split_conjunct,[status(thm)],[207])).
% cnf(210,negated_conjecture,(~implies_2),inference(split_conjunct,[status(thm)],[39])).
% cnf(217,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[196,203,theory(equality)])).
% cnf(218,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[217,theory(equality)])).
% cnf(219,plain,(~is_a_theorem(implies(implies(esk52_0,implies(esk52_0,esk53_0)),implies(esk52_0,esk53_0)))),inference(sr,[status(thm)],[208,210,theory(equality)])).
% cnf(220,plain,(is_a_theorem(implies(X1,implies(not(X1),X2)))|$false),inference(rw,[status(thm)],[57,201,theory(equality)])).
% cnf(221,plain,(is_a_theorem(implies(X1,implies(not(X1),X2)))),inference(cn,[status(thm)],[220,theory(equality)])).
% cnf(223,plain,(is_a_theorem(implies(implies(not(X1),X1),X1))|$false),inference(rw,[status(thm)],[51,200,theory(equality)])).
% cnf(224,plain,(is_a_theorem(implies(implies(not(X1),X1),X1))),inference(cn,[status(thm)],[223,theory(equality)])).
% cnf(225,plain,(is_a_theorem(X1)|~is_a_theorem(implies(not(X1),X1))),inference(spm,[status(thm)],[218,224,theory(equality)])).
% cnf(233,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|$false),inference(rw,[status(thm)],[175,202,theory(equality)])).
% cnf(234,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))),inference(cn,[status(thm)],[233,theory(equality)])).
% cnf(235,plain,(is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))|~is_a_theorem(implies(X3,X1))),inference(spm,[status(thm)],[218,234,theory(equality)])).
% cnf(245,plain,(is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4)))),inference(spm,[status(thm)],[235,234,theory(equality)])).
% cnf(246,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X1),X2)))),inference(spm,[status(thm)],[235,224,theory(equality)])).
% cnf(247,plain,(is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3)))),inference(spm,[status(thm)],[235,221,theory(equality)])).
% cnf(248,plain,(is_a_theorem(implies(implies(not(X1),X1),X2))|~is_a_theorem(implies(X1,X2))),inference(spm,[status(thm)],[218,246,theory(equality)])).
% cnf(249,plain,(is_a_theorem(implies(implies(implies(implies(not(X1),X1),X2),X3),implies(implies(X1,X2),X3)))),inference(spm,[status(thm)],[235,246,theory(equality)])).
% cnf(251,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(implies(not(X1),X3),X2))),inference(spm,[status(thm)],[218,247,theory(equality)])).
% cnf(256,plain,(is_a_theorem(implies(X1,implies(implies(X2,X3),implies(not(X1),X3))))),inference(spm,[status(thm)],[251,234,theory(equality)])).
% cnf(258,plain,(is_a_theorem(implies(X1,X1))),inference(spm,[status(thm)],[251,224,theory(equality)])).
% cnf(270,plain,(is_a_theorem(implies(implies(implies(implies(X1,X2),implies(not(X3),X2)),X4),implies(X3,X4)))),inference(spm,[status(thm)],[235,256,theory(equality)])).
% cnf(303,plain,(is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1))),inference(spm,[status(thm)],[248,224,theory(equality)])).
% cnf(323,plain,(is_a_theorem(X1)|~is_a_theorem(implies(not(implies(not(X1),X1)),implies(not(X1),X1)))),inference(spm,[status(thm)],[218,303,theory(equality)])).
% cnf(511,plain,(is_a_theorem(implies(implies(X1,X2),X3))|~is_a_theorem(implies(implies(implies(not(X1),X1),X2),X3))),inference(spm,[status(thm)],[218,249,theory(equality)])).
% cnf(512,plain,(is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X4),implies(implies(implies(implies(not(X1),X1),X2),X3),X4)))),inference(spm,[status(thm)],[235,249,theory(equality)])).
% cnf(523,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(implies(implies(X3,X4),implies(not(X1),X4)),X2))),inference(spm,[status(thm)],[218,270,theory(equality)])).
% cnf(644,plain,(is_a_theorem(implies(X1,implies(X2,implies(not(X1),X3))))),inference(spm,[status(thm)],[523,247,theory(equality)])).
% cnf(662,plain,(is_a_theorem(implies(implies(implies(X1,implies(not(X2),X3)),X4),implies(X2,X4)))),inference(spm,[status(thm)],[235,644,theory(equality)])).
% cnf(703,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(implies(X3,implies(not(X1),X4)),X2))),inference(spm,[status(thm)],[218,662,theory(equality)])).
% cnf(717,plain,(is_a_theorem(implies(X1,implies(not(implies(X2,implies(not(X1),X3))),X4)))),inference(spm,[status(thm)],[703,221,theory(equality)])).
% cnf(766,plain,(is_a_theorem(implies(implies(implies(not(implies(X1,implies(not(X2),X3))),X4),X5),implies(X2,X5)))),inference(spm,[status(thm)],[235,717,theory(equality)])).
% cnf(771,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)],[218,245,theory(equality)])).
% cnf(1164,plain,(is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(implies(X2,X3),implies(X1,X3))))),inference(spm,[status(thm)],[771,249,theory(equality)])).
% cnf(1396,plain,(is_a_theorem(implies(X1,implies(implies(X1,X2),implies(X3,X2))))),inference(spm,[status(thm)],[703,1164,theory(equality)])).
% cnf(1412,plain,(is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[218,1396,theory(equality)])).
% cnf(1413,plain,(is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(X1,X4)))),inference(spm,[status(thm)],[235,1396,theory(equality)])).
% cnf(1429,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X3,X2))|~is_a_theorem(X3)),inference(spm,[status(thm)],[218,1412,theory(equality)])).
% cnf(1485,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(not(X2),X2))),inference(spm,[status(thm)],[1429,224,theory(equality)])).
% cnf(1704,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(implies(implies(X1,X3),implies(X4,X3)),X2))),inference(spm,[status(thm)],[218,1413,theory(equality)])).
% cnf(1784,plain,(is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))|~is_a_theorem(implies(X1,X4))),inference(spm,[status(thm)],[1704,1412,theory(equality)])).
% cnf(1802,plain,(is_a_theorem(implies(not(implies(X1,implies(not(X2),X3))),implies(X2,implies(X4,X5))))),inference(spm,[status(thm)],[1704,766,theory(equality)])).
% cnf(2234,plain,(is_a_theorem(implies(X1,implies(X2,implies(not(X2),X3))))),inference(spm,[status(thm)],[1485,1802,theory(equality)])).
% cnf(2254,plain,(is_a_theorem(implies(implies(implies(X1,implies(not(X1),X2)),X3),implies(X4,X3)))),inference(spm,[status(thm)],[235,2234,theory(equality)])).
% cnf(2421,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(implies(X3,implies(not(X3),X4)),X2))),inference(spm,[status(thm)],[218,2254,theory(equality)])).
% cnf(3355,plain,(is_a_theorem(implies(X1,implies(X2,implies(X3,X1))))),inference(spm,[status(thm)],[1784,258,theory(equality)])).
% cnf(3377,plain,(is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X4),implies(X3,X4)))),inference(spm,[status(thm)],[235,3355,theory(equality)])).
% cnf(3426,plain,(is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3)))),inference(spm,[status(thm)],[511,3377,theory(equality)])).
% cnf(3434,plain,(is_a_theorem(implies(X1,implies(X2,X3)))|~is_a_theorem(implies(implies(X4,X2),X3))),inference(spm,[status(thm)],[1429,3426,theory(equality)])).
% cnf(23872,plain,(is_a_theorem(implies(X1,implies(X2,X2)))),inference(spm,[status(thm)],[3434,224,theory(equality)])).
% cnf(23874,plain,(is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2)))),inference(spm,[status(thm)],[3434,303,theory(equality)])).
% cnf(24095,plain,(is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2)))),inference(spm,[status(thm)],[235,23872,theory(equality)])).
% cnf(24288,plain,(is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),implies(X3,X2)))),inference(spm,[status(thm)],[235,23874,theory(equality)])).
% cnf(24455,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(implies(X3,X3),X2))),inference(spm,[status(thm)],[218,24095,theory(equality)])).
% cnf(28772,plain,(is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X3,implies(X1,X2))))),inference(spm,[status(thm)],[771,24288,theory(equality)])).
% cnf(30052,plain,(is_a_theorem(implies(X1,implies(X2,implies(implies(X1,X3),X3))))),inference(spm,[status(thm)],[1704,28772,theory(equality)])).
% cnf(30115,plain,(is_a_theorem(implies(X1,implies(X2,implies(implies(implies(X3,X3),X4),X4))))),inference(spm,[status(thm)],[24455,30052,theory(equality)])).
% cnf(30117,plain,(is_a_theorem(implies(implies(implies(X1,implies(implies(X2,X3),X3)),X4),implies(X2,X4)))),inference(spm,[status(thm)],[235,30052,theory(equality)])).
% cnf(30164,plain,(is_a_theorem(implies(implies(implies(X1,X1),X2),X2))),inference(spm,[status(thm)],[323,30115,theory(equality)])).
% cnf(30298,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,X2),X1))),inference(spm,[status(thm)],[218,30164,theory(equality)])).
% cnf(48062,plain,(is_a_theorem(implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3)))),inference(spm,[status(thm)],[511,30117,theory(equality)])).
% cnf(48097,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(implies(implies(X1,X3),X3),X2))),inference(spm,[status(thm)],[218,48062,theory(equality)])).
% cnf(48107,plain,(is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3))))),inference(spm,[status(thm)],[771,48062,theory(equality)])).
% cnf(48120,plain,(is_a_theorem(implies(X1,implies(implies(X1,X2),X2)))),inference(spm,[status(thm)],[30298,48062,theory(equality)])).
% cnf(48583,plain,(is_a_theorem(implies(X1,implies(not(X2),implies(X2,X3))))),inference(spm,[status(thm)],[2421,48107,theory(equality)])).
% cnf(48683,plain,(is_a_theorem(implies(not(X1),implies(X1,X2)))),inference(spm,[status(thm)],[225,48583,theory(equality)])).
% cnf(48790,plain,(is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3)))),inference(spm,[status(thm)],[235,48683,theory(equality)])).
% cnf(49826,plain,(is_a_theorem(implies(implies(X1,X2),implies(not(X2),implies(X1,X3))))),inference(spm,[status(thm)],[771,48790,theory(equality)])).
% cnf(61260,plain,(is_a_theorem(implies(X1,implies(implies(implies(implies(X1,X2),X2),X3),X3)))),inference(spm,[status(thm)],[48097,48120,theory(equality)])).
% cnf(62432,plain,(is_a_theorem(implies(implies(implies(implies(implies(X1,X1),X2),X2),X3),X3))),inference(spm,[status(thm)],[30298,61260,theory(equality)])).
% cnf(64574,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(implies(implies(X2,X2),X3),X3),X1))),inference(spm,[status(thm)],[218,62432,theory(equality)])).
% cnf(68303,plain,(is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),X2))),inference(spm,[status(thm)],[64574,512,theory(equality)])).
% cnf(68787,plain,(is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2)))),inference(spm,[status(thm)],[771,68303,theory(equality)])).
% cnf(68901,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,implies(not(X2),X2)))),inference(spm,[status(thm)],[218,68787,theory(equality)])).
% cnf(71615,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))),inference(spm,[status(thm)],[68901,49826,theory(equality)])).
% cnf(74391,plain,($false),inference(rw,[status(thm)],[219,71615,theory(equality)])).
% cnf(74392,plain,($false),inference(cn,[status(thm)],[74391,theory(equality)])).
% cnf(74393,plain,($false),74392,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2698
% # ...of these trivial : 681
% # ...subsumed : 718
% # ...remaining for further processing: 1299
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 15
% # Backward-rewritten : 66
% # Generated clauses : 52350
% # ...of the previous two non-trivial : 31542
% # Contextual simplify-reflections : 45
% # Paramodulations : 52350
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1218
% # Positive orientable unit clauses: 918
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 296
% # Current number of unprocessed clauses: 28046
% # ...number of literals in the above : 33380
% # Clause-clause subsumption calls (NU) : 9805
% # Rec. Clause-clause subsumption calls : 9776
% # Unit Clause-clause subsumption calls : 2250
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 212718
% # Indexed BW rewrite successes : 65
% # Backwards rewriting index: 409 leaves, 9.48+/-33.537 terms/leaf
% # Paramod-from index: 28 leaves, 33.75+/-83.672 terms/leaf
% # Paramod-into index: 375 leaves, 10.02+/-34.598 terms/leaf
% # -------------------------------------------------
% # User time : 2.305 s
% # System time : 0.065 s
% # Total time : 2.370 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.47 CPU 3.76 WC
% FINAL PrfWatch: 3.47 CPU 3.76 WC
% SZS output end Solution for /tmp/SystemOnTPTP4842/LCL464+1.tptp
%
%------------------------------------------------------------------------------