%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM436+1 : 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 : n007.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:55:01 PM UTC 2026
% Result : Theorem 0.10s 0.46s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 16 unt; 0 def)
% Number of atoms : 131 ( 32 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 149 ( 57 ~; 46 |; 37 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 21 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDivisor,axiom,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( ? [X3] :
( sdtasdt0(X2,X3) = X1
& aInteger0(X3) )
& X2 != sz00
& aInteger0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDivisor) ).
fof(mIntMult,axiom,
! [X1,X2] :
( ( aInteger0(X2)
& aInteger0(X1) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntMult) ).
fof(m__979,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__979) ).
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/sandbox/benchmark/theBenchmark.p',mEquMod) ).
fof(m__1071,hypothesis,
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm))
& sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1071) ).
fof(m__,conjecture,
( sdteqdtlpzmzozddtrp0(xa,xb,xq)
& sdteqdtlpzmzozddtrp0(xa,xb,xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__1032,hypothesis,
( sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb))
& aInteger0(xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1032) ).
fof(c_0_7,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_8,plain,
! [X31,X32,X34,X35] :
( ( ~ aInteger0(X31)
| aDivisorOf0(X34,X31)
| sdtasdt0(X34,X35) != X31
| ~ aInteger0(X35)
| X34 = sz00
| ~ aInteger0(X34) )
& ( ~ aInteger0(X31)
| ~ aDivisorOf0(X32,X31)
| sdtasdt0(X32,esk1_2(X31,X32)) = X31 )
& ( ~ aInteger0(X31)
| ~ aDivisorOf0(X32,X31)
| aInteger0(esk1_2(X31,X32)) )
& ( ~ aInteger0(X31)
| ~ aDivisorOf0(X32,X31)
| X32 != sz00 )
& ( ~ aInteger0(X31)
| ~ aDivisorOf0(X32,X31)
| aInteger0(X32) ) ),
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_7])])])])])])]) ).
fof(c_0_9,plain,
! [X9,X10] :
( aInteger0(sdtasdt0(X9,X10))
| ~ aInteger0(X10)
| ~ aInteger0(X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntMult])])]) ).
fof(c_0_10,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
inference(fof_simplification,[status(thm)],[m__979]) ).
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]) ).
cnf(c_0_12,hypothesis,
sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[m__1071]) ).
cnf(c_0_13,hypothesis,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[m__1071]) ).
cnf(c_0_14,plain,
( ~ aInteger0(X3)
| sdtasdt0(X1,X2) != X3
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| aDivisorOf0(X1,X3)
| X1 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| aInteger0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
fof(c_0_17,plain,
! [X36,X37,X38] :
( ( X38 = sz00
| ~ aInteger0(X38)
| ~ aInteger0(X37)
| ~ aInteger0(X36)
| sdteqdtlpzmzozddtrp0(X36,X37,X38)
| ~ aDivisorOf0(X38,sdtpldt0(X36,smndt0(X37))) )
& ( X38 = sz00
| ~ aInteger0(X38)
| ~ aInteger0(X37)
| ~ aInteger0(X36)
| aDivisorOf0(X38,sdtpldt0(X36,smndt0(X37)))
| ~ sdteqdtlpzmzozddtrp0(X36,X37,X38) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_18,hypothesis,
sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| aDivisorOf0(X1,sdtasdt0(X1,X2))
| X1 = sz00 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_15]) ).
cnf(c_0_20,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,hypothesis,
xq != sz00,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,negated_conjecture,
~ ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
& sdteqdtlpzmzozddtrp0(xa,xb,xp) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_23,plain,
( ~ aInteger0(X1)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3)))
| X1 = sz00
| sdteqdtlpzmzozddtrp0(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,hypothesis,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(rw,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_25,hypothesis,
aInteger0(xb),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,hypothesis,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,hypothesis,
( ~ aInteger0(sdtasdt0(xp,xm))
| aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_20])]),c_0_21]) ).
cnf(c_0_28,hypothesis,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[m__1032]) ).
cnf(c_0_29,hypothesis,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_30,negated_conjecture,
( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])]) ).
cnf(c_0_31,hypothesis,
( ~ aInteger0(X1)
| ~ aDivisorOf0(X1,sdtasdt0(xp,sdtasdt0(xq,xm)))
| sdteqdtlpzmzozddtrp0(xa,xb,X1)
| X1 = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_32,hypothesis,
aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_15]),c_0_28]),c_0_29])]) ).
cnf(c_0_33,negated_conjecture,
( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,hypothesis,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_20])]),c_0_21]) ).
cnf(c_0_35,hypothesis,
xp != sz00,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_36,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xb,xp),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_37,hypothesis,
~ aInteger0(sdtasdt0(xq,xm)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_19]),c_0_29])]),c_0_35]),c_0_36]) ).
cnf(c_0_38,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_15]),c_0_28]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM436+1 : 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.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % 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:27:06 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.46 % Version: 3.5.1
% 0.10/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.46 % Starting sh5l with 300s (1) cores
% 0.10/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4168182 completed with status 0
% 0.10/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.46 % No SInE strategy applied
% 0.10/0.46 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.10/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 0.10/0.46 % Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.10/0.46 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.10/0.46 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with pid 4168190 completed with status 0
% 0.10/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m
% 0.10/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.46 % No SInE strategy applied
% 0.10/0.46 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.10/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 0.10/0.46 % Preprocessing time : 0.002 s
% 0.10/0.46 % Presaturation interreduction done
% 0.10/0.46
% 0.10/0.46 % Proof found!
% 0.10/0.46 % SZS status Theorem
% 0.10/0.46 % SZS output start CNFRefutation
% See solution above
% 0.10/0.46 % Parsed axioms : 27
% 0.10/0.46 % Removed by relevancy pruning/SinE : 0
% 0.10/0.46 % Initial clauses : 45
% 0.10/0.46 % Removed in clause preprocessing : 1
% 0.10/0.46 % Initial clauses in saturation : 44
% 0.10/0.46 % Processed clauses : 296
% 0.10/0.46 % ...of these trivial : 13
% 0.10/0.46 % ...subsumed : 95
% 0.10/0.46 % ...remaining for further processing : 188
% 0.10/0.46 % Other redundant clauses eliminated : 2
% 0.10/0.46 % Clauses deleted for lack of memory : 0
% 0.10/0.46 % Backward-subsumed : 9
% 0.10/0.46 % Backward-rewritten : 22
% 0.10/0.46 % Generated clauses : 762
% 0.10/0.46 % ...of the previous two non-redundant : 551
% 0.10/0.46 % ...aggressively subsumed : 0
% 0.10/0.46 % Contextual simplify-reflections : 5
% 0.10/0.46 % Paramodulations : 760
% 0.10/0.46 % Factorizations : 0
% 0.10/0.46 % NegExts : 0
% 0.10/0.46 % Equation resolutions : 2
% 0.10/0.46 % Disequality decompositions : 0
% 0.10/0.46 % Total rewrite steps : 1114
% 0.10/0.46 % ...of those cached : 1074
% 0.10/0.46 % Propositional unsat checks : 0
% 0.10/0.46 % Propositional check models : 0
% 0.10/0.46 % Propositional check unsatisfiable : 0
% 0.10/0.46 % Propositional clauses : 0
% 0.10/0.46 % Propositional clauses after purity: 0
% 0.10/0.46 % Propositional unsat core size : 0
% 0.10/0.46 % Propositional preprocessing time : 0.000
% 0.10/0.46 % Propositional encoding time : 0.000
% 0.10/0.46 % Propositional solver time : 0.000
% 0.10/0.46 % Success case prop preproc time : 0.000
% 0.10/0.46 % Success case prop encoding time : 0.000
% 0.10/0.46 % Success case prop solver time : 0.000
% 0.10/0.46 % Current number of processed clauses : 111
% 0.10/0.46 % Positive orientable unit clauses : 42
% 0.10/0.46 % Positive unorientable unit clauses: 0
% 0.10/0.46 % Negative unit clauses : 4
% 0.10/0.46 % Non-unit-clauses : 65
% 0.10/0.46 % Current number of unprocessed clauses: 324
% 0.10/0.46 % ...number of literals in the above : 1086
% 0.10/0.46 % Current number of archived formulas : 0
% 0.10/0.46 % Current number of archived clauses : 75
% 0.10/0.46 % Clause-clause subsumption calls (NU) : 1303
% 0.10/0.46 % Rec. Clause-clause subsumption calls : 861
% 0.10/0.46 % Non-unit clause-clause subsumptions : 109
% 0.10/0.46 % Unit Clause-clause subsumption calls : 94
% 0.10/0.46 % Rewrite failures with RHS unbound : 0
% 0.10/0.46 % BW rewrite match attempts : 29
% 0.10/0.46 % BW rewrite match successes : 17
% 0.10/0.46 % Condensation attempts : 0
% 0.10/0.46 % Condensation successes : 0
% 0.10/0.46 % Termbank termtop insertions : 15553
% 0.10/0.46 % Search garbage collected termcells : 522
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.028 s
% 0.10/0.46 % System time : 0.002 s
% 0.10/0.46 % Total time : 0.030 s
% 0.10/0.46 % Maximum resident set size: 3660 pages
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.116 s
% 0.10/0.46 % System time : 0.019 s
% 0.10/0.46 % Total time : 0.135 s
% 0.10/0.46 % Maximum resident set size: 4864 pages
% 0.10/0.46 % E exiting
%------------------------------------------------------------------------------