%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU601^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 : n026.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.08s 0.25s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 41 ( 4 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 147 ( 18 ~; 6 |; 3 &; 103 @)
% ( 2 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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,
dsetconstrI: $o ).
thf(decl_26,type,
setminus: $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(setminusI,conjecture,
( dsetconstrI
=> ! [X1: $i,X5: $i,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ~ ( in @ X3 @ X5 )
=> ( in @ X3 @ ( setminus @ X1 @ X5 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.U1kLWBpz6W/E---3.1_639548.p',setminusI) ).
thf(dsetconstrI,axiom,
( dsetconstrI
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( X2 @ X3 )
=> ( in @ X3
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( X2 @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.U1kLWBpz6W/E---3.1_639548.p',dsetconstrI) ).
thf(setminus,axiom,
( setminus
= ( ^ [X1: $i,X5: $i] :
( dsetconstr @ X1
@ ^ [X3: $i] :
~ ( in @ X3 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.U1kLWBpz6W/E---3.1_639548.p',setminus) ).
thf(c_0_3,negated_conjecture,
~ ( dsetconstrI
=> ! [X1: $i,X5: $i,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ~ ( in @ X3 @ X5 )
=> ( in @ X3 @ ( setminus @ X1 @ X5 ) ) ) ) ),
inference(assume_negation,[status(cth)],[setminusI]) ).
thf(c_0_4,plain,
( dsetconstrI
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( X2 @ X3 )
=> ( in @ X3
@ ( dsetconstr @ X1
@ ^ [Z0: $i] : ( X2 @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstrI]) ).
thf(c_0_5,negated_conjecture,
~ ( ! [X12: $i,X13: $i > $o,X14: $i] :
( ( in @ X14 @ X12 )
=> ( ( X13 @ X14 )
=> ( in @ X14 @ ( dsetconstr @ X12 @ X13 ) ) ) )
=> ! [X1: $i,X5: $i,X3: $i] :
( ( in @ X3 @ X1 )
=> ( ~ ( in @ X3 @ X5 )
=> ( in @ X3 @ ( setminus @ X1 @ X5 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[c_0_3,c_0_4])])]) ).
thf(c_0_6,plain,
( setminus
= ( ^ [Z0: $i,Z1: $i] :
( dsetconstr @ Z0
@ ^ [Z2: $i] :
~ ( in @ Z2 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[setminus]) ).
thf(c_0_7,negated_conjecture,
! [X15: $i,X16: $i > $o,X17: $i] :
( ( ~ ( in @ X17 @ X15 )
| ~ ( X16 @ X17 )
| ( in @ X17 @ ( dsetconstr @ X15 @ X16 ) ) )
& ( in @ esk3_0 @ esk1_0 )
& ~ ( in @ esk3_0 @ esk2_0 )
& ~ ( in @ esk3_0 @ ( setminus @ esk1_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,
( setminus
= ( ^ [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,
! [X3: $i,X2: $i > $o,X1: $i] :
( ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) )
| ~ ( in @ X1 @ X3 )
| ~ ( X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
! [X1: $i,X3: $i] :
( ( dsetconstr @ X1
@ ^ [Z0: $i] :
~ ( in @ Z0 @ X3 ) )
= ( setminus @ X1 @ X3 ) ),
inference(arg_cong,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
~ ( in @ esk3_0 @ ( setminus @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X4: $i,X3: $i] :
( ( in @ X1 @ ( setminus @ X3 @ X4 ) )
| ( in @ X1 @ X4 )
| ~ ( in @ X1 @ X3 ) ),
inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10])]) ).
thf(c_0_13,negated_conjecture,
in @ esk3_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_14,negated_conjecture,
~ ( in @ esk3_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU601^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.08/0.17 % Computer : n026.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 13:59:27 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 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.U1kLWBpz6W/E---3.1_639548.p
% 0.08/0.25 % Version: 3.5.1-ho
% 0.08/0.25 % Preprocessing class: HSSSSMSSSLMNSFA.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.25 % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.25 % Starting sh4l with 300s (1) cores
% 0.08/0.25 % Starting lpo8_s with 300s (1) cores
% 0.08/0.25 % sh4l with pid 639563 completed with status 0
% 0.08/0.25 % Result found by sh4l
% 0.08/0.25 % Preprocessing class: HSSSSMSSSLMNSFA.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.25 % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.25 % Starting sh4l with 300s (1) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.25 % No SInE strategy applied
% 0.08/0.25 % Search class: HHUSF-FFSF22-DSFFMSBN
% 0.08/0.25 % partial match(1): HHUSF-FFSF22-SSFFMSBN
% 0.08/0.25 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.25 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.25 % SubtermCWHack with pid 639570 completed with status 0
% 0.08/0.25 % Result found by SubtermCWHack
% 0.08/0.25 % Preprocessing class: HSSSSMSSSLMNSFA.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.25 % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.25 % Starting sh4l with 300s (1) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.25 % No SInE strategy applied
% 0.08/0.25 % Search class: HHUSF-FFSF22-DSFFMSBN
% 0.08/0.25 % partial match(1): HHUSF-FFSF22-SSFFMSBN
% 0.08/0.25 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.25 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.25 % Preprocessing time : 0.001 s
% 0.08/0.25
% 0.08/0.25 % Proof found!
% 0.08/0.25 % SZS status Theorem
% 0.08/0.25 % SZS output start CNFRefutation
% See solution above
% 0.08/0.25 % Parsed axioms : 7
% 0.08/0.25 % Removed by relevancy pruning/SinE : 0
% 0.08/0.25 % Initial clauses : 9
% 0.08/0.25 % Removed in clause preprocessing : 4
% 0.08/0.25 % Initial clauses in saturation : 5
% 0.08/0.25 % Processed clauses : 9
% 0.08/0.25 % ...of these trivial : 1
% 0.08/0.25 % ...subsumed : 0
% 0.08/0.25 % ...remaining for further processing : 8
% 0.08/0.25 % Other redundant clauses eliminated : 0
% 0.08/0.25 % Clauses deleted for lack of memory : 0
% 0.08/0.25 % Backward-subsumed : 0
% 0.08/0.25 % Backward-rewritten : 0
% 0.08/0.25 % Generated clauses : 5
% 0.08/0.25 % ...of the previous two non-redundant : 4
% 0.08/0.25 % ...aggressively subsumed : 0
% 0.08/0.25 % Contextual simplify-reflections : 0
% 0.08/0.25 % Paramodulations : 2
% 0.08/0.25 % Factorizations : 0
% 0.08/0.25 % NegExts : 0
% 0.08/0.25 % Equation resolutions : 0
% 0.08/0.25 % Disequality decompositions : 0
% 0.08/0.25 % Total rewrite steps : 2
% 0.08/0.25 % ...of those cached : 0
% 0.08/0.25 % Propositional unsat checks : 0
% 0.08/0.25 % Propositional check models : 0
% 0.08/0.25 % Propositional check unsatisfiable : 0
% 0.08/0.25 % Propositional clauses : 0
% 0.08/0.25 % Propositional clauses after purity: 0
% 0.08/0.25 % Propositional unsat core size : 0
% 0.08/0.25 % Propositional preprocessing time : 0.000
% 0.08/0.25 % Propositional encoding time : 0.000
% 0.08/0.25 % Propositional solver time : 0.000
% 0.08/0.25 % Success case prop preproc time : 0.000
% 0.08/0.25 % Success case prop encoding time : 0.000
% 0.08/0.25 % Success case prop solver time : 0.000
% 0.08/0.25 % Current number of processed clauses : 8
% 0.08/0.25 % Positive orientable unit clauses : 4
% 0.08/0.25 % Positive unorientable unit clauses: 0
% 0.08/0.25 % Negative unit clauses : 2
% 0.08/0.25 % Non-unit-clauses : 2
% 0.08/0.25 % Current number of unprocessed clauses: 0
% 0.08/0.25 % ...number of literals in the above : 0
% 0.08/0.25 % Current number of archived formulas : 0
% 0.08/0.25 % Current number of archived clauses : 0
% 0.08/0.25 % Clause-clause subsumption calls (NU) : 0
% 0.08/0.25 % Rec. Clause-clause subsumption calls : 0
% 0.08/0.25 % Non-unit clause-clause subsumptions : 0
% 0.08/0.25 % Unit Clause-clause subsumption calls : 0
% 0.08/0.25 % Rewrite failures with RHS unbound : 0
% 0.08/0.25 % BW rewrite match attempts : 1
% 0.08/0.25 % BW rewrite match successes : 0
% 0.08/0.25 % Condensation attempts : 0
% 0.08/0.25 % Condensation successes : 0
% 0.08/0.25 % Termbank termtop insertions : 660
% 0.08/0.25 % Search garbage collected termcells : 173
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.002 s
% 0.08/0.25 % System time : 0.004 s
% 0.08/0.25 % Total time : 0.006 s
% 0.08/0.25 % Maximum resident set size: 3632 pages
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.003 s
% 0.08/0.25 % System time : 0.010 s
% 0.08/0.25 % Total time : 0.012 s
% 0.08/0.25 % Maximum resident set size: 4864 pages
% 0.08/0.25 % E exiting
%------------------------------------------------------------------------------