%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM531+2 : 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 : n005.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 01:49:27 PM UTC 2026
% Result : Theorem 0.28s 0.57s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 8 unt; 0 def)
% Number of atoms : 32 ( 4 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 31 ( 14 ~; 4 |; 9 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn 6 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> ~ ( X1 = slcrc0
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mCountNFin,axiom,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> ~ isFinite0(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCountNFin) ).
fof(mEmpFin,axiom,
isFinite0(slcrc0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEmpFin) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> ~ ( X1 = slcrc0
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,plain,
! [X1] :
( ( isCountable0(X1)
& aSet0(X1) )
=> ~ isFinite0(X1) ),
inference(fof_simplification,[status(thm)],[mCountNFin]) ).
fof(c_0_5,negated_conjecture,
! [X4] :
( esk1_0 = slcrc0
& ~ aElementOf0(X4,esk1_0)
& isCountable0(esk1_0)
& aSet0(esk1_0) ),
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_3])])])])]) ).
fof(c_0_6,plain,
! [X12] :
( ~ isFinite0(X12)
| ~ isCountable0(X12)
| ~ aSet0(X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,negated_conjecture,
isCountable0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = slcrc0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
aSet0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ isFinite0(X1)
| ~ isCountable0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
isCountable0(slcrc0),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
isFinite0(slcrc0),
inference(split_conjunct,[status(thm)],[mEmpFin]) ).
cnf(c_0_13,negated_conjecture,
aSet0(slcrc0),
inference(rw,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM531+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.43 % Computer : n005.cluster.edu
% 0.19/0.43 % Model : x86_64 x86_64
% 0.19/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.43 % Memory : 8046.5625MB
% 0.19/0.43 % OS : Linux 6.8.0-71-generic
% 0.19/0.43 % CPULimit : 300
% 0.19/0.43 % WCLimit : 300
% 0.19/0.43 % DateTime : Mon Sep 21 02:38:02 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.51 Running first-order theorem proving
% 0.19/0.51 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.28/0.57 % Version: 3.5.1
% 0.28/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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_3 with pid 2369943 completed with status 0
% 0.28/0.57 % Result found by new_bool_3
% 0.28/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.57 % Starting new_bool_3 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-FFSS11-SFFFFFNN
% 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 2369947 completed with status 0
% 0.28/0.57 % Result found by SubtermCWHack
% 0.28/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.57 % Starting new_bool_3 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-FFSS11-SFFFFFNN
% 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 : 9
% 0.28/0.57 % Removed by relevancy pruning/SinE : 0
% 0.28/0.57 % Initial clauses : 14
% 0.28/0.57 % Removed in clause preprocessing : 4
% 0.28/0.57 % Initial clauses in saturation : 10
% 0.28/0.57 % Processed clauses : 9
% 0.28/0.57 % ...of these trivial : 0
% 0.28/0.57 % ...subsumed : 0
% 0.28/0.57 % ...remaining for further processing : 9
% 0.28/0.57 % Other redundant clauses eliminated : 1
% 0.28/0.57 % Clauses deleted for lack of memory : 0
% 0.28/0.57 % Backward-subsumed : 0
% 0.28/0.57 % Backward-rewritten : 2
% 0.28/0.57 % Generated clauses : 2
% 0.28/0.57 % ...of the previous two non-redundant : 2
% 0.28/0.57 % ...aggressively subsumed : 0
% 0.28/0.57 % Contextual simplify-reflections : 0
% 0.28/0.57 % Paramodulations : 1
% 0.28/0.57 % Factorizations : 0
% 0.28/0.57 % NegExts : 0
% 0.28/0.57 % Equation resolutions : 1
% 0.28/0.57 % Disequality decompositions : 0
% 0.28/0.57 % Total rewrite steps : 6
% 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 : 6
% 0.28/0.57 % Positive orientable unit clauses : 4
% 0.28/0.57 % Positive unorientable unit clauses: 0
% 0.28/0.57 % Negative unit clauses : 1
% 0.28/0.57 % Non-unit-clauses : 1
% 0.28/0.57 % Current number of unprocessed clauses: 3
% 0.28/0.57 % ...number of literals in the above : 8
% 0.28/0.57 % Current number of archived formulas : 0
% 0.28/0.57 % Current number of archived clauses : 2
% 0.28/0.57 % Clause-clause subsumption calls (NU) : 0
% 0.28/0.57 % Rec. Clause-clause subsumption calls : 0
% 0.28/0.57 % Non-unit clause-clause subsumptions : 0
% 0.28/0.57 % Unit Clause-clause subsumption calls : 0
% 0.28/0.57 % Rewrite failures with RHS unbound : 0
% 0.28/0.57 % BW rewrite match attempts : 1
% 0.28/0.57 % BW rewrite match successes : 1
% 0.28/0.57 % Condensation attempts : 0
% 0.28/0.57 % Condensation successes : 0
% 0.28/0.57 % Termbank termtop insertions : 743
% 0.28/0.57 % Search garbage collected termcells : 192
% 0.28/0.57
% 0.28/0.57 % -------------------------------------------------
% 0.28/0.57 % User time : 0.007 s
% 0.28/0.57 % System time : 0.003 s
% 0.28/0.57 % Total time : 0.010 s
% 0.28/0.57 % Maximum resident set size: 3580 pages
% 0.28/0.57
% 0.28/0.57 % -------------------------------------------------
% 0.28/0.57 % User time : 0.011 s
% 0.28/0.57 % System time : 0.008 s
% 0.28/0.57 % Total time : 0.019 s
% 0.28/0.57 % Maximum resident set size: 4608 pages
% 0.28/0.57 % E exiting
%------------------------------------------------------------------------------