%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL458+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:50 PM UTC 2026
% Result : Theorem 34.03s 8.96s
% Output : CNFRefutation 34.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 23
% Syntax : Number of formulae : 90 ( 46 unt; 0 def)
% Number of atoms : 166 ( 32 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 130 ( 54 ~; 51 |; 11 &)
% ( 7 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 6 ( 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 : 129 ( 0 sgn 52 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(op_and,axiom,
( op_and
=> ! [X1,X2] : and(X1,X2) = not(or(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_and) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_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/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/sandbox2/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(principia_op_and,axiom,
op_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_and) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).
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/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(and_3,axiom,
( and_3
<=> ! [X1,X2] : is_a_theorem(implies(X1,implies(X2,and(X1,X2)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_3) ).
fof(modus_tollens,axiom,
( modus_tollens
<=> ! [X1,X2] : is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_tollens) ).
fof(hilbert_op_or,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_op_or) ).
fof(substitution_of_equivalents,axiom,
( substitution_of_equivalents
<=> ! [X1,X2] :
( is_a_theorem(equiv(X1,X2))
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',substitution_of_equivalents) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
fof(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(hilbert_and_3,axiom,
and_3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_and_3) ).
fof(hilbert_modus_tollens,axiom,
modus_tollens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_modus_tollens) ).
fof(use_substitution_of_equivalents,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',use_substitution_of_equivalents) ).
fof(hilbert_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_op_equiv) ).
fof(r3,axiom,
( r3
<=> ! [X4,X5] : is_a_theorem(implies(or(X4,X5),or(X5,X4))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r3) ).
fof(principia_r5,conjecture,
r5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r5) ).
fof(implies_3,axiom,
( implies_3
<=> ! [X1,X2,X3] : is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',implies_3) ).
fof(r5,axiom,
( r5
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r5) ).
fof(hilbert_implies_3,axiom,
implies_3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_implies_3) ).
fof(c_0_23,plain,
! [X123,X124] :
( implies(X123,X124) = or(not(X123),X124)
| ~ op_implies_or ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_or])])])]) ).
fof(c_0_24,plain,
! [X119,X120] :
( and(X119,X120) = not(or(not(X119),not(X120)))
| ~ op_and ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_and])])])]) ).
cnf(c_0_25,plain,
( ~ op_implies_or
| implies(X1,X2) = or(not(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
fof(c_0_27,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])])])]) ).
fof(c_0_28,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_29,plain,
( ~ op_and
| and(X1,X2) = not(or(not(X1),not(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,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_31,plain,
op_and,
inference(split_conjunct,[status(thm)],[principia_op_and]) ).
cnf(c_0_32,plain,
( ~ op_implies_and
| implies(X1,X2) = not(and(X1,not(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
fof(c_0_34,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_35,plain,
! [X41,X42] :
( ( and_3
| ~ is_a_theorem(implies(esk18_0,implies(esk19_0,and(esk18_0,esk19_0)))) )
& ( is_a_theorem(implies(X41,implies(X42,and(X41,X42))))
| ~ and_3 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_3])])])])]) ).
fof(c_0_36,plain,
! [X15,X16] :
( ( modus_tollens
| ~ is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0))) )
& ( is_a_theorem(implies(implies(not(X16),not(X15)),implies(X15,X16)))
| ~ modus_tollens ) ),
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_tollens])])])])]) ).
cnf(c_0_37,plain,
( ~ op_or
| or(X1,X2) = not(and(not(X1),not(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
and(X1,X2) = not(implies(X1,not(X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_39,plain,
op_or,
inference(split_conjunct,[status(thm)],[hilbert_op_or]) ).
cnf(c_0_40,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
fof(c_0_41,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])])])])])]) ).
fof(c_0_42,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_43,plain,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1)
| ~ modus_ponens
| is_a_theorem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_45,plain,
( ~ and_3
| is_a_theorem(implies(X1,implies(X2,and(X1,X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_46,plain,
and_3,
inference(split_conjunct,[status(thm)],[hilbert_and_3]) ).
cnf(c_0_47,plain,
( ~ modus_tollens
| is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_48,plain,
modus_tollens,
inference(split_conjunct,[status(thm)],[hilbert_modus_tollens]) ).
cnf(c_0_49,plain,
not(not(implies(not(X1),not(not(X2))))) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_50,plain,
not(not(implies(X1,not(not(X2))))) = implies(X1,X2),
inference(rw,[status(thm)],[c_0_40,c_0_38]) ).
cnf(c_0_51,plain,
( ~ is_a_theorem(equiv(X1,X2))
| ~ substitution_of_equivalents
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_52,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[use_substitution_of_equivalents]) ).
cnf(c_0_53,plain,
( ~ op_equiv
| equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_54,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[hilbert_op_equiv]) ).
cnf(c_0_55,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_43,c_0_44])]) ).
cnf(c_0_56,plain,
is_a_theorem(implies(X1,implies(X2,not(implies(X1,not(X2)))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_38]),c_0_46])]) ).
fof(c_0_57,plain,
! [X101,X102] :
( ( r3
| ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0))) )
& ( is_a_theorem(implies(or(X101,X102),or(X102,X101)))
| ~ r3 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r3])])])])]) ).
cnf(c_0_58,plain,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_59,plain,
implies(not(X1),X2) = or(X1,X2),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
fof(c_0_60,negated_conjecture,
~ r5,
inference(assume_negation,[status(cth)],[principia_r5]) ).
cnf(c_0_61,plain,
( ~ is_a_theorem(equiv(X1,X2))
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_62,plain,
equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
cnf(c_0_63,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,not(implies(X2,not(X1))))) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_64,plain,
( ~ r3
| is_a_theorem(implies(or(X1,X2),or(X2,X1))) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_65,plain,
( ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0)))
| r3 ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_66,plain,
is_a_theorem(implies(implies(not(X1),not(not(X2))),or(X2,X1))),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_67,plain,
implies(implies(X1,not(not(X2))),X3) = implies(implies(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_50]),c_0_30]) ).
fof(c_0_68,negated_conjecture,
~ r5,
inference(fof_simplification,[status(thm)],[c_0_60]) ).
fof(c_0_69,plain,
! [X27,X28,X29] :
( ( implies_3
| ~ is_a_theorem(implies(implies(esk11_0,esk12_0),implies(implies(esk12_0,esk13_0),implies(esk11_0,esk13_0)))) )
& ( is_a_theorem(implies(implies(X27,X28),implies(implies(X28,X29),implies(X27,X29))))
| ~ implies_3 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_3])])])])]) ).
cnf(c_0_70,plain,
( ~ is_a_theorem(not(implies(implies(X1,X2),not(implies(X2,X1)))))
| X1 = X2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_38]) ).
cnf(c_0_71,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X2)
| is_a_theorem(not(implies(X1,not(X2)))) ),
inference(spm,[status(thm)],[c_0_55,c_0_63]) ).
cnf(c_0_72,plain,
( ~ is_a_theorem(implies(implies(not(esk48_0),esk49_0),or(esk49_0,esk48_0)))
| is_a_theorem(implies(or(X1,X2),or(X2,X1))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_59]) ).
cnf(c_0_73,plain,
is_a_theorem(implies(implies(not(X1),X2),or(X2,X1))),
inference(rw,[status(thm)],[c_0_66,c_0_67]) ).
fof(c_0_74,plain,
! [X111,X112,X113] :
( ( r5
| ~ is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0)))) )
& ( is_a_theorem(implies(implies(X112,X113),implies(or(X111,X112),or(X111,X113))))
| ~ r5 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r5])])])])]) ).
fof(c_0_75,negated_conjecture,
~ r5,
inference(fof_nnf,[status(thm)],[c_0_68]) ).
cnf(c_0_76,plain,
( ~ implies_3
| is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_77,plain,
implies_3,
inference(split_conjunct,[status(thm)],[hilbert_implies_3]) ).
cnf(c_0_78,plain,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_79,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]) ).
cnf(c_0_80,plain,
( ~ is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0))))
| r5 ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_81,negated_conjecture,
~ r5,
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_82,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_76,c_0_77])]) ).
cnf(c_0_83,plain,
or(X1,X2) = or(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_79])]) ).
cnf(c_0_84,plain,
~ is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0)))),
inference(sr,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_85,plain,
is_a_theorem(implies(or(X1,X2),implies(implies(X2,X3),implies(not(X1),X3)))),
inference(spm,[status(thm)],[c_0_82,c_0_59]) ).
cnf(c_0_86,plain,
or(X1,not(X2)) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_30,c_0_83]) ).
cnf(c_0_87,plain,
~ is_a_theorem(implies(implies(esk54_0,esk55_0),implies(implies(not(esk54_0),esk53_0),implies(not(esk55_0),esk53_0)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_83]),c_0_59]),c_0_83]),c_0_59]) ).
cnf(c_0_88,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(not(X1),X3),implies(not(X2),X3)))),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_89,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL458+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n005.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 00:32:48 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 34.03/8.96 % Version: 3.5.1
% 34.03/8.96 % Preprocessing class: FSMSSLSSSSSNFFN.
% 34.03/8.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.03/8.96 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 34.03/8.96 % Starting new_bool_3 with 300s (1) cores
% 34.03/8.96 % Starting new_bool_1 with 300s (1) cores
% 34.03/8.96 % Starting sh5l with 300s (1) cores
% 34.03/8.96 % new_bool_3 with pid 2159664 completed with status 9
% 34.03/8.96 % sh5l with pid 2159666 completed with status 9
% 34.03/8.96 % new_bool_1 with pid 2159665 completed with status 9
% 34.03/8.96 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 2159663 completed with status 0
% 34.03/8.96 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 34.03/8.96 % Preprocessing class: FSMSSLSSSSSNFFN.
% 34.03/8.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.03/8.96 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 34.03/8.96 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 34.03/8.96 % No SInE strategy applied
% 34.03/8.96 % Search class: FGUSF-FFMM21-MFFFFFNN
% 34.03/8.96 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 34.03/8.96 % Starting SubtermCWHack with 151s (1) cores
% 34.03/8.96 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 34.03/8.96 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 34.03/8.96 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 34.03/8.96 % Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 34.03/8.96 % G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 2159682 completed with status 0
% 34.03/8.96 % Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 34.03/8.96 % Preprocessing class: FSMSSLSSSSSNFFN.
% 34.03/8.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.03/8.96 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 34.03/8.96 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 34.03/8.96 % No SInE strategy applied
% 34.03/8.96 % Search class: FGUSF-FFMM21-MFFFFFNN
% 34.03/8.96 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 34.03/8.96 % Starting SubtermCWHack with 151s (1) cores
% 34.03/8.96 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 34.03/8.96 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 34.03/8.96 % Preprocessing time : 0.003 s
% 34.03/8.96 % Presaturation interreduction done
% 34.03/8.96
% 34.03/8.96 % Proof found!
% 34.03/8.96 % SZS status Theorem
% 34.03/8.96 % SZS output start CNFRefutation
% See solution above
% 34.03/8.96 % Parsed axioms : 53
% 34.03/8.96 % Removed by relevancy pruning/SinE : 0
% 34.03/8.96 % Initial clauses : 82
% 34.03/8.96 % Removed in clause preprocessing : 0
% 34.03/8.96 % Initial clauses in saturation : 82
% 34.03/8.96 % Processed clauses : 13266
% 34.03/8.96 % ...of these trivial : 992
% 34.03/8.96 % ...subsumed : 10779
% 34.03/8.96 % ...remaining for further processing : 1495
% 34.03/8.96 % Other redundant clauses eliminated : 0
% 34.03/8.96 % Clauses deleted for lack of memory : 0
% 34.03/8.96 % Backward-subsumed : 40
% 34.03/8.96 % Backward-rewritten : 112
% 34.03/8.96 % Generated clauses : 774183
% 34.03/8.96 % ...of the previous two non-redundant : 561282
% 34.03/8.96 % ...aggressively subsumed : 0
% 34.03/8.96 % Contextual simplify-reflections : 0
% 34.03/8.96 % Paramodulations : 774183
% 34.03/8.96 % Factorizations : 0
% 34.03/8.96 % NegExts : 0
% 34.03/8.96 % Equation resolutions : 0
% 34.03/8.96 % Disequality decompositions : 0
% 34.03/8.96 % Total rewrite steps : 775133
% 34.03/8.96 % ...of those cached : 657964
% 34.03/8.96 % Propositional unsat checks : 0
% 34.03/8.96 % Propositional check models : 0
% 34.03/8.96 % Propositional check unsatisfiable : 0
% 34.03/8.96 % Propositional clauses : 0
% 34.03/8.96 % Propositional clauses after purity: 0
% 34.03/8.96 % Propositional unsat core size : 0
% 34.03/8.96 % Propositional preprocessing time : 0.000
% 34.03/8.96 % Propositional encoding time : 0.000
% 34.03/8.96 % Propositional solver time : 0.000
% 34.03/8.96 % Success case prop preproc time : 0.000
% 34.03/8.96 % Success case prop encoding time : 0.000
% 34.03/8.96 % Success case prop solver time : 0.000
% 34.03/8.96 % Current number of processed clauses : 1285
% 34.03/8.96 % Positive orientable unit clauses : 394
% 34.03/8.96 % Positive unorientable unit clauses: 149
% 34.03/8.96 % Negative unit clauses : 24
% 34.03/8.96 % Non-unit-clauses : 718
% 34.03/8.96 % Current number of unprocessed clauses: 546151
% 34.03/8.96 % ...number of literals in the above : 715693
% 34.03/8.96 % Current number of archived formulas : 0
% 34.03/8.96 % Current number of archived clauses : 210
% 34.03/8.96 % Clause-clause subsumption calls (NU) : 112935
% 34.03/8.96 % Rec. Clause-clause subsumption calls : 112751
% 34.03/8.96 % Non-unit clause-clause subsumptions : 6689
% 34.03/8.96 % Unit Clause-clause subsumption calls : 13688
% 34.03/8.96 % Rewrite failures with RHS unbound : 7560
% 34.03/8.96 % BW rewrite match attempts : 112429
% 34.03/8.96 % BW rewrite match successes : 1220
% 34.03/8.96 % Condensation attempts : 0
% 34.03/8.96 % Condensation successes : 0
% 34.03/8.96 % Termbank termtop insertions : 9427741
% 34.03/8.96 % Search garbage collected termcells : 1092
% 34.03/8.96
% 34.03/8.96 % -------------------------------------------------
% 34.03/8.96 % User time : 7.993 s
% 34.03/8.96 % System time : 0.418 s
% 34.03/8.96 % Total time : 8.412 s
% 34.03/8.96 % Maximum resident set size: 3688 pages
% 34.03/8.96
% 34.03/8.96 % -------------------------------------------------
% 34.03/8.96 % User time : 40.612 s
% 34.03/8.96 % System time : 1.880 s
% 34.03/8.96 % Total time : 42.492 s
% 34.03/8.96 % Maximum resident set size: 4608 pages
% 34.03/8.96 % E exiting
%------------------------------------------------------------------------------