%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM436+3 : 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 : n012.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:05 PM UTC 2026
% Result : Theorem 0.08s 0.43s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 87 ( 25 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 111 ( 45 ~; 33 |; 32 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 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 : 16 ( 0 sgn 6 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ? [X1] :
( sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) ) )
& ( sdteqdtlpzmzozddtrp0(xa,xb,xp)
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ? [X1] :
( sdtasdt0(xp,X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__979,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__979) ).
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/sandbox2/benchmark/theBenchmark.p',m__1071) ).
fof(mIntMult,axiom,
! [X1,X2] :
( ( aInteger0(X2)
& aInteger0(X1) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntMult) ).
fof(m__1032,hypothesis,
( sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb))
& aInteger0(xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1032) ).
fof(c_0_5,negated_conjecture,
~ ( ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ? [X1] :
( sdtasdt0(xq,X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) ) )
& ( sdteqdtlpzmzozddtrp0(xa,xb,xp)
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ? [X1] :
( sdtasdt0(xp,X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
! [X49,X50] :
( ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
& ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| sdtasdt0(xq,X50) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X50) )
& ( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
& ( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
& ( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| sdtasdt0(xq,X50) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X50) )
& ( sdtasdt0(xp,X49) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X49)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) )
& ( sdtasdt0(xp,X49) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X49)
| ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
& ( sdtasdt0(xp,X49) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X49)
| sdtasdt0(xq,X50) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X50) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_7,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
inference(fof_simplification,[status(thm)],[m__979]) ).
cnf(c_0_8,negated_conjecture,
( sdtasdt0(xp,X2) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X2)
| sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[m__1071]) ).
fof(c_0_10,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_11,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( ~ aInteger0(X1)
| ~ aInteger0(sdtasdt0(xq,xm))
| sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| aInteger0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,hypothesis,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[m__1032]) ).
cnf(c_0_15,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( ~ aInteger0(X1)
| sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_17,hypothesis,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[m__1071]) ).
cnf(c_0_18,hypothesis,
~ aInteger0(sdtasdt0(xp,xm)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,hypothesis,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_13]),c_0_14]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM436+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n012.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 02:29:22 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/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
% 0.08/0.42 % Version: 3.5.1
% 0.08/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.42 % Starting sh5l with 300s (1) cores
% 0.08/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1380796 completed with status 0
% 0.08/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.08/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.42 % No SInE strategy applied
% 0.08/0.42 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.08/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.08/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 0.08/0.43 % Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.08/0.43 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.08/0.43 % H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with pid 1380807 completed with status 0
% 0.08/0.43 % Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S
% 0.08/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.43 % No SInE strategy applied
% 0.08/0.43 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.08/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.08/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 0.08/0.43 % Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.08/0.43 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.08/0.43 % Preprocessing time : 0.001 s
% 0.08/0.43 % Presaturation interreduction done
% 0.08/0.43
% 0.08/0.43 % Proof found!
% 0.08/0.43 % SZS status Theorem
% 0.08/0.43 % SZS output start CNFRefutation
% See solution above
% 0.08/0.43 % Parsed axioms : 27
% 0.08/0.43 % Removed by relevancy pruning/SinE : 0
% 0.08/0.43 % Initial clauses : 57
% 0.08/0.43 % Removed in clause preprocessing : 1
% 0.08/0.43 % Initial clauses in saturation : 56
% 0.08/0.43 % Processed clauses : 112
% 0.08/0.43 % ...of these trivial : 1
% 0.08/0.43 % ...subsumed : 0
% 0.08/0.43 % ...remaining for further processing : 111
% 0.08/0.43 % Other redundant clauses eliminated : 0
% 0.08/0.43 % Clauses deleted for lack of memory : 0
% 0.08/0.43 % Backward-subsumed : 4
% 0.08/0.43 % Backward-rewritten : 0
% 0.08/0.43 % Generated clauses : 52
% 0.08/0.43 % ...of the previous two non-redundant : 30
% 0.08/0.43 % ...aggressively subsumed : 0
% 0.08/0.43 % Contextual simplify-reflections : 0
% 0.08/0.43 % Paramodulations : 51
% 0.08/0.43 % Factorizations : 0
% 0.08/0.43 % NegExts : 0
% 0.08/0.43 % Equation resolutions : 1
% 0.08/0.43 % Disequality decompositions : 0
% 0.08/0.43 % Total rewrite steps : 61
% 0.08/0.43 % ...of those cached : 52
% 0.08/0.43 % Propositional unsat checks : 0
% 0.08/0.43 % Propositional check models : 0
% 0.08/0.43 % Propositional check unsatisfiable : 0
% 0.08/0.43 % Propositional clauses : 0
% 0.08/0.43 % Propositional clauses after purity: 0
% 0.08/0.43 % Propositional unsat core size : 0
% 0.08/0.43 % Propositional preprocessing time : 0.000
% 0.08/0.43 % Propositional encoding time : 0.000
% 0.08/0.43 % Propositional solver time : 0.000
% 0.08/0.43 % Success case prop preproc time : 0.000
% 0.08/0.43 % Success case prop encoding time : 0.000
% 0.08/0.43 % Success case prop solver time : 0.000
% 0.08/0.43 % Current number of processed clauses : 51
% 0.08/0.43 % Positive orientable unit clauses : 26
% 0.08/0.43 % Positive unorientable unit clauses: 0
% 0.08/0.43 % Negative unit clauses : 4
% 0.08/0.43 % Non-unit-clauses : 21
% 0.08/0.43 % Current number of unprocessed clauses: 30
% 0.08/0.43 % ...number of literals in the above : 98
% 0.08/0.43 % Current number of archived formulas : 0
% 0.08/0.43 % Current number of archived clauses : 60
% 0.08/0.43 % Clause-clause subsumption calls (NU) : 263
% 0.08/0.43 % Rec. Clause-clause subsumption calls : 143
% 0.08/0.43 % Non-unit clause-clause subsumptions : 4
% 0.08/0.43 % Unit Clause-clause subsumption calls : 29
% 0.08/0.43 % Rewrite failures with RHS unbound : 0
% 0.08/0.43 % BW rewrite match attempts : 4
% 0.08/0.43 % BW rewrite match successes : 0
% 0.08/0.43 % Condensation attempts : 0
% 0.08/0.43 % Condensation successes : 0
% 0.08/0.43 % Termbank termtop insertions : 4760
% 0.08/0.43 % Search garbage collected termcells : 615
% 0.08/0.43
% 0.08/0.43 % -------------------------------------------------
% 0.08/0.43 % User time : 0.007 s
% 0.08/0.43 % System time : 0.005 s
% 0.08/0.43 % Total time : 0.012 s
% 0.08/0.43 % Maximum resident set size: 3664 pages
% 0.08/0.43
% 0.08/0.43 % -------------------------------------------------
% 0.08/0.43 % User time : 0.035 s
% 0.08/0.43 % System time : 0.014 s
% 0.08/0.43 % Total time : 0.049 s
% 0.08/0.43 % Maximum resident set size: 4608 pages
% 0.08/0.43 % E exiting
%------------------------------------------------------------------------------