TSTP Solution File: LCL498+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL498+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:12:56 EDT 2023
% Result : Theorem 0.16s 0.57s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 24
% Syntax : Number of formulae : 104 ( 48 unt; 0 def)
% Number of atoms : 196 ( 25 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 158 ( 66 ~; 66 |; 12 &)
% ( 8 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 15 ( 13 usr; 13 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 16 con; 0-2 aty)
% Number of variables : 149 ( 5 sgn; 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X2)) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',modus_ponens) ).
fof(r4,axiom,
( r4
<=> ! [X4,X5,X6] : is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6)))) ),
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',r4) ).
fof(principia_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',principia_modus_ponens) ).
fof(principia_r4,axiom,
r4,
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',principia_r4) ).
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',op_implies_or) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',principia_op_implies_or) ).
fof(r2,axiom,
( r2
<=> ! [X4,X5] : is_a_theorem(implies(X5,or(X4,X5))) ),
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',r2) ).
fof(r3,axiom,
( r3
<=> ! [X4,X5] : is_a_theorem(implies(or(X4,X5),or(X5,X4))) ),
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',r3) ).
fof(principia_r2,axiom,
r2,
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',principia_r2) ).
fof(principia_r3,axiom,
r3,
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',principia_r3) ).
fof(op_and,axiom,
( op_and
=> ! [X1,X2] : and(X1,X2) = not(or(not(X1),not(X2))) ),
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',op_and) ).
fof(r5,axiom,
( r5
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6)))) ),
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',r5) ).
fof(principia_op_and,axiom,
op_and,
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',principia_op_and) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',op_or) ).
fof(principia_r5,axiom,
r5,
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',principia_r5) ).
fof(luka_op_or,axiom,
op_or,
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',luka_op_or) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',op_equiv) ).
fof(substitution_of_equivalents,axiom,
( substitution_of_equivalents
<=> ! [X1,X2] :
( is_a_theorem(equiv(X1,X2))
=> X1 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',substitution_of_equivalents) ).
fof(principia_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',principia_op_equiv) ).
fof(r1,axiom,
( r1
<=> ! [X4] : is_a_theorem(implies(or(X4,X4),X4)) ),
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',r1) ).
fof(substitution_of_equivalents_0001,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',substitution_of_equivalents_0001) ).
fof(principia_r1,axiom,
r1,
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',principia_r1) ).
fof(cn3,axiom,
( cn3
<=> ! [X4] : is_a_theorem(implies(implies(not(X4),X4),X4)) ),
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',cn3) ).
fof(luka_cn3,conjecture,
cn3,
file('/export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p',luka_cn3) ).
fof(c_0_24,plain,
! [X7,X8] :
( ( ~ modus_ponens
| ~ is_a_theorem(X7)
| ~ is_a_theorem(implies(X7,X8))
| is_a_theorem(X8) )
& ( is_a_theorem(esk1_0)
| modus_ponens )
& ( is_a_theorem(implies(esk1_0,esk2_0))
| modus_ponens )
& ( ~ is_a_theorem(esk2_0)
| modus_ponens ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])]) ).
fof(c_0_25,plain,
! [X105,X106,X107] :
( ( ~ r4
| is_a_theorem(implies(or(X105,or(X106,X107)),or(X106,or(X105,X107)))) )
& ( ~ is_a_theorem(implies(or(esk50_0,or(esk51_0,esk52_0)),or(esk51_0,or(esk50_0,esk52_0))))
| r4 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r4])])])]) ).
cnf(c_0_26,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[principia_modus_ponens]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))
| ~ r4 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
r4,
inference(split_conjunct,[status(thm)],[principia_r4]) ).
fof(c_0_30,plain,
! [X123,X124] :
( ~ op_implies_or
| implies(X123,X124) = or(not(X123),X124) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_or])])]) ).
cnf(c_0_31,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_33,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
fof(c_0_35,plain,
! [X97,X98] :
( ( ~ r2
| is_a_theorem(implies(X98,or(X97,X98))) )
& ( ~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0)))
| r2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r2])])])]) ).
fof(c_0_36,plain,
! [X101,X102] :
( ( ~ r3
| is_a_theorem(implies(or(X101,X102),or(X102,X101))) )
& ( ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0)))
| r3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r3])])])]) ).
cnf(c_0_37,plain,
( is_a_theorem(or(X1,or(X2,X3)))
| ~ is_a_theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_39,plain,
( is_a_theorem(implies(X1,or(X2,X1)))
| ~ r2 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
r2,
inference(split_conjunct,[status(thm)],[principia_r2]) ).
cnf(c_0_41,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,plain,
r3,
inference(split_conjunct,[status(thm)],[principia_r3]) ).
cnf(c_0_43,plain,
( is_a_theorem(implies(X1,or(X2,X3)))
| ~ is_a_theorem(or(X2,implies(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_38]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
cnf(c_0_45,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]) ).
cnf(c_0_46,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_38]),c_0_38]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_44,c_0_38]) ).
cnf(c_0_48,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_45]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
( is_a_theorem(or(X1,not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_48,c_0_38]) ).
cnf(c_0_51,plain,
( is_a_theorem(implies(X1,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_49]) ).
cnf(c_0_52,plain,
( is_a_theorem(implies(X1,not(X2)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_50,c_0_38]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_51,c_0_32]) ).
fof(c_0_54,plain,
! [X119,X120] :
( ~ op_and
| and(X119,X120) = not(or(not(X119),not(X120))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_and])])]) ).
fof(c_0_55,plain,
! [X111,X112,X113] :
( ( ~ r5
| is_a_theorem(implies(implies(X112,X113),implies(or(X111,X112),or(X111,X113)))) )
& ( ~ is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0))))
| r5 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r5])])])]) ).
cnf(c_0_56,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
( and(X1,X2) = not(or(not(X1),not(X2)))
| ~ op_and ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_58,plain,
op_and,
inference(split_conjunct,[status(thm)],[principia_op_and]) ).
fof(c_0_59,plain,
! [X117,X118] :
( ~ op_or
| or(X117,X118) = not(and(not(X117),not(X118))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])]) ).
cnf(c_0_60,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))
| ~ r5 ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_61,plain,
r5,
inference(split_conjunct,[status(thm)],[principia_r5]) ).
cnf(c_0_62,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_56]) ).
cnf(c_0_63,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_38]),c_0_58])]) ).
cnf(c_0_64,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_65,plain,
op_or,
inference(split_conjunct,[status(thm)],[luka_op_or]) ).
cnf(c_0_66,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_46,c_0_53]) ).
cnf(c_0_67,plain,
is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]) ).
cnf(c_0_68,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(implies(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_69,plain,
not(and(not(X1),not(X2))) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_70,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_66]) ).
fof(c_0_71,plain,
! [X125,X126] :
( ~ op_equiv
| equiv(X125,X126) = and(implies(X125,X126),implies(X126,X125)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])]) ).
cnf(c_0_72,plain,
( is_a_theorem(implies(or(X1,X2),or(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_31,c_0_67]) ).
cnf(c_0_73,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(not(X1),not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
fof(c_0_74,plain,
! [X11,X12] :
( ( ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X11,X12))
| X11 = X12 )
& ( is_a_theorem(equiv(esk3_0,esk4_0))
| substitution_of_equivalents )
& ( esk3_0 != esk4_0
| substitution_of_equivalents ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substitution_of_equivalents])])])])]) ).
cnf(c_0_75,plain,
( is_a_theorem(implies(X1,and(X2,X1)))
| ~ is_a_theorem(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_70]),c_0_63]) ).
cnf(c_0_76,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_77,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[principia_op_equiv]) ).
fof(c_0_78,plain,
! [X95] :
( ( ~ r1
| is_a_theorem(implies(or(X95,X95),X95)) )
& ( ~ is_a_theorem(implies(or(esk45_0,esk45_0),esk45_0))
| r1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r1])])])]) ).
cnf(c_0_79,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_31,c_0_72]) ).
cnf(c_0_80,plain,
is_a_theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_73,c_0_56]) ).
cnf(c_0_81,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_82,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[substitution_of_equivalents_0001]) ).
cnf(c_0_83,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_75]) ).
cnf(c_0_84,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77])]) ).
cnf(c_0_85,plain,
( is_a_theorem(implies(or(X1,X1),X1))
| ~ r1 ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_86,plain,
r1,
inference(split_conjunct,[status(thm)],[principia_r1]) ).
cnf(c_0_87,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_88,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82])]) ).
cnf(c_0_89,plain,
( is_a_theorem(equiv(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_90,plain,
is_a_theorem(implies(or(X1,X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_86])]) ).
cnf(c_0_91,plain,
is_a_theorem(or(X1,not(not(not(X1))))),
inference(spm,[status(thm)],[c_0_87,c_0_56]) ).
fof(c_0_92,plain,
! [X93] :
( ( ~ cn3
| is_a_theorem(implies(implies(not(X93),X93),X93)) )
& ( ~ is_a_theorem(implies(implies(not(esk44_0),esk44_0),esk44_0))
| cn3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn3])])])]) ).
fof(c_0_93,negated_conjecture,
~ cn3,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[luka_cn3])]) ).
cnf(c_0_94,plain,
( X1 = X2
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_95,plain,
is_a_theorem(implies(implies(X1,not(X1)),not(X1))),
inference(spm,[status(thm)],[c_0_90,c_0_38]) ).
cnf(c_0_96,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_91]),c_0_38]) ).
cnf(c_0_97,plain,
( cn3
| ~ is_a_theorem(implies(implies(not(esk44_0),esk44_0),esk44_0)) ),
inference(split_conjunct,[status(thm)],[c_0_92]) ).
cnf(c_0_98,negated_conjecture,
~ cn3,
inference(split_conjunct,[status(thm)],[c_0_93]) ).
cnf(c_0_99,plain,
implies(X1,not(X1)) = not(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_47])]) ).
cnf(c_0_100,plain,
not(not(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_96]),c_0_56])]) ).
cnf(c_0_101,plain,
~ is_a_theorem(implies(implies(not(esk44_0),esk44_0),esk44_0)),
inference(sr,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_102,plain,
implies(not(X1),X1) = X1,
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_103,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL498+1 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n006.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 12:54:25 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.4IxWJ8o9bB/E---3.1_15512.p
% 0.16/0.57 # Version: 3.1pre001
% 0.16/0.57 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.16/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.16/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.57 # Starting sh5l with 300s (1) cores
% 0.16/0.57 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 15590 completed with status 0
% 0.16/0.57 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.16/0.57 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.16/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.16/0.57 # No SInE strategy applied
% 0.16/0.57 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.16/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.16/0.57 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.16/0.57 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.16/0.57 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.57 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 151s (1) cores
% 0.16/0.57 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 15600 completed with status 0
% 0.16/0.57 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.16/0.57 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.16/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.16/0.57 # No SInE strategy applied
% 0.16/0.57 # Search class: FGUSF-FFMM21-MFFFFFNN
% 0.16/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.16/0.57 # Preprocessing time : 0.002 s
% 0.16/0.57 # Presaturation interreduction done
% 0.16/0.57
% 0.16/0.57 # Proof found!
% 0.16/0.57 # SZS status Theorem
% 0.16/0.57 # SZS output start CNFRefutation
% See solution above
% 0.16/0.57 # Parsed axioms : 45
% 0.16/0.57 # Removed by relevancy pruning/SinE : 0
% 0.16/0.57 # Initial clauses : 74
% 0.16/0.57 # Removed in clause preprocessing : 0
% 0.16/0.57 # Initial clauses in saturation : 74
% 0.16/0.57 # Processed clauses : 1679
% 0.16/0.57 # ...of these trivial : 59
% 0.16/0.57 # ...subsumed : 989
% 0.16/0.57 # ...remaining for further processing : 631
% 0.16/0.57 # Other redundant clauses eliminated : 0
% 0.16/0.57 # Clauses deleted for lack of memory : 0
% 0.16/0.57 # Backward-subsumed : 61
% 0.16/0.57 # Backward-rewritten : 82
% 0.16/0.57 # Generated clauses : 7227
% 0.16/0.57 # ...of the previous two non-redundant : 6308
% 0.16/0.57 # ...aggressively subsumed : 0
% 0.16/0.57 # Contextual simplify-reflections : 0
% 0.16/0.57 # Paramodulations : 7227
% 0.16/0.57 # Factorizations : 0
% 0.16/0.57 # NegExts : 0
% 0.16/0.57 # Equation resolutions : 0
% 0.16/0.57 # Total rewrite steps : 2421
% 0.16/0.57 # Propositional unsat checks : 0
% 0.16/0.57 # Propositional check models : 0
% 0.16/0.57 # Propositional check unsatisfiable : 0
% 0.16/0.57 # Propositional clauses : 0
% 0.16/0.57 # Propositional clauses after purity: 0
% 0.16/0.57 # Propositional unsat core size : 0
% 0.16/0.57 # Propositional preprocessing time : 0.000
% 0.16/0.57 # Propositional encoding time : 0.000
% 0.16/0.57 # Propositional solver time : 0.000
% 0.16/0.57 # Success case prop preproc time : 0.000
% 0.16/0.57 # Success case prop encoding time : 0.000
% 0.16/0.57 # Success case prop solver time : 0.000
% 0.16/0.57 # Current number of processed clauses : 427
% 0.16/0.57 # Positive orientable unit clauses : 133
% 0.16/0.57 # Positive unorientable unit clauses: 0
% 0.16/0.57 # Negative unit clauses : 4
% 0.16/0.57 # Non-unit-clauses : 290
% 0.16/0.57 # Current number of unprocessed clauses: 4573
% 0.16/0.57 # ...number of literals in the above : 9190
% 0.16/0.57 # Current number of archived formulas : 0
% 0.16/0.57 # Current number of archived clauses : 204
% 0.16/0.57 # Clause-clause subsumption calls (NU) : 13425
% 0.16/0.57 # Rec. Clause-clause subsumption calls : 12539
% 0.16/0.57 # Non-unit clause-clause subsumptions : 1030
% 0.16/0.57 # Unit Clause-clause subsumption calls : 2417
% 0.16/0.57 # Rewrite failures with RHS unbound : 0
% 0.16/0.57 # BW rewrite match attempts : 1333
% 0.16/0.57 # BW rewrite match successes : 55
% 0.16/0.57 # Condensation attempts : 0
% 0.16/0.57 # Condensation successes : 0
% 0.16/0.57 # Termbank termtop insertions : 83282
% 0.16/0.57
% 0.16/0.57 # -------------------------------------------------
% 0.16/0.57 # User time : 0.123 s
% 0.16/0.57 # System time : 0.007 s
% 0.16/0.57 # Total time : 0.130 s
% 0.16/0.57 # Maximum resident set size: 1956 pages
% 0.16/0.57
% 0.16/0.57 # -------------------------------------------------
% 0.16/0.57 # User time : 0.608 s
% 0.16/0.57 # System time : 0.032 s
% 0.16/0.57 # Total time : 0.640 s
% 0.16/0.57 # Maximum resident set size: 1724 pages
% 0.16/0.57 % E---3.1 exiting
% 0.16/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------