%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU517^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 : n006.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:20 AM UTC 2026
% Result : Theorem 0.23s 0.27s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU517^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.09/0.20 % Computer : n006.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 13:47:39 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running higher-order theorem proving
% 0.09/0.25 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.X5bXGAQJXp/E---3.1_742843.p
% 0.23/0.27 % Version: 3.5.1-ho
% 0.23/0.27 % Preprocessing class: HSSSSLSSSLMNSSA.
% 0.23/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.27 % Starting new_bool_2 with 300s (1) cores
% 0.23/0.27 % Starting new_bool_9 with 300s (1) cores
% 0.23/0.27 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.23/0.27 % new_ho_10 with pid 742870 completed with status 0
% 0.23/0.27 % Result found by new_ho_10
% 0.23/0.27 % Preprocessing class: HSSSSLSSSLMNSSA.
% 0.23/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.27 % No SInE strategy applied
% 0.23/0.27 % Search class: HGUSF-FFSF22-SSSFMSBN
% 0.23/0.27 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.27 % Starting SubtermCWHack with 151s (1) cores
% 0.23/0.27 % Starting new_ho_10 with 901s (1) cores
% 0.23/0.27 % Starting new_bool_2 with 151s (1) cores
% 0.23/0.27 % Starting new_bool_9 with 151s (1) cores
% 0.23/0.27 % Starting ehoh_best8_lambda with 146s (1) cores
% 0.23/0.27 % SubtermCWHack with pid 742875 completed with status 0
% 0.23/0.27 % Result found by SubtermCWHack
% 0.23/0.27 % Preprocessing class: HSSSSLSSSLMNSSA.
% 0.23/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.27 % No SInE strategy applied
% 0.23/0.27 % Search class: HGUSF-FFSF22-SSSFMSBN
% 0.23/0.27 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.27 % Starting SubtermCWHack with 151s (1) cores
% 0.23/0.27 % Preprocessing time : 0.001 s
% 0.23/0.27
% 0.23/0.27 % Proof found!
% 0.23/0.27 % SZS status Theorem
% 0.23/0.27 % SZS output start CNFRefutation
% 0.23/0.27 thf(decl_23, type, in: $i > $i > $o).
% 0.23/0.27 thf(decl_24, type, dsetconstr: $i > ($i > $o) > $i).
% 0.23/0.27 thf(decl_25, type, dsetconstrI: $o).
% 0.23/0.27 thf(decl_26, type, dsetconstrEL: $o).
% 0.23/0.27 thf(decl_27, type, setext: $o).
% 0.23/0.27 thf(decl_28, type, esk1_2: $i > $i > $i).
% 0.23/0.27 thf(decl_29, type, esk2_2: $i > $i > $i).
% 0.23/0.27 thf(decl_30, type, esk3_0: $i).
% 0.23/0.27 thf(decl_31, type, epred1_0: $i > $o).
% 0.23/0.27 thf(setoftrueEq, conjecture, ((dsetconstrI)=>((dsetconstrEL)=>((setext)=>![X1:$i]:(((dsetconstr @ X1 @ (^[X3:$i]:(($true))))=(X1)))))), file('/export/starexec/sandbox/tmp/tmp.X5bXGAQJXp/E---3.1_742843.p', setoftrueEq)).
% 0.23/0.27 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/sandbox/tmp/tmp.X5bXGAQJXp/E---3.1_742843.p', dsetconstrI)).
% 0.23/0.27 thf(dsetconstrEL, axiom, ((dsetconstrEL)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:((X2 @ X4)))))=>(in @ X3 @ X1)))), file('/export/starexec/sandbox/tmp/tmp.X5bXGAQJXp/E---3.1_742843.p', dsetconstrEL)).
% 0.23/0.27 thf(setext, axiom, ((setext)<=>![X1:$i, X5:$i]:((![X3:$i]:(((in @ X3 @ X1)=>(in @ X3 @ X5)))=>(![X3:$i]:(((in @ X3 @ X5)=>(in @ X3 @ X1)))=>((X1)=(X5)))))), file('/export/starexec/sandbox/tmp/tmp.X5bXGAQJXp/E---3.1_742843.p', setext)).
% 0.23/0.27 thf(c_0_4, negated_conjecture, ~(((dsetconstrI)=>((dsetconstrEL)=>((setext)=>![X1:$i]:(((dsetconstr @ X1 @ (^[X3:$i]:(($true))))=(X1))))))), inference(assume_negation,[status(cth)],[setoftrueEq])).
% 0.23/0.27 thf(c_0_5, 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])).
% 0.23/0.27 thf(c_0_6, plain, ((dsetconstrEL)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ (dsetconstr @ X1 @ (^[Z0:$i]:((X2 @ Z0)))))=>(in @ X3 @ X1)))), inference(fof_simplification,[status(thm)],[dsetconstrEL])).
% 0.23/0.27 thf(c_0_7, negated_conjecture, ~((![X17:$i, X18:$i > $o, X19:$i]:(((in @ X19 @ X17)=>((X18 @ X19)=>(in @ X19 @ (dsetconstr @ X17 @ X18)))))=>(![X20:$i, X21:$i > $o, X22:$i]:(((in @ X22 @ (dsetconstr @ X20 @ X21))=>(in @ X22 @ X20)))=>(![X23:$i, X24:$i]:((![X25:$i]:(((in @ X25 @ X23)=>(in @ X25 @ X24)))=>(![X26:$i]:(((in @ X26 @ X24)=>(in @ X26 @ X23)))=>((X23)=(X24)))))=>![X1:$i]:(((dsetconstr @ X1 @ (^[Z0:$i]:($true)))=(X1))))))), inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4]), c_0_5]), c_0_6]), setext])])).
% 0.23/0.27 thf(c_0_8, negated_conjecture, ![X27:$i, X28:$i > $o, X29:$i, X30:$i, X31:$i > $o, X32:$i, X33:$i, X34:$i]:(((~(in @ X29 @ X27)|(~(X28 @ X29)|(in @ X29 @ (dsetconstr @ X27 @ X28))))&((~(in @ X32 @ (dsetconstr @ X30 @ X31))|(in @ X32 @ X30))&(((((in @ (esk2_2 @ X33 @ X34) @ X34)|((X33)=(X34))|(in @ (esk1_2 @ X33 @ X34) @ X33))&(~(in @ (esk2_2 @ X33 @ X34) @ X33)|((X33)=(X34))|(in @ (esk1_2 @ X33 @ X34) @ X33)))&(((in @ (esk2_2 @ X33 @ X34) @ X34)|((X33)=(X34))|~(in @ (esk1_2 @ X33 @ X34) @ X34))&(~(in @ (esk2_2 @ X33 @ X34) @ X33)|((X33)=(X34))|~(in @ (esk1_2 @ X33 @ X34) @ X34))))&((dsetconstr @ esk3_0 @ (^[Z0:$i]:($true)))!=(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_7])])])])])])).
% 0.23/0.27 thf(c_0_9, negated_conjecture, ![X3:$i, X1:$i]:((((X1)=(X3))|(in @ (esk1_2 @ X1 @ X3) @ X1)|~((in @ (esk2_2 @ X1 @ X3) @ X1)))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.23/0.27 thf(c_0_10, 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_8])).
% 0.23/0.27 thf(c_0_11, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:(((in @ X1 @ X3)|~((in @ X1 @ (dsetconstr @ X3 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.23/0.27 thf(c_0_12, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i]:((((dsetconstr @ X1 @ X2)=(X3))|(in @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ X3) @ (dsetconstr @ X1 @ X2))|~((in @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ X3) @ X1))|~((X2 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ X3))))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
% 0.23/0.27 thf(c_0_13, negated_conjecture, ![X3:$i, X1:$i]:(((in @ (esk2_2 @ X1 @ X3) @ X3)|((X1)=(X3))|(in @ (esk1_2 @ X1 @ X3) @ X1))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.23/0.27 thf(c_0_14, plain, ![X39:$i]:(((~(epred1_0 @ X39)|($true))&(~($true)|(epred1_0 @ X39)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])).
% 0.23/0.27 thf(c_0_15, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i]:((((dsetconstr @ X1 @ X2)=(X3))|(in @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ X3) @ X1)|~((in @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ X3) @ X1))|~((X2 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ X3))))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
% 0.23/0.27 thf(c_0_16, negated_conjecture, ![X3:$i, X2:$i > $o, X1:$i]:((((dsetconstr @ X1 @ X2)=(X3))|(in @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ X3) @ X3)|(in @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ X3) @ X1))), inference(spm,[status(thm)],[c_0_11, c_0_13])).
% 0.23/0.27 thf(c_0_17, plain, ![X1:$i]:(((epred1_0 @ X1)|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_14])).
% 0.23/0.27 thf(c_0_18, negated_conjecture, ![X2:$i > $o, X1:$i]:((((dsetconstr @ X1 @ X2)=(X1))|(in @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ X1) @ X1)|~((X2 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ X1))))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
% 0.23/0.27 thf(c_0_19, plain, ![X1:$i]:((epred1_0 @ X1)), inference(cn,[status(thm)],[c_0_17])).
% 0.23/0.27 thf(c_0_20, negated_conjecture, ![X1:$i, X3:$i]:((((X1)=(X3))|~((in @ (esk2_2 @ X1 @ X3) @ X1))|~((in @ (esk1_2 @ X1 @ X3) @ X3)))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.23/0.27 thf(c_0_21, plain, ![X1:$i]:((((dsetconstr @ X1 @ epred1_0)=(X1))|(in @ (esk1_2 @ (dsetconstr @ X1 @ epred1_0) @ X1) @ X1))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
% 0.23/0.27 thf(c_0_22, negated_conjecture, ![X1:$i]:((((dsetconstr @ X1 @ epred1_0)=(X1))|~((in @ (esk2_2 @ (dsetconstr @ X1 @ epred1_0) @ X1) @ (dsetconstr @ X1 @ epred1_0))))), inference(spm,[status(thm)],[c_0_20, c_0_21])).
% 0.23/0.27 thf(c_0_23, plain, ![X38:$i]:(((epred1_0 @ X38)<=>($true))), introduced(definition)).
% 0.23/0.27 thf(c_0_24, negated_conjecture, ![X1:$i]:((((dsetconstr @ X1 @ epred1_0)=(X1))|~((in @ (esk2_2 @ (dsetconstr @ X1 @ epred1_0) @ X1) @ X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_10]), c_0_19])])).
% 0.23/0.27 thf(c_0_25, negated_conjecture, ![X1:$i, X3:$i]:(((in @ (esk2_2 @ X1 @ X3) @ X3)|((X1)=(X3))|~((in @ (esk1_2 @ X1 @ X3) @ X3)))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.23/0.27 thf(c_0_26, negated_conjecture, ((dsetconstr @ esk3_0 @ epred1_0)!=(esk3_0)), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_8]), c_0_23])).
% 0.23/0.27 thf(c_0_27, negated_conjecture, ![X1:$i]:(((dsetconstr @ X1 @ epred1_0)=(X1))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_21])).
% 0.23/0.27 thf(c_0_28, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26, c_0_27])]), ['proof']).
% 0.23/0.27 % SZS output end CNFRefutation
% 0.23/0.27 % Parsed axioms : 9
% 0.23/0.27 % Removed by relevancy pruning/SinE : 0
% 0.23/0.27 % Initial clauses : 14
% 0.23/0.27 % Removed in clause preprocessing : 6
% 0.23/0.27 % Initial clauses in saturation : 8
% 0.23/0.27 % Processed clauses : 28
% 0.23/0.27 % ...of these trivial : 0
% 0.23/0.27 % ...subsumed : 1
% 0.23/0.27 % ...remaining for further processing : 27
% 0.23/0.27 % Other redundant clauses eliminated : 0
% 0.23/0.27 % Clauses deleted for lack of memory : 0
% 0.23/0.27 % Backward-subsumed : 0
% 0.23/0.27 % Backward-rewritten : 4
% 0.23/0.27 % Generated clauses : 67
% 0.23/0.27 % ...of the previous two non-redundant : 43
% 0.23/0.27 % ...aggressively subsumed : 0
% 0.23/0.27 % Contextual simplify-reflections : 1
% 0.23/0.27 % Paramodulations : 67
% 0.23/0.27 % Factorizations : 0
% 0.23/0.27 % NegExts : 0
% 0.23/0.27 % Equation resolutions : 0
% 0.23/0.27 % Disequality decompositions : 0
% 0.23/0.27 % Total rewrite steps : 9
% 0.23/0.27 % ...of those cached : 6
% 0.23/0.27 % Propositional unsat checks : 0
% 0.23/0.27 % Propositional check models : 0
% 0.23/0.27 % Propositional check unsatisfiable : 0
% 0.23/0.27 % Propositional clauses : 0
% 0.23/0.27 % Propositional clauses after purity: 0
% 0.23/0.27 % Propositional unsat core size : 0
% 0.23/0.27 % Propositional preprocessing time : 0.000
% 0.23/0.27 % Propositional encoding time : 0.000
% 0.23/0.27 % Propositional solver time : 0.000
% 0.23/0.27 % Success case prop preproc time : 0.000
% 0.23/0.27 % Success case prop encoding time : 0.000
% 0.23/0.27 % Success case prop solver time : 0.000
% 0.23/0.27 % Current number of processed clauses : 23
% 0.23/0.27 % Positive orientable unit clauses : 2
% 0.23/0.27 % Positive unorientable unit clauses: 0
% 0.23/0.27 % Negative unit clauses : 0
% 0.23/0.27 % Non-unit-clauses : 21
% 0.23/0.27 % Current number of unprocessed clauses: 23
% 0.23/0.27 % ...number of literals in the above : 70
% 0.23/0.27 % Current number of archived formulas : 0
% 0.23/0.27 % Current number of archived clauses : 4
% 0.23/0.27 % Clause-clause subsumption calls (NU) : 135
% 0.23/0.27 % Rec. Clause-clause subsumption calls : 68
% 0.23/0.27 % Non-unit clause-clause subsumptions : 2
% 0.23/0.27 % Unit Clause-clause subsumption calls : 0
% 0.23/0.27 % Rewrite failures with RHS unbound : 0
% 0.23/0.27 % BW rewrite match attempts : 2
% 0.23/0.27 % BW rewrite match successes : 2
% 0.23/0.27 % Condensation attempts : 0
% 0.23/0.27 % Condensation successes : 0
% 0.23/0.27 % Termbank termtop insertions : 2576
% 0.23/0.27 % Search garbage collected termcells : 393
% 0.23/0.27
% 0.23/0.27 % -------------------------------------------------
% 0.23/0.27 % User time : 0.005 s
% 0.23/0.27 % System time : 0.004 s
% 0.23/0.27 % Total time : 0.009 s
% 0.23/0.27 % Maximum resident set size: 3636 pages
% 0.23/0.27
% 0.23/0.27 % -------------------------------------------------
% 0.23/0.27 % User time : 0.017 s
% 0.23/0.27 % System time : 0.013 s
% 0.23/0.27 % Total time : 0.030 s
% 0.23/0.27 % Maximum resident set size: 4608 pages
% 0.23/0.27 % E exiting
%------------------------------------------------------------------------------