%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU595^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:24:39 AM UTC 2026
% Result : Theorem 0.08s 0.26s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 30 ( 4 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 104 ( 7 ~; 3 |; 2 &; 81 @)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 41 ( 12 ^; 29 !; 0 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_25,type,
dsetconstrER: $o ).
thf(decl_26,type,
binintersect: $i > $i > $i ).
thf(decl_27,type,
esk1_0: $i ).
thf(decl_28,type,
esk2_0: $i ).
thf(decl_29,type,
esk3_0: $i ).
thf(binintersectER,conjecture,
( dsetconstrER
=> ! [X1: $i,X5: $i,X3: $i] :
( ( in @ X3 @ ( binintersect @ X1 @ X5 ) )
=> ( in @ X3 @ X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.vgSGlYbjRw/E---3.1_3194390.p',binintersectER) ).
thf(dsetconstrER,axiom,
( dsetconstrER
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( X2 @ X4 ) ) )
=> ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.vgSGlYbjRw/E---3.1_3194390.p',dsetconstrER) ).
thf(binintersect,axiom,
( binintersect
= ( ^ [X1: $i,X5: $i] :
( dsetconstr @ X1
@ ^ [X3: $i] : ( in @ X3 @ X5 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.vgSGlYbjRw/E---3.1_3194390.p',binintersect) ).
thf(c_0_3,negated_conjecture,
~ ( dsetconstrER
=> ! [X1: $i,X5: $i,X3: $i] :
( ( in @ X3 @ ( binintersect @ X1 @ X5 ) )
=> ( in @ X3 @ X5 ) ) ),
inference(assume_negation,[status(cth)],[binintersectER]) ).
thf(c_0_4,plain,
( dsetconstrER
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3
@ ( dsetconstr @ X1
@ ^ [Z0: $i] : ( X2 @ Z0 ) ) )
=> ( X2 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstrER]) ).
thf(c_0_5,negated_conjecture,
~ ( ! [X12: $i,X13: $i > $o,X14: $i] :
( ( in @ X14 @ ( dsetconstr @ X12 @ X13 ) )
=> ( X13 @ X14 ) )
=> ! [X1: $i,X5: $i,X3: $i] :
( ( in @ X3 @ ( binintersect @ X1 @ X5 ) )
=> ( in @ X3 @ X5 ) ) ),
inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[c_0_3,c_0_4])]) ).
thf(c_0_6,plain,
( binintersect
= ( ^ [Z0: $i,Z1: $i] :
( dsetconstr @ Z0
@ ^ [Z2: $i] : ( in @ Z2 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[binintersect]) ).
thf(c_0_7,negated_conjecture,
! [X15: $i,X16: $i > $o,X17: $i] :
( ( ~ ( in @ X17 @ ( dsetconstr @ X15 @ X16 ) )
| ( X16 @ X17 ) )
& ( in @ esk3_0 @ ( binintersect @ esk1_0 @ esk2_0 ) )
& ~ ( in @ esk3_0 @ esk2_0 ) ),
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_8,plain,
( binintersect
= ( ^ [Z0: $i,Z1: $i] :
( dsetconstr @ Z0
@ ^ [Z2: $i] : ( in @ Z2 @ Z1 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( X2 @ X1 )
| ~ ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
! [X1: $i,X3: $i] :
( ( dsetconstr @ X1
@ ^ [Z0: $i] : ( in @ Z0 @ X3 ) )
= ( binintersect @ X1 @ X3 ) ),
inference(arg_cong,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X4: $i,X3: $i] :
( ( in @ X1 @ X3 )
| ~ ( in @ X1 @ ( binintersect @ X4 @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,negated_conjecture,
in @ esk3_0 @ ( binintersect @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_13,negated_conjecture,
~ ( in @ esk3_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
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.03 % Problem : SEU595^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.18 % Computer : n008.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:56: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.23 Running higher-order theorem proving
% 0.08/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.vgSGlYbjRw/E---3.1_3194390.p
% 0.08/0.26 % Version: 3.5.1-ho
% 0.08/0.26 % Preprocessing class: HSSSSMSSSLMNSFA.
% 0.08/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.26 % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.26 % Starting sh4l with 300s (1) cores
% 0.08/0.26 % Starting lpo8_s with 300s (1) cores
% 0.08/0.26 % ho_unfolding_6 with pid 3194425 completed with status 0
% 0.08/0.26 % Result found by ho_unfolding_6
% 0.08/0.26 % Preprocessing class: HSSSSMSSSLMNSFA.
% 0.08/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.26 % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.26 % No SInE strategy applied
% 0.08/0.26 % Search class: HHUSF-FFSF22-MSFFMSBN
% 0.08/0.26 % partial match(1): HHUSF-FFSF22-SSFFMSBN
% 0.08/0.26 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.26 % SubtermCWHack with pid 3194429 completed with status 0
% 0.08/0.26 % Result found by SubtermCWHack
% 0.08/0.26 % Preprocessing class: HSSSSMSSSLMNSFA.
% 0.08/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.26 % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.26 % No SInE strategy applied
% 0.08/0.26 % Search class: HHUSF-FFSF22-MSFFMSBN
% 0.08/0.26 % partial match(1): HHUSF-FFSF22-SSFFMSBN
% 0.08/0.26 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.26 % Preprocessing time : 0.001 s
% 0.08/0.26
% 0.08/0.26 % Proof found!
% 0.08/0.26 % SZS status Theorem
% 0.08/0.26 % SZS output start CNFRefutation
% See solution above
% 0.08/0.26 % Parsed axioms : 7
% 0.08/0.26 % Removed by relevancy pruning/SinE : 0
% 0.08/0.26 % Initial clauses : 8
% 0.08/0.26 % Removed in clause preprocessing : 4
% 0.08/0.26 % Initial clauses in saturation : 4
% 0.08/0.26 % Processed clauses : 7
% 0.08/0.26 % ...of these trivial : 0
% 0.08/0.26 % ...subsumed : 0
% 0.08/0.26 % ...remaining for further processing : 7
% 0.08/0.26 % Other redundant clauses eliminated : 0
% 0.08/0.26 % Clauses deleted for lack of memory : 0
% 0.08/0.26 % Backward-subsumed : 0
% 0.08/0.26 % Backward-rewritten : 0
% 0.08/0.26 % Generated clauses : 5
% 0.08/0.26 % ...of the previous two non-redundant : 4
% 0.08/0.26 % ...aggressively subsumed : 0
% 0.08/0.26 % Contextual simplify-reflections : 0
% 0.08/0.26 % Paramodulations : 2
% 0.08/0.26 % Factorizations : 0
% 0.08/0.26 % NegExts : 0
% 0.08/0.26 % Equation resolutions : 0
% 0.08/0.26 % Disequality decompositions : 0
% 0.08/0.26 % Total rewrite steps : 0
% 0.08/0.26 % ...of those cached : 0
% 0.08/0.26 % Propositional unsat checks : 0
% 0.08/0.26 % Propositional check models : 0
% 0.08/0.26 % Propositional check unsatisfiable : 0
% 0.08/0.26 % Propositional clauses : 0
% 0.08/0.26 % Propositional clauses after purity: 0
% 0.08/0.26 % Propositional unsat core size : 0
% 0.08/0.26 % Propositional preprocessing time : 0.000
% 0.08/0.26 % Propositional encoding time : 0.000
% 0.08/0.26 % Propositional solver time : 0.000
% 0.08/0.26 % Success case prop preproc time : 0.000
% 0.08/0.26 % Success case prop encoding time : 0.000
% 0.08/0.26 % Success case prop solver time : 0.000
% 0.08/0.26 % Current number of processed clauses : 7
% 0.08/0.26 % Positive orientable unit clauses : 4
% 0.08/0.26 % Positive unorientable unit clauses: 0
% 0.08/0.26 % Negative unit clauses : 1
% 0.08/0.26 % Non-unit-clauses : 2
% 0.08/0.26 % Current number of unprocessed clauses: 1
% 0.08/0.26 % ...number of literals in the above : 1
% 0.08/0.26 % Current number of archived formulas : 0
% 0.08/0.26 % Current number of archived clauses : 0
% 0.08/0.26 % Clause-clause subsumption calls (NU) : 0
% 0.08/0.26 % Rec. Clause-clause subsumption calls : 0
% 0.08/0.26 % Non-unit clause-clause subsumptions : 0
% 0.08/0.26 % Unit Clause-clause subsumption calls : 0
% 0.08/0.26 % Rewrite failures with RHS unbound : 0
% 0.08/0.26 % BW rewrite match attempts : 1
% 0.08/0.26 % BW rewrite match successes : 0
% 0.08/0.26 % Condensation attempts : 0
% 0.08/0.26 % Condensation successes : 0
% 0.08/0.26 % Termbank termtop insertions : 522
% 0.08/0.26 % Search garbage collected termcells : 135
% 0.08/0.26
% 0.08/0.26 % -------------------------------------------------
% 0.08/0.26 % User time : 0.002 s
% 0.08/0.26 % System time : 0.003 s
% 0.08/0.26 % Total time : 0.005 s
% 0.08/0.26 % Maximum resident set size: 3632 pages
% 0.08/0.26
% 0.08/0.26 % -------------------------------------------------
% 0.08/0.26 % User time : 0.003 s
% 0.08/0.26 % System time : 0.007 s
% 0.08/0.26 % Total time : 0.010 s
% 0.08/0.26 % Maximum resident set size: 4864 pages
% 0.08/0.26 % E exiting
%------------------------------------------------------------------------------