%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG070+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 : n013.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.15s 0.70s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 14 unt; 0 def)
% Number of atoms : 43 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 19 ~; 12 |; 5 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__2590,hypothesis,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2590) ).
fof(mLETot,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> ( sdtlseqdt0(X2,X1)
| sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLETot) ).
fof(mSumSc,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> aScalar0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSumSc) ).
fof(m__1911,hypothesis,
( xP = sdtasdt0(xE,xH)
& aScalar0(xP) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1911) ).
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(c_0_7,negated_conjecture,
~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,negated_conjecture,
~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,hypothesis,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
inference(fof_simplification,[status(thm)],[m__2590]) ).
fof(c_0_10,negated_conjecture,
~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X51,X52] :
( sdtlseqdt0(X52,X51)
| sdtlseqdt0(X51,X52)
| ~ aScalar0(X52)
| ~ aScalar0(X51) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLETot])])]) ).
fof(c_0_12,hypothesis,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtlseqdt0(X2,X1)
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,hypothesis,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,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_17,negated_conjecture,
( ~ aScalar0(sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| aScalar0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,hypothesis,
aScalar0(xP),
inference(split_conjunct,[status(thm)],[m__1911]) ).
cnf(c_0_20,negated_conjecture,
~ aScalar0(sdtpldt0(xR,xS)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_21,hypothesis,
aScalar0(xS),
inference(split_conjunct,[status(thm)],[m__1930]) ).
cnf(c_0_22,hypothesis,
aScalar0(xR),
inference(split_conjunct,[status(thm)],[m__1892]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_18]),c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG070+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.58 % Computer : n013.cluster.edu
% 0.09/0.58 % Model : x86_64 x86_64
% 0.09/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.58 % Memory : 8046.5625MB
% 0.09/0.58 % OS : Linux 6.8.0-71-generic
% 0.09/0.59 % CPULimit : 300
% 0.09/0.59 % WCLimit : 300
% 0.09/0.59 % DateTime : Mon Sep 21 04:17:08 UTC 2026
% 0.09/0.59 % CPUTime :
% 0.09/0.59 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.65 Running first-order theorem proving
% 0.15/0.65 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.15/0.70 % Version: 3.5.1
% 0.15/0.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.70 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.70 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.70 % Starting sh5l with 300s (1) cores
% 0.15/0.70 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4119090 completed with status 0
% 0.15/0.70 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.70 % No SInE strategy applied
% 0.15/0.70 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.15/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.70 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.70 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.15/0.70 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.15/0.70 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.70 % new_bool_3 with pid 4119098 completed with status 0
% 0.15/0.70 % Result found by new_bool_3
% 0.15/0.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.70 % No SInE strategy applied
% 0.15/0.70 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.15/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.70 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.70 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.15/0.70 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.15/0.70 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.70 % Preprocessing time : 0.004 s
% 0.15/0.70 % Presaturation interreduction done
% 0.15/0.70
% 0.15/0.70 % Proof found!
% 0.15/0.70 % SZS status Theorem
% 0.15/0.70 % SZS output start CNFRefutation
% See solution above
% 0.15/0.70 % Parsed axioms : 61
% 0.15/0.70 % Removed by relevancy pruning/SinE : 0
% 0.15/0.70 % Initial clauses : 99
% 0.15/0.70 % Removed in clause preprocessing : 5
% 0.15/0.70 % Initial clauses in saturation : 94
% 0.15/0.70 % Processed clauses : 187
% 0.15/0.70 % ...of these trivial : 1
% 0.15/0.70 % ...subsumed : 7
% 0.15/0.70 % ...remaining for further processing : 179
% 0.15/0.70 % Other redundant clauses eliminated : 5
% 0.15/0.70 % Clauses deleted for lack of memory : 0
% 0.15/0.70 % Backward-subsumed : 1
% 0.15/0.70 % Backward-rewritten : 0
% 0.15/0.70 % Generated clauses : 93
% 0.15/0.70 % ...of the previous two non-redundant : 57
% 0.15/0.70 % ...aggressively subsumed : 0
% 0.15/0.70 % Contextual simplify-reflections : 0
% 0.15/0.70 % Paramodulations : 84
% 0.15/0.70 % Factorizations : 2
% 0.15/0.70 % NegExts : 0
% 0.15/0.70 % Equation resolutions : 7
% 0.15/0.70 % Disequality decompositions : 0
% 0.15/0.70 % Total rewrite steps : 96
% 0.15/0.70 % ...of those cached : 73
% 0.15/0.70 % Propositional unsat checks : 0
% 0.15/0.70 % Propositional check models : 0
% 0.15/0.70 % Propositional check unsatisfiable : 0
% 0.15/0.70 % Propositional clauses : 0
% 0.15/0.70 % Propositional clauses after purity: 0
% 0.15/0.70 % Propositional unsat core size : 0
% 0.15/0.70 % Propositional preprocessing time : 0.000
% 0.15/0.70 % Propositional encoding time : 0.000
% 0.15/0.70 % Propositional solver time : 0.000
% 0.15/0.70 % Success case prop preproc time : 0.000
% 0.15/0.70 % Success case prop encoding time : 0.000
% 0.15/0.70 % Success case prop solver time : 0.000
% 0.15/0.70 % Current number of processed clauses : 81
% 0.15/0.70 % Positive orientable unit clauses : 45
% 0.15/0.70 % Positive unorientable unit clauses: 0
% 0.15/0.70 % Negative unit clauses : 4
% 0.15/0.70 % Non-unit-clauses : 32
% 0.15/0.70 % Current number of unprocessed clauses: 58
% 0.15/0.70 % ...number of literals in the above : 218
% 0.15/0.70 % Current number of archived formulas : 0
% 0.15/0.70 % Current number of archived clauses : 95
% 0.15/0.70 % Clause-clause subsumption calls (NU) : 1101
% 0.15/0.70 % Rec. Clause-clause subsumption calls : 378
% 0.15/0.70 % Non-unit clause-clause subsumptions : 5
% 0.15/0.70 % Unit Clause-clause subsumption calls : 11
% 0.15/0.70 % Rewrite failures with RHS unbound : 0
% 0.15/0.70 % BW rewrite match attempts : 0
% 0.15/0.70 % BW rewrite match successes : 0
% 0.15/0.70 % Condensation attempts : 0
% 0.15/0.70 % Condensation successes : 0
% 0.15/0.70 % Termbank termtop insertions : 7903
% 0.15/0.70 % Search garbage collected termcells : 909
% 0.15/0.70
% 0.15/0.70 % -------------------------------------------------
% 0.15/0.70 % User time : 0.022 s
% 0.15/0.70 % System time : 0.006 s
% 0.15/0.70 % Total time : 0.028 s
% 0.15/0.70 % Maximum resident set size: 3960 pages
% 0.15/0.70
% 0.15/0.70 % -------------------------------------------------
% 0.15/0.70 % User time : 0.110 s
% 0.15/0.70 % System time : 0.023 s
% 0.15/0.70 % Total time : 0.133 s
% 0.15/0.70 % Maximum resident set size: 4864 pages
% 0.15/0.70 % E exiting
%------------------------------------------------------------------------------