TSTP Solution File: LCL509+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL509+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 : art04.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:43:55 EST 2010
% Result : Theorem 16.21s
% Output : Solution 16.21s
% 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/SystemOnTPTP7642/LCL509+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7642/LCL509+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7642/LCL509+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 7738
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.03 WC
% PrfWatch: 3.92 CPU 4.03 WC
% PrfWatch: 5.92 CPU 6.04 WC
% PrfWatch: 7.90 CPU 8.04 WC
% PrfWatch: 9.90 CPU 10.05 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 11.89 CPU 12.05 WC
% PrfWatch: 13.88 CPU 14.06 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,(or_1<=>![X1]:![X2]:is_a_theorem(implies(X1,or(X1,X2)))),file('/tmp/SRASS.s.p', or_1)).
% fof(2, axiom,modus_ponens,file('/tmp/SRASS.s.p', rosser_modus_ponens)).
% fof(3, axiom,kn1,file('/tmp/SRASS.s.p', rosser_kn1)).
% fof(4, axiom,kn2,file('/tmp/SRASS.s.p', rosser_kn2)).
% fof(5, axiom,kn3,file('/tmp/SRASS.s.p', rosser_kn3)).
% fof(13, axiom,op_or,file('/tmp/SRASS.s.p', rosser_op_or)).
% fof(14, axiom,op_implies_and,file('/tmp/SRASS.s.p', rosser_op_implies_and)).
% fof(20, axiom,(modus_ponens<=>![X1]:![X2]:((is_a_theorem(X1)&is_a_theorem(implies(X1,X2)))=>is_a_theorem(X2))),file('/tmp/SRASS.s.p', modus_ponens)).
% fof(25, axiom,(op_or=>![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_or)).
% fof(30, axiom,(kn1<=>![X4]:is_a_theorem(implies(X4,and(X4,X4)))),file('/tmp/SRASS.s.p', kn1)).
% fof(31, axiom,(kn2<=>![X4]:![X5]:is_a_theorem(implies(and(X4,X5),X4))),file('/tmp/SRASS.s.p', kn2)).
% fof(39, axiom,(kn3<=>![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(not(and(X5,X6)),not(and(X6,X4)))))),file('/tmp/SRASS.s.p', kn3)).
% fof(40, axiom,(op_implies_and=>![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(43, conjecture,or_1,file('/tmp/SRASS.s.p', hilbert_or_1)).
% fof(44, negated_conjecture,~(or_1),inference(assume_negation,[status(cth)],[43])).
% fof(45, negated_conjecture,~(or_1),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(46, plain,((~(or_1)|![X1]:![X2]:is_a_theorem(implies(X1,or(X1,X2))))&(?[X1]:?[X2]:~(is_a_theorem(implies(X1,or(X1,X2))))|or_1)),inference(fof_nnf,[status(thm)],[1])).
% fof(47, plain,((~(or_1)|![X3]:![X4]:is_a_theorem(implies(X3,or(X3,X4))))&(?[X5]:?[X6]:~(is_a_theorem(implies(X5,or(X5,X6))))|or_1)),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,((~(or_1)|![X3]:![X4]:is_a_theorem(implies(X3,or(X3,X4))))&(~(is_a_theorem(implies(esk1_0,or(esk1_0,esk2_0))))|or_1)),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X3]:![X4]:((is_a_theorem(implies(X3,or(X3,X4)))|~(or_1))&(~(is_a_theorem(implies(esk1_0,or(esk1_0,esk2_0))))|or_1)),inference(shift_quantors,[status(thm)],[48])).
% cnf(50,plain,(or_1|~is_a_theorem(implies(esk1_0,or(esk1_0,esk2_0)))),inference(split_conjunct,[status(thm)],[49])).
% cnf(52,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[2])).
% cnf(53,plain,(kn1),inference(split_conjunct,[status(thm)],[3])).
% cnf(54,plain,(kn2),inference(split_conjunct,[status(thm)],[4])).
% cnf(55,plain,(kn3),inference(split_conjunct,[status(thm)],[5])).
% cnf(98,plain,(op_or),inference(split_conjunct,[status(thm)],[13])).
% cnf(99,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[14])).
% fof(105, plain,((~(modus_ponens)|![X1]:![X2]:((~(is_a_theorem(X1))|~(is_a_theorem(implies(X1,X2))))|is_a_theorem(X2)))&(?[X1]:?[X2]:((is_a_theorem(X1)&is_a_theorem(implies(X1,X2)))&~(is_a_theorem(X2)))|modus_ponens)),inference(fof_nnf,[status(thm)],[20])).
% fof(106, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(?[X5]:?[X6]:((is_a_theorem(X5)&is_a_theorem(implies(X5,X6)))&~(is_a_theorem(X6)))|modus_ponens)),inference(variable_rename,[status(thm)],[105])).
% fof(107, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(((is_a_theorem(esk19_0)&is_a_theorem(implies(esk19_0,esk20_0)))&~(is_a_theorem(esk20_0)))|modus_ponens)),inference(skolemize,[status(esa)],[106])).
% fof(108, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(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)],[107])).
% fof(109, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(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)],[108])).
% cnf(113,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[109])).
% fof(138, plain,(~(op_or)|![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[25])).
% fof(139, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[138])).
% fof(140, plain,![X3]:![X4]:(or(X3,X4)=not(and(not(X3),not(X4)))|~(op_or)),inference(shift_quantors,[status(thm)],[139])).
% cnf(141,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[140])).
% fof(164, plain,((~(kn1)|![X4]:is_a_theorem(implies(X4,and(X4,X4))))&(?[X4]:~(is_a_theorem(implies(X4,and(X4,X4))))|kn1)),inference(fof_nnf,[status(thm)],[30])).
% fof(165, plain,((~(kn1)|![X5]:is_a_theorem(implies(X5,and(X5,X5))))&(?[X6]:~(is_a_theorem(implies(X6,and(X6,X6))))|kn1)),inference(variable_rename,[status(thm)],[164])).
% fof(166, plain,((~(kn1)|![X5]:is_a_theorem(implies(X5,and(X5,X5))))&(~(is_a_theorem(implies(esk37_0,and(esk37_0,esk37_0))))|kn1)),inference(skolemize,[status(esa)],[165])).
% fof(167, plain,![X5]:((is_a_theorem(implies(X5,and(X5,X5)))|~(kn1))&(~(is_a_theorem(implies(esk37_0,and(esk37_0,esk37_0))))|kn1)),inference(shift_quantors,[status(thm)],[166])).
% cnf(169,plain,(is_a_theorem(implies(X1,and(X1,X1)))|~kn1),inference(split_conjunct,[status(thm)],[167])).
% fof(170, plain,((~(kn2)|![X4]:![X5]:is_a_theorem(implies(and(X4,X5),X4)))&(?[X4]:?[X5]:~(is_a_theorem(implies(and(X4,X5),X4)))|kn2)),inference(fof_nnf,[status(thm)],[31])).
% fof(171, plain,((~(kn2)|![X6]:![X7]:is_a_theorem(implies(and(X6,X7),X6)))&(?[X8]:?[X9]:~(is_a_theorem(implies(and(X8,X9),X8)))|kn2)),inference(variable_rename,[status(thm)],[170])).
% fof(172, plain,((~(kn2)|![X6]:![X7]:is_a_theorem(implies(and(X6,X7),X6)))&(~(is_a_theorem(implies(and(esk38_0,esk39_0),esk38_0)))|kn2)),inference(skolemize,[status(esa)],[171])).
% fof(173, plain,![X6]:![X7]:((is_a_theorem(implies(and(X6,X7),X6))|~(kn2))&(~(is_a_theorem(implies(and(esk38_0,esk39_0),esk38_0)))|kn2)),inference(shift_quantors,[status(thm)],[172])).
% cnf(175,plain,(is_a_theorem(implies(and(X1,X2),X1))|~kn2),inference(split_conjunct,[status(thm)],[173])).
% fof(216, plain,((~(kn3)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(not(and(X5,X6)),not(and(X6,X4))))))&(?[X4]:?[X5]:?[X6]:~(is_a_theorem(implies(implies(X4,X5),implies(not(and(X5,X6)),not(and(X6,X4))))))|kn3)),inference(fof_nnf,[status(thm)],[39])).
% fof(217, plain,((~(kn3)|![X7]:![X8]:![X9]:is_a_theorem(implies(implies(X7,X8),implies(not(and(X8,X9)),not(and(X9,X7))))))&(?[X10]:?[X11]:?[X12]:~(is_a_theorem(implies(implies(X10,X11),implies(not(and(X11,X12)),not(and(X12,X10))))))|kn3)),inference(variable_rename,[status(thm)],[216])).
% fof(218, plain,((~(kn3)|![X7]:![X8]:![X9]:is_a_theorem(implies(implies(X7,X8),implies(not(and(X8,X9)),not(and(X9,X7))))))&(~(is_a_theorem(implies(implies(esk51_0,esk52_0),implies(not(and(esk52_0,esk53_0)),not(and(esk53_0,esk51_0))))))|kn3)),inference(skolemize,[status(esa)],[217])).
% fof(219, plain,![X7]:![X8]:![X9]:((is_a_theorem(implies(implies(X7,X8),implies(not(and(X8,X9)),not(and(X9,X7)))))|~(kn3))&(~(is_a_theorem(implies(implies(esk51_0,esk52_0),implies(not(and(esk52_0,esk53_0)),not(and(esk53_0,esk51_0))))))|kn3)),inference(shift_quantors,[status(thm)],[218])).
% cnf(221,plain,(is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))|~kn3),inference(split_conjunct,[status(thm)],[219])).
% fof(222, plain,(~(op_implies_and)|![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),inference(fof_nnf,[status(thm)],[40])).
% fof(223, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(variable_rename,[status(thm)],[222])).
% fof(224, plain,![X3]:![X4]:(implies(X3,X4)=not(and(X3,not(X4)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[223])).
% cnf(225,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[224])).
% cnf(238,negated_conjecture,(~or_1),inference(split_conjunct,[status(thm)],[45])).
% cnf(245,plain,(~is_a_theorem(implies(esk1_0,or(esk1_0,esk2_0)))),inference(sr,[status(thm)],[50,238,theory(equality)])).
% cnf(252,plain,(is_a_theorem(implies(X1,and(X1,X1)))|$false),inference(rw,[status(thm)],[169,53,theory(equality)])).
% cnf(253,plain,(is_a_theorem(implies(X1,and(X1,X1)))),inference(cn,[status(thm)],[252,theory(equality)])).
% cnf(254,plain,(is_a_theorem(implies(and(X1,X2),X1))|$false),inference(rw,[status(thm)],[175,54,theory(equality)])).
% cnf(255,plain,(is_a_theorem(implies(and(X1,X2),X1))),inference(cn,[status(thm)],[254,theory(equality)])).
% cnf(259,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[225,99,theory(equality)])).
% cnf(260,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[259,theory(equality)])).
% cnf(261,plain,(not(and(X1,implies(X2,X3)))=implies(X1,and(X2,not(X3)))),inference(spm,[status(thm)],[260,260,theory(equality)])).
% cnf(262,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[113,52,theory(equality)])).
% cnf(263,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[262,theory(equality)])).
% cnf(266,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[141,260,theory(equality)])).
% cnf(267,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[266,98,theory(equality)])).
% cnf(268,plain,(implies(not(X1),X2)=or(X1,X2)),inference(cn,[status(thm)],[267,theory(equality)])).
% cnf(269,plain,(is_a_theorem(or(X1,and(not(X1),not(X1))))),inference(spm,[status(thm)],[253,268,theory(equality)])).
% cnf(270,plain,(is_a_theorem(X1)|~is_a_theorem(or(X2,X1))|~is_a_theorem(not(X2))),inference(spm,[status(thm)],[263,268,theory(equality)])).
% cnf(271,plain,(implies(implies(X1,X2),X3)=or(and(X1,not(X2)),X3)),inference(spm,[status(thm)],[268,260,theory(equality)])).
% cnf(286,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|~kn3),inference(rw,[status(thm)],[221,268,theory(equality)])).
% cnf(287,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|$false),inference(rw,[status(thm)],[286,55,theory(equality)])).
% cnf(288,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))),inference(cn,[status(thm)],[287,theory(equality)])).
% cnf(289,plain,(is_a_theorem(or(and(X1,X2),not(and(X2,X3))))|~is_a_theorem(implies(X3,X1))),inference(spm,[status(thm)],[263,288,theory(equality)])).
% cnf(291,plain,(is_a_theorem(implies(implies(not(X1),X2),or(and(X2,X3),implies(X3,X1))))),inference(spm,[status(thm)],[288,260,theory(equality)])).
% cnf(294,plain,(is_a_theorem(implies(or(X1,X2),or(and(X2,X3),implies(X3,X1))))),inference(rw,[status(thm)],[291,268,theory(equality)])).
% cnf(306,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,not(X3)),X1))|~is_a_theorem(implies(X2,X3))),inference(spm,[status(thm)],[270,260,theory(equality)])).
% cnf(307,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,implies(X3,X4)),X1))|~is_a_theorem(implies(X2,and(X3,not(X4))))),inference(spm,[status(thm)],[270,261,theory(equality)])).
% cnf(309,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(and(X2,X3),not(X2)),X1))),inference(spm,[status(thm)],[306,255,theory(equality)])).
% cnf(311,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,not(and(X2,X2))),X1))),inference(spm,[status(thm)],[306,253,theory(equality)])).
% cnf(356,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),not(and(not(X3),X1)))))),inference(spm,[status(thm)],[288,271,theory(equality)])).
% cnf(359,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,and(X2,X2)),X1))),inference(rw,[status(thm)],[311,271,theory(equality)])).
% cnf(362,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(and(X2,X3),X2),X1))),inference(rw,[status(thm)],[309,271,theory(equality)])).
% cnf(370,plain,(is_a_theorem(or(and(and(X1,X1),X2),not(and(X2,X1))))),inference(spm,[status(thm)],[359,288,theory(equality)])).
% cnf(374,plain,(is_a_theorem(or(and(X1,X2),not(and(X2,and(X1,X3)))))),inference(spm,[status(thm)],[362,288,theory(equality)])).
% cnf(522,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(and(and(X2,not(X3)),X4),implies(X2,X3)),X1))),inference(spm,[status(thm)],[307,255,theory(equality)])).
% cnf(526,plain,(is_a_theorem(or(and(X1,X2),not(and(X2,not(X3)))))|~is_a_theorem(or(X3,X1))),inference(spm,[status(thm)],[289,268,theory(equality)])).
% cnf(534,plain,(is_a_theorem(or(and(X1,X2),implies(X2,X3)))|~is_a_theorem(or(X3,X1))),inference(rw,[status(thm)],[526,260,theory(equality)])).
% cnf(566,plain,(is_a_theorem(or(and(and(not(X1),not(X1)),X2),implies(X2,X1)))),inference(spm,[status(thm)],[534,269,theory(equality)])).
% cnf(569,plain,(is_a_theorem(or(and(and(not(X1),not(X1)),not(X2)),or(X2,X1)))),inference(spm,[status(thm)],[566,268,theory(equality)])).
% cnf(576,plain,(is_a_theorem(implies(implies(and(not(X1),not(X1)),X2),or(X2,X1)))),inference(rw,[status(thm)],[569,271,theory(equality)])).
% cnf(704,plain,(is_a_theorem(implies(or(X1,X2),or(and(X2,not(X3)),or(X3,X1))))),inference(spm,[status(thm)],[294,268,theory(equality)])).
% cnf(711,plain,(is_a_theorem(implies(or(X1,X2),implies(implies(X2,X3),or(X3,X1))))),inference(rw,[status(thm)],[704,271,theory(equality)])).
% cnf(728,plain,(is_a_theorem(not(and(implies(X1,X2),and(X1,not(X2)))))),inference(spm,[status(thm)],[522,370,theory(equality)])).
% cnf(733,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(implies(X2,X3),and(X2,not(X3))),X1))),inference(spm,[status(thm)],[270,728,theory(equality)])).
% cnf(2691,plain,(is_a_theorem(implies(implies(X1,X2),not(and(not(X2),X3))))|~is_a_theorem(implies(X3,X1))),inference(spm,[status(thm)],[263,356,theory(equality)])).
% cnf(2694,plain,(is_a_theorem(implies(implies(and(X1,X1),X2),not(and(not(X2),X1))))),inference(spm,[status(thm)],[359,356,theory(equality)])).
% cnf(2730,plain,(is_a_theorem(not(and(not(X1),X1)))),inference(spm,[status(thm)],[362,2694,theory(equality)])).
% cnf(2745,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(not(X2),X2),X1))),inference(spm,[status(thm)],[270,2730,theory(equality)])).
% cnf(2749,plain,(is_a_theorem(implies(not(not(X1)),X1))),inference(spm,[status(thm)],[2730,260,theory(equality)])).
% cnf(2753,plain,(is_a_theorem(or(not(X1),X1))),inference(rw,[status(thm)],[2749,268,theory(equality)])).
% cnf(2757,plain,(is_a_theorem(or(and(X1,X2),implies(X2,not(X1))))),inference(spm,[status(thm)],[534,2753,theory(equality)])).
% cnf(2762,plain,(is_a_theorem(or(and(implies(X1,not(X2)),X3),implies(X3,and(X2,X1))))),inference(spm,[status(thm)],[534,2757,theory(equality)])).
% cnf(2821,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(not(not(X2)),X2),X1))),inference(spm,[status(thm)],[2745,271,theory(equality)])).
% cnf(2834,plain,(is_a_theorem(implies(X1,not(not(X1))))),inference(spm,[status(thm)],[2745,2757,theory(equality)])).
% cnf(2835,plain,(is_a_theorem(X1)|~is_a_theorem(implies(or(not(X2),X2),X1))),inference(rw,[status(thm)],[2821,268,theory(equality)])).
% cnf(4332,plain,(is_a_theorem(implies(and(X1,not(not(X2))),and(X2,X1)))),inference(spm,[status(thm)],[733,2762,theory(equality)])).
% cnf(13179,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(implies(and(not(X2),not(X2)),X1))),inference(spm,[status(thm)],[263,576,theory(equality)])).
% cnf(14236,plain,(is_a_theorem(or(and(X1,not(not(X1))),not(X1)))),inference(spm,[status(thm)],[13179,4332,theory(equality)])).
% cnf(14262,plain,(is_a_theorem(implies(implies(X1,not(X1)),not(X1)))),inference(rw,[status(thm)],[14236,271,theory(equality)])).
% cnf(14294,plain,(is_a_theorem(or(and(not(X1),X2),not(and(X2,implies(X1,not(X1))))))),inference(spm,[status(thm)],[289,14262,theory(equality)])).
% cnf(14304,plain,(is_a_theorem(or(and(not(X1),X2),implies(X2,and(X1,not(not(X1))))))),inference(rw,[status(thm)],[14294,261,theory(equality)])).
% cnf(18284,plain,(is_a_theorem(implies(X1,and(X1,not(not(X1)))))),inference(spm,[status(thm)],[2745,14304,theory(equality)])).
% cnf(18360,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,implies(X2,not(X2))),X1))),inference(spm,[status(thm)],[307,18284,theory(equality)])).
% cnf(18581,plain,(is_a_theorem(not(and(implies(X1,not(X1)),and(X1,X2))))),inference(spm,[status(thm)],[18360,374,theory(equality)])).
% cnf(18710,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(implies(X2,not(X2)),and(X2,X3)),X1))),inference(spm,[status(thm)],[270,18581,theory(equality)])).
% cnf(25610,plain,(is_a_theorem(implies(implies(X1,X2),or(X2,not(X1))))),inference(spm,[status(thm)],[2835,711,theory(equality)])).
% cnf(25630,plain,(is_a_theorem(or(X1,not(X2)))|~is_a_theorem(implies(X2,X1))),inference(spm,[status(thm)],[263,25610,theory(equality)])).
% cnf(25635,plain,(is_a_theorem(or(X1,not(and(X1,X2))))),inference(spm,[status(thm)],[362,25610,theory(equality)])).
% cnf(25764,plain,(is_a_theorem(or(X1,implies(X1,X2)))),inference(spm,[status(thm)],[25635,260,theory(equality)])).
% cnf(232970,plain,(is_a_theorem(implies(and(X1,X2),and(X1,X1)))),inference(spm,[status(thm)],[18710,2762,theory(equality)])).
% cnf(233200,plain,(is_a_theorem(or(and(X1,X1),not(and(X1,X2))))),inference(spm,[status(thm)],[25630,232970,theory(equality)])).
% cnf(233470,plain,(is_a_theorem(or(and(X1,X1),implies(X1,X2)))),inference(spm,[status(thm)],[233200,260,theory(equality)])).
% cnf(267991,plain,(is_a_theorem(or(and(not(X1),not(X1)),or(X1,X2)))),inference(spm,[status(thm)],[233470,268,theory(equality)])).
% cnf(268022,plain,(is_a_theorem(implies(or(X1,X1),or(X1,X2)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[267991,271,theory(equality)]),268,theory(equality)])).
% cnf(273502,plain,(is_a_theorem(or(or(X1,X2),not(or(X1,X1))))),inference(spm,[status(thm)],[25630,268022,theory(equality)])).
% cnf(273550,plain,(is_a_theorem(or(and(not(or(X1,X1)),X2),implies(X2,or(X1,X3))))),inference(spm,[status(thm)],[534,273502,theory(equality)])).
% cnf(357476,plain,(is_a_theorem(implies(implies(not(not(X1)),X2),not(and(not(X2),X1))))),inference(spm,[status(thm)],[2691,2834,theory(equality)])).
% cnf(358121,plain,(is_a_theorem(implies(or(not(X1),X2),not(and(not(X2),X1))))),inference(rw,[status(thm)],[357476,268,theory(equality)])).
% cnf(358321,plain,(is_a_theorem(not(and(not(X1),X2)))|~is_a_theorem(or(not(X2),X1))),inference(spm,[status(thm)],[263,358121,theory(equality)])).
% cnf(361794,plain,(is_a_theorem(not(and(not(implies(not(X1),X2)),X1)))),inference(spm,[status(thm)],[358321,25764,theory(equality)])).
% cnf(362219,plain,(is_a_theorem(not(and(not(or(X1,X2)),X1)))),inference(rw,[status(thm)],[361794,268,theory(equality)])).
% cnf(362632,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(not(or(X2,X3)),X2),X1))),inference(spm,[status(thm)],[270,362219,theory(equality)])).
% cnf(385701,plain,(is_a_theorem(implies(X1,or(X1,X2)))),inference(spm,[status(thm)],[362632,273550,theory(equality)])).
% cnf(386884,plain,($false),inference(rw,[status(thm)],[245,385701,theory(equality)])).
% cnf(386885,plain,($false),inference(cn,[status(thm)],[386884,theory(equality)])).
% cnf(386886,plain,($false),386885,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 12381
% # ...of these trivial : 3018
% # ...subsumed : 4502
% # ...remaining for further processing: 4861
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 94
% # Backward-rewritten : 405
% # Generated clauses : 259737
% # ...of the previous two non-trivial : 155790
% # Contextual simplify-reflections : 74
% # Paramodulations : 259737
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 4362
% # Positive orientable unit clauses: 3487
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 871
% # Current number of unprocessed clauses: 124533
% # ...number of literals in the above : 155697
% # Clause-clause subsumption calls (NU) : 94195
% # Rec. Clause-clause subsumption calls : 94195
% # Unit Clause-clause subsumption calls : 11176
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 636978
% # Indexed BW rewrite successes : 369
% # Backwards rewriting index: 1625 leaves, 7.47+/-29.809 terms/leaf
% # Paramod-from index: 121 leaves, 29.09+/-80.643 terms/leaf
% # Paramod-into index: 1589 leaves, 7.46+/-29.852 terms/leaf
% # -------------------------------------------------
% # User time : 9.920 s
% # System time : 0.348 s
% # Total time : 10.268 s
% # Maximum resident set size: 0 pages
% PrfWatch: 15.32 CPU 15.57 WC
% FINAL PrfWatch: 15.32 CPU 15.57 WC
% SZS output end Solution for /tmp/SystemOnTPTP7642/LCL509+1.tptp
%
%------------------------------------------------------------------------------