%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU759^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 : n018.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:31 AM UTC 2026
% Result : Theorem 0.07s 0.26s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 73 ( 0 equ; 0 cnn)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 246 ( 13 ~; 13 |; 8 &; 178 @)
% ( 3 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 10 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 55 ( 0 ^; 55 !; 0 ?; 55 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
powerset: $i > $i ).
thf(decl_25,type,
subset: $i > $i > $o ).
thf(decl_26,type,
subsetI1: $o ).
thf(decl_27,type,
subsetE: $o ).
thf(decl_28,type,
binintersect: $i > $i > $i ).
thf(decl_29,type,
binintersectEL: $o ).
thf(decl_30,type,
esk1_2: $i > $i > $i ).
thf(decl_31,type,
esk2_0: $i ).
thf(decl_32,type,
esk3_0: $i ).
thf(decl_33,type,
esk4_0: $i ).
thf(decl_34,type,
esk5_0: $i ).
thf(woz13rule1,conjecture,
( subsetI1
=> ( subsetE
=> ( binintersectEL
=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ! [X6: $i] :
( ( in @ X6 @ ( powerset @ X1 ) )
=> ( ( subset @ X4 @ X6 )
=> ( subset @ ( binintersect @ X4 @ X5 ) @ X6 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uLlQ8ezMFm/E---3.1_151810.p',woz13rule1) ).
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.uLlQ8ezMFm/E---3.1_151810.p',subsetI1) ).
thf(subsetE,axiom,
( subsetE
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( subset @ X1 @ X2 )
=> ( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uLlQ8ezMFm/E---3.1_151810.p',subsetE) ).
thf(binintersectEL,axiom,
( binintersectEL
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( binintersect @ X1 @ X2 ) )
=> ( in @ X3 @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uLlQ8ezMFm/E---3.1_151810.p',binintersectEL) ).
thf(c_0_4,negated_conjecture,
~ ( subsetI1
=> ( subsetE
=> ( binintersectEL
=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ! [X6: $i] :
( ( in @ X6 @ ( powerset @ X1 ) )
=> ( ( subset @ X4 @ X6 )
=> ( subset @ ( binintersect @ X4 @ X5 ) @ X6 ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[woz13rule1]) ).
thf(c_0_5,negated_conjecture,
~ ( ! [X20: $i,X21: $i] :
( ! [X22: $i] :
( ( in @ X22 @ X20 )
=> ( in @ X22 @ X21 ) )
=> ( subset @ X20 @ X21 ) )
=> ( ! [X23: $i,X24: $i,X25: $i] :
( ( subset @ X23 @ X24 )
=> ( ( in @ X25 @ X23 )
=> ( in @ X25 @ X24 ) ) )
=> ( ! [X26: $i,X27: $i,X28: $i] :
( ( in @ X28 @ ( binintersect @ X26 @ X27 ) )
=> ( in @ X28 @ X26 ) )
=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ! [X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ! [X6: $i] :
( ( in @ X6 @ ( powerset @ X1 ) )
=> ( ( subset @ X4 @ X6 )
=> ( subset @ ( binintersect @ X4 @ X5 ) @ X6 ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_4,subsetI1]),subsetE]),binintersectEL]) ).
thf(c_0_6,negated_conjecture,
! [X29: $i,X30: $i,X32: $i,X33: $i,X34: $i,X35: $i,X36: $i,X37: $i] :
( ( ( in @ ( esk1_2 @ X29 @ X30 ) @ X29 )
| ( subset @ X29 @ X30 ) )
& ( ~ ( in @ ( esk1_2 @ X29 @ X30 ) @ X30 )
| ( subset @ X29 @ X30 ) )
& ( ~ ( subset @ X32 @ X33 )
| ~ ( in @ X34 @ X32 )
| ( in @ X34 @ X33 ) )
& ( ~ ( in @ X37 @ ( binintersect @ X35 @ X36 ) )
| ( in @ X37 @ X35 ) )
& ( in @ esk3_0 @ ( powerset @ esk2_0 ) )
& ( in @ esk4_0 @ ( powerset @ esk2_0 ) )
& ( in @ esk5_0 @ ( powerset @ esk2_0 ) )
& ( subset @ esk3_0 @ esk5_0 )
& ~ ( subset @ ( binintersect @ esk3_0 @ esk4_0 ) @ esk5_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,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ X3 @ X2 )
| ~ ( subset @ X1 @ X2 )
| ~ ( in @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,negated_conjecture,
subset @ esk3_0 @ esk5_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ X1 @ X2 )
| ~ ( in @ X1 @ ( binintersect @ X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,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_11,negated_conjecture,
! [X1: $i] :
( ( in @ X1 @ esk5_0 )
| ~ ( in @ X1 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_12,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_9,c_0_10]) ).
thf(c_0_13,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_14,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( esk1_2 @ ( binintersect @ esk3_0 @ X1 ) @ X2 ) @ esk5_0 )
| ( subset @ ( binintersect @ esk3_0 @ X1 ) @ X2 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_15,negated_conjecture,
~ ( subset @ ( binintersect @ esk3_0 @ esk4_0 ) @ esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i] : ( subset @ ( binintersect @ esk3_0 @ X1 ) @ esk5_0 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU759^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.07/0.18 % Computer : n018.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 14:24:56 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running higher-order theorem proving
% 0.07/0.24 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.uLlQ8ezMFm/E---3.1_151810.p
% 0.07/0.26 % Version: 3.5.1-ho
% 0.07/0.26 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.07/0.26 % Starting post_as_ho8 with 300s (1) cores
% 0.07/0.26 % Starting post_as_ho3 with 300s (1) cores
% 0.07/0.26 % Starting post_as_ho2 with 300s (1) cores
% 0.07/0.26 % post_as_ho8 with pid 151836 completed with status 0
% 0.07/0.26 % Result found by post_as_ho8
% 0.07/0.26 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.07/0.26 % Starting post_as_ho8 with 300s (1) cores
% 0.07/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.07/0.26 % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.07/0.26 % Search class: HGUNF-FFSS21-SFFFMFNN
% 0.07/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.26 % SubtermCWHack with pid 151840 completed with status 0
% 0.07/0.26 % Result found by SubtermCWHack
% 0.07/0.26 % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.07/0.26 % Starting post_as_ho8 with 300s (1) cores
% 0.07/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.07/0.26 % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.07/0.26 % Search class: HGUNF-FFSS21-SFFFMFNN
% 0.07/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.26 % Preprocessing time : 0.001 s
% 0.07/0.26
% 0.07/0.26 % Proof found!
% 0.07/0.26 % SZS status Theorem
% 0.07/0.26 % SZS output start CNFRefutation
% See solution above
% 0.07/0.26 % Parsed axioms : 11
% 0.07/0.26 % Removed by relevancy pruning/SinE : 7
% 0.07/0.26 % Initial clauses : 9
% 0.07/0.26 % Removed in clause preprocessing : 0
% 0.07/0.26 % Initial clauses in saturation : 9
% 0.07/0.26 % Processed clauses : 17
% 0.07/0.26 % ...of these trivial : 0
% 0.07/0.26 % ...subsumed : 1
% 0.07/0.26 % ...remaining for further processing : 16
% 0.07/0.26 % Other redundant clauses eliminated : 0
% 0.07/0.26 % Clauses deleted for lack of memory : 0
% 0.07/0.26 % Backward-subsumed : 0
% 0.07/0.26 % Backward-rewritten : 1
% 0.07/0.26 % Generated clauses : 12
% 0.07/0.26 % ...of the previous two non-redundant : 9
% 0.07/0.26 % ...aggressively subsumed : 0
% 0.07/0.26 % Contextual simplify-reflections : 0
% 0.07/0.26 % Paramodulations : 12
% 0.07/0.26 % Factorizations : 0
% 0.07/0.26 % NegExts : 0
% 0.07/0.26 % Equation resolutions : 0
% 0.07/0.26 % Disequality decompositions : 0
% 0.07/0.26 % Total rewrite steps : 2
% 0.07/0.26 % ...of those cached : 0
% 0.07/0.26 % Propositional unsat checks : 0
% 0.07/0.26 % Propositional check models : 0
% 0.07/0.26 % Propositional check unsatisfiable : 0
% 0.07/0.26 % Propositional clauses : 0
% 0.07/0.26 % Propositional clauses after purity: 0
% 0.07/0.26 % Propositional unsat core size : 0
% 0.07/0.26 % Propositional preprocessing time : 0.000
% 0.07/0.26 % Propositional encoding time : 0.000
% 0.07/0.26 % Propositional solver time : 0.000
% 0.07/0.26 % Success case prop preproc time : 0.000
% 0.07/0.26 % Success case prop encoding time : 0.000
% 0.07/0.26 % Success case prop solver time : 0.000
% 0.07/0.26 % Current number of processed clauses : 15
% 0.07/0.26 % Positive orientable unit clauses : 7
% 0.07/0.26 % Positive unorientable unit clauses: 0
% 0.07/0.26 % Negative unit clauses : 0
% 0.07/0.26 % Non-unit-clauses : 8
% 0.07/0.26 % Current number of unprocessed clauses: 1
% 0.07/0.26 % ...number of literals in the above : 2
% 0.07/0.26 % Current number of archived formulas : 0
% 0.07/0.26 % Current number of archived clauses : 1
% 0.07/0.26 % Clause-clause subsumption calls (NU) : 13
% 0.07/0.26 % Rec. Clause-clause subsumption calls : 10
% 0.07/0.26 % Non-unit clause-clause subsumptions : 1
% 0.07/0.26 % Unit Clause-clause subsumption calls : 7
% 0.07/0.26 % Rewrite failures with RHS unbound : 0
% 0.07/0.26 % BW rewrite match attempts : 6
% 0.07/0.26 % BW rewrite match successes : 1
% 0.07/0.26 % Condensation attempts : 0
% 0.07/0.26 % Condensation successes : 0
% 0.07/0.26 % Termbank termtop insertions : 1075
% 0.07/0.26 % Search garbage collected termcells : 338
% 0.07/0.26
% 0.07/0.26 % -------------------------------------------------
% 0.07/0.26 % User time : 0.003 s
% 0.07/0.26 % System time : 0.004 s
% 0.07/0.26 % Total time : 0.006 s
% 0.07/0.26 % Maximum resident set size: 3636 pages
% 0.07/0.26
% 0.07/0.26 % -------------------------------------------------
% 0.07/0.26 % User time : 0.005 s
% 0.07/0.26 % System time : 0.007 s
% 0.07/0.26 % Total time : 0.013 s
% 0.07/0.26 % Maximum resident set size: 4864 pages
% 0.07/0.26 % E exiting
%------------------------------------------------------------------------------