%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG095+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 : n018.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:49 PM UTC 2026
% Result : Theorem 6.20s 1.26s
% Output : CNFRefutation 6.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 156 ( 25 equ)
% Maximal formula atoms : 52 ( 5 avg)
% Number of connectives : 210 ( 84 ~; 92 |; 26 &)
% ( 3 <=>; 5 =>; 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 : 14 ( 14 usr; 3 con; 0-4 aty)
% Number of variables : 58 ( 0 sgn 27 !; 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/sandbox/benchmark/theBenchmark.p',mDefSSum) ).
fof(m__1205_03,hypothesis,
! [X1] :
( aElement0(X1)
=> aElementOf0(X1,sdtpldt1(xI,xJ)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1205_03) ).
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__,conjecture,
? [X1,X2] :
( sdtpldt0(X1,X2) = sz10
& aElementOf0(X2,xJ)
& aElementOf0(X1,xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(m__1205,hypothesis,
( aIdeal0(xJ)
& aIdeal0(xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1205) ).
fof(c_0_6,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_7,hypothesis,
! [X77] :
( aElementOf0(X77,sdtpldt1(xI,xJ))
| ~ aElement0(X77) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1205_03])])]) ).
fof(c_0_8,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_9,negated_conjecture,
~ ? [X1,X2] :
( sdtpldt0(X1,X2) = sz10
& aElementOf0(X2,xJ)
& aElementOf0(X1,xI) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_10,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_6]) ).
cnf(c_0_11,hypothesis,
( ~ aElement0(X1)
| aElementOf0(X1,sdtpldt1(xI,xJ)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_13,plain,
( ~ aIdeal0(X1)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,hypothesis,
aIdeal0(xJ),
inference(split_conjunct,[status(thm)],[m__1205]) ).
cnf(c_0_15,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__1205]) ).
cnf(c_0_16,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_6]) ).
cnf(c_0_17,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_6]) ).
fof(c_0_18,negated_conjecture,
! [X78,X79] :
( sdtpldt0(X78,X79) != sz10
| ~ aElementOf0(X79,xJ)
| ~ aElementOf0(X78,xI) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_19,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_10]) ).
cnf(c_0_20,hypothesis,
aElementOf0(sz10,sdtpldt1(xI,xJ)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_21,hypothesis,
aSet0(xJ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_23,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_16]) ).
cnf(c_0_24,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_17]) ).
cnf(c_0_25,negated_conjecture,
( sdtpldt0(X1,X2) != sz10
| ~ aElementOf0(X2,xJ)
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,hypothesis,
sdtpldt0(esk3_4(xI,xJ,sdtpldt1(xI,xJ),sz10),esk4_4(xI,xJ,sdtpldt1(xI,xJ),sz10)) = sz10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_27,hypothesis,
aElementOf0(esk4_4(xI,xJ,sdtpldt1(xI,xJ),sz10),xJ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_28,hypothesis,
aElementOf0(esk3_4(xI,xJ,sdtpldt1(xI,xJ),sz10),xI),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
$false,
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_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG095+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 04:21:29 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.41 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
% 6.20/1.26 % Version: 3.5.1
% 6.20/1.26 % Preprocessing class: FSMSSMSSSSSNFFN.
% 6.20/1.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.20/1.26 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.20/1.26 % Starting new_bool_3 with 300s (1) cores
% 6.20/1.26 % Starting new_bool_1 with 300s (1) cores
% 6.20/1.26 % Starting sh5l with 300s (1) cores
% 6.20/1.26 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 953801 completed with status 0
% 6.20/1.26 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.20/1.26 % Preprocessing class: FSMSSMSSSSSNFFN.
% 6.20/1.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.20/1.26 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.20/1.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.20/1.26 % No SInE strategy applied
% 6.20/1.26 % Search class: FGHSF-FFMM32-SFFFFFNN
% 6.20/1.26 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.20/1.26 % Starting SubtermCWHack with 136s (1) cores
% 6.20/1.26 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.20/1.26 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 6.20/1.26 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 6.20/1.26 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 6.20/1.26 % G-E--_208_C18_F1_SE_CS_SP_PS_S2g with pid 953811 completed with status 0
% 6.20/1.26 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2g
% 6.20/1.26 % Preprocessing class: FSMSSMSSSSSNFFN.
% 6.20/1.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.20/1.26 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.20/1.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.20/1.26 % No SInE strategy applied
% 6.20/1.26 % Search class: FGHSF-FFMM32-SFFFFFNN
% 6.20/1.26 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.20/1.26 % Starting SubtermCWHack with 136s (1) cores
% 6.20/1.26 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.20/1.26 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 6.20/1.26 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 6.20/1.26 % Preprocessing time : 0.002 s
% 6.20/1.26 % Presaturation interreduction done
% 6.20/1.26
% 6.20/1.26 % Proof found!
% 6.20/1.26 % SZS status Theorem
% 6.20/1.26 % SZS output start CNFRefutation
% See solution above
% 6.20/1.26 % Parsed axioms : 31
% 6.20/1.26 % Removed by relevancy pruning/SinE : 0
% 6.20/1.26 % Initial clauses : 64
% 6.20/1.26 % Removed in clause preprocessing : 2
% 6.20/1.26 % Initial clauses in saturation : 62
% 6.20/1.26 % Processed clauses : 2129
% 6.20/1.26 % ...of these trivial : 484
% 6.20/1.26 % ...subsumed : 124
% 6.20/1.26 % ...remaining for further processing : 1521
% 6.20/1.26 % Other redundant clauses eliminated : 10
% 6.20/1.26 % Clauses deleted for lack of memory : 0
% 6.20/1.26 % Backward-subsumed : 18
% 6.20/1.26 % Backward-rewritten : 145
% 6.20/1.26 % Generated clauses : 79360
% 6.20/1.26 % ...of the previous two non-redundant : 78469
% 6.20/1.26 % ...aggressively subsumed : 0
% 6.20/1.26 % Contextual simplify-reflections : 0
% 6.20/1.26 % Paramodulations : 79351
% 6.20/1.26 % Factorizations : 0
% 6.20/1.26 % NegExts : 0
% 6.20/1.26 % Equation resolutions : 10
% 6.20/1.26 % Disequality decompositions : 0
% 6.20/1.26 % Total rewrite steps : 50323
% 6.20/1.26 % ...of those cached : 49816
% 6.20/1.26 % Propositional unsat checks : 0
% 6.20/1.26 % Propositional check models : 0
% 6.20/1.26 % Propositional check unsatisfiable : 0
% 6.20/1.26 % Propositional clauses : 0
% 6.20/1.26 % Propositional clauses after purity: 0
% 6.20/1.26 % Propositional unsat core size : 0
% 6.20/1.26 % Propositional preprocessing time : 0.000
% 6.20/1.26 % Propositional encoding time : 0.000
% 6.20/1.26 % Propositional solver time : 0.000
% 6.20/1.26 % Success case prop preproc time : 0.000
% 6.20/1.26 % Success case prop encoding time : 0.000
% 6.20/1.26 % Success case prop solver time : 0.000
% 6.20/1.26 % Current number of processed clauses : 1287
% 6.20/1.26 % Positive orientable unit clauses : 563
% 6.20/1.26 % Positive unorientable unit clauses: 0
% 6.20/1.26 % Negative unit clauses : 5
% 6.20/1.26 % Non-unit-clauses : 719
% 6.20/1.26 % Current number of unprocessed clauses: 76283
% 6.20/1.26 % ...number of literals in the above : 90255
% 6.20/1.26 % Current number of archived formulas : 0
% 6.20/1.26 % Current number of archived clauses : 225
% 6.20/1.26 % Clause-clause subsumption calls (NU) : 51619
% 6.20/1.26 % Rec. Clause-clause subsumption calls : 30737
% 6.20/1.26 % Non-unit clause-clause subsumptions : 101
% 6.20/1.26 % Unit Clause-clause subsumption calls : 6092
% 6.20/1.26 % Rewrite failures with RHS unbound : 0
% 6.20/1.26 % BW rewrite match attempts : 3010
% 6.20/1.26 % BW rewrite match successes : 49
% 6.20/1.26 % Condensation attempts : 0
% 6.20/1.26 % Condensation successes : 0
% 6.20/1.26 % Termbank termtop insertions : 1641208
% 6.20/1.26 % Search garbage collected termcells : 1127
% 6.20/1.26
% 6.20/1.26 % -------------------------------------------------
% 6.20/1.26 % User time : 0.753 s
% 6.20/1.26 % System time : 0.061 s
% 6.20/1.26 % Total time : 0.815 s
% 6.20/1.26 % Maximum resident set size: 3668 pages
% 6.20/1.26
% 6.20/1.26 % -------------------------------------------------
% 6.20/1.26 % User time : 3.877 s
% 6.20/1.26 % System time : 0.216 s
% 6.20/1.26 % Total time : 4.093 s
% 6.20/1.26 % Maximum resident set size: 4608 pages
% 6.20/1.26 % E exiting
%------------------------------------------------------------------------------