TSTP Solution File: LCL504+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL504+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 : art05.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:07 EST 2010
% Result : Theorem 26.84s
% Output : Solution 26.84s
% 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/SystemOnTPTP31229/LCL504+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31229/LCL504+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31229/LCL504+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 31325
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% PrfWatch: 3.90 CPU 4.01 WC
% PrfWatch: 5.89 CPU 6.02 WC
% PrfWatch: 7.51 CPU 8.02 WC
% PrfWatch: 9.15 CPU 10.03 WC
% PrfWatch: 11.15 CPU 12.03 WC
% PrfWatch: 13.14 CPU 14.04 WC
% PrfWatch: 15.13 CPU 16.04 WC
% PrfWatch: 17.12 CPU 18.05 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 19.11 CPU 20.05 WC
% PrfWatch: 21.11 CPU 22.06 WC
% PrfWatch: 22.72 CPU 24.06 WC
% PrfWatch: 24.38 CPU 26.07 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,(implies_2<=>![X1]:![X2]:is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))),file('/tmp/SRASS.s.p', implies_2)).
% 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_and,file('/tmp/SRASS.s.p', rosser_op_implies_and)).
% fof(7, axiom,op_equiv,file('/tmp/SRASS.s.p', rosser_op_equiv)).
% fof(8, axiom,substitution_of_equivalents,file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(11, 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(15, axiom,op_or,file('/tmp/SRASS.s.p', rosser_op_or)).
% fof(23, axiom,(kn1<=>![X4]:is_a_theorem(implies(X4,and(X4,X4)))),file('/tmp/SRASS.s.p', kn1)).
% fof(24, axiom,(kn2<=>![X4]:![X5]:is_a_theorem(implies(and(X4,X5),X4))),file('/tmp/SRASS.s.p', kn2)).
% fof(30, axiom,(op_or=>![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_or)).
% fof(32, axiom,(substitution_of_equivalents<=>![X1]:![X2]:(is_a_theorem(equiv(X1,X2))=>X1=X2)),file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% 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(42, axiom,(op_equiv=>![X1]:![X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))),file('/tmp/SRASS.s.p', op_equiv)).
% fof(43, conjecture,implies_2,file('/tmp/SRASS.s.p', hilbert_implies_2)).
% fof(44, negated_conjecture,~(implies_2),inference(assume_negation,[status(cth)],[43])).
% fof(45, negated_conjecture,~(implies_2),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(46, plain,((~(implies_2)|![X1]:![X2]:is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))))&(?[X1]:?[X2]:~(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))))|implies_2)),inference(fof_nnf,[status(thm)],[1])).
% fof(47, plain,((~(implies_2)|![X3]:![X4]:is_a_theorem(implies(implies(X3,implies(X3,X4)),implies(X3,X4))))&(?[X5]:?[X6]:~(is_a_theorem(implies(implies(X5,implies(X5,X6)),implies(X5,X6))))|implies_2)),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,((~(implies_2)|![X3]:![X4]:is_a_theorem(implies(implies(X3,implies(X3,X4)),implies(X3,X4))))&(~(is_a_theorem(implies(implies(esk1_0,implies(esk1_0,esk2_0)),implies(esk1_0,esk2_0))))|implies_2)),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X3]:![X4]:((is_a_theorem(implies(implies(X3,implies(X3,X4)),implies(X3,X4)))|~(implies_2))&(~(is_a_theorem(implies(implies(esk1_0,implies(esk1_0,esk2_0)),implies(esk1_0,esk2_0))))|implies_2)),inference(shift_quantors,[status(thm)],[48])).
% cnf(50,plain,(implies_2|~is_a_theorem(implies(implies(esk1_0,implies(esk1_0,esk2_0)),implies(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(56,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[6])).
% cnf(57,plain,(op_equiv),inference(split_conjunct,[status(thm)],[7])).
% cnf(58,plain,(substitution_of_equivalents),inference(split_conjunct,[status(thm)],[8])).
% fof(61, 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)],[11])).
% fof(62, 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)],[61])).
% fof(63, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(((is_a_theorem(esk3_0)&is_a_theorem(implies(esk3_0,esk4_0)))&~(is_a_theorem(esk4_0)))|modus_ponens)),inference(skolemize,[status(esa)],[62])).
% fof(64, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk3_0)&is_a_theorem(implies(esk3_0,esk4_0)))&~(is_a_theorem(esk4_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[63])).
% fof(65, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk3_0)|modus_ponens)&(is_a_theorem(implies(esk3_0,esk4_0))|modus_ponens))&(~(is_a_theorem(esk4_0))|modus_ponens))),inference(distribute,[status(thm)],[64])).
% cnf(69,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[65])).
% cnf(88,plain,(op_or),inference(split_conjunct,[status(thm)],[15])).
% fof(126, 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)],[23])).
% fof(127, 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)],[126])).
% fof(128, plain,((~(kn1)|![X5]:is_a_theorem(implies(X5,and(X5,X5))))&(~(is_a_theorem(implies(esk26_0,and(esk26_0,esk26_0))))|kn1)),inference(skolemize,[status(esa)],[127])).
% fof(129, plain,![X5]:((is_a_theorem(implies(X5,and(X5,X5)))|~(kn1))&(~(is_a_theorem(implies(esk26_0,and(esk26_0,esk26_0))))|kn1)),inference(shift_quantors,[status(thm)],[128])).
% cnf(131,plain,(is_a_theorem(implies(X1,and(X1,X1)))|~kn1),inference(split_conjunct,[status(thm)],[129])).
% fof(132, 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)],[24])).
% fof(133, 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)],[132])).
% fof(134, plain,((~(kn2)|![X6]:![X7]:is_a_theorem(implies(and(X6,X7),X6)))&(~(is_a_theorem(implies(and(esk27_0,esk28_0),esk27_0)))|kn2)),inference(skolemize,[status(esa)],[133])).
% fof(135, plain,![X6]:![X7]:((is_a_theorem(implies(and(X6,X7),X6))|~(kn2))&(~(is_a_theorem(implies(and(esk27_0,esk28_0),esk27_0)))|kn2)),inference(shift_quantors,[status(thm)],[134])).
% cnf(137,plain,(is_a_theorem(implies(and(X1,X2),X1))|~kn2),inference(split_conjunct,[status(thm)],[135])).
% fof(168, plain,(~(op_or)|![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[30])).
% fof(169, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[168])).
% fof(170, plain,![X3]:![X4]:(or(X3,X4)=not(and(not(X3),not(X4)))|~(op_or)),inference(shift_quantors,[status(thm)],[169])).
% cnf(171,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[170])).
% fof(176, plain,((~(substitution_of_equivalents)|![X1]:![X2]:(~(is_a_theorem(equiv(X1,X2)))|X1=X2))&(?[X1]:?[X2]:(is_a_theorem(equiv(X1,X2))&~(X1=X2))|substitution_of_equivalents)),inference(fof_nnf,[status(thm)],[32])).
% fof(177, plain,((~(substitution_of_equivalents)|![X3]:![X4]:(~(is_a_theorem(equiv(X3,X4)))|X3=X4))&(?[X5]:?[X6]:(is_a_theorem(equiv(X5,X6))&~(X5=X6))|substitution_of_equivalents)),inference(variable_rename,[status(thm)],[176])).
% fof(178, plain,((~(substitution_of_equivalents)|![X3]:![X4]:(~(is_a_theorem(equiv(X3,X4)))|X3=X4))&((is_a_theorem(equiv(esk40_0,esk41_0))&~(esk40_0=esk41_0))|substitution_of_equivalents)),inference(skolemize,[status(esa)],[177])).
% fof(179, plain,![X3]:![X4]:(((~(is_a_theorem(equiv(X3,X4)))|X3=X4)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk40_0,esk41_0))&~(esk40_0=esk41_0))|substitution_of_equivalents)),inference(shift_quantors,[status(thm)],[178])).
% fof(180, plain,![X3]:![X4]:(((~(is_a_theorem(equiv(X3,X4)))|X3=X4)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk40_0,esk41_0))|substitution_of_equivalents)&(~(esk40_0=esk41_0)|substitution_of_equivalents))),inference(distribute,[status(thm)],[179])).
% cnf(183,plain,(X1=X2|~substitution_of_equivalents|~is_a_theorem(equiv(X1,X2))),inference(split_conjunct,[status(thm)],[180])).
% fof(220, 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(221, 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)],[220])).
% fof(222, 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(esk53_0,esk54_0),implies(not(and(esk54_0,esk55_0)),not(and(esk55_0,esk53_0))))))|kn3)),inference(skolemize,[status(esa)],[221])).
% fof(223, 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(esk53_0,esk54_0),implies(not(and(esk54_0,esk55_0)),not(and(esk55_0,esk53_0))))))|kn3)),inference(shift_quantors,[status(thm)],[222])).
% cnf(225,plain,(is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))|~kn3),inference(split_conjunct,[status(thm)],[223])).
% fof(226, plain,(~(op_implies_and)|![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),inference(fof_nnf,[status(thm)],[40])).
% fof(227, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(variable_rename,[status(thm)],[226])).
% fof(228, plain,![X3]:![X4]:(implies(X3,X4)=not(and(X3,not(X4)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[227])).
% cnf(229,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[228])).
% fof(234, plain,(~(op_equiv)|![X1]:![X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))),inference(fof_nnf,[status(thm)],[42])).
% fof(235, plain,(~(op_equiv)|![X3]:![X4]:equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))),inference(variable_rename,[status(thm)],[234])).
% fof(236, plain,![X3]:![X4]:(equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))|~(op_equiv)),inference(shift_quantors,[status(thm)],[235])).
% cnf(237,plain,(equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv),inference(split_conjunct,[status(thm)],[236])).
% cnf(238,negated_conjecture,(~implies_2),inference(split_conjunct,[status(thm)],[45])).
% cnf(249,plain,(X1=X2|$false|~is_a_theorem(equiv(X1,X2))),inference(rw,[status(thm)],[183,58,theory(equality)])).
% cnf(250,plain,(X1=X2|~is_a_theorem(equiv(X1,X2))),inference(cn,[status(thm)],[249,theory(equality)])).
% cnf(251,plain,(is_a_theorem(implies(X1,and(X1,X1)))|$false),inference(rw,[status(thm)],[131,53,theory(equality)])).
% cnf(252,plain,(is_a_theorem(implies(X1,and(X1,X1)))),inference(cn,[status(thm)],[251,theory(equality)])).
% cnf(253,plain,(is_a_theorem(implies(and(X1,X2),X1))|$false),inference(rw,[status(thm)],[137,54,theory(equality)])).
% cnf(254,plain,(is_a_theorem(implies(and(X1,X2),X1))),inference(cn,[status(thm)],[253,theory(equality)])).
% cnf(258,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[229,56,theory(equality)])).
% cnf(259,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[258,theory(equality)])).
% cnf(260,plain,(not(and(X1,implies(X2,X3)))=implies(X1,and(X2,not(X3)))),inference(spm,[status(thm)],[259,259,theory(equality)])).
% cnf(261,plain,(~is_a_theorem(implies(implies(esk1_0,implies(esk1_0,esk2_0)),implies(esk1_0,esk2_0)))),inference(sr,[status(thm)],[50,238,theory(equality)])).
% cnf(262,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[69,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(265,plain,(is_a_theorem(and(X1,X1))|~is_a_theorem(X1)),inference(spm,[status(thm)],[263,252,theory(equality)])).
% cnf(266,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[171,259,theory(equality)])).
% cnf(267,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[266,88,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)],[252,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,259,theory(equality)])).
% cnf(279,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)|$false),inference(rw,[status(thm)],[237,57,theory(equality)])).
% cnf(280,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)),inference(cn,[status(thm)],[279,theory(equality)])).
% cnf(284,plain,(and(or(X1,X2),implies(X2,not(X1)))=equiv(not(X1),X2)),inference(spm,[status(thm)],[280,268,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)],[225,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,259,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,259,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,260,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,254,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,252,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(361,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)],[361,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,254,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,259,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)],[361,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,259,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(2823,plain,(is_a_theorem(not(and(X1,and(not(X1),X2))))),inference(spm,[status(thm)],[2745,374,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(2845,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[263,2834,theory(equality)])).
% cnf(2854,plain,(is_a_theorem(not(implies(X1,X2)))|~is_a_theorem(and(X1,not(X2)))),inference(spm,[status(thm)],[2845,259,theory(equality)])).
% cnf(2856,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,and(not(X2),X3)),X1))),inference(spm,[status(thm)],[270,2823,theory(equality)])).
% cnf(2880,plain,(is_a_theorem(X1)|~is_a_theorem(implies(or(implies(X2,X3),and(X2,not(X3))),X1))),inference(spm,[status(thm)],[2835,259,theory(equality)])).
% cnf(2883,plain,(is_a_theorem(not(not(or(not(X1),X1))))),inference(spm,[status(thm)],[2835,2834,theory(equality)])).
% cnf(3493,plain,(is_a_theorem(not(and(and(not(X1),X2),and(X1,X3))))),inference(spm,[status(thm)],[2856,374,theory(equality)])).
% cnf(3546,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(and(not(X2),X3),and(X2,X4)),X1))),inference(spm,[status(thm)],[270,3493,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(4357,plain,(is_a_theorem(and(X1,X2))|~is_a_theorem(and(X2,not(not(X1))))),inference(spm,[status(thm)],[263,4332,theory(equality)])).
% cnf(4371,plain,(is_a_theorem(and(X1,not(not(X1))))|~is_a_theorem(not(not(X1)))),inference(spm,[status(thm)],[4357,265,theory(equality)])).
% cnf(4374,plain,(is_a_theorem(and(X1,not(not(X1))))|~is_a_theorem(X1)),inference(spm,[status(thm)],[4371,2845,theory(equality)])).
% cnf(4382,plain,(is_a_theorem(and(or(not(X1),X1),not(not(or(not(X1),X1)))))),inference(spm,[status(thm)],[4371,2883,theory(equality)])).
% cnf(4407,plain,(is_a_theorem(not(implies(X1,not(X1))))|~is_a_theorem(X1)),inference(spm,[status(thm)],[2854,4374,theory(equality)])).
% cnf(4448,plain,(is_a_theorem(X1)|~is_a_theorem(or(implies(X2,not(X2)),X1))|~is_a_theorem(X2)),inference(spm,[status(thm)],[270,4407,theory(equality)])).
% cnf(5192,plain,(is_a_theorem(or(and(and(X1,not(X2)),X3),implies(X3,implies(X1,X2))))),inference(spm,[status(thm)],[2880,294,theory(equality)])).
% cnf(7260,plain,(is_a_theorem(implies(and(X1,X2),implies(not(X1),X3)))),inference(spm,[status(thm)],[3546,5192,theory(equality)])).
% cnf(7263,plain,(is_a_theorem(implies(and(X1,X2),or(X1,X3)))),inference(rw,[status(thm)],[7260,268,theory(equality)])).
% cnf(7264,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(and(X1,X3))),inference(spm,[status(thm)],[263,7263,theory(equality)])).
% cnf(7296,plain,(is_a_theorem(or(or(not(X1),X1),X2))),inference(spm,[status(thm)],[7264,4382,theory(equality)])).
% cnf(7310,plain,(is_a_theorem(or(and(X1,X2),implies(X2,or(not(X3),X3))))),inference(spm,[status(thm)],[534,7296,theory(equality)])).
% cnf(8302,plain,(is_a_theorem(implies(X1,or(not(X2),X2)))),inference(spm,[status(thm)],[2745,7310,theory(equality)])).
% cnf(8348,plain,(is_a_theorem(or(X1,or(not(X2),X2)))),inference(spm,[status(thm)],[8302,268,theory(equality)])).
% cnf(8504,plain,(is_a_theorem(or(and(or(not(X1),X1),X2),implies(X2,X3)))),inference(spm,[status(thm)],[534,8348,theory(equality)])).
% cnf(13182,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(14245,plain,(is_a_theorem(or(and(X1,not(not(X1))),not(X1)))),inference(spm,[status(thm)],[13182,4332,theory(equality)])).
% cnf(14266,plain,(is_a_theorem(implies(implies(X1,not(X1)),not(X1)))),inference(rw,[status(thm)],[14245,271,theory(equality)])).
% cnf(14297,plain,(is_a_theorem(or(and(not(X1),X2),not(and(X2,implies(X1,not(X1))))))),inference(spm,[status(thm)],[289,14266,theory(equality)])).
% cnf(14307,plain,(is_a_theorem(or(and(not(X1),X2),implies(X2,and(X1,not(not(X1))))))),inference(rw,[status(thm)],[14297,260,theory(equality)])).
% cnf(18295,plain,(is_a_theorem(implies(X1,and(X1,not(not(X1)))))),inference(spm,[status(thm)],[2745,14307,theory(equality)])).
% cnf(18369,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,implies(X2,not(X2))),X1))),inference(spm,[status(thm)],[307,18295,theory(equality)])).
% cnf(18589,plain,(is_a_theorem(not(and(implies(X1,not(X1)),and(X1,X2))))),inference(spm,[status(thm)],[18369,374,theory(equality)])).
% cnf(18719,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(implies(X2,not(X2)),and(X2,X3)),X1))),inference(spm,[status(thm)],[270,18589,theory(equality)])).
% cnf(25626,plain,(is_a_theorem(implies(implies(X1,X2),or(X2,not(X1))))),inference(spm,[status(thm)],[2835,711,theory(equality)])).
% cnf(25646,plain,(is_a_theorem(or(X1,not(X2)))|~is_a_theorem(implies(X2,X1))),inference(spm,[status(thm)],[263,25626,theory(equality)])).
% cnf(25651,plain,(is_a_theorem(or(X1,not(and(X1,X2))))),inference(spm,[status(thm)],[361,25626,theory(equality)])).
% cnf(25780,plain,(is_a_theorem(or(X1,implies(X1,X2)))),inference(spm,[status(thm)],[25651,259,theory(equality)])).
% cnf(233057,plain,(is_a_theorem(implies(and(X1,X2),and(X1,X1)))),inference(spm,[status(thm)],[18719,2762,theory(equality)])).
% cnf(233300,plain,(is_a_theorem(or(and(not(X1),not(X1)),X1))),inference(spm,[status(thm)],[13182,233057,theory(equality)])).
% cnf(233318,plain,(is_a_theorem(implies(or(X1,X1),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[233300,271,theory(equality)]),268,theory(equality)])).
% cnf(233326,plain,(is_a_theorem(or(X1,not(or(X1,X1))))),inference(spm,[status(thm)],[25646,233318,theory(equality)])).
% cnf(233495,plain,(is_a_theorem(or(and(not(or(X1,X1)),X2),implies(X2,X1)))),inference(spm,[status(thm)],[534,233326,theory(equality)])).
% cnf(357562,plain,(is_a_theorem(implies(implies(not(not(X1)),X2),not(and(not(X2),X1))))),inference(spm,[status(thm)],[2691,2834,theory(equality)])).
% cnf(358210,plain,(is_a_theorem(implies(or(not(X1),X2),not(and(not(X2),X1))))),inference(rw,[status(thm)],[357562,268,theory(equality)])).
% cnf(358411,plain,(is_a_theorem(not(and(not(X1),X2)))|~is_a_theorem(or(not(X2),X1))),inference(spm,[status(thm)],[263,358210,theory(equality)])).
% cnf(361907,plain,(is_a_theorem(not(and(not(implies(not(X1),X2)),X1)))),inference(spm,[status(thm)],[358411,25780,theory(equality)])).
% cnf(362329,plain,(is_a_theorem(not(and(not(or(X1,X2)),X1)))),inference(rw,[status(thm)],[361907,268,theory(equality)])).
% cnf(362722,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(not(or(X2,X3)),X2),X1))),inference(spm,[status(thm)],[270,362329,theory(equality)])).
% cnf(385418,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(not(or(not(X2),X3)),X2),X1))),inference(spm,[status(thm)],[362722,271,theory(equality)])).
% cnf(385790,plain,(is_a_theorem(implies(X1,X1))),inference(spm,[status(thm)],[362722,233495,theory(equality)])).
% cnf(385795,plain,(is_a_theorem(X1)|~is_a_theorem(implies(or(or(not(X2),X3),X2),X1))),inference(rw,[status(thm)],[385418,268,theory(equality)])).
% cnf(386322,plain,(is_a_theorem(implies(implies(X1,X2),not(and(not(X2),X1))))),inference(spm,[status(thm)],[2691,385790,theory(equality)])).
% cnf(396102,plain,(is_a_theorem(not(and(not(X1),X2)))|~is_a_theorem(implies(X2,X1))),inference(spm,[status(thm)],[263,386322,theory(equality)])).
% cnf(486308,plain,(is_a_theorem(not(and(not(X1),not(X2))))|~is_a_theorem(or(X2,X1))),inference(spm,[status(thm)],[396102,268,theory(equality)])).
% cnf(487482,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X2,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[486308,259,theory(equality)]),268,theory(equality)])).
% cnf(488841,plain,(is_a_theorem(or(implies(X1,X2),and(or(not(X3),X3),X1)))),inference(spm,[status(thm)],[487482,8504,theory(equality)])).
% cnf(524056,plain,(is_a_theorem(and(or(not(X1),X1),X2))|~is_a_theorem(X2)),inference(spm,[status(thm)],[4448,488841,theory(equality)])).
% cnf(613573,plain,(is_a_theorem(equiv(not(not(X1)),X1))|~is_a_theorem(implies(X1,not(not(X1))))),inference(spm,[status(thm)],[524056,284,theory(equality)])).
% cnf(613593,plain,(is_a_theorem(equiv(not(not(X1)),X1))|$false),inference(rw,[status(thm)],[613573,2834,theory(equality)])).
% cnf(613594,plain,(is_a_theorem(equiv(not(not(X1)),X1))),inference(cn,[status(thm)],[613593,theory(equality)])).
% cnf(613618,plain,(not(not(X1))=X1),inference(spm,[status(thm)],[250,613594,theory(equality)])).
% cnf(613797,plain,(implies(X1,X2)=or(not(X1),X2)),inference(spm,[status(thm)],[268,613618,theory(equality)])).
% cnf(614764,plain,(not(and(X1,X2))=implies(X1,not(X2))),inference(spm,[status(thm)],[259,613618,theory(equality)])).
% cnf(622867,plain,(is_a_theorem(X1)|~is_a_theorem(implies(or(implies(X2,X3),X2),X1))),inference(rw,[status(thm)],[385795,613797,theory(equality)])).
% cnf(631283,plain,(not(implies(X1,not(X2)))=and(X1,X2)),inference(spm,[status(thm)],[613618,614764,theory(equality)])).
% cnf(634773,plain,(is_a_theorem(implies(implies(X1,X2),or(X2,implies(X1,X3))))),inference(spm,[status(thm)],[622867,711,theory(equality)])).
% cnf(635492,plain,(is_a_theorem(or(or(X1,implies(X2,X3)),not(implies(X2,X1))))),inference(spm,[status(thm)],[25646,634773,theory(equality)])).
% cnf(643410,plain,(not(implies(X1,X2))=and(X1,not(X2))),inference(spm,[status(thm)],[631283,613618,theory(equality)])).
% cnf(645006,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(or(X2,X2),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[13182,643410,theory(equality)]),268,theory(equality)]),268,theory(equality)])).
% cnf(647961,plain,(is_a_theorem(or(not(implies(X1,implies(X1,X2))),implies(X1,X2)))),inference(spm,[status(thm)],[645006,635492,theory(equality)])).
% cnf(647968,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))),inference(rw,[status(thm)],[647961,613797,theory(equality)])).
% cnf(647984,plain,($false),inference(rw,[status(thm)],[261,647968,theory(equality)])).
% cnf(647985,plain,($false),inference(cn,[status(thm)],[647984,theory(equality)])).
% cnf(647986,plain,($false),647985,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 18874
% # ...of these trivial : 4130
% # ...subsumed : 7979
% # ...remaining for further processing: 6765
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 132
% # Backward-rewritten : 5154
% # Generated clauses : 426308
% # ...of the previous two non-trivial : 247880
% # Contextual simplify-reflections : 114
% # Paramodulations : 426308
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1479
% # Positive orientable unit clauses: 1058
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 418
% # Current number of unprocessed clauses: 11857
% # ...number of literals in the above : 15011
% # Clause-clause subsumption calls (NU) : 143225
% # Rec. Clause-clause subsumption calls : 143225
% # Unit Clause-clause subsumption calls : 25024
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 971146
% # Indexed BW rewrite successes : 3000
% # Backwards rewriting index: 972 leaves, 3.81+/-9.750 terms/leaf
% # Paramod-from index: 102 leaves, 10.65+/-22.219 terms/leaf
% # Paramod-into index: 960 leaves, 3.77+/-9.713 terms/leaf
% # -------------------------------------------------
% # User time : 17.940 s
% # System time : 0.510 s
% # Total time : 18.450 s
% # Maximum resident set size: 0 pages
% PrfWatch: 25.91 CPU 27.62 WC
% FINAL PrfWatch: 25.91 CPU 27.62 WC
% SZS output end Solution for /tmp/SystemOnTPTP31229/LCL504+1.tptp
%
%------------------------------------------------------------------------------