%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU635^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 : n017.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:49 AM UTC 2026
% Result : Theorem 0.21s 0.27s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 50 ( 0 equ; 0 cnn)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 175 ( 12 ~; 10 |; 4 &; 129 @)
% ( 3 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 43 ( 0 ^; 43 !; 0 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
emptyset: $i ).
thf(decl_25,type,
setadjoin: $i > $i > $i ).
thf(decl_26,type,
setunion: $i > $i ).
thf(decl_27,type,
setadjoinIL: $o ).
thf(decl_28,type,
setunionI: $o ).
thf(decl_29,type,
subset: $i > $i > $o ).
thf(decl_30,type,
subsetI2: $o ).
thf(decl_31,type,
esk1_2: $i > $i > $i ).
thf(decl_32,type,
esk2_0: $i ).
thf(setunionsingleton2,conjecture,
( setadjoinIL
=> ( setunionI
=> ( subsetI2
=> ! [X3: $i] : ( subset @ X3 @ ( setunion @ ( setadjoin @ X3 @ emptyset ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aJs3BIbcOg/E---3.1_380445.p',setunionsingleton2) ).
thf(setadjoinIL,axiom,
( setadjoinIL
<=> ! [X1: $i,X2: $i] : ( in @ X1 @ ( setadjoin @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aJs3BIbcOg/E---3.1_380445.p',setadjoinIL) ).
thf(setunionI,axiom,
( setunionI
<=> ! [X3: $i,X1: $i,X4: $i] :
( ( in @ X1 @ X4 )
=> ( ( in @ X4 @ X3 )
=> ( in @ X1 @ ( setunion @ X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aJs3BIbcOg/E---3.1_380445.p',setunionI) ).
thf(subsetI2,axiom,
( subsetI2
<=> ! [X3: $i,X4: $i] :
( ! [X1: $i] :
( ( in @ X1 @ X3 )
=> ( in @ X1 @ X4 ) )
=> ( subset @ X3 @ X4 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aJs3BIbcOg/E---3.1_380445.p',subsetI2) ).
thf(c_0_4,negated_conjecture,
~ ( setadjoinIL
=> ( setunionI
=> ( subsetI2
=> ! [X3: $i] : ( subset @ X3 @ ( setunion @ ( setadjoin @ X3 @ emptyset ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[setunionsingleton2]) ).
thf(c_0_5,negated_conjecture,
~ ( ! [X14: $i,X15: $i] : ( in @ X14 @ ( setadjoin @ X14 @ X15 ) )
=> ( ! [X16: $i,X17: $i,X18: $i] :
( ( in @ X17 @ X18 )
=> ( ( in @ X18 @ X16 )
=> ( in @ X17 @ ( setunion @ X16 ) ) ) )
=> ( ! [X19: $i,X20: $i] :
( ! [X21: $i] :
( ( in @ X21 @ X19 )
=> ( in @ X21 @ X20 ) )
=> ( subset @ X19 @ X20 ) )
=> ! [X3: $i] : ( subset @ X3 @ ( setunion @ ( setadjoin @ X3 @ emptyset ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_4,setadjoinIL]),setunionI]),subsetI2]) ).
thf(c_0_6,negated_conjecture,
! [X22: $i,X23: $i,X24: $i,X25: $i,X26: $i,X27: $i,X28: $i] :
( ( in @ X22 @ ( setadjoin @ X22 @ X23 ) )
& ( ~ ( in @ X25 @ X26 )
| ~ ( in @ X26 @ X24 )
| ( in @ X25 @ ( setunion @ X24 ) ) )
& ( ( in @ ( esk1_2 @ X27 @ X28 ) @ X27 )
| ( subset @ X27 @ X28 ) )
& ( ~ ( in @ ( esk1_2 @ X27 @ X28 ) @ X28 )
| ( subset @ X27 @ X28 ) )
& ~ ( subset @ esk2_0 @ ( setunion @ ( setadjoin @ esk2_0 @ emptyset ) ) ) ),
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_5])])])])])]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ X1 @ ( setunion @ X3 ) )
| ~ ( in @ X1 @ X2 )
| ~ ( in @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X2: $i] : ( in @ X1 @ ( setadjoin @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
| ~ ( in @ ( esk1_2 @ X1 @ X2 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ X1 @ ( setunion @ ( setadjoin @ X2 @ X3 ) ) )
| ~ ( in @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( subset @ X1 @ ( setunion @ ( setadjoin @ X2 @ X3 ) ) )
| ~ ( in @ ( esk1_2 @ X1 @ ( setunion @ ( setadjoin @ X2 @ X3 ) ) ) @ X2 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( esk1_2 @ X1 @ X2 ) @ X1 )
| ( subset @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_13,negated_conjecture,
~ ( subset @ esk2_0 @ ( setunion @ ( setadjoin @ esk2_0 @ emptyset ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i] : ( subset @ X1 @ ( setunion @ ( setadjoin @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU635^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n017.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 13:56:07 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running higher-order theorem proving
% 0.07/0.25 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.aJs3BIbcOg/E---3.1_380445.p
% 0.21/0.27 % Version: 3.5.1-ho
% 0.21/0.27 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.21/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.21/0.27 % Starting post_as_ho8 with 300s (1) cores
% 0.21/0.27 % Starting post_as_ho3 with 300s (1) cores
% 0.21/0.27 % Starting post_as_ho2 with 300s (1) cores
% 0.21/0.27 % post_as_ho8 with pid 380460 completed with status 0
% 0.21/0.27 % Result found by post_as_ho8
% 0.21/0.27 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.21/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.21/0.27 % Starting post_as_ho8 with 300s (1) cores
% 0.21/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.21/0.27 % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.21/0.27 % Search class: HGUNF-FFSF21-SFFFMFNN
% 0.21/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.27 % SubtermCWHack with pid 380463 completed with status 0
% 0.21/0.27 % Result found by SubtermCWHack
% 0.21/0.27 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.21/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.21/0.27 % Starting post_as_ho8 with 300s (1) cores
% 0.21/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.21/0.27 % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.21/0.27 % Search class: HGUNF-FFSF21-SFFFMFNN
% 0.21/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.27 % Preprocessing time : 0.001 s
% 0.21/0.27
% 0.21/0.27 % Proof found!
% 0.21/0.27 % SZS status Theorem
% 0.21/0.27 % SZS output start CNFRefutation
% See solution above
% 0.21/0.27 % Parsed axioms : 12
% 0.21/0.27 % Removed by relevancy pruning/SinE : 8
% 0.21/0.27 % Initial clauses : 5
% 0.21/0.27 % Removed in clause preprocessing : 0
% 0.21/0.27 % Initial clauses in saturation : 5
% 0.21/0.27 % Processed clauses : 12
% 0.21/0.27 % ...of these trivial : 0
% 0.21/0.27 % ...subsumed : 0
% 0.21/0.27 % ...remaining for further processing : 12
% 0.21/0.27 % Other redundant clauses eliminated : 0
% 0.21/0.27 % Clauses deleted for lack of memory : 0
% 0.21/0.27 % Backward-subsumed : 0
% 0.21/0.27 % Backward-rewritten : 1
% 0.21/0.27 % Generated clauses : 13
% 0.21/0.27 % ...of the previous two non-redundant : 13
% 0.21/0.27 % ...aggressively subsumed : 0
% 0.21/0.27 % Contextual simplify-reflections : 0
% 0.21/0.27 % Paramodulations : 13
% 0.21/0.27 % Factorizations : 0
% 0.21/0.27 % NegExts : 0
% 0.21/0.27 % Equation resolutions : 0
% 0.21/0.27 % Disequality decompositions : 0
% 0.21/0.27 % Total rewrite steps : 1
% 0.21/0.27 % ...of those cached : 0
% 0.21/0.27 % Propositional unsat checks : 0
% 0.21/0.27 % Propositional check models : 0
% 0.21/0.27 % Propositional check unsatisfiable : 0
% 0.21/0.27 % Propositional clauses : 0
% 0.21/0.27 % Propositional clauses after purity: 0
% 0.21/0.27 % Propositional unsat core size : 0
% 0.21/0.27 % Propositional preprocessing time : 0.000
% 0.21/0.27 % Propositional encoding time : 0.000
% 0.21/0.27 % Propositional solver time : 0.000
% 0.21/0.27 % Success case prop preproc time : 0.000
% 0.21/0.27 % Success case prop encoding time : 0.000
% 0.21/0.27 % Success case prop solver time : 0.000
% 0.21/0.27 % Current number of processed clauses : 11
% 0.21/0.27 % Positive orientable unit clauses : 3
% 0.21/0.27 % Positive unorientable unit clauses: 0
% 0.21/0.27 % Negative unit clauses : 0
% 0.21/0.27 % Non-unit-clauses : 8
% 0.21/0.27 % Current number of unprocessed clauses: 6
% 0.21/0.27 % ...number of literals in the above : 14
% 0.21/0.27 % Current number of archived formulas : 0
% 0.21/0.27 % Current number of archived clauses : 1
% 0.21/0.27 % Clause-clause subsumption calls (NU) : 11
% 0.21/0.27 % Rec. Clause-clause subsumption calls : 10
% 0.21/0.27 % Non-unit clause-clause subsumptions : 0
% 0.21/0.27 % Unit Clause-clause subsumption calls : 3
% 0.21/0.27 % Rewrite failures with RHS unbound : 0
% 0.21/0.27 % BW rewrite match attempts : 4
% 0.21/0.27 % BW rewrite match successes : 1
% 0.21/0.27 % Condensation attempts : 0
% 0.21/0.27 % Condensation successes : 0
% 0.21/0.27 % Termbank termtop insertions : 867
% 0.21/0.27 % Search garbage collected termcells : 233
% 0.21/0.27
% 0.21/0.27 % -------------------------------------------------
% 0.21/0.27 % User time : 0.004 s
% 0.21/0.28 % System time : 0.001 s
% 0.21/0.28 % Total time : 0.005 s
% 0.21/0.28 % Maximum resident set size: 3632 pages
% 0.21/0.28
% 0.21/0.28 % -------------------------------------------------
% 0.21/0.28 % User time : 0.007 s
% 0.21/0.28 % System time : 0.005 s
% 0.21/0.28 % Total time : 0.011 s
% 0.21/0.28 % Maximum resident set size: 4864 pages
% 0.21/0.28 % E exiting
%------------------------------------------------------------------------------