%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : RNG077+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:06:18 PM UTC 2026
% Result : Theorem 0.15s 0.70s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 16 unt; 0 def)
% Number of atoms : 85 ( 29 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 90 ( 39 ~; 32 |; 15 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 28 ( 2 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/benchmark/theBenchmark.p',mMNeg) ).
fof(m__,conjecture,
sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) = sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mMulSc,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> aScalar0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulSc) ).
fof(m__1911,hypothesis,
( xP = sdtasdt0(xE,xH)
& aScalar0(xP) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1911) ).
fof(m__1873,hypothesis,
( xH = sdtasdt0(xA,xB)
& aScalar0(xH) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1873) ).
fof(m__1820,hypothesis,
( xE = sdtasasdt0(xp,xq)
& aScalar0(xE) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1820) ).
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/sandbox/benchmark/theBenchmark.p',mArith) ).
fof(mNegSc,axiom,
! [X1] :
( aScalar0(X1)
=> aScalar0(smndt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNegSc) ).
fof(c_0_8,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_9,negated_conjecture,
sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_10,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])])]) ).
cnf(c_0_11,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtasdt0(X1,smndt0(X2)) = smndt0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,hypothesis,
xP = sdtasdt0(xE,xH),
inference(split_conjunct,[status(thm)],[m__1911]) ).
cnf(c_0_13,hypothesis,
aScalar0(xH),
inference(split_conjunct,[status(thm)],[m__1873]) ).
cnf(c_0_14,hypothesis,
aScalar0(xE),
inference(split_conjunct,[status(thm)],[m__1820]) ).
fof(c_0_15,negated_conjecture,
sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_16,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_17,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| aScalar0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,hypothesis,
sdtasdt0(xE,smndt0(xH)) = smndt0(xP),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).
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])])]) ).
fof(c_0_20,negated_conjecture,
sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
inference(fof_nnf,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,hypothesis,
( ~ aScalar0(smndt0(xH))
| aScalar0(smndt0(xP)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14])]) ).
cnf(c_0_23,plain,
( ~ aScalar0(X1)
| aScalar0(smndt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,hypothesis,
( ~ aScalar0(X1)
| sdtasdt0(xH,xE) = xP ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_21]),c_0_14]),c_0_13])]) ).
cnf(c_0_26,hypothesis,
aScalar0(smndt0(xP)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_13])]) ).
cnf(c_0_27,negated_conjecture,
sdtpldt0(xP,sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))) != sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)),
inference(rw,[status(thm)],[c_0_24,c_0_12]) ).
cnf(c_0_28,hypothesis,
sdtasdt0(xH,xE) = xP,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(xP,sdtpldt0(xP,sdtasdt0(xH,xH))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
( ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_31,hypothesis,
aScalar0(xP),
inference(split_conjunct,[status(thm)],[m__1911]) ).
cnf(c_0_32,negated_conjecture,
~ aScalar0(sdtasdt0(xH,xH)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_17]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG077+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.58 % Computer : n015.cluster.edu
% 0.12/0.58 % Model : x86_64 x86_64
% 0.12/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.58 % Memory : 8046.5625MB
% 0.12/0.58 % OS : Linux 6.8.0-71-generic
% 0.12/0.58 % CPULimit : 300
% 0.12/0.58 % WCLimit : 300
% 0.12/0.58 % DateTime : Mon Sep 21 04:21:22 UTC 2026
% 0.12/0.58 % CPUTime :
% 0.12/0.58 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.63 Running first-order theorem proving
% 0.15/0.63 Running: /export/starexec/sandbox/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/sandbox/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 542745 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 542753 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 : 59
% 0.15/0.70 % Removed by relevancy pruning/SinE : 0
% 0.15/0.70 % Initial clauses : 97
% 0.15/0.70 % Removed in clause preprocessing : 5
% 0.15/0.70 % Initial clauses in saturation : 92
% 0.15/0.70 % Processed clauses : 206
% 0.15/0.70 % ...of these trivial : 1
% 0.15/0.70 % ...subsumed : 9
% 0.15/0.70 % ...remaining for further processing : 196
% 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 : 3
% 0.15/0.70 % Backward-rewritten : 1
% 0.15/0.70 % Generated clauses : 294
% 0.15/0.70 % ...of the previous two non-redundant : 230
% 0.15/0.70 % ...aggressively subsumed : 0
% 0.15/0.70 % Contextual simplify-reflections : 0
% 0.15/0.70 % Paramodulations : 284
% 0.15/0.70 % Factorizations : 2
% 0.15/0.70 % NegExts : 0
% 0.15/0.70 % Equation resolutions : 8
% 0.15/0.70 % Disequality decompositions : 0
% 0.15/0.70 % Total rewrite steps : 269
% 0.15/0.70 % ...of those cached : 233
% 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 : 97
% 0.15/0.70 % Positive orientable unit clauses : 50
% 0.15/0.70 % Positive unorientable unit clauses: 0
% 0.15/0.70 % Negative unit clauses : 4
% 0.15/0.70 % Non-unit-clauses : 43
% 0.15/0.70 % Current number of unprocessed clauses: 205
% 0.15/0.70 % ...number of literals in the above : 716
% 0.15/0.70 % Current number of archived formulas : 0
% 0.15/0.70 % Current number of archived clauses : 96
% 0.15/0.70 % Clause-clause subsumption calls (NU) : 1825
% 0.15/0.70 % Rec. Clause-clause subsumption calls : 652
% 0.15/0.70 % Non-unit clause-clause subsumptions : 4
% 0.15/0.70 % Unit Clause-clause subsumption calls : 16
% 0.15/0.70 % Rewrite failures with RHS unbound : 0
% 0.15/0.70 % BW rewrite match attempts : 4
% 0.15/0.70 % BW rewrite match successes : 4
% 0.15/0.70 % Condensation attempts : 0
% 0.15/0.70 % Condensation successes : 0
% 0.15/0.70 % Termbank termtop insertions : 10787
% 0.15/0.70 % Search garbage collected termcells : 909
% 0.15/0.70
% 0.15/0.70 % -------------------------------------------------
% 0.15/0.70 % User time : 0.034 s
% 0.15/0.70 % System time : 0.005 s
% 0.15/0.70 % Total time : 0.039 s
% 0.15/0.70 % Maximum resident set size: 3704 pages
% 0.15/0.70
% 0.15/0.70 % -------------------------------------------------
% 0.15/0.70 % User time : 0.146 s
% 0.15/0.70 % System time : 0.024 s
% 0.15/0.70 % Total time : 0.169 s
% 0.15/0.70 % Maximum resident set size: 4608 pages
% 0.15/0.70 % E exiting
%------------------------------------------------------------------------------