TSTP Solution File: LCL456+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL456+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:05 EST 2010
% Result : Theorem 1.04s
% Output : Solution 1.04s
% 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/SystemOnTPTP24240/LCL456+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24240/LCL456+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24240/LCL456+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 24336
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(r3<=>![X1]:![X2]:is_a_theorem(implies(or(X1,X2),or(X2,X1)))),file('/tmp/SRASS.s.p', r3)).
% fof(2, axiom,modus_ponens,file('/tmp/SRASS.s.p', hilbert_modus_ponens)).
% fof(3, axiom,modus_tollens,file('/tmp/SRASS.s.p', hilbert_modus_tollens)).
% fof(4, axiom,implies_1,file('/tmp/SRASS.s.p', hilbert_implies_1)).
% fof(5, axiom,implies_2,file('/tmp/SRASS.s.p', hilbert_implies_2)).
% fof(15, axiom,equivalence_3,file('/tmp/SRASS.s.p', hilbert_equivalence_3)).
% fof(16, axiom,op_implies_or,file('/tmp/SRASS.s.p', principia_op_implies_or)).
% fof(24, axiom,(modus_ponens<=>![X3]:![X4]:((is_a_theorem(X3)&is_a_theorem(implies(X3,X4)))=>is_a_theorem(X4))),file('/tmp/SRASS.s.p', modus_ponens)).
% fof(25, axiom,(implies_1<=>![X3]:![X4]:is_a_theorem(implies(X3,implies(X4,X3)))),file('/tmp/SRASS.s.p', implies_1)).
% fof(26, axiom,(implies_2<=>![X3]:![X4]:is_a_theorem(implies(implies(X3,implies(X3,X4)),implies(X3,X4)))),file('/tmp/SRASS.s.p', implies_2)).
% fof(29, axiom,op_or,file('/tmp/SRASS.s.p', hilbert_op_or)).
% fof(30, axiom,op_implies_and,file('/tmp/SRASS.s.p', hilbert_op_implies_and)).
% fof(32, axiom,substitution_of_equivalents,file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(33, axiom,op_and,file('/tmp/SRASS.s.p', principia_op_and)).
% fof(35, axiom,(op_or=>![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),file('/tmp/SRASS.s.p', op_or)).
% fof(36, axiom,(op_and=>![X3]:![X4]:and(X3,X4)=not(or(not(X3),not(X4)))),file('/tmp/SRASS.s.p', op_and)).
% fof(40, axiom,(modus_tollens<=>![X3]:![X4]:is_a_theorem(implies(implies(not(X4),not(X3)),implies(X3,X4)))),file('/tmp/SRASS.s.p', modus_tollens)).
% fof(43, axiom,(equivalence_3<=>![X3]:![X4]:is_a_theorem(implies(implies(X3,X4),implies(implies(X4,X3),equiv(X3,X4))))),file('/tmp/SRASS.s.p', equivalence_3)).
% fof(48, axiom,(op_implies_or=>![X3]:![X4]:implies(X3,X4)=or(not(X3),X4)),file('/tmp/SRASS.s.p', op_implies_or)).
% fof(49, axiom,(substitution_of_equivalents<=>![X3]:![X4]:(is_a_theorem(equiv(X3,X4))=>X3=X4)),file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(51, axiom,(op_implies_and=>![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(53, conjecture,r3,file('/tmp/SRASS.s.p', principia_r3)).
% fof(54, negated_conjecture,~(r3),inference(assume_negation,[status(cth)],[53])).
% fof(55, negated_conjecture,~(r3),inference(fof_simplification,[status(thm)],[54,theory(equality)])).
% fof(56, plain,((~(r3)|![X1]:![X2]:is_a_theorem(implies(or(X1,X2),or(X2,X1))))&(?[X1]:?[X2]:~(is_a_theorem(implies(or(X1,X2),or(X2,X1))))|r3)),inference(fof_nnf,[status(thm)],[1])).
% fof(57, plain,((~(r3)|![X3]:![X4]:is_a_theorem(implies(or(X3,X4),or(X4,X3))))&(?[X5]:?[X6]:~(is_a_theorem(implies(or(X5,X6),or(X6,X5))))|r3)),inference(variable_rename,[status(thm)],[56])).
% fof(58, plain,((~(r3)|![X3]:![X4]:is_a_theorem(implies(or(X3,X4),or(X4,X3))))&(~(is_a_theorem(implies(or(esk1_0,esk2_0),or(esk2_0,esk1_0))))|r3)),inference(skolemize,[status(esa)],[57])).
% fof(59, plain,![X3]:![X4]:((is_a_theorem(implies(or(X3,X4),or(X4,X3)))|~(r3))&(~(is_a_theorem(implies(or(esk1_0,esk2_0),or(esk2_0,esk1_0))))|r3)),inference(shift_quantors,[status(thm)],[58])).
% cnf(60,plain,(r3|~is_a_theorem(implies(or(esk1_0,esk2_0),or(esk2_0,esk1_0)))),inference(split_conjunct,[status(thm)],[59])).
% cnf(62,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[2])).
% cnf(63,plain,(modus_tollens),inference(split_conjunct,[status(thm)],[3])).
% cnf(64,plain,(implies_1),inference(split_conjunct,[status(thm)],[4])).
% cnf(65,plain,(implies_2),inference(split_conjunct,[status(thm)],[5])).
% cnf(75,plain,(equivalence_3),inference(split_conjunct,[status(thm)],[15])).
% cnf(76,plain,(op_implies_or),inference(split_conjunct,[status(thm)],[16])).
% fof(119, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(?[X3]:?[X4]:((is_a_theorem(X3)&is_a_theorem(implies(X3,X4)))&~(is_a_theorem(X4)))|modus_ponens)),inference(fof_nnf,[status(thm)],[24])).
% fof(120, plain,((~(modus_ponens)|![X5]:![X6]:((~(is_a_theorem(X5))|~(is_a_theorem(implies(X5,X6))))|is_a_theorem(X6)))&(?[X7]:?[X8]:((is_a_theorem(X7)&is_a_theorem(implies(X7,X8)))&~(is_a_theorem(X8)))|modus_ponens)),inference(variable_rename,[status(thm)],[119])).
% fof(121, plain,((~(modus_ponens)|![X5]:![X6]:((~(is_a_theorem(X5))|~(is_a_theorem(implies(X5,X6))))|is_a_theorem(X6)))&(((is_a_theorem(esk19_0)&is_a_theorem(implies(esk19_0,esk20_0)))&~(is_a_theorem(esk20_0)))|modus_ponens)),inference(skolemize,[status(esa)],[120])).
% fof(122, plain,![X5]:![X6]:((((~(is_a_theorem(X5))|~(is_a_theorem(implies(X5,X6))))|is_a_theorem(X6))|~(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)],[121])).
% fof(123, plain,![X5]:![X6]:((((~(is_a_theorem(X5))|~(is_a_theorem(implies(X5,X6))))|is_a_theorem(X6))|~(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)],[122])).
% cnf(127,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[123])).
% fof(128, plain,((~(implies_1)|![X3]:![X4]:is_a_theorem(implies(X3,implies(X4,X3))))&(?[X3]:?[X4]:~(is_a_theorem(implies(X3,implies(X4,X3))))|implies_1)),inference(fof_nnf,[status(thm)],[25])).
% fof(129, plain,((~(implies_1)|![X5]:![X6]:is_a_theorem(implies(X5,implies(X6,X5))))&(?[X7]:?[X8]:~(is_a_theorem(implies(X7,implies(X8,X7))))|implies_1)),inference(variable_rename,[status(thm)],[128])).
% fof(130, plain,((~(implies_1)|![X5]:![X6]:is_a_theorem(implies(X5,implies(X6,X5))))&(~(is_a_theorem(implies(esk21_0,implies(esk22_0,esk21_0))))|implies_1)),inference(skolemize,[status(esa)],[129])).
% fof(131, plain,![X5]:![X6]:((is_a_theorem(implies(X5,implies(X6,X5)))|~(implies_1))&(~(is_a_theorem(implies(esk21_0,implies(esk22_0,esk21_0))))|implies_1)),inference(shift_quantors,[status(thm)],[130])).
% cnf(133,plain,(is_a_theorem(implies(X1,implies(X2,X1)))|~implies_1),inference(split_conjunct,[status(thm)],[131])).
% fof(134, plain,((~(implies_2)|![X3]:![X4]:is_a_theorem(implies(implies(X3,implies(X3,X4)),implies(X3,X4))))&(?[X3]:?[X4]:~(is_a_theorem(implies(implies(X3,implies(X3,X4)),implies(X3,X4))))|implies_2)),inference(fof_nnf,[status(thm)],[26])).
% fof(135, plain,((~(implies_2)|![X5]:![X6]:is_a_theorem(implies(implies(X5,implies(X5,X6)),implies(X5,X6))))&(?[X7]:?[X8]:~(is_a_theorem(implies(implies(X7,implies(X7,X8)),implies(X7,X8))))|implies_2)),inference(variable_rename,[status(thm)],[134])).
% fof(136, plain,((~(implies_2)|![X5]:![X6]:is_a_theorem(implies(implies(X5,implies(X5,X6)),implies(X5,X6))))&(~(is_a_theorem(implies(implies(esk23_0,implies(esk23_0,esk24_0)),implies(esk23_0,esk24_0))))|implies_2)),inference(skolemize,[status(esa)],[135])).
% fof(137, plain,![X5]:![X6]:((is_a_theorem(implies(implies(X5,implies(X5,X6)),implies(X5,X6)))|~(implies_2))&(~(is_a_theorem(implies(implies(esk23_0,implies(esk23_0,esk24_0)),implies(esk23_0,esk24_0))))|implies_2)),inference(shift_quantors,[status(thm)],[136])).
% cnf(139,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|~implies_2),inference(split_conjunct,[status(thm)],[137])).
% cnf(152,plain,(op_or),inference(split_conjunct,[status(thm)],[29])).
% cnf(153,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[30])).
% cnf(155,plain,(substitution_of_equivalents),inference(split_conjunct,[status(thm)],[32])).
% cnf(156,plain,(op_and),inference(split_conjunct,[status(thm)],[33])).
% fof(158, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(fof_nnf,[status(thm)],[35])).
% fof(159, plain,(~(op_or)|![X5]:![X6]:or(X5,X6)=not(and(not(X5),not(X6)))),inference(variable_rename,[status(thm)],[158])).
% fof(160, plain,![X5]:![X6]:(or(X5,X6)=not(and(not(X5),not(X6)))|~(op_or)),inference(shift_quantors,[status(thm)],[159])).
% cnf(161,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[160])).
% fof(162, plain,(~(op_and)|![X3]:![X4]:and(X3,X4)=not(or(not(X3),not(X4)))),inference(fof_nnf,[status(thm)],[36])).
% fof(163, plain,(~(op_and)|![X5]:![X6]:and(X5,X6)=not(or(not(X5),not(X6)))),inference(variable_rename,[status(thm)],[162])).
% fof(164, plain,![X5]:![X6]:(and(X5,X6)=not(or(not(X5),not(X6)))|~(op_and)),inference(shift_quantors,[status(thm)],[163])).
% cnf(165,plain,(and(X1,X2)=not(or(not(X1),not(X2)))|~op_and),inference(split_conjunct,[status(thm)],[164])).
% fof(184, plain,((~(modus_tollens)|![X3]:![X4]:is_a_theorem(implies(implies(not(X4),not(X3)),implies(X3,X4))))&(?[X3]:?[X4]:~(is_a_theorem(implies(implies(not(X4),not(X3)),implies(X3,X4))))|modus_tollens)),inference(fof_nnf,[status(thm)],[40])).
% fof(185, plain,((~(modus_tollens)|![X5]:![X6]:is_a_theorem(implies(implies(not(X6),not(X5)),implies(X5,X6))))&(?[X7]:?[X8]:~(is_a_theorem(implies(implies(not(X8),not(X7)),implies(X7,X8))))|modus_tollens)),inference(variable_rename,[status(thm)],[184])).
% fof(186, plain,((~(modus_tollens)|![X5]:![X6]:is_a_theorem(implies(implies(not(X6),not(X5)),implies(X5,X6))))&(~(is_a_theorem(implies(implies(not(esk38_0),not(esk37_0)),implies(esk37_0,esk38_0))))|modus_tollens)),inference(skolemize,[status(esa)],[185])).
% fof(187, plain,![X5]:![X6]:((is_a_theorem(implies(implies(not(X6),not(X5)),implies(X5,X6)))|~(modus_tollens))&(~(is_a_theorem(implies(implies(not(esk38_0),not(esk37_0)),implies(esk37_0,esk38_0))))|modus_tollens)),inference(shift_quantors,[status(thm)],[186])).
% cnf(189,plain,(is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))|~modus_tollens),inference(split_conjunct,[status(thm)],[187])).
% fof(202, plain,((~(equivalence_3)|![X3]:![X4]:is_a_theorem(implies(implies(X3,X4),implies(implies(X4,X3),equiv(X3,X4)))))&(?[X3]:?[X4]:~(is_a_theorem(implies(implies(X3,X4),implies(implies(X4,X3),equiv(X3,X4)))))|equivalence_3)),inference(fof_nnf,[status(thm)],[43])).
% fof(203, plain,((~(equivalence_3)|![X5]:![X6]:is_a_theorem(implies(implies(X5,X6),implies(implies(X6,X5),equiv(X5,X6)))))&(?[X7]:?[X8]:~(is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X7),equiv(X7,X8)))))|equivalence_3)),inference(variable_rename,[status(thm)],[202])).
% fof(204, plain,((~(equivalence_3)|![X5]:![X6]:is_a_theorem(implies(implies(X5,X6),implies(implies(X6,X5),equiv(X5,X6)))))&(~(is_a_theorem(implies(implies(esk43_0,esk44_0),implies(implies(esk44_0,esk43_0),equiv(esk43_0,esk44_0)))))|equivalence_3)),inference(skolemize,[status(esa)],[203])).
% fof(205, plain,![X5]:![X6]:((is_a_theorem(implies(implies(X5,X6),implies(implies(X6,X5),equiv(X5,X6))))|~(equivalence_3))&(~(is_a_theorem(implies(implies(esk43_0,esk44_0),implies(implies(esk44_0,esk43_0),equiv(esk43_0,esk44_0)))))|equivalence_3)),inference(shift_quantors,[status(thm)],[204])).
% cnf(207,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))|~equivalence_3),inference(split_conjunct,[status(thm)],[205])).
% fof(232, plain,(~(op_implies_or)|![X3]:![X4]:implies(X3,X4)=or(not(X3),X4)),inference(fof_nnf,[status(thm)],[48])).
% fof(233, plain,(~(op_implies_or)|![X5]:![X6]:implies(X5,X6)=or(not(X5),X6)),inference(variable_rename,[status(thm)],[232])).
% fof(234, plain,![X5]:![X6]:(implies(X5,X6)=or(not(X5),X6)|~(op_implies_or)),inference(shift_quantors,[status(thm)],[233])).
% cnf(235,plain,(implies(X1,X2)=or(not(X1),X2)|~op_implies_or),inference(split_conjunct,[status(thm)],[234])).
% fof(236, plain,((~(substitution_of_equivalents)|![X3]:![X4]:(~(is_a_theorem(equiv(X3,X4)))|X3=X4))&(?[X3]:?[X4]:(is_a_theorem(equiv(X3,X4))&~(X3=X4))|substitution_of_equivalents)),inference(fof_nnf,[status(thm)],[49])).
% fof(237, plain,((~(substitution_of_equivalents)|![X5]:![X6]:(~(is_a_theorem(equiv(X5,X6)))|X5=X6))&(?[X7]:?[X8]:(is_a_theorem(equiv(X7,X8))&~(X7=X8))|substitution_of_equivalents)),inference(variable_rename,[status(thm)],[236])).
% fof(238, plain,((~(substitution_of_equivalents)|![X5]:![X6]:(~(is_a_theorem(equiv(X5,X6)))|X5=X6))&((is_a_theorem(equiv(esk51_0,esk52_0))&~(esk51_0=esk52_0))|substitution_of_equivalents)),inference(skolemize,[status(esa)],[237])).
% fof(239, plain,![X5]:![X6]:(((~(is_a_theorem(equiv(X5,X6)))|X5=X6)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk51_0,esk52_0))&~(esk51_0=esk52_0))|substitution_of_equivalents)),inference(shift_quantors,[status(thm)],[238])).
% fof(240, plain,![X5]:![X6]:(((~(is_a_theorem(equiv(X5,X6)))|X5=X6)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk51_0,esk52_0))|substitution_of_equivalents)&(~(esk51_0=esk52_0)|substitution_of_equivalents))),inference(distribute,[status(thm)],[239])).
% cnf(243,plain,(X1=X2|~substitution_of_equivalents|~is_a_theorem(equiv(X1,X2))),inference(split_conjunct,[status(thm)],[240])).
% fof(250, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(fof_nnf,[status(thm)],[51])).
% fof(251, plain,(~(op_implies_and)|![X5]:![X6]:implies(X5,X6)=not(and(X5,not(X6)))),inference(variable_rename,[status(thm)],[250])).
% fof(252, plain,![X5]:![X6]:(implies(X5,X6)=not(and(X5,not(X6)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[251])).
% cnf(253,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[252])).
% cnf(258,negated_conjecture,(~r3),inference(split_conjunct,[status(thm)],[55])).
% cnf(270,plain,(X1=X2|$false|~is_a_theorem(equiv(X1,X2))),inference(rw,[status(thm)],[243,155,theory(equality)])).
% cnf(271,plain,(X1=X2|~is_a_theorem(equiv(X1,X2))),inference(cn,[status(thm)],[270,theory(equality)])).
% cnf(272,plain,(~is_a_theorem(implies(or(esk1_0,esk2_0),or(esk2_0,esk1_0)))),inference(sr,[status(thm)],[60,258,theory(equality)])).
% cnf(276,plain,(or(not(X1),X2)=implies(X1,X2)|$false),inference(rw,[status(thm)],[235,76,theory(equality)])).
% cnf(277,plain,(or(not(X1),X2)=implies(X1,X2)),inference(cn,[status(thm)],[276,theory(equality)])).
% cnf(287,plain,(is_a_theorem(implies(X1,implies(X2,X1)))|$false),inference(rw,[status(thm)],[133,64,theory(equality)])).
% cnf(288,plain,(is_a_theorem(implies(X1,implies(X2,X1)))),inference(cn,[status(thm)],[287,theory(equality)])).
% cnf(296,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[127,62,theory(equality)])).
% cnf(297,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[296,theory(equality)])).
% cnf(303,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[253,153,theory(equality)])).
% cnf(304,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[303,theory(equality)])).
% cnf(320,plain,(not(implies(X1,not(X2)))=and(X1,X2)|~op_and),inference(rw,[status(thm)],[165,277,theory(equality)])).
% cnf(321,plain,(not(implies(X1,not(X2)))=and(X1,X2)|$false),inference(rw,[status(thm)],[320,156,theory(equality)])).
% cnf(322,plain,(not(implies(X1,not(X2)))=and(X1,X2)),inference(cn,[status(thm)],[321,theory(equality)])).
% cnf(323,plain,(or(and(X1,X2),X3)=implies(implies(X1,not(X2)),X3)),inference(spm,[status(thm)],[277,322,theory(equality)])).
% cnf(327,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[161,304,theory(equality)])).
% cnf(328,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[327,152,theory(equality)])).
% cnf(329,plain,(implies(not(X1),X2)=or(X1,X2)),inference(cn,[status(thm)],[328,theory(equality)])).
% cnf(337,plain,(is_a_theorem(X1)|~is_a_theorem(or(X2,X1))|~is_a_theorem(not(X2))),inference(spm,[status(thm)],[297,329,theory(equality)])).
% cnf(360,plain,(is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))|~modus_tollens),inference(rw,[status(thm)],[189,329,theory(equality)])).
% cnf(361,plain,(is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))|$false),inference(rw,[status(thm)],[360,63,theory(equality)])).
% cnf(362,plain,(is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))),inference(cn,[status(thm)],[361,theory(equality)])).
% cnf(364,plain,(is_a_theorem(implies(or(X1,not(not(X2))),or(X2,X1)))),inference(spm,[status(thm)],[362,329,theory(equality)])).
% cnf(368,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|$false),inference(rw,[status(thm)],[139,65,theory(equality)])).
% cnf(369,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))),inference(cn,[status(thm)],[368,theory(equality)])).
% cnf(370,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,implies(X1,X2)))),inference(spm,[status(thm)],[297,369,theory(equality)])).
% cnf(388,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))|$false),inference(rw,[status(thm)],[207,75,theory(equality)])).
% cnf(389,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))),inference(cn,[status(thm)],[388,theory(equality)])).
% cnf(501,plain,(is_a_theorem(implies(X1,X1))),inference(spm,[status(thm)],[370,288,theory(equality)])).
% cnf(511,plain,(is_a_theorem(or(X1,not(X1)))),inference(spm,[status(thm)],[501,329,theory(equality)])).
% cnf(537,plain,(is_a_theorem(implies(X1,not(not(X1))))),inference(spm,[status(thm)],[511,277,theory(equality)])).
% cnf(549,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[297,537,theory(equality)])).
% cnf(561,plain,(is_a_theorem(not(and(X1,X2)))|~is_a_theorem(implies(X1,not(X2)))),inference(spm,[status(thm)],[549,322,theory(equality)])).
% cnf(708,plain,(is_a_theorem(not(and(not(X1),X1)))),inference(spm,[status(thm)],[561,501,theory(equality)])).
% cnf(715,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(not(X2),X2),X1))),inference(spm,[status(thm)],[337,708,theory(equality)])).
% cnf(725,plain,(is_a_theorem(X1)|~is_a_theorem(implies(or(X2,not(X2)),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[715,323,theory(equality)]),329,theory(equality)])).
% cnf(968,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,not(not(X2))),X1))),inference(spm,[status(thm)],[725,277,theory(equality)])).
% cnf(1453,plain,(is_a_theorem(implies(implies(not(not(X1)),X1),equiv(X1,not(not(X1)))))),inference(spm,[status(thm)],[968,389,theory(equality)])).
% cnf(1469,plain,(is_a_theorem(implies(implies(X1,X1),equiv(X1,not(not(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1453,329,theory(equality)]),277,theory(equality)])).
% cnf(1670,plain,(is_a_theorem(equiv(X1,not(not(X1))))|~is_a_theorem(implies(X1,X1))),inference(spm,[status(thm)],[297,1469,theory(equality)])).
% cnf(1678,plain,(is_a_theorem(equiv(X1,not(not(X1))))|$false),inference(rw,[status(thm)],[1670,501,theory(equality)])).
% cnf(1679,plain,(is_a_theorem(equiv(X1,not(not(X1))))),inference(cn,[status(thm)],[1678,theory(equality)])).
% cnf(1683,plain,(X1=not(not(X1))),inference(spm,[status(thm)],[271,1679,theory(equality)])).
% cnf(2438,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))),inference(rw,[status(thm)],[364,1683,theory(equality)])).
% cnf(2447,plain,($false),inference(rw,[status(thm)],[272,2438,theory(equality)])).
% cnf(2448,plain,($false),inference(cn,[status(thm)],[2447,theory(equality)])).
% cnf(2449,plain,($false),2448,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 297
% # ...of these trivial : 30
% # ...subsumed : 60
% # ...remaining for further processing: 207
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 55
% # Generated clauses : 1395
% # ...of the previous two non-trivial : 1124
% # Contextual simplify-reflections : 1
% # Paramodulations : 1395
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 148
% # Positive orientable unit clauses: 92
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 52
% # Current number of unprocessed clauses: 392
% # ...number of literals in the above : 556
% # Clause-clause subsumption calls (NU) : 432
% # Rec. Clause-clause subsumption calls : 432
% # Unit Clause-clause subsumption calls : 184
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 299
% # Indexed BW rewrite successes : 41
% # Backwards rewriting index: 173 leaves, 1.72+/-1.296 terms/leaf
% # Paramod-from index: 66 leaves, 1.47+/-1.144 terms/leaf
% # Paramod-into index: 167 leaves, 1.66+/-1.187 terms/leaf
% # -------------------------------------------------
% # User time : 0.055 s
% # System time : 0.007 s
% # Total time : 0.062 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.26 WC
% FINAL PrfWatch: 0.18 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP24240/LCL456+1.tptp
%
%------------------------------------------------------------------------------