TSTP Solution File: LCL458+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL458+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:30:05 EST 2010
% Result : Theorem 10.43s
% Output : Solution 10.43s
% 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/SystemOnTPTP14604/LCL458+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14604/LCL458+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14604/LCL458+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 14736
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.01 WC
% PrfWatch: 3.93 CPU 4.02 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 5.93 CPU 6.03 WC
% PrfWatch: 7.92 CPU 8.03 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,(r5<=>![X1]:![X2]:![X3]:is_a_theorem(implies(implies(X2,X3),implies(or(X1,X2),or(X1,X3))))),file('/tmp/SRASS.s.p', r5)).
% 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(6, axiom,implies_3,file('/tmp/SRASS.s.p', hilbert_implies_3)).
% fof(9, axiom,and_3,file('/tmp/SRASS.s.p', hilbert_and_3)).
% 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<=>![X4]:![X5]:((is_a_theorem(X4)&is_a_theorem(implies(X4,X5)))=>is_a_theorem(X5))),file('/tmp/SRASS.s.p', modus_ponens)).
% fof(25, axiom,(implies_1<=>![X4]:![X5]:is_a_theorem(implies(X4,implies(X5,X4)))),file('/tmp/SRASS.s.p', implies_1)).
% fof(26, 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(27, axiom,(implies_3<=>![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6))))),file('/tmp/SRASS.s.p', implies_3)).
% 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(31, axiom,op_equiv,file('/tmp/SRASS.s.p', hilbert_op_equiv)).
% fof(32, axiom,substitution_of_equivalents,file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(35, axiom,(op_or=>![X4]:![X5]:or(X4,X5)=not(and(not(X4),not(X5)))),file('/tmp/SRASS.s.p', op_or)).
% fof(39, axiom,(and_3<=>![X4]:![X5]:is_a_theorem(implies(X4,implies(X5,and(X4,X5))))),file('/tmp/SRASS.s.p', and_3)).
% fof(40, axiom,(modus_tollens<=>![X4]:![X5]:is_a_theorem(implies(implies(not(X5),not(X4)),implies(X4,X5)))),file('/tmp/SRASS.s.p', modus_tollens)).
% fof(43, axiom,(equivalence_3<=>![X4]:![X5]:is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X4),equiv(X4,X5))))),file('/tmp/SRASS.s.p', equivalence_3)).
% fof(48, axiom,(op_implies_or=>![X4]:![X5]:implies(X4,X5)=or(not(X4),X5)),file('/tmp/SRASS.s.p', op_implies_or)).
% fof(49, axiom,(substitution_of_equivalents<=>![X4]:![X5]:(is_a_theorem(equiv(X4,X5))=>X4=X5)),file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(51, axiom,(op_implies_and=>![X4]:![X5]:implies(X4,X5)=not(and(X4,not(X5)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(52, axiom,(op_equiv=>![X4]:![X5]:equiv(X4,X5)=and(implies(X4,X5),implies(X5,X4))),file('/tmp/SRASS.s.p', op_equiv)).
% fof(53, conjecture,r5,file('/tmp/SRASS.s.p', principia_r5)).
% fof(54, negated_conjecture,~(r5),inference(assume_negation,[status(cth)],[53])).
% fof(55, negated_conjecture,~(r5),inference(fof_simplification,[status(thm)],[54,theory(equality)])).
% fof(56, plain,((~(r5)|![X1]:![X2]:![X3]:is_a_theorem(implies(implies(X2,X3),implies(or(X1,X2),or(X1,X3)))))&(?[X1]:?[X2]:?[X3]:~(is_a_theorem(implies(implies(X2,X3),implies(or(X1,X2),or(X1,X3)))))|r5)),inference(fof_nnf,[status(thm)],[1])).
% fof(57, plain,((~(r5)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6)))))&(?[X7]:?[X8]:?[X9]:~(is_a_theorem(implies(implies(X8,X9),implies(or(X7,X8),or(X7,X9)))))|r5)),inference(variable_rename,[status(thm)],[56])).
% fof(58, plain,((~(r5)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6)))))&(~(is_a_theorem(implies(implies(esk2_0,esk3_0),implies(or(esk1_0,esk2_0),or(esk1_0,esk3_0)))))|r5)),inference(skolemize,[status(esa)],[57])).
% fof(59, plain,![X4]:![X5]:![X6]:((is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6))))|~(r5))&(~(is_a_theorem(implies(implies(esk2_0,esk3_0),implies(or(esk1_0,esk2_0),or(esk1_0,esk3_0)))))|r5)),inference(shift_quantors,[status(thm)],[58])).
% cnf(60,plain,(r5|~is_a_theorem(implies(implies(esk2_0,esk3_0),implies(or(esk1_0,esk2_0),or(esk1_0,esk3_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(66,plain,(implies_3),inference(split_conjunct,[status(thm)],[6])).
% cnf(69,plain,(and_3),inference(split_conjunct,[status(thm)],[9])).
% 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)|![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)],[24])).
% fof(120, 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)],[119])).
% fof(121, plain,((~(modus_ponens)|![X6]:![X7]:((~(is_a_theorem(X6))|~(is_a_theorem(implies(X6,X7))))|is_a_theorem(X7)))&(((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,![X6]:![X7]:((((~(is_a_theorem(X6))|~(is_a_theorem(implies(X6,X7))))|is_a_theorem(X7))|~(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,![X6]:![X7]:((((~(is_a_theorem(X6))|~(is_a_theorem(implies(X6,X7))))|is_a_theorem(X7))|~(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)|![X4]:![X5]:is_a_theorem(implies(X4,implies(X5,X4))))&(?[X4]:?[X5]:~(is_a_theorem(implies(X4,implies(X5,X4))))|implies_1)),inference(fof_nnf,[status(thm)],[25])).
% fof(129, plain,((~(implies_1)|![X6]:![X7]:is_a_theorem(implies(X6,implies(X7,X6))))&(?[X8]:?[X9]:~(is_a_theorem(implies(X8,implies(X9,X8))))|implies_1)),inference(variable_rename,[status(thm)],[128])).
% fof(130, plain,((~(implies_1)|![X6]:![X7]:is_a_theorem(implies(X6,implies(X7,X6))))&(~(is_a_theorem(implies(esk21_0,implies(esk22_0,esk21_0))))|implies_1)),inference(skolemize,[status(esa)],[129])).
% fof(131, plain,![X6]:![X7]:((is_a_theorem(implies(X6,implies(X7,X6)))|~(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)|![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)],[26])).
% fof(135, 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)],[134])).
% fof(136, plain,((~(implies_2)|![X6]:![X7]:is_a_theorem(implies(implies(X6,implies(X6,X7)),implies(X6,X7))))&(~(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,![X6]:![X7]:((is_a_theorem(implies(implies(X6,implies(X6,X7)),implies(X6,X7)))|~(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])).
% fof(140, plain,((~(implies_3)|![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)))))|implies_3)),inference(fof_nnf,[status(thm)],[27])).
% fof(141, plain,((~(implies_3)|![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)))))|implies_3)),inference(variable_rename,[status(thm)],[140])).
% fof(142, plain,((~(implies_3)|![X7]:![X8]:![X9]:is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9)))))&(~(is_a_theorem(implies(implies(esk25_0,esk26_0),implies(implies(esk26_0,esk27_0),implies(esk25_0,esk27_0)))))|implies_3)),inference(skolemize,[status(esa)],[141])).
% fof(143, plain,![X7]:![X8]:![X9]:((is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9))))|~(implies_3))&(~(is_a_theorem(implies(implies(esk25_0,esk26_0),implies(implies(esk26_0,esk27_0),implies(esk25_0,esk27_0)))))|implies_3)),inference(shift_quantors,[status(thm)],[142])).
% cnf(145,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~implies_3),inference(split_conjunct,[status(thm)],[143])).
% cnf(152,plain,(op_or),inference(split_conjunct,[status(thm)],[29])).
% cnf(153,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[30])).
% cnf(154,plain,(op_equiv),inference(split_conjunct,[status(thm)],[31])).
% cnf(155,plain,(substitution_of_equivalents),inference(split_conjunct,[status(thm)],[32])).
% fof(158, plain,(~(op_or)|![X4]:![X5]:or(X4,X5)=not(and(not(X4),not(X5)))),inference(fof_nnf,[status(thm)],[35])).
% fof(159, plain,(~(op_or)|![X6]:![X7]:or(X6,X7)=not(and(not(X6),not(X7)))),inference(variable_rename,[status(thm)],[158])).
% fof(160, plain,![X6]:![X7]:(or(X6,X7)=not(and(not(X6),not(X7)))|~(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(178, plain,((~(and_3)|![X4]:![X5]:is_a_theorem(implies(X4,implies(X5,and(X4,X5)))))&(?[X4]:?[X5]:~(is_a_theorem(implies(X4,implies(X5,and(X4,X5)))))|and_3)),inference(fof_nnf,[status(thm)],[39])).
% fof(179, plain,((~(and_3)|![X6]:![X7]:is_a_theorem(implies(X6,implies(X7,and(X6,X7)))))&(?[X8]:?[X9]:~(is_a_theorem(implies(X8,implies(X9,and(X8,X9)))))|and_3)),inference(variable_rename,[status(thm)],[178])).
% fof(180, plain,((~(and_3)|![X6]:![X7]:is_a_theorem(implies(X6,implies(X7,and(X6,X7)))))&(~(is_a_theorem(implies(esk35_0,implies(esk36_0,and(esk35_0,esk36_0)))))|and_3)),inference(skolemize,[status(esa)],[179])).
% fof(181, plain,![X6]:![X7]:((is_a_theorem(implies(X6,implies(X7,and(X6,X7))))|~(and_3))&(~(is_a_theorem(implies(esk35_0,implies(esk36_0,and(esk35_0,esk36_0)))))|and_3)),inference(shift_quantors,[status(thm)],[180])).
% cnf(183,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3),inference(split_conjunct,[status(thm)],[181])).
% fof(184, plain,((~(modus_tollens)|![X4]:![X5]:is_a_theorem(implies(implies(not(X5),not(X4)),implies(X4,X5))))&(?[X4]:?[X5]:~(is_a_theorem(implies(implies(not(X5),not(X4)),implies(X4,X5))))|modus_tollens)),inference(fof_nnf,[status(thm)],[40])).
% fof(185, plain,((~(modus_tollens)|![X6]:![X7]:is_a_theorem(implies(implies(not(X7),not(X6)),implies(X6,X7))))&(?[X8]:?[X9]:~(is_a_theorem(implies(implies(not(X9),not(X8)),implies(X8,X9))))|modus_tollens)),inference(variable_rename,[status(thm)],[184])).
% fof(186, plain,((~(modus_tollens)|![X6]:![X7]:is_a_theorem(implies(implies(not(X7),not(X6)),implies(X6,X7))))&(~(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,![X6]:![X7]:((is_a_theorem(implies(implies(not(X7),not(X6)),implies(X6,X7)))|~(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)|![X4]:![X5]:is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X4),equiv(X4,X5)))))&(?[X4]:?[X5]:~(is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X4),equiv(X4,X5)))))|equivalence_3)),inference(fof_nnf,[status(thm)],[43])).
% fof(203, plain,((~(equivalence_3)|![X6]:![X7]:is_a_theorem(implies(implies(X6,X7),implies(implies(X7,X6),equiv(X6,X7)))))&(?[X8]:?[X9]:~(is_a_theorem(implies(implies(X8,X9),implies(implies(X9,X8),equiv(X8,X9)))))|equivalence_3)),inference(variable_rename,[status(thm)],[202])).
% fof(204, plain,((~(equivalence_3)|![X6]:![X7]:is_a_theorem(implies(implies(X6,X7),implies(implies(X7,X6),equiv(X6,X7)))))&(~(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,![X6]:![X7]:((is_a_theorem(implies(implies(X6,X7),implies(implies(X7,X6),equiv(X6,X7))))|~(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)|![X4]:![X5]:implies(X4,X5)=or(not(X4),X5)),inference(fof_nnf,[status(thm)],[48])).
% fof(233, plain,(~(op_implies_or)|![X6]:![X7]:implies(X6,X7)=or(not(X6),X7)),inference(variable_rename,[status(thm)],[232])).
% fof(234, plain,![X6]:![X7]:(implies(X6,X7)=or(not(X6),X7)|~(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)|![X4]:![X5]:(~(is_a_theorem(equiv(X4,X5)))|X4=X5))&(?[X4]:?[X5]:(is_a_theorem(equiv(X4,X5))&~(X4=X5))|substitution_of_equivalents)),inference(fof_nnf,[status(thm)],[49])).
% fof(237, plain,((~(substitution_of_equivalents)|![X6]:![X7]:(~(is_a_theorem(equiv(X6,X7)))|X6=X7))&(?[X8]:?[X9]:(is_a_theorem(equiv(X8,X9))&~(X8=X9))|substitution_of_equivalents)),inference(variable_rename,[status(thm)],[236])).
% fof(238, plain,((~(substitution_of_equivalents)|![X6]:![X7]:(~(is_a_theorem(equiv(X6,X7)))|X6=X7))&((is_a_theorem(equiv(esk51_0,esk52_0))&~(esk51_0=esk52_0))|substitution_of_equivalents)),inference(skolemize,[status(esa)],[237])).
% fof(239, plain,![X6]:![X7]:(((~(is_a_theorem(equiv(X6,X7)))|X6=X7)|~(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,![X6]:![X7]:(((~(is_a_theorem(equiv(X6,X7)))|X6=X7)|~(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)|![X4]:![X5]:implies(X4,X5)=not(and(X4,not(X5)))),inference(fof_nnf,[status(thm)],[51])).
% fof(251, plain,(~(op_implies_and)|![X6]:![X7]:implies(X6,X7)=not(and(X6,not(X7)))),inference(variable_rename,[status(thm)],[250])).
% fof(252, plain,![X6]:![X7]:(implies(X6,X7)=not(and(X6,not(X7)))|~(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])).
% fof(254, plain,(~(op_equiv)|![X4]:![X5]:equiv(X4,X5)=and(implies(X4,X5),implies(X5,X4))),inference(fof_nnf,[status(thm)],[52])).
% fof(255, plain,(~(op_equiv)|![X6]:![X7]:equiv(X6,X7)=and(implies(X6,X7),implies(X7,X6))),inference(variable_rename,[status(thm)],[254])).
% fof(256, plain,![X6]:![X7]:(equiv(X6,X7)=and(implies(X6,X7),implies(X7,X6))|~(op_equiv)),inference(shift_quantors,[status(thm)],[255])).
% cnf(257,plain,(equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv),inference(split_conjunct,[status(thm)],[256])).
% cnf(258,negated_conjecture,(~r5),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(275,plain,(or(not(X1),X2)=implies(X1,X2)|$false),inference(rw,[status(thm)],[235,76,theory(equality)])).
% cnf(276,plain,(or(not(X1),X2)=implies(X1,X2)),inference(cn,[status(thm)],[275,theory(equality)])).
% cnf(277,plain,(is_a_theorem(implies(X1,implies(X2,X1)))|$false),inference(rw,[status(thm)],[133,64,theory(equality)])).
% cnf(278,plain,(is_a_theorem(implies(X1,implies(X2,X1)))),inference(cn,[status(thm)],[277,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(309,plain,(~is_a_theorem(implies(implies(esk2_0,esk3_0),implies(or(esk1_0,esk2_0),or(esk1_0,esk3_0))))),inference(sr,[status(thm)],[60,258,theory(equality)])).
% cnf(316,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|$false),inference(rw,[status(thm)],[183,69,theory(equality)])).
% cnf(317,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))),inference(cn,[status(thm)],[316,theory(equality)])).
% cnf(318,plain,(is_a_theorem(implies(X1,and(X2,X1)))|~is_a_theorem(X2)),inference(spm,[status(thm)],[297,317,theory(equality)])).
% cnf(328,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[161,304,theory(equality)])).
% cnf(329,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[328,152,theory(equality)])).
% cnf(330,plain,(implies(not(X1),X2)=or(X1,X2)),inference(cn,[status(thm)],[329,theory(equality)])).
% cnf(352,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)|$false),inference(rw,[status(thm)],[257,154,theory(equality)])).
% cnf(353,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)),inference(cn,[status(thm)],[352,theory(equality)])).
% cnf(361,plain,(is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))|~modus_tollens),inference(rw,[status(thm)],[189,330,theory(equality)])).
% cnf(362,plain,(is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))|$false),inference(rw,[status(thm)],[361,63,theory(equality)])).
% cnf(363,plain,(is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))),inference(cn,[status(thm)],[362,theory(equality)])).
% cnf(368,plain,(is_a_theorem(implies(implies(X1,not(X2)),implies(X2,not(X1))))),inference(spm,[status(thm)],[363,276,theory(equality)])).
% cnf(369,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|$false),inference(rw,[status(thm)],[139,65,theory(equality)])).
% cnf(370,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))),inference(cn,[status(thm)],[369,theory(equality)])).
% cnf(371,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,implies(X1,X2)))),inference(spm,[status(thm)],[297,370,theory(equality)])).
% cnf(378,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|$false),inference(rw,[status(thm)],[145,66,theory(equality)])).
% cnf(379,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))),inference(cn,[status(thm)],[378,theory(equality)])).
% cnf(381,plain,(is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X3),or(X1,X3))))),inference(spm,[status(thm)],[379,330,theory(equality)])).
% cnf(386,plain,(is_a_theorem(implies(or(X1,X2),implies(implies(X2,X3),or(X1,X3))))),inference(rw,[status(thm)],[381,330,theory(equality)])).
% cnf(389,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(390,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))),inference(cn,[status(thm)],[389,theory(equality)])).
% cnf(391,plain,(is_a_theorem(implies(implies(X1,X2),equiv(X2,X1)))|~is_a_theorem(implies(X2,X1))),inference(spm,[status(thm)],[297,390,theory(equality)])).
% cnf(487,plain,(is_a_theorem(and(X1,X2))|~is_a_theorem(X2)|~is_a_theorem(X1)),inference(spm,[status(thm)],[297,318,theory(equality)])).
% cnf(494,plain,(is_a_theorem(equiv(X1,X2))|~is_a_theorem(implies(X2,X1))|~is_a_theorem(implies(X1,X2))),inference(spm,[status(thm)],[487,353,theory(equality)])).
% cnf(510,plain,(is_a_theorem(implies(X1,X1))),inference(spm,[status(thm)],[371,278,theory(equality)])).
% cnf(520,plain,(is_a_theorem(or(X1,not(X1)))),inference(spm,[status(thm)],[510,330,theory(equality)])).
% cnf(556,plain,(is_a_theorem(implies(X1,not(not(X1))))),inference(spm,[status(thm)],[520,276,theory(equality)])).
% cnf(3099,plain,(is_a_theorem(implies(or(X1,not(X2)),implies(or(X2,X3),or(X1,X3))))),inference(spm,[status(thm)],[386,330,theory(equality)])).
% cnf(3690,plain,(is_a_theorem(implies(implies(not(not(X1)),X1),equiv(X1,not(not(X1)))))),inference(spm,[status(thm)],[391,556,theory(equality)])).
% cnf(3712,plain,(is_a_theorem(implies(implies(X1,X1),equiv(X1,not(not(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3690,330,theory(equality)]),276,theory(equality)])).
% cnf(3821,plain,(is_a_theorem(equiv(X1,not(not(X1))))|~is_a_theorem(implies(X1,X1))),inference(spm,[status(thm)],[297,3712,theory(equality)])).
% cnf(3835,plain,(is_a_theorem(equiv(X1,not(not(X1))))|$false),inference(rw,[status(thm)],[3821,510,theory(equality)])).
% cnf(3836,plain,(is_a_theorem(equiv(X1,not(not(X1))))),inference(cn,[status(thm)],[3835,theory(equality)])).
% cnf(3842,plain,(X1=not(not(X1))),inference(spm,[status(thm)],[271,3836,theory(equality)])).
% cnf(5366,plain,(is_a_theorem(equiv(implies(X1,not(X2)),implies(X2,not(X1))))|~is_a_theorem(implies(implies(X1,not(X2)),implies(X2,not(X1))))),inference(spm,[status(thm)],[494,368,theory(equality)])).
% cnf(5439,plain,(is_a_theorem(equiv(implies(X1,not(X2)),implies(X2,not(X1))))|$false),inference(rw,[status(thm)],[5366,368,theory(equality)])).
% cnf(5440,plain,(is_a_theorem(equiv(implies(X1,not(X2)),implies(X2,not(X1))))),inference(cn,[status(thm)],[5439,theory(equality)])).
% cnf(7249,plain,(implies(X1,not(X2))=implies(X2,not(X1))),inference(spm,[status(thm)],[271,5440,theory(equality)])).
% cnf(7291,plain,(implies(X2,not(not(X1)))=or(X1,not(X2))),inference(spm,[status(thm)],[330,7249,theory(equality)])).
% cnf(7514,plain,(implies(X2,X1)=or(X1,not(X2))),inference(rw,[status(thm)],[7291,3842,theory(equality)])).
% cnf(7742,plain,(or(X1,X2)=implies(not(X2),X1)),inference(spm,[status(thm)],[7514,3842,theory(equality)])).
% cnf(7792,plain,(or(X1,X2)=or(X2,X1)),inference(rw,[status(thm)],[7742,330,theory(equality)])).
% cnf(8486,plain,(~is_a_theorem(implies(implies(esk2_0,esk3_0),implies(or(esk2_0,esk1_0),or(esk3_0,esk1_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[309,7792,theory(equality)]),7792,theory(equality)])).
% cnf(40237,plain,(is_a_theorem(implies(implies(X2,X1),implies(or(X2,X3),or(X1,X3))))),inference(rw,[status(thm)],[3099,7514,theory(equality)])).
% cnf(323991,plain,($false),inference(rw,[status(thm)],[8486,40237,theory(equality)])).
% cnf(323992,plain,($false),inference(cn,[status(thm)],[323991,theory(equality)])).
% cnf(323993,plain,($false),323992,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 10791
% # ...of these trivial : 544
% # ...subsumed : 8959
% # ...remaining for further processing: 1288
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 19
% # Backward-rewritten : 369
% # Generated clauses : 205753
% # ...of the previous two non-trivial : 135437
% # Contextual simplify-reflections : 963
% # Paramodulations : 205753
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 899
% # Positive orientable unit clauses: 586
% # Positive unorientable unit clauses: 15
% # Negative unit clauses : 5
% # Non-unit-clauses : 293
% # Current number of unprocessed clauses: 98112
% # ...number of literals in the above : 168898
% # Clause-clause subsumption calls (NU) : 43684
% # Rec. Clause-clause subsumption calls : 43684
% # Unit Clause-clause subsumption calls : 1257
% # Rewrite failures with RHS unbound : 403
% # Indexed BW rewrite attempts : 21439
% # Indexed BW rewrite successes : 448
% # Backwards rewriting index: 482 leaves, 3.78+/-7.760 terms/leaf
% # Paramod-from index: 172 leaves, 3.87+/-10.890 terms/leaf
% # Paramod-into index: 468 leaves, 3.71+/-7.705 terms/leaf
% # -------------------------------------------------
% # User time : 5.258 s
% # System time : 0.186 s
% # Total time : 5.444 s
% # Maximum resident set size: 0 pages
% PrfWatch: 9.31 CPU 9.45 WC
% FINAL PrfWatch: 9.31 CPU 9.45 WC
% SZS output end Solution for /tmp/SystemOnTPTP14604/LCL458+1.tptp
%
%------------------------------------------------------------------------------