%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG119+4 : 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 : n016.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:55 PM UTC 2026
% Result : Theorem 0.25s 0.56s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 35 ( 12 unt; 0 def)
% Number of atoms : 151 ( 46 equ)
% Maximal formula atoms : 33 ( 4 avg)
% Number of connectives : 174 ( 58 ~; 47 |; 56 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 9 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 39 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
xr != sz00,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
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/sandbox2/benchmark/theBenchmark.p',m__2273) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
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/sandbox2/benchmark/theBenchmark.p',m__2174) ).
fof(mAddZero,axiom,
! [X1] :
( aElement0(X1)
=> ( X1 = sdtpldt0(sz00,X1)
& sdtpldt0(X1,sz00) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddZero) ).
fof(m__2666,hypothesis,
( ( iLess0(sbrdtbr0(xr),sbrdtbr0(xu))
| xr = sz00 )
& xb = sdtpldt0(sdtasdt0(xq,xu),xr)
& aElement0(xr)
& aElement0(xq) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2666) ).
fof(m__2612,hypothesis,
~ ( doDivides0(xu,xb)
| ? [X1] :
( sdtasdt0(xu,X1) = xb
& aElement0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2612) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
fof(c_0_9,negated_conjecture,
~ ( xr != sz00 ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_10,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_11,negated_conjecture,
xr = sz00,
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X116,X117] :
( aElement0(X117)
| ~ aElementOf0(X117,X116)
| ~ aSet0(X116) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_13,hypothesis,
! [X45,X46,X47] :
( ( ~ iLess0(sbrdtbr0(X45),sbrdtbr0(xu))
| X45 = sz00
| ~ aElementOf0(X45,xI) )
& ( ~ iLess0(sbrdtbr0(X45),sbrdtbr0(xu))
| X45 = sz00
| sdtpldt0(X46,X47) != X45
| ~ aElementOf0(X47,slsdtgt0(xb))
| ~ aElementOf0(X46,slsdtgt0(xa)) )
& xu != sz00
& aElementOf0(xu,xI)
& sdtpldt0(esk17_0,esk18_0) = xu
& aElementOf0(esk18_0,slsdtgt0(xb))
& aElementOf0(esk17_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_10])])])])])]) ).
fof(c_0_14,hypothesis,
! [X13,X14,X15,X16,X18,X19,X20,X22,X23,X24,X27,X28,X29] :
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ( aElementOf0(X27,xI)
| sdtpldt0(X28,X29) != X27
| ~ aElementOf0(X29,slsdtgt0(xb))
| ~ aElementOf0(X28,slsdtgt0(xa)) )
& ( ~ aElementOf0(X24,xI)
| sdtpldt0(esk6_1(X24),esk7_1(X24)) = X24 )
& ( ~ aElementOf0(X24,xI)
| aElementOf0(esk7_1(X24),slsdtgt0(xb)) )
& ( ~ aElementOf0(X24,xI)
| aElementOf0(esk6_1(X24),slsdtgt0(xa)) )
& ( aElementOf0(X22,slsdtgt0(xb))
| sdtasdt0(xb,X23) != X22
| ~ aElement0(X23) )
& ( ~ aElementOf0(X20,slsdtgt0(xb))
| sdtasdt0(xb,esk5_1(X20)) = X20 )
& ( ~ aElementOf0(X20,slsdtgt0(xb))
| aElement0(esk5_1(X20)) )
& ( aElementOf0(X18,slsdtgt0(xa))
| sdtasdt0(xa,X19) != X18
| ~ aElement0(X19) )
& ( ~ aElementOf0(X16,slsdtgt0(xa))
| sdtasdt0(xa,esk4_1(X16)) = X16 )
& ( ~ aElementOf0(X16,slsdtgt0(xa))
| aElement0(esk4_1(X16)) )
& aIdeal0(xI)
& ( ~ aElementOf0(X13,xI)
| aElementOf0(sdtasdt0(X15,X13),xI)
| ~ aElement0(X15) )
& ( ~ aElementOf0(X13,xI)
| aElementOf0(sdtpldt0(X13,X14),xI)
| ~ aElementOf0(X14,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_15,plain,
! [X55] :
( ( ~ aElement0(X55)
| X55 = sdtpldt0(sz00,X55) )
& ( ~ aElement0(X55)
| sdtpldt0(X55,sz00) = X55 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])])]) ).
cnf(c_0_16,hypothesis,
xb = sdtpldt0(sdtasdt0(xq,xu),xr),
inference(split_conjunct,[status(thm)],[m__2666]) ).
cnf(c_0_17,negated_conjecture,
xr = sz00,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_18,hypothesis,
! [X53] :
( ~ doDivides0(xu,xb)
& ( sdtasdt0(xu,X53) != xb
| ~ aElement0(X53) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2612])])])]) ).
fof(c_0_19,plain,
! [X71,X72] :
( sdtasdt0(X71,X72) = sdtasdt0(X72,X71)
| ~ aElement0(X72)
| ~ aElement0(X71) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
cnf(c_0_20,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,hypothesis,
aSet0(xI),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( ~ aElement0(X1)
| sdtpldt0(X1,sz00) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,hypothesis,
sdtpldt0(sdtasdt0(xq,xu),sz00) = xb,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_25,plain,
! [X69,X70] :
( aElement0(sdtasdt0(X69,X70))
| ~ aElement0(X70)
| ~ aElement0(X69) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_26,hypothesis,
( sdtasdt0(xu,X1) != xb
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_29,hypothesis,
( ~ aElement0(sdtasdt0(xq,xu))
| sdtasdt0(xq,xu) = xb ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| aElement0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,hypothesis,
aElement0(xq),
inference(split_conjunct,[status(thm)],[m__2666]) ).
cnf(c_0_32,hypothesis,
( ~ aElement0(X1)
| sdtasdt0(X1,xu) != xb ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_33,hypothesis,
sdtasdt0(xq,xu) = xb,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_28]),c_0_31])]) ).
cnf(c_0_34,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG119+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n016.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 04:26:23 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.49 Running first-order theorem proving
% 0.18/0.49 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.25/0.56 % Version: 3.5.1
% 0.25/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.56 % Starting sh5l with 300s (1) cores
% 0.25/0.56 % new_bool_3 with pid 1548639 completed with status 0
% 0.25/0.56 % Result found by new_bool_3
% 0.25/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.56 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.25/0.56 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.56 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.56 % SubtermCWHack with pid 1548649 completed with status 0
% 0.25/0.56 % Result found by SubtermCWHack
% 0.25/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.56 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.25/0.56 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.56 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.56 % Preprocessing time : 0.002 s
% 0.25/0.56
% 0.25/0.56 % Proof found!
% 0.25/0.56 % SZS status Theorem
% 0.25/0.56 % SZS output start CNFRefutation
% See solution above
% 0.25/0.56 % Parsed axioms : 51
% 0.25/0.56 % Removed by relevancy pruning/SinE : 11
% 0.25/0.56 % Initial clauses : 174
% 0.25/0.56 % Removed in clause preprocessing : 4
% 0.25/0.56 % Initial clauses in saturation : 170
% 0.25/0.56 % Processed clauses : 134
% 0.25/0.56 % ...of these trivial : 3
% 0.25/0.56 % ...subsumed : 21
% 0.25/0.56 % ...remaining for further processing : 110
% 0.25/0.56 % Other redundant clauses eliminated : 2
% 0.25/0.56 % Clauses deleted for lack of memory : 0
% 0.25/0.56 % Backward-subsumed : 1
% 0.25/0.56 % Backward-rewritten : 10
% 0.25/0.56 % Generated clauses : 102
% 0.25/0.56 % ...of the previous two non-redundant : 67
% 0.25/0.56 % ...aggressively subsumed : 0
% 0.25/0.56 % Contextual simplify-reflections : 0
% 0.25/0.56 % Paramodulations : 100
% 0.25/0.56 % Factorizations : 0
% 0.25/0.56 % NegExts : 0
% 0.25/0.56 % Equation resolutions : 2
% 0.25/0.56 % Disequality decompositions : 0
% 0.25/0.56 % Total rewrite steps : 149
% 0.25/0.56 % ...of those cached : 119
% 0.25/0.56 % Propositional unsat checks : 0
% 0.25/0.56 % Propositional check models : 0
% 0.25/0.56 % Propositional check unsatisfiable : 0
% 0.25/0.56 % Propositional clauses : 0
% 0.25/0.56 % Propositional clauses after purity: 0
% 0.25/0.56 % Propositional unsat core size : 0
% 0.25/0.56 % Propositional preprocessing time : 0.000
% 0.25/0.56 % Propositional encoding time : 0.000
% 0.25/0.56 % Propositional solver time : 0.000
% 0.25/0.56 % Success case prop preproc time : 0.000
% 0.25/0.56 % Success case prop encoding time : 0.000
% 0.25/0.56 % Success case prop solver time : 0.000
% 0.25/0.56 % Current number of processed clauses : 97
% 0.25/0.56 % Positive orientable unit clauses : 53
% 0.25/0.56 % Positive unorientable unit clauses: 0
% 0.25/0.56 % Negative unit clauses : 6
% 0.25/0.56 % Non-unit-clauses : 38
% 0.25/0.56 % Current number of unprocessed clauses: 99
% 0.25/0.56 % ...number of literals in the above : 406
% 0.25/0.56 % Current number of archived formulas : 0
% 0.25/0.56 % Current number of archived clauses : 11
% 0.25/0.56 % Clause-clause subsumption calls (NU) : 223
% 0.25/0.56 % Rec. Clause-clause subsumption calls : 200
% 0.25/0.56 % Non-unit clause-clause subsumptions : 16
% 0.25/0.56 % Unit Clause-clause subsumption calls : 20
% 0.25/0.56 % Rewrite failures with RHS unbound : 0
% 0.25/0.56 % BW rewrite match attempts : 8
% 0.25/0.56 % BW rewrite match successes : 8
% 0.25/0.56 % Condensation attempts : 0
% 0.25/0.56 % Condensation successes : 0
% 0.25/0.56 % Termbank termtop insertions : 11067
% 0.25/0.56 % Search garbage collected termcells : 2312
% 0.25/0.56
% 0.25/0.56 % -------------------------------------------------
% 0.25/0.56 % User time : 0.014 s
% 0.25/0.56 % System time : 0.003 s
% 0.25/0.56 % Total time : 0.017 s
% 0.25/0.56 % Maximum resident set size: 3972 pages
% 0.25/0.56
% 0.25/0.56 % -------------------------------------------------
% 0.25/0.56 % User time : 0.015 s
% 0.25/0.56 % System time : 0.008 s
% 0.25/0.56 % Total time : 0.023 s
% 0.25/0.56 % Maximum resident set size: 4608 pages
% 0.25/0.56 % E exiting
%------------------------------------------------------------------------------