%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG045+1 : 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:37 PM UTC 2026
% Result : Theorem 0.23s 5.57s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 13 unt; 0 def)
% Number of atoms : 34 ( 13 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 31 ( 14 ~; 9 |; 7 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDistr,axiom,
! [X1,X2,X3] :
( ( aScalar0(X3)
& aScalar0(X2)
& aScalar0(X1) )
=> ( sdtasdt0(sdtpldt0(X1,X2),X3) = sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3))
& sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDistr) ).
fof(m__674,hypothesis,
( aScalar0(xv)
& aScalar0(xu)
& aScalar0(xy)
& aScalar0(xx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__674) ).
fof(m__733,hypothesis,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__733) ).
fof(c_0_4,negated_conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
fof(c_0_7,plain,
! [X23,X24,X25] :
( ( ~ aScalar0(X25)
| ~ aScalar0(X24)
| ~ aScalar0(X23)
| sdtasdt0(sdtpldt0(X23,X24),X25) = sdtpldt0(sdtasdt0(X23,X25),sdtasdt0(X24,X25)) )
& ( ~ aScalar0(X25)
| ~ aScalar0(X24)
| ~ aScalar0(X23)
| sdtasdt0(X23,sdtpldt0(X24,X25)) = sdtpldt0(sdtasdt0(X23,X24),sdtasdt0(X23,X25)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDistr])])])]) ).
cnf(c_0_8,negated_conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
aScalar0(xv),
inference(split_conjunct,[status(thm)],[m__674]) ).
cnf(c_0_11,hypothesis,
aScalar0(xu),
inference(split_conjunct,[status(thm)],[m__674]) ).
cnf(c_0_12,hypothesis,
aScalar0(xy),
inference(split_conjunct,[status(thm)],[m__674]) ).
cnf(c_0_13,negated_conjecture,
sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_14,hypothesis,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))),
inference(split_conjunct,[status(thm)],[m__733]) ).
cnf(c_0_15,hypothesis,
aScalar0(xx),
inference(split_conjunct,[status(thm)],[m__674]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_9]),c_0_14]),c_0_10]),c_0_11]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : RNG045+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/5.46 % Computer : n007.cluster.edu
% 0.17/5.46 % Model : x86_64 x86_64
% 0.17/5.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.46 % Memory : 8046.5625MB
% 0.17/5.46 % OS : Linux 6.8.0-71-generic
% 0.17/5.46 % CPULimit : 300
% 0.17/5.46 % WCLimit : 300
% 0.17/5.46 % DateTime : Mon Sep 21 04:13:25 UTC 2026
% 0.17/5.46 % CPUTime :
% 0.17/5.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/5.52 Running first-order theorem proving
% 0.23/5.52 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.23/5.57 % Version: 3.5.1
% 0.23/5.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/5.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/5.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/5.57 % Starting new_bool_1 with 300s (1) cores
% 0.23/5.57 % Starting sh5l with 300s (1) cores
% 0.23/5.57 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 148948 completed with status 0
% 0.23/5.57 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/5.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/5.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/5.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.57 % No SInE strategy applied
% 0.23/5.57 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.23/5.57 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.57 % Starting SubtermCWHack with 151s (1) cores
% 0.23/5.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 0.23/5.57 % Starting SAT001_MinMin_p005000_rr_RG with 151s (1) cores
% 0.23/5.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 151s (1) cores
% 0.23/5.57 % Starting new_bool_3 with 146s (1) cores
% 0.23/5.57 % SAT001_MinMin_p005000_rr_RG with pid 148954 completed with status 0
% 0.23/5.57 % Result found by SAT001_MinMin_p005000_rr_RG
% 0.23/5.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/5.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/5.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.57 % No SInE strategy applied
% 0.23/5.57 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.23/5.57 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.57 % Starting SubtermCWHack with 151s (1) cores
% 0.23/5.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 0.23/5.57 % Starting SAT001_MinMin_p005000_rr_RG with 151s (1) cores
% 0.23/5.57 % Preprocessing time : 0.002 s
% 0.23/5.57 % Presaturation interreduction done
% 0.23/5.57
% 0.23/5.57 % Proof found!
% 0.23/5.57 % SZS status Theorem
% 0.23/5.57 % SZS output start CNFRefutation
% See solution above
% 0.23/5.58 % Parsed axioms : 18
% 0.23/5.58 % Removed by relevancy pruning/SinE : 0
% 0.23/5.58 % Initial clauses : 34
% 0.23/5.58 % Removed in clause preprocessing : 3
% 0.23/5.58 % Initial clauses in saturation : 31
% 0.23/5.58 % Processed clauses : 67
% 0.23/5.58 % ...of these trivial : 1
% 0.23/5.58 % ...subsumed : 1
% 0.23/5.58 % ...remaining for further processing : 65
% 0.23/5.58 % Other redundant clauses eliminated : 2
% 0.23/5.58 % Clauses deleted for lack of memory : 0
% 0.23/5.58 % Backward-subsumed : 0
% 0.23/5.58 % Backward-rewritten : 1
% 0.23/5.58 % Generated clauses : 77
% 0.23/5.58 % ...of the previous two non-redundant : 58
% 0.23/5.58 % ...aggressively subsumed : 0
% 0.23/5.58 % Contextual simplify-reflections : 0
% 0.23/5.58 % Paramodulations : 74
% 0.23/5.58 % Factorizations : 0
% 0.23/5.58 % NegExts : 0
% 0.23/5.58 % Equation resolutions : 3
% 0.23/5.58 % Disequality decompositions : 0
% 0.23/5.58 % Total rewrite steps : 47
% 0.23/5.58 % ...of those cached : 39
% 0.23/5.58 % Propositional unsat checks : 0
% 0.23/5.58 % Propositional check models : 0
% 0.23/5.58 % Propositional check unsatisfiable : 0
% 0.23/5.58 % Propositional clauses : 0
% 0.23/5.58 % Propositional clauses after purity: 0
% 0.23/5.58 % Propositional unsat core size : 0
% 0.23/5.58 % Propositional preprocessing time : 0.000
% 0.23/5.58 % Propositional encoding time : 0.000
% 0.23/5.58 % Propositional solver time : 0.000
% 0.23/5.58 % Success case prop preproc time : 0.000
% 0.23/5.58 % Success case prop encoding time : 0.000
% 0.23/5.58 % Success case prop solver time : 0.000
% 0.23/5.58 % Current number of processed clauses : 33
% 0.23/5.58 % Positive orientable unit clauses : 9
% 0.23/5.58 % Positive unorientable unit clauses: 0
% 0.23/5.58 % Negative unit clauses : 2
% 0.23/5.58 % Non-unit-clauses : 22
% 0.23/5.58 % Current number of unprocessed clauses: 48
% 0.23/5.58 % ...number of literals in the above : 192
% 0.23/5.58 % Current number of archived formulas : 0
% 0.23/5.58 % Current number of archived clauses : 32
% 0.23/5.58 % Clause-clause subsumption calls (NU) : 123
% 0.23/5.58 % Rec. Clause-clause subsumption calls : 105
% 0.23/5.58 % Non-unit clause-clause subsumptions : 1
% 0.23/5.58 % Unit Clause-clause subsumption calls : 1
% 0.23/5.58 % Rewrite failures with RHS unbound : 0
% 0.23/5.58 % BW rewrite match attempts : 1
% 0.23/5.58 % BW rewrite match successes : 1
% 0.23/5.58 % Condensation attempts : 0
% 0.23/5.58 % Condensation successes : 0
% 0.23/5.58 % Termbank termtop insertions : 3126
% 0.23/5.58 % Search garbage collected termcells : 255
% 0.23/5.58
% 0.23/5.58 % -------------------------------------------------
% 0.23/5.58 % User time : 0.011 s
% 0.23/5.58 % System time : 0.003 s
% 0.23/5.58 % Total time : 0.014 s
% 0.23/5.58 % Maximum resident set size: 3652 pages
% 0.23/5.58
% 0.23/5.58 % -------------------------------------------------
% 0.23/5.58 % User time : 0.026 s
% 0.23/5.58 % System time : 0.016 s
% 0.23/5.58 % Total time : 0.042 s
% 0.23/5.58 % Maximum resident set size: 4608 pages
% 0.23/5.58 % E exiting
%------------------------------------------------------------------------------