%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL489+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:40:07 EST 2010
% Result : Theorem 30.69s
% Output : Solution 30.69s
% 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/SystemOnTPTP16993/LCL489+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16993/LCL489+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16993/LCL489+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 17089
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.92 CPU 2.03 WC
% PrfWatch: 3.91 CPU 4.04 WC
% PrfWatch: 5.90 CPU 6.04 WC
% PrfWatch: 7.50 CPU 8.05 WC
% PrfWatch: 9.12 CPU 10.06 WC
% PrfWatch: 11.11 CPU 12.07 WC
% PrfWatch: 13.11 CPU 14.07 WC
% PrfWatch: 15.09 CPU 16.08 WC
% PrfWatch: 17.07 CPU 18.09 WC
% PrfWatch: 19.06 CPU 20.09 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 21.05 CPU 22.10 WC
% PrfWatch: 23.04 CPU 24.11 WC
% PrfWatch: 25.03 CPU 26.12 WC
% PrfWatch: 27.03 CPU 28.12 WC
% PrfWatch: 28.63 CPU 30.13 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,(and_3<=>![X1]:![X2]:is_a_theorem(implies(X1,implies(X2,and(X1,X2))))),file('/tmp/SRASS.s.p', and_3)).
% fof(2, axiom,op_equiv,file('/tmp/SRASS.s.p', principia_op_equiv)).
% 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(9, axiom,op_implies_and,file('/tmp/SRASS.s.p', hilbert_op_implies_and)).
% fof(15, axiom,op_implies_or,file('/tmp/SRASS.s.p', principia_op_implies_or)).
% fof(16, axiom,op_and,file('/tmp/SRASS.s.p', principia_op_and)).
% fof(17, axiom,substitution_of_equivalents,file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(18, axiom,op_or,file('/tmp/SRASS.s.p', hilbert_op_or)).
% fof(20, 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(25, axiom,(substitution_of_equivalents<=>![X1]:![X2]:(is_a_theorem(equiv(X1,X2))=>X1=X2)),file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(26, axiom,(r1<=>![X3]:is_a_theorem(implies(or(X3,X3),X3))),file('/tmp/SRASS.s.p', r1)).
% fof(27, axiom,(r2<=>![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4)))),file('/tmp/SRASS.s.p', r2)).
% fof(28, axiom,(r3<=>![X3]:![X4]:is_a_theorem(implies(or(X3,X4),or(X4,X3)))),file('/tmp/SRASS.s.p', r3)).
% fof(29, axiom,(r4<=>![X3]:![X4]:![X5]:is_a_theorem(implies(or(X3,or(X4,X5)),or(X4,or(X3,X5))))),file('/tmp/SRASS.s.p', r4)).
% fof(30, axiom,(r5<=>![X3]:![X4]:![X5]:is_a_theorem(implies(implies(X4,X5),implies(or(X3,X4),or(X3,X5))))),file('/tmp/SRASS.s.p', r5)).
% fof(40, axiom,(op_implies_and=>![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(41, axiom,(op_equiv=>![X1]:![X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))),file('/tmp/SRASS.s.p', op_equiv)).
% fof(42, axiom,(op_or=>![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_or)).
% fof(43, axiom,(op_and=>![X1]:![X2]:and(X1,X2)=not(or(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_and)).
% fof(44, axiom,(op_implies_or=>![X1]:![X2]:implies(X1,X2)=or(not(X1),X2)),file('/tmp/SRASS.s.p', op_implies_or)).
% fof(45, conjecture,and_3,file('/tmp/SRASS.s.p', hilbert_and_3)).
% fof(46, negated_conjecture,~(and_3),inference(assume_negation,[status(cth)],[45])).
% fof(47, negated_conjecture,~(and_3),inference(fof_simplification,[status(thm)],[46,theory(equality)])).
% fof(48, plain,((~(and_3)|![X1]:![X2]:is_a_theorem(implies(X1,implies(X2,and(X1,X2)))))&(?[X1]:?[X2]:~(is_a_theorem(implies(X1,implies(X2,and(X1,X2)))))|and_3)),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,((~(and_3)|![X3]:![X4]:is_a_theorem(implies(X3,implies(X4,and(X3,X4)))))&(?[X5]:?[X6]:~(is_a_theorem(implies(X5,implies(X6,and(X5,X6)))))|and_3)),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,((~(and_3)|![X3]:![X4]:is_a_theorem(implies(X3,implies(X4,and(X3,X4)))))&(~(is_a_theorem(implies(esk1_0,implies(esk2_0,and(esk1_0,esk2_0)))))|and_3)),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X3]:![X4]:((is_a_theorem(implies(X3,implies(X4,and(X3,X4))))|~(and_3))&(~(is_a_theorem(implies(esk1_0,implies(esk2_0,and(esk1_0,esk2_0)))))|and_3)),inference(shift_quantors,[status(thm)],[50])).
% cnf(52,plain,(and_3|~is_a_theorem(implies(esk1_0,implies(esk2_0,and(esk1_0,esk2_0))))),inference(split_conjunct,[status(thm)],[51])).
% cnf(54,plain,(op_equiv),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(61,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[9])).
% cnf(87,plain,(op_implies_or),inference(split_conjunct,[status(thm)],[15])).
% cnf(88,plain,(op_and),inference(split_conjunct,[status(thm)],[16])).
% cnf(89,plain,(substitution_of_equivalents),inference(split_conjunct,[status(thm)],[17])).
% cnf(90,plain,(op_or),inference(split_conjunct,[status(thm)],[18])).
% fof(97, 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)],[20])).
% fof(98, 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)],[97])).
% fof(99, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(((is_a_theorem(esk13_0)&is_a_theorem(implies(esk13_0,esk14_0)))&~(is_a_theorem(esk14_0)))|modus_ponens)),inference(skolemize,[status(esa)],[98])).
% fof(100, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk13_0)&is_a_theorem(implies(esk13_0,esk14_0)))&~(is_a_theorem(esk14_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[99])).
% fof(101, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk13_0)|modus_ponens)&(is_a_theorem(implies(esk13_0,esk14_0))|modus_ponens))&(~(is_a_theorem(esk14_0))|modus_ponens))),inference(distribute,[status(thm)],[100])).
% cnf(105,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[101])).
% fof(130, plain,((~(substitution_of_equivalents)|![X1]:![X2]:(~(is_a_theorem(equiv(X1,X2)))|X1=X2))&(?[X1]:?[X2]:(is_a_theorem(equiv(X1,X2))&~(X1=X2))|substitution_of_equivalents)),inference(fof_nnf,[status(thm)],[25])).
% fof(131, plain,((~(substitution_of_equivalents)|![X3]:![X4]:(~(is_a_theorem(equiv(X3,X4)))|X3=X4))&(?[X5]:?[X6]:(is_a_theorem(equiv(X5,X6))&~(X5=X6))|substitution_of_equivalents)),inference(variable_rename,[status(thm)],[130])).
% fof(132, plain,((~(substitution_of_equivalents)|![X3]:![X4]:(~(is_a_theorem(equiv(X3,X4)))|X3=X4))&((is_a_theorem(equiv(esk25_0,esk26_0))&~(esk25_0=esk26_0))|substitution_of_equivalents)),inference(skolemize,[status(esa)],[131])).
% fof(133, plain,![X3]:![X4]:(((~(is_a_theorem(equiv(X3,X4)))|X3=X4)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk25_0,esk26_0))&~(esk25_0=esk26_0))|substitution_of_equivalents)),inference(shift_quantors,[status(thm)],[132])).
% fof(134, plain,![X3]:![X4]:(((~(is_a_theorem(equiv(X3,X4)))|X3=X4)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk25_0,esk26_0))|substitution_of_equivalents)&(~(esk25_0=esk26_0)|substitution_of_equivalents))),inference(distribute,[status(thm)],[133])).
% cnf(137,plain,(X1=X2|~substitution_of_equivalents|~is_a_theorem(equiv(X1,X2))),inference(split_conjunct,[status(thm)],[134])).
% fof(138, plain,((~(r1)|![X3]:is_a_theorem(implies(or(X3,X3),X3)))&(?[X3]:~(is_a_theorem(implies(or(X3,X3),X3)))|r1)),inference(fof_nnf,[status(thm)],[26])).
% fof(139, plain,((~(r1)|![X4]:is_a_theorem(implies(or(X4,X4),X4)))&(?[X5]:~(is_a_theorem(implies(or(X5,X5),X5)))|r1)),inference(variable_rename,[status(thm)],[138])).
% fof(140, plain,((~(r1)|![X4]:is_a_theorem(implies(or(X4,X4),X4)))&(~(is_a_theorem(implies(or(esk27_0,esk27_0),esk27_0)))|r1)),inference(skolemize,[status(esa)],[139])).
% fof(141, plain,![X4]:((is_a_theorem(implies(or(X4,X4),X4))|~(r1))&(~(is_a_theorem(implies(or(esk27_0,esk27_0),esk27_0)))|r1)),inference(shift_quantors,[status(thm)],[140])).
% cnf(143,plain,(is_a_theorem(implies(or(X1,X1),X1))|~r1),inference(split_conjunct,[status(thm)],[141])).
% fof(144, 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)],[27])).
% fof(145, 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)],[144])).
% fof(146, plain,((~(r2)|![X5]:![X6]:is_a_theorem(implies(X6,or(X5,X6))))&(~(is_a_theorem(implies(esk29_0,or(esk28_0,esk29_0))))|r2)),inference(skolemize,[status(esa)],[145])).
% fof(147, plain,![X5]:![X6]:((is_a_theorem(implies(X6,or(X5,X6)))|~(r2))&(~(is_a_theorem(implies(esk29_0,or(esk28_0,esk29_0))))|r2)),inference(shift_quantors,[status(thm)],[146])).
% cnf(149,plain,(is_a_theorem(implies(X1,or(X2,X1)))|~r2),inference(split_conjunct,[status(thm)],[147])).
% fof(150, plain,((~(r3)|![X3]:![X4]:is_a_theorem(implies(or(X3,X4),or(X4,X3))))&(?[X3]:?[X4]:~(is_a_theorem(implies(or(X3,X4),or(X4,X3))))|r3)),inference(fof_nnf,[status(thm)],[28])).
% fof(151, plain,((~(r3)|![X5]:![X6]:is_a_theorem(implies(or(X5,X6),or(X6,X5))))&(?[X7]:?[X8]:~(is_a_theorem(implies(or(X7,X8),or(X8,X7))))|r3)),inference(variable_rename,[status(thm)],[150])).
% fof(152, plain,((~(r3)|![X5]:![X6]:is_a_theorem(implies(or(X5,X6),or(X6,X5))))&(~(is_a_theorem(implies(or(esk30_0,esk31_0),or(esk31_0,esk30_0))))|r3)),inference(skolemize,[status(esa)],[151])).
% fof(153, plain,![X5]:![X6]:((is_a_theorem(implies(or(X5,X6),or(X6,X5)))|~(r3))&(~(is_a_theorem(implies(or(esk30_0,esk31_0),or(esk31_0,esk30_0))))|r3)),inference(shift_quantors,[status(thm)],[152])).
% cnf(155,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3),inference(split_conjunct,[status(thm)],[153])).
% fof(156, plain,((~(r4)|![X3]:![X4]:![X5]:is_a_theorem(implies(or(X3,or(X4,X5)),or(X4,or(X3,X5)))))&(?[X3]:?[X4]:?[X5]:~(is_a_theorem(implies(or(X3,or(X4,X5)),or(X4,or(X3,X5)))))|r4)),inference(fof_nnf,[status(thm)],[29])).
% fof(157, 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)],[156])).
% fof(158, plain,((~(r4)|![X6]:![X7]:![X8]:is_a_theorem(implies(or(X6,or(X7,X8)),or(X7,or(X6,X8)))))&(~(is_a_theorem(implies(or(esk32_0,or(esk33_0,esk34_0)),or(esk33_0,or(esk32_0,esk34_0)))))|r4)),inference(skolemize,[status(esa)],[157])).
% fof(159, plain,![X6]:![X7]:![X8]:((is_a_theorem(implies(or(X6,or(X7,X8)),or(X7,or(X6,X8))))|~(r4))&(~(is_a_theorem(implies(or(esk32_0,or(esk33_0,esk34_0)),or(esk33_0,or(esk32_0,esk34_0)))))|r4)),inference(shift_quantors,[status(thm)],[158])).
% cnf(161,plain,(is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|~r4),inference(split_conjunct,[status(thm)],[159])).
% fof(162, plain,((~(r5)|![X3]:![X4]:![X5]:is_a_theorem(implies(implies(X4,X5),implies(or(X3,X4),or(X3,X5)))))&(?[X3]:?[X4]:?[X5]:~(is_a_theorem(implies(implies(X4,X5),implies(or(X3,X4),or(X3,X5)))))|r5)),inference(fof_nnf,[status(thm)],[30])).
% fof(163, 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)],[162])).
% fof(164, plain,((~(r5)|![X6]:![X7]:![X8]:is_a_theorem(implies(implies(X7,X8),implies(or(X6,X7),or(X6,X8)))))&(~(is_a_theorem(implies(implies(esk36_0,esk37_0),implies(or(esk35_0,esk36_0),or(esk35_0,esk37_0)))))|r5)),inference(skolemize,[status(esa)],[163])).
% fof(165, plain,![X6]:![X7]:![X8]:((is_a_theorem(implies(implies(X7,X8),implies(or(X6,X7),or(X6,X8))))|~(r5))&(~(is_a_theorem(implies(implies(esk36_0,esk37_0),implies(or(esk35_0,esk36_0),or(esk35_0,esk37_0)))))|r5)),inference(shift_quantors,[status(thm)],[164])).
% cnf(167,plain,(is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5),inference(split_conjunct,[status(thm)],[165])).
% fof(222, plain,(~(op_implies_and)|![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),inference(fof_nnf,[status(thm)],[40])).
% fof(223, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(variable_rename,[status(thm)],[222])).
% fof(224, plain,![X3]:![X4]:(implies(X3,X4)=not(and(X3,not(X4)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[223])).
% cnf(225,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[224])).
% fof(226, plain,(~(op_equiv)|![X1]:![X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))),inference(fof_nnf,[status(thm)],[41])).
% fof(227, plain,(~(op_equiv)|![X3]:![X4]:equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))),inference(variable_rename,[status(thm)],[226])).
% fof(228, plain,![X3]:![X4]:(equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))|~(op_equiv)),inference(shift_quantors,[status(thm)],[227])).
% cnf(229,plain,(equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv),inference(split_conjunct,[status(thm)],[228])).
% fof(230, plain,(~(op_or)|![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[42])).
% fof(231, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[230])).
% fof(232, plain,![X3]:![X4]:(or(X3,X4)=not(and(not(X3),not(X4)))|~(op_or)),inference(shift_quantors,[status(thm)],[231])).
% cnf(233,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[232])).
% fof(234, plain,(~(op_and)|![X1]:![X2]:and(X1,X2)=not(or(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[43])).
% fof(235, plain,(~(op_and)|![X3]:![X4]:and(X3,X4)=not(or(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[234])).
% fof(236, plain,![X3]:![X4]:(and(X3,X4)=not(or(not(X3),not(X4)))|~(op_and)),inference(shift_quantors,[status(thm)],[235])).
% cnf(237,plain,(and(X1,X2)=not(or(not(X1),not(X2)))|~op_and),inference(split_conjunct,[status(thm)],[236])).
% fof(238, plain,(~(op_implies_or)|![X1]:![X2]:implies(X1,X2)=or(not(X1),X2)),inference(fof_nnf,[status(thm)],[44])).
% fof(239, plain,(~(op_implies_or)|![X3]:![X4]:implies(X3,X4)=or(not(X3),X4)),inference(variable_rename,[status(thm)],[238])).
% fof(240, plain,![X3]:![X4]:(implies(X3,X4)=or(not(X3),X4)|~(op_implies_or)),inference(shift_quantors,[status(thm)],[239])).
% cnf(241,plain,(implies(X1,X2)=or(not(X1),X2)|~op_implies_or),inference(split_conjunct,[status(thm)],[240])).
% cnf(242,negated_conjecture,(~and_3),inference(split_conjunct,[status(thm)],[47])).
% cnf(251,plain,(X1=X2|$false|~is_a_theorem(equiv(X1,X2))),inference(rw,[status(thm)],[137,89,theory(equality)])).
% cnf(252,plain,(X1=X2|~is_a_theorem(equiv(X1,X2))),inference(cn,[status(thm)],[251,theory(equality)])).
% cnf(253,plain,(~is_a_theorem(implies(esk1_0,implies(esk2_0,and(esk1_0,esk2_0))))),inference(sr,[status(thm)],[52,242,theory(equality)])).
% cnf(254,plain,(or(not(X1),X2)=implies(X1,X2)|$false),inference(rw,[status(thm)],[241,87,theory(equality)])).
% cnf(255,plain,(or(not(X1),X2)=implies(X1,X2)),inference(cn,[status(thm)],[254,theory(equality)])).
% cnf(257,plain,(is_a_theorem(implies(X1,or(X2,X1)))|$false),inference(rw,[status(thm)],[149,57,theory(equality)])).
% cnf(258,plain,(is_a_theorem(implies(X1,or(X2,X1)))),inference(cn,[status(thm)],[257,theory(equality)])).
% cnf(263,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[225,61,theory(equality)])).
% cnf(264,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[263,theory(equality)])).
% cnf(265,plain,(or(implies(X1,X2),X3)=implies(and(X1,not(X2)),X3)),inference(spm,[status(thm)],[255,264,theory(equality)])).
% cnf(267,plain,(is_a_theorem(implies(or(X1,X1),X1))|$false),inference(rw,[status(thm)],[143,56,theory(equality)])).
% cnf(268,plain,(is_a_theorem(implies(or(X1,X1),X1))),inference(cn,[status(thm)],[267,theory(equality)])).
% cnf(270,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[105,55,theory(equality)])).
% cnf(271,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[270,theory(equality)])).
% cnf(272,plain,(is_a_theorem(X1)|~is_a_theorem(or(X1,X1))),inference(spm,[status(thm)],[271,268,theory(equality)])).
% cnf(273,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(X2)),inference(spm,[status(thm)],[271,258,theory(equality)])).
% cnf(274,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[233,264,theory(equality)])).
% cnf(275,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[274,90,theory(equality)])).
% cnf(276,plain,(implies(not(X1),X2)=or(X1,X2)),inference(cn,[status(thm)],[275,theory(equality)])).
% cnf(277,plain,(is_a_theorem(or(X1,or(X2,not(X1))))),inference(spm,[status(thm)],[258,276,theory(equality)])).
% cnf(278,plain,(is_a_theorem(X1)|~is_a_theorem(or(X2,X1))|~is_a_theorem(not(X2))),inference(spm,[status(thm)],[271,276,theory(equality)])).
% cnf(286,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))|$false),inference(rw,[status(thm)],[155,58,theory(equality)])).
% cnf(287,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))),inference(cn,[status(thm)],[286,theory(equality)])).
% cnf(288,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X2,X1))),inference(spm,[status(thm)],[271,287,theory(equality)])).
% cnf(289,plain,(is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))),inference(spm,[status(thm)],[287,255,theory(equality)])).
% cnf(290,plain,(is_a_theorem(implies(implies(X1,X2),or(X2,not(X1))))),inference(spm,[status(thm)],[287,255,theory(equality)])).
% cnf(293,plain,(not(implies(X1,not(X2)))=and(X1,X2)|~op_and),inference(rw,[status(thm)],[237,255,theory(equality)])).
% cnf(294,plain,(not(implies(X1,not(X2)))=and(X1,X2)|$false),inference(rw,[status(thm)],[293,88,theory(equality)])).
% cnf(295,plain,(not(implies(X1,not(X2)))=and(X1,X2)),inference(cn,[status(thm)],[294,theory(equality)])).
% cnf(297,plain,(implies(and(X1,X2),X3)=or(implies(X1,not(X2)),X3)),inference(spm,[status(thm)],[276,295,theory(equality)])).
% cnf(299,plain,(not(implies(X1,and(X2,X3)))=and(X1,implies(X2,not(X3)))),inference(spm,[status(thm)],[295,295,theory(equality)])).
% cnf(301,plain,(not(or(X1,not(X2)))=and(not(X1),X2)),inference(spm,[status(thm)],[295,276,theory(equality)])).
% cnf(303,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)|$false),inference(rw,[status(thm)],[229,54,theory(equality)])).
% cnf(304,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)),inference(cn,[status(thm)],[303,theory(equality)])).
% cnf(308,plain,(is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|$false),inference(rw,[status(thm)],[167,60,theory(equality)])).
% cnf(309,plain,(is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))),inference(cn,[status(thm)],[308,theory(equality)])).
% cnf(310,plain,(is_a_theorem(implies(or(X1,X2),or(X1,X3)))|~is_a_theorem(implies(X2,X3))),inference(spm,[status(thm)],[271,309,theory(equality)])).
% cnf(316,plain,(is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|$false),inference(rw,[status(thm)],[161,59,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(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(335,plain,(is_a_theorem(not(X1))|~is_a_theorem(implies(X1,not(X1)))),inference(spm,[status(thm)],[272,255,theory(equality)])).
% cnf(385,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(or(X1,not(not(X1))))),inference(spm,[status(thm)],[335,276,theory(equality)])).
% cnf(424,plain,(is_a_theorem(or(X1,not(X2)))|~is_a_theorem(implies(X2,X1))),inference(spm,[status(thm)],[288,255,theory(equality)])).
% cnf(426,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(X1)),inference(spm,[status(thm)],[288,273,theory(equality)])).
% cnf(436,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[385,426,theory(equality)])).
% cnf(439,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(not(X1))),inference(spm,[status(thm)],[426,255,theory(equality)])).
% cnf(441,plain,(is_a_theorem(not(and(X1,X2)))|~is_a_theorem(implies(X1,not(X2)))),inference(spm,[status(thm)],[436,295,theory(equality)])).
% cnf(540,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(or(X2,not(X1)))),inference(spm,[status(thm)],[271,289,theory(equality)])).
% cnf(547,plain,(is_a_theorem(implies(implies(X1,not(X2)),implies(X2,not(X1))))),inference(spm,[status(thm)],[289,255,theory(equality)])).
% cnf(577,plain,(is_a_theorem(implies(X1,not(X2)))|~is_a_theorem(implies(X2,not(X1)))),inference(spm,[status(thm)],[540,255,theory(equality)])).
% cnf(753,plain,(is_a_theorem(implies(implies(X1,implies(X2,not(X3))),implies(and(X2,X3),not(X1))))),inference(spm,[status(thm)],[290,297,theory(equality)])).
% cnf(1386,plain,(not(implies(X1,not(X2)))=and(not(not(X1)),X2)),inference(spm,[status(thm)],[301,255,theory(equality)])).
% cnf(1397,plain,(and(X1,X2)=and(not(not(X1)),X2)),inference(rw,[status(thm)],[1386,295,theory(equality)])).
% cnf(1890,plain,(is_a_theorem(implies(or(X1,or(X2,X2)),or(X1,X2)))),inference(spm,[status(thm)],[310,268,theory(equality)])).
% cnf(1911,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X1,or(X2,X2)))),inference(spm,[status(thm)],[271,1890,theory(equality)])).
% cnf(2295,plain,(is_a_theorem(or(X1,not(X1)))),inference(spm,[status(thm)],[1911,277,theory(equality)])).
% cnf(2305,plain,(is_a_theorem(or(not(X1),X1))),inference(spm,[status(thm)],[288,2295,theory(equality)])).
% cnf(2316,plain,(is_a_theorem(implies(X1,X1))),inference(rw,[status(thm)],[2305,255,theory(equality)])).
% cnf(2324,plain,(is_a_theorem(not(and(not(X1),X1)))),inference(spm,[status(thm)],[441,2316,theory(equality)])).
% cnf(2346,plain,(is_a_theorem(implies(and(not(X1),X1),X2))),inference(spm,[status(thm)],[439,2324,theory(equality)])).
% cnf(2410,plain,(is_a_theorem(implies(and(X1,not(X1)),X2))),inference(spm,[status(thm)],[2346,1397,theory(equality)])).
% cnf(2417,plain,(is_a_theorem(or(implies(X1,X1),X2))),inference(rw,[status(thm)],[2410,265,theory(equality)])).
% cnf(3102,plain,(is_a_theorem(not(not(implies(X1,X1))))),inference(spm,[status(thm)],[385,2417,theory(equality)])).
% cnf(3113,plain,(is_a_theorem(X1)|~is_a_theorem(or(not(implies(X2,X2)),X1))),inference(spm,[status(thm)],[278,3102,theory(equality)])).
% cnf(3120,plain,(is_a_theorem(X1)|~is_a_theorem(implies(implies(X2,X2),X1))),inference(rw,[status(thm)],[3113,255,theory(equality)])).
% cnf(3256,plain,(is_a_theorem(or(X1,implies(or(X1,X2),X2)))),inference(spm,[status(thm)],[3120,323,theory(equality)])).
% cnf(3333,plain,(is_a_theorem(or(implies(or(X1,X2),X2),X1))),inference(spm,[status(thm)],[288,3256,theory(equality)])).
% cnf(3360,plain,(is_a_theorem(implies(X1,implies(or(not(X1),X2),X2)))),inference(spm,[status(thm)],[540,3333,theory(equality)])).
% cnf(3366,plain,(is_a_theorem(implies(X1,implies(implies(X1,X2),X2)))),inference(rw,[status(thm)],[3360,255,theory(equality)])).
% cnf(3381,plain,(is_a_theorem(implies(implies(X1,X2),X2))|~is_a_theorem(X1)),inference(spm,[status(thm)],[271,3366,theory(equality)])).
% cnf(24757,plain,(is_a_theorem(or(implies(X1,not(X2)),not(implies(X2,not(X1)))))),inference(spm,[status(thm)],[424,547,theory(equality)])).
% cnf(24786,plain,(is_a_theorem(implies(and(X1,X2),and(X2,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[24757,295,theory(equality)]),297,theory(equality)])).
% cnf(57046,plain,(is_a_theorem(implies(and(X1,X2),not(X3)))|~is_a_theorem(implies(X3,implies(X1,not(X2))))),inference(spm,[status(thm)],[271,753,theory(equality)])).
% cnf(107130,plain,(is_a_theorem(implies(X1,not(implies(X2,not(X1)))))|~is_a_theorem(X2)),inference(spm,[status(thm)],[577,3381,theory(equality)])).
% cnf(107186,plain,(is_a_theorem(implies(X1,and(X2,X1)))|~is_a_theorem(X2)),inference(rw,[status(thm)],[107130,295,theory(equality)])).
% cnf(117274,plain,(is_a_theorem(and(X1,X2))|~is_a_theorem(X2)|~is_a_theorem(X1)),inference(spm,[status(thm)],[271,107186,theory(equality)])).
% cnf(117414,plain,(is_a_theorem(equiv(X1,X2))|~is_a_theorem(implies(X2,X1))|~is_a_theorem(implies(X1,X2))),inference(spm,[status(thm)],[117274,304,theory(equality)])).
% cnf(448230,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)],[117414,287,theory(equality)])).
% cnf(448797,plain,(is_a_theorem(equiv(and(X1,X2),and(X2,X1)))|~is_a_theorem(implies(and(X1,X2),and(X2,X1)))),inference(spm,[status(thm)],[117414,24786,theory(equality)])).
% cnf(449525,plain,(is_a_theorem(equiv(or(X1,X2),or(X2,X1)))|$false),inference(rw,[status(thm)],[448230,287,theory(equality)])).
% cnf(449526,plain,(is_a_theorem(equiv(or(X1,X2),or(X2,X1)))),inference(cn,[status(thm)],[449525,theory(equality)])).
% cnf(450018,plain,(is_a_theorem(equiv(and(X1,X2),and(X2,X1)))|$false),inference(rw,[status(thm)],[448797,24786,theory(equality)])).
% cnf(450019,plain,(is_a_theorem(equiv(and(X1,X2),and(X2,X1)))),inference(cn,[status(thm)],[450018,theory(equality)])).
% cnf(462744,plain,(or(X1,X2)=or(X2,X1)),inference(spm,[status(thm)],[252,449526,theory(equality)])).
% cnf(484008,plain,(and(X1,X2)=and(X2,X1)),inference(spm,[status(thm)],[252,450019,theory(equality)])).
% cnf(836370,plain,(is_a_theorem(implies(and(implies(X1,not(X2)),X2),not(X1)))),inference(spm,[status(thm)],[57046,3366,theory(equality)])).
% cnf(836498,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[836370,484008,theory(equality)]),299,theory(equality)]),276,theory(equality)]),462744,theory(equality)]),255,theory(equality)])).
% cnf(837389,plain,($false),inference(rw,[status(thm)],[253,836498,theory(equality)])).
% cnf(837390,plain,($false),inference(cn,[status(thm)],[837389,theory(equality)])).
% cnf(837391,plain,($false),837390,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 28275
% # ...of these trivial : 3488
% # ...subsumed : 19422
% # ...remaining for further processing: 5365
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 40
% # Backward-rewritten : 3581
% # Generated clauses : 521932
% # ...of the previous two non-trivial : 313397
% # Contextual simplify-reflections : 1873
% # Paramodulations : 521932
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1744
% # Positive orientable unit clauses: 1233
% # Positive unorientable unit clauses: 8
% # Negative unit clauses : 5
% # Non-unit-clauses : 498
% # Current number of unprocessed clauses: 137593
% # ...number of literals in the above : 263292
% # Clause-clause subsumption calls (NU) : 148871
% # Rec. Clause-clause subsumption calls : 148122
% # Unit Clause-clause subsumption calls : 5257
% # Rewrite failures with RHS unbound : 106
% # Indexed BW rewrite attempts : 413931
% # Indexed BW rewrite successes : 5245
% # Backwards rewriting index: 699 leaves, 5.74+/-13.636 terms/leaf
% # Paramod-from index: 142 leaves, 9.11+/-25.330 terms/leaf
% # Paramod-into index: 681 leaves, 5.75+/-13.661 terms/leaf
% # -------------------------------------------------
% # User time : 18.757 s
% # System time : 0.625 s
% # Total time : 19.382 s
% # Maximum resident set size: 0 pages
% PrfWatch: 29.57 CPU 31.29 WC
% FINAL PrfWatch: 29.57 CPU 31.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP16993/LCL489+1.tptp
%
%------------------------------------------------------------------------------