%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU519^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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 : Wed Sep 30 08:24:21 AM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 29 ( 0 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 89 ( 7 ~; 4 |; 3 &; 61 @)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 21 ( 0 ^; 21 !; 0 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
emptyset: $i ).
thf(decl_25,type,
powerset: $i > $i ).
thf(decl_26,type,
emptysetE: $o ).
thf(decl_27,type,
powersetI: $o ).
thf(decl_28,type,
esk1_2: $i > $i > $i ).
thf(decl_29,type,
esk2_0: $i ).
thf(emptyinPowerset,conjecture,
( emptysetE
=> ( powersetI
=> ! [X3: $i] : ( in @ emptyset @ ( powerset @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zAS6jjj1rx/E---3.1_1311439.p',emptyinPowerset) ).
thf(emptysetE,axiom,
( emptysetE
<=> ! [X1: $i] :
( ( in @ X1 @ emptyset )
=> ! [X2: $o] : X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.zAS6jjj1rx/E---3.1_1311439.p',emptysetE) ).
thf(powersetI,axiom,
( powersetI
<=> ! [X3: $i,X4: $i] :
( ! [X1: $i] :
( ( in @ X1 @ X4 )
=> ( in @ X1 @ X3 ) )
=> ( in @ X4 @ ( powerset @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zAS6jjj1rx/E---3.1_1311439.p',powersetI) ).
thf(c_0_3,negated_conjecture,
~ ( emptysetE
=> ( powersetI
=> ! [X3: $i] : ( in @ emptyset @ ( powerset @ X3 ) ) ) ),
inference(assume_negation,[status(cth)],[emptyinPowerset]) ).
thf(c_0_4,negated_conjecture,
~ ( ! [X11: $i] :
( ( in @ X11 @ emptyset )
=> ! [X12: $o] : X12 )
=> ( ! [X13: $i,X14: $i] :
( ! [X15: $i] :
( ( in @ X15 @ X14 )
=> ( in @ X15 @ X13 ) )
=> ( in @ X14 @ ( powerset @ X13 ) ) )
=> ! [X3: $i] : ( in @ emptyset @ ( powerset @ X3 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_3,emptysetE]),powersetI]) ).
thf(c_0_5,negated_conjecture,
! [X16: $i,X17: $o,X18: $i,X19: $i] :
( ( ~ ( in @ X16 @ emptyset )
| X17 )
& ( ( in @ ( esk1_2 @ X18 @ X19 ) @ X19 )
| ( in @ X19 @ ( powerset @ X18 ) ) )
& ( ~ ( in @ ( esk1_2 @ X18 @ X19 ) @ X18 )
| ( in @ X19 @ ( powerset @ X18 ) ) )
& ~ ( in @ emptyset @ ( powerset @ esk2_0 ) ) ),
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_4])])])])])]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i] :
~ ( in @ X1 @ emptyset ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_5])])]) ).
thf(c_0_7,negated_conjecture,
! [X3: $i,X1: $i] :
( ( in @ ( esk1_2 @ X1 @ X3 ) @ X3 )
| ( in @ X3 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
~ ( in @ emptyset @ ( powerset @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i] : ( in @ emptyset @ ( powerset @ X1 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU519^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n004.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:47:37 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.zAS6jjj1rx/E---3.1_1311439.p
% 0.08/0.25 % Version: 3.5.1-ho
% 0.08/0.25 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.08/0.25 % Starting post_as_ho8 with 300s (1) cores
% 0.08/0.25 % Starting post_as_ho3 with 300s (1) cores
% 0.08/0.25 % Starting post_as_ho2 with 300s (1) cores
% 0.08/0.25 % lpo6_lambda_fix with pid 1311476 completed with status 0
% 0.08/0.25 % Result found by lpo6_lambda_fix
% 0.08/0.25 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.08/0.25 % No SInE strategy applied
% 0.08/0.25 % Search class: HGUNF-FFSF21-SFFFMFNN
% 0.08/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.25 % Starting lpo6_lambda_fix with 151s (1) cores
% 0.08/0.25 % Starting sh5l with 136s (1) cores
% 0.08/0.25 % Starting new_bool_1 with 136s (1) cores
% 0.08/0.25 % Starting new_bool_2 with 136s (1) cores
% 0.08/0.25 % SubtermCWHack with pid 1311482 completed with status 0
% 0.08/0.25 % Result found by SubtermCWHack
% 0.08/0.25 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.08/0.25 % No SInE strategy applied
% 0.08/0.25 % Search class: HGUNF-FFSF21-SFFFMFNN
% 0.08/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.25 % Preprocessing time : 0.001 s
% 0.08/0.25
% 0.08/0.25 % Proof found!
% 0.08/0.25 % SZS status Theorem
% 0.08/0.25 % SZS output start CNFRefutation
% See solution above
% 0.08/0.25 % Parsed axioms : 8
% 0.08/0.25 % Removed by relevancy pruning/SinE : 0
% 0.08/0.25 % Initial clauses : 9
% 0.08/0.25 % Removed in clause preprocessing : 5
% 0.08/0.25 % Initial clauses in saturation : 4
% 0.08/0.25 % Processed clauses : 4
% 0.08/0.25 % ...of these trivial : 0
% 0.08/0.25 % ...subsumed : 0
% 0.08/0.25 % ...remaining for further processing : 4
% 0.08/0.25 % Other redundant clauses eliminated : 0
% 0.08/0.25 % Clauses deleted for lack of memory : 0
% 0.08/0.25 % Backward-subsumed : 0
% 0.08/0.25 % Backward-rewritten : 1
% 0.08/0.25 % Generated clauses : 1
% 0.08/0.25 % ...of the previous two non-redundant : 1
% 0.08/0.25 % ...aggressively subsumed : 0
% 0.08/0.25 % Contextual simplify-reflections : 0
% 0.08/0.25 % Paramodulations : 1
% 0.08/0.25 % Factorizations : 0
% 0.08/0.25 % NegExts : 0
% 0.08/0.25 % Equation resolutions : 0
% 0.08/0.25 % Disequality decompositions : 0
% 0.08/0.25 % Total rewrite steps : 1
% 0.08/0.25 % ...of those cached : 0
% 0.08/0.25 % Propositional unsat checks : 0
% 0.08/0.25 % Propositional check models : 0
% 0.08/0.25 % Propositional check unsatisfiable : 0
% 0.08/0.25 % Propositional clauses : 0
% 0.08/0.25 % Propositional clauses after purity: 0
% 0.08/0.25 % Propositional unsat core size : 0
% 0.08/0.25 % Propositional preprocessing time : 0.000
% 0.08/0.25 % Propositional encoding time : 0.000
% 0.08/0.25 % Propositional solver time : 0.000
% 0.08/0.25 % Success case prop preproc time : 0.000
% 0.08/0.25 % Success case prop encoding time : 0.000
% 0.08/0.25 % Success case prop solver time : 0.000
% 0.08/0.25 % Current number of processed clauses : 3
% 0.08/0.25 % Positive orientable unit clauses : 1
% 0.08/0.25 % Positive unorientable unit clauses: 0
% 0.08/0.25 % Negative unit clauses : 1
% 0.08/0.25 % Non-unit-clauses : 1
% 0.08/0.25 % Current number of unprocessed clauses: 1
% 0.08/0.25 % ...number of literals in the above : 2
% 0.08/0.25 % Current number of archived formulas : 0
% 0.08/0.25 % Current number of archived clauses : 1
% 0.08/0.25 % Clause-clause subsumption calls (NU) : 0
% 0.08/0.25 % Rec. Clause-clause subsumption calls : 0
% 0.08/0.25 % Non-unit clause-clause subsumptions : 0
% 0.08/0.25 % Unit Clause-clause subsumption calls : 1
% 0.08/0.25 % Rewrite failures with RHS unbound : 0
% 0.08/0.25 % BW rewrite match attempts : 1
% 0.08/0.25 % BW rewrite match successes : 1
% 0.08/0.25 % Condensation attempts : 0
% 0.08/0.25 % Condensation successes : 0
% 0.08/0.25 % Termbank termtop insertions : 506
% 0.08/0.25 % Search garbage collected termcells : 164
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.001 s
% 0.08/0.25 % System time : 0.003 s
% 0.08/0.25 % Total time : 0.005 s
% 0.08/0.25 % Maximum resident set size: 3632 pages
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.006 s
% 0.08/0.25 % System time : 0.011 s
% 0.08/0.25 % Total time : 0.017 s
% 0.08/0.25 % Maximum resident set size: 4864 pages
% 0.08/0.25 % E exiting
%------------------------------------------------------------------------------