%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM435+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 : n019.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.30s 0.70s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 13 unt; 0 def)
% Number of atoms : 67 ( 23 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 70 ( 30 ~; 17 |; 20 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
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__1032,hypothesis,
( sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb))
& aInteger0(xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1032) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aInteger0(X3)
& aInteger0(X2)
& aInteger0(X1) )
=> sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulAsso) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aInteger0(X2)
& aInteger0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
fof(mIntMult,axiom,
! [X1,X2] :
( ( aInteger0(X2)
& aInteger0(X1) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntMult) ).
fof(c_0_6,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
fof(c_0_9,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
inference(fof_simplification,[status(thm)],[m__979]) ).
cnf(c_0_10,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[m__1032]) ).
fof(c_0_12,plain,
! [X18,X19,X20] :
( sdtasdt0(X18,sdtasdt0(X19,X20)) = sdtasdt0(sdtasdt0(X18,X19),X20)
| ~ aInteger0(X20)
| ~ aInteger0(X19)
| ~ aInteger0(X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])])]) ).
fof(c_0_13,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X21,X22] :
( sdtasdt0(X21,X22) = sdtasdt0(X22,X21)
| ~ aInteger0(X22)
| ~ aInteger0(X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
fof(c_0_15,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])])]) ).
cnf(c_0_16,negated_conjecture,
sdtasdt0(sdtasdt0(xp,xq),xm) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
( ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,hypothesis,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[m__1032]) ).
cnf(c_0_19,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,hypothesis,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| aInteger0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_24,plain,
( ~ aInteger0(X1)
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(X3,sdtasdt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_17]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xm,xq)) != sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_19]),c_0_18]),c_0_20])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_21]),c_0_19]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM435+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.48 % Computer : n019.cluster.edu
% 0.19/0.48 % Model : x86_64 x86_64
% 0.19/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.48 % Memory : 8046.5625MB
% 0.19/0.48 % OS : Linux 6.8.0-71-generic
% 0.19/0.48 % CPULimit : 300
% 0.19/0.48 % WCLimit : 300
% 0.19/0.48 % DateTime : Mon Sep 21 02:29:22 UTC 2026
% 0.19/0.48 % CPUTime :
% 0.19/0.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.56 Running first-order theorem proving
% 0.24/0.56 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.30/0.70 % Version: 3.5.1
% 0.30/0.70 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.70 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.70 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.70 % Starting sh5l with 300s (1) cores
% 0.30/0.70 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1493532 completed with status 0
% 0.30/0.70 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.30/0.70 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.70 % No SInE strategy applied
% 0.30/0.70 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.30/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.70 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.30/0.70 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 0.30/0.70 % Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.30/0.70 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.30/0.70 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1493539 completed with status 0
% 0.30/0.70 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.30/0.70 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.70 % No SInE strategy applied
% 0.30/0.70 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.30/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.70 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.30/0.70 % Preprocessing time : 0.003 s
% 0.30/0.70 % Presaturation interreduction done
% 0.30/0.70
% 0.30/0.70 % Proof found!
% 0.30/0.70 % SZS status Theorem
% 0.30/0.70 % SZS output start CNFRefutation
% See solution above
% 0.30/0.70 % Parsed axioms : 26
% 0.30/0.70 % Removed by relevancy pruning/SinE : 0
% 0.30/0.70 % Initial clauses : 43
% 0.30/0.70 % Removed in clause preprocessing : 1
% 0.30/0.70 % Initial clauses in saturation : 42
% 0.30/0.70 % Processed clauses : 636
% 0.30/0.70 % ...of these trivial : 9
% 0.30/0.70 % ...subsumed : 238
% 0.30/0.70 % ...remaining for further processing : 389
% 0.30/0.70 % Other redundant clauses eliminated : 5
% 0.30/0.70 % Clauses deleted for lack of memory : 0
% 0.30/0.70 % Backward-subsumed : 6
% 0.30/0.70 % Backward-rewritten : 6
% 0.30/0.70 % Generated clauses : 2385
% 0.30/0.70 % ...of the previous two non-redundant : 2070
% 0.30/0.70 % ...aggressively subsumed : 0
% 0.30/0.70 % Contextual simplify-reflections : 29
% 0.30/0.70 % Paramodulations : 2380
% 0.30/0.70 % Factorizations : 0
% 0.30/0.70 % NegExts : 0
% 0.30/0.70 % Equation resolutions : 5
% 0.30/0.70 % Disequality decompositions : 0
% 0.30/0.70 % Total rewrite steps : 1715
% 0.30/0.70 % ...of those cached : 1681
% 0.30/0.70 % Propositional unsat checks : 0
% 0.30/0.70 % Propositional check models : 0
% 0.30/0.70 % Propositional check unsatisfiable : 0
% 0.30/0.70 % Propositional clauses : 0
% 0.30/0.70 % Propositional clauses after purity: 0
% 0.30/0.70 % Propositional unsat core size : 0
% 0.30/0.70 % Propositional preprocessing time : 0.000
% 0.30/0.70 % Propositional encoding time : 0.000
% 0.30/0.70 % Propositional solver time : 0.000
% 0.30/0.70 % Success case prop preproc time : 0.000
% 0.30/0.70 % Success case prop encoding time : 0.000
% 0.30/0.70 % Success case prop solver time : 0.000
% 0.30/0.70 % Current number of processed clauses : 333
% 0.30/0.70 % Positive orientable unit clauses : 48
% 0.30/0.70 % Positive unorientable unit clauses: 0
% 0.30/0.70 % Negative unit clauses : 5
% 0.30/0.70 % Non-unit-clauses : 280
% 0.30/0.70 % Current number of unprocessed clauses: 1518
% 0.30/0.70 % ...number of literals in the above : 6344
% 0.30/0.70 % Current number of archived formulas : 0
% 0.30/0.70 % Current number of archived clauses : 54
% 0.30/0.70 % Clause-clause subsumption calls (NU) : 8595
% 0.30/0.70 % Rec. Clause-clause subsumption calls : 7124
% 0.30/0.70 % Non-unit clause-clause subsumptions : 273
% 0.30/0.70 % Unit Clause-clause subsumption calls : 672
% 0.30/0.70 % Rewrite failures with RHS unbound : 0
% 0.30/0.70 % BW rewrite match attempts : 17
% 0.30/0.70 % BW rewrite match successes : 6
% 0.30/0.70 % Condensation attempts : 0
% 0.30/0.70 % Condensation successes : 0
% 0.30/0.70 % Termbank termtop insertions : 42850
% 0.30/0.70 % Search garbage collected termcells : 505
% 0.30/0.70
% 0.30/0.70 % -------------------------------------------------
% 0.30/0.70 % User time : 0.058 s
% 0.30/0.70 % System time : 0.008 s
% 0.30/0.70 % Total time : 0.066 s
% 0.30/0.70 % Maximum resident set size: 3660 pages
% 0.30/0.70
% 0.30/0.70 % -------------------------------------------------
% 0.30/0.70 % User time : 0.249 s
% 0.30/0.70 % System time : 0.033 s
% 0.30/0.70 % Total time : 0.282 s
% 0.30/0.70 % Maximum resident set size: 4608 pages
% 0.30/0.70 % E exiting
%------------------------------------------------------------------------------