%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG121+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 : n004.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:56 PM UTC 2026
% Result : Theorem 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 4 unt; 0 def)
% Number of atoms : 64 ( 20 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 61 ( 12 ~; 12 |; 36 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 4 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( aElementOf0(xb,xI)
| ? [X1,X2] :
( sdtpldt0(X1,X2) = xb
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) )
| ? [X1,X2] :
( sdtpldt0(X1,X2) = xb
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mAddZero,axiom,
! [X1] :
( aElement0(X1)
=> ( X1 = sdtpldt0(sz00,X1)
& sdtpldt0(X1,sz00) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddZero) ).
fof(m__2203,hypothesis,
( aElementOf0(xb,slsdtgt0(xb))
& ? [X1] :
( sdtasdt0(xb,X1) = xb
& aElement0(X1) )
& aElementOf0(sz00,slsdtgt0(xb))
& ? [X1] :
( sdtasdt0(xb,X1) = sz00
& aElement0(X1) )
& aElementOf0(xa,slsdtgt0(xa))
& ? [X1] :
( sdtasdt0(xa,X1) = xa
& aElement0(X1) )
& aElementOf0(sz00,slsdtgt0(xa))
& ? [X1] :
( sdtasdt0(xa,X1) = sz00
& aElement0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2203) ).
fof(m__2091,hypothesis,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2091) ).
fof(c_0_4,negated_conjecture,
~ ( aElementOf0(xb,xI)
| ? [X1,X2] :
( sdtpldt0(X1,X2) = xb
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) )
| ? [X1,X2] :
( sdtpldt0(X1,X2) = xb
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
~ ( aElementOf0(xb,xI)
| ? [X1,X2] :
( sdtpldt0(X1,X2) = xb
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
! [X56,X57] :
( ~ aElementOf0(xb,xI)
& ( sdtpldt0(X56,X57) != xb
| ~ aElementOf0(X57,slsdtgt0(xb))
| ~ aElementOf0(X56,slsdtgt0(xa)) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_7,plain,
! [X59] :
( ( ~ aElement0(X59)
| X59 = sdtpldt0(sz00,X59) )
& ( ~ aElement0(X59)
| sdtpldt0(X59,sz00) = X59 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])])]) ).
fof(c_0_8,hypothesis,
( aElementOf0(xb,slsdtgt0(xb))
& sdtasdt0(xb,esk11_0) = xb
& aElement0(esk11_0)
& aElementOf0(sz00,slsdtgt0(xb))
& sdtasdt0(xb,esk10_0) = sz00
& aElement0(esk10_0)
& aElementOf0(xa,slsdtgt0(xa))
& sdtasdt0(xa,esk9_0) = xa
& aElement0(esk9_0)
& aElementOf0(sz00,slsdtgt0(xa))
& sdtasdt0(xa,esk8_0) = sz00
& aElement0(esk8_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2203])]) ).
cnf(c_0_9,negated_conjecture,
( sdtpldt0(X1,X2) != xb
| ~ aElementOf0(X2,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ aElement0(X1)
| X1 = sdtpldt0(sz00,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
aElementOf0(sz00,slsdtgt0(xa)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,hypothesis,
aElementOf0(xb,slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])])]),c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG121+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.10/0.38 % Computer : n004.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 04:21:21 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.18/0.47 % Version: 3.5.1
% 0.18/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 % Starting sh5l with 300s (1) cores
% 0.18/0.47 % new_bool_1 with pid 2232342 completed with status 0
% 0.18/0.47 % Result found by new_bool_1
% 0.18/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.18/0.47 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 % Starting SubtermCWHack with 28s (1) cores
% 0.18/0.47 % SubtermCWHack with pid 2232346 completed with status 0
% 0.18/0.47 % Result found by SubtermCWHack
% 0.18/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.18/0.47 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 % Starting SubtermCWHack with 28s (1) cores
% 0.18/0.47 % Preprocessing time : 0.002 s
% 0.18/0.47
% 0.18/0.47 % Proof found!
% 0.18/0.47 % SZS status Theorem
% 0.18/0.47 % SZS output start CNFRefutation
% See solution above
% 0.18/0.47 % Parsed axioms : 53
% 0.18/0.47 % Removed by relevancy pruning/SinE : 5
% 0.18/0.47 % Initial clauses : 189
% 0.18/0.47 % Removed in clause preprocessing : 4
% 0.18/0.47 % Initial clauses in saturation : 185
% 0.18/0.47 % Processed clauses : 462
% 0.18/0.47 % ...of these trivial : 7
% 0.18/0.47 % ...subsumed : 170
% 0.18/0.47 % ...remaining for further processing : 285
% 0.18/0.47 % Other redundant clauses eliminated : 67
% 0.18/0.47 % Clauses deleted for lack of memory : 0
% 0.18/0.47 % Backward-subsumed : 11
% 0.18/0.47 % Backward-rewritten : 21
% 0.18/0.47 % Generated clauses : 1023
% 0.18/0.47 % ...of the previous two non-redundant : 647
% 0.18/0.47 % ...aggressively subsumed : 0
% 0.18/0.47 % Contextual simplify-reflections : 7
% 0.18/0.47 % Paramodulations : 957
% 0.18/0.47 % Factorizations : 0
% 0.18/0.47 % NegExts : 0
% 0.18/0.47 % Equation resolutions : 67
% 0.18/0.47 % Disequality decompositions : 0
% 0.18/0.47 % Total rewrite steps : 1030
% 0.18/0.47 % ...of those cached : 970
% 0.18/0.47 % Propositional unsat checks : 0
% 0.18/0.47 % Propositional check models : 0
% 0.18/0.47 % Propositional check unsatisfiable : 0
% 0.18/0.47 % Propositional clauses : 0
% 0.18/0.47 % Propositional clauses after purity: 0
% 0.18/0.47 % Propositional unsat core size : 0
% 0.18/0.47 % Propositional preprocessing time : 0.000
% 0.18/0.47 % Propositional encoding time : 0.000
% 0.18/0.47 % Propositional solver time : 0.000
% 0.18/0.47 % Success case prop preproc time : 0.000
% 0.18/0.47 % Success case prop encoding time : 0.000
% 0.18/0.47 % Success case prop solver time : 0.000
% 0.18/0.47 % Current number of processed clauses : 245
% 0.18/0.47 % Positive orientable unit clauses : 85
% 0.18/0.47 % Positive unorientable unit clauses: 0
% 0.18/0.47 % Negative unit clauses : 14
% 0.18/0.47 % Non-unit-clauses : 146
% 0.18/0.47 % Current number of unprocessed clauses: 277
% 0.18/0.47 % ...number of literals in the above : 1238
% 0.18/0.47 % Current number of archived formulas : 0
% 0.18/0.47 % Current number of archived clauses : 32
% 0.18/0.47 % Clause-clause subsumption calls (NU) : 2824
% 0.18/0.47 % Rec. Clause-clause subsumption calls : 2141
% 0.18/0.47 % Non-unit clause-clause subsumptions : 137
% 0.18/0.47 % Unit Clause-clause subsumption calls : 232
% 0.18/0.47 % Rewrite failures with RHS unbound : 0
% 0.18/0.47 % BW rewrite match attempts : 17
% 0.18/0.47 % BW rewrite match successes : 17
% 0.18/0.47 % Condensation attempts : 0
% 0.18/0.47 % Condensation successes : 0
% 0.18/0.47 % Termbank termtop insertions : 23061
% 0.18/0.47 % Search garbage collected termcells : 2393
% 0.18/0.47
% 0.18/0.47 % -------------------------------------------------
% 0.18/0.47 % User time : 0.019 s
% 0.18/0.47 % System time : 0.008 s
% 0.18/0.47 % Total time : 0.028 s
% 0.18/0.47 % Maximum resident set size: 3976 pages
% 0.18/0.47
% 0.18/0.47 % -------------------------------------------------
% 0.18/0.47 % User time : 0.025 s
% 0.18/0.47 % System time : 0.010 s
% 0.18/0.47 % Total time : 0.035 s
% 0.18/0.47 % Maximum resident set size: 4608 pages
% 0.18/0.47 % E exiting
%------------------------------------------------------------------------------