%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG061+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 : n007.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:41 PM UTC 2026
% Result : Theorem 0.13s 0.49s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 15 unt; 0 def)
% Number of atoms : 68 ( 23 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 67 ( 28 ~; 23 |; 13 &)
% ( 0 <=>; 3 =>; 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 : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 19 ( 2 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mMulSc,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> aScalar0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulSc) ).
fof(m__,conjecture,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) = sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__2144,hypothesis,
( sdtasdt0(smndt0(xS),smndt0(xS)) = sdtasdt0(xS,xS)
& sdtasdt0(smndt0(xS),xR) = smndt0(xN)
& sdtasdt0(xR,smndt0(xS)) = smndt0(xN) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2144) ).
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(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__1930,hypothesis,
( xS = sdtasdt0(xF,xD)
& aScalar0(xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1930) ).
fof(m__2180,hypothesis,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) = sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2180) ).
fof(c_0_8,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_9,negated_conjecture,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) != sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_10,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| aScalar0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,hypothesis,
sdtasdt0(xR,smndt0(xS)) = smndt0(xN),
inference(split_conjunct,[status(thm)],[m__2144]) ).
cnf(c_0_12,hypothesis,
aScalar0(xR),
inference(split_conjunct,[status(thm)],[m__1892]) ).
fof(c_0_13,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_14,hypothesis,
sdtasdt0(smndt0(xS),smndt0(xS)) = sdtasdt0(xS,xS),
inference(split_conjunct,[status(thm)],[m__2144]) ).
fof(c_0_15,negated_conjecture,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) != sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),
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,hypothesis,
( ~ aScalar0(smndt0(xS))
| aScalar0(smndt0(xN)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_18,plain,
( ~ aScalar0(X1)
| aScalar0(smndt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,hypothesis,
aScalar0(xS),
inference(split_conjunct,[status(thm)],[m__1930]) ).
cnf(c_0_20,hypothesis,
( ~ aScalar0(smndt0(xS))
| aScalar0(sdtasdt0(xS,xS)) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
fof(c_0_21,negated_conjecture,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) != sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),
inference(fof_nnf,[status(thm)],[c_0_15]) ).
cnf(c_0_22,hypothesis,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) = sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS))),
inference(split_conjunct,[status(thm)],[m__2180]) ).
cnf(c_0_23,plain,
( ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,hypothesis,
aScalar0(smndt0(xN)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_25,hypothesis,
aScalar0(sdtasdt0(xS,xS)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_18]),c_0_19])]) ).
cnf(c_0_26,negated_conjecture,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) != sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,hypothesis,
~ aScalar0(X1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_28,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_12,c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG061+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 : n007.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:14:50 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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.13/0.49 % Version: 3.5.1
% 0.13/0.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.49 % Starting sh5l with 300s (1) cores
% 0.13/0.49 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 151781 completed with status 0
% 0.13/0.49 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.13/0.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.49 % No SInE strategy applied
% 0.13/0.49 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.13/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/0.49 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.13/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.13/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.49 % new_bool_3 with pid 151790 completed with status 0
% 0.13/0.49 % Result found by new_bool_3
% 0.13/0.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.49 % No SInE strategy applied
% 0.13/0.49 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.13/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/0.49 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.13/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.13/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.49 % Preprocessing time : 0.004 s
% 0.13/0.49 % Presaturation interreduction done
% 0.13/0.49
% 0.13/0.49 % Proof found!
% 0.13/0.49 % SZS status Theorem
% 0.13/0.49 % SZS output start CNFRefutation
% See solution above
% 0.13/0.49 % Parsed axioms : 60
% 0.13/0.49 % Removed by relevancy pruning/SinE : 0
% 0.13/0.49 % Initial clauses : 100
% 0.13/0.49 % Removed in clause preprocessing : 5
% 0.13/0.49 % Initial clauses in saturation : 95
% 0.13/0.49 % Processed clauses : 198
% 0.13/0.49 % ...of these trivial : 2
% 0.13/0.49 % ...subsumed : 6
% 0.13/0.49 % ...remaining for further processing : 190
% 0.13/0.49 % Other redundant clauses eliminated : 5
% 0.13/0.49 % Clauses deleted for lack of memory : 0
% 0.13/0.49 % Backward-subsumed : 21
% 0.13/0.49 % Backward-rewritten : 4
% 0.13/0.49 % Generated clauses : 194
% 0.13/0.49 % ...of the previous two non-redundant : 141
% 0.13/0.49 % ...aggressively subsumed : 0
% 0.13/0.49 % Contextual simplify-reflections : 0
% 0.13/0.49 % Paramodulations : 169
% 0.13/0.49 % Factorizations : 2
% 0.13/0.49 % NegExts : 0
% 0.13/0.49 % Equation resolutions : 8
% 0.13/0.49 % Disequality decompositions : 0
% 0.13/0.49 % Total rewrite steps : 170
% 0.13/0.49 % ...of those cached : 143
% 0.13/0.49 % Propositional unsat checks : 0
% 0.13/0.49 % Propositional check models : 0
% 0.13/0.49 % Propositional check unsatisfiable : 0
% 0.13/0.49 % Propositional clauses : 0
% 0.13/0.49 % Propositional clauses after purity: 0
% 0.13/0.49 % Propositional unsat core size : 0
% 0.13/0.49 % Propositional preprocessing time : 0.000
% 0.13/0.49 % Propositional encoding time : 0.000
% 0.13/0.49 % Propositional solver time : 0.000
% 0.13/0.49 % Success case prop preproc time : 0.000
% 0.13/0.49 % Success case prop encoding time : 0.000
% 0.13/0.49 % Success case prop solver time : 0.000
% 0.13/0.49 % Current number of processed clauses : 52
% 0.13/0.49 % Positive orientable unit clauses : 35
% 0.13/0.49 % Positive unorientable unit clauses: 0
% 0.13/0.49 % Negative unit clauses : 3
% 0.13/0.49 % Non-unit-clauses : 14
% 0.13/0.49 % Current number of unprocessed clauses: 133
% 0.13/0.49 % ...number of literals in the above : 425
% 0.13/0.49 % Current number of archived formulas : 0
% 0.13/0.49 % Current number of archived clauses : 135
% 0.13/0.49 % Clause-clause subsumption calls (NU) : 1668
% 0.13/0.49 % Rec. Clause-clause subsumption calls : 693
% 0.13/0.49 % Non-unit clause-clause subsumptions : 4
% 0.13/0.49 % Unit Clause-clause subsumption calls : 41
% 0.13/0.49 % Rewrite failures with RHS unbound : 0
% 0.13/0.49 % BW rewrite match attempts : 5
% 0.13/0.49 % BW rewrite match successes : 5
% 0.13/0.49 % Condensation attempts : 0
% 0.13/0.49 % Condensation successes : 0
% 0.13/0.49 % Termbank termtop insertions : 9162
% 0.13/0.49 % Search garbage collected termcells : 888
% 0.13/0.49
% 0.13/0.49 % -------------------------------------------------
% 0.13/0.49 % User time : 0.023 s
% 0.13/0.49 % System time : 0.009 s
% 0.13/0.49 % Total time : 0.031 s
% 0.13/0.49 % Maximum resident set size: 3704 pages
% 0.13/0.49
% 0.13/0.49 % -------------------------------------------------
% 0.13/0.49 % User time : 0.115 s
% 0.13/0.49 % System time : 0.026 s
% 0.13/0.49 % Total time : 0.142 s
% 0.13/0.49 % Maximum resident set size: 4608 pages
% 0.13/0.49 % E exiting
%------------------------------------------------------------------------------