%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM482+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:49:15 PM UTC 2026
% Result : Theorem 0.15s 10.64s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 6 unt; 0 def)
% Number of atoms : 73 ( 12 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 84 ( 35 ~; 28 |; 15 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn 12 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( isPrime0(xk)
=> ? [X1] :
( isPrime0(X1)
& doDivides0(X1,xk)
& aNaturalNumber0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
fof(mSortsC_01,axiom,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC_01) ).
fof(m_MulUnit,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 = sdtasdt0(sz10,X1)
& sdtasdt0(X1,sz10) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_MulUnit) ).
fof(m__1716,hypothesis,
aNaturalNumber0(xk),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1716) ).
fof(c_0_6,negated_conjecture,
~ ( isPrime0(xk)
=> ? [X1] :
( isPrime0(X1)
& doDivides0(X1,xk)
& aNaturalNumber0(X1) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,plain,
! [X11,X12,X14] :
( ( ~ aNaturalNumber0(X12)
| ~ aNaturalNumber0(X11)
| doDivides0(X11,X12)
| X12 != sdtasdt0(X11,X14)
| ~ aNaturalNumber0(X14) )
& ( ~ aNaturalNumber0(X12)
| ~ aNaturalNumber0(X11)
| ~ doDivides0(X11,X12)
| X12 = sdtasdt0(X11,esk3_2(X11,X12)) )
& ( ~ aNaturalNumber0(X12)
| ~ aNaturalNumber0(X11)
| ~ doDivides0(X11,X12)
| aNaturalNumber0(esk3_2(X11,X12)) ) ),
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)],[mDefDiv])])])])])]) ).
fof(c_0_8,plain,
! [X46,X47] :
( aNaturalNumber0(sdtasdt0(X46,X47))
| ~ aNaturalNumber0(X47)
| ~ aNaturalNumber0(X46) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
fof(c_0_9,plain,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
inference(fof_simplification,[status(thm)],[mSortsC_01]) ).
fof(c_0_10,negated_conjecture,
! [X6] :
( ( ~ isPrime0(X6)
| ~ doDivides0(X6,xk)
| ~ aNaturalNumber0(X6) )
& isPrime0(xk) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_11,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X1)
| doDivides0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X30] :
( ( ~ aNaturalNumber0(X30)
| X30 = sdtasdt0(sz10,X30) )
& ( ~ aNaturalNumber0(X30)
| sdtasdt0(X30,sz10) = X30 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulUnit])])])]) ).
fof(c_0_14,plain,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( ~ isPrime0(X1)
| ~ doDivides0(X1,xk)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
isPrime0(xk),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,hypothesis,
aNaturalNumber0(xk),
inference(split_conjunct,[status(thm)],[m__1716]) ).
cnf(c_0_18,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| doDivides0(X1,sdtasdt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_11]),c_0_12]) ).
cnf(c_0_19,plain,
( ~ aNaturalNumber0(X1)
| sdtasdt0(X1,sz10) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
~ doDivides0(xk,xk),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_22,plain,
( ~ aNaturalNumber0(X1)
| doDivides0(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM482+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/10.56 % Computer : n016.cluster.edu
% 0.12/10.56 % Model : x86_64 x86_64
% 0.12/10.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.56 % Memory : 8046.5625MB
% 0.12/10.56 % OS : Linux 6.8.0-71-generic
% 0.12/10.56 % CPULimit : 300
% 0.12/10.56 % WCLimit : 300
% 0.12/10.56 % DateTime : Mon Sep 21 02:38:33 UTC 2026
% 0.12/10.57 % CPUTime :
% 0.12/10.57 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/10.61 Running first-order theorem proving
% 0.15/10.61 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
% 0.15/10.64 % Version: 3.5.1
% 0.15/10.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/10.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/10.64 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.64 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.64 % Starting sh5l with 300s (1) cores
% 0.15/10.64 % new_bool_1 with pid 1374388 completed with status 0
% 0.15/10.64 % Result found by new_bool_1
% 0.15/10.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/10.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/10.64 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.64 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/10.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/10.64 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.15/10.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/10.64 % Starting SubtermCWHack with 31s (1) cores
% 0.15/10.64 % SubtermCWHack with pid 1374404 completed with status 0
% 0.15/10.64 % Result found by SubtermCWHack
% 0.15/10.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/10.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/10.64 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.64 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/10.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/10.64 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.15/10.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/10.64 % Starting SubtermCWHack with 31s (1) cores
% 0.15/10.64 % Preprocessing time : 0.002 s
% 0.15/10.64
% 0.15/10.64 % Proof found!
% 0.15/10.64 % SZS status Theorem
% 0.15/10.64 % SZS output start CNFRefutation
% See solution above
% 0.15/10.64 % Parsed axioms : 41
% 0.15/10.64 % Removed by relevancy pruning/SinE : 3
% 0.15/10.64 % Initial clauses : 68
% 0.15/10.64 % Removed in clause preprocessing : 3
% 0.15/10.64 % Initial clauses in saturation : 65
% 0.15/10.64 % Processed clauses : 93
% 0.15/10.64 % ...of these trivial : 0
% 0.15/10.64 % ...subsumed : 30
% 0.15/10.64 % ...remaining for further processing : 63
% 0.15/10.64 % Other redundant clauses eliminated : 4
% 0.15/10.64 % Clauses deleted for lack of memory : 0
% 0.15/10.64 % Backward-subsumed : 1
% 0.15/10.64 % Backward-rewritten : 2
% 0.15/10.64 % Generated clauses : 114
% 0.15/10.64 % ...of the previous two non-redundant : 96
% 0.15/10.64 % ...aggressively subsumed : 0
% 0.15/10.64 % Contextual simplify-reflections : 1
% 0.15/10.64 % Paramodulations : 110
% 0.15/10.64 % Factorizations : 0
% 0.15/10.64 % NegExts : 0
% 0.15/10.64 % Equation resolutions : 4
% 0.15/10.64 % Disequality decompositions : 0
% 0.15/10.64 % Total rewrite steps : 53
% 0.15/10.64 % ...of those cached : 47
% 0.15/10.64 % Propositional unsat checks : 0
% 0.15/10.64 % Propositional check models : 0
% 0.15/10.64 % Propositional check unsatisfiable : 0
% 0.15/10.64 % Propositional clauses : 0
% 0.15/10.64 % Propositional clauses after purity: 0
% 0.15/10.64 % Propositional unsat core size : 0
% 0.15/10.64 % Propositional preprocessing time : 0.000
% 0.15/10.64 % Propositional encoding time : 0.000
% 0.15/10.64 % Propositional solver time : 0.000
% 0.15/10.64 % Success case prop preproc time : 0.000
% 0.15/10.64 % Success case prop encoding time : 0.000
% 0.15/10.64 % Success case prop solver time : 0.000
% 0.15/10.64 % Current number of processed clauses : 56
% 0.15/10.64 % Positive orientable unit clauses : 9
% 0.15/10.64 % Positive unorientable unit clauses: 0
% 0.15/10.64 % Negative unit clauses : 7
% 0.15/10.64 % Non-unit-clauses : 40
% 0.15/10.64 % Current number of unprocessed clauses: 66
% 0.15/10.64 % ...number of literals in the above : 338
% 0.15/10.64 % Current number of archived formulas : 0
% 0.15/10.64 % Current number of archived clauses : 3
% 0.15/10.64 % Clause-clause subsumption calls (NU) : 145
% 0.15/10.64 % Rec. Clause-clause subsumption calls : 94
% 0.15/10.64 % Non-unit clause-clause subsumptions : 32
% 0.15/10.64 % Unit Clause-clause subsumption calls : 22
% 0.15/10.64 % Rewrite failures with RHS unbound : 0
% 0.15/10.64 % BW rewrite match attempts : 2
% 0.15/10.64 % BW rewrite match successes : 2
% 0.15/10.64 % Condensation attempts : 0
% 0.15/10.64 % Condensation successes : 0
% 0.15/10.64 % Termbank termtop insertions : 7380
% 0.15/10.64 % Search garbage collected termcells : 1211
% 0.15/10.64
% 0.15/10.64 % -------------------------------------------------
% 0.15/10.64 % User time : 0.015 s
% 0.15/10.64 % System time : 0.001 s
% 0.15/10.64 % Total time : 0.016 s
% 0.15/10.64 % Maximum resident set size: 3676 pages
% 0.15/10.64
% 0.15/10.64 % -------------------------------------------------
% 0.15/10.64 % User time : 0.017 s
% 0.15/10.64 % System time : 0.007 s
% 0.15/10.64 % Total time : 0.024 s
% 0.15/10.64 % Maximum resident set size: 4864 pages
% 0.15/10.64 % E exiting
%------------------------------------------------------------------------------