%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG073+2 : 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 02:05:44 PM UTC 2026
% Result : Theorem 0.08s 10.66s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 37 ( 16 unt; 0 def)
% Number of atoms : 91 ( 21 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 98 ( 44 ~; 37 |; 11 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mLEASm,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& sdtlseqdt0(X1,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLEASm) ).
fof(m__,conjecture,
sdtpldt0(xR,xS) = sdtpldt0(xP,xP),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mSqrt,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> ( ( sdtasdt0(X1,X1) = sdtasdt0(X2,X2)
& sdtlseqdt0(sz0z00,X2)
& sdtlseqdt0(sz0z00,X1) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSqrt) ).
fof(m__2405,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2405) ).
fof(m__2654,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2654) ).
fof(mMulSc,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> aScalar0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulSc) ).
fof(m__2628,hypothesis,
( sdtlseqdt0(sz0z00,sdtpldt0(xP,xP))
& sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2628) ).
fof(mSumSc,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> aScalar0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSumSc) ).
fof(m__1930,hypothesis,
( xS = sdtasdt0(xF,xD)
& aScalar0(xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1930) ).
fof(m__1892,hypothesis,
( xR = sdtasdt0(xC,xG)
& aScalar0(xR) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1892) ).
fof(m__1911,hypothesis,
( xP = sdtasdt0(xE,xH)
& aScalar0(xP) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1911) ).
fof(c_0_11,plain,
! [X38,X39] :
( X38 = X39
| ~ sdtlseqdt0(X39,X38)
| ~ sdtlseqdt0(X38,X39)
| ~ aScalar0(X39)
| ~ aScalar0(X38) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLEASm])])]) ).
fof(c_0_12,negated_conjecture,
sdtpldt0(xR,xS) != sdtpldt0(xP,xP),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_13,plain,
! [X56,X57] :
( X56 = X57
| sdtasdt0(X56,X56) != sdtasdt0(X57,X57)
| ~ sdtlseqdt0(sz0z00,X57)
| ~ sdtlseqdt0(sz0z00,X56)
| ~ aScalar0(X57)
| ~ aScalar0(X56) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSqrt])])]) ).
cnf(c_0_14,plain,
( ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))),
inference(split_conjunct,[status(thm)],[m__2405]) ).
cnf(c_0_16,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(split_conjunct,[status(thm)],[m__2654]) ).
fof(c_0_17,plain,
! [X17,X18] :
( aScalar0(sdtasdt0(X17,X18))
| ~ aScalar0(X18)
| ~ aScalar0(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulSc])])]) ).
fof(c_0_18,negated_conjecture,
sdtpldt0(xR,xS) != sdtpldt0(xP,xP),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( sdtasdt0(X1,X1) != sdtasdt0(X2,X2)
| ~ sdtlseqdt0(sz0z00,X2)
| ~ sdtlseqdt0(sz0z00,X1)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,hypothesis,
sdtlseqdt0(sz0z00,sdtpldt0(xP,xP)),
inference(split_conjunct,[status(thm)],[m__2628]) ).
cnf(c_0_21,hypothesis,
( ~ aScalar0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)))
| ~ aScalar0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)))
| sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)) = sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_22,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| aScalar0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,negated_conjecture,
sdtpldt0(xR,xS) != sdtpldt0(xP,xP),
inference(fof_nnf,[status(thm)],[c_0_18]) ).
cnf(c_0_24,hypothesis,
( ~ aScalar0(X1)
| ~ aScalar0(sdtpldt0(xP,xP))
| ~ sdtlseqdt0(sz0z00,X1)
| sdtasdt0(X1,X1) != sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))
| X1 = sdtpldt0(xP,xP) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,hypothesis,
( ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)))
| sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)) = sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,hypothesis,
sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)),
inference(split_conjunct,[status(thm)],[m__2628]) ).
cnf(c_0_27,negated_conjecture,
sdtpldt0(xR,xS) != sdtpldt0(xP,xP),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,hypothesis,
( ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),c_0_27]) ).
fof(c_0_29,plain,
! [X15,X16] :
( aScalar0(sdtpldt0(X15,X16))
| ~ aScalar0(X16)
| ~ aScalar0(X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSumSc])])]) ).
cnf(c_0_30,hypothesis,
( ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP)) ),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_31,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| aScalar0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,hypothesis,
aScalar0(xS),
inference(split_conjunct,[status(thm)],[m__1930]) ).
cnf(c_0_33,hypothesis,
aScalar0(xR),
inference(split_conjunct,[status(thm)],[m__1892]) ).
cnf(c_0_34,hypothesis,
~ aScalar0(sdtpldt0(xP,xP)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_35,hypothesis,
aScalar0(xP),
inference(split_conjunct,[status(thm)],[m__1911]) ).
cnf(c_0_36,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_31]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : RNG073+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/10.53 % Computer : n012.cluster.edu
% 0.04/10.53 % Model : x86_64 x86_64
% 0.04/10.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/10.53 % Memory : 8046.5625MB
% 0.04/10.53 % OS : Linux 6.8.0-71-generic
% 0.04/10.53 % CPULimit : 300
% 0.04/10.53 % WCLimit : 300
% 0.04/10.53 % DateTime : Mon Sep 21 04:17:55 UTC 2026
% 0.04/10.53 % CPUTime :
% 0.04/10.53 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/10.56 Running first-order theorem proving
% 0.04/10.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.08/10.66 % Version: 3.5.1
% 0.08/10.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.08/10.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/10.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.08/10.66 % Starting new_bool_3 with 300s (1) cores
% 0.08/10.66 % Starting new_bool_1 with 300s (1) cores
% 0.08/10.66 % Starting sh5l with 300s (1) cores
% 0.08/10.66 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1544889 completed with status 0
% 0.08/10.66 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.08/10.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.08/10.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/10.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.08/10.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/10.66 % No SInE strategy applied
% 0.08/10.66 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.08/10.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/10.66 % Starting SubtermCWHack with 136s (1) cores
% 0.08/10.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.08/10.66 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.08/10.66 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.08/10.66 % Starting new_bool_3 with 136s (1) cores
% 0.08/10.66 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1544896 completed with status 0
% 0.08/10.66 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.08/10.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.08/10.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/10.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.08/10.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/10.66 % No SInE strategy applied
% 0.08/10.66 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.08/10.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/10.66 % Starting SubtermCWHack with 136s (1) cores
% 0.08/10.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.08/10.66 % Preprocessing time : 0.002 s
% 0.08/10.66 % Presaturation interreduction done
% 0.08/10.66
% 0.08/10.66 % Proof found!
% 0.08/10.66 % SZS status Theorem
% 0.08/10.66 % SZS output start CNFRefutation
% See solution above
% 0.08/10.66 % Parsed axioms : 64
% 0.08/10.66 % Removed by relevancy pruning/SinE : 0
% 0.08/10.66 % Initial clauses : 103
% 0.08/10.66 % Removed in clause preprocessing : 5
% 0.08/10.66 % Initial clauses in saturation : 98
% 0.08/10.66 % Processed clauses : 1263
% 0.08/10.66 % ...of these trivial : 71
% 0.08/10.66 % ...subsumed : 466
% 0.08/10.66 % ...remaining for further processing : 726
% 0.08/10.66 % Other redundant clauses eliminated : 6
% 0.08/10.66 % Clauses deleted for lack of memory : 0
% 0.08/10.66 % Backward-subsumed : 28
% 0.08/10.66 % Backward-rewritten : 35
% 0.08/10.66 % Generated clauses : 6968
% 0.08/10.66 % ...of the previous two non-redundant : 5733
% 0.08/10.66 % ...aggressively subsumed : 0
% 0.08/10.66 % Contextual simplify-reflections : 34
% 0.08/10.66 % Paramodulations : 6953
% 0.08/10.66 % Factorizations : 0
% 0.08/10.66 % NegExts : 0
% 0.08/10.66 % Equation resolutions : 15
% 0.08/10.66 % Disequality decompositions : 0
% 0.08/10.66 % Total rewrite steps : 9658
% 0.08/10.66 % ...of those cached : 9489
% 0.08/10.66 % Propositional unsat checks : 0
% 0.08/10.66 % Propositional check models : 0
% 0.08/10.66 % Propositional check unsatisfiable : 0
% 0.08/10.66 % Propositional clauses : 0
% 0.08/10.66 % Propositional clauses after purity: 0
% 0.08/10.66 % Propositional unsat core size : 0
% 0.08/10.66 % Propositional preprocessing time : 0.000
% 0.08/10.66 % Propositional encoding time : 0.000
% 0.08/10.66 % Propositional solver time : 0.000
% 0.08/10.66 % Success case prop preproc time : 0.000
% 0.08/10.66 % Success case prop encoding time : 0.000
% 0.08/10.66 % Success case prop solver time : 0.000
% 0.08/10.66 % Current number of processed clauses : 562
% 0.08/10.66 % Positive orientable unit clauses : 178
% 0.08/10.66 % Positive unorientable unit clauses: 0
% 0.08/10.66 % Negative unit clauses : 5
% 0.08/10.66 % Non-unit-clauses : 379
% 0.08/10.66 % Current number of unprocessed clauses: 4592
% 0.08/10.66 % ...number of literals in the above : 18818
% 0.08/10.66 % Current number of archived formulas : 0
% 0.08/10.66 % Current number of archived clauses : 161
% 0.08/10.66 % Clause-clause subsumption calls (NU) : 21257
% 0.08/10.66 % Rec. Clause-clause subsumption calls : 10865
% 0.08/10.66 % Non-unit clause-clause subsumptions : 476
% 0.08/10.66 % Unit Clause-clause subsumption calls : 1665
% 0.08/10.66 % Rewrite failures with RHS unbound : 0
% 0.08/10.66 % BW rewrite match attempts : 26
% 0.08/10.66 % BW rewrite match successes : 24
% 0.08/10.66 % Condensation attempts : 0
% 0.08/10.66 % Condensation successes : 0
% 0.08/10.66 % Termbank termtop insertions : 126814
% 0.08/10.66 % Search garbage collected termcells : 888
% 0.08/10.66
% 0.08/10.66 % -------------------------------------------------
% 0.08/10.66 % User time : 0.085 s
% 0.08/10.66 % System time : 0.005 s
% 0.08/10.66 % Total time : 0.090 s
% 0.08/10.66 % Maximum resident set size: 3656 pages
% 0.08/10.66
% 0.08/10.66 % -------------------------------------------------
% 0.08/10.66 % User time : 0.408 s
% 0.08/10.66 % System time : 0.035 s
% 0.08/10.66 % Total time : 0.443 s
% 0.08/10.66 % Maximum resident set size: 4864 pages
% 0.08/10.66 % E exiting
%------------------------------------------------------------------------------