TSTP Solution File: LCL485+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL485+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 : art01.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:39:07 EST 2010
% Result : Theorem 9.36s
% Output : Solution 9.36s
% 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/SystemOnTPTP16213/LCL485+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16213/LCL485+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16213/LCL485+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 16309
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.03 WC
% PrfWatch: 3.92 CPU 4.04 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 5.90 CPU 6.04 WC
% PrfWatch: 7.89 CPU 8.05 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', principia_modus_ponens)).
% fof(3, axiom,r1,file('/tmp/SRASS.s.p', principia_r1)).
% fof(4, axiom,r2,file('/tmp/SRASS.s.p', principia_r2)).
% fof(5, axiom,r3,file('/tmp/SRASS.s.p', principia_r3)).
% fof(6, axiom,r4,file('/tmp/SRASS.s.p', principia_r4)).
% fof(7, axiom,r5,file('/tmp/SRASS.s.p', principia_r5)).
% fof(8, axiom,op_implies_or,file('/tmp/SRASS.s.p', principia_op_implies_or)).
% fof(11, axiom,op_implies_and,file('/tmp/SRASS.s.p', hilbert_op_implies_and)).
% fof(13, 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(17, axiom,op_and,file('/tmp/SRASS.s.p', principia_op_and)).
% fof(18, axiom,op_or,file('/tmp/SRASS.s.p', hilbert_op_or)).
% fof(19, axiom,(r1<=>![X4]:is_a_theorem(implies(or(X4,X4),X4))),file('/tmp/SRASS.s.p', r1)).
% fof(20, axiom,(r2<=>![X4]:![X5]:is_a_theorem(implies(X5,or(X4,X5)))),file('/tmp/SRASS.s.p', r2)).
% fof(21, axiom,(r3<=>![X4]:![X5]:is_a_theorem(implies(or(X4,X5),or(X5,X4)))),file('/tmp/SRASS.s.p', r3)).
% fof(22, axiom,(r4<=>![X4]:![X5]:![X6]:is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6))))),file('/tmp/SRASS.s.p', r4)).
% fof(23, axiom,(r5<=>![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6))))),file('/tmp/SRASS.s.p', r5)).
% fof(38, axiom,(op_or=>![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_or)).
% fof(39, axiom,(op_and=>![X1]:![X2]:and(X1,X2)=not(or(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_and)).
% fof(42, 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,implies_2,file('/tmp/SRASS.s.p', hilbert_implies_2)).
% fof(46, negated_conjecture,~(implies_2),inference(assume_negation,[status(cth)],[45])).
% fof(47, negated_conjecture,~(implies_2),inference(fof_simplification,[status(thm)],[46,theory(equality)])).
% fof(48, 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(49, 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)],[48])).
% fof(50, 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)],[49])).
% fof(51, 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)],[50])).
% cnf(52,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)],[51])).
% cnf(54,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[2])).
% cnf(55,plain,(r1),inference(split_conjunct,[status(thm)],[3])).
% cnf(56,plain,(r2),inference(split_conjunct,[status(thm)],[4])).
% cnf(57,plain,(r3),inference(split_conjunct,[status(thm)],[5])).
% cnf(58,plain,(r4),inference(split_conjunct,[status(thm)],[6])).
% cnf(59,plain,(r5),inference(split_conjunct,[status(thm)],[7])).
% cnf(60,plain,(op_implies_or),inference(split_conjunct,[status(thm)],[8])).
% cnf(63,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[11])).
% fof(65, 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)],[13])).
% fof(66, 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)],[65])).
% fof(67, 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)],[66])).
% fof(68, 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)],[67])).
% fof(69, 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)],[68])).
% cnf(73,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[69])).
% cnf(92,plain,(op_and),inference(split_conjunct,[status(thm)],[17])).
% cnf(93,plain,(op_or),inference(split_conjunct,[status(thm)],[18])).
% fof(94, plain,((~(r1)|![X4]:is_a_theorem(implies(or(X4,X4),X4)))&(?[X4]:~(is_a_theorem(implies(or(X4,X4),X4)))|r1)),inference(fof_nnf,[status(thm)],[19])).
% fof(95, plain,((~(r1)|![X5]:is_a_theorem(implies(or(X5,X5),X5)))&(?[X6]:~(is_a_theorem(implies(or(X6,X6),X6)))|r1)),inference(variable_rename,[status(thm)],[94])).
% fof(96, plain,((~(r1)|![X5]:is_a_theorem(implies(or(X5,X5),X5)))&(~(is_a_theorem(implies(or(esk13_0,esk13_0),esk13_0)))|r1)),inference(skolemize,[status(esa)],[95])).
% fof(97, plain,![X5]:((is_a_theorem(implies(or(X5,X5),X5))|~(r1))&(~(is_a_theorem(implies(or(esk13_0,esk13_0),esk13_0)))|r1)),inference(shift_quantors,[status(thm)],[96])).
% cnf(99,plain,(is_a_theorem(implies(or(X1,X1),X1))|~r1),inference(split_conjunct,[status(thm)],[97])).
% fof(100, plain,((~(r2)|![X4]:![X5]:is_a_theorem(implies(X5,or(X4,X5))))&(?[X4]:?[X5]:~(is_a_theorem(implies(X5,or(X4,X5))))|r2)),inference(fof_nnf,[status(thm)],[20])).
% fof(101, plain,((~(r2)|![X6]:![X7]:is_a_theorem(implies(X7,or(X6,X7))))&(?[X8]:?[X9]:~(is_a_theorem(implies(X9,or(X8,X9))))|r2)),inference(variable_rename,[status(thm)],[100])).
% fof(102, plain,((~(r2)|![X6]:![X7]:is_a_theorem(implies(X7,or(X6,X7))))&(~(is_a_theorem(implies(esk15_0,or(esk14_0,esk15_0))))|r2)),inference(skolemize,[status(esa)],[101])).
% fof(103, plain,![X6]:![X7]:((is_a_theorem(implies(X7,or(X6,X7)))|~(r2))&(~(is_a_theorem(implies(esk15_0,or(esk14_0,esk15_0))))|r2)),inference(shift_quantors,[status(thm)],[102])).
% cnf(105,plain,(is_a_theorem(implies(X1,or(X2,X1)))|~r2),inference(split_conjunct,[status(thm)],[103])).
% fof(106, plain,((~(r3)|![X4]:![X5]:is_a_theorem(implies(or(X4,X5),or(X5,X4))))&(?[X4]:?[X5]:~(is_a_theorem(implies(or(X4,X5),or(X5,X4))))|r3)),inference(fof_nnf,[status(thm)],[21])).
% fof(107, plain,((~(r3)|![X6]:![X7]:is_a_theorem(implies(or(X6,X7),or(X7,X6))))&(?[X8]:?[X9]:~(is_a_theorem(implies(or(X8,X9),or(X9,X8))))|r3)),inference(variable_rename,[status(thm)],[106])).
% fof(108, plain,((~(r3)|![X6]:![X7]:is_a_theorem(implies(or(X6,X7),or(X7,X6))))&(~(is_a_theorem(implies(or(esk16_0,esk17_0),or(esk17_0,esk16_0))))|r3)),inference(skolemize,[status(esa)],[107])).
% fof(109, plain,![X6]:![X7]:((is_a_theorem(implies(or(X6,X7),or(X7,X6)))|~(r3))&(~(is_a_theorem(implies(or(esk16_0,esk17_0),or(esk17_0,esk16_0))))|r3)),inference(shift_quantors,[status(thm)],[108])).
% cnf(111,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3),inference(split_conjunct,[status(thm)],[109])).
% fof(112, plain,((~(r4)|![X4]:![X5]:![X6]:is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6)))))&(?[X4]:?[X5]:?[X6]:~(is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6)))))|r4)),inference(fof_nnf,[status(thm)],[22])).
% fof(113, plain,((~(r4)|![X7]:![X8]:![X9]:is_a_theorem(implies(or(X7,or(X8,X9)),or(X8,or(X7,X9)))))&(?[X10]:?[X11]:?[X12]:~(is_a_theorem(implies(or(X10,or(X11,X12)),or(X11,or(X10,X12)))))|r4)),inference(variable_rename,[status(thm)],[112])).
% fof(114, plain,((~(r4)|![X7]:![X8]:![X9]:is_a_theorem(implies(or(X7,or(X8,X9)),or(X8,or(X7,X9)))))&(~(is_a_theorem(implies(or(esk18_0,or(esk19_0,esk20_0)),or(esk19_0,or(esk18_0,esk20_0)))))|r4)),inference(skolemize,[status(esa)],[113])).
% fof(115, plain,![X7]:![X8]:![X9]:((is_a_theorem(implies(or(X7,or(X8,X9)),or(X8,or(X7,X9))))|~(r4))&(~(is_a_theorem(implies(or(esk18_0,or(esk19_0,esk20_0)),or(esk19_0,or(esk18_0,esk20_0)))))|r4)),inference(shift_quantors,[status(thm)],[114])).
% cnf(117,plain,(is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|~r4),inference(split_conjunct,[status(thm)],[115])).
% fof(118, plain,((~(r5)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6)))))&(?[X4]:?[X5]:?[X6]:~(is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6)))))|r5)),inference(fof_nnf,[status(thm)],[23])).
% fof(119, plain,((~(r5)|![X7]:![X8]:![X9]:is_a_theorem(implies(implies(X8,X9),implies(or(X7,X8),or(X7,X9)))))&(?[X10]:?[X11]:?[X12]:~(is_a_theorem(implies(implies(X11,X12),implies(or(X10,X11),or(X10,X12)))))|r5)),inference(variable_rename,[status(thm)],[118])).
% fof(120, plain,((~(r5)|![X7]:![X8]:![X9]:is_a_theorem(implies(implies(X8,X9),implies(or(X7,X8),or(X7,X9)))))&(~(is_a_theorem(implies(implies(esk22_0,esk23_0),implies(or(esk21_0,esk22_0),or(esk21_0,esk23_0)))))|r5)),inference(skolemize,[status(esa)],[119])).
% fof(121, plain,![X7]:![X8]:![X9]:((is_a_theorem(implies(implies(X8,X9),implies(or(X7,X8),or(X7,X9))))|~(r5))&(~(is_a_theorem(implies(implies(esk22_0,esk23_0),implies(or(esk21_0,esk22_0),or(esk21_0,esk23_0)))))|r5)),inference(shift_quantors,[status(thm)],[120])).
% cnf(123,plain,(is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5),inference(split_conjunct,[status(thm)],[121])).
% fof(208, plain,(~(op_or)|![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[38])).
% fof(209, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[208])).
% fof(210, plain,![X3]:![X4]:(or(X3,X4)=not(and(not(X3),not(X4)))|~(op_or)),inference(shift_quantors,[status(thm)],[209])).
% cnf(211,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[210])).
% fof(212, plain,(~(op_and)|![X1]:![X2]:and(X1,X2)=not(or(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[39])).
% fof(213, plain,(~(op_and)|![X3]:![X4]:and(X3,X4)=not(or(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[212])).
% fof(214, plain,![X3]:![X4]:(and(X3,X4)=not(or(not(X3),not(X4)))|~(op_and)),inference(shift_quantors,[status(thm)],[213])).
% cnf(215,plain,(and(X1,X2)=not(or(not(X1),not(X2)))|~op_and),inference(split_conjunct,[status(thm)],[214])).
% fof(230, plain,(~(op_implies_or)|![X1]:![X2]:implies(X1,X2)=or(not(X1),X2)),inference(fof_nnf,[status(thm)],[42])).
% fof(231, plain,(~(op_implies_or)|![X3]:![X4]:implies(X3,X4)=or(not(X3),X4)),inference(variable_rename,[status(thm)],[230])).
% fof(232, plain,![X3]:![X4]:(implies(X3,X4)=or(not(X3),X4)|~(op_implies_or)),inference(shift_quantors,[status(thm)],[231])).
% cnf(233,plain,(implies(X1,X2)=or(not(X1),X2)|~op_implies_or),inference(split_conjunct,[status(thm)],[232])).
% 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,(~implies_2),inference(split_conjunct,[status(thm)],[47])).
% cnf(254,plain,(or(not(X1),X2)=implies(X1,X2)|$false),inference(rw,[status(thm)],[233,60,theory(equality)])).
% cnf(255,plain,(or(not(X1),X2)=implies(X1,X2)),inference(cn,[status(thm)],[254,theory(equality)])).
% cnf(256,plain,(is_a_theorem(implies(X1,or(X2,X1)))|$false),inference(rw,[status(thm)],[105,56,theory(equality)])).
% cnf(257,plain,(is_a_theorem(implies(X1,or(X2,X1)))),inference(cn,[status(thm)],[256,theory(equality)])).
% cnf(258,plain,(is_a_theorem(implies(X1,implies(X2,X1)))),inference(spm,[status(thm)],[257,255,theory(equality)])).
% cnf(262,plain,(is_a_theorem(implies(or(X1,X1),X1))|$false),inference(rw,[status(thm)],[99,55,theory(equality)])).
% cnf(263,plain,(is_a_theorem(implies(or(X1,X1),X1))),inference(cn,[status(thm)],[262,theory(equality)])).
% cnf(265,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[237,63,theory(equality)])).
% cnf(266,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[265,theory(equality)])).
% cnf(267,plain,(or(implies(X1,X2),X3)=implies(and(X1,not(X2)),X3)),inference(spm,[status(thm)],[255,266,theory(equality)])).
% cnf(268,plain,(not(and(X1,implies(X2,X3)))=implies(X1,and(X2,not(X3)))),inference(spm,[status(thm)],[266,266,theory(equality)])).
% cnf(269,plain,(~is_a_theorem(implies(implies(esk1_0,implies(esk1_0,esk2_0)),implies(esk1_0,esk2_0)))),inference(sr,[status(thm)],[52,242,theory(equality)])).
% cnf(270,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[73,54,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,263,theory(equality)])).
% cnf(273,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(X2)),inference(spm,[status(thm)],[271,257,theory(equality)])).
% cnf(274,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))|$false),inference(rw,[status(thm)],[111,57,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(277,plain,(is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))),inference(spm,[status(thm)],[275,255,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)],[215,255,theory(equality)])).
% cnf(280,plain,(not(implies(X1,not(X2)))=and(X1,X2)|$false),inference(rw,[status(thm)],[279,92,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)],[211,266,theory(equality)])).
% cnf(289,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[288,93,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(292,plain,(is_a_theorem(or(X1,or(X2,not(X1))))),inference(spm,[status(thm)],[257,290,theory(equality)])).
% cnf(293,plain,(is_a_theorem(X1)|~is_a_theorem(or(X2,X1))|~is_a_theorem(not(X2))),inference(spm,[status(thm)],[271,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)],[123,59,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(311,plain,(is_a_theorem(implies(implies(X1,X2),implies(or(not(X3),X1),implies(X3,X2))))),inference(spm,[status(thm)],[309,255,theory(equality)])).
% cnf(314,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2))))),inference(rw,[status(thm)],[311,255,theory(equality)])).
% cnf(316,plain,(is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|$false),inference(rw,[status(thm)],[117,58,theory(equality)])).
% cnf(317,plain,(is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))),inference(cn,[status(thm)],[316,theory(equality)])).
% cnf(318,plain,(is_a_theorem(or(X1,or(X2,X3)))|~is_a_theorem(or(X2,or(X1,X3)))),inference(spm,[status(thm)],[271,317,theory(equality)])).
% cnf(319,plain,(is_a_theorem(implies(or(not(X1),or(X2,X3)),or(X2,implies(X1,X3))))),inference(spm,[status(thm)],[317,255,theory(equality)])).
% cnf(323,plain,(is_a_theorem(implies(implies(X1,or(X2,X3)),or(X2,implies(X1,X3))))),inference(rw,[status(thm)],[319,255,theory(equality)])).
% cnf(330,plain,(is_a_theorem(or(X1,implies(X2,not(X1))))),inference(spm,[status(thm)],[258,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(418,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(not(X1))),inference(spm,[status(thm)],[412,255,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(436,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(or(X2,not(X1)))),inference(spm,[status(thm)],[271,277,theory(equality)])).
% cnf(438,plain,(is_a_theorem(implies(or(X1,not(not(X2))),or(X2,X1)))),inference(spm,[status(thm)],[277,290,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(465,plain,(is_a_theorem(or(X1,not(or(X1,X1))))),inference(spm,[status(thm)],[411,263,theory(equality)])).
% cnf(499,plain,(is_a_theorem(or(or(X1,not(X2)),not(implies(X2,X1))))),inference(spm,[status(thm)],[411,278,theory(equality)])).
% cnf(618,plain,(is_a_theorem(or(or(X1,not(X2)),X2))),inference(spm,[status(thm)],[276,292,theory(equality)])).
% cnf(628,plain,(is_a_theorem(implies(X1,or(X2,not(not(X1)))))),inference(spm,[status(thm)],[436,618,theory(equality)])).
% cnf(630,plain,(is_a_theorem(or(or(X1,implies(X2,X3)),and(X2,not(X3))))),inference(spm,[status(thm)],[618,266,theory(equality)])).
% cnf(636,plain,(is_a_theorem(or(X1,not(not(X2))))|~is_a_theorem(X2)),inference(spm,[status(thm)],[271,628,theory(equality)])).
% cnf(702,plain,(is_a_theorem(or(implies(X1,not(X2)),X2))),inference(spm,[status(thm)],[276,330,theory(equality)])).
% cnf(1016,plain,(is_a_theorem(or(X1,not(and(not(X2),X3))))|~is_a_theorem(or(X2,not(X3)))),inference(spm,[status(thm)],[636,291,theory(equality)])).
% cnf(1039,plain,(not(implies(X1,not(X2)))=and(not(not(X1)),X2)),inference(spm,[status(thm)],[291,255,theory(equality)])).
% cnf(1048,plain,(and(X1,X2)=and(not(not(X1)),X2)),inference(rw,[status(thm)],[1039,281,theory(equality)])).
% cnf(1091,plain,(is_a_theorem(or(not(implies(X1,X2)),not(not(or(X2,not(X1))))))),inference(spm,[status(thm)],[461,499,theory(equality)])).
% cnf(1095,plain,(is_a_theorem(or(X1,not(not(implies(X2,not(X1))))))),inference(spm,[status(thm)],[461,702,theory(equality)])).
% cnf(1097,plain,(is_a_theorem(or(not(or(X1,X1)),not(not(X1))))),inference(spm,[status(thm)],[461,465,theory(equality)])).
% cnf(1105,plain,(is_a_theorem(implies(implies(X1,X2),not(and(not(X2),X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1091,291,theory(equality)]),255,theory(equality)])).
% cnf(1109,plain,(is_a_theorem(or(X1,not(and(X2,X1))))),inference(rw,[status(thm)],[1095,281,theory(equality)])).
% cnf(1111,plain,(is_a_theorem(implies(or(X1,X1),not(not(X1))))),inference(rw,[status(thm)],[1097,255,theory(equality)])).
% cnf(1115,plain,(is_a_theorem(or(not(and(X1,X2)),X2))),inference(spm,[status(thm)],[276,1109,theory(equality)])).
% cnf(1127,plain,(is_a_theorem(implies(and(X1,X2),X2))),inference(rw,[status(thm)],[1115,255,theory(equality)])).
% cnf(1274,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(or(X1,X1))),inference(spm,[status(thm)],[271,1111,theory(equality)])).
% cnf(1470,plain,(is_a_theorem(or(not(and(not(X1),X2)),not(implies(X2,X1))))),inference(spm,[status(thm)],[411,1105,theory(equality)])).
% cnf(1487,plain,(is_a_theorem(implies(and(not(X1),X2),not(implies(X2,X1))))),inference(rw,[status(thm)],[1470,255,theory(equality)])).
% cnf(1625,plain,(is_a_theorem(not(and(and(not(X1),X2),implies(X2,X1))))),inference(spm,[status(thm)],[433,1487,theory(equality)])).
% cnf(1640,plain,(is_a_theorem(implies(and(not(X1),X2),and(X2,not(X1))))),inference(rw,[status(thm)],[1625,268,theory(equality)])).
% cnf(2105,plain,(is_a_theorem(implies(or(X1,and(X2,X3)),or(X1,X3)))),inference(spm,[status(thm)],[310,1127,theory(equality)])).
% cnf(2115,plain,(is_a_theorem(implies(or(X1,or(X2,X2)),or(X1,X2)))),inference(spm,[status(thm)],[310,263,theory(equality)])).
% cnf(2130,plain,(is_a_theorem(implies(or(X1,X2),or(X1,implies(X3,X2))))),inference(spm,[status(thm)],[310,258,theory(equality)])).
% cnf(2134,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X1,and(X3,X2)))),inference(spm,[status(thm)],[271,2105,theory(equality)])).
% cnf(2155,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X1,or(X2,X2)))),inference(spm,[status(thm)],[271,2115,theory(equality)])).
% cnf(2238,plain,(is_a_theorem(or(not(X1),X2))|~is_a_theorem(implies(X1,and(X3,X2)))),inference(spm,[status(thm)],[2134,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(2308,plain,(is_a_theorem(implies(or(X1,implies(X2,X3)),or(X1,implies(implies(X4,X2),implies(X4,X3)))))),inference(spm,[status(thm)],[310,314,theory(equality)])).
% cnf(2430,plain,(is_a_theorem(or(not(X1),X2))|~is_a_theorem(implies(X1,or(X2,X2)))),inference(spm,[status(thm)],[2155,255,theory(equality)])).
% cnf(2437,plain,(is_a_theorem(or(X1,not(X1)))),inference(spm,[status(thm)],[2155,292,theory(equality)])).
% cnf(2441,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,or(X2,X2)))),inference(rw,[status(thm)],[2430,255,theory(equality)])).
% cnf(2445,plain,(is_a_theorem(or(not(X1),X1))),inference(spm,[status(thm)],[276,2437,theory(equality)])).
% cnf(2457,plain,(is_a_theorem(implies(X1,X1))),inference(rw,[status(thm)],[2445,255,theory(equality)])).
% cnf(2464,plain,(is_a_theorem(not(and(not(X1),X1)))),inference(spm,[status(thm)],[433,2457,theory(equality)])).
% cnf(2503,plain,(is_a_theorem(implies(and(not(X1),X1),X2))),inference(spm,[status(thm)],[418,2464,theory(equality)])).
% cnf(2566,plain,(is_a_theorem(implies(and(X1,not(X1)),X2))),inference(spm,[status(thm)],[2503,1048,theory(equality)])).
% cnf(2573,plain,(is_a_theorem(or(implies(X1,X1),X2))),inference(rw,[status(thm)],[2566,267,theory(equality)])).
% cnf(2894,plain,(is_a_theorem(not(not(implies(X1,X1))))),inference(spm,[status(thm)],[384,2573,theory(equality)])).
% cnf(2932,plain,(is_a_theorem(X1)|~is_a_theorem(or(not(implies(X2,X2)),X1))),inference(spm,[status(thm)],[293,2894,theory(equality)])).
% cnf(2940,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,X2),X1))),inference(rw,[status(thm)],[2932,255,theory(equality)])).
% cnf(3219,plain,(is_a_theorem(or(X1,implies(or(X1,X2),X2)))),inference(spm,[status(thm)],[2940,323,theory(equality)])).
% cnf(3366,plain,(is_a_theorem(or(implies(or(X1,X2),X2),not(not(X1))))),inference(spm,[status(thm)],[461,3219,theory(equality)])).
% cnf(8728,plain,(is_a_theorem(implies(and(not(X1),X2),not(X1)))),inference(spm,[status(thm)],[2244,1640,theory(equality)])).
% cnf(8760,plain,(is_a_theorem(not(and(and(not(X1),X2),X1)))),inference(spm,[status(thm)],[433,8728,theory(equality)])).
% cnf(8865,plain,(is_a_theorem(not(and(and(X1,X2),not(X1))))),inference(spm,[status(thm)],[8760,1048,theory(equality)])).
% cnf(8882,plain,(is_a_theorem(implies(and(X1,X2),X1))),inference(rw,[status(thm)],[8865,266,theory(equality)])).
% cnf(9903,plain,(is_a_theorem(implies(or(X1,and(X2,X3)),or(X1,X2)))),inference(spm,[status(thm)],[310,8882,theory(equality)])).
% cnf(11730,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X1,and(X2,X3)))),inference(spm,[status(thm)],[271,9903,theory(equality)])).
% cnf(12871,plain,(is_a_theorem(implies(or(implies(X1,X2),X2),implies(X1,X2)))),inference(spm,[status(thm)],[2441,2130,theory(equality)])).
% cnf(13918,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(or(implies(X1,X2),X2))),inference(spm,[status(thm)],[271,12871,theory(equality)])).
% cnf(15120,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X2,not(not(X1))))),inference(spm,[status(thm)],[271,438,theory(equality)])).
% cnf(34824,plain,(is_a_theorem(or(or(X1,implies(X2,X3)),X2))),inference(spm,[status(thm)],[11730,630,theory(equality)])).
% cnf(34863,plain,(is_a_theorem(or(X1,or(X2,implies(not(not(X1)),X3))))),inference(spm,[status(thm)],[15120,34824,theory(equality)])).
% cnf(34885,plain,(is_a_theorem(or(X1,or(X2,implies(X1,X3))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[34863,290,theory(equality)]),255,theory(equality)])).
% cnf(34954,plain,(is_a_theorem(or(X1,or(X2,implies(X2,X3))))),inference(spm,[status(thm)],[318,34885,theory(equality)])).
% cnf(34992,plain,(is_a_theorem(not(not(or(X1,implies(X1,X2)))))),inference(spm,[status(thm)],[1274,34954,theory(equality)])).
% cnf(35164,plain,(is_a_theorem(X1)|~is_a_theorem(or(not(or(X2,implies(X2,X3))),X1))),inference(spm,[status(thm)],[293,34992,theory(equality)])).
% cnf(35186,plain,(is_a_theorem(X1)|~is_a_theorem(implies(or(X2,implies(X2,X3)),X1))),inference(rw,[status(thm)],[35164,255,theory(equality)])).
% cnf(114815,plain,(is_a_theorem(or(X1,not(and(not(implies(or(X2,X3),X3)),not(X2)))))),inference(spm,[status(thm)],[1016,3366,theory(equality)])).
% cnf(114949,plain,(is_a_theorem(or(X1,or(implies(or(X2,X3),X3),X2)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[114815,266,theory(equality)]),290,theory(equality)])).
% cnf(115231,plain,(is_a_theorem(or(implies(or(X1,X2),X2),or(X3,X1)))),inference(spm,[status(thm)],[318,114949,theory(equality)])).
% cnf(117997,plain,(is_a_theorem(implies(or(X1,or(X2,X1)),or(X2,X1)))),inference(spm,[status(thm)],[13918,115231,theory(equality)])).
% cnf(125499,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X2,or(X1,X2)))),inference(spm,[status(thm)],[271,117997,theory(equality)])).
% cnf(133558,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(or(X2,implies(X1,X2)))),inference(spm,[status(thm)],[125499,255,theory(equality)])).
% cnf(231393,plain,(is_a_theorem(or(X1,implies(implies(X2,X1),implies(X2,X3))))),inference(spm,[status(thm)],[35186,2308,theory(equality)])).
% cnf(231472,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))),inference(spm,[status(thm)],[133558,231393,theory(equality)])).
% cnf(231588,plain,($false),inference(rw,[status(thm)],[269,231472,theory(equality)])).
% cnf(231589,plain,($false),inference(cn,[status(thm)],[231588,theory(equality)])).
% cnf(231590,plain,($false),231589,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6669
% # ...of these trivial : 1685
% # ...subsumed : 2275
% # ...remaining for further processing: 2709
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 24
% # Backward-rewritten : 951
% # Generated clauses : 143298
% # ...of the previous two non-trivial : 87245
% # Contextual simplify-reflections : 81
% # Paramodulations : 143298
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1734
% # Positive orientable unit clauses: 1403
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 4
% # Non-unit-clauses : 326
% # Current number of unprocessed clauses: 34769
% # ...number of literals in the above : 42019
% # Clause-clause subsumption calls (NU) : 18085
% # Rec. Clause-clause subsumption calls : 18058
% # Unit Clause-clause subsumption calls : 2107
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 123089
% # Indexed BW rewrite successes : 599
% # Backwards rewriting index: 833 leaves, 5.15+/-12.051 terms/leaf
% # Paramod-from index: 122 leaves, 11.73+/-25.719 terms/leaf
% # Paramod-into index: 816 leaves, 5.16+/-12.029 terms/leaf
% # -------------------------------------------------
% # User time : 5.100 s
% # System time : 0.172 s
% # Total time : 5.272 s
% # Maximum resident set size: 0 pages
% PrfWatch: 8.32 CPU 8.50 WC
% FINAL PrfWatch: 8.32 CPU 8.50 WC
% SZS output end Solution for /tmp/SystemOnTPTP16213/LCL485+1.tptp
%
%------------------------------------------------------------------------------