TSTP Solution File: LCL517+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL517+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:46:20 EST 2010
% Result : Theorem 10.10s
% Output : Solution 10.10s
% 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/SystemOnTPTP32151/LCL517+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32151/LCL517+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32151/LCL517+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 32247
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% PrfWatch: 3.91 CPU 4.01 WC
% PrfWatch: 5.90 CPU 6.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.89 CPU 8.02 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,(cn3<=>![X1]:is_a_theorem(implies(implies(not(X1),X1),X1))),file('/tmp/SRASS.s.p', cn3)).
% fof(2, axiom,op_implies_and,file('/tmp/SRASS.s.p', rosser_op_implies_and)).
% fof(3, axiom,modus_ponens,file('/tmp/SRASS.s.p', rosser_modus_ponens)).
% fof(4, axiom,kn1,file('/tmp/SRASS.s.p', rosser_kn1)).
% fof(5, axiom,kn2,file('/tmp/SRASS.s.p', rosser_kn2)).
% fof(6, axiom,kn3,file('/tmp/SRASS.s.p', rosser_kn3)).
% fof(9, axiom,op_or,file('/tmp/SRASS.s.p', rosser_op_or)).
% fof(14, axiom,(kn3<=>![X1]:![X4]:![X5]:is_a_theorem(implies(implies(X1,X4),implies(not(and(X4,X5)),not(and(X5,X1)))))),file('/tmp/SRASS.s.p', kn3)).
% fof(15, axiom,(modus_ponens<=>![X2]:![X3]:((is_a_theorem(X2)&is_a_theorem(implies(X2,X3)))=>is_a_theorem(X3))),file('/tmp/SRASS.s.p', modus_ponens)).
% fof(27, axiom,(kn1<=>![X1]:is_a_theorem(implies(X1,and(X1,X1)))),file('/tmp/SRASS.s.p', kn1)).
% fof(28, axiom,(kn2<=>![X1]:![X4]:is_a_theorem(implies(and(X1,X4),X1))),file('/tmp/SRASS.s.p', kn2)).
% fof(34, axiom,(op_implies_and=>![X2]:![X3]:implies(X2,X3)=not(and(X2,not(X3)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(39, axiom,(op_or=>![X2]:![X3]:or(X2,X3)=not(and(not(X2),not(X3)))),file('/tmp/SRASS.s.p', op_or)).
% fof(43, conjecture,cn3,file('/tmp/SRASS.s.p', luka_cn3)).
% fof(44, negated_conjecture,~(cn3),inference(assume_negation,[status(cth)],[43])).
% fof(45, negated_conjecture,~(cn3),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(46, plain,((~(cn3)|![X1]:is_a_theorem(implies(implies(not(X1),X1),X1)))&(?[X1]:~(is_a_theorem(implies(implies(not(X1),X1),X1)))|cn3)),inference(fof_nnf,[status(thm)],[1])).
% fof(47, plain,((~(cn3)|![X2]:is_a_theorem(implies(implies(not(X2),X2),X2)))&(?[X3]:~(is_a_theorem(implies(implies(not(X3),X3),X3)))|cn3)),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,((~(cn3)|![X2]:is_a_theorem(implies(implies(not(X2),X2),X2)))&(~(is_a_theorem(implies(implies(not(esk1_0),esk1_0),esk1_0)))|cn3)),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X2]:((is_a_theorem(implies(implies(not(X2),X2),X2))|~(cn3))&(~(is_a_theorem(implies(implies(not(esk1_0),esk1_0),esk1_0)))|cn3)),inference(shift_quantors,[status(thm)],[48])).
% cnf(50,plain,(cn3|~is_a_theorem(implies(implies(not(esk1_0),esk1_0),esk1_0))),inference(split_conjunct,[status(thm)],[49])).
% cnf(52,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[2])).
% cnf(53,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[3])).
% cnf(54,plain,(kn1),inference(split_conjunct,[status(thm)],[4])).
% cnf(55,plain,(kn2),inference(split_conjunct,[status(thm)],[5])).
% cnf(56,plain,(kn3),inference(split_conjunct,[status(thm)],[6])).
% cnf(69,plain,(op_or),inference(split_conjunct,[status(thm)],[9])).
% fof(74, plain,((~(kn3)|![X1]:![X4]:![X5]:is_a_theorem(implies(implies(X1,X4),implies(not(and(X4,X5)),not(and(X5,X1))))))&(?[X1]:?[X4]:?[X5]:~(is_a_theorem(implies(implies(X1,X4),implies(not(and(X4,X5)),not(and(X5,X1))))))|kn3)),inference(fof_nnf,[status(thm)],[14])).
% fof(75, plain,((~(kn3)|![X6]:![X7]:![X8]:is_a_theorem(implies(implies(X6,X7),implies(not(and(X7,X8)),not(and(X8,X6))))))&(?[X9]:?[X10]:?[X11]:~(is_a_theorem(implies(implies(X9,X10),implies(not(and(X10,X11)),not(and(X11,X9))))))|kn3)),inference(variable_rename,[status(thm)],[74])).
% fof(76, plain,((~(kn3)|![X6]:![X7]:![X8]:is_a_theorem(implies(implies(X6,X7),implies(not(and(X7,X8)),not(and(X8,X6))))))&(~(is_a_theorem(implies(implies(esk6_0,esk7_0),implies(not(and(esk7_0,esk8_0)),not(and(esk8_0,esk6_0))))))|kn3)),inference(skolemize,[status(esa)],[75])).
% fof(77, plain,![X6]:![X7]:![X8]:((is_a_theorem(implies(implies(X6,X7),implies(not(and(X7,X8)),not(and(X8,X6)))))|~(kn3))&(~(is_a_theorem(implies(implies(esk6_0,esk7_0),implies(not(and(esk7_0,esk8_0)),not(and(esk8_0,esk6_0))))))|kn3)),inference(shift_quantors,[status(thm)],[76])).
% cnf(79,plain,(is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))|~kn3),inference(split_conjunct,[status(thm)],[77])).
% fof(80, plain,((~(modus_ponens)|![X2]:![X3]:((~(is_a_theorem(X2))|~(is_a_theorem(implies(X2,X3))))|is_a_theorem(X3)))&(?[X2]:?[X3]:((is_a_theorem(X2)&is_a_theorem(implies(X2,X3)))&~(is_a_theorem(X3)))|modus_ponens)),inference(fof_nnf,[status(thm)],[15])).
% fof(81, plain,((~(modus_ponens)|![X4]:![X5]:((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5)))&(?[X6]:?[X7]:((is_a_theorem(X6)&is_a_theorem(implies(X6,X7)))&~(is_a_theorem(X7)))|modus_ponens)),inference(variable_rename,[status(thm)],[80])).
% fof(82, plain,((~(modus_ponens)|![X4]:![X5]:((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5)))&(((is_a_theorem(esk9_0)&is_a_theorem(implies(esk9_0,esk10_0)))&~(is_a_theorem(esk10_0)))|modus_ponens)),inference(skolemize,[status(esa)],[81])).
% fof(83, plain,![X4]:![X5]:((((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5))|~(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)],[82])).
% fof(84, plain,![X4]:![X5]:((((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5))|~(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)],[83])).
% cnf(88,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[84])).
% fof(153, plain,((~(kn1)|![X1]:is_a_theorem(implies(X1,and(X1,X1))))&(?[X1]:~(is_a_theorem(implies(X1,and(X1,X1))))|kn1)),inference(fof_nnf,[status(thm)],[27])).
% fof(154, plain,((~(kn1)|![X2]:is_a_theorem(implies(X2,and(X2,X2))))&(?[X3]:~(is_a_theorem(implies(X3,and(X3,X3))))|kn1)),inference(variable_rename,[status(thm)],[153])).
% fof(155, plain,((~(kn1)|![X2]:is_a_theorem(implies(X2,and(X2,X2))))&(~(is_a_theorem(implies(esk34_0,and(esk34_0,esk34_0))))|kn1)),inference(skolemize,[status(esa)],[154])).
% fof(156, plain,![X2]:((is_a_theorem(implies(X2,and(X2,X2)))|~(kn1))&(~(is_a_theorem(implies(esk34_0,and(esk34_0,esk34_0))))|kn1)),inference(shift_quantors,[status(thm)],[155])).
% cnf(158,plain,(is_a_theorem(implies(X1,and(X1,X1)))|~kn1),inference(split_conjunct,[status(thm)],[156])).
% fof(159, plain,((~(kn2)|![X1]:![X4]:is_a_theorem(implies(and(X1,X4),X1)))&(?[X1]:?[X4]:~(is_a_theorem(implies(and(X1,X4),X1)))|kn2)),inference(fof_nnf,[status(thm)],[28])).
% fof(160, plain,((~(kn2)|![X5]:![X6]:is_a_theorem(implies(and(X5,X6),X5)))&(?[X7]:?[X8]:~(is_a_theorem(implies(and(X7,X8),X7)))|kn2)),inference(variable_rename,[status(thm)],[159])).
% fof(161, plain,((~(kn2)|![X5]:![X6]:is_a_theorem(implies(and(X5,X6),X5)))&(~(is_a_theorem(implies(and(esk35_0,esk36_0),esk35_0)))|kn2)),inference(skolemize,[status(esa)],[160])).
% fof(162, plain,![X5]:![X6]:((is_a_theorem(implies(and(X5,X6),X5))|~(kn2))&(~(is_a_theorem(implies(and(esk35_0,esk36_0),esk35_0)))|kn2)),inference(shift_quantors,[status(thm)],[161])).
% cnf(164,plain,(is_a_theorem(implies(and(X1,X2),X1))|~kn2),inference(split_conjunct,[status(thm)],[162])).
% fof(195, plain,(~(op_implies_and)|![X2]:![X3]:implies(X2,X3)=not(and(X2,not(X3)))),inference(fof_nnf,[status(thm)],[34])).
% fof(196, plain,(~(op_implies_and)|![X4]:![X5]:implies(X4,X5)=not(and(X4,not(X5)))),inference(variable_rename,[status(thm)],[195])).
% fof(197, plain,![X4]:![X5]:(implies(X4,X5)=not(and(X4,not(X5)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[196])).
% cnf(198,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[197])).
% fof(221, plain,(~(op_or)|![X2]:![X3]:or(X2,X3)=not(and(not(X2),not(X3)))),inference(fof_nnf,[status(thm)],[39])).
% fof(222, plain,(~(op_or)|![X4]:![X5]:or(X4,X5)=not(and(not(X4),not(X5)))),inference(variable_rename,[status(thm)],[221])).
% fof(223, plain,![X4]:![X5]:(or(X4,X5)=not(and(not(X4),not(X5)))|~(op_or)),inference(shift_quantors,[status(thm)],[222])).
% cnf(224,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[223])).
% cnf(238,negated_conjecture,(~cn3),inference(split_conjunct,[status(thm)],[45])).
% cnf(244,plain,(~is_a_theorem(implies(implies(not(esk1_0),esk1_0),esk1_0))),inference(sr,[status(thm)],[50,238,theory(equality)])).
% cnf(251,plain,(is_a_theorem(implies(X1,and(X1,X1)))|$false),inference(rw,[status(thm)],[158,54,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)],[164,55,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)],[198,52,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(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[88,53,theory(equality)])).
% cnf(262,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[261,theory(equality)])).
% cnf(265,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[224,259,theory(equality)])).
% cnf(266,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[265,69,theory(equality)])).
% cnf(267,plain,(implies(not(X1),X2)=or(X1,X2)),inference(cn,[status(thm)],[266,theory(equality)])).
% cnf(268,plain,(is_a_theorem(or(X1,and(not(X1),not(X1))))),inference(spm,[status(thm)],[252,267,theory(equality)])).
% cnf(269,plain,(is_a_theorem(X1)|~is_a_theorem(or(X2,X1))|~is_a_theorem(not(X2))),inference(spm,[status(thm)],[262,267,theory(equality)])).
% cnf(270,plain,(implies(implies(X1,X2),X3)=or(and(X1,not(X2)),X3)),inference(spm,[status(thm)],[267,259,theory(equality)])).
% cnf(273,plain,(~is_a_theorem(implies(or(esk1_0,esk1_0),esk1_0))),inference(rw,[status(thm)],[244,267,theory(equality)])).
% cnf(284,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|~kn3),inference(rw,[status(thm)],[79,267,theory(equality)])).
% cnf(285,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|$false),inference(rw,[status(thm)],[284,56,theory(equality)])).
% cnf(286,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))),inference(cn,[status(thm)],[285,theory(equality)])).
% cnf(287,plain,(is_a_theorem(or(and(X1,X2),not(and(X2,X3))))|~is_a_theorem(implies(X3,X1))),inference(spm,[status(thm)],[262,286,theory(equality)])).
% cnf(304,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)],[269,260,theory(equality)])).
% cnf(305,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,not(X3)),X1))|~is_a_theorem(implies(X2,X3))),inference(spm,[status(thm)],[269,259,theory(equality)])).
% cnf(307,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(and(X2,X3),not(X2)),X1))),inference(spm,[status(thm)],[305,254,theory(equality)])).
% cnf(309,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,not(and(X2,X2))),X1))),inference(spm,[status(thm)],[305,252,theory(equality)])).
% cnf(354,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),not(and(not(X3),X1)))))),inference(spm,[status(thm)],[286,270,theory(equality)])).
% cnf(357,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,and(X2,X2)),X1))),inference(rw,[status(thm)],[309,270,theory(equality)])).
% cnf(360,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(and(X2,X3),X2),X1))),inference(rw,[status(thm)],[307,270,theory(equality)])).
% cnf(368,plain,(is_a_theorem(or(and(and(X1,X1),X2),not(and(X2,X1))))),inference(spm,[status(thm)],[357,286,theory(equality)])).
% cnf(372,plain,(is_a_theorem(or(and(X1,X2),not(and(X2,and(X1,X3)))))),inference(spm,[status(thm)],[360,286,theory(equality)])).
% cnf(520,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(and(and(X2,not(X3)),X4),implies(X2,X3)),X1))),inference(spm,[status(thm)],[304,254,theory(equality)])).
% cnf(524,plain,(is_a_theorem(or(and(X1,X2),not(and(X2,not(X3)))))|~is_a_theorem(or(X3,X1))),inference(spm,[status(thm)],[287,267,theory(equality)])).
% cnf(532,plain,(is_a_theorem(or(and(X1,X2),implies(X2,X3)))|~is_a_theorem(or(X3,X1))),inference(rw,[status(thm)],[524,259,theory(equality)])).
% cnf(564,plain,(is_a_theorem(or(and(and(not(X1),not(X1)),X2),implies(X2,X1)))),inference(spm,[status(thm)],[532,268,theory(equality)])).
% cnf(567,plain,(is_a_theorem(or(and(and(not(X1),not(X1)),not(X2)),or(X2,X1)))),inference(spm,[status(thm)],[564,267,theory(equality)])).
% cnf(574,plain,(is_a_theorem(implies(implies(and(not(X1),not(X1)),X2),or(X2,X1)))),inference(rw,[status(thm)],[567,270,theory(equality)])).
% cnf(726,plain,(is_a_theorem(not(and(implies(X1,X2),and(X1,not(X2)))))),inference(spm,[status(thm)],[520,368,theory(equality)])).
% cnf(731,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(implies(X2,X3),and(X2,not(X3))),X1))),inference(spm,[status(thm)],[269,726,theory(equality)])).
% cnf(2692,plain,(is_a_theorem(implies(implies(and(X1,X1),X2),not(and(not(X2),X1))))),inference(spm,[status(thm)],[357,354,theory(equality)])).
% cnf(2728,plain,(is_a_theorem(not(and(not(X1),X1)))),inference(spm,[status(thm)],[360,2692,theory(equality)])).
% cnf(2743,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(not(X2),X2),X1))),inference(spm,[status(thm)],[269,2728,theory(equality)])).
% cnf(2748,plain,(is_a_theorem(implies(not(not(X1)),X1))),inference(spm,[status(thm)],[2728,259,theory(equality)])).
% cnf(2752,plain,(is_a_theorem(or(not(X1),X1))),inference(rw,[status(thm)],[2748,267,theory(equality)])).
% cnf(2755,plain,(is_a_theorem(or(and(X1,X2),implies(X2,not(X1))))),inference(spm,[status(thm)],[532,2752,theory(equality)])).
% cnf(2760,plain,(is_a_theorem(or(and(implies(X1,not(X2)),X3),implies(X3,and(X2,X1))))),inference(spm,[status(thm)],[532,2755,theory(equality)])).
% cnf(4331,plain,(is_a_theorem(implies(and(X1,not(not(X2))),and(X2,X1)))),inference(spm,[status(thm)],[731,2760,theory(equality)])).
% cnf(13187,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(implies(and(not(X2),not(X2)),X1))),inference(spm,[status(thm)],[262,574,theory(equality)])).
% cnf(14245,plain,(is_a_theorem(or(and(X1,not(not(X1))),not(X1)))),inference(spm,[status(thm)],[13187,4331,theory(equality)])).
% cnf(14270,plain,(is_a_theorem(implies(implies(X1,not(X1)),not(X1)))),inference(rw,[status(thm)],[14245,270,theory(equality)])).
% cnf(14302,plain,(is_a_theorem(or(and(not(X1),X2),not(and(X2,implies(X1,not(X1))))))),inference(spm,[status(thm)],[287,14270,theory(equality)])).
% cnf(14312,plain,(is_a_theorem(or(and(not(X1),X2),implies(X2,and(X1,not(not(X1))))))),inference(rw,[status(thm)],[14302,260,theory(equality)])).
% cnf(18300,plain,(is_a_theorem(implies(X1,and(X1,not(not(X1)))))),inference(spm,[status(thm)],[2743,14312,theory(equality)])).
% cnf(18374,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,implies(X2,not(X2))),X1))),inference(spm,[status(thm)],[304,18300,theory(equality)])).
% cnf(18634,plain,(is_a_theorem(not(and(implies(X1,not(X1)),and(X1,X2))))),inference(spm,[status(thm)],[18374,372,theory(equality)])).
% cnf(18755,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(implies(X2,not(X2)),and(X2,X3)),X1))),inference(spm,[status(thm)],[269,18634,theory(equality)])).
% cnf(234092,plain,(is_a_theorem(implies(and(X1,X2),and(X1,X1)))),inference(spm,[status(thm)],[18755,2760,theory(equality)])).
% cnf(234339,plain,(is_a_theorem(or(and(not(X1),not(X1)),X1))),inference(spm,[status(thm)],[13187,234092,theory(equality)])).
% cnf(234357,plain,(is_a_theorem(implies(or(X1,X1),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[234339,270,theory(equality)]),267,theory(equality)])).
% cnf(234381,plain,($false),inference(rw,[status(thm)],[273,234357,theory(equality)])).
% cnf(234382,plain,($false),inference(cn,[status(thm)],[234381,theory(equality)])).
% cnf(234383,plain,($false),234382,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 9111
% # ...of these trivial : 2002
% # ...subsumed : 3431
% # ...remaining for further processing: 3678
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 69
% # Backward-rewritten : 218
% # Generated clauses : 162808
% # ...of the previous two non-trivial : 108507
% # Contextual simplify-reflections : 74
% # Paramodulations : 162808
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 3391
% # Positive orientable unit clauses: 2596
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 793
% # Current number of unprocessed clauses: 93920
% # ...number of literals in the above : 118991
% # Clause-clause subsumption calls (NU) : 66093
% # Rec. Clause-clause subsumption calls : 66093
% # Unit Clause-clause subsumption calls : 3889
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 335212
% # Indexed BW rewrite successes : 204
% # Backwards rewriting index: 1449 leaves, 6.45+/-23.431 terms/leaf
% # Paramod-from index: 121 leaves, 21.76+/-58.486 terms/leaf
% # Paramod-into index: 1414 leaves, 6.41+/-23.437 terms/leaf
% # -------------------------------------------------
% # User time : 6.029 s
% # System time : 0.243 s
% # Total time : 6.272 s
% # Maximum resident set size: 0 pages
% PrfWatch: 9.24 CPU 9.38 WC
% FINAL PrfWatch: 9.24 CPU 9.38 WC
% SZS output end Solution for /tmp/SystemOnTPTP32151/LCL517+1.tptp
%
%------------------------------------------------------------------------------