%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO331^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:42:46 AM UTC 2026
% Result : Theorem 0.25s 0.37s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYO331^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.25 % Computer : n006.cluster.edu
% 0.09/0.25 % Model : x86_64 x86_64
% 0.09/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.25 % Memory : 8046.5625MB
% 0.09/0.25 % OS : Linux 6.8.0-71-generic
% 0.09/0.26 % CPULimit : 300
% 0.09/0.26 % WCLimit : 300
% 0.09/0.26 % DateTime : Tue Sep 29 16:46:09 UTC 2026
% 0.09/0.26 % CPUTime :
% 0.09/0.26 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.32 Running higher-order theorem proving
% 0.25/0.34 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.ZpUYAfvqPn/E---3.1_1000242.p
% 0.25/0.37 % Version: 3.5.1-ho
% 0.25/0.37 % Preprocessing class: HSSSSMSSSSMNSSA.
% 0.25/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.37 % Starting sh3 with 1500s (5) cores
% 0.25/0.37 % Starting lpo8_s with 300s (1) cores
% 0.25/0.37 % Starting sh2lt with 300s (1) cores
% 0.25/0.37 % Starting sh2l with 300s (1) cores
% 0.25/0.37 % sh2lt with pid 1000257 completed with status 0
% 0.25/0.37 % Result found by sh2lt
% 0.25/0.37 % Preprocessing class: HSSSSMSSSSMNSSA.
% 0.25/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.37 % Starting sh3 with 1500s (5) cores
% 0.25/0.37 % Starting lpo8_s with 300s (1) cores
% 0.25/0.37 % Starting sh2lt with 300s (1) cores
% 0.25/0.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.25/0.37 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.25/0.37 % Search class: HGUNF-FFSF21-SSSFFMBN
% 0.25/0.37 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.37 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.37 % SubtermCWHack with pid 1000263 completed with status 0
% 0.25/0.37 % Result found by SubtermCWHack
% 0.25/0.37 % Preprocessing class: HSSSSMSSSSMNSSA.
% 0.25/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.37 % Starting sh3 with 1500s (5) cores
% 0.25/0.37 % Starting lpo8_s with 300s (1) cores
% 0.25/0.37 % Starting sh2lt with 300s (1) cores
% 0.25/0.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.25/0.37 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.25/0.37 % Search class: HGUNF-FFSF21-SSSFFMBN
% 0.25/0.37 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.37 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.37 % Preprocessing time : 0.001 s
% 0.25/0.37
% 0.25/0.37 % Proof found!
% 0.25/0.37 % SZS status Theorem
% 0.25/0.37 % SZS output start CNFRefutation
% 0.25/0.37 thf(decl_sort1, type, a: $tType).
% 0.25/0.37 thf(decl_23, type, cK: (a > $o) > a > $o).
% 0.25/0.37 thf(decl_24, type, esk1_1: (a > $o) > a).
% 0.25/0.37 thf(decl_25, type, esk2_2: (a > $o) > (a > $o) > a).
% 0.25/0.37 thf(decl_26, type, esk3_0: a).
% 0.25/0.37 thf(decl_27, type, epred1_0: a > $o).
% 0.25/0.37 thf(decl_28, type, epred2_0: a > $o).
% 0.25/0.37 thf(cTHM116_2SS_pme, conjecture, (![X1:a > $o]:((![X2:a]:(((X1 @ X2)=>?[X3:a > $o]:((![X4:a]:(((X3 @ X4)=>(cK @ X3 @ X4)))&(X3 @ X2)))))=>![X2:a]:(((cK @ X1 @ X2)=>(cK @ (^[X4:a]:(?[X3:a > $o]:(((![X5:a]:((((X3 @ X5))=>((cK @ X3 @ X5)))))&((X3 @ X4)))))) @ X2)))))=>![X2:a]:((?[X3:a > $o]:((![X4:a]:(((X3 @ X4)=>(cK @ X3 @ X4)))&(X3 @ X2)))=>(cK @ (^[X4:a]:(?[X3:a > $o]:(((![X5:a]:((((X3 @ X5))=>((cK @ X3 @ X5)))))&((X3 @ X4)))))) @ X2)))), file('/export/starexec/sandbox2/tmp/tmp.ZpUYAfvqPn/E---3.1_1000242.p', cTHM116_2SS_pme)).
% 0.25/0.37 thf(c_0_1, negated_conjecture, ~((![X1:a > $o]:((![X2:a]:(((X1 @ X2)=>?[X3:a > $o]:((![X4:a]:(((X3 @ X4)=>(cK @ X3 @ X4)))&(X3 @ X2)))))=>![X2:a]:(((cK @ X1 @ X2)=>(cK @ (^[X4:a]:(?[X3:a > $o]:(((![X5:a]:((((X3 @ X5))=>((cK @ X3 @ X5)))))&((X3 @ X4)))))) @ X2)))))=>![X2:a]:((?[X3:a > $o]:((![X4:a]:(((X3 @ X4)=>(cK @ X3 @ X4)))&(X3 @ X2)))=>(cK @ (^[X4:a]:(?[X3:a > $o]:(((![X5:a]:((((X3 @ X5))=>((cK @ X3 @ X5)))))&((X3 @ X4)))))) @ X2))))), inference(assume_negation,[status(cth)],[cTHM116_2SS_pme])).
% 0.25/0.37 thf(c_0_2, negated_conjecture, ~((![X1:a > $o]:((![X2:a]:(((X1 @ X2)=>?[X3:a > $o]:((![X4:a]:(((X3 @ X4)=>(cK @ X3 @ X4)))&(X3 @ X2)))))=>![X2:a]:(((cK @ X1 @ X2)=>(cK @ (^[Z0:a]:(?[X3:a > $o]:(((![X5:a]:(((X3 @ X5)=>((cK @ X3 @ X5)))))&(X3 @ Z0))))) @ X2)))))=>![X2:a]:((?[X3:a > $o]:((![X4:a]:(((X3 @ X4)=>(cK @ X3 @ X4)))&(X3 @ X2)))=>(cK @ (^[Z0:a]:(?[X3:a > $o]:(((![X5:a]:(((X3 @ X5)=>((cK @ X3 @ X5)))))&(X3 @ Z0))))) @ X2))))), inference(fof_simplification,[status(thm)],[c_0_1])).
% 0.25/0.37 thf(c_0_3, negated_conjecture, ![X14:a > $o, X16:a > $o, X18:a, X21:a]:(((((X14 @ (esk1_1 @ X14))|(~(cK @ X14 @ X18)|(cK @ (^[Z0:a]:(?[X3:a > $o]:(((![X5:a]:(((X3 @ X5)=>((cK @ X3 @ X5)))))&(X3 @ Z0))))) @ X18)))&(((X16 @ (esk2_2 @ X14 @ X16))|~(X16 @ (esk1_1 @ X14))|(~(cK @ X14 @ X18)|(cK @ (^[Z0:a]:(?[X3:a > $o]:(((![X5:a]:(((X3 @ X5)=>((cK @ X3 @ X5)))))&(X3 @ Z0))))) @ X18)))&(~(cK @ X16 @ (esk2_2 @ X14 @ X16))|~(X16 @ (esk1_1 @ X14))|(~(cK @ X14 @ X18)|(cK @ (^[Z0:a]:(?[X3:a > $o]:(((![X5:a]:(((X3 @ X5)=>((cK @ X3 @ X5)))))&(X3 @ Z0))))) @ X18)))))&(((~(epred1_0 @ X21)|(cK @ epred1_0 @ X21))&(epred1_0 @ esk3_0))&~(cK @ (^[Z0:a]:(?[X3:a > $o]:(((![X5:a]:(((X3 @ X5)=>((cK @ X3 @ X5)))))&(X3 @ Z0))))) @ 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_2])])])])])])).
% 0.25/0.37 thf(c_0_4, plain, ![X24:a]:(((epred2_0 @ X24)<=>?[X22:a > $o]:((![X23:a]:(((X22 @ X23)=>(cK @ X22 @ X23)))&(X22 @ X24))))), introduced(definition)).
% 0.25/0.37 thf(c_0_5, negated_conjecture, ![X1:a > $o, X2:a]:(((X1 @ (esk1_1 @ X1))|(((cK @ epred2_0 @ X2))=(($true)))|~((cK @ X1 @ X2)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4])).
% 0.25/0.37 thf(c_0_6, negated_conjecture, ![X1:a > $o, X3:a > $o, X2:a]:(((((cK @ epred2_0 @ X2))=(($true)))|~((cK @ X1 @ (esk2_2 @ X3 @ X1)))|~((X1 @ (esk1_1 @ X3)))|~((cK @ X3 @ X2)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4])).
% 0.25/0.37 thf(c_0_7, negated_conjecture, ![X1:a > $o, X3:a > $o, X2:a]:(((X1 @ (esk2_2 @ X3 @ X1))|(((cK @ epred2_0 @ X2))=(($true)))|~((X1 @ (esk1_1 @ X3)))|~((cK @ X3 @ X2)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4])).
% 0.25/0.37 thf(c_0_8, negated_conjecture, ![X1:a > $o, X2:a]:(((cK @ epred2_0 @ X2)|(X1 @ (esk1_1 @ X1))|~((cK @ X1 @ X2)))), inference(cn,[status(thm)],[c_0_5])).
% 0.25/0.37 thf(c_0_9, negated_conjecture, ![X2:a]:(((cK @ epred1_0 @ X2)|~((epred1_0 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.25/0.37 thf(c_0_10, negated_conjecture, ~((((cK @ epred2_0 @ esk3_0))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4])).
% 0.25/0.37 thf(c_0_11, negated_conjecture, ![X1:a > $o, X2:a, X3:a > $o]:(((cK @ epred2_0 @ X2)|~((cK @ X1 @ (esk2_2 @ X3 @ X1)))|~((cK @ X3 @ X2))|~((X1 @ (esk1_1 @ X3))))), inference(cn,[status(thm)],[c_0_6])).
% 0.25/0.37 thf(c_0_12, negated_conjecture, ![X1:a > $o, X2:a, X3:a > $o]:(((cK @ epred2_0 @ X2)|(X1 @ (esk2_2 @ X3 @ X1))|~((cK @ X3 @ X2))|~((X1 @ (esk1_1 @ X3))))), inference(cn,[status(thm)],[c_0_7])).
% 0.25/0.37 thf(c_0_13, negated_conjecture, ![X2:a]:(((epred1_0 @ (esk1_1 @ epred1_0))|(cK @ epred2_0 @ X2)|~((epred1_0 @ X2)))), inference(spm,[status(thm)],[c_0_8, c_0_9])).
% 0.25/0.37 thf(c_0_14, negated_conjecture, (epred1_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.25/0.37 thf(c_0_15, negated_conjecture, ~((cK @ epred2_0 @ esk3_0)), inference(cn,[status(thm)],[c_0_10])).
% 0.25/0.37 thf(c_0_16, negated_conjecture, ![X1:a > $o, X2:a]:(((cK @ epred2_0 @ X2)|~((epred1_0 @ (esk1_1 @ X1)))|~((cK @ X1 @ X2)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_9]), c_0_12])).
% 0.25/0.37 thf(c_0_17, negated_conjecture, (epred1_0 @ (esk1_1 @ epred1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15])).
% 0.25/0.37 thf(c_0_18, negated_conjecture, ![X2:a]:(((cK @ epred2_0 @ X2)|~((cK @ epred1_0 @ X2)))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
% 0.25/0.37 thf(c_0_19, negated_conjecture, ![X2:a]:(((cK @ epred2_0 @ X2)|~((epred1_0 @ X2)))), inference(spm,[status(thm)],[c_0_18, c_0_9])).
% 0.25/0.37 thf(c_0_20, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_19]), c_0_14])]), ['proof']).
% 0.25/0.37 % SZS output end CNFRefutation
% 0.25/0.37 % Parsed axioms : 3
% 0.25/0.37 % Removed by relevancy pruning/SinE : 2
% 0.25/0.37 % Initial clauses : 10
% 0.25/0.37 % Removed in clause preprocessing : 0
% 0.25/0.37 % Initial clauses in saturation : 10
% 0.25/0.37 % Processed clauses : 34
% 0.25/0.37 % ...of these trivial : 0
% 0.25/0.37 % ...subsumed : 3
% 0.25/0.37 % ...remaining for further processing : 31
% 0.25/0.37 % Other redundant clauses eliminated : 0
% 0.25/0.37 % Clauses deleted for lack of memory : 0
% 0.25/0.37 % Backward-subsumed : 1
% 0.25/0.37 % Backward-rewritten : 4
% 0.25/0.37 % Generated clauses : 53
% 0.25/0.37 % ...of the previous two non-redundant : 47
% 0.25/0.37 % ...aggressively subsumed : 0
% 0.25/0.37 % Contextual simplify-reflections : 3
% 0.25/0.37 % Paramodulations : 53
% 0.25/0.37 % Factorizations : 0
% 0.25/0.37 % NegExts : 0
% 0.25/0.37 % Equation resolutions : 0
% 0.25/0.37 % Disequality decompositions : 0
% 0.25/0.37 % Total rewrite steps : 10
% 0.25/0.37 % ...of those cached : 4
% 0.25/0.37 % Propositional unsat checks : 0
% 0.25/0.37 % Propositional check models : 0
% 0.25/0.37 % Propositional check unsatisfiable : 0
% 0.25/0.37 % Propositional clauses : 0
% 0.25/0.37 % Propositional clauses after purity: 0
% 0.25/0.37 % Propositional unsat core size : 0
% 0.25/0.37 % Propositional preprocessing time : 0.000
% 0.25/0.37 % Propositional encoding time : 0.000
% 0.25/0.37 % Propositional solver time : 0.000
% 0.25/0.37 % Success case prop preproc time : 0.000
% 0.25/0.37 % Success case prop encoding time : 0.000
% 0.25/0.37 % Success case prop solver time : 0.000
% 0.25/0.37 % Current number of processed clauses : 26
% 0.25/0.37 % Positive orientable unit clauses : 8
% 0.25/0.37 % Positive unorientable unit clauses: 0
% 0.25/0.37 % Negative unit clauses : 1
% 0.25/0.37 % Non-unit-clauses : 17
% 0.25/0.37 % Current number of unprocessed clauses: 14
% 0.25/0.37 % ...number of literals in the above : 56
% 0.25/0.37 % Current number of archived formulas : 0
% 0.25/0.37 % Current number of archived clauses : 5
% 0.25/0.37 % Clause-clause subsumption calls (NU) : 131
% 0.25/0.37 % Rec. Clause-clause subsumption calls : 102
% 0.25/0.37 % Non-unit clause-clause subsumptions : 7
% 0.25/0.37 % Unit Clause-clause subsumption calls : 0
% 0.25/0.37 % Rewrite failures with RHS unbound : 0
% 0.25/0.37 % BW rewrite match attempts : 4
% 0.25/0.37 % BW rewrite match successes : 4
% 0.25/0.37 % Condensation attempts : 0
% 0.25/0.37 % Condensation successes : 0
% 0.25/0.37 % Termbank termtop insertions : 2340
% 0.25/0.37 % Search garbage collected termcells : 476
% 0.25/0.37
% 0.25/0.37 % -------------------------------------------------
% 0.25/0.37 % User time : 0.006 s
% 0.25/0.37 % System time : 0.003 s
% 0.25/0.37 % Total time : 0.010 s
% 0.25/0.37 % Maximum resident set size: 3632 pages
% 0.25/0.37
% 0.25/0.37 % -------------------------------------------------
% 0.25/0.37 % User time : 0.006 s
% 0.25/0.37 % System time : 0.008 s
% 0.25/0.37 % Total time : 0.015 s
% 0.25/0.37 % Maximum resident set size: 4864 pages
% 0.25/0.37 % E exiting
%------------------------------------------------------------------------------