%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM425+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 : n018.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:54:58 PM UTC 2026
% Result : Theorem 0.12s 0.45s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 9 unt; 0 def)
% Number of atoms : 112 ( 22 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 132 ( 52 ~; 41 |; 29 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 24 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDivisor,axiom,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( ? [X3] :
( sdtasdt0(X2,X3) = X1
& aInteger0(X3) )
& X2 != sz00
& aInteger0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDivisor) ).
fof(mEquMod,axiom,
! [X1,X2,X3] :
( ( X3 != sz00
& aInteger0(X3)
& aInteger0(X2)
& aInteger0(X1) )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
<=> aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEquMod) ).
fof(m__704,hypothesis,
( xq != sz00
& aInteger0(xq)
& aInteger0(xb)
& aInteger0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__704) ).
fof(m__724,hypothesis,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__724) ).
fof(mIntPlus,axiom,
! [X1,X2] :
( ( aInteger0(X2)
& aInteger0(X1) )
=> aInteger0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntPlus) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntNeg) ).
fof(c_0_7,negated_conjecture,
~ ? [X1] :
( sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,plain,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( ? [X3] :
( sdtasdt0(X2,X3) = X1
& aInteger0(X3) )
& X2 != sz00
& aInteger0(X2) ) ) ),
inference(fof_simplification,[status(thm)],[mDivisor]) ).
fof(c_0_9,negated_conjecture,
! [X4] :
( sdtasdt0(xq,X4) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X4) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,plain,
! [X34,X35,X37,X38] :
( ( ~ aInteger0(X34)
| aDivisorOf0(X37,X34)
| sdtasdt0(X37,X38) != X34
| ~ aInteger0(X38)
| X37 = sz00
| ~ aInteger0(X37) )
& ( ~ aInteger0(X34)
| ~ aDivisorOf0(X35,X34)
| sdtasdt0(X35,esk1_2(X34,X35)) = X34 )
& ( ~ aInteger0(X34)
| ~ aDivisorOf0(X35,X34)
| aInteger0(esk1_2(X34,X35)) )
& ( ~ aInteger0(X34)
| ~ aDivisorOf0(X35,X34)
| X35 != sz00 )
& ( ~ aInteger0(X34)
| ~ aDivisorOf0(X35,X34)
| aInteger0(X35) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])])]) ).
fof(c_0_11,plain,
! [X1,X2,X3] :
( ( X3 != sz00
& aInteger0(X3)
& aInteger0(X2)
& aInteger0(X1) )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
<=> aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))) ) ),
inference(fof_simplification,[status(thm)],[mEquMod]) ).
fof(c_0_12,hypothesis,
( xq != sz00
& aInteger0(xq)
& aInteger0(xb)
& aInteger0(xa) ),
inference(fof_simplification,[status(thm)],[m__704]) ).
cnf(c_0_13,negated_conjecture,
( sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ aInteger0(X2)
| ~ aDivisorOf0(X1,X2)
| sdtasdt0(X1,esk1_2(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ aInteger0(X1)
| ~ aDivisorOf0(X2,X1)
| aInteger0(esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X10,X11,X12] :
( ( X12 = sz00
| ~ aInteger0(X12)
| ~ aInteger0(X11)
| ~ aInteger0(X10)
| sdteqdtlpzmzozddtrp0(X10,X11,X12)
| ~ aDivisorOf0(X12,sdtpldt0(X10,smndt0(X11))) )
& ( X12 = sz00
| ~ aInteger0(X12)
| ~ aInteger0(X11)
| ~ aInteger0(X10)
| aDivisorOf0(X12,sdtpldt0(X10,smndt0(X11)))
| ~ sdteqdtlpzmzozddtrp0(X10,X11,X12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_17,hypothesis,
( xq != sz00
& aInteger0(xq)
& aInteger0(xb)
& aInteger0(xa) ),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( ~ aInteger0(sdtpldt0(xa,smndt0(xb)))
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14])]),c_0_15]) ).
cnf(c_0_19,plain,
( ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ sdteqdtlpzmzozddtrp0(X1,X2,X3)
| X3 = sz00
| aDivisorOf0(X3,sdtpldt0(X1,smndt0(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,hypothesis,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
inference(split_conjunct,[status(thm)],[m__724]) ).
cnf(c_0_21,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,hypothesis,
aInteger0(xb),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,hypothesis,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,hypothesis,
xq != sz00,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_25,plain,
! [X15,X16] :
( aInteger0(sdtpldt0(X15,X16))
| ~ aInteger0(X16)
| ~ aInteger0(X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntPlus])])]) ).
cnf(c_0_26,negated_conjecture,
~ aInteger0(sdtpldt0(xa,smndt0(xb))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_27,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| aInteger0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_28,plain,
! [X25] :
( aInteger0(smndt0(X25))
| ~ aInteger0(X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])])]) ).
cnf(c_0_29,negated_conjecture,
~ aInteger0(smndt0(xb)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_23])]) ).
cnf(c_0_30,plain,
( ~ aInteger0(X1)
| aInteger0(smndt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM425+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/0.37 % Computer : n018.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 02:30:28 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.45 % Version: 3.5.1
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % Starting sh5l with 300s (1) cores
% 0.12/0.45 % new_bool_3 with pid 770230 completed with status 0
% 0.12/0.45 % Result found by new_bool_3
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.12/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.45 % SubtermCWHack with pid 770238 completed with status 0
% 0.12/0.45 % Result found by SubtermCWHack
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.12/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.45 % Preprocessing time : 0.001 s
% 0.12/0.45
% 0.12/0.45 % Proof found!
% 0.12/0.45 % SZS status Theorem
% 0.12/0.45 % SZS output start CNFRefutation
% See solution above
% 0.12/0.45 % Parsed axioms : 23
% 0.12/0.45 % Removed by relevancy pruning/SinE : 3
% 0.12/0.45 % Initial clauses : 32
% 0.12/0.45 % Removed in clause preprocessing : 1
% 0.12/0.45 % Initial clauses in saturation : 31
% 0.12/0.45 % Processed clauses : 123
% 0.12/0.45 % ...of these trivial : 0
% 0.12/0.45 % ...subsumed : 64
% 0.12/0.45 % ...remaining for further processing : 59
% 0.12/0.45 % Other redundant clauses eliminated : 4
% 0.12/0.45 % Clauses deleted for lack of memory : 0
% 0.12/0.45 % Backward-subsumed : 2
% 0.12/0.45 % Backward-rewritten : 2
% 0.12/0.45 % Generated clauses : 363
% 0.12/0.45 % ...of the previous two non-redundant : 282
% 0.12/0.45 % ...aggressively subsumed : 0
% 0.12/0.45 % Contextual simplify-reflections : 3
% 0.12/0.45 % Paramodulations : 359
% 0.12/0.45 % Factorizations : 0
% 0.12/0.45 % NegExts : 0
% 0.12/0.45 % Equation resolutions : 4
% 0.12/0.45 % Disequality decompositions : 0
% 0.12/0.45 % Total rewrite steps : 278
% 0.12/0.45 % ...of those cached : 270
% 0.12/0.45 % Propositional unsat checks : 0
% 0.12/0.45 % Propositional check models : 0
% 0.12/0.45 % Propositional check unsatisfiable : 0
% 0.12/0.45 % Propositional clauses : 0
% 0.12/0.45 % Propositional clauses after purity: 0
% 0.12/0.45 % Propositional unsat core size : 0
% 0.12/0.45 % Propositional preprocessing time : 0.000
% 0.12/0.45 % Propositional encoding time : 0.000
% 0.12/0.45 % Propositional solver time : 0.000
% 0.12/0.45 % Success case prop preproc time : 0.000
% 0.12/0.45 % Success case prop encoding time : 0.000
% 0.12/0.45 % Success case prop solver time : 0.000
% 0.12/0.45 % Current number of processed clauses : 53
% 0.12/0.45 % Positive orientable unit clauses : 8
% 0.12/0.45 % Positive unorientable unit clauses: 0
% 0.12/0.45 % Negative unit clauses : 3
% 0.12/0.45 % Non-unit-clauses : 42
% 0.12/0.45 % Current number of unprocessed clauses: 168
% 0.12/0.45 % ...number of literals in the above : 758
% 0.12/0.45 % Current number of archived formulas : 0
% 0.12/0.45 % Current number of archived clauses : 4
% 0.12/0.45 % Clause-clause subsumption calls (NU) : 401
% 0.12/0.45 % Rec. Clause-clause subsumption calls : 294
% 0.12/0.45 % Non-unit clause-clause subsumptions : 68
% 0.12/0.45 % Unit Clause-clause subsumption calls : 86
% 0.12/0.45 % Rewrite failures with RHS unbound : 0
% 0.12/0.45 % BW rewrite match attempts : 2
% 0.12/0.45 % BW rewrite match successes : 2
% 0.12/0.45 % Condensation attempts : 0
% 0.12/0.45 % Condensation successes : 0
% 0.12/0.45 % Termbank termtop insertions : 7556
% 0.12/0.45 % Search garbage collected termcells : 435
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.011 s
% 0.12/0.45 % System time : 0.000 s
% 0.12/0.45 % Total time : 0.011 s
% 0.12/0.45 % Maximum resident set size: 3652 pages
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.012 s
% 0.12/0.45 % System time : 0.004 s
% 0.12/0.45 % Total time : 0.016 s
% 0.12/0.45 % Maximum resident set size: 4608 pages
% 0.12/0.45 % E exiting
%------------------------------------------------------------------------------