%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL495+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:41:26 EST 2010
% Result : Theorem 28.43s
% Output : Solution 28.43s
% 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/SystemOnTPTP17327/LCL495+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17327/LCL495+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17327/LCL495+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 17423
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.03 WC
% PrfWatch: 3.92 CPU 4.04 WC
% PrfWatch: 5.91 CPU 6.04 WC
% PrfWatch: 7.89 CPU 8.05 WC
% PrfWatch: 9.88 CPU 10.06 WC
% PrfWatch: 11.88 CPU 12.07 WC
% PrfWatch: 13.86 CPU 14.07 WC
% PrfWatch: 15.85 CPU 16.08 WC
% PrfWatch: 17.83 CPU 18.09 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 19.81 CPU 20.09 WC
% PrfWatch: 21.80 CPU 22.10 WC
% PrfWatch: 23.79 CPU 24.11 WC
% PrfWatch: 25.79 CPU 26.11 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,(equivalence_3<=>![X1]:![X2]:is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))),file('/tmp/SRASS.s.p', equivalence_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,substitution_of_equivalents,file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(13, axiom,op_implies_or,file('/tmp/SRASS.s.p', principia_op_implies_or)).
% fof(14, axiom,op_and,file('/tmp/SRASS.s.p', principia_op_and)).
% fof(15, axiom,op_or,file('/tmp/SRASS.s.p', hilbert_op_or)).
% fof(16, axiom,op_implies_and,file('/tmp/SRASS.s.p', hilbert_op_implies_and)).
% fof(17, 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,(substitution_of_equivalents<=>![X1]:![X2]:(is_a_theorem(equiv(X1,X2))=>X1=X2)),file('/tmp/SRASS.s.p', substitution_of_equivalents)).
% fof(23, axiom,(op_implies_and=>![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(24, axiom,(r1<=>![X4]:is_a_theorem(implies(or(X4,X4),X4))),file('/tmp/SRASS.s.p', r1)).
% fof(25, axiom,(r2<=>![X4]:![X5]:is_a_theorem(implies(X5,or(X4,X5)))),file('/tmp/SRASS.s.p', r2)).
% fof(26, axiom,(r3<=>![X4]:![X5]:is_a_theorem(implies(or(X4,X5),or(X5,X4)))),file('/tmp/SRASS.s.p', r3)).
% fof(27, axiom,(r4<=>![X4]:![X5]:![X6]:is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6))))),file('/tmp/SRASS.s.p', r4)).
% fof(28, axiom,(r5<=>![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6))))),file('/tmp/SRASS.s.p', r5)).
% fof(29, axiom,(op_equiv=>![X1]:![X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))),file('/tmp/SRASS.s.p', op_equiv)).
% fof(41, axiom,(op_or=>![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_or)).
% fof(42, 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,equivalence_3,file('/tmp/SRASS.s.p', hilbert_equivalence_3)).
% fof(46, negated_conjecture,~(equivalence_3),inference(assume_negation,[status(cth)],[45])).
% fof(47, negated_conjecture,~(equivalence_3),inference(fof_simplification,[status(thm)],[46,theory(equality)])).
% fof(48, plain,((~(equivalence_3)|![X1]:![X2]:is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2)))))&(?[X1]:?[X2]:~(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2)))))|equivalence_3)),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,((~(equivalence_3)|![X3]:![X4]:is_a_theorem(implies(implies(X3,X4),implies(implies(X4,X3),equiv(X3,X4)))))&(?[X5]:?[X6]:~(is_a_theorem(implies(implies(X5,X6),implies(implies(X6,X5),equiv(X5,X6)))))|equivalence_3)),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,((~(equivalence_3)|![X3]:![X4]:is_a_theorem(implies(implies(X3,X4),implies(implies(X4,X3),equiv(X3,X4)))))&(~(is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk1_0),equiv(esk1_0,esk2_0)))))|equivalence_3)),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X3]:![X4]:((is_a_theorem(implies(implies(X3,X4),implies(implies(X4,X3),equiv(X3,X4))))|~(equivalence_3))&(~(is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk1_0),equiv(esk1_0,esk2_0)))))|equivalence_3)),inference(shift_quantors,[status(thm)],[50])).
% cnf(52,plain,(equivalence_3|~is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk1_0),equiv(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,(substitution_of_equivalents),inference(split_conjunct,[status(thm)],[9])).
% cnf(75,plain,(op_implies_or),inference(split_conjunct,[status(thm)],[13])).
% cnf(76,plain,(op_and),inference(split_conjunct,[status(thm)],[14])).
% cnf(77,plain,(op_or),inference(split_conjunct,[status(thm)],[15])).
% cnf(78,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[16])).
% fof(79, 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)],[17])).
% fof(80, 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)],[79])).
% fof(81, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(((is_a_theorem(esk7_0)&is_a_theorem(implies(esk7_0,esk8_0)))&~(is_a_theorem(esk8_0)))|modus_ponens)),inference(skolemize,[status(esa)],[80])).
% fof(82, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk7_0)&is_a_theorem(implies(esk7_0,esk8_0)))&~(is_a_theorem(esk8_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[81])).
% fof(83, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk7_0)|modus_ponens)&(is_a_theorem(implies(esk7_0,esk8_0))|modus_ponens))&(~(is_a_theorem(esk8_0))|modus_ponens))),inference(distribute,[status(thm)],[82])).
% cnf(87,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[83])).
% fof(112, 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)],[22])).
% fof(113, 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)],[112])).
% fof(114, plain,((~(substitution_of_equivalents)|![X3]:![X4]:(~(is_a_theorem(equiv(X3,X4)))|X3=X4))&((is_a_theorem(equiv(esk19_0,esk20_0))&~(esk19_0=esk20_0))|substitution_of_equivalents)),inference(skolemize,[status(esa)],[113])).
% fof(115, plain,![X3]:![X4]:(((~(is_a_theorem(equiv(X3,X4)))|X3=X4)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk19_0,esk20_0))&~(esk19_0=esk20_0))|substitution_of_equivalents)),inference(shift_quantors,[status(thm)],[114])).
% fof(116, plain,![X3]:![X4]:(((~(is_a_theorem(equiv(X3,X4)))|X3=X4)|~(substitution_of_equivalents))&((is_a_theorem(equiv(esk19_0,esk20_0))|substitution_of_equivalents)&(~(esk19_0=esk20_0)|substitution_of_equivalents))),inference(distribute,[status(thm)],[115])).
% cnf(119,plain,(X1=X2|~substitution_of_equivalents|~is_a_theorem(equiv(X1,X2))),inference(split_conjunct,[status(thm)],[116])).
% fof(120, plain,(~(op_implies_and)|![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),inference(fof_nnf,[status(thm)],[23])).
% fof(121, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(variable_rename,[status(thm)],[120])).
% fof(122, plain,![X3]:![X4]:(implies(X3,X4)=not(and(X3,not(X4)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[121])).
% cnf(123,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[122])).
% fof(124, plain,((~(r1)|![X4]:is_a_theorem(implies(or(X4,X4),X4)))&(?[X4]:~(is_a_theorem(implies(or(X4,X4),X4)))|r1)),inference(fof_nnf,[status(thm)],[24])).
% fof(125, plain,((~(r1)|![X5]:is_a_theorem(implies(or(X5,X5),X5)))&(?[X6]:~(is_a_theorem(implies(or(X6,X6),X6)))|r1)),inference(variable_rename,[status(thm)],[124])).
% fof(126, plain,((~(r1)|![X5]:is_a_theorem(implies(or(X5,X5),X5)))&(~(is_a_theorem(implies(or(esk21_0,esk21_0),esk21_0)))|r1)),inference(skolemize,[status(esa)],[125])).
% fof(127, plain,![X5]:((is_a_theorem(implies(or(X5,X5),X5))|~(r1))&(~(is_a_theorem(implies(or(esk21_0,esk21_0),esk21_0)))|r1)),inference(shift_quantors,[status(thm)],[126])).
% cnf(129,plain,(is_a_theorem(implies(or(X1,X1),X1))|~r1),inference(split_conjunct,[status(thm)],[127])).
% fof(130, plain,((~(r2)|![X4]:![X5]:is_a_theorem(implies(X5,or(X4,X5))))&(?[X4]:?[X5]:~(is_a_theorem(implies(X5,or(X4,X5))))|r2)),inference(fof_nnf,[status(thm)],[25])).
% fof(131, plain,((~(r2)|![X6]:![X7]:is_a_theorem(implies(X7,or(X6,X7))))&(?[X8]:?[X9]:~(is_a_theorem(implies(X9,or(X8,X9))))|r2)),inference(variable_rename,[status(thm)],[130])).
% fof(132, plain,((~(r2)|![X6]:![X7]:is_a_theorem(implies(X7,or(X6,X7))))&(~(is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0))))|r2)),inference(skolemize,[status(esa)],[131])).
% fof(133, plain,![X6]:![X7]:((is_a_theorem(implies(X7,or(X6,X7)))|~(r2))&(~(is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0))))|r2)),inference(shift_quantors,[status(thm)],[132])).
% cnf(135,plain,(is_a_theorem(implies(X1,or(X2,X1)))|~r2),inference(split_conjunct,[status(thm)],[133])).
% fof(136, plain,((~(r3)|![X4]:![X5]:is_a_theorem(implies(or(X4,X5),or(X5,X4))))&(?[X4]:?[X5]:~(is_a_theorem(implies(or(X4,X5),or(X5,X4))))|r3)),inference(fof_nnf,[status(thm)],[26])).
% fof(137, plain,((~(r3)|![X6]:![X7]:is_a_theorem(implies(or(X6,X7),or(X7,X6))))&(?[X8]:?[X9]:~(is_a_theorem(implies(or(X8,X9),or(X9,X8))))|r3)),inference(variable_rename,[status(thm)],[136])).
% fof(138, plain,((~(r3)|![X6]:![X7]:is_a_theorem(implies(or(X6,X7),or(X7,X6))))&(~(is_a_theorem(implies(or(esk24_0,esk25_0),or(esk25_0,esk24_0))))|r3)),inference(skolemize,[status(esa)],[137])).
% fof(139, plain,![X6]:![X7]:((is_a_theorem(implies(or(X6,X7),or(X7,X6)))|~(r3))&(~(is_a_theorem(implies(or(esk24_0,esk25_0),or(esk25_0,esk24_0))))|r3)),inference(shift_quantors,[status(thm)],[138])).
% cnf(141,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3),inference(split_conjunct,[status(thm)],[139])).
% fof(142, plain,((~(r4)|![X4]:![X5]:![X6]:is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6)))))&(?[X4]:?[X5]:?[X6]:~(is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6)))))|r4)),inference(fof_nnf,[status(thm)],[27])).
% fof(143, plain,((~(r4)|![X7]:![X8]:![X9]:is_a_theorem(implies(or(X7,or(X8,X9)),or(X8,or(X7,X9)))))&(?[X10]:?[X11]:?[X12]:~(is_a_theorem(implies(or(X10,or(X11,X12)),or(X11,or(X10,X12)))))|r4)),inference(variable_rename,[status(thm)],[142])).
% fof(144, plain,((~(r4)|![X7]:![X8]:![X9]:is_a_theorem(implies(or(X7,or(X8,X9)),or(X8,or(X7,X9)))))&(~(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)],[143])).
% fof(145, plain,![X7]:![X8]:![X9]:((is_a_theorem(implies(or(X7,or(X8,X9)),or(X8,or(X7,X9))))|~(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)],[144])).
% cnf(147,plain,(is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|~r4),inference(split_conjunct,[status(thm)],[145])).
% fof(148, plain,((~(r5)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6)))))&(?[X4]:?[X5]:?[X6]:~(is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6)))))|r5)),inference(fof_nnf,[status(thm)],[28])).
% fof(149, plain,((~(r5)|![X7]:![X8]:![X9]:is_a_theorem(implies(implies(X8,X9),implies(or(X7,X8),or(X7,X9)))))&(?[X10]:?[X11]:?[X12]:~(is_a_theorem(implies(implies(X11,X12),implies(or(X10,X11),or(X10,X12)))))|r5)),inference(variable_rename,[status(thm)],[148])).
% fof(150, plain,((~(r5)|![X7]:![X8]:![X9]:is_a_theorem(implies(implies(X8,X9),implies(or(X7,X8),or(X7,X9)))))&(~(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)],[149])).
% fof(151, plain,![X7]:![X8]:![X9]:((is_a_theorem(implies(implies(X8,X9),implies(or(X7,X8),or(X7,X9))))|~(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)],[150])).
% cnf(153,plain,(is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5),inference(split_conjunct,[status(thm)],[151])).
% fof(154, plain,(~(op_equiv)|![X1]:![X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))),inference(fof_nnf,[status(thm)],[29])).
% fof(155, plain,(~(op_equiv)|![X3]:![X4]:equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))),inference(variable_rename,[status(thm)],[154])).
% fof(156, plain,![X3]:![X4]:(equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))|~(op_equiv)),inference(shift_quantors,[status(thm)],[155])).
% cnf(157,plain,(equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv),inference(split_conjunct,[status(thm)],[156])).
% fof(224, plain,(~(op_or)|![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[41])).
% fof(225, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[224])).
% fof(226, plain,![X3]:![X4]:(or(X3,X4)=not(and(not(X3),not(X4)))|~(op_or)),inference(shift_quantors,[status(thm)],[225])).
% cnf(227,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[226])).
% fof(228, plain,(~(op_and)|![X1]:![X2]:and(X1,X2)=not(or(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[42])).
% fof(229, plain,(~(op_and)|![X3]:![X4]:and(X3,X4)=not(or(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[228])).
% fof(230, plain,![X3]:![X4]:(and(X3,X4)=not(or(not(X3),not(X4)))|~(op_and)),inference(shift_quantors,[status(thm)],[229])).
% cnf(231,plain,(and(X1,X2)=not(or(not(X1),not(X2)))|~op_and),inference(split_conjunct,[status(thm)],[230])).
% 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,(~equivalence_3),inference(split_conjunct,[status(thm)],[47])).
% cnf(251,plain,(X1=X2|$false|~is_a_theorem(equiv(X1,X2))),inference(rw,[status(thm)],[119,61,theory(equality)])).
% cnf(252,plain,(X1=X2|~is_a_theorem(equiv(X1,X2))),inference(cn,[status(thm)],[251,theory(equality)])).
% cnf(254,plain,(or(not(X1),X2)=implies(X1,X2)|$false),inference(rw,[status(thm)],[241,75,theory(equality)])).
% cnf(255,plain,(or(not(X1),X2)=implies(X1,X2)),inference(cn,[status(thm)],[254,theory(equality)])).
% cnf(256,plain,(is_a_theorem(implies(X1,or(X2,X1)))|$false),inference(rw,[status(thm)],[135,57,theory(equality)])).
% cnf(257,plain,(is_a_theorem(implies(X1,or(X2,X1)))),inference(cn,[status(thm)],[256,theory(equality)])).
% cnf(262,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[123,78,theory(equality)])).
% cnf(263,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[262,theory(equality)])).
% cnf(264,plain,(or(implies(X1,X2),X3)=implies(and(X1,not(X2)),X3)),inference(spm,[status(thm)],[255,263,theory(equality)])).
% cnf(266,plain,(is_a_theorem(implies(or(X1,X1),X1))|$false),inference(rw,[status(thm)],[129,56,theory(equality)])).
% cnf(267,plain,(is_a_theorem(implies(or(X1,X1),X1))),inference(cn,[status(thm)],[266,theory(equality)])).
% cnf(269,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[87,55,theory(equality)])).
% cnf(270,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[269,theory(equality)])).
% cnf(271,plain,(is_a_theorem(X1)|~is_a_theorem(or(X1,X1))),inference(spm,[status(thm)],[270,267,theory(equality)])).
% cnf(272,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(X2)),inference(spm,[status(thm)],[270,257,theory(equality)])).
% cnf(273,plain,(~is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk1_0),equiv(esk1_0,esk2_0))))),inference(sr,[status(thm)],[52,242,theory(equality)])).
% cnf(274,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[227,263,theory(equality)])).
% cnf(275,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[274,77,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)],[257,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)],[270,276,theory(equality)])).
% cnf(286,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))|$false),inference(rw,[status(thm)],[141,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)],[270,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(293,plain,(not(implies(X1,not(X2)))=and(X1,X2)|~op_and),inference(rw,[status(thm)],[231,255,theory(equality)])).
% cnf(294,plain,(not(implies(X1,not(X2)))=and(X1,X2)|$false),inference(rw,[status(thm)],[293,76,theory(equality)])).
% cnf(295,plain,(not(implies(X1,not(X2)))=and(X1,X2)),inference(cn,[status(thm)],[294,theory(equality)])).
% cnf(296,plain,(or(and(X1,X2),X3)=implies(implies(X1,not(X2)),X3)),inference(spm,[status(thm)],[255,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)],[157,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)],[153,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)],[270,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)],[147,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)],[271,255,theory(equality)])).
% cnf(387,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(or(X1,not(not(X1))))),inference(spm,[status(thm)],[335,276,theory(equality)])).
% cnf(426,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(X1)),inference(spm,[status(thm)],[288,272,theory(equality)])).
% cnf(436,plain,(is_a_theorem(not(not(X1)))|~is_a_theorem(X1)),inference(spm,[status(thm)],[387,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(443,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)],[270,289,theory(equality)])).
% cnf(578,plain,(is_a_theorem(implies(X1,not(X2)))|~is_a_theorem(implies(X2,not(X1)))),inference(spm,[status(thm)],[540,255,theory(equality)])).
% cnf(695,plain,(or(equiv(X1,X2),X3)=implies(implies(implies(X1,X2),not(implies(X2,X1))),X3)),inference(spm,[status(thm)],[296,304,theory(equality)])).
% cnf(1387,plain,(not(implies(X1,not(X2)))=and(not(not(X1)),X2)),inference(spm,[status(thm)],[301,255,theory(equality)])).
% cnf(1398,plain,(and(X1,X2)=and(not(not(X1)),X2)),inference(rw,[status(thm)],[1387,295,theory(equality)])).
% cnf(1890,plain,(is_a_theorem(implies(or(X1,or(X2,X2)),or(X1,X2)))),inference(spm,[status(thm)],[310,267,theory(equality)])).
% cnf(1911,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X1,or(X2,X2)))),inference(spm,[status(thm)],[270,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)],[443,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,1398,theory(equality)])).
% cnf(2417,plain,(is_a_theorem(or(implies(X1,X1),X2))),inference(rw,[status(thm)],[2410,264,theory(equality)])).
% cnf(3102,plain,(is_a_theorem(not(not(implies(X1,X1))))),inference(spm,[status(thm)],[387,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)],[270,3366,theory(equality)])).
% cnf(49278,plain,(is_a_theorem(implies(implies(X1,X2),or(equiv(X1,X2),not(implies(X2,X1)))))),inference(spm,[status(thm)],[3366,695,theory(equality)])).
% cnf(109745,plain,(is_a_theorem(implies(X1,not(implies(X2,not(X1)))))|~is_a_theorem(X2)),inference(spm,[status(thm)],[578,3381,theory(equality)])).
% cnf(109797,plain,(is_a_theorem(implies(X1,and(X2,X1)))|~is_a_theorem(X2)),inference(rw,[status(thm)],[109745,295,theory(equality)])).
% cnf(120622,plain,(is_a_theorem(and(X1,X2))|~is_a_theorem(X2)|~is_a_theorem(X1)),inference(spm,[status(thm)],[270,109797,theory(equality)])).
% cnf(120764,plain,(is_a_theorem(equiv(X1,X2))|~is_a_theorem(implies(X2,X1))|~is_a_theorem(implies(X1,X2))),inference(spm,[status(thm)],[120622,304,theory(equality)])).
% cnf(453508,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)],[120764,287,theory(equality)])).
% cnf(454807,plain,(is_a_theorem(equiv(or(X1,X2),or(X2,X1)))|$false),inference(rw,[status(thm)],[453508,287,theory(equality)])).
% cnf(454808,plain,(is_a_theorem(equiv(or(X1,X2),or(X2,X1)))),inference(cn,[status(thm)],[454807,theory(equality)])).
% cnf(468034,plain,(or(X1,X2)=or(X2,X1)),inference(spm,[status(thm)],[252,454808,theory(equality)])).
% cnf(468411,plain,(or(X2,not(X1))=implies(X1,X2)),inference(spm,[status(thm)],[255,468034,theory(equality)])).
% cnf(773341,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))),inference(rw,[status(thm)],[49278,468411,theory(equality)])).
% cnf(773507,plain,($false),inference(rw,[status(thm)],[273,773341,theory(equality)])).
% cnf(773508,plain,($false),inference(cn,[status(thm)],[773507,theory(equality)])).
% cnf(773509,plain,($false),773508,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 24585
% # ...of these trivial : 3241
% # ...subsumed : 16092
% # ...remaining for further processing: 5252
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 44
% # Backward-rewritten : 3584
% # Generated clauses : 476823
% # ...of the previous two non-trivial : 282480
% # Contextual simplify-reflections : 1521
% # Paramodulations : 476823
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1624
% # Positive orientable unit clauses: 1129
% # Positive unorientable unit clauses: 7
% # Negative unit clauses : 5
% # Non-unit-clauses : 483
% # Current number of unprocessed clauses: 108151
% # ...number of literals in the above : 209001
% # Clause-clause subsumption calls (NU) : 129855
% # Rec. Clause-clause subsumption calls : 129317
% # Unit Clause-clause subsumption calls : 5199
% # Rewrite failures with RHS unbound : 104
% # Indexed BW rewrite attempts : 401525
% # Indexed BW rewrite successes : 5247
% # Backwards rewriting index: 682 leaves, 5.42+/-12.674 terms/leaf
% # Paramod-from index: 134 leaves, 8.77+/-23.694 terms/leaf
% # Paramod-into index: 666 leaves, 5.42+/-12.656 terms/leaf
% # -------------------------------------------------
% # User time : 17.389 s
% # System time : 0.604 s
% # Total time : 17.993 s
% # Maximum resident set size: 0 pages
% PrfWatch: 27.34 CPU 27.67 WC
% FINAL PrfWatch: 27.34 CPU 27.67 WC
% SZS output end Solution for /tmp/SystemOnTPTP17327/LCL495+1.tptp
%
%------------------------------------------------------------------------------