%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL470+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:12:51 PM UTC 2026
% Result : Theorem 101.65s 26.06s
% Output : CNFRefutation 101.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 18
% Syntax : Number of formulae : 122 ( 49 unt; 0 def)
% Number of atoms : 240 ( 29 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 217 ( 99 ~; 97 |; 10 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 12 con; 0-2 aty)
% Number of variables : 227 ( 34 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X1,X2] :
( ( is_a_theorem(implies(X1,X2))
& is_a_theorem(X1) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(cn1,axiom,
( cn1
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',cn1) ).
fof(luka_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax',luka_modus_ponens) ).
fof(luka_cn1,axiom,
cn1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax',luka_cn1) ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(cn3,axiom,
( cn3
<=> ! [X4] : is_a_theorem(implies(implies(not(X4),X4),X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',cn3) ).
fof(luka_op_or,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax',luka_op_or) ).
fof(luka_cn3,axiom,
cn3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax',luka_cn3) ).
fof(cn2,axiom,
( cn2
<=> ! [X4,X5] : is_a_theorem(implies(X4,implies(not(X4),X5))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',cn2) ).
fof(luka_cn2,axiom,
cn2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax',luka_cn2) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
fof(luka_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax',luka_op_equiv) ).
fof(substitution_of_equivalents,axiom,
( substitution_of_equivalents
<=> ! [X1,X2] :
( is_a_theorem(equiv(X1,X2))
=> X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',substitution_of_equivalents) ).
fof(use_substitution_of_equivalents,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax',use_substitution_of_equivalents) ).
fof(hilbert_or_2,conjecture,
or_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_or_2) ).
fof(or_2,axiom,
( or_2
<=> ! [X1,X2] : is_a_theorem(implies(X2,or(X1,X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',or_2) ).
fof(c_0_18,plain,
! [X7,X8] :
( ( modus_ponens
| ~ is_a_theorem(esk2_0) )
& ( modus_ponens
| is_a_theorem(implies(esk1_0,esk2_0)) )
& ( modus_ponens
| is_a_theorem(esk1_0) )
& ( is_a_theorem(X8)
| ~ is_a_theorem(implies(X7,X8))
| ~ is_a_theorem(X7)
| ~ modus_ponens ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_19,plain,
! [X83,X84,X85] :
( ( cn1
| ~ is_a_theorem(implies(implies(esk39_0,esk40_0),implies(implies(esk40_0,esk41_0),implies(esk39_0,esk41_0)))) )
& ( is_a_theorem(implies(implies(X83,X84),implies(implies(X84,X85),implies(X83,X85))))
| ~ cn1 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn1])])])])]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1)
| ~ modus_ponens
| is_a_theorem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[luka_modus_ponens]) ).
cnf(c_0_22,plain,
( ~ cn1
| is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
cn1,
inference(split_conjunct,[status(thm)],[luka_cn1]) ).
fof(c_0_24,plain,
! [X121,X122] :
( implies(X121,X122) = not(and(X121,not(X122)))
| ~ op_implies_and ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])])]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
fof(c_0_27,plain,
! [X117,X118] :
( or(X117,X118) = not(and(not(X117),not(X118)))
| ~ op_or ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])])]) ).
cnf(c_0_28,plain,
( ~ op_implies_and
| implies(X1,X2) = not(and(X1,not(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
fof(c_0_30,plain,
! [X93] :
( ( cn3
| ~ is_a_theorem(implies(implies(not(esk44_0),esk44_0),esk44_0)) )
& ( is_a_theorem(implies(implies(not(X93),X93),X93))
| ~ cn3 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn3])])])])]) ).
cnf(c_0_31,plain,
( ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
( ~ op_or
| or(X1,X2) = not(and(not(X1),not(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,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_34,plain,
op_or,
inference(split_conjunct,[status(thm)],[luka_op_or]) ).
cnf(c_0_35,plain,
( ~ cn3
| is_a_theorem(implies(implies(not(X1),X1),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
cn3,
inference(split_conjunct,[status(thm)],[luka_cn3]) ).
fof(c_0_37,plain,
! [X89,X90] :
( ( cn2
| ~ is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0))) )
& ( is_a_theorem(implies(X89,implies(not(X89),X90)))
| ~ cn2 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn2])])])])]) ).
cnf(c_0_38,plain,
( ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_31]) ).
cnf(c_0_39,plain,
implies(not(X1),X2) = or(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_40,plain,
is_a_theorem(implies(implies(not(X1),X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_41,plain,
( ~ cn2
| is_a_theorem(implies(X1,implies(not(X1),X2))) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
cn2,
inference(split_conjunct,[status(thm)],[luka_cn2]) ).
cnf(c_0_43,plain,
( ~ is_a_theorem(or(X3,X2))
| ~ is_a_theorem(implies(X1,not(X3)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(or(X1,X1),X1)),
inference(spm,[status(thm)],[c_0_40,c_0_39]) ).
cnf(c_0_45,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]) ).
cnf(c_0_46,plain,
( ~ is_a_theorem(or(X3,X2))
| ~ is_a_theorem(or(X1,not(X3)))
| is_a_theorem(or(X1,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_39]),c_0_39]) ).
cnf(c_0_47,plain,
or(and(X1,not(X2)),X3) = implies(implies(X1,X2),X3),
inference(spm,[status(thm)],[c_0_39,c_0_33]) ).
cnf(c_0_48,plain,
( ~ is_a_theorem(implies(X1,or(X2,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_44]) ).
cnf(c_0_49,plain,
( ~ is_a_theorem(or(X3,X1))
| is_a_theorem(implies(implies(X1,X2),or(X3,X2))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_39]),c_0_39]) ).
cnf(c_0_50,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_45]) ).
cnf(c_0_51,plain,
( ~ is_a_theorem(implies(implies(X3,X4),X2))
| ~ is_a_theorem(or(X1,implies(X3,X4)))
| is_a_theorem(or(X1,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_33]),c_0_47]) ).
cnf(c_0_52,plain,
( ~ is_a_theorem(or(X2,X1))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(or(X1,X2)) ),
inference(rw,[status(thm)],[c_0_50,c_0_39]) ).
cnf(c_0_54,plain,
( ~ is_a_theorem(implies(or(X3,X4),X2))
| ~ is_a_theorem(or(X1,or(X3,X4)))
| is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_51,c_0_39]) ).
cnf(c_0_55,plain,
is_a_theorem(or(X1,or(not(X1),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_39]),c_0_39]) ).
cnf(c_0_56,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
( ~ is_a_theorem(implies(or(not(X1),X3),X2))
| is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_56,c_0_39]) ).
cnf(c_0_59,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_60,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_52,c_0_59]) ).
cnf(c_0_61,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,or(X2,X2)),X2)) ),
inference(spm,[status(thm)],[c_0_48,c_0_60]) ).
cnf(c_0_62,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(spm,[status(thm)],[c_0_45,c_0_39]) ).
fof(c_0_63,plain,
! [X125,X126] :
( equiv(X125,X126) = and(implies(X125,X126),implies(X126,X125))
| ~ op_equiv ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])])]) ).
cnf(c_0_64,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,or(X1,X1)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_61]) ).
cnf(c_0_65,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_38,c_0_62]) ).
cnf(c_0_66,plain,
( ~ op_equiv
| equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_67,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[luka_op_equiv]) ).
cnf(c_0_68,plain,
( ~ is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_64,c_0_49]) ).
cnf(c_0_69,plain,
( ~ is_a_theorem(or(X1,X2))
| is_a_theorem(or(X1,or(X2,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_39]),c_0_39]) ).
cnf(c_0_70,plain,
not(and(X1,implies(X2,X3))) = implies(X1,and(X2,not(X3))),
inference(spm,[status(thm)],[c_0_33,c_0_33]) ).
cnf(c_0_71,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67])]) ).
fof(c_0_72,plain,
! [X11,X12] :
( ( substitution_of_equivalents
| esk3_0 != esk4_0 )
& ( substitution_of_equivalents
| is_a_theorem(equiv(esk3_0,esk4_0)) )
& ( X11 = X12
| ~ is_a_theorem(equiv(X11,X12))
| ~ substitution_of_equivalents ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_73,plain,
( ~ is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(or(X2,X3),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_74,plain,
( ~ is_a_theorem(not(X1))
| is_a_theorem(implies(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_60,c_0_39]) ).
cnf(c_0_75,plain,
implies(implies(X1,X2),and(X2,not(X1))) = not(equiv(X1,X2)),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_76,plain,
implies(X1,and(not(X2),not(X3))) = not(and(X1,or(X2,X3))),
inference(spm,[status(thm)],[c_0_70,c_0_39]) ).
cnf(c_0_77,plain,
( ~ is_a_theorem(equiv(X1,X2))
| ~ substitution_of_equivalents
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_78,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[use_substitution_of_equivalents]) ).
cnf(c_0_79,plain,
( ~ is_a_theorem(not(X2))
| ~ is_a_theorem(or(X1,X2))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_80,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(or(equiv(X1,X2),and(X2,not(X1)))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_75]),c_0_39]) ).
cnf(c_0_81,plain,
is_a_theorem(implies(X1,not(and(not(X1),or(X2,X3))))),
inference(spm,[status(thm)],[c_0_45,c_0_76]) ).
cnf(c_0_82,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_60]) ).
cnf(c_0_83,plain,
is_a_theorem(implies(or(X1,X2),implies(implies(X2,X3),or(X1,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_39]),c_0_39]) ).
cnf(c_0_84,plain,
( ~ is_a_theorem(equiv(X1,X2))
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78])]) ).
cnf(c_0_85,plain,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(equiv(X1,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_33]) ).
cnf(c_0_86,plain,
( ~ is_a_theorem(or(and(not(X1),or(X3,X4)),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_81]) ).
cnf(c_0_87,plain,
( ~ is_a_theorem(implies(X4,X2))
| ~ is_a_theorem(implies(X1,X4))
| is_a_theorem(implies(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_38,c_0_65]) ).
cnf(c_0_88,plain,
( ~ is_a_theorem(implies(X2,X3))
| is_a_theorem(implies(or(X1,X2),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_89,plain,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_90,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_86,c_0_59]) ).
cnf(c_0_91,plain,
( ~ is_a_theorem(implies(or(X1,X4),X2))
| is_a_theorem(implies(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_87,c_0_62]) ).
cnf(c_0_92,plain,
is_a_theorem(implies(or(or(X1,X1),or(X1,X1)),X1)),
inference(spm,[status(thm)],[c_0_48,c_0_44]) ).
cnf(c_0_93,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_65]) ).
cnf(c_0_94,plain,
( ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(implies(or(X1,X2),X1)) ),
inference(spm,[status(thm)],[c_0_48,c_0_88]) ).
cnf(c_0_95,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_96,plain,
is_a_theorem(implies(or(X1,X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_97,plain,
or(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_44]),c_0_62])]) ).
cnf(c_0_98,plain,
( ~ is_a_theorem(implies(X1,X4))
| ~ is_a_theorem(implies(X4,X2))
| is_a_theorem(or(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_93,c_0_31]) ).
cnf(c_0_99,plain,
( ~ is_a_theorem(implies(X2,X1))
| or(X1,X2) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_94]),c_0_62])]) ).
cnf(c_0_100,plain,
( ~ is_a_theorem(X1)
| or(X1,X2) = X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97]),c_0_97]) ).
cnf(c_0_101,plain,
( ~ is_a_theorem(implies(X1,or(X2,X2)))
| is_a_theorem(or(implies(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_98,c_0_44]) ).
fof(c_0_102,negated_conjecture,
~ or_2,
inference(assume_negation,[status(cth)],[hilbert_or_2]) ).
cnf(c_0_103,plain,
( ~ is_a_theorem(implies(X2,X4))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_38,c_0_31]) ).
cnf(c_0_104,plain,
( ~ is_a_theorem(or(X2,X1))
| or(X1,not(X2)) = X1 ),
inference(spm,[status(thm)],[c_0_99,c_0_39]) ).
cnf(c_0_105,plain,
or(implies(X1,X1),X2) = implies(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_44]),c_0_97]),c_0_97]) ).
cnf(c_0_106,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_48,c_0_62]) ).
cnf(c_0_107,plain,
( ~ is_a_theorem(or(X2,X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_48,c_0_90]) ).
cnf(c_0_108,plain,
is_a_theorem(or(implies(X1,X1),X2)),
inference(spm,[status(thm)],[c_0_101,c_0_62]) ).
fof(c_0_109,negated_conjecture,
~ or_2,
inference(fof_simplification,[status(thm)],[c_0_102]) ).
cnf(c_0_110,plain,
( ~ is_a_theorem(implies(X3,implies(X2,X4)))
| is_a_theorem(implies(or(X1,X2),implies(X3,or(X1,X4)))) ),
inference(spm,[status(thm)],[c_0_103,c_0_83]) ).
cnf(c_0_111,plain,
or(X1,not(implies(X2,X2))) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_106])]) ).
cnf(c_0_112,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
fof(c_0_113,plain,
! [X49,X50] :
( ( or_2
| ~ is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0))) )
& ( is_a_theorem(implies(X50,or(X49,X50)))
| ~ or_2 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[or_2])])])])]) ).
fof(c_0_114,negated_conjecture,
~ or_2,
inference(fof_nnf,[status(thm)],[c_0_109]) ).
cnf(c_0_115,plain,
is_a_theorem(implies(X1,implies(X2,or(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_39]),c_0_105]),c_0_112])]) ).
cnf(c_0_116,plain,
( ~ is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0)))
| or_2 ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_117,negated_conjecture,
~ or_2,
inference(split_conjunct,[status(thm)],[c_0_114]) ).
cnf(c_0_118,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_115,c_0_111]) ).
cnf(c_0_119,plain,
~ is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0))),
inference(sr,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_120,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(spm,[status(thm)],[c_0_118,c_0_39]) ).
cnf(c_0_121,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_120])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL470+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/5.37 % Computer : n011.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Mon Sep 21 00:35:16 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.41 Running first-order theorem proving
% 0.14/5.42 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/benchmark/theBenchmark.p
% 101.65/26.06 % Version: 3.5.1
% 101.65/26.06 % Preprocessing class: FSMSSLSSSSSNFFN.
% 101.65/26.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 101.65/26.06 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 101.65/26.06 % Starting new_bool_3 with 300s (1) cores
% 101.65/26.06 % Starting new_bool_1 with 300s (1) cores
% 101.65/26.06 % Starting sh5l with 300s (1) cores
% 101.65/26.06 % new_bool_3 with pid 583127 completed with status 9
% 101.65/26.06 % new_bool_1 with pid 583128 completed with status 9
% 101.65/26.06 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 583126 completed with status 0
% 101.65/26.06 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 101.65/26.06 % Preprocessing class: FSMSSLSSSSSNFFN.
% 101.65/26.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 101.65/26.06 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 101.65/26.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 101.65/26.06 % No SInE strategy applied
% 101.65/26.06 % Search class: FGUSF-FFMM21-MFFFFFNN
% 101.65/26.06 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 101.65/26.06 % Starting SubtermCWHack with 151s (1) cores
% 101.65/26.06 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 101.65/26.06 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 101.65/26.06 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 101.65/26.06 % Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 101.65/26.06 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 583137 completed with status 0
% 101.65/26.06 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 101.65/26.06 % Preprocessing class: FSMSSLSSSSSNFFN.
% 101.65/26.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 101.65/26.06 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 101.65/26.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 101.65/26.06 % No SInE strategy applied
% 101.65/26.06 % Search class: FGUSF-FFMM21-MFFFFFNN
% 101.65/26.06 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 101.65/26.06 % Starting SubtermCWHack with 151s (1) cores
% 101.65/26.06 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 101.65/26.06 % Preprocessing time : 0.002 s
% 101.65/26.06 % Presaturation interreduction done
% 101.65/26.06
% 101.65/26.06 % Proof found!
% 101.65/26.06 % SZS status Theorem
% 101.65/26.06 % SZS output start CNFRefutation
% See solution above
% 101.65/26.07 % Parsed axioms : 43
% 101.65/26.07 % Removed by relevancy pruning/SinE : 0
% 101.65/26.07 % Initial clauses : 72
% 101.65/26.07 % Removed in clause preprocessing : 0
% 101.65/26.07 % Initial clauses in saturation : 72
% 101.65/26.07 % Processed clauses : 48368
% 101.65/26.07 % ...of these trivial : 1244
% 101.65/26.07 % ...subsumed : 41556
% 101.65/26.07 % ...remaining for further processing : 5568
% 101.65/26.07 % Other redundant clauses eliminated : 0
% 101.65/26.07 % Clauses deleted for lack of memory : 0
% 101.65/26.07 % Backward-subsumed : 470
% 101.65/26.07 % Backward-rewritten : 382
% 101.65/26.07 % Generated clauses : 808165
% 101.65/26.07 % ...of the previous two non-redundant : 704230
% 101.65/26.07 % ...aggressively subsumed : 0
% 101.65/26.07 % Contextual simplify-reflections : 8
% 101.65/26.07 % Paramodulations : 808165
% 101.65/26.07 % Factorizations : 0
% 101.65/26.07 % NegExts : 0
% 101.65/26.07 % Equation resolutions : 0
% 101.65/26.07 % Disequality decompositions : 0
% 101.65/26.07 % Total rewrite steps : 526960
% 101.65/26.07 % ...of those cached : 505305
% 101.65/26.07 % Propositional unsat checks : 1
% 101.65/26.07 % Propositional check models : 0
% 101.65/26.07 % Propositional check unsatisfiable : 0
% 101.65/26.07 % Propositional clauses : 0
% 101.65/26.07 % Propositional clauses after purity: 0
% 101.65/26.07 % Propositional unsat core size : 0
% 101.65/26.07 % Propositional preprocessing time : 0.000
% 101.65/26.07 % Propositional encoding time : 1.222
% 101.65/26.07 % Propositional solver time : 0.736
% 101.65/26.07 % Success case prop preproc time : 0.000
% 101.65/26.07 % Success case prop encoding time : 0.000
% 101.65/26.07 % Success case prop solver time : 0.000
% 101.65/26.07 % Current number of processed clauses : 4656
% 101.65/26.07 % Positive orientable unit clauses : 451
% 101.65/26.07 % Positive unorientable unit clauses: 2
% 101.65/26.07 % Negative unit clauses : 17
% 101.65/26.07 % Non-unit-clauses : 4186
% 101.65/26.07 % Current number of unprocessed clauses: 649786
% 101.65/26.07 % ...number of literals in the above : 1480645
% 101.65/26.07 % Current number of archived formulas : 0
% 101.65/26.07 % Current number of archived clauses : 912
% 101.65/26.07 % Clause-clause subsumption calls (NU) : 1180831
% 101.65/26.07 % Rec. Clause-clause subsumption calls : 1095745
% 101.65/26.07 % Non-unit clause-clause subsumptions : 39623
% 101.65/26.07 % Unit Clause-clause subsumption calls : 26870
% 101.65/26.07 % Rewrite failures with RHS unbound : 0
% 101.65/26.07 % BW rewrite match attempts : 31607
% 101.65/26.07 % BW rewrite match successes : 197
% 101.65/26.07 % Condensation attempts : 0
% 101.65/26.07 % Condensation successes : 0
% 101.65/26.07 % Termbank termtop insertions : 17285021
% 101.65/26.07 % Search garbage collected termcells : 1092
% 101.65/26.07
% 101.65/26.07 % -------------------------------------------------
% 101.65/26.07 % User time : 19.522 s
% 101.65/26.07 % System time : 0.781 s
% 101.65/26.07 % Total time : 20.303 s
% 101.65/26.07 % Maximum resident set size: 3944 pages
% 101.65/26.07
% 101.65/26.07 % -------------------------------------------------
% 101.65/26.07 % User time : 97.908 s
% 101.65/26.07 % System time : 3.571 s
% 101.65/26.07 % Total time : 101.479 s
% 101.65/26.07 % Maximum resident set size: 4864 pages
% 101.65/26.07 % E exiting
%------------------------------------------------------------------------------