TSTP Solution File: LCL490+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL490+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 : art02.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:40:24 EST 2010
% Result : Theorem 1.23s
% Output : Solution 1.23s
% 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/SystemOnTPTP16417/LCL490+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16417/LCL490+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16417/LCL490+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 16513
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # 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,op_implies_or,file('/tmp/SRASS.s.p', principia_op_implies_or)).
% fof(3, axiom,modus_ponens,file('/tmp/SRASS.s.p', principia_modus_ponens)).
% fof(4, axiom,r1,file('/tmp/SRASS.s.p', principia_r1)).
% fof(5, axiom,r2,file('/tmp/SRASS.s.p', principia_r2)).
% fof(6, axiom,r3,file('/tmp/SRASS.s.p', principia_r3)).
% fof(8, axiom,r5,file('/tmp/SRASS.s.p', principia_r5)).
% fof(9, axiom,(r1<=>![X3]:is_a_theorem(implies(or(X3,X3),X3))),file('/tmp/SRASS.s.p', r1)).
% fof(10, axiom,(r2<=>![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4)))),file('/tmp/SRASS.s.p', r2)).
% fof(11, axiom,(r3<=>![X3]:![X4]:is_a_theorem(implies(or(X3,X4),or(X4,X3)))),file('/tmp/SRASS.s.p', r3)).
% fof(13, axiom,(r5<=>![X3]:![X4]:![X5]:is_a_theorem(implies(implies(X4,X5),implies(or(X3,X4),or(X3,X5))))),file('/tmp/SRASS.s.p', r5)).
% fof(16, axiom,op_and,file('/tmp/SRASS.s.p', principia_op_and)).
% fof(19, axiom,op_or,file('/tmp/SRASS.s.p', hilbert_op_or)).
% fof(20, axiom,op_implies_and,file('/tmp/SRASS.s.p', hilbert_op_implies_and)).
% fof(22, 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(27, axiom,(op_or=>![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_or)).
% fof(28, axiom,(op_and=>![X1]:![X2]:and(X1,X2)=not(or(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_and)).
% fof(40, axiom,(op_implies_or=>![X1]:![X2]:implies(X1,X2)=or(not(X1),X2)),file('/tmp/SRASS.s.p', op_implies_or)).
% fof(43, axiom,(op_implies_and=>![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(45, conjecture,or_1,file('/tmp/SRASS.s.p', hilbert_or_1)).
% fof(46, negated_conjecture,~(or_1),inference(assume_negation,[status(cth)],[45])).
% fof(47, negated_conjecture,~(or_1),inference(fof_simplification,[status(thm)],[46,theory(equality)])).
% fof(48, 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(49, 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)],[48])).
% fof(50, 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)],[49])).
% fof(51, 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)],[50])).
% cnf(52,plain,(or_1|~is_a_theorem(implies(esk1_0,or(esk1_0,esk2_0)))),inference(split_conjunct,[status(thm)],[51])).
% cnf(54,plain,(op_implies_or),inference(split_conjunct,[status(thm)],[2])).
% cnf(55,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[3])).
% cnf(56,plain,(r1),inference(split_conjunct,[status(thm)],[4])).
% cnf(57,plain,(r2),inference(split_conjunct,[status(thm)],[5])).
% cnf(58,plain,(r3),inference(split_conjunct,[status(thm)],[6])).
% cnf(60,plain,(r5),inference(split_conjunct,[status(thm)],[8])).
% fof(61, plain,((~(r1)|![X3]:is_a_theorem(implies(or(X3,X3),X3)))&(?[X3]:~(is_a_theorem(implies(or(X3,X3),X3)))|r1)),inference(fof_nnf,[status(thm)],[9])).
% fof(62, plain,((~(r1)|![X4]:is_a_theorem(implies(or(X4,X4),X4)))&(?[X5]:~(is_a_theorem(implies(or(X5,X5),X5)))|r1)),inference(variable_rename,[status(thm)],[61])).
% fof(63, plain,((~(r1)|![X4]:is_a_theorem(implies(or(X4,X4),X4)))&(~(is_a_theorem(implies(or(esk3_0,esk3_0),esk3_0)))|r1)),inference(skolemize,[status(esa)],[62])).
% fof(64, plain,![X4]:((is_a_theorem(implies(or(X4,X4),X4))|~(r1))&(~(is_a_theorem(implies(or(esk3_0,esk3_0),esk3_0)))|r1)),inference(shift_quantors,[status(thm)],[63])).
% cnf(66,plain,(is_a_theorem(implies(or(X1,X1),X1))|~r1),inference(split_conjunct,[status(thm)],[64])).
% fof(67, plain,((~(r2)|![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4))))&(?[X3]:?[X4]:~(is_a_theorem(implies(X4,or(X3,X4))))|r2)),inference(fof_nnf,[status(thm)],[10])).
% fof(68, plain,((~(r2)|![X5]:![X6]:is_a_theorem(implies(X6,or(X5,X6))))&(?[X7]:?[X8]:~(is_a_theorem(implies(X8,or(X7,X8))))|r2)),inference(variable_rename,[status(thm)],[67])).
% fof(69, plain,((~(r2)|![X5]:![X6]:is_a_theorem(implies(X6,or(X5,X6))))&(~(is_a_theorem(implies(esk5_0,or(esk4_0,esk5_0))))|r2)),inference(skolemize,[status(esa)],[68])).
% fof(70, plain,![X5]:![X6]:((is_a_theorem(implies(X6,or(X5,X6)))|~(r2))&(~(is_a_theorem(implies(esk5_0,or(esk4_0,esk5_0))))|r2)),inference(shift_quantors,[status(thm)],[69])).
% cnf(72,plain,(is_a_theorem(implies(X1,or(X2,X1)))|~r2),inference(split_conjunct,[status(thm)],[70])).
% fof(73, plain,((~(r3)|![X3]:![X4]:is_a_theorem(implies(or(X3,X4),or(X4,X3))))&(?[X3]:?[X4]:~(is_a_theorem(implies(or(X3,X4),or(X4,X3))))|r3)),inference(fof_nnf,[status(thm)],[11])).
% fof(74, plain,((~(r3)|![X5]:![X6]:is_a_theorem(implies(or(X5,X6),or(X6,X5))))&(?[X7]:?[X8]:~(is_a_theorem(implies(or(X7,X8),or(X8,X7))))|r3)),inference(variable_rename,[status(thm)],[73])).
% fof(75, plain,((~(r3)|![X5]:![X6]:is_a_theorem(implies(or(X5,X6),or(X6,X5))))&(~(is_a_theorem(implies(or(esk6_0,esk7_0),or(esk7_0,esk6_0))))|r3)),inference(skolemize,[status(esa)],[74])).
% fof(76, plain,![X5]:![X6]:((is_a_theorem(implies(or(X5,X6),or(X6,X5)))|~(r3))&(~(is_a_theorem(implies(or(esk6_0,esk7_0),or(esk7_0,esk6_0))))|r3)),inference(shift_quantors,[status(thm)],[75])).
% cnf(78,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3),inference(split_conjunct,[status(thm)],[76])).
% fof(85, plain,((~(r5)|![X3]:![X4]:![X5]:is_a_theorem(implies(implies(X4,X5),implies(or(X3,X4),or(X3,X5)))))&(?[X3]:?[X4]:?[X5]:~(is_a_theorem(implies(implies(X4,X5),implies(or(X3,X4),or(X3,X5)))))|r5)),inference(fof_nnf,[status(thm)],[13])).
% fof(86, plain,((~(r5)|![X6]:![X7]:![X8]:is_a_theorem(implies(implies(X7,X8),implies(or(X6,X7),or(X6,X8)))))&(?[X9]:?[X10]:?[X11]:~(is_a_theorem(implies(implies(X10,X11),implies(or(X9,X10),or(X9,X11)))))|r5)),inference(variable_rename,[status(thm)],[85])).
% fof(87, plain,((~(r5)|![X6]:![X7]:![X8]:is_a_theorem(implies(implies(X7,X8),implies(or(X6,X7),or(X6,X8)))))&(~(is_a_theorem(implies(implies(esk12_0,esk13_0),implies(or(esk11_0,esk12_0),or(esk11_0,esk13_0)))))|r5)),inference(skolemize,[status(esa)],[86])).
% fof(88, plain,![X6]:![X7]:![X8]:((is_a_theorem(implies(implies(X7,X8),implies(or(X6,X7),or(X6,X8))))|~(r5))&(~(is_a_theorem(implies(implies(esk12_0,esk13_0),implies(or(esk11_0,esk12_0),or(esk11_0,esk13_0)))))|r5)),inference(shift_quantors,[status(thm)],[87])).
% cnf(90,plain,(is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5),inference(split_conjunct,[status(thm)],[88])).
% cnf(103,plain,(op_and),inference(split_conjunct,[status(thm)],[16])).
% cnf(106,plain,(op_or),inference(split_conjunct,[status(thm)],[19])).
% cnf(107,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[20])).
% fof(109, 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)],[22])).
% fof(110, 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)],[109])).
% fof(111, 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)],[110])).
% fof(112, 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)],[111])).
% fof(113, 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)],[112])).
% cnf(117,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[113])).
% fof(142, plain,(~(op_or)|![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[27])).
% fof(143, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[142])).
% fof(144, plain,![X3]:![X4]:(or(X3,X4)=not(and(not(X3),not(X4)))|~(op_or)),inference(shift_quantors,[status(thm)],[143])).
% cnf(145,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[144])).
% fof(146, plain,(~(op_and)|![X1]:![X2]:and(X1,X2)=not(or(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[28])).
% fof(147, plain,(~(op_and)|![X3]:![X4]:and(X3,X4)=not(or(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[146])).
% fof(148, plain,![X3]:![X4]:(and(X3,X4)=not(or(not(X3),not(X4)))|~(op_and)),inference(shift_quantors,[status(thm)],[147])).
% cnf(149,plain,(and(X1,X2)=not(or(not(X1),not(X2)))|~op_and),inference(split_conjunct,[status(thm)],[148])).
% fof(216, plain,(~(op_implies_or)|![X1]:![X2]:implies(X1,X2)=or(not(X1),X2)),inference(fof_nnf,[status(thm)],[40])).
% fof(217, plain,(~(op_implies_or)|![X3]:![X4]:implies(X3,X4)=or(not(X3),X4)),inference(variable_rename,[status(thm)],[216])).
% fof(218, plain,![X3]:![X4]:(implies(X3,X4)=or(not(X3),X4)|~(op_implies_or)),inference(shift_quantors,[status(thm)],[217])).
% cnf(219,plain,(implies(X1,X2)=or(not(X1),X2)|~op_implies_or),inference(split_conjunct,[status(thm)],[218])).
% fof(234, plain,(~(op_implies_and)|![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),inference(fof_nnf,[status(thm)],[43])).
% fof(235, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(variable_rename,[status(thm)],[234])).
% fof(236, plain,![X3]:![X4]:(implies(X3,X4)=not(and(X3,not(X4)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[235])).
% cnf(237,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[236])).
% cnf(242,negated_conjecture,(~or_1),inference(split_conjunct,[status(thm)],[47])).
% cnf(247,plain,(~is_a_theorem(implies(esk1_0,or(esk1_0,esk2_0)))),inference(sr,[status(thm)],[52,242,theory(equality)])).
% cnf(254,plain,(or(not(X1),X2)=implies(X1,X2)|$false),inference(rw,[status(thm)],[219,54,theory(equality)])).
% cnf(255,plain,(or(not(X1),X2)=implies(X1,X2)),inference(cn,[status(thm)],[254,theory(equality)])).
% cnf(257,plain,(is_a_theorem(implies(X1,or(X2,X1)))|$false),inference(rw,[status(thm)],[72,57,theory(equality)])).
% cnf(258,plain,(is_a_theorem(implies(X1,or(X2,X1)))),inference(cn,[status(thm)],[257,theory(equality)])).
% cnf(259,plain,(is_a_theorem(implies(X1,implies(X2,X1)))),inference(spm,[status(thm)],[258,255,theory(equality)])).
% cnf(263,plain,(is_a_theorem(implies(or(X1,X1),X1))|$false),inference(rw,[status(thm)],[66,56,theory(equality)])).
% cnf(264,plain,(is_a_theorem(implies(or(X1,X1),X1))),inference(cn,[status(thm)],[263,theory(equality)])).
% cnf(266,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[237,107,theory(equality)])).
% cnf(267,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[266,theory(equality)])).
% cnf(269,plain,(not(and(X1,implies(X2,X3)))=implies(X1,and(X2,not(X3)))),inference(spm,[status(thm)],[267,267,theory(equality)])).
% cnf(270,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[117,55,theory(equality)])).
% cnf(271,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[270,theory(equality)])).
% cnf(272,plain,(is_a_theorem(X1)|~is_a_theorem(or(X1,X1))),inference(spm,[status(thm)],[271,264,theory(equality)])).
% cnf(273,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(X2)),inference(spm,[status(thm)],[271,258,theory(equality)])).
% cnf(274,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))|$false),inference(rw,[status(thm)],[78,58,theory(equality)])).
% cnf(275,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))),inference(cn,[status(thm)],[274,theory(equality)])).
% cnf(276,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X2,X1))),inference(spm,[status(thm)],[271,275,theory(equality)])).
% cnf(278,plain,(is_a_theorem(implies(implies(X1,X2),or(X2,not(X1))))),inference(spm,[status(thm)],[275,255,theory(equality)])).
% cnf(279,plain,(not(implies(X1,not(X2)))=and(X1,X2)|~op_and),inference(rw,[status(thm)],[149,255,theory(equality)])).
% cnf(280,plain,(not(implies(X1,not(X2)))=and(X1,X2)|$false),inference(rw,[status(thm)],[279,103,theory(equality)])).
% cnf(281,plain,(not(implies(X1,not(X2)))=and(X1,X2)),inference(cn,[status(thm)],[280,theory(equality)])).
% cnf(288,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[145,267,theory(equality)])).
% cnf(289,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[288,106,theory(equality)])).
% cnf(290,plain,(implies(not(X1),X2)=or(X1,X2)),inference(cn,[status(thm)],[289,theory(equality)])).
% cnf(291,plain,(not(or(X1,not(X2)))=and(not(X1),X2)),inference(spm,[status(thm)],[281,290,theory(equality)])).
% cnf(308,plain,(is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|$false),inference(rw,[status(thm)],[90,60,theory(equality)])).
% cnf(309,plain,(is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))),inference(cn,[status(thm)],[308,theory(equality)])).
% cnf(310,plain,(is_a_theorem(implies(or(X1,X2),or(X1,X3)))|~is_a_theorem(implies(X2,X3))),inference(spm,[status(thm)],[271,309,theory(equality)])).
% cnf(330,plain,(is_a_theorem(or(X1,implies(X2,not(X1))))),inference(spm,[status(thm)],[259,290,theory(equality)])).
% cnf(335,plain,(is_a_theorem(not(X1))|~is_a_theorem(implies(X1,not(X1)))),inference(spm,[status(thm)],[272,255,theory(equality)])).
% cnf(384,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(or(X1,not(not(X1))))),inference(spm,[status(thm)],[335,290,theory(equality)])).
% cnf(411,plain,(is_a_theorem(or(X1,not(X2)))|~is_a_theorem(implies(X2,X1))),inference(spm,[status(thm)],[276,255,theory(equality)])).
% cnf(412,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(X1)),inference(spm,[status(thm)],[276,273,theory(equality)])).
% cnf(428,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[384,412,theory(equality)])).
% cnf(433,plain,(is_a_theorem(not(and(X1,X2)))|~is_a_theorem(implies(X1,not(X2)))),inference(spm,[status(thm)],[428,281,theory(equality)])).
% cnf(461,plain,(is_a_theorem(or(X1,not(not(X2))))|~is_a_theorem(or(X2,X1))),inference(spm,[status(thm)],[411,290,theory(equality)])).
% cnf(500,plain,(is_a_theorem(or(or(X1,not(X2)),not(implies(X2,X1))))),inference(spm,[status(thm)],[411,278,theory(equality)])).
% cnf(701,plain,(is_a_theorem(or(implies(X1,not(X2)),X2))),inference(spm,[status(thm)],[276,330,theory(equality)])).
% cnf(1090,plain,(is_a_theorem(or(X1,not(not(implies(X2,not(X1))))))),inference(spm,[status(thm)],[461,701,theory(equality)])).
% cnf(1093,plain,(is_a_theorem(or(not(implies(X1,X2)),not(not(or(X2,not(X1))))))),inference(spm,[status(thm)],[461,500,theory(equality)])).
% cnf(1104,plain,(is_a_theorem(or(X1,not(and(X2,X1))))),inference(rw,[status(thm)],[1090,281,theory(equality)])).
% cnf(1107,plain,(is_a_theorem(implies(implies(X1,X2),not(and(not(X2),X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1093,291,theory(equality)]),255,theory(equality)])).
% cnf(1114,plain,(is_a_theorem(or(not(and(X1,X2)),X2))),inference(spm,[status(thm)],[276,1104,theory(equality)])).
% cnf(1126,plain,(is_a_theorem(implies(and(X1,X2),X2))),inference(rw,[status(thm)],[1114,255,theory(equality)])).
% cnf(1469,plain,(is_a_theorem(or(not(and(not(X1),X2)),not(implies(X2,X1))))),inference(spm,[status(thm)],[411,1107,theory(equality)])).
% cnf(1486,plain,(is_a_theorem(implies(and(not(X1),X2),not(implies(X2,X1))))),inference(rw,[status(thm)],[1469,255,theory(equality)])).
% cnf(1624,plain,(is_a_theorem(not(and(and(not(X1),X2),implies(X2,X1))))),inference(spm,[status(thm)],[433,1486,theory(equality)])).
% cnf(1639,plain,(is_a_theorem(implies(and(not(X1),X2),and(X2,not(X1))))),inference(rw,[status(thm)],[1624,269,theory(equality)])).
% cnf(2104,plain,(is_a_theorem(implies(or(X1,and(X2,X3)),or(X1,X3)))),inference(spm,[status(thm)],[310,1126,theory(equality)])).
% cnf(2133,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X1,and(X3,X2)))),inference(spm,[status(thm)],[271,2104,theory(equality)])).
% cnf(2238,plain,(is_a_theorem(or(not(X1),X2))|~is_a_theorem(implies(X1,and(X3,X2)))),inference(spm,[status(thm)],[2133,255,theory(equality)])).
% cnf(2244,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,and(X3,X2)))),inference(rw,[status(thm)],[2238,255,theory(equality)])).
% cnf(8752,plain,(is_a_theorem(implies(and(not(X1),X2),not(X1)))),inference(spm,[status(thm)],[2244,1639,theory(equality)])).
% cnf(8782,plain,(is_a_theorem(or(not(X1),not(and(not(X1),X2))))),inference(spm,[status(thm)],[411,8752,theory(equality)])).
% cnf(8802,plain,(is_a_theorem(implies(X1,not(and(not(X1),X2))))),inference(rw,[status(thm)],[8782,255,theory(equality)])).
% cnf(8824,plain,(is_a_theorem(implies(X1,implies(not(X1),X2)))),inference(spm,[status(thm)],[8802,267,theory(equality)])).
% cnf(8840,plain,(is_a_theorem(implies(X1,or(X1,X2)))),inference(rw,[status(thm)],[8824,290,theory(equality)])).
% cnf(9574,plain,($false),inference(rw,[status(thm)],[247,8840,theory(equality)])).
% cnf(9575,plain,($false),inference(cn,[status(thm)],[9574,theory(equality)])).
% cnf(9576,plain,($false),9575,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 589
% # ...of these trivial : 81
% # ...subsumed : 57
% # ...remaining for further processing: 451
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 40
% # Generated clauses : 5936
% # ...of the previous two non-trivial : 4019
% # Contextual simplify-reflections : 1
% # Paramodulations : 5936
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 409
% # Positive orientable unit clauses: 310
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 95
% # Current number of unprocessed clauses: 3320
% # ...number of literals in the above : 3785
% # Clause-clause subsumption calls (NU) : 1032
% # Rec. Clause-clause subsumption calls : 1032
% # Unit Clause-clause subsumption calls : 445
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4051
% # Indexed BW rewrite successes : 34
% # Backwards rewriting index: 406 leaves, 2.63+/-4.120 terms/leaf
% # Paramod-from index: 82 leaves, 3.85+/-6.765 terms/leaf
% # Paramod-into index: 388 leaves, 2.61+/-4.111 terms/leaf
% # -------------------------------------------------
% # User time : 0.176 s
% # System time : 0.009 s
% # Total time : 0.185 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.39 CPU 0.48 WC
% FINAL PrfWatch: 0.39 CPU 0.48 WC
% SZS output end Solution for /tmp/SystemOnTPTP16417/LCL490+1.tptp
%
%------------------------------------------------------------------------------