%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : RNG114+4 : 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 : n007.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:27 PM UTC 2026
% Result : Theorem 0.80s 0.71s
% Output : CNFRefutation 0.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 157 ( 48 equ)
% Maximal formula atoms : 33 ( 6 avg)
% Number of connectives : 187 ( 55 ~; 43 |; 77 &)
% ( 7 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 10 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn 34 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2273,hypothesis,
( ! [X1] :
( ( X1 != sz00
& ( aElementOf0(X1,xI)
| ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) ) ) )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI)
& ? [X1,X2] :
( sdtpldt0(X1,X2) = xu
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2273) ).
fof(m__,conjecture,
? [X1,X2] :
( xu = sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2))
& aElement0(X2)
& aElement0(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__2174,hypothesis,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ! [X1] :
( aElementOf0(X1,xI)
<=> ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) ) )
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xb))
<=> ? [X2] :
( sdtasdt0(xb,X2) = X1
& aElement0(X2) ) )
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xa))
<=> ? [X2] :
( sdtasdt0(xa,X2) = X1
& aElement0(X2) ) )
& aIdeal0(xI)
& ! [X1] :
( aElementOf0(X1,xI)
=> ( ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xI) )
& ! [X2] :
( aElementOf0(X2,xI)
=> aElementOf0(sdtpldt0(X1,X2),xI) ) ) )
& aSet0(xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2174) ).
fof(m__2228,hypothesis,
? [X1] :
( X1 != sz00
& aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) )
& ! [X2] :
( aElementOf0(X2,slsdtgt0(xb))
<=> ? [X3] :
( sdtasdt0(xb,X3) = X2
& aElement0(X3) ) )
& ! [X2] :
( aElementOf0(X2,slsdtgt0(xa))
<=> ? [X3] :
( sdtasdt0(xa,X3) = X2
& aElement0(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2228) ).
fof(c_0_4,hypothesis,
( ! [X1] :
( ( X1 != sz00
& ( aElementOf0(X1,xI)
| ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) ) ) )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI)
& ? [X1,X2] :
( sdtpldt0(X1,X2) = xu
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
fof(c_0_5,negated_conjecture,
~ ? [X1,X2] :
( xu = sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2))
& aElement0(X2)
& aElement0(X1) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,hypothesis,
! [X122,X123,X124,X125,X127,X128,X129,X131,X132,X133,X136,X137,X138] :
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ( aElementOf0(X136,xI)
| sdtpldt0(X137,X138) != X136
| ~ aElementOf0(X138,slsdtgt0(xb))
| ~ aElementOf0(X137,slsdtgt0(xa)) )
& ( ~ aElementOf0(X133,xI)
| sdtpldt0(esk26_1(X133),esk27_1(X133)) = X133 )
& ( ~ aElementOf0(X133,xI)
| aElementOf0(esk27_1(X133),slsdtgt0(xb)) )
& ( ~ aElementOf0(X133,xI)
| aElementOf0(esk26_1(X133),slsdtgt0(xa)) )
& ( aElementOf0(X131,slsdtgt0(xb))
| sdtasdt0(xb,X132) != X131
| ~ aElement0(X132) )
& ( ~ aElementOf0(X129,slsdtgt0(xb))
| sdtasdt0(xb,esk25_1(X129)) = X129 )
& ( ~ aElementOf0(X129,slsdtgt0(xb))
| aElement0(esk25_1(X129)) )
& ( aElementOf0(X127,slsdtgt0(xa))
| sdtasdt0(xa,X128) != X127
| ~ aElement0(X128) )
& ( ~ aElementOf0(X125,slsdtgt0(xa))
| sdtasdt0(xa,esk24_1(X125)) = X125 )
& ( ~ aElementOf0(X125,slsdtgt0(xa))
| aElement0(esk24_1(X125)) )
& aIdeal0(xI)
& ( ~ aElementOf0(X122,xI)
| aElementOf0(sdtasdt0(X124,X122),xI)
| ~ aElement0(X124) )
& ( ~ aElementOf0(X122,xI)
| aElementOf0(sdtpldt0(X122,X123),xI)
| ~ aElementOf0(X123,xI) )
& aSet0(xI) ),
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)],[m__2174])])])])])])]) ).
fof(c_0_7,hypothesis,
! [X154,X155,X156] :
( ( ~ iLess0(sbrdtbr0(X154),sbrdtbr0(xu))
| X154 = sz00
| ~ aElementOf0(X154,xI) )
& ( ~ iLess0(sbrdtbr0(X154),sbrdtbr0(xu))
| X154 = sz00
| sdtpldt0(X155,X156) != X154
| ~ aElementOf0(X156,slsdtgt0(xb))
| ~ aElementOf0(X155,slsdtgt0(xa)) )
& xu != sz00
& aElementOf0(xu,xI)
& sdtpldt0(esk37_0,esk38_0) = xu
& aElementOf0(esk38_0,slsdtgt0(xb))
& aElementOf0(esk37_0,slsdtgt0(xa)) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).
fof(c_0_8,hypothesis,
? [X1] :
( X1 != sz00
& aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) )
& ! [X2] :
( aElementOf0(X2,slsdtgt0(xb))
<=> ? [X3] :
( sdtasdt0(xb,X3) = X2
& aElement0(X3) ) )
& ! [X2] :
( aElementOf0(X2,slsdtgt0(xa))
<=> ? [X3] :
( sdtasdt0(xa,X3) = X2
& aElement0(X3) ) ) ),
inference(fof_simplification,[status(thm)],[m__2228]) ).
fof(c_0_9,negated_conjecture,
! [X159,X160] :
( xu != sdtpldt0(sdtasdt0(xa,X159),sdtasdt0(xb,X160))
| ~ aElement0(X160)
| ~ aElement0(X159) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_10,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xa))
| sdtasdt0(xa,esk24_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
aElementOf0(esk37_0,slsdtgt0(xa)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xa))
| aElement0(esk24_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,hypothesis,
! [X144,X146,X147,X149] :
( esk32_0 != sz00
& aElementOf0(esk32_0,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& sdtpldt0(esk35_0,esk36_0) = esk32_0
& aElementOf0(esk36_0,slsdtgt0(xb))
& aElementOf0(esk35_0,slsdtgt0(xa))
& ( aElementOf0(X147,slsdtgt0(xb))
| sdtasdt0(xb,X149) != X147
| ~ aElement0(X149) )
& ( ~ aElementOf0(X147,slsdtgt0(xb))
| sdtasdt0(xb,esk34_1(X147)) = X147 )
& ( ~ aElementOf0(X147,slsdtgt0(xb))
| aElement0(esk34_1(X147)) )
& ( aElementOf0(X144,slsdtgt0(xa))
| sdtasdt0(xa,X146) != X144
| ~ aElement0(X146) )
& ( ~ aElementOf0(X144,slsdtgt0(xa))
| sdtasdt0(xa,esk33_1(X144)) = X144 )
& ( ~ aElementOf0(X144,slsdtgt0(xa))
| aElement0(esk33_1(X144)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])]) ).
cnf(c_0_14,negated_conjecture,
( xu != sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,hypothesis,
sdtasdt0(xa,esk24_1(esk37_0)) = esk37_0,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,hypothesis,
aElement0(esk24_1(esk37_0)),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_17,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xb))
| sdtasdt0(xb,esk34_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
aElementOf0(esk38_0,slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xb))
| aElement0(esk34_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( ~ aElement0(X1)
| sdtpldt0(esk37_0,sdtasdt0(xb,X1)) != xu ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_21,hypothesis,
sdtasdt0(xb,esk34_1(esk38_0)) = esk38_0,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,hypothesis,
sdtpldt0(esk37_0,esk38_0) = xu,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,hypothesis,
aElement0(esk34_1(esk38_0)),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_24,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG114+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n007.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 04:19:05 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.46 Running first-order theorem proving
% 0.17/0.47 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.80/0.71 % Version: 3.5.1
% 0.80/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.80/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.80/0.71 % Starting new_bool_3 with 300s (1) cores
% 0.80/0.71 % Starting new_bool_1 with 300s (1) cores
% 0.80/0.71 % Starting sh5l with 300s (1) cores
% 0.80/0.71 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 157865 completed with status 0
% 0.80/0.71 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.80/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.80/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.80/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.80/0.71 % No SInE strategy applied
% 0.80/0.71 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.80/0.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.80/0.71 % Starting SubtermCWHack with 136s (1) cores
% 0.80/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.80/0.71 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.80/0.71 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.80/0.71 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.80/0.71 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 157872 completed with status 0
% 0.80/0.71 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.80/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.80/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.80/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.80/0.71 % No SInE strategy applied
% 0.80/0.71 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.80/0.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.80/0.71 % Starting SubtermCWHack with 136s (1) cores
% 0.80/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.80/0.71 % Preprocessing time : 0.006 s
% 0.80/0.71 % Presaturation interreduction done
% 0.80/0.71
% 0.80/0.71 % Proof found!
% 0.80/0.71 % SZS status Theorem
% 0.80/0.71 % SZS output start CNFRefutation
% See solution above
% 0.80/0.71 % Parsed axioms : 47
% 0.80/0.71 % Removed by relevancy pruning/SinE : 0
% 0.80/0.71 % Initial clauses : 189
% 0.80/0.71 % Removed in clause preprocessing : 4
% 0.80/0.71 % Initial clauses in saturation : 185
% 0.80/0.71 % Processed clauses : 955
% 0.80/0.71 % ...of these trivial : 18
% 0.80/0.71 % ...subsumed : 357
% 0.80/0.71 % ...remaining for further processing : 580
% 0.80/0.71 % Other redundant clauses eliminated : 52
% 0.80/0.71 % Clauses deleted for lack of memory : 0
% 0.80/0.71 % Backward-subsumed : 17
% 0.80/0.71 % Backward-rewritten : 7
% 0.80/0.71 % Generated clauses : 2401
% 0.80/0.71 % ...of the previous two non-redundant : 2079
% 0.80/0.71 % ...aggressively subsumed : 0
% 0.80/0.71 % Contextual simplify-reflections : 1
% 0.80/0.71 % Paramodulations : 2347
% 0.80/0.71 % Factorizations : 4
% 0.80/0.71 % NegExts : 0
% 0.80/0.71 % Equation resolutions : 52
% 0.80/0.71 % Disequality decompositions : 0
% 0.80/0.71 % Total rewrite steps : 2717
% 0.80/0.71 % ...of those cached : 2637
% 0.80/0.71 % Propositional unsat checks : 0
% 0.80/0.71 % Propositional check models : 0
% 0.80/0.71 % Propositional check unsatisfiable : 0
% 0.80/0.71 % Propositional clauses : 0
% 0.80/0.71 % Propositional clauses after purity: 0
% 0.80/0.71 % Propositional unsat core size : 0
% 0.80/0.71 % Propositional preprocessing time : 0.000
% 0.80/0.71 % Propositional encoding time : 0.000
% 0.80/0.71 % Propositional solver time : 0.000
% 0.80/0.71 % Success case prop preproc time : 0.000
% 0.80/0.71 % Success case prop encoding time : 0.000
% 0.80/0.71 % Success case prop solver time : 0.000
% 0.80/0.71 % Current number of processed clauses : 354
% 0.80/0.71 % Positive orientable unit clauses : 98
% 0.80/0.71 % Positive unorientable unit clauses: 0
% 0.80/0.71 % Negative unit clauses : 43
% 0.80/0.71 % Non-unit-clauses : 213
% 0.80/0.71 % Current number of unprocessed clauses: 1479
% 0.80/0.71 % ...number of literals in the above : 6032
% 0.80/0.71 % Current number of archived formulas : 0
% 0.80/0.71 % Current number of archived clauses : 206
% 0.80/0.71 % Clause-clause subsumption calls (NU) : 9230
% 0.80/0.71 % Rec. Clause-clause subsumption calls : 4183
% 0.80/0.71 % Non-unit clause-clause subsumptions : 179
% 0.80/0.71 % Unit Clause-clause subsumption calls : 2931
% 0.80/0.71 % Rewrite failures with RHS unbound : 0
% 0.80/0.71 % BW rewrite match attempts : 7
% 0.80/0.71 % BW rewrite match successes : 7
% 0.80/0.71 % Condensation attempts : 0
% 0.80/0.71 % Condensation successes : 0
% 0.80/0.71 % Termbank termtop insertions : 47881
% 0.80/0.71 % Search garbage collected termcells : 2663
% 0.80/0.71
% 0.80/0.71 % -------------------------------------------------
% 0.80/0.71 % User time : 0.126 s
% 0.80/0.71 % System time : 0.010 s
% 0.80/0.71 % Total time : 0.136 s
% 0.80/0.71 % Maximum resident set size: 3972 pages
% 0.80/0.71
% 0.80/0.71 % -------------------------------------------------
% 0.80/0.71 % User time : 0.481 s
% 0.80/0.71 % System time : 0.039 s
% 0.80/0.71 % Total time : 0.521 s
% 0.80/0.71 % Maximum resident set size: 4608 pages
% 0.80/0.71 % E exiting
%------------------------------------------------------------------------------