TSTP Solution File: LCL497+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL497+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 13:46:26 EST 2010
% Result : Theorem 4.62s
% Output : Solution 4.62s
% 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/SystemOnTPTP6382/LCL497+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6382/LCL497+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6382/LCL497+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 6514
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.94 CPU 2.03 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(cn2<=>![X1]:![X2]:is_a_theorem(implies(X1,implies(not(X1),X2)))),file('/tmp/SRASS.s.p', cn2)).
% 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(7, axiom,r4,file('/tmp/SRASS.s.p', principia_r4)).
% fof(8, axiom,r5,file('/tmp/SRASS.s.p', principia_r5)).
% fof(11, axiom,op_and,file('/tmp/SRASS.s.p', principia_op_and)).
% fof(12, axiom,op_equiv,file('/tmp/SRASS.s.p', principia_op_equiv)).
% fof(13, axiom,substitution_of_equivalents,file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(14, axiom,op_or,file('/tmp/SRASS.s.p', luka_op_or)).
% fof(17, 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(22, axiom,(r1<=>![X1]:is_a_theorem(implies(or(X1,X1),X1))),file('/tmp/SRASS.s.p', r1)).
% fof(23, axiom,(r2<=>![X1]:![X2]:is_a_theorem(implies(X2,or(X1,X2)))),file('/tmp/SRASS.s.p', r2)).
% fof(24, axiom,(r3<=>![X1]:![X2]:is_a_theorem(implies(or(X1,X2),or(X2,X1)))),file('/tmp/SRASS.s.p', r3)).
% fof(25, axiom,(r4<=>![X1]:![X2]:![X5]:is_a_theorem(implies(or(X1,or(X2,X5)),or(X2,or(X1,X5))))),file('/tmp/SRASS.s.p', r4)).
% fof(26, axiom,(r5<=>![X1]:![X2]:![X5]:is_a_theorem(implies(implies(X2,X5),implies(or(X1,X2),or(X1,X5))))),file('/tmp/SRASS.s.p', r5)).
% fof(28, axiom,(op_implies_or=>![X3]:![X4]:implies(X3,X4)=or(not(X3),X4)),file('/tmp/SRASS.s.p', op_implies_or)).
% fof(40, axiom,(substitution_of_equivalents<=>![X3]:![X4]:(is_a_theorem(equiv(X3,X4))=>X3=X4)),file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(41, axiom,(op_or=>![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),file('/tmp/SRASS.s.p', op_or)).
% fof(42, axiom,(op_and=>![X3]:![X4]:and(X3,X4)=not(or(not(X3),not(X4)))),file('/tmp/SRASS.s.p', op_and)).
% fof(43, axiom,(op_equiv=>![X3]:![X4]:equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))),file('/tmp/SRASS.s.p', op_equiv)).
% fof(45, conjecture,cn2,file('/tmp/SRASS.s.p', luka_cn2)).
% fof(46, negated_conjecture,~(cn2),inference(assume_negation,[status(cth)],[45])).
% fof(47, negated_conjecture,~(cn2),inference(fof_simplification,[status(thm)],[46,theory(equality)])).
% fof(48, plain,((~(cn2)|![X1]:![X2]:is_a_theorem(implies(X1,implies(not(X1),X2))))&(?[X1]:?[X2]:~(is_a_theorem(implies(X1,implies(not(X1),X2))))|cn2)),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,((~(cn2)|![X3]:![X4]:is_a_theorem(implies(X3,implies(not(X3),X4))))&(?[X5]:?[X6]:~(is_a_theorem(implies(X5,implies(not(X5),X6))))|cn2)),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,((~(cn2)|![X3]:![X4]:is_a_theorem(implies(X3,implies(not(X3),X4))))&(~(is_a_theorem(implies(esk1_0,implies(not(esk1_0),esk2_0))))|cn2)),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X3]:![X4]:((is_a_theorem(implies(X3,implies(not(X3),X4)))|~(cn2))&(~(is_a_theorem(implies(esk1_0,implies(not(esk1_0),esk2_0))))|cn2)),inference(shift_quantors,[status(thm)],[50])).
% cnf(52,plain,(cn2|~is_a_theorem(implies(esk1_0,implies(not(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(59,plain,(r4),inference(split_conjunct,[status(thm)],[7])).
% cnf(60,plain,(r5),inference(split_conjunct,[status(thm)],[8])).
% cnf(73,plain,(op_and),inference(split_conjunct,[status(thm)],[11])).
% cnf(74,plain,(op_equiv),inference(split_conjunct,[status(thm)],[12])).
% cnf(75,plain,(substitution_of_equivalents),inference(split_conjunct,[status(thm)],[13])).
% cnf(76,plain,(op_or),inference(split_conjunct,[status(thm)],[14])).
% fof(84, 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)],[17])).
% fof(85, 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)],[84])).
% fof(86, plain,((~(modus_ponens)|![X5]:![X6]:((~(is_a_theorem(X5))|~(is_a_theorem(implies(X5,X6))))|is_a_theorem(X6)))&(((is_a_theorem(esk9_0)&is_a_theorem(implies(esk9_0,esk10_0)))&~(is_a_theorem(esk10_0)))|modus_ponens)),inference(skolemize,[status(esa)],[85])).
% fof(87, plain,![X5]:![X6]:((((~(is_a_theorem(X5))|~(is_a_theorem(implies(X5,X6))))|is_a_theorem(X6))|~(modus_ponens))&(((is_a_theorem(esk9_0)&is_a_theorem(implies(esk9_0,esk10_0)))&~(is_a_theorem(esk10_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[86])).
% fof(88, plain,![X5]:![X6]:((((~(is_a_theorem(X5))|~(is_a_theorem(implies(X5,X6))))|is_a_theorem(X6))|~(modus_ponens))&(((is_a_theorem(esk9_0)|modus_ponens)&(is_a_theorem(implies(esk9_0,esk10_0))|modus_ponens))&(~(is_a_theorem(esk10_0))|modus_ponens))),inference(distribute,[status(thm)],[87])).
% cnf(92,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[88])).
% fof(117, plain,((~(r1)|![X1]:is_a_theorem(implies(or(X1,X1),X1)))&(?[X1]:~(is_a_theorem(implies(or(X1,X1),X1)))|r1)),inference(fof_nnf,[status(thm)],[22])).
% fof(118, plain,((~(r1)|![X2]:is_a_theorem(implies(or(X2,X2),X2)))&(?[X3]:~(is_a_theorem(implies(or(X3,X3),X3)))|r1)),inference(variable_rename,[status(thm)],[117])).
% fof(119, plain,((~(r1)|![X2]:is_a_theorem(implies(or(X2,X2),X2)))&(~(is_a_theorem(implies(or(esk21_0,esk21_0),esk21_0)))|r1)),inference(skolemize,[status(esa)],[118])).
% fof(120, plain,![X2]:((is_a_theorem(implies(or(X2,X2),X2))|~(r1))&(~(is_a_theorem(implies(or(esk21_0,esk21_0),esk21_0)))|r1)),inference(shift_quantors,[status(thm)],[119])).
% cnf(122,plain,(is_a_theorem(implies(or(X1,X1),X1))|~r1),inference(split_conjunct,[status(thm)],[120])).
% fof(123, plain,((~(r2)|![X1]:![X2]:is_a_theorem(implies(X2,or(X1,X2))))&(?[X1]:?[X2]:~(is_a_theorem(implies(X2,or(X1,X2))))|r2)),inference(fof_nnf,[status(thm)],[23])).
% fof(124, plain,((~(r2)|![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4))))&(?[X5]:?[X6]:~(is_a_theorem(implies(X6,or(X5,X6))))|r2)),inference(variable_rename,[status(thm)],[123])).
% fof(125, plain,((~(r2)|![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4))))&(~(is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0))))|r2)),inference(skolemize,[status(esa)],[124])).
% fof(126, plain,![X3]:![X4]:((is_a_theorem(implies(X4,or(X3,X4)))|~(r2))&(~(is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0))))|r2)),inference(shift_quantors,[status(thm)],[125])).
% cnf(128,plain,(is_a_theorem(implies(X1,or(X2,X1)))|~r2),inference(split_conjunct,[status(thm)],[126])).
% fof(129, 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)],[24])).
% fof(130, 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)],[129])).
% fof(131, plain,((~(r3)|![X3]:![X4]:is_a_theorem(implies(or(X3,X4),or(X4,X3))))&(~(is_a_theorem(implies(or(esk24_0,esk25_0),or(esk25_0,esk24_0))))|r3)),inference(skolemize,[status(esa)],[130])).
% fof(132, plain,![X3]:![X4]:((is_a_theorem(implies(or(X3,X4),or(X4,X3)))|~(r3))&(~(is_a_theorem(implies(or(esk24_0,esk25_0),or(esk25_0,esk24_0))))|r3)),inference(shift_quantors,[status(thm)],[131])).
% cnf(134,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3),inference(split_conjunct,[status(thm)],[132])).
% fof(135, plain,((~(r4)|![X1]:![X2]:![X5]:is_a_theorem(implies(or(X1,or(X2,X5)),or(X2,or(X1,X5)))))&(?[X1]:?[X2]:?[X5]:~(is_a_theorem(implies(or(X1,or(X2,X5)),or(X2,or(X1,X5)))))|r4)),inference(fof_nnf,[status(thm)],[25])).
% fof(136, plain,((~(r4)|![X6]:![X7]:![X8]:is_a_theorem(implies(or(X6,or(X7,X8)),or(X7,or(X6,X8)))))&(?[X9]:?[X10]:?[X11]:~(is_a_theorem(implies(or(X9,or(X10,X11)),or(X10,or(X9,X11)))))|r4)),inference(variable_rename,[status(thm)],[135])).
% fof(137, plain,((~(r4)|![X6]:![X7]:![X8]:is_a_theorem(implies(or(X6,or(X7,X8)),or(X7,or(X6,X8)))))&(~(is_a_theorem(implies(or(esk26_0,or(esk27_0,esk28_0)),or(esk27_0,or(esk26_0,esk28_0)))))|r4)),inference(skolemize,[status(esa)],[136])).
% fof(138, plain,![X6]:![X7]:![X8]:((is_a_theorem(implies(or(X6,or(X7,X8)),or(X7,or(X6,X8))))|~(r4))&(~(is_a_theorem(implies(or(esk26_0,or(esk27_0,esk28_0)),or(esk27_0,or(esk26_0,esk28_0)))))|r4)),inference(shift_quantors,[status(thm)],[137])).
% cnf(140,plain,(is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|~r4),inference(split_conjunct,[status(thm)],[138])).
% fof(141, plain,((~(r5)|![X1]:![X2]:![X5]:is_a_theorem(implies(implies(X2,X5),implies(or(X1,X2),or(X1,X5)))))&(?[X1]:?[X2]:?[X5]:~(is_a_theorem(implies(implies(X2,X5),implies(or(X1,X2),or(X1,X5)))))|r5)),inference(fof_nnf,[status(thm)],[26])).
% fof(142, 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)],[141])).
% fof(143, plain,((~(r5)|![X6]:![X7]:![X8]:is_a_theorem(implies(implies(X7,X8),implies(or(X6,X7),or(X6,X8)))))&(~(is_a_theorem(implies(implies(esk30_0,esk31_0),implies(or(esk29_0,esk30_0),or(esk29_0,esk31_0)))))|r5)),inference(skolemize,[status(esa)],[142])).
% fof(144, plain,![X6]:![X7]:![X8]:((is_a_theorem(implies(implies(X7,X8),implies(or(X6,X7),or(X6,X8))))|~(r5))&(~(is_a_theorem(implies(implies(esk30_0,esk31_0),implies(or(esk29_0,esk30_0),or(esk29_0,esk31_0)))))|r5)),inference(shift_quantors,[status(thm)],[143])).
% cnf(146,plain,(is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5),inference(split_conjunct,[status(thm)],[144])).
% fof(151, plain,(~(op_implies_or)|![X3]:![X4]:implies(X3,X4)=or(not(X3),X4)),inference(fof_nnf,[status(thm)],[28])).
% fof(152, plain,(~(op_implies_or)|![X5]:![X6]:implies(X5,X6)=or(not(X5),X6)),inference(variable_rename,[status(thm)],[151])).
% fof(153, plain,![X5]:![X6]:(implies(X5,X6)=or(not(X5),X6)|~(op_implies_or)),inference(shift_quantors,[status(thm)],[152])).
% cnf(154,plain,(implies(X1,X2)=or(not(X1),X2)|~op_implies_or),inference(split_conjunct,[status(thm)],[153])).
% fof(221, 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)],[40])).
% fof(222, 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)],[221])).
% fof(223, 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)],[222])).
% fof(224, 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)],[223])).
% fof(225, 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)],[224])).
% cnf(228,plain,(X1=X2|~substitution_of_equivalents|~is_a_theorem(equiv(X1,X2))),inference(split_conjunct,[status(thm)],[225])).
% fof(229, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(fof_nnf,[status(thm)],[41])).
% fof(230, plain,(~(op_or)|![X5]:![X6]:or(X5,X6)=not(and(not(X5),not(X6)))),inference(variable_rename,[status(thm)],[229])).
% fof(231, plain,![X5]:![X6]:(or(X5,X6)=not(and(not(X5),not(X6)))|~(op_or)),inference(shift_quantors,[status(thm)],[230])).
% cnf(232,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[231])).
% fof(233, plain,(~(op_and)|![X3]:![X4]:and(X3,X4)=not(or(not(X3),not(X4)))),inference(fof_nnf,[status(thm)],[42])).
% fof(234, plain,(~(op_and)|![X5]:![X6]:and(X5,X6)=not(or(not(X5),not(X6)))),inference(variable_rename,[status(thm)],[233])).
% fof(235, plain,![X5]:![X6]:(and(X5,X6)=not(or(not(X5),not(X6)))|~(op_and)),inference(shift_quantors,[status(thm)],[234])).
% cnf(236,plain,(and(X1,X2)=not(or(not(X1),not(X2)))|~op_and),inference(split_conjunct,[status(thm)],[235])).
% fof(237, plain,(~(op_equiv)|![X3]:![X4]:equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))),inference(fof_nnf,[status(thm)],[43])).
% fof(238, plain,(~(op_equiv)|![X5]:![X6]:equiv(X5,X6)=and(implies(X5,X6),implies(X6,X5))),inference(variable_rename,[status(thm)],[237])).
% fof(239, plain,![X5]:![X6]:(equiv(X5,X6)=and(implies(X5,X6),implies(X6,X5))|~(op_equiv)),inference(shift_quantors,[status(thm)],[238])).
% cnf(240,plain,(equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv),inference(split_conjunct,[status(thm)],[239])).
% cnf(242,negated_conjecture,(~cn2),inference(split_conjunct,[status(thm)],[47])).
% cnf(247,plain,(~is_a_theorem(implies(esk1_0,implies(not(esk1_0),esk2_0)))),inference(sr,[status(thm)],[52,242,theory(equality)])).
% cnf(252,plain,(X1=X2|$false|~is_a_theorem(equiv(X1,X2))),inference(rw,[status(thm)],[228,75,theory(equality)])).
% cnf(253,plain,(X1=X2|~is_a_theorem(equiv(X1,X2))),inference(cn,[status(thm)],[252,theory(equality)])).
% cnf(255,plain,(or(not(X1),X2)=implies(X1,X2)|$false),inference(rw,[status(thm)],[154,54,theory(equality)])).
% cnf(256,plain,(or(not(X1),X2)=implies(X1,X2)),inference(cn,[status(thm)],[255,theory(equality)])).
% cnf(257,plain,(is_a_theorem(implies(X1,or(X2,X1)))|$false),inference(rw,[status(thm)],[128,57,theory(equality)])).
% cnf(258,plain,(is_a_theorem(implies(X1,or(X2,X1)))),inference(cn,[status(thm)],[257,theory(equality)])).
% cnf(263,plain,(is_a_theorem(implies(or(X1,X1),X1))|$false),inference(rw,[status(thm)],[122,56,theory(equality)])).
% cnf(264,plain,(is_a_theorem(implies(or(X1,X1),X1))),inference(cn,[status(thm)],[263,theory(equality)])).
% cnf(266,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[92,55,theory(equality)])).
% cnf(267,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[266,theory(equality)])).
% cnf(269,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(X2)),inference(spm,[status(thm)],[267,258,theory(equality)])).
% cnf(270,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))|$false),inference(rw,[status(thm)],[134,58,theory(equality)])).
% cnf(271,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))),inference(cn,[status(thm)],[270,theory(equality)])).
% cnf(272,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X2,X1))),inference(spm,[status(thm)],[267,271,theory(equality)])).
% cnf(273,plain,(is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))),inference(spm,[status(thm)],[271,256,theory(equality)])).
% cnf(275,plain,(not(and(not(X1),not(X2)))=or(X1,X2)|$false),inference(rw,[status(thm)],[232,76,theory(equality)])).
% cnf(276,plain,(not(and(not(X1),not(X2)))=or(X1,X2)),inference(cn,[status(thm)],[275,theory(equality)])).
% cnf(277,plain,(or(or(X1,X2),X3)=implies(and(not(X1),not(X2)),X3)),inference(spm,[status(thm)],[256,276,theory(equality)])).
% cnf(282,plain,(not(implies(X1,not(X2)))=and(X1,X2)|~op_and),inference(rw,[status(thm)],[236,256,theory(equality)])).
% cnf(283,plain,(not(implies(X1,not(X2)))=and(X1,X2)|$false),inference(rw,[status(thm)],[282,73,theory(equality)])).
% cnf(284,plain,(not(implies(X1,not(X2)))=and(X1,X2)),inference(cn,[status(thm)],[283,theory(equality)])).
% cnf(285,plain,(or(and(X1,X2),X3)=implies(implies(X1,not(X2)),X3)),inference(spm,[status(thm)],[256,284,theory(equality)])).
% cnf(290,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)|$false),inference(rw,[status(thm)],[240,74,theory(equality)])).
% cnf(291,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)),inference(cn,[status(thm)],[290,theory(equality)])).
% cnf(292,plain,(is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|$false),inference(rw,[status(thm)],[146,60,theory(equality)])).
% cnf(293,plain,(is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))),inference(cn,[status(thm)],[292,theory(equality)])).
% cnf(294,plain,(is_a_theorem(implies(or(X1,X2),or(X1,X3)))|~is_a_theorem(implies(X2,X3))),inference(spm,[status(thm)],[267,293,theory(equality)])).
% cnf(295,plain,(is_a_theorem(implies(implies(X1,X2),implies(or(not(X3),X1),implies(X3,X2))))),inference(spm,[status(thm)],[293,256,theory(equality)])).
% cnf(297,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2))))),inference(rw,[status(thm)],[295,256,theory(equality)])).
% cnf(299,plain,(is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|$false),inference(rw,[status(thm)],[140,59,theory(equality)])).
% cnf(300,plain,(is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))),inference(cn,[status(thm)],[299,theory(equality)])).
% cnf(346,plain,(is_a_theorem(or(X1,not(X2)))|~is_a_theorem(implies(X2,X1))),inference(spm,[status(thm)],[272,256,theory(equality)])).
% cnf(347,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(X1)),inference(spm,[status(thm)],[272,269,theory(equality)])).
% cnf(352,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(not(X1))),inference(spm,[status(thm)],[347,256,theory(equality)])).
% cnf(358,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(or(X2,not(X1)))),inference(spm,[status(thm)],[267,273,theory(equality)])).
% cnf(367,plain,(is_a_theorem(implies(X1,not(X2)))|~is_a_theorem(implies(X2,not(X1)))),inference(spm,[status(thm)],[358,256,theory(equality)])).
% cnf(377,plain,(is_a_theorem(or(or(X1,or(X2,X3)),not(or(X2,or(X1,X3)))))),inference(spm,[status(thm)],[346,300,theory(equality)])).
% cnf(426,plain,(is_a_theorem(or(or(X1,X2),or(X3,and(not(X1),not(X2)))))),inference(spm,[status(thm)],[258,277,theory(equality)])).
% cnf(570,plain,(is_a_theorem(or(or(X1,or(not(X2),X3)),not(implies(X2,or(X1,X3)))))),inference(spm,[status(thm)],[377,256,theory(equality)])).
% cnf(576,plain,(is_a_theorem(or(or(X1,implies(X2,X3)),not(implies(X2,or(X1,X3)))))),inference(rw,[status(thm)],[570,256,theory(equality)])).
% cnf(1075,plain,(is_a_theorem(implies(or(X1,or(X2,X2)),or(X1,X2)))),inference(spm,[status(thm)],[294,264,theory(equality)])).
% cnf(1088,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X1,or(X2,X2)))),inference(spm,[status(thm)],[267,1075,theory(equality)])).
% cnf(1145,plain,(is_a_theorem(or(not(X1),X2))|~is_a_theorem(implies(X1,or(X2,X2)))),inference(spm,[status(thm)],[1088,256,theory(equality)])).
% cnf(1151,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,or(X2,X2)))),inference(rw,[status(thm)],[1145,256,theory(equality)])).
% cnf(1166,plain,(is_a_theorem(implies(X1,X1))),inference(spm,[status(thm)],[1151,258,theory(equality)])).
% cnf(1172,plain,(is_a_theorem(implies(X1,not(not(X1))))),inference(spm,[status(thm)],[367,1166,theory(equality)])).
% cnf(1226,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[267,1172,theory(equality)])).
% cnf(1228,plain,(is_a_theorem(implies(or(X1,X2),or(X1,not(not(X2)))))),inference(spm,[status(thm)],[294,1172,theory(equality)])).
% cnf(1260,plain,(is_a_theorem(not(and(X1,X2)))|~is_a_theorem(implies(X1,not(X2)))),inference(spm,[status(thm)],[1226,284,theory(equality)])).
% cnf(1455,plain,(is_a_theorem(implies(or(not(not(X1)),X1),not(not(X1))))),inference(spm,[status(thm)],[1151,1228,theory(equality)])).
% cnf(1465,plain,(is_a_theorem(implies(implies(not(X1),X1),not(not(X1))))),inference(rw,[status(thm)],[1455,256,theory(equality)])).
% cnf(1470,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(implies(not(X1),X1))),inference(spm,[status(thm)],[267,1465,theory(equality)])).
% cnf(1809,plain,(is_a_theorem(not(and(not(X1),X1)))),inference(spm,[status(thm)],[1260,1166,theory(equality)])).
% cnf(1810,plain,(is_a_theorem(not(and(X1,not(X1))))),inference(spm,[status(thm)],[1260,1172,theory(equality)])).
% cnf(1819,plain,(is_a_theorem(implies(and(not(X1),X1),X2))),inference(spm,[status(thm)],[352,1809,theory(equality)])).
% cnf(1837,plain,(is_a_theorem(implies(and(X1,not(X1)),X2))),inference(spm,[status(thm)],[352,1810,theory(equality)])).
% cnf(1863,plain,(is_a_theorem(or(or(not(X1),X1),X2))),inference(spm,[status(thm)],[1819,277,theory(equality)])).
% cnf(1871,plain,(is_a_theorem(or(implies(X1,X1),X2))),inference(rw,[status(thm)],[1863,256,theory(equality)])).
% cnf(1880,plain,(is_a_theorem(implies(or(X1,and(X2,not(X2))),or(X1,X3)))),inference(spm,[status(thm)],[294,1837,theory(equality)])).
% cnf(2246,plain,(is_a_theorem(implies(X1,implies(X2,X2)))),inference(spm,[status(thm)],[358,1871,theory(equality)])).
% cnf(3610,plain,(is_a_theorem(or(or(X1,X2),and(not(X1),not(X2))))),inference(spm,[status(thm)],[1088,426,theory(equality)])).
% cnf(3899,plain,(is_a_theorem(or(and(not(X1),not(X2)),or(X1,X2)))),inference(spm,[status(thm)],[272,3610,theory(equality)])).
% cnf(3914,plain,(is_a_theorem(implies(implies(not(X1),not(not(X2))),or(X1,X2)))),inference(rw,[status(thm)],[3899,285,theory(equality)])).
% cnf(4945,plain,(is_a_theorem(implies(or(X1,and(X2,not(X2))),X1))),inference(spm,[status(thm)],[1151,1880,theory(equality)])).
% cnf(4966,plain,(is_a_theorem(X1)|~is_a_theorem(or(X1,and(X2,not(X2))))),inference(spm,[status(thm)],[267,4945,theory(equality)])).
% cnf(7435,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(implies(not(X1),not(not(X2))))),inference(spm,[status(thm)],[267,3914,theory(equality)])).
% cnf(10550,plain,(is_a_theorem(not(not(implies(X1,X1))))),inference(spm,[status(thm)],[1470,2246,theory(equality)])).
% cnf(10587,plain,(is_a_theorem(implies(not(implies(X1,X1)),X2))),inference(spm,[status(thm)],[352,10550,theory(equality)])).
% cnf(10676,plain,(is_a_theorem(implies(or(X1,not(implies(X2,X2))),or(X1,X3)))),inference(spm,[status(thm)],[294,10587,theory(equality)])).
% cnf(19340,plain,(is_a_theorem(implies(or(X1,not(implies(X2,X2))),X1))),inference(spm,[status(thm)],[1151,10676,theory(equality)])).
% cnf(19376,plain,(is_a_theorem(X1)|~is_a_theorem(or(X1,not(implies(X2,X2))))),inference(spm,[status(thm)],[267,19340,theory(equality)])).
% cnf(19467,plain,(is_a_theorem(or(X1,implies(or(X1,X2),X2)))),inference(spm,[status(thm)],[19376,576,theory(equality)])).
% cnf(19532,plain,(is_a_theorem(or(implies(or(X1,X2),X2),X1))),inference(spm,[status(thm)],[272,19467,theory(equality)])).
% cnf(19559,plain,(is_a_theorem(implies(or(and(X1,not(X1)),X2),X2))),inference(spm,[status(thm)],[4966,19532,theory(equality)])).
% cnf(19560,plain,(is_a_theorem(implies(X1,implies(or(not(X1),X2),X2)))),inference(spm,[status(thm)],[358,19532,theory(equality)])).
% cnf(19578,plain,(is_a_theorem(implies(implies(implies(X1,not(not(X1))),X2),X2))),inference(rw,[status(thm)],[19559,285,theory(equality)])).
% cnf(19579,plain,(is_a_theorem(implies(X1,implies(implies(X1,X2),X2)))),inference(rw,[status(thm)],[19560,256,theory(equality)])).
% cnf(19586,plain,(is_a_theorem(implies(implies(X1,X2),X2))|~is_a_theorem(X1)),inference(spm,[status(thm)],[267,19579,theory(equality)])).
% cnf(20330,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,not(not(X2))),X1))),inference(spm,[status(thm)],[267,19578,theory(equality)])).
% cnf(21141,plain,(is_a_theorem(implies(implies(X1,X2),implies(X1,not(not(X2)))))),inference(spm,[status(thm)],[20330,297,theory(equality)])).
% cnf(21238,plain,(is_a_theorem(implies(X1,not(not(not(not(X1))))))),inference(spm,[status(thm)],[20330,21141,theory(equality)])).
% cnf(21273,plain,(is_a_theorem(or(X1,not(not(not(X1)))))),inference(spm,[status(thm)],[7435,21238,theory(equality)])).
% cnf(21360,plain,(is_a_theorem(or(not(not(not(X1))),X1))),inference(spm,[status(thm)],[272,21273,theory(equality)])).
% cnf(21376,plain,(is_a_theorem(implies(not(not(X1)),X1))),inference(rw,[status(thm)],[21360,256,theory(equality)])).
% cnf(30241,plain,(is_a_theorem(implies(X1,not(implies(X2,not(X1)))))|~is_a_theorem(X2)),inference(spm,[status(thm)],[367,19586,theory(equality)])).
% cnf(30265,plain,(is_a_theorem(implies(X1,and(X2,X1)))|~is_a_theorem(X2)),inference(rw,[status(thm)],[30241,284,theory(equality)])).
% cnf(31264,plain,(is_a_theorem(and(X1,X2))|~is_a_theorem(X2)|~is_a_theorem(X1)),inference(spm,[status(thm)],[267,30265,theory(equality)])).
% cnf(31335,plain,(is_a_theorem(equiv(X1,X2))|~is_a_theorem(implies(X2,X1))|~is_a_theorem(implies(X1,X2))),inference(spm,[status(thm)],[31264,291,theory(equality)])).
% cnf(89891,plain,(is_a_theorem(equiv(or(X1,X2),or(X2,X1)))|~is_a_theorem(implies(or(X1,X2),or(X2,X1)))),inference(spm,[status(thm)],[31335,271,theory(equality)])).
% cnf(90125,plain,(is_a_theorem(equiv(X1,not(not(X1))))|~is_a_theorem(implies(X1,not(not(X1))))),inference(spm,[status(thm)],[31335,21376,theory(equality)])).
% cnf(90302,plain,(is_a_theorem(equiv(or(X1,X2),or(X2,X1)))|$false),inference(rw,[status(thm)],[89891,271,theory(equality)])).
% cnf(90303,plain,(is_a_theorem(equiv(or(X1,X2),or(X2,X1)))),inference(cn,[status(thm)],[90302,theory(equality)])).
% cnf(90398,plain,(is_a_theorem(equiv(X1,not(not(X1))))|$false),inference(rw,[status(thm)],[90125,1172,theory(equality)])).
% cnf(90399,plain,(is_a_theorem(equiv(X1,not(not(X1))))),inference(cn,[status(thm)],[90398,theory(equality)])).
% cnf(91488,plain,(X1=not(not(X1))),inference(spm,[status(thm)],[253,90399,theory(equality)])).
% cnf(91514,plain,(or(X1,X2)=implies(not(X1),X2)),inference(spm,[status(thm)],[256,91488,theory(equality)])).
% cnf(95596,plain,(or(X1,X2)=or(X2,X1)),inference(spm,[status(thm)],[253,90303,theory(equality)])).
% cnf(95872,plain,(is_a_theorem(implies(X1,or(X1,X2)))),inference(spm,[status(thm)],[258,95596,theory(equality)])).
% cnf(98469,plain,(~is_a_theorem(implies(esk1_0,or(esk1_0,esk2_0)))),inference(rw,[status(thm)],[247,91514,theory(equality)])).
% cnf(99642,plain,($false),inference(rw,[status(thm)],[98469,95872,theory(equality)])).
% cnf(99643,plain,($false),inference(cn,[status(thm)],[99642,theory(equality)])).
% cnf(99644,plain,($false),99643,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2927
% # ...of these trivial : 491
% # ...subsumed : 969
% # ...remaining for further processing: 1467
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 20
% # Backward-rewritten : 1057
% # Generated clauses : 65414
% # ...of the previous two non-trivial : 49579
% # Contextual simplify-reflections : 43
% # Paramodulations : 65414
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 390
% # Positive orientable unit clauses: 235
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 4
% # Non-unit-clauses : 148
% # Current number of unprocessed clauses: 8183
% # ...number of literals in the above : 11342
% # Clause-clause subsumption calls (NU) : 9890
% # Rec. Clause-clause subsumption calls : 9882
% # Unit Clause-clause subsumption calls : 1556
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 41896
% # Indexed BW rewrite successes : 819
% # Backwards rewriting index: 409 leaves, 2.44+/-3.387 terms/leaf
% # Paramod-from index: 88 leaves, 2.88+/-5.105 terms/leaf
% # Paramod-into index: 383 leaves, 2.33+/-3.258 terms/leaf
% # -------------------------------------------------
% # User time : 2.077 s
% # System time : 0.083 s
% # Total time : 2.160 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.53 CPU 3.62 WC
% FINAL PrfWatch: 3.53 CPU 3.62 WC
% SZS output end Solution for /tmp/SystemOnTPTP6382/LCL497+1.tptp
%
%------------------------------------------------------------------------------