%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM432+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:04 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 35 ( 9 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 33 ( 14 ~; 11 |; 7 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 5 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( sdteqdtlpzmzozddtrp0(xa,xc,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| ? [X1] :
( sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xc))
& aInteger0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__924,hypothesis,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__924) ).
fof(mIntPlus,axiom,
! [X1,X2] :
( ( aInteger0(X2)
& aInteger0(X1) )
=> aInteger0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntPlus) ).
fof(m__899,hypothesis,
( sdtasdt0(xq,xm) = sdtpldt0(xb,smndt0(xc))
& aInteger0(xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__899) ).
fof(m__876,hypothesis,
( sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb))
& aInteger0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__876) ).
fof(c_0_5,negated_conjecture,
~ ( sdteqdtlpzmzozddtrp0(xa,xc,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
| ? [X1] :
( sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xc))
& aInteger0(X1) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
! [X6] :
( ~ sdteqdtlpzmzozddtrp0(xa,xc,xq)
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
& ( sdtasdt0(xq,X6) != sdtpldt0(xa,smndt0(xc))
| ~ aInteger0(X6) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_7,negated_conjecture,
( sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xc))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,hypothesis,
sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
inference(split_conjunct,[status(thm)],[m__924]) ).
cnf(c_0_9,negated_conjecture,
( ~ aInteger0(X1)
| sdtasdt0(xq,X1) != sdtasdt0(xq,sdtpldt0(xn,xm)) ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_10,plain,
! [X26,X27] :
( aInteger0(sdtpldt0(X26,X27))
| ~ aInteger0(X27)
| ~ aInteger0(X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntPlus])])]) ).
cnf(c_0_11,negated_conjecture,
~ aInteger0(sdtpldt0(xn,xm)),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| aInteger0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,hypothesis,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[m__899]) ).
cnf(c_0_14,hypothesis,
aInteger0(xn),
inference(split_conjunct,[status(thm)],[m__876]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM432+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n020.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 02:29:47 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 0.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % new_bool_1 with pid 1798802 completed with status 0
% 0.10/0.44 % Result found by new_bool_1
% 0.10/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.44 % SubtermCWHack with pid 1798804 completed with status 0
% 0.10/0.44 % Result found by SubtermCWHack
% 0.10/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.44 % Preprocessing time : 0.002 s
% 0.10/0.44
% 0.10/0.44 % Proof found!
% 0.10/0.44 % SZS status Theorem
% 0.10/0.44 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 27
% 0.10/0.44 % Removed by relevancy pruning/SinE : 3
% 0.10/0.44 % Initial clauses : 48
% 0.10/0.44 % Removed in clause preprocessing : 1
% 0.10/0.44 % Initial clauses in saturation : 47
% 0.10/0.44 % Processed clauses : 50
% 0.10/0.44 % ...of these trivial : 0
% 0.10/0.44 % ...subsumed : 0
% 0.10/0.44 % ...remaining for further processing : 50
% 0.10/0.44 % Other redundant clauses eliminated : 1
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 0
% 0.10/0.44 % Backward-rewritten : 6
% 0.10/0.44 % Generated clauses : 28
% 0.10/0.44 % ...of the previous two non-redundant : 15
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 0
% 0.10/0.44 % Paramodulations : 26
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 2
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 52
% 0.10/0.44 % ...of those cached : 36
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 43
% 0.10/0.44 % Positive orientable unit clauses : 22
% 0.10/0.44 % Positive unorientable unit clauses: 0
% 0.10/0.44 % Negative unit clauses : 4
% 0.10/0.44 % Non-unit-clauses : 17
% 0.10/0.44 % Current number of unprocessed clauses: 12
% 0.10/0.44 % ...number of literals in the above : 53
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 6
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 38
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 22
% 0.10/0.44 % Non-unit clause-clause subsumptions : 0
% 0.10/0.44 % Unit Clause-clause subsumption calls : 11
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 6
% 0.10/0.44 % BW rewrite match successes : 6
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 3305
% 0.10/0.44 % Search garbage collected termcells : 492
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.004 s
% 0.10/0.44 % System time : 0.004 s
% 0.10/0.44 % Total time : 0.008 s
% 0.10/0.44 % Maximum resident set size: 3660 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.006 s
% 0.10/0.44 % System time : 0.008 s
% 0.10/0.44 % Total time : 0.014 s
% 0.10/0.44 % Maximum resident set size: 4864 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------