%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL453+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:29:24 EST 2010
% Result : Theorem 1.23s
% Output : Solution 1.23s
% 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/SystemOnTPTP14255/LCL453+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14255/LCL453+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14255/LCL453+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 14387
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(cn3<=>![X1]:is_a_theorem(implies(implies(not(X1),X1),X1))),file('/tmp/SRASS.s.p', cn3)).
% fof(2, axiom,(modus_tollens<=>![X2]:![X3]:is_a_theorem(implies(implies(not(X3),not(X2)),implies(X2,X3)))),file('/tmp/SRASS.s.p', modus_tollens)).
% fof(3, axiom,op_implies_and,file('/tmp/SRASS.s.p', hilbert_op_implies_and)).
% fof(4, axiom,modus_ponens,file('/tmp/SRASS.s.p', hilbert_modus_ponens)).
% fof(5, axiom,modus_tollens,file('/tmp/SRASS.s.p', hilbert_modus_tollens)).
% fof(7, axiom,implies_2,file('/tmp/SRASS.s.p', hilbert_implies_2)).
% fof(9, axiom,and_1,file('/tmp/SRASS.s.p', hilbert_and_1)).
% fof(11, axiom,and_3,file('/tmp/SRASS.s.p', hilbert_and_3)).
% fof(13, axiom,or_2,file('/tmp/SRASS.s.p', hilbert_or_2)).
% fof(19, axiom,(modus_ponens<=>![X2]:![X3]:((is_a_theorem(X2)&is_a_theorem(implies(X2,X3)))=>is_a_theorem(X3))),file('/tmp/SRASS.s.p', modus_ponens)).
% fof(21, axiom,(implies_2<=>![X2]:![X3]:is_a_theorem(implies(implies(X2,implies(X2,X3)),implies(X2,X3)))),file('/tmp/SRASS.s.p', implies_2)).
% fof(25, axiom,op_or,file('/tmp/SRASS.s.p', hilbert_op_or)).
% fof(26, axiom,op_equiv,file('/tmp/SRASS.s.p', hilbert_op_equiv)).
% fof(27, axiom,substitution_of_equivalents,file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(30, axiom,(and_1<=>![X2]:![X3]:is_a_theorem(implies(and(X2,X3),X2))),file('/tmp/SRASS.s.p', and_1)).
% fof(32, axiom,(and_3<=>![X2]:![X3]:is_a_theorem(implies(X2,implies(X3,and(X2,X3))))),file('/tmp/SRASS.s.p', and_3)).
% fof(34, axiom,(or_2<=>![X2]:![X3]:is_a_theorem(implies(X3,or(X2,X3)))),file('/tmp/SRASS.s.p', or_2)).
% fof(46, axiom,(op_implies_and=>![X2]:![X3]:implies(X2,X3)=not(and(X2,not(X3)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(48, axiom,(substitution_of_equivalents<=>![X2]:![X3]:(is_a_theorem(equiv(X2,X3))=>X2=X3)),file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(49, axiom,(op_or=>![X2]:![X3]:or(X2,X3)=not(and(not(X2),not(X3)))),file('/tmp/SRASS.s.p', op_or)).
% fof(51, axiom,(op_equiv=>![X2]:![X3]:equiv(X2,X3)=and(implies(X2,X3),implies(X3,X2))),file('/tmp/SRASS.s.p', op_equiv)).
% fof(53, conjecture,cn3,file('/tmp/SRASS.s.p', luka_cn3)).
% fof(54, negated_conjecture,~(cn3),inference(assume_negation,[status(cth)],[53])).
% fof(55, negated_conjecture,~(cn3),inference(fof_simplification,[status(thm)],[54,theory(equality)])).
% fof(56, 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)],[1])).
% fof(57, 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)],[56])).
% fof(58, plain,((~(cn3)|![X2]:is_a_theorem(implies(implies(not(X2),X2),X2)))&(~(is_a_theorem(implies(implies(not(esk1_0),esk1_0),esk1_0)))|cn3)),inference(skolemize,[status(esa)],[57])).
% fof(59, plain,![X2]:((is_a_theorem(implies(implies(not(X2),X2),X2))|~(cn3))&(~(is_a_theorem(implies(implies(not(esk1_0),esk1_0),esk1_0)))|cn3)),inference(shift_quantors,[status(thm)],[58])).
% cnf(60,plain,(cn3|~is_a_theorem(implies(implies(not(esk1_0),esk1_0),esk1_0))),inference(split_conjunct,[status(thm)],[59])).
% fof(62, plain,((~(modus_tollens)|![X2]:![X3]:is_a_theorem(implies(implies(not(X3),not(X2)),implies(X2,X3))))&(?[X2]:?[X3]:~(is_a_theorem(implies(implies(not(X3),not(X2)),implies(X2,X3))))|modus_tollens)),inference(fof_nnf,[status(thm)],[2])).
% fof(63, plain,((~(modus_tollens)|![X4]:![X5]:is_a_theorem(implies(implies(not(X5),not(X4)),implies(X4,X5))))&(?[X6]:?[X7]:~(is_a_theorem(implies(implies(not(X7),not(X6)),implies(X6,X7))))|modus_tollens)),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,((~(modus_tollens)|![X4]:![X5]:is_a_theorem(implies(implies(not(X5),not(X4)),implies(X4,X5))))&(~(is_a_theorem(implies(implies(not(esk3_0),not(esk2_0)),implies(esk2_0,esk3_0))))|modus_tollens)),inference(skolemize,[status(esa)],[63])).
% fof(65, plain,![X4]:![X5]:((is_a_theorem(implies(implies(not(X5),not(X4)),implies(X4,X5)))|~(modus_tollens))&(~(is_a_theorem(implies(implies(not(esk3_0),not(esk2_0)),implies(esk2_0,esk3_0))))|modus_tollens)),inference(shift_quantors,[status(thm)],[64])).
% cnf(67,plain,(is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))|~modus_tollens),inference(split_conjunct,[status(thm)],[65])).
% cnf(68,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[3])).
% cnf(69,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[4])).
% cnf(70,plain,(modus_tollens),inference(split_conjunct,[status(thm)],[5])).
% cnf(72,plain,(implies_2),inference(split_conjunct,[status(thm)],[7])).
% cnf(74,plain,(and_1),inference(split_conjunct,[status(thm)],[9])).
% cnf(76,plain,(and_3),inference(split_conjunct,[status(thm)],[11])).
% cnf(78,plain,(or_2),inference(split_conjunct,[status(thm)],[13])).
% fof(89, plain,((~(modus_ponens)|![X2]:![X3]:((~(is_a_theorem(X2))|~(is_a_theorem(implies(X2,X3))))|is_a_theorem(X3)))&(?[X2]:?[X3]:((is_a_theorem(X2)&is_a_theorem(implies(X2,X3)))&~(is_a_theorem(X3)))|modus_ponens)),inference(fof_nnf,[status(thm)],[19])).
% fof(90, plain,((~(modus_ponens)|![X4]:![X5]:((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5)))&(?[X6]:?[X7]:((is_a_theorem(X6)&is_a_theorem(implies(X6,X7)))&~(is_a_theorem(X7)))|modus_ponens)),inference(variable_rename,[status(thm)],[89])).
% fof(91, plain,((~(modus_ponens)|![X4]:![X5]:((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5)))&(((is_a_theorem(esk6_0)&is_a_theorem(implies(esk6_0,esk7_0)))&~(is_a_theorem(esk7_0)))|modus_ponens)),inference(skolemize,[status(esa)],[90])).
% fof(92, plain,![X4]:![X5]:((((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5))|~(modus_ponens))&(((is_a_theorem(esk6_0)&is_a_theorem(implies(esk6_0,esk7_0)))&~(is_a_theorem(esk7_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[91])).
% fof(93, plain,![X4]:![X5]:((((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5))|~(modus_ponens))&(((is_a_theorem(esk6_0)|modus_ponens)&(is_a_theorem(implies(esk6_0,esk7_0))|modus_ponens))&(~(is_a_theorem(esk7_0))|modus_ponens))),inference(distribute,[status(thm)],[92])).
% cnf(97,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[93])).
% fof(104, plain,((~(implies_2)|![X2]:![X3]:is_a_theorem(implies(implies(X2,implies(X2,X3)),implies(X2,X3))))&(?[X2]:?[X3]:~(is_a_theorem(implies(implies(X2,implies(X2,X3)),implies(X2,X3))))|implies_2)),inference(fof_nnf,[status(thm)],[21])).
% fof(105, plain,((~(implies_2)|![X4]:![X5]:is_a_theorem(implies(implies(X4,implies(X4,X5)),implies(X4,X5))))&(?[X6]:?[X7]:~(is_a_theorem(implies(implies(X6,implies(X6,X7)),implies(X6,X7))))|implies_2)),inference(variable_rename,[status(thm)],[104])).
% fof(106, plain,((~(implies_2)|![X4]:![X5]:is_a_theorem(implies(implies(X4,implies(X4,X5)),implies(X4,X5))))&(~(is_a_theorem(implies(implies(esk10_0,implies(esk10_0,esk11_0)),implies(esk10_0,esk11_0))))|implies_2)),inference(skolemize,[status(esa)],[105])).
% fof(107, plain,![X4]:![X5]:((is_a_theorem(implies(implies(X4,implies(X4,X5)),implies(X4,X5)))|~(implies_2))&(~(is_a_theorem(implies(implies(esk10_0,implies(esk10_0,esk11_0)),implies(esk10_0,esk11_0))))|implies_2)),inference(shift_quantors,[status(thm)],[106])).
% cnf(109,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|~implies_2),inference(split_conjunct,[status(thm)],[107])).
% cnf(128,plain,(op_or),inference(split_conjunct,[status(thm)],[25])).
% cnf(129,plain,(op_equiv),inference(split_conjunct,[status(thm)],[26])).
% cnf(130,plain,(substitution_of_equivalents),inference(split_conjunct,[status(thm)],[27])).
% fof(133, plain,((~(and_1)|![X2]:![X3]:is_a_theorem(implies(and(X2,X3),X2)))&(?[X2]:?[X3]:~(is_a_theorem(implies(and(X2,X3),X2)))|and_1)),inference(fof_nnf,[status(thm)],[30])).
% fof(134, plain,((~(and_1)|![X4]:![X5]:is_a_theorem(implies(and(X4,X5),X4)))&(?[X6]:?[X7]:~(is_a_theorem(implies(and(X6,X7),X6)))|and_1)),inference(variable_rename,[status(thm)],[133])).
% fof(135, plain,((~(and_1)|![X4]:![X5]:is_a_theorem(implies(and(X4,X5),X4)))&(~(is_a_theorem(implies(and(esk21_0,esk22_0),esk21_0)))|and_1)),inference(skolemize,[status(esa)],[134])).
% fof(136, plain,![X4]:![X5]:((is_a_theorem(implies(and(X4,X5),X4))|~(and_1))&(~(is_a_theorem(implies(and(esk21_0,esk22_0),esk21_0)))|and_1)),inference(shift_quantors,[status(thm)],[135])).
% cnf(138,plain,(is_a_theorem(implies(and(X1,X2),X1))|~and_1),inference(split_conjunct,[status(thm)],[136])).
% fof(145, plain,((~(and_3)|![X2]:![X3]:is_a_theorem(implies(X2,implies(X3,and(X2,X3)))))&(?[X2]:?[X3]:~(is_a_theorem(implies(X2,implies(X3,and(X2,X3)))))|and_3)),inference(fof_nnf,[status(thm)],[32])).
% fof(146, plain,((~(and_3)|![X4]:![X5]:is_a_theorem(implies(X4,implies(X5,and(X4,X5)))))&(?[X6]:?[X7]:~(is_a_theorem(implies(X6,implies(X7,and(X6,X7)))))|and_3)),inference(variable_rename,[status(thm)],[145])).
% fof(147, plain,((~(and_3)|![X4]:![X5]:is_a_theorem(implies(X4,implies(X5,and(X4,X5)))))&(~(is_a_theorem(implies(esk25_0,implies(esk26_0,and(esk25_0,esk26_0)))))|and_3)),inference(skolemize,[status(esa)],[146])).
% fof(148, plain,![X4]:![X5]:((is_a_theorem(implies(X4,implies(X5,and(X4,X5))))|~(and_3))&(~(is_a_theorem(implies(esk25_0,implies(esk26_0,and(esk25_0,esk26_0)))))|and_3)),inference(shift_quantors,[status(thm)],[147])).
% cnf(150,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3),inference(split_conjunct,[status(thm)],[148])).
% fof(157, plain,((~(or_2)|![X2]:![X3]:is_a_theorem(implies(X3,or(X2,X3))))&(?[X2]:?[X3]:~(is_a_theorem(implies(X3,or(X2,X3))))|or_2)),inference(fof_nnf,[status(thm)],[34])).
% fof(158, plain,((~(or_2)|![X4]:![X5]:is_a_theorem(implies(X5,or(X4,X5))))&(?[X6]:?[X7]:~(is_a_theorem(implies(X7,or(X6,X7))))|or_2)),inference(variable_rename,[status(thm)],[157])).
% fof(159, plain,((~(or_2)|![X4]:![X5]:is_a_theorem(implies(X5,or(X4,X5))))&(~(is_a_theorem(implies(esk30_0,or(esk29_0,esk30_0))))|or_2)),inference(skolemize,[status(esa)],[158])).
% fof(160, plain,![X4]:![X5]:((is_a_theorem(implies(X5,or(X4,X5)))|~(or_2))&(~(is_a_theorem(implies(esk30_0,or(esk29_0,esk30_0))))|or_2)),inference(shift_quantors,[status(thm)],[159])).
% cnf(162,plain,(is_a_theorem(implies(X1,or(X2,X1)))|~or_2),inference(split_conjunct,[status(thm)],[160])).
% fof(229, plain,(~(op_implies_and)|![X2]:![X3]:implies(X2,X3)=not(and(X2,not(X3)))),inference(fof_nnf,[status(thm)],[46])).
% fof(230, plain,(~(op_implies_and)|![X4]:![X5]:implies(X4,X5)=not(and(X4,not(X5)))),inference(variable_rename,[status(thm)],[229])).
% fof(231, plain,![X4]:![X5]:(implies(X4,X5)=not(and(X4,not(X5)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[230])).
% cnf(232,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[231])).
% fof(237, plain,((~(substitution_of_equivalents)|![X2]:![X3]:(~(is_a_theorem(equiv(X2,X3)))|X2=X3))&(?[X2]:?[X3]:(is_a_theorem(equiv(X2,X3))&~(X2=X3))|substitution_of_equivalents)),inference(fof_nnf,[status(thm)],[48])).
% fof(238, plain,((~(substitution_of_equivalents)|![X4]:![X5]:(~(is_a_theorem(equiv(X4,X5)))|X4=X5))&(?[X6]:?[X7]:(is_a_theorem(equiv(X6,X7))&~(X6=X7))|substitution_of_equivalents)),inference(variable_rename,[status(thm)],[237])).
% fof(239, plain,((~(substitution_of_equivalents)|![X4]:![X5]:(~(is_a_theorem(equiv(X4,X5)))|X4=X5))&((is_a_theorem(equiv(esk54_0,esk55_0))&~(esk54_0=esk55_0))|substitution_of_equivalents)),inference(skolemize,[status(esa)],[238])).
% fof(240, plain,![X4]:![X5]:(((~(is_a_theorem(equiv(X4,X5)))|X4=X5)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk54_0,esk55_0))&~(esk54_0=esk55_0))|substitution_of_equivalents)),inference(shift_quantors,[status(thm)],[239])).
% fof(241, plain,![X4]:![X5]:(((~(is_a_theorem(equiv(X4,X5)))|X4=X5)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk54_0,esk55_0))|substitution_of_equivalents)&(~(esk54_0=esk55_0)|substitution_of_equivalents))),inference(distribute,[status(thm)],[240])).
% cnf(244,plain,(X1=X2|~substitution_of_equivalents|~is_a_theorem(equiv(X1,X2))),inference(split_conjunct,[status(thm)],[241])).
% fof(245, plain,(~(op_or)|![X2]:![X3]:or(X2,X3)=not(and(not(X2),not(X3)))),inference(fof_nnf,[status(thm)],[49])).
% fof(246, plain,(~(op_or)|![X4]:![X5]:or(X4,X5)=not(and(not(X4),not(X5)))),inference(variable_rename,[status(thm)],[245])).
% fof(247, plain,![X4]:![X5]:(or(X4,X5)=not(and(not(X4),not(X5)))|~(op_or)),inference(shift_quantors,[status(thm)],[246])).
% cnf(248,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[247])).
% fof(253, plain,(~(op_equiv)|![X2]:![X3]:equiv(X2,X3)=and(implies(X2,X3),implies(X3,X2))),inference(fof_nnf,[status(thm)],[51])).
% fof(254, plain,(~(op_equiv)|![X4]:![X5]:equiv(X4,X5)=and(implies(X4,X5),implies(X5,X4))),inference(variable_rename,[status(thm)],[253])).
% fof(255, plain,![X4]:![X5]:(equiv(X4,X5)=and(implies(X4,X5),implies(X5,X4))|~(op_equiv)),inference(shift_quantors,[status(thm)],[254])).
% cnf(256,plain,(equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv),inference(split_conjunct,[status(thm)],[255])).
% cnf(258,negated_conjecture,(~cn3),inference(split_conjunct,[status(thm)],[55])).
% cnf(264,plain,(~is_a_theorem(implies(implies(not(esk1_0),esk1_0),esk1_0))),inference(sr,[status(thm)],[60,258,theory(equality)])).
% cnf(272,plain,(X1=X2|$false|~is_a_theorem(equiv(X1,X2))),inference(rw,[status(thm)],[244,130,theory(equality)])).
% cnf(273,plain,(X1=X2|~is_a_theorem(equiv(X1,X2))),inference(cn,[status(thm)],[272,theory(equality)])).
% cnf(279,plain,(is_a_theorem(implies(X1,or(X2,X1)))|$false),inference(rw,[status(thm)],[162,78,theory(equality)])).
% cnf(280,plain,(is_a_theorem(implies(X1,or(X2,X1)))),inference(cn,[status(thm)],[279,theory(equality)])).
% cnf(288,plain,(is_a_theorem(implies(and(X1,X2),X1))|$false),inference(rw,[status(thm)],[138,74,theory(equality)])).
% cnf(289,plain,(is_a_theorem(implies(and(X1,X2),X1))),inference(cn,[status(thm)],[288,theory(equality)])).
% cnf(293,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[97,69,theory(equality)])).
% cnf(294,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[293,theory(equality)])).
% cnf(300,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[232,68,theory(equality)])).
% cnf(301,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[300,theory(equality)])).
% cnf(311,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|$false),inference(rw,[status(thm)],[150,76,theory(equality)])).
% cnf(312,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))),inference(cn,[status(thm)],[311,theory(equality)])).
% cnf(313,plain,(is_a_theorem(implies(X1,and(X2,X1)))|~is_a_theorem(X2)),inference(spm,[status(thm)],[294,312,theory(equality)])).
% cnf(316,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[248,301,theory(equality)])).
% cnf(317,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[316,128,theory(equality)])).
% cnf(318,plain,(implies(not(X1),X2)=or(X1,X2)),inference(cn,[status(thm)],[317,theory(equality)])).
% cnf(319,plain,(is_a_theorem(or(X1,or(X2,not(X1))))),inference(spm,[status(thm)],[280,318,theory(equality)])).
% cnf(330,plain,(~is_a_theorem(implies(or(esk1_0,esk1_0),esk1_0))),inference(rw,[status(thm)],[264,318,theory(equality)])).
% cnf(336,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)|$false),inference(rw,[status(thm)],[256,129,theory(equality)])).
% cnf(337,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)),inference(cn,[status(thm)],[336,theory(equality)])).
% cnf(345,plain,(is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))|~modus_tollens),inference(rw,[status(thm)],[67,318,theory(equality)])).
% cnf(346,plain,(is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))|$false),inference(rw,[status(thm)],[345,70,theory(equality)])).
% cnf(347,plain,(is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))),inference(cn,[status(thm)],[346,theory(equality)])).
% cnf(348,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(or(X2,not(X1)))),inference(spm,[status(thm)],[294,347,theory(equality)])).
% cnf(351,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|$false),inference(rw,[status(thm)],[109,72,theory(equality)])).
% cnf(352,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))),inference(cn,[status(thm)],[351,theory(equality)])).
% cnf(353,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,implies(X1,X2)))),inference(spm,[status(thm)],[294,352,theory(equality)])).
% cnf(406,plain,(is_a_theorem(and(X1,X2))|~is_a_theorem(X2)|~is_a_theorem(X1)),inference(spm,[status(thm)],[294,313,theory(equality)])).
% cnf(412,plain,(is_a_theorem(equiv(X1,X2))|~is_a_theorem(implies(X2,X1))|~is_a_theorem(implies(X1,X2))),inference(spm,[status(thm)],[406,337,theory(equality)])).
% cnf(433,plain,(is_a_theorem(implies(X1,and(X1,X1)))),inference(spm,[status(thm)],[353,312,theory(equality)])).
% cnf(495,plain,(is_a_theorem(equiv(and(X1,X1),X1))|~is_a_theorem(implies(and(X1,X1),X1))),inference(spm,[status(thm)],[412,433,theory(equality)])).
% cnf(505,plain,(is_a_theorem(equiv(and(X1,X1),X1))|$false),inference(rw,[status(thm)],[495,289,theory(equality)])).
% cnf(506,plain,(is_a_theorem(equiv(and(X1,X1),X1))),inference(cn,[status(thm)],[505,theory(equality)])).
% cnf(517,plain,(and(X1,X1)=X1),inference(spm,[status(thm)],[273,506,theory(equality)])).
% cnf(526,plain,(not(not(X1))=implies(not(X1),X1)),inference(spm,[status(thm)],[301,517,theory(equality)])).
% cnf(538,plain,(not(not(X1))=or(X1,X1)),inference(rw,[status(thm)],[526,318,theory(equality)])).
% cnf(570,plain,(is_a_theorem(implies(not(X1),X2))|~is_a_theorem(or(X2,or(X1,X1)))),inference(spm,[status(thm)],[348,538,theory(equality)])).
% cnf(585,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X2,or(X1,X1)))),inference(rw,[status(thm)],[570,318,theory(equality)])).
% cnf(718,plain,(is_a_theorem(or(not(X1),X1))),inference(spm,[status(thm)],[585,319,theory(equality)])).
% cnf(720,plain,(is_a_theorem(or(X1,not(or(X1,X1))))),inference(spm,[status(thm)],[585,718,theory(equality)])).
% cnf(729,plain,(is_a_theorem(implies(or(X1,X1),X1))),inference(spm,[status(thm)],[348,720,theory(equality)])).
% cnf(735,plain,($false),inference(rw,[status(thm)],[330,729,theory(equality)])).
% cnf(736,plain,($false),inference(cn,[status(thm)],[735,theory(equality)])).
% cnf(737,plain,($false),736,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 174
% # ...of these trivial : 26
% # ...subsumed : 16
% # ...remaining for further processing: 132
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 21
% # Generated clauses : 302
% # ...of the previous two non-trivial : 250
% # Contextual simplify-reflections : 0
% # Paramodulations : 302
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 111
% # Positive orientable unit clauses: 56
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 52
% # Current number of unprocessed clauses: 147
% # ...number of literals in the above : 231
% # Clause-clause subsumption calls (NU) : 367
% # Rec. Clause-clause subsumption calls : 367
% # Unit Clause-clause subsumption calls : 123
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 161
% # Indexed BW rewrite successes : 18
% # Backwards rewriting index: 161 leaves, 1.42+/-1.013 terms/leaf
% # Paramod-from index: 51 leaves, 1.24+/-0.580 terms/leaf
% # Paramod-into index: 148 leaves, 1.35+/-0.821 terms/leaf
% # -------------------------------------------------
% # User time : 0.028 s
% # System time : 0.002 s
% # Total time : 0.030 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.21 WC
% FINAL PrfWatch: 0.14 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP14255/LCL453+1.tptp
%
%------------------------------------------------------------------------------