%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU593^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 : n009.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:38 AM UTC 2026
% Result : Theorem 0.11s 0.28s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 105 ( 10 equ; 0 cnn)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 341 ( 26 ~; 27 |; 7 &; 242 @)
% ( 5 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 80 ( 0 ^; 80 !; 0 ?; 80 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_25,type,
subset: $i > $i > $o ).
thf(decl_26,type,
subsetI1: $o ).
thf(decl_27,type,
subsetE: $o ).
thf(decl_28,type,
setextsub: $o ).
thf(decl_29,type,
binintersect: $i > $i > $i ).
thf(decl_30,type,
binintersectI: $o ).
thf(decl_31,type,
binintersectLsub: $o ).
thf(decl_32,type,
esk1_2: $i > $i > $i ).
thf(decl_33,type,
esk2_0: $i ).
thf(decl_34,type,
esk3_0: $i ).
thf(binintersectSubset2,conjecture,
( subsetI1
=> ( subsetE
=> ( setextsub
=> ( binintersectI
=> ( binintersectLsub
=> ! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
=> ( ( binintersect @ X1 @ X2 )
= X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cY2TP4IceN/E---3.1_4038016.p',binintersectSubset2) ).
thf(subsetI1,axiom,
( subsetI1
<=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) )
=> ( subset @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cY2TP4IceN/E---3.1_4038016.p',subsetI1) ).
thf(subsetE,axiom,
( subsetE
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( subset @ X1 @ X2 )
=> ( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cY2TP4IceN/E---3.1_4038016.p',subsetE) ).
thf(setextsub,axiom,
( setextsub
<=> ! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
=> ( ( subset @ X2 @ X1 )
=> ( X1 = X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cY2TP4IceN/E---3.1_4038016.p',setextsub) ).
thf(binintersectI,axiom,
( binintersectI
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( in @ X3 @ X2 )
=> ( in @ X3 @ ( binintersect @ X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.cY2TP4IceN/E---3.1_4038016.p',binintersectI) ).
thf(binintersectLsub,axiom,
( binintersectLsub
<=> ! [X1: $i,X2: $i] : ( subset @ ( binintersect @ X1 @ X2 ) @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.cY2TP4IceN/E---3.1_4038016.p',binintersectLsub) ).
thf(c_0_6,negated_conjecture,
~ ( subsetI1
=> ( subsetE
=> ( setextsub
=> ( binintersectI
=> ( binintersectLsub
=> ! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
=> ( ( binintersect @ X1 @ X2 )
= X1 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[binintersectSubset2]) ).
thf(c_0_7,negated_conjecture,
~ ( ! [X19: $i,X20: $i] :
( ! [X21: $i] :
( ( in @ X21 @ X19 )
=> ( in @ X21 @ X20 ) )
=> ( subset @ X19 @ X20 ) )
=> ( ! [X22: $i,X23: $i,X24: $i] :
( ( subset @ X22 @ X23 )
=> ( ( in @ X24 @ X22 )
=> ( in @ X24 @ X23 ) ) )
=> ( ! [X25: $i,X26: $i] :
( ( subset @ X25 @ X26 )
=> ( ( subset @ X26 @ X25 )
=> ( X25 = X26 ) ) )
=> ( ! [X27: $i,X28: $i,X29: $i] :
( ( in @ X29 @ X27 )
=> ( ( in @ X29 @ X28 )
=> ( in @ X29 @ ( binintersect @ X27 @ X28 ) ) ) )
=> ( ! [X30: $i,X31: $i] : ( subset @ ( binintersect @ X30 @ X31 ) @ X30 )
=> ! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
=> ( ( binintersect @ X1 @ X2 )
= X1 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_6,subsetI1]),subsetE]),setextsub]),binintersectI]),binintersectLsub]) ).
thf(c_0_8,negated_conjecture,
! [X36: $i,X37: $i,X39: $i,X40: $i,X41: $i,X42: $i,X43: $i,X44: $i,X45: $i,X46: $i,X47: $i,X48: $i] :
( ( ( in @ ( esk1_2 @ X36 @ X37 ) @ X36 )
| ( subset @ X36 @ X37 ) )
& ( ~ ( in @ ( esk1_2 @ X36 @ X37 ) @ X37 )
| ( subset @ X36 @ X37 ) )
& ( ~ ( subset @ X39 @ X40 )
| ~ ( in @ X41 @ X39 )
| ( in @ X41 @ X40 ) )
& ( ~ ( subset @ X42 @ X43 )
| ~ ( subset @ X43 @ X42 )
| ( X42 = X43 ) )
& ( ~ ( in @ X46 @ X44 )
| ~ ( in @ X46 @ X45 )
| ( in @ X46 @ ( binintersect @ X44 @ X45 ) ) )
& ( subset @ ( binintersect @ X47 @ X48 ) @ X47 )
& ( subset @ esk2_0 @ esk3_0 )
& ( ( binintersect @ esk2_0 @ esk3_0 )
!= 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_7])])])])])]) ).
thf(c_0_9,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ X3 @ X2 )
| ~ ( subset @ X1 @ X2 )
| ~ ( in @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
subset @ esk2_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X2: $i,X1: $i] : ( subset @ ( binintersect @ X1 @ X2 ) @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
| ~ ( in @ ( esk1_2 @ X1 @ X2 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] :
( ( in @ X1 @ esk3_0 )
| ~ ( in @ X1 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ X1 @ X2 )
| ~ ( in @ X1 @ ( binintersect @ X2 @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( esk1_2 @ X1 @ X2 ) @ X1 )
| ( subset @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ X1 @ ( binintersect @ X2 @ X3 ) )
| ~ ( in @ X1 @ X2 )
| ~ ( in @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i] :
( ( subset @ X1 @ esk3_0 )
| ~ ( in @ ( esk1_2 @ X1 @ esk3_0 ) @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ ( esk1_2 @ ( binintersect @ X1 @ X2 ) @ X3 ) @ X1 )
| ( subset @ ( binintersect @ X1 @ X2 ) @ X3 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( subset @ X1 @ ( binintersect @ X2 @ X3 ) )
| ~ ( in @ ( esk1_2 @ X1 @ ( binintersect @ X2 @ X3 ) ) @ X3 )
| ~ ( in @ ( esk1_2 @ X1 @ ( binintersect @ X2 @ X3 ) ) @ X2 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i] : ( subset @ ( binintersect @ esk2_0 @ X1 ) @ esk3_0 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ X1 @ ( binintersect @ X2 @ X1 ) )
| ~ ( in @ ( esk1_2 @ X1 @ ( binintersect @ X2 @ X1 ) ) @ X2 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ X1 @ esk3_0 )
| ~ ( in @ X1 @ ( binintersect @ esk2_0 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_9,c_0_20]) ).
thf(c_0_23,negated_conjecture,
! [X2: $i,X1: $i] :
( ( X1 = X2 )
| ~ ( subset @ X1 @ X2 )
| ~ ( subset @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_24,negated_conjecture,
! [X1: $i] : ( subset @ X1 @ ( binintersect @ X1 @ X1 ) ),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( esk1_2 @ ( binintersect @ esk2_0 @ X1 ) @ X2 ) @ esk3_0 )
| ( subset @ ( binintersect @ esk2_0 @ X1 ) @ X2 ) ),
inference(spm,[status(thm)],[c_0_22,c_0_15]) ).
thf(c_0_26,negated_conjecture,
! [X1: $i] :
( ( binintersect @ X1 @ X1 )
= X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_11])]) ).
thf(c_0_27,negated_conjecture,
! [X1: $i] :
( ( in @ ( esk1_2 @ esk2_0 @ X1 ) @ esk3_0 )
| ( subset @ esk2_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_28,negated_conjecture,
! [X1: $i] :
( ( subset @ esk2_0 @ ( binintersect @ X1 @ esk3_0 ) )
| ~ ( in @ ( esk1_2 @ esk2_0 @ ( binintersect @ X1 @ esk3_0 ) ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
thf(c_0_29,negated_conjecture,
subset @ esk2_0 @ ( binintersect @ esk2_0 @ esk3_0 ),
inference(spm,[status(thm)],[c_0_28,c_0_15]) ).
thf(c_0_30,negated_conjecture,
( ( binintersect @ esk2_0 @ esk3_0 )
!= esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_29]),c_0_11])]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU593^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.11/0.18 % Computer : n009.cluster.edu
% 0.11/0.18 % Model : x86_64 x86_64
% 0.11/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.18 % Memory : 8046.5625MB
% 0.11/0.18 % OS : Linux 6.8.0-71-generic
% 0.11/0.18 % CPULimit : 300
% 0.11/0.18 % WCLimit : 300
% 0.11/0.18 % DateTime : Tue Sep 29 13:56:01 UTC 2026
% 0.11/0.19 % CPUTime :
% 0.11/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.23 Running higher-order theorem proving
% 0.11/0.24 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.cY2TP4IceN/E---3.1_4038016.p
% 0.11/0.28 % Version: 3.5.1-ho
% 0.11/0.28 % Preprocessing class: HSSSSLSSSLSNSFN.
% 0.11/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.28 % Starting new_ho_10 with 1500s (5) cores
% 0.11/0.28 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.11/0.28 % Starting lpo1_def_fix with 300s (1) cores
% 0.11/0.28 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.11/0.28 % new_ho_10 with pid 4038044 completed with status 0
% 0.11/0.28 % Result found by new_ho_10
% 0.11/0.28 % Preprocessing class: HSSSSLSSSLSNSFN.
% 0.11/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.28 % Starting new_ho_10 with 1500s (5) cores
% 0.11/0.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.28 % No SInE strategy applied
% 0.11/0.28 % Search class: HGUSS-FFSF22-SSFFMFNN
% 0.11/0.28 % partial match(1): HGUSF-FFSF22-SSFFMFNN
% 0.11/0.28 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.28 % Starting SubtermCWHack with 151s (1) cores
% 0.11/0.28 % Starting new_ho_10 with 901s (1) cores
% 0.11/0.28 % Starting sh5l with 151s (1) cores
% 0.11/0.28 % Starting new_bool_1 with 151s (1) cores
% 0.11/0.28 % Starting new_bool_2 with 146s (1) cores
% 0.11/0.28 % SubtermCWHack with pid 4038050 completed with status 0
% 0.11/0.28 % Result found by SubtermCWHack
% 0.11/0.28 % Preprocessing class: HSSSSLSSSLSNSFN.
% 0.11/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.28 % Starting new_ho_10 with 1500s (5) cores
% 0.11/0.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.28 % No SInE strategy applied
% 0.11/0.28 % Search class: HGUSS-FFSF22-SSFFMFNN
% 0.11/0.28 % partial match(1): HGUSF-FFSF22-SSFFMFNN
% 0.11/0.28 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.28 % Starting SubtermCWHack with 151s (1) cores
% 0.11/0.28 % Preprocessing time : 0.001 s
% 0.11/0.28
% 0.11/0.28 % Proof found!
% 0.11/0.28 % SZS status Theorem
% 0.11/0.28 % SZS output start CNFRefutation
% See solution above
% 0.11/0.28 % Parsed axioms : 16
% 0.11/0.28 % Removed by relevancy pruning/SinE : 0
% 0.11/0.28 % Initial clauses : 20
% 0.11/0.28 % Removed in clause preprocessing : 9
% 0.11/0.28 % Initial clauses in saturation : 11
% 0.11/0.28 % Processed clauses : 53
% 0.11/0.28 % ...of these trivial : 0
% 0.11/0.28 % ...subsumed : 12
% 0.11/0.28 % ...remaining for further processing : 41
% 0.11/0.28 % Other redundant clauses eliminated : 0
% 0.11/0.28 % Clauses deleted for lack of memory : 0
% 0.11/0.28 % Backward-subsumed : 0
% 0.11/0.28 % Backward-rewritten : 1
% 0.11/0.28 % Generated clauses : 107
% 0.11/0.28 % ...of the previous two non-redundant : 77
% 0.11/0.28 % ...aggressively subsumed : 0
% 0.11/0.28 % Contextual simplify-reflections : 0
% 0.11/0.28 % Paramodulations : 107
% 0.11/0.28 % Factorizations : 0
% 0.11/0.28 % NegExts : 0
% 0.11/0.28 % Equation resolutions : 0
% 0.11/0.28 % Disequality decompositions : 0
% 0.11/0.28 % Total rewrite steps : 31
% 0.11/0.28 % ...of those cached : 19
% 0.11/0.28 % Propositional unsat checks : 0
% 0.11/0.28 % Propositional check models : 0
% 0.11/0.28 % Propositional check unsatisfiable : 0
% 0.11/0.28 % Propositional clauses : 0
% 0.11/0.28 % Propositional clauses after purity: 0
% 0.11/0.28 % Propositional unsat core size : 0
% 0.11/0.28 % Propositional preprocessing time : 0.000
% 0.11/0.28 % Propositional encoding time : 0.000
% 0.11/0.28 % Propositional solver time : 0.000
% 0.11/0.28 % Success case prop preproc time : 0.000
% 0.11/0.28 % Success case prop encoding time : 0.000
% 0.11/0.28 % Success case prop solver time : 0.000
% 0.11/0.28 % Current number of processed clauses : 40
% 0.11/0.28 % Positive orientable unit clauses : 12
% 0.11/0.28 % Positive unorientable unit clauses: 0
% 0.11/0.28 % Negative unit clauses : 1
% 0.11/0.28 % Non-unit-clauses : 27
% 0.11/0.28 % Current number of unprocessed clauses: 33
% 0.11/0.28 % ...number of literals in the above : 69
% 0.11/0.28 % Current number of archived formulas : 0
% 0.11/0.28 % Current number of archived clauses : 1
% 0.11/0.28 % Clause-clause subsumption calls (NU) : 93
% 0.11/0.28 % Rec. Clause-clause subsumption calls : 93
% 0.11/0.28 % Non-unit clause-clause subsumptions : 12
% 0.11/0.28 % Unit Clause-clause subsumption calls : 21
% 0.11/0.28 % Rewrite failures with RHS unbound : 0
% 0.11/0.28 % BW rewrite match attempts : 17
% 0.11/0.28 % BW rewrite match successes : 1
% 0.11/0.28 % Condensation attempts : 0
% 0.11/0.28 % Condensation successes : 0
% 0.11/0.28 % Termbank termtop insertions : 2709
% 0.11/0.28 % Search garbage collected termcells : 435
% 0.11/0.28
% 0.11/0.28 % -------------------------------------------------
% 0.11/0.28 % User time : 0.006 s
% 0.11/0.28 % System time : 0.004 s
% 0.11/0.28 % Total time : 0.009 s
% 0.11/0.28 % Maximum resident set size: 3636 pages
% 0.11/0.28
% 0.11/0.28 % -------------------------------------------------
% 0.11/0.28 % User time : 0.016 s
% 0.11/0.28 % System time : 0.014 s
% 0.11/0.28 % Total time : 0.030 s
% 0.11/0.28 % Maximum resident set size: 4864 pages
% 0.11/0.28 % E exiting
%------------------------------------------------------------------------------