%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : RNG123+4 : 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 : 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:29 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 14 unt; 0 def)
% Number of atoms : 123 ( 28 equ)
% Maximal formula atoms : 33 ( 3 avg)
% Number of connectives : 125 ( 34 ~; 32 |; 50 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 10 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn 29 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__2690,hypothesis,
( aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)
& ? [X1,X2] :
( sdtpldt0(X1,X2) = smndt0(sdtasdt0(xq,xu))
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2690) ).
fof(m__2174,hypothesis,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ! [X1] :
( aElementOf0(X1,xI)
<=> ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) ) )
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xb))
<=> ? [X2] :
( sdtasdt0(xb,X2) = X1
& aElement0(X2) ) )
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xa))
<=> ? [X2] :
( sdtasdt0(xa,X2) = X1
& aElement0(X2) ) )
& aIdeal0(xI)
& ! [X1] :
( aElementOf0(X1,xI)
=> ( ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xI) )
& ! [X2] :
( aElementOf0(X2,xI)
=> aElementOf0(sdtpldt0(X1,X2),xI) ) ) )
& aSet0(xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2174) ).
fof(m__2718,hypothesis,
xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2718) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddComm) ).
fof(m__2699,hypothesis,
( aElementOf0(xb,xI)
& ? [X1,X2] :
( sdtpldt0(X1,X2) = xb
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) )
& ? [X1,X2] :
( sdtpldt0(X1,X2) = xb
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2699) ).
fof(m__,conjecture,
( aElementOf0(xr,xI)
| ? [X1,X2] :
( sdtpldt0(X1,X2) = xr
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__2091,hypothesis,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2091) ).
fof(c_0_8,plain,
! [X34,X35] :
( aElement0(X35)
| ~ aElementOf0(X35,X34)
| ~ aSet0(X34) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_9,hypothesis,
( aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)
& sdtpldt0(esk42_0,esk43_0) = smndt0(sdtasdt0(xq,xu))
& aElementOf0(esk43_0,slsdtgt0(xb))
& aElementOf0(esk42_0,slsdtgt0(xa)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2690])]) ).
fof(c_0_10,hypothesis,
! [X122,X123,X124,X125,X127,X128,X129,X131,X132,X133,X136,X137,X138] :
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ( aElementOf0(X136,xI)
| sdtpldt0(X137,X138) != X136
| ~ aElementOf0(X138,slsdtgt0(xb))
| ~ aElementOf0(X137,slsdtgt0(xa)) )
& ( ~ aElementOf0(X133,xI)
| sdtpldt0(esk26_1(X133),esk27_1(X133)) = X133 )
& ( ~ aElementOf0(X133,xI)
| aElementOf0(esk27_1(X133),slsdtgt0(xb)) )
& ( ~ aElementOf0(X133,xI)
| aElementOf0(esk26_1(X133),slsdtgt0(xa)) )
& ( aElementOf0(X131,slsdtgt0(xb))
| sdtasdt0(xb,X132) != X131
| ~ aElement0(X132) )
& ( ~ aElementOf0(X129,slsdtgt0(xb))
| sdtasdt0(xb,esk25_1(X129)) = X129 )
& ( ~ aElementOf0(X129,slsdtgt0(xb))
| aElement0(esk25_1(X129)) )
& ( aElementOf0(X127,slsdtgt0(xa))
| sdtasdt0(xa,X128) != X127
| ~ aElement0(X128) )
& ( ~ aElementOf0(X125,slsdtgt0(xa))
| sdtasdt0(xa,esk24_1(X125)) = X125 )
& ( ~ aElementOf0(X125,slsdtgt0(xa))
| aElement0(esk24_1(X125)) )
& aIdeal0(xI)
& ( ~ aElementOf0(X122,xI)
| aElementOf0(sdtasdt0(X124,X122),xI)
| ~ aElement0(X124) )
& ( ~ aElementOf0(X122,xI)
| aElementOf0(sdtpldt0(X122,X123),xI)
| ~ aElementOf0(X123,xI) )
& aSet0(xI) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2174])])])])])])]) ).
cnf(c_0_11,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,hypothesis,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
aSet0(xI),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,hypothesis,
xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(split_conjunct,[status(thm)],[m__2718]) ).
cnf(c_0_15,hypothesis,
sdtpldt0(esk42_0,esk43_0) = smndt0(sdtasdt0(xq,xu)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X13,X14] :
( sdtpldt0(X13,X14) = sdtpldt0(X14,X13)
| ~ aElement0(X14)
| ~ aElement0(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])])]) ).
cnf(c_0_17,hypothesis,
aElement0(smndt0(sdtasdt0(xq,xu))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
fof(c_0_18,hypothesis,
( aElementOf0(xb,xI)
& ? [X1,X2] :
( sdtpldt0(X1,X2) = xb
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
inference(fof_simplification,[status(thm)],[m__2699]) ).
fof(c_0_19,negated_conjecture,
~ ( aElementOf0(xr,xI)
| ? [X1,X2] :
( sdtpldt0(X1,X2) = xr
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_20,hypothesis,
sdtpldt0(sdtpldt0(esk42_0,esk43_0),xb) = xr,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,hypothesis,
aElement0(sdtpldt0(esk42_0,esk43_0)),
inference(rw,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_23,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
fof(c_0_24,hypothesis,
( aElementOf0(xb,xI)
& sdtpldt0(esk44_0,esk45_0) = xb
& aElementOf0(esk45_0,slsdtgt0(xb))
& aElementOf0(esk44_0,slsdtgt0(xa)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_18])]) ).
fof(c_0_25,negated_conjecture,
! [X167,X168] :
( ~ aElementOf0(xr,xI)
& ( sdtpldt0(X167,X168) != xr
| ~ aElementOf0(X168,slsdtgt0(xb))
| ~ aElementOf0(X167,slsdtgt0(xa)) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
cnf(c_0_26,hypothesis,
( ~ aElementOf0(X2,xI)
| ~ aElementOf0(X1,xI)
| aElementOf0(sdtpldt0(X2,X1),xI) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_27,hypothesis,
sdtpldt0(xb,sdtpldt0(esk42_0,esk43_0)) = xr,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_28,hypothesis,
aElementOf0(xb,xI),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,hypothesis,
aElementOf0(sdtpldt0(esk42_0,esk43_0),xI),
inference(rw,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_30,negated_conjecture,
~ aElementOf0(xr,xI),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG123+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n015.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:25:06 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 549628 completed with status 0
% 0.10/0.44 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.10/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.44 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.10/0.44 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.10/0.44 % SubtermCWHack with pid 549638 completed with status 0
% 0.10/0.44 % Result found by SubtermCWHack
% 0.10/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Preprocessing time : 0.002 s
% 0.10/0.44
% 0.10/0.44 % Proof found!
% 0.10/0.44 % SZS status Theorem
% 0.10/0.44 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 55
% 0.10/0.44 % Removed by relevancy pruning/SinE : 0
% 0.10/0.44 % Initial clauses : 212
% 0.10/0.44 % Removed in clause preprocessing : 4
% 0.10/0.44 % Initial clauses in saturation : 208
% 0.10/0.44 % Processed clauses : 294
% 0.10/0.44 % ...of these trivial : 7
% 0.10/0.44 % ...subsumed : 75
% 0.10/0.44 % ...remaining for further processing : 212
% 0.10/0.44 % Other redundant clauses eliminated : 11
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 6
% 0.10/0.44 % Backward-rewritten : 21
% 0.10/0.44 % Generated clauses : 356
% 0.10/0.44 % ...of the previous two non-redundant : 204
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 2
% 0.10/0.44 % Paramodulations : 345
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 11
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 435
% 0.10/0.44 % ...of those cached : 381
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 178
% 0.10/0.44 % Positive orientable unit clauses : 78
% 0.10/0.44 % Positive unorientable unit clauses: 0
% 0.10/0.44 % Negative unit clauses : 11
% 0.10/0.44 % Non-unit-clauses : 89
% 0.10/0.44 % Current number of unprocessed clauses: 114
% 0.10/0.44 % ...number of literals in the above : 504
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 27
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 1055
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 947
% 0.10/0.44 % Non-unit clause-clause subsumptions : 69
% 0.10/0.44 % Unit Clause-clause subsumption calls : 40
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 17
% 0.10/0.44 % BW rewrite match successes : 17
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 16095
% 0.10/0.44 % Search garbage collected termcells : 2715
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.018 s
% 0.10/0.44 % System time : 0.005 s
% 0.10/0.44 % Total time : 0.022 s
% 0.10/0.44 % Maximum resident set size: 3976 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.051 s
% 0.10/0.44 % System time : 0.020 s
% 0.10/0.44 % Total time : 0.071 s
% 0.10/0.44 % Maximum resident set size: 4864 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------