%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU817^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:25:45 AM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 112 ( 13 equ; 0 cnn)
% Maximal formula atoms : 17 ( 5 avg)
% Number of connectives : 265 ( 18 ~; 20 |; 21 &; 169 @)
% ( 1 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 55 ( 7 ^; 43 !; 5 ?; 55 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_25,type,
powerset: $i > $i ).
thf(decl_26,type,
nonempty: $i > $o ).
thf(decl_27,type,
subset: $i > $i > $o ).
thf(decl_28,type,
subsetE: $o ).
thf(decl_29,type,
transitiveset: $i > $o ).
thf(decl_30,type,
stricttotalorderedByIn: $i > $o ).
thf(decl_31,type,
wellorderedByIn: $i > $o ).
thf(decl_32,type,
ordinal: $i > $o ).
thf(decl_33,type,
esk1_0: $i ).
thf(decl_34,type,
esk2_1: $i > $i ).
thf(decl_35,type,
esk3_0: $i ).
thf(decl_36,type,
esk4_0: $i ).
thf(ordinal,axiom,
( ordinal
= ( ^ [X1: $i] :
( ( transitiveset @ X1 )
& ( wellorderedByIn @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.iHyqPMKGFg/E---3.1_3248159.p',ordinal) ).
thf(transitiveset,axiom,
( transitiveset
= ( ^ [X2: $i] :
! [X4: $i] :
( ( in @ X4 @ X2 )
=> ( subset @ X4 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.iHyqPMKGFg/E---3.1_3248159.p',transitiveset) ).
thf(wellorderedByIn,axiom,
( wellorderedByIn
= ( ^ [X2: $i] :
( ( stricttotalorderedByIn @ X2 )
& ! [X4: $i] :
( ( in @ X4 @ ( powerset @ X2 ) )
=> ( ( nonempty @ X4 )
=> ? [X1: $i] :
( ( in @ X1 @ X4 )
& ! [X5: $i] :
( ( in @ X5 @ X4 )
=> ( ( X1 = X5 )
| ( in @ X1 @ X5 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.iHyqPMKGFg/E---3.1_3248159.p',wellorderedByIn) ).
thf(ordinalTransSet,conjecture,
( subsetE
=> ! [X4: $i] :
( ( ordinal @ X4 )
=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( in @ X1 @ X2 )
=> ( in @ X1 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.iHyqPMKGFg/E---3.1_3248159.p',ordinalTransSet) ).
thf(subsetE,axiom,
( subsetE
<=> ! [X2: $i,X3: $i,X1: $i] :
( ( subset @ X2 @ X3 )
=> ( ( in @ X1 @ X2 )
=> ( in @ X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.iHyqPMKGFg/E---3.1_3248159.p',subsetE) ).
thf(c_0_5,plain,
( ordinal
= ( ^ [Z0: $i] :
( ! [X12: $i] :
( ( in @ X12 @ Z0 )
=> ( subset @ X12 @ Z0 ) )
& ( stricttotalorderedByIn @ Z0 )
& ! [X13: $i] :
( ( in @ X13 @ ( powerset @ Z0 ) )
=> ( ( nonempty @ X13 )
=> ? [X14: $i] :
( ( in @ X14 @ X13 )
& ! [X15: $i] :
( ( in @ X15 @ X13 )
=> ( ( X14 = X15 )
| ( in @ X14 @ X15 ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ordinal]) ).
thf(c_0_6,plain,
( transitiveset
= ( ^ [Z0: $i] :
! [X4: $i] :
( ( in @ X4 @ Z0 )
=> ( subset @ X4 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[transitiveset]) ).
thf(c_0_7,plain,
( wellorderedByIn
= ( ^ [Z0: $i] :
( ( stricttotalorderedByIn @ Z0 )
& ! [X4: $i] :
( ( in @ X4 @ ( powerset @ Z0 ) )
=> ( ( nonempty @ X4 )
=> ? [X1: $i] :
( ( in @ X1 @ X4 )
& ! [X5: $i] :
( ( in @ X5 @ X4 )
=> ( ( X1 = X5 )
| ( in @ X1 @ X5 ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[wellorderedByIn]) ).
thf(c_0_8,negated_conjecture,
~ ( subsetE
=> ! [X4: $i] :
( ( ordinal @ X4 )
=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( in @ X1 @ X2 )
=> ( in @ X1 @ X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[ordinalTransSet]) ).
thf(c_0_9,plain,
( ordinal
= ( ^ [Z0: $i] :
( ! [X12: $i] :
( ( in @ X12 @ Z0 )
=> ( subset @ X12 @ Z0 ) )
& ( stricttotalorderedByIn @ Z0 )
& ! [X13: $i] :
( ( in @ X13 @ ( powerset @ Z0 ) )
=> ( ( nonempty @ X13 )
=> ? [X14: $i] :
( ( in @ X14 @ X13 )
& ! [X15: $i] :
( ( in @ X15 @ X13 )
=> ( ( X14 = X15 )
| ( in @ X14 @ X15 ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
thf(c_0_10,negated_conjecture,
~ ( ! [X16: $i,X17: $i,X18: $i] :
( ( subset @ X16 @ X17 )
=> ( ( in @ X18 @ X16 )
=> ( in @ X18 @ X17 ) ) )
=> ! [X4: $i] :
( ( ! [X19: $i] :
( ( in @ X19 @ X4 )
=> ( subset @ X19 @ X4 ) )
& ( stricttotalorderedByIn @ X4 )
& ! [X20: $i] :
( ( in @ X20 @ ( powerset @ X4 ) )
=> ( ( nonempty @ X20 )
=> ? [X21: $i] :
( ( in @ X21 @ X20 )
& ! [X22: $i] :
( ( in @ X22 @ X20 )
=> ( ( X21 = X22 )
| ( in @ X21 @ X22 ) ) ) ) ) ) )
=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ X4 )
=> ( ( in @ X1 @ X2 )
=> ( in @ X1 @ X4 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8,subsetE]),c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X23: $i,X24: $i,X25: $i,X27: $i,X28: $i,X30: $i] :
( ( ~ ( subset @ X23 @ X24 )
| ~ ( in @ X25 @ X23 )
| ( in @ X25 @ X24 ) )
& ( ~ ( in @ X27 @ esk1_0 )
| ( subset @ X27 @ esk1_0 ) )
& ( stricttotalorderedByIn @ esk1_0 )
& ( ( in @ ( esk2_1 @ X28 ) @ X28 )
| ~ ( nonempty @ X28 )
| ~ ( in @ X28 @ ( powerset @ esk1_0 ) ) )
& ( ~ ( in @ X30 @ X28 )
| ( ( esk2_1 @ X28 )
= X30 )
| ( in @ ( esk2_1 @ X28 ) @ X30 )
| ~ ( nonempty @ X28 )
| ~ ( in @ X28 @ ( powerset @ esk1_0 ) ) )
& ( in @ esk4_0 @ esk1_0 )
& ( in @ esk3_0 @ esk4_0 )
& ~ ( in @ esk3_0 @ esk1_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_10])])])])])]) ).
thf(c_0_12,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ X3 @ X2 )
| ~ ( subset @ X1 @ X2 )
| ~ ( in @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] :
( ( subset @ X1 @ esk1_0 )
| ~ ( in @ X1 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ X1 @ esk1_0 )
| ~ ( in @ X2 @ esk1_0 )
| ~ ( in @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_15,negated_conjecture,
in @ esk4_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i] :
( ( in @ X1 @ esk1_0 )
| ~ ( in @ X1 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_17,negated_conjecture,
in @ esk3_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_18,negated_conjecture,
~ ( in @ esk3_0 @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU817^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n008.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 14:34:54 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.iHyqPMKGFg/E---3.1_3248159.p
% 0.08/0.25 % Version: 3.5.1-ho
% 0.08/0.25 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.08/0.25 % Starting post_as_ho5 with 300s (1) cores
% 0.08/0.25 % Starting sh4l with 300s (1) cores
% 0.08/0.25 % Starting ho_unfolding_2 with 300s (1) cores
% 0.08/0.25 % post_as_ho5 with pid 3248173 completed with status 0
% 0.08/0.25 % Result found by post_as_ho5
% 0.08/0.25 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.08/0.25 % Starting post_as_ho5 with 300s (1) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.08/0.25 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.08/0.25 % Search class: HGUSF-FFSS11-SSFFMFNN
% 0.08/0.25 % partial match(2): HGHSF-FFSS21-SSFFMFNN
% 0.08/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.25 % SubtermCWHack with pid 3248177 completed with status 0
% 0.08/0.25 % Result found by SubtermCWHack
% 0.08/0.25 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.08/0.25 % Starting post_as_ho5 with 300s (1) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.08/0.25 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.08/0.25 % Search class: HGUSF-FFSS11-SSFFMFNN
% 0.08/0.25 % partial match(2): HGHSF-FFSS21-SSFFMFNN
% 0.08/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.25 % Starting SubtermCWHack with 28s (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 : 17
% 0.08/0.25 % Removed by relevancy pruning/SinE : 12
% 0.08/0.25 % Initial clauses : 8
% 0.08/0.25 % Removed in clause preprocessing : 0
% 0.08/0.25 % Initial clauses in saturation : 8
% 0.08/0.25 % Processed clauses : 8
% 0.08/0.25 % ...of these trivial : 0
% 0.08/0.25 % ...subsumed : 0
% 0.08/0.25 % ...remaining for further processing : 8
% 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 : 0
% 0.08/0.25 % Generated clauses : 3
% 0.08/0.25 % ...of the previous two non-redundant : 2
% 0.08/0.25 % ...aggressively subsumed : 0
% 0.08/0.25 % Contextual simplify-reflections : 0
% 0.08/0.25 % Paramodulations : 3
% 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 : 0
% 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 : 8
% 0.08/0.25 % Positive orientable unit clauses : 3
% 0.08/0.25 % Positive unorientable unit clauses: 0
% 0.08/0.25 % Negative unit clauses : 1
% 0.08/0.25 % Non-unit-clauses : 4
% 0.08/0.25 % Current number of unprocessed clauses: 2
% 0.08/0.25 % ...number of literals in the above : 8
% 0.08/0.25 % Current number of archived formulas : 0
% 0.08/0.25 % Current number of archived clauses : 0
% 0.08/0.25 % Clause-clause subsumption calls (NU) : 1
% 0.08/0.25 % Rec. Clause-clause subsumption calls : 1
% 0.08/0.25 % Non-unit clause-clause subsumptions : 0
% 0.08/0.25 % Unit Clause-clause subsumption calls : 0
% 0.08/0.25 % Rewrite failures with RHS unbound : 0
% 0.08/0.25 % BW rewrite match attempts : 0
% 0.08/0.25 % BW rewrite match successes : 0
% 0.08/0.25 % Condensation attempts : 0
% 0.08/0.25 % Condensation successes : 0
% 0.08/0.25 % Termbank termtop insertions : 1110
% 0.08/0.25 % Search garbage collected termcells : 387
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.004 s
% 0.08/0.25 % System time : 0.002 s
% 0.08/0.25 % Total time : 0.006 s
% 0.08/0.25 % Maximum resident set size: 3644 pages
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.007 s
% 0.08/0.25 % System time : 0.005 s
% 0.08/0.25 % Total time : 0.012 s
% 0.08/0.25 % Maximum resident set size: 4864 pages
% 0.08/0.25 % E exiting
%------------------------------------------------------------------------------