%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG120+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 : n014.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.23s 0.58s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 39 ( 14 unt; 0 def)
% Number of atoms : 123 ( 14 equ)
% Maximal formula atoms : 29 ( 3 avg)
% Number of connectives : 141 ( 57 ~; 49 |; 24 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
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__2174,hypothesis,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& aIdeal0(xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2174) ).
fof(mMulMnOne,axiom,
! [X1] :
( aElement0(X1)
=> ( smndt0(X1) = sdtasdt0(X1,smndt0(sz10))
& sdtasdt0(smndt0(sz10),X1) = smndt0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulMnOne) ).
fof(mSortsU,axiom,
! [X1] :
( aElement0(X1)
=> aElement0(smndt0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsU) ).
fof(m__2273,hypothesis,
( ! [X1] :
( ( X1 != sz00
& aElementOf0(X1,xI) )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2273) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC_01) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
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(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_10,negated_conjecture,
~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_11,plain,
! [X50,X51,X52,X53,X54] :
( ( aIdeal0(X54)
| ~ aSet0(X54)
| ~ aElementOf0(sdtpldt0(esk13_1(X54),esk14_1(X54)),X54)
| ~ aElementOf0(sdtasdt0(esk15_1(X54),esk13_1(X54)),X54) )
& ( aIdeal0(X54)
| ~ aSet0(X54)
| ~ aElementOf0(sdtpldt0(esk13_1(X54),esk14_1(X54)),X54)
| aElement0(esk15_1(X54)) )
& ( aIdeal0(X54)
| ~ aSet0(X54)
| aElementOf0(esk14_1(X54),X54)
| ~ aElementOf0(sdtasdt0(esk15_1(X54),esk13_1(X54)),X54) )
& ( aIdeal0(X54)
| ~ aSet0(X54)
| aElementOf0(esk14_1(X54),X54)
| aElement0(esk15_1(X54)) )
& ( aIdeal0(X54)
| ~ aSet0(X54)
| aElementOf0(esk13_1(X54),X54) )
& ( ~ aIdeal0(X50)
| ~ aElementOf0(X51,X50)
| aElementOf0(sdtasdt0(X53,X51),X50)
| ~ aElement0(X53) )
& ( ~ aIdeal0(X50)
| ~ aElementOf0(X51,X50)
| aElementOf0(sdtpldt0(X51,X52),X50)
| ~ aElementOf0(X52,X50) )
& ( ~ aIdeal0(X50)
| aSet0(X50) ) ),
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_12,negated_conjecture,
~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( ~ aIdeal0(X3)
| ~ aElementOf0(X2,X3)
| ~ aElement0(X1)
| aElementOf0(sdtasdt0(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__2174]) ).
fof(c_0_15,plain,
! [X90] :
( ( ~ aElement0(X90)
| smndt0(X90) = sdtasdt0(X90,smndt0(sz10)) )
& ( ~ aElement0(X90)
| sdtasdt0(smndt0(sz10),X90) = smndt0(X90) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulMnOne])])])]) ).
fof(c_0_16,negated_conjecture,
~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
cnf(c_0_17,hypothesis,
( ~ aElement0(X1)
| ~ aElementOf0(X2,xI)
| aElementOf0(sdtasdt0(X1,X2),xI) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( ~ aElement0(X1)
| sdtasdt0(smndt0(sz10),X1) = smndt0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,hypothesis,
( ~ aElement0(X1)
| ~ aElement0(smndt0(sz10))
| ~ aElementOf0(X1,xI)
| aElementOf0(smndt0(X1),xI) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_21,plain,
! [X88] :
( aElement0(smndt0(X88))
| ~ aElement0(X88) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsU])])]) ).
fof(c_0_22,hypothesis,
( ! [X1] :
( ( X1 != sz00
& aElementOf0(X1,xI) )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
cnf(c_0_23,negated_conjecture,
( ~ aElement0(smndt0(sz10))
| ~ aElement0(sdtasdt0(xq,xu))
| ~ aElementOf0(sdtasdt0(xq,xu),xI) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( ~ aElement0(X1)
| aElement0(smndt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
fof(c_0_26,hypothesis,
! [X8] :
( ( ~ iLess0(sbrdtbr0(X8),sbrdtbr0(xu))
| X8 = sz00
| ~ aElementOf0(X8,xI) )
& xu != sz00
& aElementOf0(xu,xI) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
fof(c_0_27,plain,
! [X92,X93] :
( aElement0(X93)
| ~ aElementOf0(X93,X92)
| ~ aSet0(X92) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
cnf(c_0_28,plain,
( ~ aIdeal0(X1)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,negated_conjecture,
( ~ aElement0(sdtasdt0(xq,xu))
| ~ aElementOf0(sdtasdt0(xq,xu),xI) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_30,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,hypothesis,
aElement0(xq),
inference(split_conjunct,[status(thm)],[m__2666]) ).
fof(c_0_32,plain,
! [X77,X78] :
( aElement0(sdtasdt0(X77,X78))
| ~ aElement0(X78)
| ~ aElement0(X77) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_33,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_28,c_0_14]) ).
cnf(c_0_35,hypothesis,
~ aElement0(sdtasdt0(xq,xu)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_17]),c_0_30]),c_0_31])]) ).
cnf(c_0_36,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| aElement0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_30]),c_0_34])]) ).
cnf(c_0_38,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : RNG120+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n014.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 04:21:20 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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.23/0.58 % Version: 3.5.1
% 0.23/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.58 % Starting sh5l with 300s (1) cores
% 0.23/0.58 % new_bool_3 with pid 3126003 completed with status 0
% 0.23/0.58 % Result found by new_bool_3
% 0.23/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.58 % Search class: FGHSF-FFMM32-MFFFFFNN
% 0.23/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.58 % SubtermCWHack with pid 3126011 completed with status 0
% 0.23/0.58 % Result found by SubtermCWHack
% 0.23/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.58 % Search class: FGHSF-FFMM32-MFFFFFNN
% 0.23/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.58 % Preprocessing time : 0.003 s
% 0.23/0.58
% 0.23/0.58 % Proof found!
% 0.23/0.58 % SZS status Theorem
% 0.23/0.58 % SZS output start CNFRefutation
% See solution above
% 0.23/0.58 % Parsed axioms : 52
% 0.23/0.58 % Removed by relevancy pruning/SinE : 5
% 0.23/0.58 % Initial clauses : 102
% 0.23/0.58 % Removed in clause preprocessing : 4
% 0.23/0.58 % Initial clauses in saturation : 98
% 0.23/0.58 % Processed clauses : 166
% 0.23/0.58 % ...of these trivial : 1
% 0.23/0.58 % ...subsumed : 51
% 0.23/0.58 % ...remaining for further processing : 114
% 0.23/0.58 % Other redundant clauses eliminated : 6
% 0.23/0.58 % Clauses deleted for lack of memory : 0
% 0.23/0.58 % Backward-subsumed : 5
% 0.23/0.58 % Backward-rewritten : 3
% 0.23/0.58 % Generated clauses : 221
% 0.23/0.58 % ...of the previous two non-redundant : 161
% 0.23/0.58 % ...aggressively subsumed : 0
% 0.23/0.58 % Contextual simplify-reflections : 0
% 0.23/0.58 % Paramodulations : 216
% 0.23/0.58 % Factorizations : 0
% 0.23/0.58 % NegExts : 0
% 0.23/0.58 % Equation resolutions : 6
% 0.23/0.58 % Disequality decompositions : 0
% 0.23/0.58 % Total rewrite steps : 160
% 0.23/0.58 % ...of those cached : 142
% 0.23/0.58 % Propositional unsat checks : 0
% 0.23/0.58 % Propositional check models : 0
% 0.23/0.58 % Propositional check unsatisfiable : 0
% 0.23/0.58 % Propositional clauses : 0
% 0.23/0.58 % Propositional clauses after purity: 0
% 0.23/0.58 % Propositional unsat core size : 0
% 0.23/0.58 % Propositional preprocessing time : 0.000
% 0.23/0.58 % Propositional encoding time : 0.000
% 0.23/0.58 % Propositional solver time : 0.000
% 0.23/0.58 % Success case prop preproc time : 0.000
% 0.23/0.58 % Success case prop encoding time : 0.000
% 0.23/0.58 % Success case prop solver time : 0.000
% 0.23/0.58 % Current number of processed clauses : 102
% 0.23/0.58 % Positive orientable unit clauses : 33
% 0.23/0.58 % Positive unorientable unit clauses: 0
% 0.23/0.58 % Negative unit clauses : 10
% 0.23/0.58 % Non-unit-clauses : 59
% 0.23/0.58 % Current number of unprocessed clauses: 71
% 0.23/0.58 % ...number of literals in the above : 337
% 0.23/0.58 % Current number of archived formulas : 0
% 0.23/0.58 % Current number of archived clauses : 8
% 0.23/0.58 % Clause-clause subsumption calls (NU) : 977
% 0.23/0.58 % Rec. Clause-clause subsumption calls : 675
% 0.23/0.58 % Non-unit clause-clause subsumptions : 52
% 0.23/0.58 % Unit Clause-clause subsumption calls : 26
% 0.23/0.58 % Rewrite failures with RHS unbound : 0
% 0.23/0.58 % BW rewrite match attempts : 3
% 0.23/0.58 % BW rewrite match successes : 3
% 0.23/0.58 % Condensation attempts : 0
% 0.23/0.58 % Condensation successes : 0
% 0.23/0.58 % Termbank termtop insertions : 9360
% 0.23/0.58 % Search garbage collected termcells : 1562
% 0.23/0.58
% 0.23/0.58 % -------------------------------------------------
% 0.23/0.58 % User time : 0.026 s
% 0.23/0.58 % System time : 0.004 s
% 0.23/0.58 % Total time : 0.030 s
% 0.23/0.58 % Maximum resident set size: 4160 pages
% 0.23/0.58
% 0.23/0.58 % -------------------------------------------------
% 0.23/0.58 % User time : 0.030 s
% 0.23/0.58 % System time : 0.010 s
% 0.23/0.58 % Total time : 0.040 s
% 0.23/0.58 % Maximum resident set size: 4864 pages
% 0.23/0.58 % E exiting
%------------------------------------------------------------------------------