%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : RNG086+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 : 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:20 PM UTC 2026
% Result : Theorem 18.89s 3.37s
% Output : CNFRefutation 18.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 9 unt; 0 def)
% Number of atoms : 151 ( 25 equ)
% Maximal formula atoms : 52 ( 5 avg)
% Number of connectives : 207 ( 82 ~; 90 |; 28 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 5 con; 0-4 aty)
% Number of variables : 55 ( 0 sgn 25 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSSum,axiom,
! [X1,X2] :
( ( aSet0(X2)
& aSet0(X1) )
=> ! [X3] :
( X3 = sdtpldt1(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ? [X5,X6] :
( sdtpldt0(X5,X6) = X4
& aElementOf0(X6,X2)
& aElementOf0(X5,X1) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSSum) ).
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__,conjecture,
? [X1,X2] :
( xx = sdtpldt0(X1,X2)
& aElementOf0(X2,xJ)
& aElementOf0(X1,xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__870,hypothesis,
( aIdeal0(xJ)
& aIdeal0(xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__870) ).
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,plain,
! [X40,X41,X42,X43,X46,X47,X48,X49,X51,X52] :
( ( ~ aSet0(X41)
| ~ aSet0(X40)
| X49 = sdtpldt1(X40,X41)
| ~ aSet0(X49)
| aElementOf0(esk5_3(X40,X41,X49),X49)
| sdtpldt0(esk6_3(X40,X41,X49),esk7_3(X40,X41,X49)) = esk5_3(X40,X41,X49) )
& ( ~ aSet0(X41)
| ~ aSet0(X40)
| X49 = sdtpldt1(X40,X41)
| ~ aSet0(X49)
| aElementOf0(esk5_3(X40,X41,X49),X49)
| aElementOf0(esk7_3(X40,X41,X49),X41) )
& ( ~ aSet0(X41)
| ~ aSet0(X40)
| X49 = sdtpldt1(X40,X41)
| ~ aSet0(X49)
| aElementOf0(esk5_3(X40,X41,X49),X49)
| aElementOf0(esk6_3(X40,X41,X49),X40) )
& ( ~ aSet0(X41)
| ~ aSet0(X40)
| X49 = sdtpldt1(X40,X41)
| ~ aSet0(X49)
| sdtpldt0(X51,X52) != esk5_3(X40,X41,X49)
| ~ aElementOf0(X52,X41)
| ~ aElementOf0(X51,X40)
| ~ aElementOf0(esk5_3(X40,X41,X49),X49) )
& ( ~ aSet0(X41)
| ~ aSet0(X40)
| X42 != sdtpldt1(X40,X41)
| aElementOf0(X46,X42)
| sdtpldt0(X47,X48) != X46
| ~ aElementOf0(X48,X41)
| ~ aElementOf0(X47,X40) )
& ( ~ aSet0(X41)
| ~ aSet0(X40)
| X42 != sdtpldt1(X40,X41)
| ~ aElementOf0(X43,X42)
| sdtpldt0(esk3_4(X40,X41,X42,X43),esk4_4(X40,X41,X42,X43)) = X43 )
& ( ~ aSet0(X41)
| ~ aSet0(X40)
| X42 != sdtpldt1(X40,X41)
| ~ aElementOf0(X43,X42)
| aElementOf0(esk4_4(X40,X41,X42,X43),X41) )
& ( ~ aSet0(X41)
| ~ aSet0(X40)
| X42 != sdtpldt1(X40,X41)
| ~ aElementOf0(X43,X42)
| aElementOf0(esk3_4(X40,X41,X42,X43),X40) )
& ( ~ aSet0(X41)
| ~ aSet0(X40)
| X42 != sdtpldt1(X40,X41)
| aSet0(X42) ) ),
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)],[mDefSSum])])])])])])]) ).
fof(c_0_6,plain,
! [X62,X63,X64,X65,X66] :
( ( aIdeal0(X66)
| ~ aSet0(X66)
| ~ aElementOf0(sdtpldt0(esk9_1(X66),esk10_1(X66)),X66)
| ~ aElementOf0(sdtasdt0(esk11_1(X66),esk9_1(X66)),X66) )
& ( aIdeal0(X66)
| ~ aSet0(X66)
| ~ aElementOf0(sdtpldt0(esk9_1(X66),esk10_1(X66)),X66)
| aElement0(esk11_1(X66)) )
& ( aIdeal0(X66)
| ~ aSet0(X66)
| aElementOf0(esk10_1(X66),X66)
| ~ aElementOf0(sdtasdt0(esk11_1(X66),esk9_1(X66)),X66) )
& ( aIdeal0(X66)
| ~ aSet0(X66)
| aElementOf0(esk10_1(X66),X66)
| aElement0(esk11_1(X66)) )
& ( aIdeal0(X66)
| ~ aSet0(X66)
| aElementOf0(esk9_1(X66),X66) )
& ( ~ aIdeal0(X62)
| ~ aElementOf0(X63,X62)
| aElementOf0(sdtasdt0(X65,X63),X62)
| ~ aElement0(X65) )
& ( ~ aIdeal0(X62)
| ~ aElementOf0(X63,X62)
| aElementOf0(sdtpldt0(X63,X64),X62)
| ~ aElementOf0(X64,X62) )
& ( ~ aIdeal0(X62)
| aSet0(X62) ) ),
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,
~ ? [X1,X2] :
( xx = sdtpldt0(X1,X2)
& aElementOf0(X2,xJ)
& aElementOf0(X1,xI) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_8,plain,
( ~ aSet0(X2)
| ~ aSet0(X1)
| X3 != sdtpldt1(X1,X2)
| ~ aElementOf0(X4,X3)
| sdtpldt0(esk3_4(X1,X2,X3,X4),esk4_4(X1,X2,X3,X4)) = X4 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ aIdeal0(X1)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
aIdeal0(xJ),
inference(split_conjunct,[status(thm)],[m__870]) ).
cnf(c_0_11,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__870]) ).
cnf(c_0_12,plain,
( ~ aSet0(X2)
| ~ aSet0(X1)
| X3 != sdtpldt1(X1,X2)
| ~ aElementOf0(X4,X3)
| aElementOf0(esk4_4(X1,X2,X3,X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( ~ aSet0(X2)
| ~ aSet0(X1)
| X3 != sdtpldt1(X1,X2)
| ~ aElementOf0(X4,X3)
| aElementOf0(esk3_4(X1,X2,X3,X4),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_14,negated_conjecture,
! [X70,X71] :
( xx != sdtpldt0(X70,X71)
| ~ aElementOf0(X71,xJ)
| ~ aElementOf0(X70,xI) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_15,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X3,sdtpldt1(X1,X2))
| sdtpldt0(esk3_4(X1,X2,sdtpldt1(X1,X2),X3),esk4_4(X1,X2,sdtpldt1(X1,X2),X3)) = X3 ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xx,sdtpldt1(xI,xJ)),
inference(split_conjunct,[status(thm)],[m__901]) ).
cnf(c_0_17,hypothesis,
aSet0(xJ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_18,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_19,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X3,sdtpldt1(X1,X2))
| aElementOf0(esk4_4(X1,X2,sdtpldt1(X1,X2),X3),X2) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X3,sdtpldt1(X1,X2))
| aElementOf0(esk3_4(X1,X2,sdtpldt1(X1,X2),X3),X1) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( xx != sdtpldt0(X1,X2)
| ~ aElementOf0(X2,xJ)
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,hypothesis,
sdtpldt0(esk3_4(xI,xJ,sdtpldt1(xI,xJ),xx),esk4_4(xI,xJ,sdtpldt1(xI,xJ),xx)) = xx,
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])]) ).
cnf(c_0_23,hypothesis,
aElementOf0(esk4_4(xI,xJ,sdtpldt1(xI,xJ),xx),xJ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_24,hypothesis,
aElementOf0(esk3_4(xI,xJ,sdtpldt1(xI,xJ),xx),xI),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG086+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.09/0.37 % Computer : n009.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 04:18:43 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.45 Running first-order theorem proving
% 0.14/0.45 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
% 18.89/3.37 % Version: 3.5.1
% 18.89/3.37 % Preprocessing class: FSMSSMSSSSSNFFN.
% 18.89/3.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.89/3.37 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.89/3.37 % Starting new_bool_3 with 300s (1) cores
% 18.89/3.37 % Starting new_bool_1 with 300s (1) cores
% 18.89/3.37 % Starting sh5l with 300s (1) cores
% 18.89/3.37 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 829119 completed with status 0
% 18.89/3.37 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 18.89/3.37 % Preprocessing class: FSMSSMSSSSSNFFN.
% 18.89/3.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.89/3.37 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.89/3.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 18.89/3.37 % No SInE strategy applied
% 18.89/3.37 % Search class: FGHSF-FFMM32-SFFFFFNN
% 18.89/3.37 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 18.89/3.37 % Starting SubtermCWHack with 136s (1) cores
% 18.89/3.37 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 18.89/3.37 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 18.89/3.37 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 18.89/3.37 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 18.89/3.37 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 829125 completed with status 0
% 18.89/3.37 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 18.89/3.37 % Preprocessing class: FSMSSMSSSSSNFFN.
% 18.89/3.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.89/3.37 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.89/3.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 18.89/3.37 % No SInE strategy applied
% 18.89/3.37 % Search class: FGHSF-FFMM32-SFFFFFNN
% 18.89/3.37 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 18.89/3.37 % Starting SubtermCWHack with 136s (1) cores
% 18.89/3.37 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 18.89/3.37 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 18.89/3.37 % Preprocessing time : 0.003 s
% 18.89/3.37 % Presaturation interreduction done
% 18.89/3.37
% 18.89/3.37 % Proof found!
% 18.89/3.37 % SZS status Theorem
% 18.89/3.37 % SZS output start CNFRefutation
% See solution above
% 18.89/3.37 % Parsed axioms : 27
% 18.89/3.37 % Removed by relevancy pruning/SinE : 0
% 18.89/3.37 % Initial clauses : 60
% 18.89/3.37 % Removed in clause preprocessing : 2
% 18.89/3.37 % Initial clauses in saturation : 58
% 18.89/3.37 % Processed clauses : 2228
% 18.89/3.37 % ...of these trivial : 335
% 18.89/3.37 % ...subsumed : 121
% 18.89/3.37 % ...remaining for further processing : 1772
% 18.89/3.37 % Other redundant clauses eliminated : 10
% 18.89/3.37 % Clauses deleted for lack of memory : 0
% 18.89/3.37 % Backward-subsumed : 2
% 18.89/3.37 % Backward-rewritten : 77
% 18.89/3.37 % Generated clauses : 146554
% 18.89/3.37 % ...of the previous two non-redundant : 144237
% 18.89/3.37 % ...aggressively subsumed : 0
% 18.89/3.37 % Contextual simplify-reflections : 28
% 18.89/3.37 % Paramodulations : 146541
% 18.89/3.37 % Factorizations : 4
% 18.89/3.37 % NegExts : 0
% 18.89/3.37 % Equation resolutions : 10
% 18.89/3.37 % Disequality decompositions : 0
% 18.89/3.37 % Total rewrite steps : 26424
% 18.89/3.37 % ...of those cached : 25879
% 18.89/3.37 % Propositional unsat checks : 0
% 18.89/3.37 % Propositional check models : 0
% 18.89/3.37 % Propositional check unsatisfiable : 0
% 18.89/3.37 % Propositional clauses : 0
% 18.89/3.37 % Propositional clauses after purity: 0
% 18.89/3.37 % Propositional unsat core size : 0
% 18.89/3.37 % Propositional preprocessing time : 0.000
% 18.89/3.37 % Propositional encoding time : 0.000
% 18.89/3.37 % Propositional solver time : 0.000
% 18.89/3.37 % Success case prop preproc time : 0.000
% 18.89/3.37 % Success case prop encoding time : 0.000
% 18.89/3.37 % Success case prop solver time : 0.000
% 18.89/3.37 % Current number of processed clauses : 1626
% 18.89/3.37 % Positive orientable unit clauses : 637
% 18.89/3.37 % Positive unorientable unit clauses: 0
% 18.89/3.37 % Negative unit clauses : 2
% 18.89/3.37 % Non-unit-clauses : 987
% 18.89/3.37 % Current number of unprocessed clauses: 142118
% 18.89/3.37 % ...number of literals in the above : 268785
% 18.89/3.37 % Current number of archived formulas : 0
% 18.89/3.37 % Current number of archived clauses : 137
% 18.89/3.37 % Clause-clause subsumption calls (NU) : 125185
% 18.89/3.37 % Rec. Clause-clause subsumption calls : 27533
% 18.89/3.37 % Non-unit clause-clause subsumptions : 149
% 18.89/3.37 % Unit Clause-clause subsumption calls : 3648
% 18.89/3.37 % Rewrite failures with RHS unbound : 0
% 18.89/3.37 % BW rewrite match attempts : 5880
% 18.89/3.37 % BW rewrite match successes : 25
% 18.89/3.37 % Condensation attempts : 0
% 18.89/3.37 % Condensation successes : 0
% 18.89/3.37 % Termbank termtop insertions : 3933892
% 18.89/3.37 % Search garbage collected termcells : 1038
% 18.89/3.37
% 18.89/3.37 % -------------------------------------------------
% 18.89/3.37 % User time : 2.665 s
% 18.89/3.37 % System time : 0.135 s
% 18.89/3.37 % Total time : 2.800 s
% 18.89/3.37 % Maximum resident set size: 3864 pages
% 18.89/3.37
% 18.89/3.37 % -------------------------------------------------
% 18.89/3.37 % User time : 12.872 s
% 18.89/3.37 % System time : 0.593 s
% 18.89/3.37 % Total time : 13.466 s
% 18.89/3.37 % Maximum resident set size: 4608 pages
% 18.89/3.37 % E exiting
%------------------------------------------------------------------------------