%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : RNG099+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 : n005.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:23 PM UTC 2026
% Result : Theorem 0.13s 0.45s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 20 unt; 0 def)
% Number of atoms : 129 ( 3 equ)
% Maximal formula atoms : 29 ( 2 avg)
% Number of connectives : 136 ( 51 ~; 53 |; 22 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 28 !; 2 ?)
% 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/sandbox2/benchmark/theBenchmark.p',mDefIdeal) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> aElement0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__1205,hypothesis,
( aIdeal0(xJ)
& aIdeal0(xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1205) ).
fof(m__1319,hypothesis,
xw = sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1319) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
fof(m__1294,hypothesis,
( sdtpldt0(xa,xb) = sz10
& aElementOf0(xb,xJ)
& aElementOf0(xa,xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1294) ).
fof(m__1217,hypothesis,
( aElement0(xy)
& aElement0(xx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1217) ).
fof(m__,conjecture,
? [X1] :
( sdteqdtlpzmzozddtrp0(X1,xy,xJ)
& sdteqdtlpzmzozddtrp0(X1,xx,xI)
& aElement0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDefMod,axiom,
! [X1,X2,X3] :
( ( aIdeal0(X3)
& aElement0(X2)
& aElement0(X1) )
=> ( sdteqdtlpzmzozddtrp0(X1,X2,X3)
<=> aElementOf0(sdtpldt0(X1,smndt0(X2)),X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefMod) ).
fof(m__1409,hypothesis,
aElementOf0(sdtpldt0(xw,smndt0(xy)),xJ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1409) ).
fof(m__1332,hypothesis,
aElementOf0(sdtpldt0(xw,smndt0(xx)),xI),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1332) ).
fof(c_0_12,plain,
! [X9,X10,X11,X12,X13] :
( ( aIdeal0(X13)
| ~ aSet0(X13)
| ~ aElementOf0(sdtpldt0(esk1_1(X13),esk2_1(X13)),X13)
| ~ aElementOf0(sdtasdt0(esk3_1(X13),esk1_1(X13)),X13) )
& ( aIdeal0(X13)
| ~ aSet0(X13)
| ~ aElementOf0(sdtpldt0(esk1_1(X13),esk2_1(X13)),X13)
| aElement0(esk3_1(X13)) )
& ( aIdeal0(X13)
| ~ aSet0(X13)
| aElementOf0(esk2_1(X13),X13)
| ~ aElementOf0(sdtasdt0(esk3_1(X13),esk1_1(X13)),X13) )
& ( aIdeal0(X13)
| ~ aSet0(X13)
| aElementOf0(esk2_1(X13),X13)
| aElement0(esk3_1(X13)) )
& ( aIdeal0(X13)
| ~ aSet0(X13)
| aElementOf0(esk1_1(X13),X13) )
& ( ~ aIdeal0(X9)
| ~ aElementOf0(X10,X9)
| aElementOf0(sdtasdt0(X12,X10),X9)
| ~ aElement0(X12) )
& ( ~ aIdeal0(X9)
| ~ aElementOf0(X10,X9)
| aElementOf0(sdtpldt0(X10,X11),X9)
| ~ aElementOf0(X11,X9) )
& ( ~ aIdeal0(X9)
| aSet0(X9) ) ),
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_13,plain,
! [X37,X38] :
( aElement0(sdtpldt0(X37,X38))
| ~ aElement0(X38)
| ~ aElement0(X37) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
fof(c_0_14,plain,
! [X60,X61] :
( aElement0(X61)
| ~ aElementOf0(X61,X60)
| ~ aSet0(X60) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
cnf(c_0_15,plain,
( ~ aIdeal0(X1)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__1205]) ).
cnf(c_0_17,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| aElement0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
xw = sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),
inference(split_conjunct,[status(thm)],[m__1319]) ).
fof(c_0_19,plain,
! [X47,X48] :
( aElement0(sdtasdt0(X47,X48))
| ~ aElement0(X48)
| ~ aElement0(X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_20,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,hypothesis,
aElementOf0(xa,xI),
inference(split_conjunct,[status(thm)],[m__1294]) ).
cnf(c_0_22,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,hypothesis,
aIdeal0(xJ),
inference(split_conjunct,[status(thm)],[m__1205]) ).
cnf(c_0_24,hypothesis,
( ~ aElement0(sdtasdt0(xy,xa))
| ~ aElement0(sdtasdt0(xx,xb))
| aElement0(xw) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| aElement0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,hypothesis,
aElement0(xa),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_27,hypothesis,
aElement0(xy),
inference(split_conjunct,[status(thm)],[m__1217]) ).
cnf(c_0_28,hypothesis,
aElementOf0(xb,xJ),
inference(split_conjunct,[status(thm)],[m__1294]) ).
cnf(c_0_29,hypothesis,
aSet0(xJ),
inference(spm,[status(thm)],[c_0_15,c_0_23]) ).
fof(c_0_30,negated_conjecture,
~ ? [X1] :
( sdteqdtlpzmzozddtrp0(X1,xy,xJ)
& sdteqdtlpzmzozddtrp0(X1,xx,xI)
& aElement0(X1) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_31,plain,
! [X56,X57,X58] :
( ( ~ aIdeal0(X58)
| ~ aElement0(X57)
| ~ aElement0(X56)
| sdteqdtlpzmzozddtrp0(X56,X57,X58)
| ~ aElementOf0(sdtpldt0(X56,smndt0(X57)),X58) )
& ( ~ aIdeal0(X58)
| ~ aElement0(X57)
| ~ aElement0(X56)
| aElementOf0(sdtpldt0(X56,smndt0(X57)),X58)
| ~ sdteqdtlpzmzozddtrp0(X56,X57,X58) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefMod])])])]) ).
cnf(c_0_32,hypothesis,
( ~ aElement0(sdtasdt0(xx,xb))
| aElement0(xw) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_33,hypothesis,
aElement0(xb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_28]),c_0_29])]) ).
cnf(c_0_34,hypothesis,
aElement0(xx),
inference(split_conjunct,[status(thm)],[m__1217]) ).
fof(c_0_35,negated_conjecture,
! [X8] :
( ~ sdteqdtlpzmzozddtrp0(X8,xy,xJ)
| ~ sdteqdtlpzmzozddtrp0(X8,xx,xI)
| ~ aElement0(X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])]) ).
cnf(c_0_36,plain,
( ~ aIdeal0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aElementOf0(sdtpldt0(X1,smndt0(X2)),X3)
| sdteqdtlpzmzozddtrp0(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,hypothesis,
aElementOf0(sdtpldt0(xw,smndt0(xy)),xJ),
inference(split_conjunct,[status(thm)],[m__1409]) ).
cnf(c_0_38,hypothesis,
aElement0(xw),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_25]),c_0_33]),c_0_34])]) ).
cnf(c_0_39,hypothesis,
aElementOf0(sdtpldt0(xw,smndt0(xx)),xI),
inference(split_conjunct,[status(thm)],[m__1332]) ).
cnf(c_0_40,negated_conjecture,
( ~ sdteqdtlpzmzozddtrp0(X1,xy,xJ)
| ~ sdteqdtlpzmzozddtrp0(X1,xx,xI)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_41,hypothesis,
sdteqdtlpzmzozddtrp0(xw,xy,xJ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_23]),c_0_27]),c_0_38])]) ).
cnf(c_0_42,hypothesis,
sdteqdtlpzmzozddtrp0(xw,xx,xI),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_39]),c_0_16]),c_0_34]),c_0_38])]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_38])]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG099+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n005.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 04:19:33 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.13/0.45 % Version: 3.5.1
% 0.13/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % new_bool_3 with pid 2535764 completed with status 0
% 0.13/0.45 % Result found by new_bool_3
% 0.13/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.45 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.13/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.45 % SubtermCWHack with pid 2535767 completed with status 0
% 0.13/0.45 % Result found by SubtermCWHack
% 0.13/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.45 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.13/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.45 % Preprocessing time : 0.002 s
% 0.13/0.45
% 0.13/0.45 % Proof found!
% 0.13/0.45 % SZS status Theorem
% 0.13/0.45 % SZS output start CNFRefutation
% See solution above
% 0.13/0.45 % Parsed axioms : 35
% 0.13/0.45 % Removed by relevancy pruning/SinE : 2
% 0.13/0.45 % Initial clauses : 62
% 0.13/0.45 % Removed in clause preprocessing : 2
% 0.13/0.45 % Initial clauses in saturation : 60
% 0.13/0.45 % Processed clauses : 212
% 0.13/0.45 % ...of these trivial : 8
% 0.13/0.45 % ...subsumed : 79
% 0.13/0.45 % ...remaining for further processing : 124
% 0.13/0.45 % Other redundant clauses eliminated : 3
% 0.13/0.45 % Clauses deleted for lack of memory : 0
% 0.13/0.45 % Backward-subsumed : 3
% 0.13/0.45 % Backward-rewritten : 6
% 0.13/0.45 % Generated clauses : 505
% 0.13/0.45 % ...of the previous two non-redundant : 374
% 0.13/0.45 % ...aggressively subsumed : 0
% 0.13/0.45 % Contextual simplify-reflections : 1
% 0.13/0.45 % Paramodulations : 503
% 0.13/0.45 % Factorizations : 0
% 0.13/0.45 % NegExts : 0
% 0.13/0.45 % Equation resolutions : 3
% 0.13/0.45 % Disequality decompositions : 0
% 0.13/0.45 % Total rewrite steps : 507
% 0.13/0.45 % ...of those cached : 478
% 0.13/0.45 % Propositional unsat checks : 0
% 0.13/0.45 % Propositional check models : 0
% 0.13/0.45 % Propositional check unsatisfiable : 0
% 0.13/0.45 % Propositional clauses : 0
% 0.13/0.45 % Propositional clauses after purity: 0
% 0.13/0.45 % Propositional unsat core size : 0
% 0.13/0.45 % Propositional preprocessing time : 0.000
% 0.13/0.45 % Propositional encoding time : 0.000
% 0.13/0.45 % Propositional solver time : 0.000
% 0.13/0.45 % Success case prop preproc time : 0.000
% 0.13/0.45 % Success case prop encoding time : 0.000
% 0.13/0.45 % Success case prop solver time : 0.000
% 0.13/0.45 % Current number of processed clauses : 113
% 0.13/0.45 % Positive orientable unit clauses : 33
% 0.13/0.45 % Positive unorientable unit clauses: 0
% 0.13/0.45 % Negative unit clauses : 1
% 0.13/0.45 % Non-unit-clauses : 79
% 0.13/0.45 % Current number of unprocessed clauses: 204
% 0.13/0.45 % ...number of literals in the above : 893
% 0.13/0.45 % Current number of archived formulas : 0
% 0.13/0.45 % Current number of archived clauses : 9
% 0.13/0.45 % Clause-clause subsumption calls (NU) : 1098
% 0.13/0.45 % Rec. Clause-clause subsumption calls : 928
% 0.13/0.45 % Non-unit clause-clause subsumptions : 83
% 0.13/0.45 % Unit Clause-clause subsumption calls : 92
% 0.13/0.45 % Rewrite failures with RHS unbound : 0
% 0.13/0.45 % BW rewrite match attempts : 6
% 0.13/0.45 % BW rewrite match successes : 5
% 0.13/0.45 % Condensation attempts : 0
% 0.13/0.45 % Condensation successes : 0
% 0.13/0.45 % Termbank termtop insertions : 11566
% 0.13/0.45 % Search garbage collected termcells : 922
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.013 s
% 0.13/0.45 % System time : 0.006 s
% 0.13/0.45 % Total time : 0.019 s
% 0.13/0.45 % Maximum resident set size: 3672 pages
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.016 s
% 0.13/0.45 % System time : 0.009 s
% 0.13/0.45 % Total time : 0.025 s
% 0.13/0.45 % Maximum resident set size: 4608 pages
% 0.13/0.45 % E exiting
%------------------------------------------------------------------------------