%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG050+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 : n007.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:38 PM UTC 2026
% Result : Theorem 0.28s 0.57s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 52 ( 15 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 52 ( 20 ~; 19 |; 4 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( aDimensionOf0(xs) != sz00
=> sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) )
=> sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mLETot,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> ( sdtlseqdt0(X2,X1)
| sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLETot) ).
fof(mSZeroSc,axiom,
aScalar0(sz0z00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSZeroSc) ).
fof(mDefSPZ,axiom,
! [X1,X2] :
( ( aVector0(X2)
& aVector0(X1) )
=> ( ( aDimensionOf0(X2) = sz00
& aDimensionOf0(X1) = aDimensionOf0(X2) )
=> sdtasasdt0(X1,X2) = sz0z00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSPZ) ).
fof(m__1542,hypothesis,
aVector0(xs),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1542) ).
fof(c_0_5,negated_conjecture,
~ ( ( aDimensionOf0(xs) != sz00
=> sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) )
=> sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X24,X25] :
( sdtlseqdt0(X25,X24)
| sdtlseqdt0(X24,X25)
| ~ aScalar0(X25)
| ~ aScalar0(X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLETot])])]) ).
fof(c_0_7,negated_conjecture,
~ ( ( aDimensionOf0(xs) != sz00
=> sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) )
=> sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtlseqdt0(X2,X1)
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
aScalar0(sz0z00),
inference(split_conjunct,[status(thm)],[mSZeroSc]) ).
fof(c_0_10,negated_conjecture,
( ~ sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs))
& ( sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs))
| aDimensionOf0(xs) = sz00 ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_11,plain,
! [X33,X34] :
( sdtasasdt0(X33,X34) = sz0z00
| aDimensionOf0(X34) != sz00
| aDimensionOf0(X33) != aDimensionOf0(X34)
| ~ aVector0(X34)
| ~ aVector0(X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSPZ])])]) ).
cnf(c_0_12,plain,
( ~ aScalar0(X1)
| sdtlseqdt0(X1,sz0z00)
| sdtlseqdt0(sz0z00,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs))
| aDimensionOf0(xs) = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( aDimensionOf0(X2) != sz00
| aDimensionOf0(X1) != aDimensionOf0(X2)
| ~ aVector0(X2)
| ~ aVector0(X1)
| sdtasasdt0(X1,X2) = sz0z00 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
sdtlseqdt0(sz0z00,sz0z00),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_17,negated_conjecture,
aDimensionOf0(xs) = sz00,
inference(sr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,hypothesis,
aVector0(xs),
inference(split_conjunct,[status(thm)],[m__1542]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : RNG050+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 % Computer : n007.cluster.edu
% 0.15/0.43 % Model : x86_64 x86_64
% 0.15/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.43 % Memory : 8046.5625MB
% 0.15/0.43 % OS : Linux 6.8.0-71-generic
% 0.15/0.44 % CPULimit : 300
% 0.15/0.44 % WCLimit : 300
% 0.15/0.44 % DateTime : Mon Sep 21 04:13:35 UTC 2026
% 0.15/0.44 % CPUTime :
% 0.15/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.28/0.51 Running first-order theorem proving
% 0.28/0.51 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.28/0.57 % Version: 3.5.1
% 0.28/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.57 % Starting sh5l with 300s (1) cores
% 0.28/0.57 % new_bool_1 with pid 149360 completed with status 0
% 0.28/0.57 % Result found by new_bool_1
% 0.28/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.57 % Search class: FGHSF-FFMS21-MFFFFFNN
% 0.28/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.28/0.57 % SubtermCWHack with pid 149363 completed with status 0
% 0.28/0.57 % Result found by SubtermCWHack
% 0.28/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.57 % Search class: FGHSF-FFMS21-MFFFFFNN
% 0.28/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.28/0.57 % Preprocessing time : 0.002 s
% 0.28/0.57
% 0.28/0.57 % Proof found!
% 0.28/0.57 % SZS status Theorem
% 0.28/0.57 % SZS output start CNFRefutation
% See solution above
% 0.28/0.57 % Parsed axioms : 39
% 0.28/0.57 % Removed by relevancy pruning/SinE : 8
% 0.28/0.57 % Initial clauses : 39
% 0.28/0.57 % Removed in clause preprocessing : 5
% 0.28/0.57 % Initial clauses in saturation : 34
% 0.28/0.57 % Processed clauses : 22
% 0.28/0.57 % ...of these trivial : 0
% 0.28/0.57 % ...subsumed : 0
% 0.28/0.57 % ...remaining for further processing : 22
% 0.28/0.57 % Other redundant clauses eliminated : 2
% 0.28/0.57 % Clauses deleted for lack of memory : 0
% 0.28/0.57 % Backward-subsumed : 0
% 0.28/0.57 % Backward-rewritten : 0
% 0.28/0.57 % Generated clauses : 17
% 0.28/0.57 % ...of the previous two non-redundant : 10
% 0.28/0.57 % ...aggressively subsumed : 0
% 0.28/0.57 % Contextual simplify-reflections : 0
% 0.28/0.57 % Paramodulations : 14
% 0.28/0.57 % Factorizations : 0
% 0.28/0.57 % NegExts : 0
% 0.28/0.57 % Equation resolutions : 3
% 0.28/0.57 % Disequality decompositions : 0
% 0.28/0.57 % Total rewrite steps : 7
% 0.28/0.57 % ...of those cached : 3
% 0.28/0.57 % Propositional unsat checks : 0
% 0.28/0.57 % Propositional check models : 0
% 0.28/0.57 % Propositional check unsatisfiable : 0
% 0.28/0.57 % Propositional clauses : 0
% 0.28/0.57 % Propositional clauses after purity: 0
% 0.28/0.57 % Propositional unsat core size : 0
% 0.28/0.57 % Propositional preprocessing time : 0.000
% 0.28/0.57 % Propositional encoding time : 0.000
% 0.28/0.57 % Propositional solver time : 0.000
% 0.28/0.57 % Success case prop preproc time : 0.000
% 0.28/0.57 % Success case prop encoding time : 0.000
% 0.28/0.57 % Success case prop solver time : 0.000
% 0.28/0.57 % Current number of processed clauses : 22
% 0.28/0.57 % Positive orientable unit clauses : 5
% 0.28/0.57 % Positive unorientable unit clauses: 0
% 0.28/0.57 % Negative unit clauses : 2
% 0.28/0.57 % Non-unit-clauses : 15
% 0.28/0.57 % Current number of unprocessed clauses: 22
% 0.28/0.57 % ...number of literals in the above : 107
% 0.28/0.57 % Current number of archived formulas : 0
% 0.28/0.57 % Current number of archived clauses : 0
% 0.28/0.57 % Clause-clause subsumption calls (NU) : 36
% 0.28/0.57 % Rec. Clause-clause subsumption calls : 27
% 0.28/0.57 % Non-unit clause-clause subsumptions : 0
% 0.28/0.57 % Unit Clause-clause subsumption calls : 19
% 0.28/0.57 % Rewrite failures with RHS unbound : 0
% 0.28/0.57 % BW rewrite match attempts : 0
% 0.28/0.57 % BW rewrite match successes : 0
% 0.28/0.57 % Condensation attempts : 0
% 0.28/0.57 % Condensation successes : 0
% 0.28/0.57 % Termbank termtop insertions : 3919
% 0.28/0.57 % Search garbage collected termcells : 702
% 0.28/0.57
% 0.28/0.57 % -------------------------------------------------
% 0.28/0.57 % User time : 0.010 s
% 0.28/0.57 % System time : 0.005 s
% 0.28/0.57 % Total time : 0.014 s
% 0.28/0.57 % Maximum resident set size: 3680 pages
% 0.28/0.57
% 0.28/0.57 % -------------------------------------------------
% 0.28/0.57 % User time : 0.013 s
% 0.28/0.57 % System time : 0.011 s
% 0.28/0.57 % Total time : 0.024 s
% 0.28/0.57 % Maximum resident set size: 4864 pages
% 0.28/0.57 % E exiting
%------------------------------------------------------------------------------