%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG116+1 : 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 : n003.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:54 PM UTC 2026
% Result : Theorem 0.24s 0.64s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 10 unt; 0 def)
% Number of atoms : 81 ( 26 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 98 ( 40 ~; 40 |; 15 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 30 ( 0 sgn 12 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefPrIdeal,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( X2 = slsdtgt0(X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4] :
( sdtasdt0(X1,X4) = X3
& aElement0(X4) ) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefPrIdeal) ).
fof(m__,conjecture,
? [X1,X2] :
( xu = sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2))
& aElement0(X2)
& aElement0(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__2456,hypothesis,
( xu = sdtpldt0(xk,xl)
& aElementOf0(xl,slsdtgt0(xb))
& aElementOf0(xk,slsdtgt0(xa)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2456) ).
fof(m__2091,hypothesis,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2091) ).
fof(c_0_4,plain,
! [X105,X106,X107,X109,X110,X111,X113] :
( ( ~ aElement0(X105)
| X111 = slsdtgt0(X105)
| ~ aSet0(X111)
| aElementOf0(esk19_2(X105,X111),X111)
| sdtasdt0(X105,esk20_2(X105,X111)) = esk19_2(X105,X111) )
& ( ~ aElement0(X105)
| X111 = slsdtgt0(X105)
| ~ aSet0(X111)
| aElementOf0(esk19_2(X105,X111),X111)
| aElement0(esk20_2(X105,X111)) )
& ( ~ aElement0(X105)
| X111 = slsdtgt0(X105)
| ~ aSet0(X111)
| sdtasdt0(X105,X113) != esk19_2(X105,X111)
| ~ aElement0(X113)
| ~ aElementOf0(esk19_2(X105,X111),X111) )
& ( ~ aElement0(X105)
| X106 != slsdtgt0(X105)
| aElementOf0(X109,X106)
| sdtasdt0(X105,X110) != X109
| ~ aElement0(X110) )
& ( ~ aElement0(X105)
| X106 != slsdtgt0(X105)
| ~ aElementOf0(X107,X106)
| sdtasdt0(X105,esk18_3(X105,X106,X107)) = X107 )
& ( ~ aElement0(X105)
| X106 != slsdtgt0(X105)
| ~ aElementOf0(X107,X106)
| aElement0(esk18_3(X105,X106,X107)) )
& ( ~ aElement0(X105)
| X106 != slsdtgt0(X105)
| aSet0(X106) ) ),
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)],[mDefPrIdeal])])])])])])]) ).
fof(c_0_5,negated_conjecture,
~ ? [X1,X2] :
( xu = sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2))
& aElement0(X2)
& aElement0(X1) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_6,plain,
( ~ aElement0(X1)
| X2 != slsdtgt0(X1)
| ~ aElementOf0(X3,X2)
| sdtasdt0(X1,esk18_3(X1,X2,X3)) = X3 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( ~ aElement0(X1)
| X2 != slsdtgt0(X1)
| ~ aElementOf0(X3,X2)
| aElement0(esk18_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
! [X118,X119] :
( xu != sdtpldt0(sdtasdt0(xa,X118),sdtasdt0(xb,X119))
| ~ aElement0(X119)
| ~ aElement0(X118) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( ~ aElement0(X1)
| ~ aElementOf0(X2,slsdtgt0(X1))
| sdtasdt0(X1,esk18_3(X1,slsdtgt0(X1),X2)) = X2 ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
aElementOf0(xl,slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[m__2456]) ).
cnf(c_0_11,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_12,plain,
( ~ aElement0(X1)
| ~ aElementOf0(X2,slsdtgt0(X1))
| aElement0(esk18_3(X1,slsdtgt0(X1),X2)) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( xu != sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,hypothesis,
sdtasdt0(xb,esk18_3(xb,slsdtgt0(xb),xl)) = xl,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_15,hypothesis,
aElement0(esk18_3(xb,slsdtgt0(xb),xl)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_10]),c_0_11])]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xk,slsdtgt0(xa)),
inference(split_conjunct,[status(thm)],[m__2456]) ).
cnf(c_0_17,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_18,negated_conjecture,
( ~ aElement0(X1)
| sdtpldt0(sdtasdt0(xa,X1),xl) != xu ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_19,hypothesis,
sdtasdt0(xa,esk18_3(xa,slsdtgt0(xa),xk)) = xk,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_16]),c_0_17])]) ).
cnf(c_0_20,hypothesis,
xu = sdtpldt0(xk,xl),
inference(split_conjunct,[status(thm)],[m__2456]) ).
cnf(c_0_21,hypothesis,
aElement0(esk18_3(xa,slsdtgt0(xa),xk)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_16]),c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : RNG116+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n003.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 04:22:46 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.51 Running first-order theorem proving
% 0.24/0.51 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.24/0.64 % Version: 3.5.1
% 0.24/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.64 % Starting sh5l with 300s (1) cores
% 0.24/0.64 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3394338 completed with status 0
% 0.24/0.64 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.24/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.64 % No SInE strategy applied
% 0.24/0.64 % Search class: FGHSF-FFMM32-MFFFFFNN
% 0.24/0.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/0.64 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S2q with 136s (1) cores
% 0.24/0.64 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.64 % Starting new_bool_1 with 136s (1) cores
% 0.24/0.64 % G-E--_208_B07_F1_SE_CS_SP_PS_S2q with pid 3394346 completed with status 0
% 0.24/0.64 % Result found by G-E--_208_B07_F1_SE_CS_SP_PS_S2q
% 0.24/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.64 % No SInE strategy applied
% 0.24/0.64 % Search class: FGHSF-FFMM32-MFFFFFNN
% 0.24/0.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/0.64 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S2q with 136s (1) cores
% 0.24/0.64 % Preprocessing time : 0.004 s
% 0.24/0.64 % Presaturation interreduction done
% 0.24/0.64
% 0.24/0.64 % Proof found!
% 0.24/0.64 % SZS status Theorem
% 0.24/0.64 % SZS output start CNFRefutation
% See solution above
% 0.24/0.64 % Parsed axioms : 48
% 0.24/0.64 % Removed by relevancy pruning/SinE : 0
% 0.24/0.64 % Initial clauses : 113
% 0.24/0.64 % Removed in clause preprocessing : 4
% 0.24/0.64 % Initial clauses in saturation : 109
% 0.24/0.64 % Processed clauses : 722
% 0.24/0.64 % ...of these trivial : 2
% 0.24/0.64 % ...subsumed : 320
% 0.24/0.64 % ...remaining for further processing : 400
% 0.24/0.64 % Other redundant clauses eliminated : 16
% 0.24/0.64 % Clauses deleted for lack of memory : 0
% 0.24/0.64 % Backward-subsumed : 4
% 0.24/0.64 % Backward-rewritten : 6
% 0.24/0.64 % Generated clauses : 1241
% 0.24/0.64 % ...of the previous two non-redundant : 1160
% 0.24/0.64 % ...aggressively subsumed : 0
% 0.24/0.64 % Contextual simplify-reflections : 4
% 0.24/0.64 % Paramodulations : 1223
% 0.24/0.64 % Factorizations : 4
% 0.24/0.64 % NegExts : 0
% 0.24/0.64 % Equation resolutions : 16
% 0.24/0.64 % Disequality decompositions : 0
% 0.24/0.64 % Total rewrite steps : 996
% 0.24/0.64 % ...of those cached : 960
% 0.24/0.64 % Propositional unsat checks : 0
% 0.24/0.64 % Propositional check models : 0
% 0.24/0.64 % Propositional check unsatisfiable : 0
% 0.24/0.64 % Propositional clauses : 0
% 0.24/0.64 % Propositional clauses after purity: 0
% 0.24/0.64 % Propositional unsat core size : 0
% 0.24/0.64 % Propositional preprocessing time : 0.000
% 0.24/0.64 % Propositional encoding time : 0.000
% 0.24/0.64 % Propositional solver time : 0.000
% 0.24/0.64 % Success case prop preproc time : 0.000
% 0.24/0.64 % Success case prop encoding time : 0.000
% 0.24/0.64 % Success case prop solver time : 0.000
% 0.24/0.64 % Current number of processed clauses : 267
% 0.24/0.64 % Positive orientable unit clauses : 63
% 0.24/0.64 % Positive unorientable unit clauses: 0
% 0.24/0.64 % Negative unit clauses : 17
% 0.24/0.64 % Non-unit-clauses : 187
% 0.24/0.64 % Current number of unprocessed clauses: 623
% 0.24/0.64 % ...number of literals in the above : 2990
% 0.24/0.64 % Current number of archived formulas : 0
% 0.24/0.64 % Current number of archived clauses : 119
% 0.24/0.64 % Clause-clause subsumption calls (NU) : 12108
% 0.24/0.64 % Rec. Clause-clause subsumption calls : 3401
% 0.24/0.64 % Non-unit clause-clause subsumptions : 270
% 0.24/0.64 % Unit Clause-clause subsumption calls : 836
% 0.24/0.64 % Rewrite failures with RHS unbound : 0
% 0.24/0.64 % BW rewrite match attempts : 15
% 0.24/0.64 % BW rewrite match successes : 6
% 0.24/0.64 % Condensation attempts : 0
% 0.24/0.64 % Condensation successes : 0
% 0.24/0.64 % Termbank termtop insertions : 28724
% 0.24/0.64 % Search garbage collected termcells : 1920
% 0.24/0.64
% 0.24/0.64 % -------------------------------------------------
% 0.24/0.64 % User time : 0.088 s
% 0.24/0.64 % System time : 0.012 s
% 0.24/0.64 % Total time : 0.101 s
% 0.24/0.64 % Maximum resident set size: 3952 pages
% 0.24/0.64
% 0.24/0.64 % -------------------------------------------------
% 0.24/0.64 % User time : 0.417 s
% 0.24/0.64 % System time : 0.040 s
% 0.24/0.64 % Total time : 0.458 s
% 0.24/0.64 % Maximum resident set size: 4864 pages
% 0.24/0.64 % E exiting
%------------------------------------------------------------------------------