%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG088+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 : n004.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:47 PM UTC 2026
% Result : Theorem 0.15s 5.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 70 ( 2 equ)
% Maximal formula atoms : 29 ( 3 avg)
% Number of connectives : 79 ( 29 ~; 30 |; 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; 8 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( aElementOf0(sdtpldt0(xl,xn),xJ)
& aElementOf0(sdtpldt0(xk,xm),xI) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',mDefIdeal) ).
fof(m__870,hypothesis,
( aIdeal0(xJ)
& aIdeal0(xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__870) ).
fof(m__934,hypothesis,
( xx = sdtpldt0(xk,xl)
& aElementOf0(xl,xJ)
& aElementOf0(xk,xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__934) ).
fof(m__967,hypothesis,
( xy = sdtpldt0(xm,xn)
& aElementOf0(xn,xJ)
& aElementOf0(xm,xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__967) ).
fof(c_0_5,negated_conjecture,
~ ( aElementOf0(sdtpldt0(xl,xn),xJ)
& aElementOf0(sdtpldt0(xk,xm),xI) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,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])])])])])])]) ).
fof(c_0_7,negated_conjecture,
( ~ aElementOf0(sdtpldt0(xl,xn),xJ)
| ~ aElementOf0(sdtpldt0(xk,xm),xI) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
cnf(c_0_8,plain,
( ~ aIdeal0(X2)
| ~ aElementOf0(X3,X2)
| ~ aElementOf0(X1,X2)
| aElementOf0(sdtpldt0(X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
aIdeal0(xJ),
inference(split_conjunct,[status(thm)],[m__870]) ).
cnf(c_0_10,negated_conjecture,
( ~ aElementOf0(sdtpldt0(xl,xn),xJ)
| ~ aElementOf0(sdtpldt0(xk,xm),xI) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
( ~ aElementOf0(X2,xJ)
| ~ aElementOf0(X1,xJ)
| aElementOf0(sdtpldt0(X1,X2),xJ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,hypothesis,
aElementOf0(xl,xJ),
inference(split_conjunct,[status(thm)],[m__934]) ).
cnf(c_0_13,hypothesis,
aElementOf0(xn,xJ),
inference(split_conjunct,[status(thm)],[m__967]) ).
cnf(c_0_14,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__870]) ).
cnf(c_0_15,negated_conjecture,
~ aElementOf0(sdtpldt0(xk,xm),xI),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_16,hypothesis,
( ~ aElementOf0(X2,xI)
| ~ aElementOf0(X1,xI)
| aElementOf0(sdtpldt0(X1,X2),xI) ),
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_17,hypothesis,
aElementOf0(xk,xI),
inference(split_conjunct,[status(thm)],[m__934]) ).
cnf(c_0_18,hypothesis,
aElementOf0(xm,xI),
inference(split_conjunct,[status(thm)],[m__967]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG088+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.37 % Computer : n004.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Mon Sep 21 04:18:41 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 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.15/5.44 % Version: 3.5.1
% 0.15/5.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.44 % Starting sh5l with 300s (1) cores
% 0.15/5.44 % new_bool_1 with pid 2225692 completed with status 0
% 0.15/5.44 % Result found by new_bool_1
% 0.15/5.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.44 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.15/5.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.44 % Starting SubtermCWHack with 28s (1) cores
% 0.15/5.44 % SubtermCWHack with pid 2225695 completed with status 0
% 0.15/5.44 % Result found by SubtermCWHack
% 0.15/5.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.44 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.15/5.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.44 % Starting SubtermCWHack with 28s (1) cores
% 0.15/5.44 % Preprocessing time : 0.001 s
% 0.15/5.44
% 0.15/5.44 % Proof found!
% 0.15/5.44 % SZS status Theorem
% 0.15/5.44 % SZS output start CNFRefutation
% See solution above
% 0.15/5.44 % Parsed axioms : 29
% 0.15/5.44 % Removed by relevancy pruning/SinE : 6
% 0.15/5.44 % Initial clauses : 51
% 0.15/5.44 % Removed in clause preprocessing : 2
% 0.15/5.44 % Initial clauses in saturation : 49
% 0.15/5.44 % Processed clauses : 68
% 0.15/5.44 % ...of these trivial : 2
% 0.15/5.44 % ...subsumed : 13
% 0.15/5.44 % ...remaining for further processing : 53
% 0.15/5.44 % Other redundant clauses eliminated : 1
% 0.15/5.44 % Clauses deleted for lack of memory : 0
% 0.15/5.44 % Backward-subsumed : 1
% 0.15/5.44 % Backward-rewritten : 2
% 0.15/5.44 % Generated clauses : 83
% 0.15/5.44 % ...of the previous two non-redundant : 52
% 0.15/5.44 % ...aggressively subsumed : 0
% 0.15/5.44 % Contextual simplify-reflections : 0
% 0.15/5.44 % Paramodulations : 82
% 0.15/5.44 % Factorizations : 0
% 0.15/5.44 % NegExts : 0
% 0.15/5.44 % Equation resolutions : 1
% 0.15/5.44 % Disequality decompositions : 0
% 0.15/5.44 % Total rewrite steps : 79
% 0.15/5.44 % ...of those cached : 62
% 0.15/5.44 % Propositional unsat checks : 0
% 0.15/5.44 % Propositional check models : 0
% 0.15/5.44 % Propositional check unsatisfiable : 0
% 0.15/5.44 % Propositional clauses : 0
% 0.15/5.44 % Propositional clauses after purity: 0
% 0.15/5.44 % Propositional unsat core size : 0
% 0.15/5.44 % Propositional preprocessing time : 0.000
% 0.15/5.44 % Propositional encoding time : 0.000
% 0.15/5.44 % Propositional solver time : 0.000
% 0.15/5.44 % Success case prop preproc time : 0.000
% 0.15/5.44 % Success case prop encoding time : 0.000
% 0.15/5.44 % Success case prop solver time : 0.000
% 0.15/5.44 % Current number of processed clauses : 49
% 0.15/5.44 % Positive orientable unit clauses : 22
% 0.15/5.44 % Positive unorientable unit clauses: 0
% 0.15/5.44 % Negative unit clauses : 2
% 0.15/5.44 % Non-unit-clauses : 25
% 0.15/5.44 % Current number of unprocessed clauses: 32
% 0.15/5.44 % ...number of literals in the above : 160
% 0.15/5.44 % Current number of archived formulas : 0
% 0.15/5.44 % Current number of archived clauses : 3
% 0.15/5.44 % Clause-clause subsumption calls (NU) : 64
% 0.15/5.44 % Rec. Clause-clause subsumption calls : 52
% 0.15/5.44 % Non-unit clause-clause subsumptions : 13
% 0.15/5.44 % Unit Clause-clause subsumption calls : 12
% 0.15/5.44 % Rewrite failures with RHS unbound : 0
% 0.15/5.44 % BW rewrite match attempts : 2
% 0.15/5.44 % BW rewrite match successes : 2
% 0.15/5.44 % Condensation attempts : 0
% 0.15/5.44 % Condensation successes : 0
% 0.15/5.44 % Termbank termtop insertions : 4528
% 0.15/5.44 % Search garbage collected termcells : 811
% 0.15/5.44
% 0.15/5.44 % -------------------------------------------------
% 0.15/5.44 % User time : 0.007 s
% 0.15/5.44 % System time : 0.002 s
% 0.15/5.44 % Total time : 0.009 s
% 0.15/5.44 % Maximum resident set size: 3668 pages
% 0.15/5.44
% 0.15/5.44 % -------------------------------------------------
% 0.15/5.44 % User time : 0.010 s
% 0.15/5.44 % System time : 0.006 s
% 0.15/5.44 % Total time : 0.016 s
% 0.15/5.44 % Maximum resident set size: 4864 pages
% 0.15/5.44 % E exiting
%------------------------------------------------------------------------------