%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : RNG123+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 : n009.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.26s 0.58s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 17 unt; 0 def)
% Number of atoms : 84 ( 7 equ)
% Maximal formula atoms : 29 ( 2 avg)
% Number of connectives : 88 ( 34 ~; 35 |; 12 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefIdeal,axiom,
! [X1] :
( aIdeal0(X1)
<=> ( ! [X2] :
( aElementOf0(X2,X1)
=> ( ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X2),X1) )
& ! [X3] :
( aElementOf0(X3,X1)
=> aElementOf0(sdtpldt0(X2,X3),X1) ) ) )
& aSet0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefIdeal) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__2174,hypothesis,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& aIdeal0(xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2174) ).
fof(m__,conjecture,
aElementOf0(xr,xI),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddComm) ).
fof(m__2690,hypothesis,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2690) ).
fof(m__2718,hypothesis,
xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2718) ).
fof(m__2091,hypothesis,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2091) ).
fof(m__2699,hypothesis,
aElementOf0(xb,xI),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2699) ).
fof(c_0_9,plain,
! [X50,X51,X52,X53,X54] :
( ( aIdeal0(X54)
| ~ aSet0(X54)
| ~ aElementOf0(sdtpldt0(esk13_1(X54),esk14_1(X54)),X54)
| ~ aElementOf0(sdtasdt0(esk15_1(X54),esk13_1(X54)),X54) )
& ( aIdeal0(X54)
| ~ aSet0(X54)
| ~ aElementOf0(sdtpldt0(esk13_1(X54),esk14_1(X54)),X54)
| aElement0(esk15_1(X54)) )
& ( aIdeal0(X54)
| ~ aSet0(X54)
| aElementOf0(esk14_1(X54),X54)
| ~ aElementOf0(sdtasdt0(esk15_1(X54),esk13_1(X54)),X54) )
& ( aIdeal0(X54)
| ~ aSet0(X54)
| aElementOf0(esk14_1(X54),X54)
| aElement0(esk15_1(X54)) )
& ( aIdeal0(X54)
| ~ aSet0(X54)
| aElementOf0(esk13_1(X54),X54) )
& ( ~ aIdeal0(X50)
| ~ aElementOf0(X51,X50)
| aElementOf0(sdtasdt0(X53,X51),X50)
| ~ aElement0(X53) )
& ( ~ aIdeal0(X50)
| ~ aElementOf0(X51,X50)
| aElementOf0(sdtpldt0(X51,X52),X50)
| ~ aElementOf0(X52,X50) )
& ( ~ aIdeal0(X50)
| aSet0(X50) ) ),
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)],[mDefIdeal])])])])])])]) ).
fof(c_0_10,plain,
! [X92,X93] :
( aElement0(X93)
| ~ aElementOf0(X93,X92)
| ~ aSet0(X92) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
cnf(c_0_11,plain,
( ~ aIdeal0(X1)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__2174]) ).
fof(c_0_13,negated_conjecture,
~ aElementOf0(xr,xI),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_14,plain,
! [X69,X70] :
( sdtpldt0(X69,X70) = sdtpldt0(X70,X69)
| ~ aElement0(X70)
| ~ aElement0(X69) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])])]) ).
cnf(c_0_15,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,hypothesis,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(split_conjunct,[status(thm)],[m__2690]) ).
cnf(c_0_17,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_18,negated_conjecture,
~ aElementOf0(xr,xI),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ aIdeal0(X2)
| ~ aElementOf0(X3,X2)
| ~ aElementOf0(X1,X2)
| aElementOf0(sdtpldt0(X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,hypothesis,
xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),
inference(split_conjunct,[status(thm)],[m__2718]) ).
cnf(c_0_21,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,hypothesis,
aElement0(smndt0(sdtasdt0(xq,xu))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_23,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
fof(c_0_24,negated_conjecture,
~ aElementOf0(xr,xI),
inference(fof_nnf,[status(thm)],[c_0_18]) ).
cnf(c_0_25,hypothesis,
( ~ aElementOf0(X2,xI)
| ~ aElementOf0(X1,xI)
| aElementOf0(sdtpldt0(X1,X2),xI) ),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_26,hypothesis,
sdtpldt0(xb,smndt0(sdtasdt0(xq,xu))) = 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_27,hypothesis,
aElementOf0(xb,xI),
inference(split_conjunct,[status(thm)],[m__2699]) ).
cnf(c_0_28,negated_conjecture,
~ aElementOf0(xr,xI),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_16])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : RNG123+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.19/0.44 % Computer : n009.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 04:21:57 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.51 Running first-order theorem proving
% 0.19/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.26/0.58 % Version: 3.5.1
% 0.26/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.58 % Starting sh5l with 300s (1) cores
% 0.26/0.58 % new_bool_1 with pid 835179 completed with status 0
% 0.26/0.58 % Result found by new_bool_1
% 0.26/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.58 % Search class: FGHSF-FFMM32-MFFFFFNN
% 0.26/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.58 % SubtermCWHack with pid 835181 completed with status 0
% 0.26/0.58 % Result found by SubtermCWHack
% 0.26/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.58 % Search class: FGHSF-FFMM32-MFFFFFNN
% 0.26/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.58 % Preprocessing time : 0.004 s
% 0.26/0.58
% 0.26/0.58 % Proof found!
% 0.26/0.58 % SZS status Theorem
% 0.26/0.58 % SZS output start CNFRefutation
% See solution above
% 0.26/0.58 % Parsed axioms : 55
% 0.26/0.58 % Removed by relevancy pruning/SinE : 5
% 0.26/0.58 % Initial clauses : 105
% 0.26/0.58 % Removed in clause preprocessing : 4
% 0.26/0.58 % Initial clauses in saturation : 101
% 0.26/0.58 % Processed clauses : 166
% 0.26/0.58 % ...of these trivial : 8
% 0.26/0.58 % ...subsumed : 45
% 0.26/0.58 % ...remaining for further processing : 113
% 0.26/0.58 % Other redundant clauses eliminated : 6
% 0.26/0.58 % Clauses deleted for lack of memory : 0
% 0.26/0.58 % Backward-subsumed : 1
% 0.26/0.58 % Backward-rewritten : 3
% 0.26/0.58 % Generated clauses : 221
% 0.26/0.58 % ...of the previous two non-redundant : 148
% 0.26/0.58 % ...aggressively subsumed : 0
% 0.26/0.58 % Contextual simplify-reflections : 0
% 0.26/0.58 % Paramodulations : 216
% 0.26/0.58 % Factorizations : 0
% 0.26/0.58 % NegExts : 0
% 0.26/0.58 % Equation resolutions : 6
% 0.26/0.58 % Disequality decompositions : 0
% 0.26/0.58 % Total rewrite steps : 183
% 0.26/0.58 % ...of those cached : 158
% 0.26/0.58 % Propositional unsat checks : 0
% 0.26/0.58 % Propositional check models : 0
% 0.26/0.58 % Propositional check unsatisfiable : 0
% 0.26/0.58 % Propositional clauses : 0
% 0.26/0.58 % Propositional clauses after purity: 0
% 0.26/0.58 % Propositional unsat core size : 0
% 0.26/0.58 % Propositional preprocessing time : 0.000
% 0.26/0.58 % Propositional encoding time : 0.000
% 0.26/0.58 % Propositional solver time : 0.000
% 0.26/0.58 % Success case prop preproc time : 0.000
% 0.26/0.58 % Success case prop encoding time : 0.000
% 0.26/0.58 % Success case prop solver time : 0.000
% 0.26/0.58 % Current number of processed clauses : 105
% 0.26/0.58 % Positive orientable unit clauses : 42
% 0.26/0.58 % Positive unorientable unit clauses: 0
% 0.26/0.58 % Negative unit clauses : 7
% 0.26/0.58 % Non-unit-clauses : 56
% 0.26/0.58 % Current number of unprocessed clauses: 57
% 0.26/0.58 % ...number of literals in the above : 273
% 0.26/0.58 % Current number of archived formulas : 0
% 0.26/0.58 % Current number of archived clauses : 4
% 0.26/0.58 % Clause-clause subsumption calls (NU) : 786
% 0.26/0.58 % Rec. Clause-clause subsumption calls : 569
% 0.26/0.58 % Non-unit clause-clause subsumptions : 44
% 0.26/0.58 % Unit Clause-clause subsumption calls : 18
% 0.26/0.58 % Rewrite failures with RHS unbound : 0
% 0.26/0.58 % BW rewrite match attempts : 7
% 0.26/0.58 % BW rewrite match successes : 3
% 0.26/0.58 % Condensation attempts : 0
% 0.26/0.58 % Condensation successes : 0
% 0.26/0.58 % Termbank termtop insertions : 9387
% 0.26/0.58 % Search garbage collected termcells : 1562
% 0.26/0.58
% 0.26/0.58 % -------------------------------------------------
% 0.26/0.58 % User time : 0.027 s
% 0.26/0.58 % System time : 0.004 s
% 0.26/0.58 % Total time : 0.030 s
% 0.26/0.58 % Maximum resident set size: 3956 pages
% 0.26/0.58
% 0.26/0.58 % -------------------------------------------------
% 0.26/0.58 % User time : 0.031 s
% 0.26/0.58 % System time : 0.009 s
% 0.26/0.58 % Total time : 0.041 s
% 0.26/0.58 % Maximum resident set size: 4608 pages
% 0.26/0.58 % E exiting
%------------------------------------------------------------------------------