%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG059+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:40 PM UTC 2026
% Result : Theorem 0.14s 0.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 65 ( 24 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 71 ( 30 ~; 24 |; 14 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 20 ( 3 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtasdt0(smndt0(xS),xR) = smndt0(xN),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mMNeg,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> ( sdtasdt0(smndt0(X1),X2) = smndt0(sdtasdt0(X1,X2))
& sdtasdt0(X1,smndt0(X2)) = smndt0(sdtasdt0(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMNeg) ).
fof(mArith,axiom,
! [X1,X2,X3] :
( ( aScalar0(X3)
& aScalar0(X2)
& aScalar0(X1) )
=> ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
& sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
& sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
& sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mArith) ).
fof(m__1949,hypothesis,
( xN = sdtasdt0(xR,xS)
& aScalar0(xN) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1949) ).
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(mNegSc,axiom,
! [X1] :
( aScalar0(X1)
=> aScalar0(smndt0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNegSc) ).
fof(c_0_7,negated_conjecture,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,negated_conjecture,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
! [X31,X32] :
( ( ~ aScalar0(X32)
| ~ aScalar0(X31)
| sdtasdt0(smndt0(X31),X32) = smndt0(sdtasdt0(X31,X32)) )
& ( ~ aScalar0(X32)
| ~ aScalar0(X31)
| sdtasdt0(X31,smndt0(X32)) = smndt0(sdtasdt0(X31,X32)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMNeg])])])]) ).
fof(c_0_10,negated_conjecture,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X21,X22,X23] :
( ( ~ aScalar0(X23)
| ~ aScalar0(X22)
| ~ aScalar0(X21)
| sdtasdt0(X21,X22) = sdtasdt0(X22,X21) )
& ( ~ aScalar0(X23)
| ~ aScalar0(X22)
| ~ aScalar0(X21)
| sdtasdt0(sdtasdt0(X21,X22),X23) = sdtasdt0(X21,sdtasdt0(X22,X23)) )
& ( ~ aScalar0(X23)
| ~ aScalar0(X22)
| ~ aScalar0(X21)
| sdtpldt0(X21,X22) = sdtpldt0(X22,X21) )
& ( ~ aScalar0(X23)
| ~ aScalar0(X22)
| ~ aScalar0(X21)
| sdtpldt0(sdtpldt0(X21,X22),X23) = sdtpldt0(X21,sdtpldt0(X22,X23)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mArith])])])]) ).
cnf(c_0_12,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtasdt0(X1,smndt0(X2)) = smndt0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
xN = sdtasdt0(xR,xS),
inference(split_conjunct,[status(thm)],[m__1949]) ).
cnf(c_0_14,hypothesis,
aScalar0(xS),
inference(split_conjunct,[status(thm)],[m__1930]) ).
cnf(c_0_15,hypothesis,
aScalar0(xR),
inference(split_conjunct,[status(thm)],[m__1892]) ).
cnf(c_0_16,negated_conjecture,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,hypothesis,
sdtasdt0(xR,smndt0(xS)) = smndt0(xN),
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])]) ).
fof(c_0_19,plain,
! [X19] :
( aScalar0(smndt0(X19))
| ~ aScalar0(X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mNegSc])])]) ).
cnf(c_0_20,negated_conjecture,
( ~ aScalar0(X1)
| ~ aScalar0(smndt0(xS)) ),
inference(cn,[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_15])]) ).
cnf(c_0_21,plain,
( ~ aScalar0(X1)
| aScalar0(smndt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,negated_conjecture,
~ aScalar0(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_14])]) ).
cnf(c_0_23,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_15,c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG059+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.10/0.36 % Computer : n013.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.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 04:16:06 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.45 % Version: 3.5.1
% 0.14/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % Starting sh5l with 300s (1) cores
% 0.14/0.45 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4117108 completed with status 0
% 0.14/0.45 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.45 % No SInE strategy applied
% 0.14/0.45 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.14/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.45 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.14/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.45 % new_bool_3 with pid 4117121 completed with status 0
% 0.14/0.45 % Result found by new_bool_3
% 0.14/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.45 % No SInE strategy applied
% 0.14/0.45 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.14/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.45 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.14/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.45 % Preprocessing time : 0.002 s
% 0.14/0.45 % Presaturation interreduction done
% 0.14/0.45
% 0.14/0.45 % Proof found!
% 0.14/0.45 % SZS status Theorem
% 0.14/0.45 % SZS output start CNFRefutation
% See solution above
% 0.14/0.45 % Parsed axioms : 58
% 0.14/0.45 % Removed by relevancy pruning/SinE : 0
% 0.14/0.45 % Initial clauses : 96
% 0.14/0.45 % Removed in clause preprocessing : 5
% 0.14/0.45 % Initial clauses in saturation : 91
% 0.14/0.45 % Processed clauses : 188
% 0.14/0.45 % ...of these trivial : 0
% 0.14/0.45 % ...subsumed : 7
% 0.14/0.45 % ...remaining for further processing : 181
% 0.14/0.45 % Other redundant clauses eliminated : 5
% 0.14/0.45 % Clauses deleted for lack of memory : 0
% 0.14/0.45 % Backward-subsumed : 21
% 0.14/0.45 % Backward-rewritten : 2
% 0.14/0.45 % Generated clauses : 197
% 0.14/0.45 % ...of the previous two non-redundant : 139
% 0.14/0.45 % ...aggressively subsumed : 0
% 0.14/0.45 % Contextual simplify-reflections : 0
% 0.14/0.45 % Paramodulations : 174
% 0.14/0.45 % Factorizations : 2
% 0.14/0.45 % NegExts : 0
% 0.14/0.45 % Equation resolutions : 8
% 0.14/0.45 % Disequality decompositions : 0
% 0.14/0.45 % Total rewrite steps : 172
% 0.14/0.45 % ...of those cached : 143
% 0.14/0.45 % Propositional unsat checks : 0
% 0.14/0.45 % Propositional check models : 0
% 0.14/0.45 % Propositional check unsatisfiable : 0
% 0.14/0.45 % Propositional clauses : 0
% 0.14/0.45 % Propositional clauses after purity: 0
% 0.14/0.45 % Propositional unsat core size : 0
% 0.14/0.45 % Propositional preprocessing time : 0.000
% 0.14/0.45 % Propositional encoding time : 0.000
% 0.14/0.45 % Propositional solver time : 0.000
% 0.14/0.45 % Success case prop preproc time : 0.000
% 0.14/0.45 % Success case prop encoding time : 0.000
% 0.14/0.45 % Success case prop solver time : 0.000
% 0.14/0.45 % Current number of processed clauses : 51
% 0.14/0.45 % Positive orientable unit clauses : 32
% 0.14/0.45 % Positive unorientable unit clauses: 0
% 0.14/0.45 % Negative unit clauses : 3
% 0.14/0.45 % Non-unit-clauses : 16
% 0.14/0.45 % Current number of unprocessed clauses: 133
% 0.14/0.45 % ...number of literals in the above : 445
% 0.14/0.45 % Current number of archived formulas : 0
% 0.14/0.45 % Current number of archived clauses : 127
% 0.14/0.45 % Clause-clause subsumption calls (NU) : 1213
% 0.14/0.45 % Rec. Clause-clause subsumption calls : 426
% 0.14/0.45 % Non-unit clause-clause subsumptions : 5
% 0.14/0.45 % Unit Clause-clause subsumption calls : 30
% 0.14/0.45 % Rewrite failures with RHS unbound : 0
% 0.14/0.45 % BW rewrite match attempts : 2
% 0.14/0.45 % BW rewrite match successes : 2
% 0.14/0.45 % Condensation attempts : 0
% 0.14/0.45 % Condensation successes : 0
% 0.14/0.45 % Termbank termtop insertions : 8871
% 0.14/0.45 % Search garbage collected termcells : 913
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.019 s
% 0.14/0.45 % System time : 0.003 s
% 0.14/0.45 % Total time : 0.022 s
% 0.14/0.45 % Maximum resident set size: 3704 pages
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.076 s
% 0.14/0.45 % System time : 0.017 s
% 0.14/0.45 % Total time : 0.093 s
% 0.14/0.45 % Maximum resident set size: 4864 pages
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------