TSTP Solution File: LCL519+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL519+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:25:08 EDT 2023
% Result : Theorem 2.08s 0.72s
% Output : CNFRefutation 2.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 22
% Syntax : Number of formulae : 106 ( 47 unt; 0 def)
% Number of atoms : 194 ( 36 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 153 ( 65 ~; 65 |; 10 &)
% ( 6 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 14 ( 12 usr; 12 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 12 con; 0-2 aty)
% Number of variables : 169 ( 14 sgn; 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',op_implies_or) ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',op_implies_and) ).
fof(op_and,axiom,
( op_and
=> ! [X1,X2] : and(X1,X2) = not(or(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',op_and) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',principia_op_implies_or) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',op_or) ).
fof(rosser_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',rosser_op_implies_and) ).
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/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',modus_ponens) ).
fof(kn2,axiom,
( kn2
<=> ! [X4,X5] : is_a_theorem(implies(and(X4,X5),X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',kn2) ).
fof(principia_op_and,axiom,
op_and,
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',principia_op_and) ).
fof(rosser_op_or,axiom,
op_or,
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',rosser_op_or) ).
fof(rosser_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',rosser_modus_ponens) ).
fof(rosser_kn2,axiom,
kn2,
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',rosser_kn2) ).
fof(kn1,axiom,
( kn1
<=> ! [X4] : is_a_theorem(implies(X4,and(X4,X4))) ),
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',kn1) ).
fof(rosser_kn1,axiom,
kn1,
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',rosser_kn1) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',op_equiv) ).
fof(rosser_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',rosser_op_equiv) ).
fof(kn3,axiom,
( kn3
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X4,X5),implies(not(and(X5,X6)),not(and(X6,X4))))) ),
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',kn3) ).
fof(substitution_of_equivalents,axiom,
( substitution_of_equivalents
<=> ! [X1,X2] :
( is_a_theorem(equiv(X1,X2))
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',substitution_of_equivalents) ).
fof(rosser_kn3,axiom,
kn3,
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',rosser_kn3) ).
fof(substitution_of_equivalents_001,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',substitution_of_equivalents) ).
fof(r2,axiom,
( r2
<=> ! [X4,X5] : is_a_theorem(implies(X5,or(X4,X5))) ),
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',r2) ).
fof(principia_r2,conjecture,
r2,
file('/export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p',principia_r2) ).
fof(c_0_22,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])])]) ).
fof(c_0_23,plain,
! [X121,X122] :
( ~ op_implies_and
| implies(X121,X122) = not(and(X121,not(X122))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])]) ).
fof(c_0_24,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])])]) ).
cnf(c_0_25,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
fof(c_0_27,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_28,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[rosser_op_implies_and]) ).
fof(c_0_30,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_31,plain,
! [X73,X74] :
( ( ~ kn2
| is_a_theorem(implies(and(X73,X74),X73)) )
& ( ~ is_a_theorem(implies(and(esk34_0,esk35_0),esk34_0))
| kn2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn2])])])]) ).
cnf(c_0_32,plain,
( and(X1,X2) = not(or(not(X1),not(X2)))
| ~ op_and ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_34,plain,
op_and,
inference(split_conjunct,[status(thm)],[principia_op_and]) ).
cnf(c_0_35,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_37,plain,
op_or,
inference(split_conjunct,[status(thm)],[rosser_op_or]) ).
cnf(c_0_38,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[rosser_modus_ponens]) ).
cnf(c_0_40,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_41,plain,
kn2,
inference(split_conjunct,[status(thm)],[rosser_kn2]) ).
cnf(c_0_42,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_43,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
fof(c_0_44,plain,
! [X71] :
( ( ~ kn1
| is_a_theorem(implies(X71,and(X71,X71))) )
& ( ~ is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0)))
| kn1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn1])])])]) ).
cnf(c_0_45,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_38,c_0_39])]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_47,plain,
not(or(X1,not(X2))) = and(not(X1),X2),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_49,plain,
kn1,
inference(split_conjunct,[status(thm)],[rosser_kn1]) ).
cnf(c_0_50,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(and(X1,X2)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
and(not(not(X1)),X2) = and(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_33]),c_0_42]) ).
cnf(c_0_52,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_53,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(and(X1,X2)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,plain,
( is_a_theorem(and(X1,X1))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_52]) ).
fof(c_0_55,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_56,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_58,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[rosser_op_equiv]) ).
cnf(c_0_59,plain,
or(and(X1,X2),X3) = implies(implies(X1,not(X2)),X3),
inference(spm,[status(thm)],[c_0_33,c_0_42]) ).
fof(c_0_60,plain,
! [X77,X78,X79] :
( ( ~ kn3
| is_a_theorem(implies(implies(X77,X78),implies(not(and(X78,X79)),not(and(X79,X77))))) )
& ( ~ is_a_theorem(implies(implies(esk36_0,esk37_0),implies(not(and(esk37_0,esk38_0)),not(and(esk38_0,esk36_0)))))
| kn3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn3])])])]) ).
fof(c_0_61,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_62,plain,
( is_a_theorem(not(implies(X1,X2)))
| ~ is_a_theorem(and(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_56,c_0_36]) ).
cnf(c_0_63,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]) ).
cnf(c_0_64,plain,
and(X1,implies(X2,not(X3))) = not(implies(X1,and(X2,X3))),
inference(spm,[status(thm)],[c_0_42,c_0_42]) ).
cnf(c_0_65,plain,
implies(implies(X1,not(not(X2))),X3) = implies(implies(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_36]),c_0_59]) ).
cnf(c_0_66,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))
| ~ kn3 ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_67,plain,
kn3,
inference(split_conjunct,[status(thm)],[rosser_kn3]) ).
cnf(c_0_68,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_69,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[substitution_of_equivalents]) ).
cnf(c_0_70,plain,
( is_a_theorem(not(implies(X1,and(X2,not(X3)))))
| ~ is_a_theorem(and(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_62,c_0_36]) ).
cnf(c_0_71,plain,
not(implies(or(X1,X2),and(X2,X1))) = equiv(not(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_43]),c_0_64]) ).
cnf(c_0_72,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,not(not(X3))))
| ~ is_a_theorem(implies(implies(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_45,c_0_65]) ).
cnf(c_0_73,plain,
is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_43]),c_0_67])]) ).
cnf(c_0_74,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]) ).
cnf(c_0_75,plain,
( is_a_theorem(equiv(not(not(X1)),X2))
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_33]),c_0_63]) ).
cnf(c_0_76,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(and(X2,X3),X2),X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_46]),c_0_51]) ).
cnf(c_0_77,plain,
( is_a_theorem(implies(implies(X1,not(X2)),not(and(X2,X3))))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_73]),c_0_59]) ).
cnf(c_0_78,plain,
( not(not(X1)) = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_79,plain,
( is_a_theorem(equiv(X1,X1))
| ~ is_a_theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_54,c_0_63]) ).
cnf(c_0_80,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(implies(X2,and(not(X1),X3))) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,plain,
( not(not(X1)) = X1
| ~ is_a_theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_82,plain,
is_a_theorem(implies(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_52]),c_0_36]) ).
cnf(c_0_83,plain,
not(not(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82])]) ).
cnf(c_0_84,plain,
not(and(X1,X2)) = implies(X1,not(X2)),
inference(spm,[status(thm)],[c_0_36,c_0_83]) ).
cnf(c_0_85,plain,
( is_a_theorem(implies(X1,not(X2)))
| ~ is_a_theorem(implies(X2,and(not(X1),X3))) ),
inference(rw,[status(thm)],[c_0_80,c_0_84]) ).
cnf(c_0_86,plain,
( is_a_theorem(or(X1,not(X2)))
| ~ is_a_theorem(implies(X2,and(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_83]),c_0_43]) ).
cnf(c_0_87,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X2),X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_82]),c_0_43]),c_0_33]) ).
cnf(c_0_88,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,and(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_43]),c_0_83]) ).
cnf(c_0_89,plain,
and(X1,not(X2)) = not(implies(X1,X2)),
inference(spm,[status(thm)],[c_0_42,c_0_83]) ).
cnf(c_0_90,plain,
( is_a_theorem(implies(X1,not(X2)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_77]),c_0_84]) ).
cnf(c_0_91,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,not(implies(X1,X3)))) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_92,plain,
( is_a_theorem(or(X1,not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_83]),c_0_43]) ).
cnf(c_0_93,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(implies(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_94,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(or(X2,not(X2)),X1)) ),
inference(spm,[status(thm)],[c_0_87,c_0_43]) ).
cnf(c_0_95,plain,
is_a_theorem(implies(or(X1,X2),implies(implies(X2,not(X3)),implies(X3,X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_43]),c_0_36]),c_0_59]) ).
fof(c_0_96,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_97,negated_conjecture,
~ r2,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[principia_r2])]) ).
cnf(c_0_98,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(or(X1,X3),X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_43]),c_0_33]) ).
cnf(c_0_99,plain,
is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_43]) ).
cnf(c_0_100,plain,
( r2
| ~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0))) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_101,negated_conjecture,
~ r2,
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_102,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_103,plain,
~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0))),
inference(sr,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_104,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(spm,[status(thm)],[c_0_102,c_0_43]) ).
cnf(c_0_105,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL519+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 12:33:40 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.zRZgoJLeM8/E---3.1_20699.p
% 2.08/0.72 # Version: 3.1pre001
% 2.08/0.72 # Preprocessing class: FSMSSLSSSSSNFFN.
% 2.08/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 2.08/0.72 # Starting new_bool_3 with 300s (1) cores
% 2.08/0.72 # Starting new_bool_1 with 300s (1) cores
% 2.08/0.72 # Starting sh5l with 300s (1) cores
% 2.08/0.72 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 20804 completed with status 0
% 2.08/0.72 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 2.08/0.72 # Preprocessing class: FSMSSLSSSSSNFFN.
% 2.08/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 2.08/0.72 # No SInE strategy applied
% 2.08/0.72 # Search class: FGUSF-FFMM21-MFFFFFNN
% 2.08/0.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.08/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 2.08/0.72 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 2.08/0.72 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 2.08/0.72 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.08/0.72 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 151s (1) cores
% 2.08/0.72 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 20816 completed with status 0
% 2.08/0.72 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 2.08/0.72 # Preprocessing class: FSMSSLSSSSSNFFN.
% 2.08/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 2.08/0.72 # No SInE strategy applied
% 2.08/0.72 # Search class: FGUSF-FFMM21-MFFFFFNN
% 2.08/0.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.08/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 2.08/0.72 # Preprocessing time : 0.003 s
% 2.08/0.72 # Presaturation interreduction done
% 2.08/0.72
% 2.08/0.72 # Proof found!
% 2.08/0.72 # SZS status Theorem
% 2.08/0.72 # SZS output start CNFRefutation
% See solution above
% 2.08/0.72 # Parsed axioms : 43
% 2.08/0.72 # Removed by relevancy pruning/SinE : 0
% 2.08/0.72 # Initial clauses : 72
% 2.08/0.72 # Removed in clause preprocessing : 0
% 2.08/0.72 # Initial clauses in saturation : 72
% 2.08/0.72 # Processed clauses : 2779
% 2.08/0.72 # ...of these trivial : 158
% 2.08/0.72 # ...subsumed : 1892
% 2.08/0.72 # ...remaining for further processing : 729
% 2.08/0.72 # Other redundant clauses eliminated : 0
% 2.08/0.72 # Clauses deleted for lack of memory : 0
% 2.08/0.72 # Backward-subsumed : 57
% 2.08/0.72 # Backward-rewritten : 138
% 2.08/0.72 # Generated clauses : 9122
% 2.08/0.72 # ...of the previous two non-redundant : 7781
% 2.08/0.72 # ...aggressively subsumed : 0
% 2.08/0.72 # Contextual simplify-reflections : 1
% 2.08/0.72 # Paramodulations : 9122
% 2.08/0.72 # Factorizations : 0
% 2.08/0.72 # NegExts : 0
% 2.08/0.72 # Equation resolutions : 0
% 2.08/0.72 # Total rewrite steps : 6168
% 2.08/0.72 # Propositional unsat checks : 0
% 2.08/0.72 # Propositional check models : 0
% 2.08/0.72 # Propositional check unsatisfiable : 0
% 2.08/0.72 # Propositional clauses : 0
% 2.08/0.72 # Propositional clauses after purity: 0
% 2.08/0.72 # Propositional unsat core size : 0
% 2.08/0.72 # Propositional preprocessing time : 0.000
% 2.08/0.72 # Propositional encoding time : 0.000
% 2.08/0.72 # Propositional solver time : 0.000
% 2.08/0.72 # Success case prop preproc time : 0.000
% 2.08/0.72 # Success case prop encoding time : 0.000
% 2.08/0.72 # Success case prop solver time : 0.000
% 2.08/0.72 # Current number of processed clauses : 473
% 2.08/0.72 # Positive orientable unit clauses : 115
% 2.08/0.72 # Positive unorientable unit clauses: 0
% 2.08/0.72 # Negative unit clauses : 12
% 2.08/0.72 # Non-unit-clauses : 346
% 2.08/0.72 # Current number of unprocessed clauses: 4573
% 2.08/0.72 # ...number of literals in the above : 9590
% 2.08/0.72 # Current number of archived formulas : 0
% 2.08/0.72 # Current number of archived clauses : 256
% 2.08/0.72 # Clause-clause subsumption calls (NU) : 18178
% 2.08/0.72 # Rec. Clause-clause subsumption calls : 17952
% 2.08/0.72 # Non-unit clause-clause subsumptions : 1918
% 2.08/0.72 # Unit Clause-clause subsumption calls : 2972
% 2.08/0.72 # Rewrite failures with RHS unbound : 0
% 2.08/0.72 # BW rewrite match attempts : 685
% 2.08/0.72 # BW rewrite match successes : 57
% 2.08/0.72 # Condensation attempts : 0
% 2.08/0.72 # Condensation successes : 0
% 2.08/0.72 # Termbank termtop insertions : 121245
% 2.08/0.72
% 2.08/0.72 # -------------------------------------------------
% 2.08/0.72 # User time : 0.202 s
% 2.08/0.72 # System time : 0.005 s
% 2.08/0.72 # Total time : 0.207 s
% 2.08/0.72 # Maximum resident set size: 1976 pages
% 2.08/0.72
% 2.08/0.72 # -------------------------------------------------
% 2.08/0.72 # User time : 1.006 s
% 2.08/0.72 # System time : 0.059 s
% 2.08/0.72 # Total time : 1.065 s
% 2.08/0.72 # Maximum resident set size: 1724 pages
% 2.08/0.72 % E---3.1 exiting
%------------------------------------------------------------------------------