%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG108+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 : n010.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:53 PM UTC 2026
% Result : Theorem 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 99 ( 25 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 122 ( 50 ~; 48 |; 19 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 25 ( 0 sgn 14 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefPrIdeal,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( X2 = slsdtgt0(X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4] :
( sdtasdt0(X1,X4) = X3
& aElement0(X4) ) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefPrIdeal) ).
fof(m__,conjecture,
( aElementOf0(xb,slsdtgt0(xb))
& aElementOf0(sz00,slsdtgt0(xb))
& aElementOf0(xa,slsdtgt0(xa))
& aElementOf0(sz00,slsdtgt0(xa)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mMulUnit,axiom,
! [X1] :
( aElement0(X1)
=> ( X1 = sdtasdt0(sz10,X1)
& sdtasdt0(X1,sz10) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulUnit) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(m__2091,hypothesis,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2091) ).
fof(mMulZero,axiom,
! [X1] :
( aElement0(X1)
=> ( sz00 = sdtasdt0(sz00,X1)
& sdtasdt0(X1,sz00) = sz00 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulZero) ).
fof(mSortsC,axiom,
aElement0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
fof(c_0_7,plain,
! [X105,X106,X107,X109,X110,X111,X113] :
( ( ~ aElement0(X105)
| X111 = slsdtgt0(X105)
| ~ aSet0(X111)
| aElementOf0(esk19_2(X105,X111),X111)
| sdtasdt0(X105,esk20_2(X105,X111)) = esk19_2(X105,X111) )
& ( ~ aElement0(X105)
| X111 = slsdtgt0(X105)
| ~ aSet0(X111)
| aElementOf0(esk19_2(X105,X111),X111)
| aElement0(esk20_2(X105,X111)) )
& ( ~ aElement0(X105)
| X111 = slsdtgt0(X105)
| ~ aSet0(X111)
| sdtasdt0(X105,X113) != esk19_2(X105,X111)
| ~ aElement0(X113)
| ~ aElementOf0(esk19_2(X105,X111),X111) )
& ( ~ aElement0(X105)
| X106 != slsdtgt0(X105)
| aElementOf0(X109,X106)
| sdtasdt0(X105,X110) != X109
| ~ aElement0(X110) )
& ( ~ aElement0(X105)
| X106 != slsdtgt0(X105)
| ~ aElementOf0(X107,X106)
| sdtasdt0(X105,esk18_3(X105,X106,X107)) = X107 )
& ( ~ aElement0(X105)
| X106 != slsdtgt0(X105)
| ~ aElementOf0(X107,X106)
| aElement0(esk18_3(X105,X106,X107)) )
& ( ~ aElement0(X105)
| X106 != slsdtgt0(X105)
| aSet0(X106) ) ),
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)],[mDefPrIdeal])])])])])])]) ).
fof(c_0_8,negated_conjecture,
~ ( aElementOf0(xb,slsdtgt0(xb))
& aElementOf0(sz00,slsdtgt0(xb))
& aElementOf0(xa,slsdtgt0(xa))
& aElementOf0(sz00,slsdtgt0(xa)) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_9,plain,
( ~ aElement0(X2)
| X4 != slsdtgt0(X2)
| sdtasdt0(X2,X1) != X3
| ~ aElement0(X1)
| aElementOf0(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X25] :
( ( ~ aElement0(X25)
| X25 = sdtasdt0(sz10,X25) )
& ( ~ aElement0(X25)
| sdtasdt0(X25,sz10) = X25 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulUnit])])])]) ).
fof(c_0_11,negated_conjecture,
( ~ aElementOf0(xb,slsdtgt0(xb))
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(sz00,slsdtgt0(xa)) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
cnf(c_0_12,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| aElementOf0(sdtasdt0(X1,X2),slsdtgt0(X1)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
cnf(c_0_13,plain,
( ~ aElement0(X1)
| sdtasdt0(X1,sz10) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_15,negated_conjecture,
( ~ aElementOf0(xb,slsdtgt0(xb))
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(sz00,slsdtgt0(xa)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ aElement0(X1)
| aElementOf0(X1,slsdtgt0(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
fof(c_0_18,plain,
! [X30] :
( ( ~ aElement0(X30)
| sz00 = sdtasdt0(sz00,X30) )
& ( ~ aElement0(X30)
| sdtasdt0(X30,sz00) = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulZero])])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(sz00,slsdtgt0(xa)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_21,plain,
( ~ aElement0(X1)
| sdtasdt0(X1,sz00) = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
aElement0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_23,negated_conjecture,
( ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(sz00,slsdtgt0(xa)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_16]),c_0_20])]) ).
cnf(c_0_24,plain,
( ~ aElement0(X1)
| aElementOf0(sz00,slsdtgt0(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_21]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
~ aElementOf0(sz00,slsdtgt0(xa)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_17])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG108+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.09/0.35 % Computer : n010.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 04:20:24 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 11411 completed with status 0
% 0.13/0.42 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.13/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FGHSF-FFMM32-MFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.13/0.42 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S2q with 136s (1) cores
% 0.13/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.42 % SubtermCWHack with pid 11417 completed with status 0
% 0.13/0.42 % Result found by SubtermCWHack
% 0.13/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FGHSF-FFMM32-MFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Preprocessing time : 0.001 s
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Theorem
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 43
% 0.13/0.42 % Removed by relevancy pruning/SinE : 0
% 0.13/0.42 % Initial clauses : 100
% 0.13/0.42 % Removed in clause preprocessing : 4
% 0.13/0.42 % Initial clauses in saturation : 96
% 0.13/0.42 % Processed clauses : 174
% 0.13/0.42 % ...of these trivial : 0
% 0.13/0.42 % ...subsumed : 60
% 0.13/0.42 % ...remaining for further processing : 114
% 0.13/0.42 % Other redundant clauses eliminated : 10
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 6
% 0.13/0.42 % Backward-rewritten : 4
% 0.13/0.42 % Generated clauses : 279
% 0.13/0.42 % ...of the previous two non-redundant : 214
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 3
% 0.13/0.42 % Paramodulations : 270
% 0.13/0.42 % Factorizations : 0
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 10
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 151
% 0.13/0.42 % ...of those cached : 138
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 96
% 0.13/0.42 % Positive orientable unit clauses : 17
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 2
% 0.13/0.42 % Non-unit-clauses : 77
% 0.13/0.42 % Current number of unprocessed clauses: 100
% 0.13/0.42 % ...number of literals in the above : 520
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 10
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 1750
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 1211
% 0.13/0.42 % Non-unit clause-clause subsumptions : 68
% 0.13/0.42 % Unit Clause-clause subsumption calls : 11
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 4
% 0.13/0.42 % BW rewrite match successes : 4
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 11144
% 0.13/0.42 % Search garbage collected termcells : 1858
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.011 s
% 0.13/0.42 % System time : 0.006 s
% 0.13/0.42 % Total time : 0.017 s
% 0.13/0.42 % Maximum resident set size: 3944 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.031 s
% 0.13/0.42 % System time : 0.021 s
% 0.13/0.42 % Total time : 0.052 s
% 0.13/0.42 % Maximum resident set size: 4864 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------