TSTP Solution File: LCL520+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL520+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 : art09.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:46:50 EST 2010
% Result : Theorem 6.07s
% Output : Solution 6.07s
% 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/SystemOnTPTP20076/LCL520+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20076/LCL520+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20076/LCL520+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 20172
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.92 CPU 2.02 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.92 CPU 4.03 WC
% # 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', 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(6, axiom,op_implies_or,file('/tmp/SRASS.s.p', principia_op_implies_or)).
% fof(14, axiom,op_or,file('/tmp/SRASS.s.p', rosser_op_or)).
% fof(15, axiom,op_implies_and,file('/tmp/SRASS.s.p', rosser_op_implies_and)).
% fof(16, axiom,op_equiv,file('/tmp/SRASS.s.p', rosser_op_equiv)).
% fof(17, axiom,substitution_of_equivalents,file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(18, axiom,op_and,file('/tmp/SRASS.s.p', principia_op_and)).
% fof(20, 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,(op_or=>![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),file('/tmp/SRASS.s.p', op_or)).
% fof(26, axiom,(op_and=>![X3]:![X4]:and(X3,X4)=not(or(not(X3),not(X4)))),file('/tmp/SRASS.s.p', op_and)).
% fof(30, axiom,(kn1<=>![X1]:is_a_theorem(implies(X1,and(X1,X1)))),file('/tmp/SRASS.s.p', kn1)).
% fof(31, axiom,(kn2<=>![X1]:![X2]:is_a_theorem(implies(and(X1,X2),X1))),file('/tmp/SRASS.s.p', kn2)).
% fof(32, axiom,(op_implies_or=>![X3]:![X4]:implies(X3,X4)=or(not(X3),X4)),file('/tmp/SRASS.s.p', op_implies_or)).
% fof(39, axiom,(kn3<=>![X1]:![X2]:![X6]:is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X6)),not(and(X6,X1)))))),file('/tmp/SRASS.s.p', kn3)).
% fof(40, axiom,(op_implies_and=>![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(41, axiom,(op_equiv=>![X3]:![X4]:equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))),file('/tmp/SRASS.s.p', op_equiv)).
% fof(42, axiom,(substitution_of_equivalents<=>![X3]:![X4]:(is_a_theorem(equiv(X3,X4))=>X3=X4)),file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(43, conjecture,r3,file('/tmp/SRASS.s.p', principia_r3)).
% fof(44, negated_conjecture,~(r3),inference(assume_negation,[status(cth)],[43])).
% fof(45, negated_conjecture,~(r3),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(46, 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(47, 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)],[46])).
% fof(48, 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)],[47])).
% fof(49, 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)],[48])).
% cnf(50,plain,(r3|~is_a_theorem(implies(or(esk1_0,esk2_0),or(esk2_0,esk1_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(56,plain,(op_implies_or),inference(split_conjunct,[status(thm)],[6])).
% cnf(99,plain,(op_or),inference(split_conjunct,[status(thm)],[14])).
% cnf(100,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[15])).
% cnf(101,plain,(op_equiv),inference(split_conjunct,[status(thm)],[16])).
% cnf(102,plain,(substitution_of_equivalents),inference(split_conjunct,[status(thm)],[17])).
% cnf(103,plain,(op_and),inference(split_conjunct,[status(thm)],[18])).
% fof(105, 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)],[20])).
% fof(106, 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)],[105])).
% fof(107, 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)],[106])).
% fof(108, 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)],[107])).
% fof(109, 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)],[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)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(fof_nnf,[status(thm)],[25])).
% fof(139, plain,(~(op_or)|![X5]:![X6]:or(X5,X6)=not(and(not(X5),not(X6)))),inference(variable_rename,[status(thm)],[138])).
% fof(140, plain,![X5]:![X6]:(or(X5,X6)=not(and(not(X5),not(X6)))|~(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(142, plain,(~(op_and)|![X3]:![X4]:and(X3,X4)=not(or(not(X3),not(X4)))),inference(fof_nnf,[status(thm)],[26])).
% fof(143, plain,(~(op_and)|![X5]:![X6]:and(X5,X6)=not(or(not(X5),not(X6)))),inference(variable_rename,[status(thm)],[142])).
% fof(144, plain,![X5]:![X6]:(and(X5,X6)=not(or(not(X5),not(X6)))|~(op_and)),inference(shift_quantors,[status(thm)],[143])).
% cnf(145,plain,(and(X1,X2)=not(or(not(X1),not(X2)))|~op_and),inference(split_conjunct,[status(thm)],[144])).
% fof(164, plain,((~(kn1)|![X1]:is_a_theorem(implies(X1,and(X1,X1))))&(?[X1]:~(is_a_theorem(implies(X1,and(X1,X1))))|kn1)),inference(fof_nnf,[status(thm)],[30])).
% fof(165, plain,((~(kn1)|![X2]:is_a_theorem(implies(X2,and(X2,X2))))&(?[X3]:~(is_a_theorem(implies(X3,and(X3,X3))))|kn1)),inference(variable_rename,[status(thm)],[164])).
% fof(166, plain,((~(kn1)|![X2]:is_a_theorem(implies(X2,and(X2,X2))))&(~(is_a_theorem(implies(esk37_0,and(esk37_0,esk37_0))))|kn1)),inference(skolemize,[status(esa)],[165])).
% fof(167, plain,![X2]:((is_a_theorem(implies(X2,and(X2,X2)))|~(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)|![X1]:![X2]:is_a_theorem(implies(and(X1,X2),X1)))&(?[X1]:?[X2]:~(is_a_theorem(implies(and(X1,X2),X1)))|kn2)),inference(fof_nnf,[status(thm)],[31])).
% fof(171, plain,((~(kn2)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3)))&(?[X5]:?[X6]:~(is_a_theorem(implies(and(X5,X6),X5)))|kn2)),inference(variable_rename,[status(thm)],[170])).
% fof(172, plain,((~(kn2)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3)))&(~(is_a_theorem(implies(and(esk38_0,esk39_0),esk38_0)))|kn2)),inference(skolemize,[status(esa)],[171])).
% fof(173, plain,![X3]:![X4]:((is_a_theorem(implies(and(X3,X4),X3))|~(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(176, plain,(~(op_implies_or)|![X3]:![X4]:implies(X3,X4)=or(not(X3),X4)),inference(fof_nnf,[status(thm)],[32])).
% fof(177, plain,(~(op_implies_or)|![X5]:![X6]:implies(X5,X6)=or(not(X5),X6)),inference(variable_rename,[status(thm)],[176])).
% fof(178, plain,![X5]:![X6]:(implies(X5,X6)=or(not(X5),X6)|~(op_implies_or)),inference(shift_quantors,[status(thm)],[177])).
% cnf(179,plain,(implies(X1,X2)=or(not(X1),X2)|~op_implies_or),inference(split_conjunct,[status(thm)],[178])).
% fof(216, plain,((~(kn3)|![X1]:![X2]:![X6]:is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X6)),not(and(X6,X1))))))&(?[X1]:?[X2]:?[X6]:~(is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X6)),not(and(X6,X1))))))|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)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(fof_nnf,[status(thm)],[40])).
% fof(223, plain,(~(op_implies_and)|![X5]:![X6]:implies(X5,X6)=not(and(X5,not(X6)))),inference(variable_rename,[status(thm)],[222])).
% fof(224, plain,![X5]:![X6]:(implies(X5,X6)=not(and(X5,not(X6)))|~(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])).
% fof(226, plain,(~(op_equiv)|![X3]:![X4]:equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))),inference(fof_nnf,[status(thm)],[41])).
% fof(227, plain,(~(op_equiv)|![X5]:![X6]:equiv(X5,X6)=and(implies(X5,X6),implies(X6,X5))),inference(variable_rename,[status(thm)],[226])).
% fof(228, plain,![X5]:![X6]:(equiv(X5,X6)=and(implies(X5,X6),implies(X6,X5))|~(op_equiv)),inference(shift_quantors,[status(thm)],[227])).
% cnf(229,plain,(equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv),inference(split_conjunct,[status(thm)],[228])).
% fof(230, 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)],[42])).
% fof(231, 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)],[230])).
% fof(232, plain,((~(substitution_of_equivalents)|![X5]:![X6]:(~(is_a_theorem(equiv(X5,X6)))|X5=X6))&((is_a_theorem(equiv(esk54_0,esk55_0))&~(esk54_0=esk55_0))|substitution_of_equivalents)),inference(skolemize,[status(esa)],[231])).
% fof(233, plain,![X5]:![X6]:(((~(is_a_theorem(equiv(X5,X6)))|X5=X6)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk54_0,esk55_0))&~(esk54_0=esk55_0))|substitution_of_equivalents)),inference(shift_quantors,[status(thm)],[232])).
% fof(234, plain,![X5]:![X6]:(((~(is_a_theorem(equiv(X5,X6)))|X5=X6)|~(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)],[233])).
% cnf(237,plain,(X1=X2|~substitution_of_equivalents|~is_a_theorem(equiv(X1,X2))),inference(split_conjunct,[status(thm)],[234])).
% cnf(238,negated_conjecture,(~r3),inference(split_conjunct,[status(thm)],[45])).
% cnf(247,plain,(X1=X2|$false|~is_a_theorem(equiv(X1,X2))),inference(rw,[status(thm)],[237,102,theory(equality)])).
% cnf(248,plain,(X1=X2|~is_a_theorem(equiv(X1,X2))),inference(cn,[status(thm)],[247,theory(equality)])).
% cnf(249,plain,(~is_a_theorem(implies(or(esk1_0,esk2_0),or(esk2_0,esk1_0)))),inference(sr,[status(thm)],[50,238,theory(equality)])).
% cnf(250,plain,(or(not(X1),X2)=implies(X1,X2)|$false),inference(rw,[status(thm)],[179,56,theory(equality)])).
% cnf(251,plain,(or(not(X1),X2)=implies(X1,X2)),inference(cn,[status(thm)],[250,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,100,theory(equality)])).
% cnf(260,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[259,theory(equality)])).
% cnf(261,plain,(or(implies(X1,X2),X3)=implies(and(X1,not(X2)),X3)),inference(spm,[status(thm)],[251,260,theory(equality)])).
% cnf(262,plain,(not(and(X1,implies(X2,X3)))=implies(X1,and(X2,not(X3)))),inference(spm,[status(thm)],[260,260,theory(equality)])).
% cnf(263,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(264,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[263,theory(equality)])).
% cnf(265,plain,(is_a_theorem(X1)|~is_a_theorem(and(X1,X2))),inference(spm,[status(thm)],[264,255,theory(equality)])).
% cnf(266,plain,(is_a_theorem(and(X1,X1))|~is_a_theorem(X1)),inference(spm,[status(thm)],[264,253,theory(equality)])).
% cnf(267,plain,(not(implies(X1,not(X2)))=and(X1,X2)|~op_and),inference(rw,[status(thm)],[145,251,theory(equality)])).
% cnf(268,plain,(not(implies(X1,not(X2)))=and(X1,X2)|$false),inference(rw,[status(thm)],[267,103,theory(equality)])).
% cnf(269,plain,(not(implies(X1,not(X2)))=and(X1,X2)),inference(cn,[status(thm)],[268,theory(equality)])).
% cnf(270,plain,(or(and(X1,X2),X3)=implies(implies(X1,not(X2)),X3)),inference(spm,[status(thm)],[251,269,theory(equality)])).
% cnf(271,plain,(not(and(X1,and(X2,X3)))=implies(X1,implies(X2,not(X3)))),inference(spm,[status(thm)],[260,269,theory(equality)])).
% cnf(272,plain,(not(implies(X1,and(X2,X3)))=and(X1,implies(X2,not(X3)))),inference(spm,[status(thm)],[269,269,theory(equality)])).
% cnf(274,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[141,260,theory(equality)])).
% cnf(275,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[274,99,theory(equality)])).
% cnf(276,plain,(implies(not(X1),X2)=or(X1,X2)),inference(cn,[status(thm)],[275,theory(equality)])).
% cnf(278,plain,(not(or(X1,not(X2)))=and(not(X1),X2)),inference(spm,[status(thm)],[269,276,theory(equality)])).
% cnf(279,plain,(is_a_theorem(X1)|~is_a_theorem(or(X2,X1))|~is_a_theorem(not(X2))),inference(spm,[status(thm)],[264,276,theory(equality)])).
% cnf(280,plain,(implies(implies(X1,X2),X3)=or(and(X1,not(X2)),X3)),inference(spm,[status(thm)],[276,260,theory(equality)])).
% cnf(281,plain,(implies(and(X1,X2),X3)=or(implies(X1,not(X2)),X3)),inference(spm,[status(thm)],[276,269,theory(equality)])).
% cnf(289,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)|$false),inference(rw,[status(thm)],[229,101,theory(equality)])).
% cnf(290,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)),inference(cn,[status(thm)],[289,theory(equality)])).
% cnf(294,plain,(and(or(X1,X2),implies(X2,not(X1)))=equiv(not(X1),X2)),inference(spm,[status(thm)],[290,276,theory(equality)])).
% cnf(296,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|~kn3),inference(rw,[status(thm)],[221,276,theory(equality)])).
% cnf(297,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|$false),inference(rw,[status(thm)],[296,55,theory(equality)])).
% cnf(298,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))),inference(cn,[status(thm)],[297,theory(equality)])).
% cnf(308,plain,(not(or(implies(X1,X2),not(X3)))=and(and(X1,not(X2)),X3)),inference(spm,[status(thm)],[269,261,theory(equality)])).
% cnf(317,plain,(is_a_theorem(equiv(X1,X1))|~is_a_theorem(implies(X1,X1))),inference(spm,[status(thm)],[266,290,theory(equality)])).
% cnf(333,plain,(not(or(X1,and(not(X2),X3)))=and(not(X1),or(X2,not(X3)))),inference(spm,[status(thm)],[278,278,theory(equality)])).
% cnf(337,plain,(not(implies(X1,not(X2)))=and(not(not(X1)),X2)),inference(spm,[status(thm)],[278,251,theory(equality)])).
% cnf(338,plain,(and(X1,X2)=and(not(not(X1)),X2)),inference(rw,[status(thm)],[337,269,theory(equality)])).
% cnf(346,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)],[279,262,theory(equality)])).
% cnf(349,plain,(not(and(X1,or(X2,X3)))=implies(X1,and(not(X2),not(X3)))),inference(spm,[status(thm)],[262,276,theory(equality)])).
% cnf(356,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(and(X1,X2))),inference(spm,[status(thm)],[265,338,theory(equality)])).
% cnf(357,plain,(is_a_theorem(implies(not(not(X1)),and(X1,not(not(X1)))))),inference(spm,[status(thm)],[253,338,theory(equality)])).
% cnf(358,plain,(is_a_theorem(and(X1,not(not(X1))))|~is_a_theorem(not(not(X1)))),inference(spm,[status(thm)],[266,338,theory(equality)])).
% cnf(371,plain,(is_a_theorem(implies(X1,and(X1,not(not(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[357,276,theory(equality)]),251,theory(equality)])).
% cnf(374,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[356,266,theory(equality)])).
% cnf(378,plain,(is_a_theorem(not(and(X1,X2)))|~is_a_theorem(implies(X1,not(X2)))),inference(spm,[status(thm)],[374,269,theory(equality)])).
% cnf(401,plain,(is_a_theorem(not(and(and(not(X1),X2),X1)))),inference(spm,[status(thm)],[378,255,theory(equality)])).
% cnf(403,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(and(not(X2),X3),X2),X1))),inference(spm,[status(thm)],[279,401,theory(equality)])).
% cnf(419,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,not(X3)),not(and(X3,X1)))))),inference(rw,[status(thm)],[298,270,theory(equality)])).
% cnf(423,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(and(not(X2),X3),not(X2)),X1))),inference(rw,[status(thm)],[403,270,theory(equality)])).
% cnf(449,plain,(is_a_theorem(and(X1,not(not(X1))))|~is_a_theorem(X1)),inference(spm,[status(thm)],[358,374,theory(equality)])).
% cnf(692,plain,(implies(implies(X1,not(not(X2))),X3)=implies(implies(X1,X2),X3)),inference(rw,[status(thm)],[280,270,theory(equality)])).
% cnf(717,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(and(not(not(X2)),X3),X2),X1))),inference(spm,[status(thm)],[423,692,theory(equality)])).
% cnf(737,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(and(X2,X3),X2),X1))),inference(rw,[status(thm)],[717,338,theory(equality)])).
% cnf(780,plain,(or(implies(X1,and(not(X2),X3)),X4)=implies(and(X1,or(X2,not(X3))),X4)),inference(spm,[status(thm)],[281,278,theory(equality)])).
% cnf(953,plain,(not(implies(or(X1,X2),and(X2,X1)))=equiv(not(X1),X2)),inference(rw,[status(thm)],[294,272,theory(equality)])).
% cnf(1093,plain,(and(and(X1,not(X2)),X3)=and(not(implies(X1,X2)),X3)),inference(rw,[status(thm)],[308,278,theory(equality)])).
% cnf(1107,plain,(is_a_theorem(and(X1,not(X2)))|~is_a_theorem(and(not(implies(X1,X2)),X3))),inference(spm,[status(thm)],[265,1093,theory(equality)])).
% cnf(1168,plain,(is_a_theorem(and(X1,not(X2)))|~is_a_theorem(not(implies(X1,X2)))),inference(spm,[status(thm)],[1107,449,theory(equality)])).
% cnf(3221,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,not(implies(X3,X4))),X1))|~is_a_theorem(implies(X2,and(X3,not(X4))))),inference(rw,[status(thm)],[346,270,theory(equality)])).
% cnf(3239,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,not(implies(X2,not(X2)))),X1))),inference(spm,[status(thm)],[3221,371,theory(equality)])).
% cnf(3250,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,and(X2,X2)),X1))),inference(rw,[status(thm)],[3239,269,theory(equality)])).
% cnf(4255,plain,(is_a_theorem(and(X1,not(and(not(X2),not(X3)))))|~is_a_theorem(not(not(and(X1,or(X2,X3)))))),inference(spm,[status(thm)],[1168,349,theory(equality)])).
% cnf(4354,plain,(is_a_theorem(and(X1,or(X2,X3)))|~is_a_theorem(not(not(and(X1,or(X2,X3)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[4255,260,theory(equality)]),276,theory(equality)])).
% cnf(5585,plain,(is_a_theorem(and(X1,implies(X2,X3)))|~is_a_theorem(not(not(and(X1,implies(X2,X3)))))),inference(spm,[status(thm)],[4354,251,theory(equality)])).
% cnf(5600,plain,(is_a_theorem(and(X1,implies(X2,X3)))|~is_a_theorem(not(implies(X1,and(X2,not(X3)))))),inference(rw,[status(thm)],[5585,262,theory(equality)])).
% cnf(5904,plain,(is_a_theorem(and(or(not(X1),X2),implies(X2,X1)))|~is_a_theorem(equiv(not(not(X1)),X2))),inference(spm,[status(thm)],[5600,953,theory(equality)])).
% cnf(5916,plain,(is_a_theorem(equiv(X1,X2))|~is_a_theorem(equiv(not(not(X1)),X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5904,251,theory(equality)]),290,theory(equality)])).
% cnf(7664,plain,(is_a_theorem(implies(implies(X1,not(X2)),not(and(X2,and(X1,X3)))))),inference(spm,[status(thm)],[737,419,theory(equality)])).
% cnf(7668,plain,(is_a_theorem(implies(implies(and(X1,X1),not(X2)),not(and(X2,X1))))),inference(spm,[status(thm)],[3250,419,theory(equality)])).
% cnf(7712,plain,(is_a_theorem(implies(implies(X1,not(X2)),implies(X2,implies(X1,not(X3)))))),inference(rw,[status(thm)],[7664,271,theory(equality)])).
% cnf(7758,plain,(is_a_theorem(implies(implies(X1,not(not(X2))),or(X2,implies(X1,not(X3)))))),inference(spm,[status(thm)],[7712,276,theory(equality)])).
% cnf(7789,plain,(is_a_theorem(implies(implies(X1,X2),or(X2,implies(X1,not(X3)))))),inference(rw,[status(thm)],[7758,692,theory(equality)])).
% cnf(7882,plain,(is_a_theorem(not(and(X1,not(X1))))),inference(spm,[status(thm)],[737,7668,theory(equality)])).
% cnf(7921,plain,(is_a_theorem(implies(X1,X1))),inference(rw,[status(thm)],[7882,260,theory(equality)])).
% cnf(7963,plain,(is_a_theorem(not(and(not(X1),X1)))),inference(spm,[status(thm)],[378,7921,theory(equality)])).
% cnf(7985,plain,(is_a_theorem(equiv(X1,X1))|$false),inference(rw,[status(thm)],[317,7921,theory(equality)])).
% cnf(7986,plain,(is_a_theorem(equiv(X1,X1))),inference(cn,[status(thm)],[7985,theory(equality)])).
% cnf(8009,plain,(is_a_theorem(equiv(X1,not(not(X1))))),inference(spm,[status(thm)],[5916,7986,theory(equality)])).
% cnf(8416,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(not(X2),X2),X1))),inference(spm,[status(thm)],[279,7963,theory(equality)])).
% cnf(8439,plain,(is_a_theorem(X1)|~is_a_theorem(implies(or(X2,not(X2)),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[8416,270,theory(equality)]),276,theory(equality)])).
% cnf(8530,plain,(X1=not(not(X1))),inference(spm,[status(thm)],[248,8009,theory(equality)])).
% cnf(8589,plain,(not(and(X1,X2))=implies(X1,not(X2))),inference(spm,[status(thm)],[260,8530,theory(equality)])).
% cnf(8590,plain,(not(implies(X1,X2))=and(X1,not(X2))),inference(spm,[status(thm)],[269,8530,theory(equality)])).
% cnf(9094,plain,(is_a_theorem(X1)|~is_a_theorem(implies(or(not(X2),X2),X1))),inference(spm,[status(thm)],[8439,8530,theory(equality)])).
% cnf(9113,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,X2),X1))),inference(rw,[status(thm)],[9094,251,theory(equality)])).
% cnf(9136,plain,(is_a_theorem(implies(X1,implies(not(X1),not(X2))))),inference(spm,[status(thm)],[9113,7712,theory(equality)])).
% cnf(9142,plain,(is_a_theorem(implies(X1,or(X1,not(X2))))),inference(rw,[status(thm)],[9136,276,theory(equality)])).
% cnf(9157,plain,(is_a_theorem(or(X1,not(X2)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[264,9142,theory(equality)])).
% cnf(9367,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(X1)),inference(spm,[status(thm)],[9157,8530,theory(equality)])).
% cnf(10337,plain,(is_a_theorem(implies(implies(and(X1,X1),not(X2)),implies(X2,not(X1))))),inference(rw,[status(thm)],[7668,8589,theory(equality)])).
% cnf(10346,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,not(X3)),implies(X3,not(X1)))))),inference(rw,[status(thm)],[419,8589,theory(equality)])).
% cnf(10991,plain,(is_a_theorem(implies(and(X1,or(X2,not(X3))),X4))|~is_a_theorem(implies(X1,and(not(X2),X3)))),inference(spm,[status(thm)],[9367,780,theory(equality)])).
% cnf(40807,plain,(is_a_theorem(implies(implies(X1,X2),or(X2,implies(X1,X3))))),inference(spm,[status(thm)],[7789,8530,theory(equality)])).
% cnf(40924,plain,(is_a_theorem(implies(implies(not(X1),X2),or(X2,or(X1,X3))))),inference(spm,[status(thm)],[40807,276,theory(equality)])).
% cnf(40955,plain,(is_a_theorem(implies(or(X1,X2),or(X2,or(X1,X3))))),inference(rw,[status(thm)],[40924,276,theory(equality)])).
% cnf(76613,plain,(is_a_theorem(implies(X1,not(X2)))|~is_a_theorem(implies(and(X2,X2),not(X1)))),inference(spm,[status(thm)],[264,10337,theory(equality)])).
% cnf(77700,plain,(is_a_theorem(implies(implies(X1,not(X2)),implies(X2,not(X1))))),inference(spm,[status(thm)],[9113,10346,theory(equality)])).
% cnf(77797,plain,(is_a_theorem(implies(X1,not(X2)))|~is_a_theorem(implies(X2,not(X1)))),inference(spm,[status(thm)],[264,77700,theory(equality)])).
% cnf(78475,plain,(is_a_theorem(implies(X1,not(not(X2))))|~is_a_theorem(implies(not(implies(not(X2),X2)),not(X1)))),inference(spm,[status(thm)],[76613,8590,theory(equality)])).
% cnf(78573,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(not(implies(not(X2),X2)),not(X1)))),inference(rw,[status(thm)],[78475,8530,theory(equality)])).
% cnf(78574,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(or(or(X2,X2),not(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[78573,276,theory(equality)]),276,theory(equality)])).
% cnf(82634,plain,(is_a_theorem(implies(not(X1),X2))|~is_a_theorem(or(or(X2,X2),X1))),inference(spm,[status(thm)],[78574,8530,theory(equality)])).
% cnf(82720,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(or(X2,X2),X1))),inference(rw,[status(thm)],[82634,276,theory(equality)])).
% cnf(100952,plain,(is_a_theorem(implies(not(X1),not(X2)))|~is_a_theorem(implies(X2,X1))),inference(spm,[status(thm)],[77797,8530,theory(equality)])).
% cnf(100964,plain,(is_a_theorem(implies(X1,not(not(X2))))|~is_a_theorem(or(X2,not(X1)))),inference(spm,[status(thm)],[77797,276,theory(equality)])).
% cnf(101126,plain,(is_a_theorem(or(X1,not(X2)))|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[100952,276,theory(equality)])).
% cnf(101127,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(or(X2,not(X1)))),inference(rw,[status(thm)],[100964,8530,theory(equality)])).
% cnf(101277,plain,(is_a_theorem(implies(not(X1),X2))|~is_a_theorem(or(X2,X1))),inference(spm,[status(thm)],[101127,8530,theory(equality)])).
% cnf(101454,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X2,X1))),inference(rw,[status(thm)],[101277,276,theory(equality)])).
% cnf(102518,plain,(is_a_theorem(or(implies(X1,not(X2)),not(implies(X2,not(X1)))))),inference(spm,[status(thm)],[101126,77700,theory(equality)])).
% cnf(102533,plain,(is_a_theorem(or(or(X1,or(X2,X3)),not(or(X2,X1))))),inference(spm,[status(thm)],[101126,40955,theory(equality)])).
% cnf(102872,plain,(is_a_theorem(implies(and(X1,X2),and(X2,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[102518,269,theory(equality)]),281,theory(equality)])).
% cnf(106558,plain,(is_a_theorem(or(not(or(X1,or(X1,X2))),or(X1,X2)))),inference(spm,[status(thm)],[82720,102533,theory(equality)])).
% cnf(106595,plain,(is_a_theorem(implies(or(X1,or(X1,X2)),or(X1,X2)))),inference(rw,[status(thm)],[106558,251,theory(equality)])).
% cnf(106620,plain,(is_a_theorem(or(or(X1,X2),not(or(X1,or(X1,X2)))))),inference(spm,[status(thm)],[101126,106595,theory(equality)])).
% cnf(107715,plain,(is_a_theorem(or(not(or(X1,or(X1,X1))),X1))),inference(spm,[status(thm)],[82720,106620,theory(equality)])).
% cnf(107752,plain,(is_a_theorem(implies(or(X1,or(X1,X1)),X1))),inference(rw,[status(thm)],[107715,251,theory(equality)])).
% cnf(107793,plain,(is_a_theorem(X1)|~is_a_theorem(or(X1,or(X1,X1)))),inference(spm,[status(thm)],[264,107752,theory(equality)])).
% cnf(128043,plain,(is_a_theorem(implies(and(and(X1,not(X2)),or(X2,not(X1))),X3))),inference(spm,[status(thm)],[10991,102872,theory(equality)])).
% cnf(128137,plain,(is_a_theorem(or(or(implies(X1,X2),and(not(X2),X1)),X3))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[128043,8590,theory(equality)]),333,theory(equality)]),276,theory(equality)])).
% cnf(128153,plain,(is_a_theorem(or(implies(X1,X2),and(not(X2),X1)))),inference(spm,[status(thm)],[107793,128137,theory(equality)])).
% cnf(128235,plain,(is_a_theorem(or(and(not(X1),X2),implies(X2,X1)))),inference(spm,[status(thm)],[101454,128153,theory(equality)])).
% cnf(128281,plain,(is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[128235,270,theory(equality)]),276,theory(equality)])).
% cnf(128314,plain,(is_a_theorem(implies(or(X1,not(not(X2))),or(X2,X1)))),inference(spm,[status(thm)],[128281,276,theory(equality)])).
% cnf(128362,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))),inference(rw,[status(thm)],[128314,8530,theory(equality)])).
% cnf(129477,plain,($false),inference(rw,[status(thm)],[249,128362,theory(equality)])).
% cnf(129478,plain,($false),inference(cn,[status(thm)],[129477,theory(equality)])).
% cnf(129479,plain,($false),129478,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5499
% # ...of these trivial : 539
% # ...subsumed : 2898
% # ...remaining for further processing: 2062
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 44
% # Backward-rewritten : 452
% # Generated clauses : 85658
% # ...of the previous two non-trivial : 62099
% # Contextual simplify-reflections : 48
% # Paramodulations : 85658
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1566
% # Positive orientable unit clauses: 1018
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 4
% # Non-unit-clauses : 539
% # Current number of unprocessed clauses: 43147
% # ...number of literals in the above : 61261
% # Clause-clause subsumption calls (NU) : 43451
% # Rec. Clause-clause subsumption calls : 43451
% # Unit Clause-clause subsumption calls : 3234
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 63045
% # Indexed BW rewrite successes : 347
% # Backwards rewriting index: 799 leaves, 4.72+/-12.650 terms/leaf
% # Paramod-from index: 121 leaves, 8.81+/-21.838 terms/leaf
% # Paramod-into index: 762 leaves, 4.63+/-12.306 terms/leaf
% # -------------------------------------------------
% # User time : 3.291 s
% # System time : 0.124 s
% # Total time : 3.415 s
% # Maximum resident set size: 0 pages
% PrfWatch: 5.20 CPU 5.33 WC
% FINAL PrfWatch: 5.20 CPU 5.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP20076/LCL520+1.tptp
%
%------------------------------------------------------------------------------