%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : RNG111+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 : n009.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:26 PM UTC 2026
% Result : Theorem 0.23s 0.60s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 116 ( 51 equ)
% Maximal formula atoms : 25 ( 5 avg)
% Number of connectives : 150 ( 56 ~; 45 |; 31 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-1 aty)
% Number of variables : 29 ( 0 sgn 15 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
! [X1] :
( ( X1 != sz00
& aElementOf0(X1,xI) )
=> ( ! [X2] :
( ( X2 != sz00
& aElementOf0(X2,xI) )
=> ( iLess0(sbrdtbr0(X2),sbrdtbr0(X1))
=> ? [X3] :
( ! [X4] :
( ( X4 != sz00
& aElementOf0(X4,xI) )
=> ~ iLess0(sbrdtbr0(X4),sbrdtbr0(X3)) )
& X3 != sz00
& aElementOf0(X3,xI) ) ) )
=> ? [X2] :
( ! [X3] :
( ( X3 != sz00
& aElementOf0(X3,xI) )
=> ~ iLess0(sbrdtbr0(X3),sbrdtbr0(X2)) )
& X2 != sz00
& aElementOf0(X2,xI) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ( X1 != sz00
& aElementOf0(X1,xI) )
=> ( ! [X2] :
( ( X2 != sz00
& aElementOf0(X2,xI) )
=> ( iLess0(sbrdtbr0(X2),sbrdtbr0(X1))
=> ? [X3] :
( ! [X4] :
( ( X4 != sz00
& aElementOf0(X4,xI) )
=> ~ iLess0(sbrdtbr0(X4),sbrdtbr0(X3)) )
& X3 != sz00
& aElementOf0(X3,xI) ) ) )
=> ? [X2] :
( ! [X3] :
( ( X3 != sz00
& aElementOf0(X3,xI) )
=> ~ iLess0(sbrdtbr0(X3),sbrdtbr0(X2)) )
& X2 != sz00
& aElementOf0(X2,xI) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ( X1 != sz00
& aElementOf0(X1,xI) )
=> ( ! [X2] :
( ( X2 != sz00
& aElementOf0(X2,xI) )
=> ( iLess0(sbrdtbr0(X2),sbrdtbr0(X1))
=> ? [X3] :
( ! [X4] :
( ( X4 != sz00
& aElementOf0(X4,xI) )
=> ~ iLess0(sbrdtbr0(X4),sbrdtbr0(X3)) )
& X3 != sz00
& aElementOf0(X3,xI) ) ) )
=> ? [X2] :
( ! [X3] :
( ( X3 != sz00
& aElementOf0(X3,xI) )
=> ~ iLess0(sbrdtbr0(X3),sbrdtbr0(X2)) )
& X2 != sz00
& aElementOf0(X2,xI) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
! [X118,X120,X121] :
( ( X121 = sz00
| ~ aElementOf0(X121,xI)
| iLess0(sbrdtbr0(esk24_1(X121)),sbrdtbr0(X121)) )
& ( X121 = sz00
| ~ aElementOf0(X121,xI)
| esk24_1(X121) != sz00 )
& ( X121 = sz00
| ~ aElementOf0(X121,xI)
| aElementOf0(esk24_1(X121),xI) )
& ( X118 = sz00
| ~ aElementOf0(X118,xI)
| ~ iLess0(sbrdtbr0(X118),sbrdtbr0(esk22_0))
| ~ iLess0(sbrdtbr0(X120),sbrdtbr0(esk23_1(X118)))
| X120 = sz00
| ~ aElementOf0(X120,xI) )
& ( X118 = sz00
| ~ aElementOf0(X118,xI)
| ~ iLess0(sbrdtbr0(X118),sbrdtbr0(esk22_0))
| esk23_1(X118) != sz00 )
& ( X118 = sz00
| ~ aElementOf0(X118,xI)
| ~ iLess0(sbrdtbr0(X118),sbrdtbr0(esk22_0))
| aElementOf0(esk23_1(X118),xI) )
& esk22_0 != sz00
& aElementOf0(esk22_0,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(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).
cnf(c_0_4,negated_conjecture,
( ~ aElementOf0(X1,xI)
| X1 = sz00
| iLess0(sbrdtbr0(esk24_1(X1)),sbrdtbr0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
aElementOf0(esk22_0,xI),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
esk22_0 != sz00,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
( ~ aElementOf0(X1,xI)
| X1 = sz00
| aElementOf0(esk24_1(X1),xI) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( ~ aElementOf0(X1,xI)
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk22_0))
| X1 = sz00
| aElementOf0(esk23_1(X1),xI) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
iLess0(sbrdtbr0(esk24_1(esk22_0)),sbrdtbr0(esk22_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
cnf(c_0_10,negated_conjecture,
aElementOf0(esk24_1(esk22_0),xI),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_5]),c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( ~ aElementOf0(X2,xI)
| ~ iLess0(sbrdtbr0(X2),sbrdtbr0(esk22_0))
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk23_1(X2)))
| ~ aElementOf0(X1,xI)
| X2 = sz00
| X1 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
( aElementOf0(esk23_1(esk24_1(esk22_0)),xI)
| esk24_1(esk22_0) = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_13,negated_conjecture,
( ~ aElementOf0(X1,xI)
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk23_1(esk24_1(esk22_0))))
| X1 = sz00
| esk24_1(esk22_0) = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_9]),c_0_10])]) ).
cnf(c_0_14,negated_conjecture,
( iLess0(sbrdtbr0(esk24_1(esk23_1(esk24_1(esk22_0)))),sbrdtbr0(esk23_1(esk24_1(esk22_0))))
| esk24_1(esk22_0) = sz00
| esk23_1(esk24_1(esk22_0)) = sz00 ),
inference(spm,[status(thm)],[c_0_4,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( aElementOf0(esk24_1(esk23_1(esk24_1(esk22_0))),xI)
| esk24_1(esk22_0) = sz00
| esk23_1(esk24_1(esk22_0)) = sz00 ),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( ~ aElementOf0(X1,xI)
| esk24_1(X1) != sz00
| X1 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_17,negated_conjecture,
( esk24_1(esk22_0) = sz00
| esk23_1(esk24_1(esk22_0)) = sz00
| esk24_1(esk23_1(esk24_1(esk22_0))) = sz00 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( ~ aElementOf0(X1,xI)
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk22_0))
| esk23_1(X1) != sz00
| X1 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_19,negated_conjecture,
( esk24_1(esk22_0) = sz00
| esk23_1(esk24_1(esk22_0)) = sz00 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_12]) ).
cnf(c_0_20,negated_conjecture,
esk24_1(esk22_0) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_9]),c_0_10])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_20]),c_0_5])]),c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : RNG111+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 : n009.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.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 04:20:43 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.45 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.60 % Version: 3.5.1
% 0.23/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.60 % Starting sh5l with 300s (1) cores
% 0.23/0.60 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 833560 completed with status 0
% 0.23/0.60 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.23/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.60 % No SInE strategy applied
% 0.23/0.60 % Search class: FGHSF-FSMM32-MFFFFFNN
% 0.23/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.23/0.60 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.60 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.60 % new_bool_3 with pid 833569 completed with status 0
% 0.23/0.60 % Result found by new_bool_3
% 0.23/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.60 % No SInE strategy applied
% 0.23/0.60 % Search class: FGHSF-FSMM32-MFFFFFNN
% 0.23/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/0.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.23/0.60 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.60 % Preprocessing time : 0.002 s
% 0.23/0.60 % Presaturation interreduction done
% 0.23/0.60
% 0.23/0.60 % Proof found!
% 0.23/0.60 % SZS status Theorem
% 0.23/0.60 % SZS output start CNFRefutation
% See solution above
% 0.23/0.60 % Parsed axioms : 45
% 0.23/0.60 % Removed by relevancy pruning/SinE : 0
% 0.23/0.60 % Initial clauses : 113
% 0.23/0.60 % Removed in clause preprocessing : 4
% 0.23/0.60 % Initial clauses in saturation : 109
% 0.23/0.60 % Processed clauses : 434
% 0.23/0.60 % ...of these trivial : 36
% 0.23/0.60 % ...subsumed : 28
% 0.23/0.60 % ...remaining for further processing : 370
% 0.23/0.60 % Other redundant clauses eliminated : 16
% 0.23/0.60 % Clauses deleted for lack of memory : 0
% 0.23/0.60 % Backward-subsumed : 13
% 0.23/0.60 % Backward-rewritten : 39
% 0.23/0.60 % Generated clauses : 1496
% 0.23/0.60 % ...of the previous two non-redundant : 1289
% 0.23/0.60 % ...aggressively subsumed : 0
% 0.23/0.60 % Contextual simplify-reflections : 3
% 0.23/0.60 % Paramodulations : 1482
% 0.23/0.60 % Factorizations : 0
% 0.23/0.60 % NegExts : 0
% 0.23/0.60 % Equation resolutions : 16
% 0.23/0.60 % Disequality decompositions : 0
% 0.23/0.60 % Total rewrite steps : 1012
% 0.23/0.60 % ...of those cached : 947
% 0.23/0.60 % Propositional unsat checks : 0
% 0.23/0.60 % Propositional check models : 0
% 0.23/0.60 % Propositional check unsatisfiable : 0
% 0.23/0.60 % Propositional clauses : 0
% 0.23/0.60 % Propositional clauses after purity: 0
% 0.23/0.60 % Propositional unsat core size : 0
% 0.23/0.60 % Propositional preprocessing time : 0.000
% 0.23/0.60 % Propositional encoding time : 0.000
% 0.23/0.60 % Propositional solver time : 0.000
% 0.23/0.60 % Success case prop preproc time : 0.000
% 0.23/0.60 % Success case prop encoding time : 0.000
% 0.23/0.60 % Success case prop solver time : 0.000
% 0.23/0.60 % Current number of processed clauses : 195
% 0.23/0.60 % Positive orientable unit clauses : 101
% 0.23/0.60 % Positive unorientable unit clauses: 0
% 0.23/0.60 % Negative unit clauses : 3
% 0.23/0.60 % Non-unit-clauses : 91
% 0.23/0.60 % Current number of unprocessed clauses: 1069
% 0.23/0.60 % ...number of literals in the above : 2763
% 0.23/0.60 % Current number of archived formulas : 0
% 0.23/0.60 % Current number of archived clauses : 161
% 0.23/0.60 % Clause-clause subsumption calls (NU) : 3557
% 0.23/0.60 % Rec. Clause-clause subsumption calls : 1110
% 0.23/0.60 % Non-unit clause-clause subsumptions : 44
% 0.23/0.60 % Unit Clause-clause subsumption calls : 593
% 0.23/0.60 % Rewrite failures with RHS unbound : 0
% 0.23/0.60 % BW rewrite match attempts : 47
% 0.23/0.60 % BW rewrite match successes : 3
% 0.23/0.60 % Condensation attempts : 0
% 0.23/0.60 % Condensation successes : 0
% 0.23/0.60 % Termbank termtop insertions : 30530
% 0.23/0.60 % Search garbage collected termcells : 2103
% 0.23/0.60
% 0.23/0.60 % -------------------------------------------------
% 0.23/0.60 % User time : 0.045 s
% 0.23/0.60 % System time : 0.009 s
% 0.23/0.60 % Total time : 0.054 s
% 0.23/0.60 % Maximum resident set size: 3952 pages
% 0.23/0.60
% 0.23/0.60 % -------------------------------------------------
% 0.23/0.60 % User time : 0.200 s
% 0.23/0.60 % System time : 0.027 s
% 0.23/0.60 % Total time : 0.227 s
% 0.23/0.60 % Maximum resident set size: 4608 pages
% 0.23/0.60 % E exiting
%------------------------------------------------------------------------------