%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG089+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 : n019.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:48 PM UTC 2026
% Result : Theorem 0.23s 0.56s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 7 unt; 0 def)
% Number of atoms : 63 ( 1 equ)
% Maximal formula atoms : 29 ( 3 avg)
% Number of connectives : 71 ( 25 ~; 26 |; 16 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( aElementOf0(sdtasdt0(xz,xl),xJ)
& aElementOf0(sdtasdt0(xz,xk),xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
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/sandbox2/benchmark/theBenchmark.p',mDefIdeal) ).
fof(m__870,hypothesis,
( aIdeal0(xJ)
& aIdeal0(xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__870) ).
fof(m__934,hypothesis,
( xx = sdtpldt0(xk,xl)
& aElementOf0(xl,xJ)
& aElementOf0(xk,xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__934) ).
fof(m__901,hypothesis,
( aElement0(xz)
& aElementOf0(xy,sdtpldt1(xI,xJ))
& aElementOf0(xx,sdtpldt1(xI,xJ)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__901) ).
fof(c_0_5,negated_conjecture,
~ ( aElementOf0(sdtasdt0(xz,xl),xJ)
& aElementOf0(sdtasdt0(xz,xk),xI) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
( ~ aElementOf0(sdtasdt0(xz,xl),xJ)
| ~ aElementOf0(sdtasdt0(xz,xk),xI) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
fof(c_0_7,plain,
! [X7,X8,X9,X10,X11] :
( ( aIdeal0(X11)
| ~ aSet0(X11)
| ~ aElementOf0(sdtpldt0(esk1_1(X11),esk2_1(X11)),X11)
| ~ aElementOf0(sdtasdt0(esk3_1(X11),esk1_1(X11)),X11) )
& ( aIdeal0(X11)
| ~ aSet0(X11)
| ~ aElementOf0(sdtpldt0(esk1_1(X11),esk2_1(X11)),X11)
| aElement0(esk3_1(X11)) )
& ( aIdeal0(X11)
| ~ aSet0(X11)
| aElementOf0(esk2_1(X11),X11)
| ~ aElementOf0(sdtasdt0(esk3_1(X11),esk1_1(X11)),X11) )
& ( aIdeal0(X11)
| ~ aSet0(X11)
| aElementOf0(esk2_1(X11),X11)
| aElement0(esk3_1(X11)) )
& ( aIdeal0(X11)
| ~ aSet0(X11)
| aElementOf0(esk1_1(X11),X11) )
& ( ~ aIdeal0(X7)
| ~ aElementOf0(X8,X7)
| aElementOf0(sdtasdt0(X10,X8),X7)
| ~ aElement0(X10) )
& ( ~ aIdeal0(X7)
| ~ aElementOf0(X8,X7)
| aElementOf0(sdtpldt0(X8,X9),X7)
| ~ aElementOf0(X9,X7) )
& ( ~ aIdeal0(X7)
| aSet0(X7) ) ),
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])])])])])])]) ).
cnf(c_0_8,negated_conjecture,
( ~ aElementOf0(sdtasdt0(xz,xl),xJ)
| ~ aElementOf0(sdtasdt0(xz,xk),xI) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( ~ aIdeal0(X3)
| ~ aElementOf0(X2,X3)
| ~ aElement0(X1)
| aElementOf0(sdtasdt0(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
aIdeal0(xJ),
inference(split_conjunct,[status(thm)],[m__870]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xl,xJ),
inference(split_conjunct,[status(thm)],[m__934]) ).
cnf(c_0_12,hypothesis,
aElement0(xz),
inference(split_conjunct,[status(thm)],[m__901]) ).
cnf(c_0_13,negated_conjecture,
~ aElementOf0(sdtasdt0(xz,xk),xI),
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,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__870]) ).
cnf(c_0_15,hypothesis,
aElementOf0(xk,xI),
inference(split_conjunct,[status(thm)],[m__934]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[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_15]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : RNG089+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n019.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:19:20 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.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/0.56 % Version: 3.5.1
% 0.23/0.56 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.56 % Starting sh5l with 300s (1) cores
% 0.23/0.56 % new_bool_3 with pid 1669315 completed with status 0
% 0.23/0.56 % Result found by new_bool_3
% 0.23/0.56 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.56 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.23/0.56 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.56 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.56 % SubtermCWHack with pid 1669319 completed with status 0
% 0.23/0.56 % Result found by SubtermCWHack
% 0.23/0.56 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.56 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.23/0.56 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.56 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.56 % Preprocessing time : 0.003 s
% 0.23/0.56
% 0.23/0.56 % Proof found!
% 0.23/0.56 % SZS status Theorem
% 0.23/0.56 % SZS output start CNFRefutation
% See solution above
% 0.23/0.56 % Parsed axioms : 30
% 0.23/0.56 % Removed by relevancy pruning/SinE : 11
% 0.23/0.56 % Initial clauses : 46
% 0.23/0.56 % Removed in clause preprocessing : 2
% 0.23/0.56 % Initial clauses in saturation : 44
% 0.23/0.56 % Processed clauses : 47
% 0.23/0.56 % ...of these trivial : 0
% 0.23/0.56 % ...subsumed : 6
% 0.23/0.56 % ...remaining for further processing : 41
% 0.23/0.56 % Other redundant clauses eliminated : 1
% 0.23/0.56 % Clauses deleted for lack of memory : 0
% 0.23/0.56 % Backward-subsumed : 2
% 0.23/0.56 % Backward-rewritten : 2
% 0.23/0.56 % Generated clauses : 34
% 0.23/0.56 % ...of the previous two non-redundant : 31
% 0.23/0.56 % ...aggressively subsumed : 0
% 0.23/0.56 % Contextual simplify-reflections : 0
% 0.23/0.56 % Paramodulations : 33
% 0.23/0.56 % Factorizations : 0
% 0.23/0.56 % NegExts : 0
% 0.23/0.56 % Equation resolutions : 1
% 0.23/0.56 % Disequality decompositions : 0
% 0.23/0.56 % Total rewrite steps : 37
% 0.23/0.56 % ...of those cached : 24
% 0.23/0.56 % Propositional unsat checks : 0
% 0.23/0.56 % Propositional check models : 0
% 0.23/0.56 % Propositional check unsatisfiable : 0
% 0.23/0.56 % Propositional clauses : 0
% 0.23/0.56 % Propositional clauses after purity: 0
% 0.23/0.56 % Propositional unsat core size : 0
% 0.23/0.56 % Propositional preprocessing time : 0.000
% 0.23/0.56 % Propositional encoding time : 0.000
% 0.23/0.56 % Propositional solver time : 0.000
% 0.23/0.56 % Success case prop preproc time : 0.000
% 0.23/0.56 % Success case prop encoding time : 0.000
% 0.23/0.56 % Success case prop solver time : 0.000
% 0.23/0.56 % Current number of processed clauses : 36
% 0.23/0.56 % Positive orientable unit clauses : 23
% 0.23/0.56 % Positive unorientable unit clauses: 0
% 0.23/0.56 % Negative unit clauses : 1
% 0.23/0.56 % Non-unit-clauses : 12
% 0.23/0.56 % Current number of unprocessed clauses: 26
% 0.23/0.56 % ...number of literals in the above : 123
% 0.23/0.56 % Current number of archived formulas : 0
% 0.23/0.56 % Current number of archived clauses : 4
% 0.23/0.56 % Clause-clause subsumption calls (NU) : 67
% 0.23/0.56 % Rec. Clause-clause subsumption calls : 62
% 0.23/0.56 % Non-unit clause-clause subsumptions : 6
% 0.23/0.56 % Unit Clause-clause subsumption calls : 14
% 0.23/0.56 % Rewrite failures with RHS unbound : 0
% 0.23/0.56 % BW rewrite match attempts : 2
% 0.23/0.56 % BW rewrite match successes : 2
% 0.23/0.56 % Condensation attempts : 0
% 0.23/0.56 % Condensation successes : 0
% 0.23/0.56 % Termbank termtop insertions : 3640
% 0.23/0.56 % Search garbage collected termcells : 786
% 0.23/0.56
% 0.23/0.56 % -------------------------------------------------
% 0.23/0.56 % User time : 0.010 s
% 0.23/0.56 % System time : 0.005 s
% 0.23/0.56 % Total time : 0.015 s
% 0.23/0.56 % Maximum resident set size: 3668 pages
% 0.23/0.56
% 0.23/0.56 % -------------------------------------------------
% 0.23/0.56 % User time : 0.012 s
% 0.23/0.56 % System time : 0.012 s
% 0.23/0.56 % Total time : 0.025 s
% 0.23/0.56 % Maximum resident set size: 4608 pages
% 0.23/0.56 % E exiting
%------------------------------------------------------------------------------