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