%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL518+1 : TPTP v9.2.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n029.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:40:32 PM UTC 2026
% Result : Theorem 18.42s 11.39s
% Output : CNFRefutation 18.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 23
% Syntax : Number of formulae : 105 ( 49 unt; 0 def)
% Number of atoms : 192 ( 35 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 151 ( 64 ~; 62 |; 11 &)
% ( 7 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 15 ( 13 usr; 13 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 12 con; 0-2 aty)
% Number of variables : 146 ( 8 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
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_and,axiom,
( op_and
=> ! [X1,X2] : and(X1,X2) = not(or(not(X1),not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_and) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.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/sandbox/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(rosser_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',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/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(kn2,axiom,
( kn2
<=> ! [X4,X5] : is_a_theorem(implies(and(X4,X5),X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn2) ).
fof(principia_op_and,axiom,
op_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_and) ).
fof(rosser_op_or,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_op_or) ).
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/sandbox/benchmark/Axioms/LCL006+0.ax',kn3) ).
fof(rosser_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_modus_ponens) ).
fof(rosser_kn2,axiom,
kn2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn2) ).
fof(kn1,axiom,
( kn1
<=> ! [X4] : is_a_theorem(implies(X4,and(X4,X4))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn1) ).
fof(rosser_kn3,axiom,
kn3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn3) ).
fof(rosser_kn1,axiom,
kn1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn1) ).
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(rosser_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_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+5.ax',use_substitution_of_equivalents) ).
fof(r1,axiom,
( r1
<=> ! [X4] : is_a_theorem(implies(or(X4,X4),X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r1) ).
fof(principia_r1,conjecture,
r1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r1) ).
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(c_0_23,plain,
! [X188,X189] :
( ~ op_implies_or
| implies(X188,X189) = or(not(X188),X189) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_or])])]) ).
fof(c_0_24,plain,
! [X186,X187] :
( ~ op_implies_and
| implies(X186,X187) = not(and(X186,not(X187))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])]) ).
fof(c_0_25,plain,
! [X184,X185] :
( ~ op_and
| and(X184,X185) = not(or(not(X184),not(X185))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_and])])]) ).
cnf(c_0_26,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
fof(c_0_28,plain,
! [X182,X183] :
( ~ op_or
| or(X182,X183) = not(and(not(X182),not(X183))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])]) ).
cnf(c_0_29,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[rosser_op_implies_and]) ).
fof(c_0_31,plain,
! [X72,X73] :
( ( ~ modus_ponens
| ~ is_a_theorem(X72)
| ~ is_a_theorem(implies(X72,X73))
| is_a_theorem(X73) )
& ( 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_32,plain,
! [X138,X139] :
( ( ~ kn2
| is_a_theorem(implies(and(X138,X139),X138)) )
& ( ~ 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_33,plain,
( and(X1,X2) = not(or(not(X1),not(X2)))
| ~ op_and ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_35,plain,
op_and,
inference(split_conjunct,[status(thm)],[principia_op_and]) ).
cnf(c_0_36,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_38,plain,
op_or,
inference(split_conjunct,[status(thm)],[rosser_op_or]) ).
fof(c_0_39,plain,
! [X142,X143,X144] :
( ( ~ kn3
| is_a_theorem(implies(implies(X142,X143),implies(not(and(X143,X144)),not(and(X144,X142))))) )
& ( ~ 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])])])]) ).
cnf(c_0_40,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_41,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[rosser_modus_ponens]) ).
cnf(c_0_42,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_43,plain,
kn2,
inference(split_conjunct,[status(thm)],[rosser_kn2]) ).
cnf(c_0_44,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_45,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
fof(c_0_46,plain,
! [X136] :
( ( ~ kn1
| is_a_theorem(implies(X136,and(X136,X136))) )
& ( ~ 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_47,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_39]) ).
cnf(c_0_48,plain,
kn3,
inference(split_conjunct,[status(thm)],[rosser_kn3]) ).
cnf(c_0_49,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_40,c_0_41])]) ).
cnf(c_0_50,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_51,plain,
not(or(X1,not(X2))) = and(not(X1),X2),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,plain,
kn1,
inference(split_conjunct,[status(thm)],[rosser_kn1]) ).
cnf(c_0_54,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_47,c_0_45]),c_0_48])]) ).
cnf(c_0_55,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(and(X1,X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,plain,
and(not(not(X1)),X2) = and(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_34]),c_0_44]) ).
cnf(c_0_57,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]) ).
fof(c_0_58,plain,
! [X190,X191] :
( ~ op_equiv
| equiv(X190,X191) = and(implies(X190,X191),implies(X191,X190)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])]) ).
cnf(c_0_59,plain,
( is_a_theorem(or(and(X1,X2),not(and(X2,X3))))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_49,c_0_54]) ).
cnf(c_0_60,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(and(X1,X2)) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,plain,
( is_a_theorem(and(X1,X1))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_57]) ).
cnf(c_0_62,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_63,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[rosser_op_equiv]) ).
cnf(c_0_64,plain,
( is_a_theorem(or(and(X1,X2),implies(X2,X3)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_37]),c_0_45]) ).
cnf(c_0_65,plain,
or(and(X1,not(X2)),X3) = implies(implies(X1,X2),X3),
inference(spm,[status(thm)],[c_0_45,c_0_37]) ).
cnf(c_0_66,plain,
is_a_theorem(implies(and(X1,X2),not(not(X1)))),
inference(spm,[status(thm)],[c_0_50,c_0_56]) ).
fof(c_0_67,plain,
! [X76,X77] :
( ( ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X76,X77))
| X76 = X77 )
& ( 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_68,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_69,plain,
not(and(X1,implies(X2,X3))) = implies(X1,and(X2,not(X3))),
inference(spm,[status(thm)],[c_0_37,c_0_37]) ).
cnf(c_0_70,plain,
not(implies(X1,and(X2,X3))) = and(X1,implies(X2,not(X3))),
inference(spm,[status(thm)],[c_0_44,c_0_44]) ).
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_62,c_0_63])]) ).
cnf(c_0_72,plain,
( is_a_theorem(implies(implies(X1,X2),or(X2,X3)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_45]),c_0_65]) ).
cnf(c_0_73,plain,
is_a_theorem(implies(and(X1,X2),not(not(not(not(X1)))))),
inference(spm,[status(thm)],[c_0_66,c_0_56]) ).
cnf(c_0_74,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_75,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[use_substitution_of_equivalents]) ).
cnf(c_0_76,plain,
( is_a_theorem(and(X1,implies(X2,not(not(X3)))))
| ~ is_a_theorem(and(X1,implies(X2,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]) ).
cnf(c_0_77,plain,
and(or(X1,X2),implies(X2,not(X1))) = equiv(not(X1),X2),
inference(spm,[status(thm)],[c_0_71,c_0_45]) ).
fof(c_0_78,plain,
! [X160] :
( ( ~ r1
| is_a_theorem(implies(or(X160,X160),X160)) )
& ( ~ 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])])])]) ).
fof(c_0_79,negated_conjecture,
~ r1,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[principia_r1])]) ).
fof(c_0_80,plain,
! [X158] :
( ( ~ cn3
| is_a_theorem(implies(implies(not(X158),X158),X158)) )
& ( ~ 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])])])]) ).
cnf(c_0_81,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(or(X2,X3)) ),
inference(spm,[status(thm)],[c_0_49,c_0_72]) ).
cnf(c_0_82,plain,
is_a_theorem(implies(and(X1,X2),not(not(not(not(not(not(X1)))))))),
inference(spm,[status(thm)],[c_0_73,c_0_56]) ).
cnf(c_0_83,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]) ).
cnf(c_0_84,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_76,c_0_77]),c_0_34]),c_0_71]) ).
cnf(c_0_85,plain,
( r1
| ~ is_a_theorem(implies(or(esk45_0,esk45_0),esk45_0)) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_86,negated_conjecture,
~ r1,
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_87,plain,
( is_a_theorem(implies(implies(not(X1),X1),X1))
| ~ cn3 ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_88,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,and(X1,X3))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_34]),c_0_45]),c_0_34]),c_0_45]),c_0_34]),c_0_45]) ).
cnf(c_0_89,plain,
is_a_theorem(or(X1,and(not(X1),not(X1)))),
inference(spm,[status(thm)],[c_0_57,c_0_45]) ).
cnf(c_0_90,plain,
( not(not(X1)) = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_91,plain,
( is_a_theorem(equiv(X1,X1))
| ~ is_a_theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_61,c_0_71]) ).
cnf(c_0_92,plain,
( cn3
| ~ is_a_theorem(implies(implies(not(esk44_0),esk44_0),esk44_0)) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_93,plain,
~ is_a_theorem(implies(or(esk45_0,esk45_0),esk45_0)),
inference(sr,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_94,plain,
( is_a_theorem(implies(or(X1,X1),X1))
| ~ cn3 ),
inference(rw,[status(thm)],[c_0_87,c_0_45]) ).
cnf(c_0_95,plain,
is_a_theorem(implies(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_34]) ).
cnf(c_0_96,plain,
( not(not(X1)) = X1
| ~ is_a_theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_97,plain,
( cn3
| ~ is_a_theorem(implies(or(esk44_0,esk44_0),esk44_0)) ),
inference(rw,[status(thm)],[c_0_92,c_0_45]) ).
cnf(c_0_98,plain,
~ cn3,
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_99,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_81,c_0_95]) ).
cnf(c_0_100,plain,
or(and(not(X1),X2),X3) = implies(or(X1,not(X2)),X3),
inference(spm,[status(thm)],[c_0_34,c_0_51]) ).
cnf(c_0_101,plain,
not(not(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_95])]) ).
cnf(c_0_102,plain,
~ is_a_theorem(implies(or(esk44_0,esk44_0),esk44_0)),
inference(sr,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_103,plain,
is_a_theorem(implies(or(X1,X1),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_89]),c_0_100]),c_0_101]) ).
cnf(c_0_104,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_103])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL518+1 : TPTP v9.2.1. Bugfixed v9.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n029.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 22:39:29 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 18.42/11.39 % Version : CSE_E---1.7
% 18.42/11.39 % Problem : theBenchmark.p
% 18.42/11.39 % SZS status Theorem for theBenchmark.p
% 18.42/11.39 % SZS output start CNFRefutation
% See solution above
% 18.52/11.47 % Total time : 8.385s
%------------------------------------------------------------------------------