%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU115+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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 02:23:50 PM UTC 2026
% Result : Theorem 0.24s 0.56s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 12 unt; 0 def)
% Number of atoms : 24 ( 11 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 10 ~; 4 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 6 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t28_finsub_1,conjecture,
finite_subsets(empty_set) = singleton(empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_finsub_1) ).
fof(t1_zfmisc_1,axiom,
powerset(empty_set) = singleton(empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_zfmisc_1) ).
fof(t27_finsub_1,axiom,
! [X1] :
( finite(X1)
=> finite_subsets(X1) = powerset(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t27_finsub_1) ).
fof(cc1_finset_1,axiom,
! [X1] :
( empty(X1)
=> finite(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_finset_1) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(c_0_5,negated_conjecture,
finite_subsets(empty_set) != singleton(empty_set),
inference(assume_negation,[status(cth)],[t28_finsub_1]) ).
fof(c_0_6,negated_conjecture,
finite_subsets(empty_set) != singleton(empty_set),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_7,negated_conjecture,
finite_subsets(empty_set) != singleton(empty_set),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_8,negated_conjecture,
finite_subsets(empty_set) != singleton(empty_set),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_9,plain,
powerset(empty_set) = singleton(empty_set),
inference(split_conjunct,[status(thm)],[t1_zfmisc_1]) ).
fof(c_0_10,plain,
! [X11] :
( finite_subsets(X11) = powerset(X11)
| ~ finite(X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t27_finsub_1])])]) ).
cnf(c_0_11,negated_conjecture,
finite_subsets(empty_set) != powerset(empty_set),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( ~ finite(X1)
| finite_subsets(X1) = powerset(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X12] :
( finite(X12)
| ~ empty(X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_finset_1])])]) ).
cnf(c_0_14,negated_conjecture,
~ finite(empty_set),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ empty(X1)
| finite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU115+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n005.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.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 05:51:03 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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.24/0.56 % Version: 3.5.1
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.56 % Starting sh5l with 300s (1) cores
% 0.24/0.56 % new_bool_3 with pid 2691091 completed with status 0
% 0.24/0.56 % Result found by new_bool_3
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.56 % Search class: FGUSM-FFSS11-SFFFFFNN
% 0.24/0.56 % partial match(1): FGUSM-FFSS21-SFFFFFNN
% 0.24/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.56 % SubtermCWHack with pid 2691094 completed with status 0
% 0.24/0.56 % Result found by SubtermCWHack
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.56 % Search class: FGUSM-FFSS11-SFFFFFNN
% 0.24/0.56 % partial match(1): FGUSM-FFSS21-SFFFFFNN
% 0.24/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.56 % Preprocessing time : 0.001 s
% 0.24/0.56
% 0.24/0.56 % Proof found!
% 0.24/0.56 % SZS status Theorem
% 0.24/0.56 % SZS output start CNFRefutation
% See solution above
% 0.24/0.56 % Parsed axioms : 35
% 0.24/0.56 % Removed by relevancy pruning/SinE : 10
% 0.24/0.56 % Initial clauses : 40
% 0.24/0.56 % Removed in clause preprocessing : 0
% 0.24/0.56 % Initial clauses in saturation : 40
% 0.24/0.56 % Processed clauses : 34
% 0.24/0.56 % ...of these trivial : 1
% 0.24/0.56 % ...subsumed : 3
% 0.24/0.56 % ...remaining for further processing : 30
% 0.24/0.56 % Other redundant clauses eliminated : 0
% 0.24/0.56 % Clauses deleted for lack of memory : 0
% 0.24/0.56 % Backward-subsumed : 0
% 0.24/0.56 % Backward-rewritten : 2
% 0.24/0.56 % Generated clauses : 10
% 0.24/0.56 % ...of the previous two non-redundant : 6
% 0.24/0.56 % ...aggressively subsumed : 0
% 0.24/0.56 % Contextual simplify-reflections : 0
% 0.24/0.56 % Paramodulations : 10
% 0.24/0.56 % Factorizations : 0
% 0.24/0.56 % NegExts : 0
% 0.24/0.56 % Equation resolutions : 0
% 0.24/0.56 % Disequality decompositions : 0
% 0.24/0.56 % Total rewrite steps : 10
% 0.24/0.56 % ...of those cached : 2
% 0.24/0.56 % Propositional unsat checks : 0
% 0.24/0.56 % Propositional check models : 0
% 0.24/0.56 % Propositional check unsatisfiable : 0
% 0.24/0.56 % Propositional clauses : 0
% 0.24/0.56 % Propositional clauses after purity: 0
% 0.24/0.56 % Propositional unsat core size : 0
% 0.24/0.56 % Propositional preprocessing time : 0.000
% 0.24/0.56 % Propositional encoding time : 0.000
% 0.24/0.56 % Propositional solver time : 0.000
% 0.24/0.56 % Success case prop preproc time : 0.000
% 0.24/0.56 % Success case prop encoding time : 0.000
% 0.24/0.56 % Success case prop solver time : 0.000
% 0.24/0.56 % Current number of processed clauses : 28
% 0.24/0.56 % Positive orientable unit clauses : 14
% 0.24/0.56 % Positive unorientable unit clauses: 0
% 0.24/0.56 % Negative unit clauses : 7
% 0.24/0.56 % Non-unit-clauses : 7
% 0.24/0.56 % Current number of unprocessed clauses: 12
% 0.24/0.56 % ...number of literals in the above : 26
% 0.24/0.56 % Current number of archived formulas : 0
% 0.24/0.56 % Current number of archived clauses : 2
% 0.24/0.56 % Clause-clause subsumption calls (NU) : 2
% 0.24/0.56 % Rec. Clause-clause subsumption calls : 2
% 0.24/0.56 % Non-unit clause-clause subsumptions : 0
% 0.24/0.56 % Unit Clause-clause subsumption calls : 2
% 0.24/0.56 % Rewrite failures with RHS unbound : 0
% 0.24/0.56 % BW rewrite match attempts : 2
% 0.24/0.56 % BW rewrite match successes : 2
% 0.24/0.56 % Condensation attempts : 0
% 0.24/0.56 % Condensation successes : 0
% 0.24/0.56 % Termbank termtop insertions : 1795
% 0.24/0.56 % Search garbage collected termcells : 310
% 0.24/0.56
% 0.24/0.56 % -------------------------------------------------
% 0.24/0.56 % User time : 0.005 s
% 0.24/0.56 % System time : 0.004 s
% 0.24/0.56 % Total time : 0.010 s
% 0.24/0.56 % Maximum resident set size: 3660 pages
% 0.24/0.56
% 0.24/0.56 % -------------------------------------------------
% 0.24/0.56 % User time : 0.008 s
% 0.24/0.56 % System time : 0.010 s
% 0.24/0.56 % Total time : 0.018 s
% 0.24/0.56 % Maximum resident set size: 4864 pages
% 0.24/0.56 % E exiting
%------------------------------------------------------------------------------