TSTP Solution File: LCL519+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL519+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:42 EST 2010
% Result : Theorem 160.01s
% Output : Solution 175.55s
% 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/SystemOnTPTP32670/LCL519+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~principia_r2:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... r2:
% CSA axiom r2 found
% Looking for CSA axiom ... rosser_modus_ponens: CSA axiom rosser_modus_ponens found
% Looking for CSA axiom ... rosser_kn1: CSA axiom rosser_kn1 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rosser_kn2:
% CSA axiom rosser_kn2 found
% Looking for CSA axiom ... rosser_kn3:
% CSA axiom rosser_kn3 found
% Looking for CSA axiom ... principia_op_implies_or:
% CSA axiom principia_op_implies_or found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... or_1:
% CSA axiom or_1 found
% Looking for CSA axiom ... or_2:
% CSA axiom or_2 found
% Looking for CSA axiom ... or_3:
% CSA axiom or_3 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... r1:
% CSA axiom r1 found
% Looking for CSA axiom ... r3:
% CSA axiom r3 found
% Looking for CSA axiom ... r4:
% CSA axiom r4 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... r5:
% CSA axiom r5 found
% Looking for CSA axiom ... rosser_op_or:
% CSA axiom rosser_op_or found
% Looking for CSA axiom ... rosser_op_implies_and:
% CSA axiom rosser_op_implies_and found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rosser_op_equiv: CSA axiom rosser_op_equiv found
% Looking for CSA axiom ... substitution_of_equivalents:
% CSA axiom substitution_of_equivalents found
% Looking for CSA axiom ... principia_op_and:
% CSA axiom principia_op_and found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... principia_op_equiv:
% modus_ponens:
% CSA axiom modus_ponens found
% Looking for CSA axiom ... implies_1:
% CSA axiom implies_1 found
% Looking for CSA axiom ... implies_2:
% CSA axiom implies_2 found
% ---- Iteration 8 (21 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... principia_op_equiv:
% implies_3:
% CSA axiom implies_3 found
% Looking for CSA axiom ... cn1:
% CSA axiom cn1 found
% Looking for CSA axiom ... op_or:
% CSA axiom op_or found
% ---- Iteration 9 (24 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... principia_op_equiv:
% op_and:
% CSA axiom op_and found
% Looking for CSA axiom ... and_1:
% CSA axiom and_1 found
% Looking for CSA axiom ... and_2:
% CSA axiom and_2 found
% ---- Iteration 10 (27 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... principia_op_equiv:
% and_3:
% CSA axiom and_3 found
% Looking for CSA axiom ... kn1:
% CSA axiom kn1 found
% Looking for CSA axiom ... kn2:
% CSA axiom kn2 found
% ---- Iteration 11 (30 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... principia_op_equiv:
% op_implies_or:
% CSA axiom op_implies_or found
% Looking for CSA axiom ... modus_tollens:
% CSA axiom modus_tollens found
% Looking for CSA axiom ... equivalence_1:
% CSA axiom equivalence_1 found
% ---- Iteration 12 (33 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... principia_op_equiv:
% equivalence_2:
% CSA axiom equivalence_2 found
% Looking for CSA axiom ... equivalence_3:
% CSA axiom equivalence_3 found
% Looking for CSA axiom ... cn2:
% CSA axiom cn2 found
% ---- Iteration 13 (36 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... principia_op_equiv:
% cn3:
% CSA axiom cn3 found
% Looking for CSA axiom ... kn3:
% CSA axiom kn3 found
% Looking for CSA axiom ... op_implies_and:
% CSA axiom op_implies_and found
% ---- Iteration 14 (39 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :op_implies_and:kn3:cn3:cn2:equivalence_3:equivalence_2:equivalence_1:modus_tollens:op_implies_or:kn2:kn1:and_3:and_2:and_1:op_and:op_or:cn1:implies_3:implies_2:implies_1:modus_ponens:principia_op_and:substitution_of_equivalents:rosser_op_equiv:rosser_op_implies_and:rosser_op_or:r5:r4:r3:r1:or_3:or_2:or_1:principia_op_implies_or:rosser_kn3:rosser_kn2:rosser_kn1:rosser_modus_ponens:r2 (39)
% Unselected axioms are ... :principia_op_equiv:op_equiv:substitution_of_equivalents (3)
% SZS status THM for /tmp/SystemOnTPTP32670/LCL519+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP32670/LCL519+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 7053
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.90 CPU 2.01 WC
% PrfWatch: 3.89 CPU 4.01 WC
% PrfWatch: 5.88 CPU 6.02 WC
% PrfWatch: 7.87 CPU 8.02 WC
% # Preprocessing time : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 9.86 CPU 10.03 WC
% PrfWatch: 11.85 CPU 12.03 WC
% PrfWatch: 13.84 CPU 14.04 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,(op_implies_and=>![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(2, axiom,(kn3<=>![X3]:![X4]:![X5]:is_a_theorem(implies(implies(X3,X4),implies(not(and(X4,X5)),not(and(X5,X3)))))),file('/tmp/SRASS.s.p', kn3)).
% fof(9, axiom,(op_implies_or=>![X1]:![X2]:implies(X1,X2)=or(not(X1),X2)),file('/tmp/SRASS.s.p', op_implies_or)).
% fof(10, axiom,(kn2<=>![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3))),file('/tmp/SRASS.s.p', kn2)).
% fof(11, axiom,(kn1<=>![X3]:is_a_theorem(implies(X3,and(X3,X3)))),file('/tmp/SRASS.s.p', kn1)).
% fof(15, axiom,(op_and=>![X1]:![X2]:and(X1,X2)=not(or(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_and)).
% fof(16, axiom,(op_or=>![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_or)).
% fof(21, 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(22, axiom,op_and,file('/tmp/SRASS.s.p', principia_op_and)).
% fof(25, axiom,op_implies_and,file('/tmp/SRASS.s.p', rosser_op_implies_and)).
% fof(26, axiom,op_or,file('/tmp/SRASS.s.p', rosser_op_or)).
% fof(34, axiom,op_implies_or,file('/tmp/SRASS.s.p', principia_op_implies_or)).
% fof(35, axiom,kn3,file('/tmp/SRASS.s.p', rosser_kn3)).
% fof(36, axiom,kn2,file('/tmp/SRASS.s.p', rosser_kn2)).
% fof(37, axiom,kn1,file('/tmp/SRASS.s.p', rosser_kn1)).
% fof(38, axiom,modus_ponens,file('/tmp/SRASS.s.p', rosser_modus_ponens)).
% fof(39, axiom,(r2<=>![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4)))),file('/tmp/SRASS.s.p', r2)).
% fof(40, conjecture,r2,file('/tmp/SRASS.s.p', principia_r2)).
% fof(41, negated_conjecture,~(r2),inference(assume_negation,[status(cth)],[40])).
% fof(42, negated_conjecture,~(r2),inference(fof_simplification,[status(thm)],[41,theory(equality)])).
% fof(43, plain,(~(op_implies_and)|![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),inference(fof_nnf,[status(thm)],[1])).
% fof(44, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(variable_rename,[status(thm)],[43])).
% fof(45, plain,![X3]:![X4]:(implies(X3,X4)=not(and(X3,not(X4)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[44])).
% cnf(46,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,((~(kn3)|![X3]:![X4]:![X5]:is_a_theorem(implies(implies(X3,X4),implies(not(and(X4,X5)),not(and(X5,X3))))))&(?[X3]:?[X4]:?[X5]:~(is_a_theorem(implies(implies(X3,X4),implies(not(and(X4,X5)),not(and(X5,X3))))))|kn3)),inference(fof_nnf,[status(thm)],[2])).
% fof(48, 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)],[47])).
% fof(49, 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(esk1_0,esk2_0),implies(not(and(esk2_0,esk3_0)),not(and(esk3_0,esk1_0))))))|kn3)),inference(skolemize,[status(esa)],[48])).
% fof(50, 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(esk1_0,esk2_0),implies(not(and(esk2_0,esk3_0)),not(and(esk3_0,esk1_0))))))|kn3)),inference(shift_quantors,[status(thm)],[49])).
% cnf(52,plain,(is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))|~kn3),inference(split_conjunct,[status(thm)],[50])).
% fof(89, plain,(~(op_implies_or)|![X1]:![X2]:implies(X1,X2)=or(not(X1),X2)),inference(fof_nnf,[status(thm)],[9])).
% fof(90, plain,(~(op_implies_or)|![X3]:![X4]:implies(X3,X4)=or(not(X3),X4)),inference(variable_rename,[status(thm)],[89])).
% fof(91, plain,![X3]:![X4]:(implies(X3,X4)=or(not(X3),X4)|~(op_implies_or)),inference(shift_quantors,[status(thm)],[90])).
% cnf(92,plain,(implies(X1,X2)=or(not(X1),X2)|~op_implies_or),inference(split_conjunct,[status(thm)],[91])).
% fof(93, plain,((~(kn2)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3)))&(?[X3]:?[X4]:~(is_a_theorem(implies(and(X3,X4),X3)))|kn2)),inference(fof_nnf,[status(thm)],[10])).
% fof(94, 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)],[93])).
% fof(95, plain,((~(kn2)|![X5]:![X6]:is_a_theorem(implies(and(X5,X6),X5)))&(~(is_a_theorem(implies(and(esk15_0,esk16_0),esk15_0)))|kn2)),inference(skolemize,[status(esa)],[94])).
% fof(96, plain,![X5]:![X6]:((is_a_theorem(implies(and(X5,X6),X5))|~(kn2))&(~(is_a_theorem(implies(and(esk15_0,esk16_0),esk15_0)))|kn2)),inference(shift_quantors,[status(thm)],[95])).
% cnf(98,plain,(is_a_theorem(implies(and(X1,X2),X1))|~kn2),inference(split_conjunct,[status(thm)],[96])).
% fof(99, plain,((~(kn1)|![X3]:is_a_theorem(implies(X3,and(X3,X3))))&(?[X3]:~(is_a_theorem(implies(X3,and(X3,X3))))|kn1)),inference(fof_nnf,[status(thm)],[11])).
% fof(100, plain,((~(kn1)|![X4]:is_a_theorem(implies(X4,and(X4,X4))))&(?[X5]:~(is_a_theorem(implies(X5,and(X5,X5))))|kn1)),inference(variable_rename,[status(thm)],[99])).
% fof(101, plain,((~(kn1)|![X4]:is_a_theorem(implies(X4,and(X4,X4))))&(~(is_a_theorem(implies(esk17_0,and(esk17_0,esk17_0))))|kn1)),inference(skolemize,[status(esa)],[100])).
% fof(102, plain,![X4]:((is_a_theorem(implies(X4,and(X4,X4)))|~(kn1))&(~(is_a_theorem(implies(esk17_0,and(esk17_0,esk17_0))))|kn1)),inference(shift_quantors,[status(thm)],[101])).
% cnf(104,plain,(is_a_theorem(implies(X1,and(X1,X1)))|~kn1),inference(split_conjunct,[status(thm)],[102])).
% fof(123, plain,(~(op_and)|![X1]:![X2]:and(X1,X2)=not(or(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[15])).
% fof(124, plain,(~(op_and)|![X3]:![X4]:and(X3,X4)=not(or(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[123])).
% fof(125, plain,![X3]:![X4]:(and(X3,X4)=not(or(not(X3),not(X4)))|~(op_and)),inference(shift_quantors,[status(thm)],[124])).
% cnf(126,plain,(and(X1,X2)=not(or(not(X1),not(X2)))|~op_and),inference(split_conjunct,[status(thm)],[125])).
% fof(127, plain,(~(op_or)|![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[16])).
% fof(128, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[127])).
% fof(129, plain,![X3]:![X4]:(or(X3,X4)=not(and(not(X3),not(X4)))|~(op_or)),inference(shift_quantors,[status(thm)],[128])).
% cnf(130,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[129])).
% fof(155, 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)],[21])).
% fof(156, 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)],[155])).
% fof(157, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(((is_a_theorem(esk34_0)&is_a_theorem(implies(esk34_0,esk35_0)))&~(is_a_theorem(esk35_0)))|modus_ponens)),inference(skolemize,[status(esa)],[156])).
% fof(158, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk34_0)&is_a_theorem(implies(esk34_0,esk35_0)))&~(is_a_theorem(esk35_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[157])).
% fof(159, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk34_0)|modus_ponens)&(is_a_theorem(implies(esk34_0,esk35_0))|modus_ponens))&(~(is_a_theorem(esk35_0))|modus_ponens))),inference(distribute,[status(thm)],[158])).
% cnf(163,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[159])).
% cnf(164,plain,(op_and),inference(split_conjunct,[status(thm)],[22])).
% cnf(167,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[25])).
% cnf(168,plain,(op_or),inference(split_conjunct,[status(thm)],[26])).
% cnf(211,plain,(op_implies_or),inference(split_conjunct,[status(thm)],[34])).
% cnf(212,plain,(kn3),inference(split_conjunct,[status(thm)],[35])).
% cnf(213,plain,(kn2),inference(split_conjunct,[status(thm)],[36])).
% cnf(214,plain,(kn1),inference(split_conjunct,[status(thm)],[37])).
% cnf(215,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[38])).
% fof(216, 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)],[39])).
% fof(217, 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)],[216])).
% fof(218, plain,((~(r2)|![X5]:![X6]:is_a_theorem(implies(X6,or(X5,X6))))&(~(is_a_theorem(implies(esk53_0,or(esk52_0,esk53_0))))|r2)),inference(skolemize,[status(esa)],[217])).
% fof(219, plain,![X5]:![X6]:((is_a_theorem(implies(X6,or(X5,X6)))|~(r2))&(~(is_a_theorem(implies(esk53_0,or(esk52_0,esk53_0))))|r2)),inference(shift_quantors,[status(thm)],[218])).
% cnf(220,plain,(r2|~is_a_theorem(implies(esk53_0,or(esk52_0,esk53_0)))),inference(split_conjunct,[status(thm)],[219])).
% cnf(222,negated_conjecture,(~r2),inference(split_conjunct,[status(thm)],[42])).
% cnf(225,plain,(~is_a_theorem(implies(esk53_0,or(esk52_0,esk53_0)))),inference(sr,[status(thm)],[220,222,theory(equality)])).
% cnf(229,plain,(is_a_theorem(implies(X1,and(X1,X1)))|$false),inference(rw,[status(thm)],[104,214,theory(equality)])).
% cnf(230,plain,(is_a_theorem(implies(X1,and(X1,X1)))),inference(cn,[status(thm)],[229,theory(equality)])).
% cnf(231,plain,(or(not(X1),X2)=implies(X1,X2)|$false),inference(rw,[status(thm)],[92,211,theory(equality)])).
% cnf(232,plain,(or(not(X1),X2)=implies(X1,X2)),inference(cn,[status(thm)],[231,theory(equality)])).
% cnf(233,plain,(is_a_theorem(implies(and(X1,X2),X1))|$false),inference(rw,[status(thm)],[98,213,theory(equality)])).
% cnf(234,plain,(is_a_theorem(implies(and(X1,X2),X1))),inference(cn,[status(thm)],[233,theory(equality)])).
% cnf(238,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[163,215,theory(equality)])).
% cnf(239,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[238,theory(equality)])).
% cnf(240,plain,(is_a_theorem(X1)|~is_a_theorem(and(X1,X2))),inference(spm,[status(thm)],[239,234,theory(equality)])).
% cnf(241,plain,(is_a_theorem(and(X1,X1))|~is_a_theorem(X1)),inference(spm,[status(thm)],[239,230,theory(equality)])).
% cnf(242,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[46,167,theory(equality)])).
% cnf(243,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[242,theory(equality)])).
% cnf(244,plain,(or(implies(X1,X2),X3)=implies(and(X1,not(X2)),X3)),inference(spm,[status(thm)],[232,243,theory(equality)])).
% cnf(245,plain,(not(and(X1,implies(X2,X3)))=implies(X1,and(X2,not(X3)))),inference(spm,[status(thm)],[243,243,theory(equality)])).
% cnf(246,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[130,243,theory(equality)])).
% cnf(247,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[246,168,theory(equality)])).
% cnf(248,plain,(implies(not(X1),X2)=or(X1,X2)),inference(cn,[status(thm)],[247,theory(equality)])).
% cnf(250,plain,(is_a_theorem(X1)|~is_a_theorem(or(X2,X1))|~is_a_theorem(not(X2))),inference(spm,[status(thm)],[239,248,theory(equality)])).
% cnf(251,plain,(implies(implies(X1,X2),X3)=or(and(X1,not(X2)),X3)),inference(spm,[status(thm)],[248,243,theory(equality)])).
% cnf(257,plain,(not(implies(X1,not(X2)))=and(X1,X2)|~op_and),inference(rw,[status(thm)],[126,232,theory(equality)])).
% cnf(258,plain,(not(implies(X1,not(X2)))=and(X1,X2)|$false),inference(rw,[status(thm)],[257,164,theory(equality)])).
% cnf(259,plain,(not(implies(X1,not(X2)))=and(X1,X2)),inference(cn,[status(thm)],[258,theory(equality)])).
% cnf(260,plain,(or(and(X1,X2),X3)=implies(implies(X1,not(X2)),X3)),inference(spm,[status(thm)],[232,259,theory(equality)])).
% cnf(261,plain,(implies(and(X1,X2),X3)=or(implies(X1,not(X2)),X3)),inference(spm,[status(thm)],[248,259,theory(equality)])).
% cnf(262,plain,(not(and(X1,and(X2,X3)))=implies(X1,implies(X2,not(X3)))),inference(spm,[status(thm)],[243,259,theory(equality)])).
% cnf(265,plain,(not(or(X1,not(X2)))=and(not(X1),X2)),inference(spm,[status(thm)],[259,248,theory(equality)])).
% cnf(269,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|~kn3),inference(rw,[status(thm)],[52,248,theory(equality)])).
% cnf(270,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|$false),inference(rw,[status(thm)],[269,212,theory(equality)])).
% cnf(271,plain,(is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))),inference(cn,[status(thm)],[270,theory(equality)])).
% cnf(278,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,not(X3)),X1))|~is_a_theorem(implies(X2,X3))),inference(spm,[status(thm)],[250,243,theory(equality)])).
% cnf(279,plain,(is_a_theorem(X1)|~is_a_theorem(or(implies(X2,not(X3)),X1))|~is_a_theorem(and(X2,X3))),inference(spm,[status(thm)],[250,259,theory(equality)])).
% cnf(281,plain,(not(or(implies(X1,X2),not(X3)))=and(and(X1,not(X2)),X3)),inference(spm,[status(thm)],[259,244,theory(equality)])).
% cnf(284,plain,(is_a_theorem(or(implies(X1,X2),X1))),inference(spm,[status(thm)],[234,244,theory(equality)])).
% cnf(288,plain,(is_a_theorem(or(or(X1,X2),not(X1)))),inference(spm,[status(thm)],[284,248,theory(equality)])).
% cnf(299,plain,(not(or(X1,and(not(X2),X3)))=and(not(X1),or(X2,not(X3)))),inference(spm,[status(thm)],[265,265,theory(equality)])).
% cnf(302,plain,(not(implies(X1,not(X2)))=and(not(not(X1)),X2)),inference(spm,[status(thm)],[265,232,theory(equality)])).
% cnf(303,plain,(and(X1,X2)=and(not(not(X1)),X2)),inference(rw,[status(thm)],[302,259,theory(equality)])).
% cnf(306,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(and(X1,X2))),inference(spm,[status(thm)],[240,303,theory(equality)])).
% cnf(321,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[306,241,theory(equality)])).
% cnf(325,plain,(is_a_theorem(not(and(X1,X2)))|~is_a_theorem(implies(X1,not(X2)))),inference(spm,[status(thm)],[321,259,theory(equality)])).
% cnf(358,plain,(is_a_theorem(not(and(X1,or(X2,not(X3)))))|~is_a_theorem(implies(X1,and(not(X2),X3)))),inference(spm,[status(thm)],[325,265,theory(equality)])).
% cnf(364,plain,(is_a_theorem(not(and(and(not(X1),X2),X1)))),inference(spm,[status(thm)],[325,234,theory(equality)])).
% cnf(366,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(and(not(X2),X3),X2),X1))),inference(spm,[status(thm)],[250,364,theory(equality)])).
% cnf(370,plain,(is_a_theorem(not(and(and(implies(X1,and(X2,not(X3))),X4),and(X1,implies(X2,X3)))))),inference(spm,[status(thm)],[364,245,theory(equality)])).
% cnf(382,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(and(X2,X3),not(X2)),X1))),inference(spm,[status(thm)],[366,303,theory(equality)])).
% cnf(406,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(X2,not(and(X2,X2))),X1))),inference(spm,[status(thm)],[278,230,theory(equality)])).
% cnf(455,plain,(is_a_theorem(X1)|~is_a_theorem(or(implies(X2,not(X2)),X1))|~is_a_theorem(X2)),inference(spm,[status(thm)],[279,241,theory(equality)])).
% cnf(479,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,and(X2,X2)),X1))),inference(rw,[status(thm)],[406,251,theory(equality)])).
% cnf(481,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(and(X2,X3),X2),X1))),inference(rw,[status(thm)],[382,251,theory(equality)])).
% cnf(494,plain,(is_a_theorem(or(and(and(X1,X1),X2),not(and(X2,X1))))),inference(spm,[status(thm)],[479,271,theory(equality)])).
% cnf(503,plain,(is_a_theorem(not(and(X1,not(X1))))),inference(spm,[status(thm)],[366,494,theory(equality)])).
% cnf(510,plain,(is_a_theorem(implies(X1,X1))),inference(rw,[status(thm)],[503,243,theory(equality)])).
% cnf(516,plain,(is_a_theorem(not(and(not(X1),X1)))),inference(spm,[status(thm)],[325,510,theory(equality)])).
% cnf(519,plain,(is_a_theorem(or(X1,not(X1)))),inference(spm,[status(thm)],[510,248,theory(equality)])).
% cnf(523,plain,(is_a_theorem(X1)|~is_a_theorem(or(and(not(X2),X2),X1))),inference(spm,[status(thm)],[250,516,theory(equality)])).
% cnf(545,plain,(is_a_theorem(implies(X1,not(not(X1))))),inference(spm,[status(thm)],[519,232,theory(equality)])).
% cnf(557,plain,(implies(implies(X1,not(not(X2))),X3)=implies(implies(X1,X2),X3)),inference(rw,[status(thm)],[251,260,theory(equality)])).
% cnf(560,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,not(X3)),not(and(X3,X1)))))),inference(rw,[status(thm)],[271,260,theory(equality)])).
% cnf(575,plain,(is_a_theorem(or(X1,not(not(not(X1)))))),inference(spm,[status(thm)],[545,248,theory(equality)])).
% cnf(609,plain,(is_a_theorem(X1)|~is_a_theorem(implies(or(X2,not(X2)),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[523,260,theory(equality)]),248,theory(equality)])).
% cnf(611,plain,(is_a_theorem(X1)|~is_a_theorem(implies(or(and(X2,not(X3)),implies(X2,X3)),X1))),inference(spm,[status(thm)],[609,243,theory(equality)])).
% cnf(615,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,not(not(X2))),X1))),inference(spm,[status(thm)],[609,232,theory(equality)])).
% cnf(619,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(implies(X2,not(not(X3))),implies(X2,X3)),X1))),inference(rw,[status(thm)],[611,260,theory(equality)])).
% cnf(660,plain,(is_a_theorem(X1)|~is_a_theorem(implies(and(X2,X2),X1))|~is_a_theorem(X2)),inference(rw,[status(thm)],[455,261,theory(equality)])).
% cnf(787,plain,(is_a_theorem(implies(X1,not(not(not(not(X1))))))),inference(spm,[status(thm)],[575,232,theory(equality)])).
% cnf(1138,plain,(and(and(X1,not(X2)),X3)=and(not(implies(X1,X2)),X3)),inference(rw,[status(thm)],[281,265,theory(equality)])).
% cnf(1476,plain,(is_a_theorem(not(not(not(not(implies(X1,not(not(X1))))))))),inference(spm,[status(thm)],[615,787,theory(equality)])).
% cnf(1477,plain,(is_a_theorem(not(not(not(not(X1)))))|~is_a_theorem(X1)),inference(spm,[status(thm)],[239,787,theory(equality)])).
% cnf(1490,plain,(is_a_theorem(not(not(implies(X1,X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1476,259,theory(equality)]),243,theory(equality)])).
% cnf(1494,plain,(is_a_theorem(X1)|~is_a_theorem(or(not(implies(X2,X2)),X1))),inference(spm,[status(thm)],[250,1490,theory(equality)])).
% cnf(1502,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,X2),X1))),inference(rw,[status(thm)],[1494,232,theory(equality)])).
% cnf(1813,plain,(is_a_theorem(not(not(not(and(X1,X2)))))|~is_a_theorem(implies(X1,not(X2)))),inference(spm,[status(thm)],[1477,259,theory(equality)])).
% cnf(4929,plain,(is_a_theorem(implies(implies(X1,not(not(X2))),implies(X1,X2)))),inference(spm,[status(thm)],[619,510,theory(equality)])).
% cnf(4936,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,not(not(X2))))),inference(spm,[status(thm)],[239,4929,theory(equality)])).
% cnf(5116,plain,(is_a_theorem(implies(X1,or(X2,not(X3))))|~is_a_theorem(implies(X1,not(and(not(X2),X3))))),inference(spm,[status(thm)],[4936,265,theory(equality)])).
% cnf(5124,plain,(is_a_theorem(implies(not(X1),X2))|~is_a_theorem(or(X1,not(not(X2))))),inference(spm,[status(thm)],[4936,248,theory(equality)])).
% cnf(5133,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X1,not(not(X2))))),inference(rw,[status(thm)],[5124,248,theory(equality)])).
% cnf(9614,plain,(is_a_theorem(implies(and(implies(X1,and(X2,not(X3))),X4),implies(X1,not(implies(X2,X3)))))),inference(rw,[status(thm)],[370,262,theory(equality)])).
% cnf(9617,plain,(is_a_theorem(implies(X1,not(implies(X2,X3))))|~is_a_theorem(implies(X1,and(X2,not(X3))))),inference(spm,[status(thm)],[660,9614,theory(equality)])).
% cnf(10177,plain,(is_a_theorem(implies(not(X1),not(implies(X2,X3))))|~is_a_theorem(or(X1,and(X2,not(X3))))),inference(spm,[status(thm)],[9617,248,theory(equality)])).
% cnf(10202,plain,(is_a_theorem(or(X1,not(implies(X2,X3))))|~is_a_theorem(or(X1,and(X2,not(X3))))),inference(rw,[status(thm)],[10177,248,theory(equality)])).
% cnf(12879,plain,(is_a_theorem(implies(implies(X1,not(X2)),not(and(X2,X1))))),inference(spm,[status(thm)],[1502,560,theory(equality)])).
% cnf(12936,plain,(is_a_theorem(not(and(X1,X2)))|~is_a_theorem(implies(X2,not(X1)))),inference(spm,[status(thm)],[239,12879,theory(equality)])).
% cnf(12940,plain,(is_a_theorem(implies(implies(X1,not(not(X2))),or(X2,not(X1))))),inference(spm,[status(thm)],[5116,12879,theory(equality)])).
% cnf(12942,plain,(is_a_theorem(not(and(X1,and(not(X1),X2))))),inference(spm,[status(thm)],[481,12879,theory(equality)])).
% cnf(12974,plain,(is_a_theorem(implies(implies(X1,X2),or(X2,not(X1))))),inference(rw,[status(thm)],[12940,557,theory(equality)])).
% cnf(12975,plain,(is_a_theorem(implies(X1,or(X1,not(X2))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[12942,262,theory(equality)]),248,theory(equality)])).
% cnf(13019,plain,(is_a_theorem(or(X1,not(X2)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[239,12975,theory(equality)])).
% cnf(13386,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(X1)),inference(spm,[status(thm)],[5133,13019,theory(equality)])).
% cnf(13415,plain,(is_a_theorem(or(X1,not(X2)))|~is_a_theorem(implies(X2,X1))),inference(spm,[status(thm)],[239,12974,theory(equality)])).
% cnf(13416,plain,(is_a_theorem(or(and(X1,X1),not(X1)))),inference(spm,[status(thm)],[479,12974,theory(equality)])).
% cnf(13444,plain,(is_a_theorem(implies(implies(X1,not(X1)),not(X1)))),inference(rw,[status(thm)],[13416,260,theory(equality)])).
% cnf(13596,plain,(is_a_theorem(implies(implies(not(X1),not(not(X1))),X1))),inference(spm,[status(thm)],[4936,13444,theory(equality)])).
% cnf(13622,plain,(is_a_theorem(implies(or(X1,not(not(X1))),X1))),inference(rw,[status(thm)],[13596,248,theory(equality)])).
% cnf(13689,plain,(is_a_theorem(X1)|~is_a_theorem(or(X1,not(not(X1))))),inference(spm,[status(thm)],[239,13622,theory(equality)])).
% cnf(16100,plain,(is_a_theorem(or(X1,not(not(X2))))|~is_a_theorem(or(X2,X1))),inference(spm,[status(thm)],[13415,248,theory(equality)])).
% cnf(16132,plain,(is_a_theorem(or(not(and(X1,X2)),not(implies(X2,not(X1)))))),inference(spm,[status(thm)],[13415,12879,theory(equality)])).
% cnf(16174,plain,(is_a_theorem(implies(and(X1,X2),and(X2,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[16132,259,theory(equality)]),232,theory(equality)])).
% cnf(16274,plain,(is_a_theorem(not(and(and(X1,not(X2)),or(X2,not(X1)))))),inference(spm,[status(thm)],[358,16174,theory(equality)])).
% cnf(16299,plain,(is_a_theorem(not(not(or(implies(X1,X2),and(not(X2),X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[16274,1138,theory(equality)]),299,theory(equality)])).
% cnf(17746,plain,(is_a_theorem(not(and(X1,not(X2))))|~is_a_theorem(or(X2,not(X1)))),inference(spm,[status(thm)],[12936,248,theory(equality)])).
% cnf(17778,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(or(X2,not(X1)))),inference(rw,[status(thm)],[17746,243,theory(equality)])).
% cnf(18114,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(X2)),inference(spm,[status(thm)],[17778,13386,theory(equality)])).
% cnf(18305,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(X2)),inference(spm,[status(thm)],[18114,248,theory(equality)])).
% cnf(18333,plain,(is_a_theorem(X1)|~is_a_theorem(not(not(X1)))),inference(spm,[status(thm)],[13689,18305,theory(equality)])).
% cnf(33814,plain,(is_a_theorem(or(implies(X1,X2),and(not(X2),X1)))),inference(spm,[status(thm)],[18333,16299,theory(equality)])).
% cnf(33873,plain,(is_a_theorem(or(implies(not(X1),X2),not(implies(not(X2),X1))))),inference(spm,[status(thm)],[10202,33814,theory(equality)])).
% cnf(33904,plain,(is_a_theorem(or(or(X1,X2),not(or(X2,X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[33873,248,theory(equality)]),248,theory(equality)])).
% cnf(33928,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))),inference(spm,[status(thm)],[17778,33904,theory(equality)])).
% cnf(33954,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X2,X1))),inference(spm,[status(thm)],[239,33928,theory(equality)])).
% cnf(53295,plain,(is_a_theorem(or(not(X1),not(not(or(X1,X2)))))),inference(spm,[status(thm)],[16100,288,theory(equality)])).
% cnf(53298,plain,(is_a_theorem(or(not(or(X1,X2)),not(not(or(X2,X1)))))),inference(spm,[status(thm)],[16100,33904,theory(equality)])).
% cnf(53413,plain,(is_a_theorem(implies(X1,not(not(or(X1,X2)))))),inference(rw,[status(thm)],[53295,232,theory(equality)])).
% cnf(53416,plain,(is_a_theorem(implies(or(X1,X2),not(not(or(X2,X1)))))),inference(rw,[status(thm)],[53298,232,theory(equality)])).
% cnf(53560,plain,(is_a_theorem(not(not(not(and(X1,not(or(X1,X2)))))))),inference(spm,[status(thm)],[1813,53413,theory(equality)])).
% cnf(53612,plain,(is_a_theorem(not(not(implies(X1,or(X1,X2)))))),inference(rw,[status(thm)],[53560,243,theory(equality)])).
% cnf(53821,plain,(is_a_theorem(X1)|~is_a_theorem(or(not(implies(X2,or(X2,X3))),X1))),inference(spm,[status(thm)],[250,53612,theory(equality)])).
% cnf(53868,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,or(X2,X3)),X1))),inference(rw,[status(thm)],[53821,232,theory(equality)])).
% cnf(55197,plain,(is_a_theorem(not(not(not(and(or(X1,X2),not(or(X2,X1)))))))),inference(spm,[status(thm)],[1813,53416,theory(equality)])).
% cnf(55251,plain,(is_a_theorem(not(not(implies(or(X1,X2),or(X2,X1)))))),inference(rw,[status(thm)],[55197,243,theory(equality)])).
% cnf(56904,plain,(is_a_theorem(X1)|~is_a_theorem(or(not(implies(or(X2,X3),or(X3,X2))),X1))),inference(spm,[status(thm)],[250,55251,theory(equality)])).
% cnf(56951,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(or(X2,X3),or(X3,X2)),X1))),inference(rw,[status(thm)],[56904,232,theory(equality)])).
% cnf(61933,plain,(is_a_theorem(implies(implies(or(X1,X2),not(X3)),not(and(X3,X1))))),inference(spm,[status(thm)],[53868,560,theory(equality)])).
% cnf(121298,plain,(is_a_theorem(implies(implies(or(X1,X2),not(not(X3))),or(X3,not(X1))))),inference(spm,[status(thm)],[5116,61933,theory(equality)])).
% cnf(121352,plain,(is_a_theorem(implies(implies(or(X1,X2),X3),or(X3,not(X1))))),inference(rw,[status(thm)],[121298,557,theory(equality)])).
% cnf(425229,plain,(is_a_theorem(or(or(X1,X2),not(X2)))),inference(spm,[status(thm)],[56951,121352,theory(equality)])).
% cnf(425727,plain,(is_a_theorem(or(not(X1),or(X2,X1)))),inference(spm,[status(thm)],[33954,425229,theory(equality)])).
% cnf(425773,plain,(is_a_theorem(implies(X1,or(X2,X1)))),inference(rw,[status(thm)],[425727,232,theory(equality)])).
% cnf(425905,plain,($false),inference(rw,[status(thm)],[225,425773,theory(equality)])).
% cnf(425906,plain,($false),inference(cn,[status(thm)],[425905,theory(equality)])).
% cnf(425907,plain,($false),425906,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 8726
% # ...of these trivial : 2578
% # ...subsumed : 2872
% # ...remaining for further processing: 3276
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 32
% # Backward-rewritten : 184
% # Generated clauses : 246903
% # ...of the previous two non-trivial : 145240
% # Contextual simplify-reflections : 64
% # Paramodulations : 246903
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 3060
% # Positive orientable unit clauses: 2518
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 538
% # Current number of unprocessed clauses: 130000
% # ...number of literals in the above : 161976
% # Clause-clause subsumption calls (NU) : 35741
% # Rec. Clause-clause subsumption calls : 35741
% # Unit Clause-clause subsumption calls : 3482
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 243542
% # Indexed BW rewrite successes : 167
% # Backwards rewriting index: 852 leaves, 9.24+/-27.929 terms/leaf
% # Paramod-from index: 112 leaves, 22.81+/-53.468 terms/leaf
% # Paramod-into index: 822 leaves, 9.25+/-27.865 terms/leaf
% # -------------------------------------------------
% # User time : 8.845 s
% # System time : 0.365 s
% # Total time : 9.210 s
% # Maximum resident set size: 0 pages
% PrfWatch: 14.82 CPU 15.03 WC
% FINAL PrfWatch: 14.82 CPU 15.03 WC
% SZS output end Solution for /tmp/SystemOnTPTP32670/LCL519+1.tptp
%
%------------------------------------------------------------------------------