%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV259^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:35:18 AM UTC 2026
% Result : Theorem 0.09s 0.24s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV259^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n012.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 15:28:03 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running higher-order theorem proving
% 0.09/0.22 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.j3baiNwDS1/E---3.1_246037.p
% 0.09/0.24 % Version: 3.5.1-ho
% 0.09/0.24 % Preprocessing class: HSMSSMSSSSSNHHA.
% 0.09/0.24 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.24 % Starting full_lambda_6 with 900s (3) cores
% 0.09/0.24 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.24 % Starting lpo6_lambda_fix with 300s (1) cores
% 0.09/0.24 % Starting ho_unfolding_1 with 300s (1) cores
% 0.09/0.24 % Starting new_ho_10_unif with 300s (1) cores
% 0.09/0.24 % Starting ho_unfolding_2 with 300s (1) cores
% 0.09/0.24 % post_as_ho1 with pid 246051 completed with status 0
% 0.09/0.24 % Result found by post_as_ho1
% 0.09/0.24 % Preprocessing class: HSMSSMSSSSSNHHA.
% 0.09/0.24 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.24 % Starting full_lambda_6 with 900s (3) cores
% 0.09/0.24 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.24 % No SInE strategy applied
% 0.09/0.24 % Search class: HGUNF-FFMF32-SHHFFMBN
% 0.09/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.24 % SubtermCWHack with pid 246060 completed with status 0
% 0.09/0.24 % Result found by SubtermCWHack
% 0.09/0.24 % Preprocessing class: HSMSSMSSSSSNHHA.
% 0.09/0.24 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.24 % Starting full_lambda_6 with 900s (3) cores
% 0.09/0.24 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.24 % No SInE strategy applied
% 0.09/0.24 % Search class: HGUNF-FFMF32-SHHFFMBN
% 0.09/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.24 % Preprocessing time : 0.001 s
% 0.09/0.24
% 0.09/0.24 % Proof found!
% 0.09/0.24 % SZS status Theorem
% 0.09/0.24 % SZS output start CNFRefutation
% 0.09/0.24 thf(decl_sort1, type, b: $tType).
% 0.09/0.24 thf(decl_23, type, epred1_1: ((b > $o) > $o) > $o).
% 0.09/0.24 thf(decl_24, type, epred2_0: (b > $o) > $o).
% 0.09/0.24 thf(decl_25, type, epred3_0: b > $o).
% 0.09/0.24 thf(decl_26, type, esk1_0: b).
% 0.09/0.24 thf(decl_27, type, epred4_0: b > $o).
% 0.09/0.24 thf(decl_28, type, esk2_1: (b > $o) > b).
% 0.09/0.24 thf(cCLOSURE_THM0_pme, conjecture, ![X1:(b > $o) > $o]:(((((![X2:b > $o]:((((X2)=(^[X3:b]:(~($true))))=>(X1 @ X2)))&![X2:b > $o]:((((X2)=(^[X3:b]:(~(~($true)))))=>(X1 @ X2))))&![X4:(b > $o) > $o, X2:b > $o]:(((![X5:b > $o]:(((X4 @ X5)=>(X1 @ X5)))&((X2)=(^[X3:b]:(?[X6:b > $o]:((((X4 @ X6))&((X6 @ X3))))))))=>(X1 @ X2))))&![X7:b > $o, X8:b > $o, X6:b > $o]:(((((X1 @ X7)&(X1 @ X8))&((X6)=(^[X3:b]:((((X7 @ X3))&((X8 @ X3)))))))=>(X1 @ X6))))=>![X9:b > $o, X3:b]:(((X9 @ X3)=>![X6:b > $o]:(((![X10:b]:(((X9 @ X10)=>(X6 @ X10)))&![X2:b > $o]:((((X2)=(^[X10:b]:(~((X6 @ X10)))))=>(X1 @ X2))))=>(X6 @ X3))))))), file('/export/starexec/sandbox/tmp/tmp.j3baiNwDS1/E---3.1_246037.p', cCLOSURE_THM0_pme)).
% 0.09/0.24 thf(c_0_1, negated_conjecture, ~(![X1:(b > $o) > $o]:(((((![X2:b > $o]:((((X2)=(^[X3:b]:(~($true))))=>(X1 @ X2)))&![X2:b > $o]:((((X2)=(^[X3:b]:(~(~($true)))))=>(X1 @ X2))))&![X4:(b > $o) > $o, X2:b > $o]:(((![X5:b > $o]:(((X4 @ X5)=>(X1 @ X5)))&((X2)=(^[X3:b]:(?[X6:b > $o]:((((X4 @ X6))&((X6 @ X3))))))))=>(X1 @ X2))))&![X7:b > $o, X8:b > $o, X6:b > $o]:(((((X1 @ X7)&(X1 @ X8))&((X6)=(^[X3:b]:((((X7 @ X3))&((X8 @ X3)))))))=>(X1 @ X6))))=>![X9:b > $o, X3:b]:(((X9 @ X3)=>![X6:b > $o]:(((![X10:b]:(((X9 @ X10)=>(X6 @ X10)))&![X2:b > $o]:((((X2)=(^[X10:b]:(~((X6 @ X10)))))=>(X1 @ X2))))=>(X6 @ X3)))))))), inference(assume_negation,[status(cth)],[cCLOSURE_THM0_pme])).
% 0.09/0.24 thf(c_0_2, plain, ![X1:(b > $o) > $o]:(((epred1_1 @ X1)<=>(((![X2:b > $o]:((![X25:b]:(((X2 @ X25)<=>~($true)))=>(X1 @ X2)))&![X2:b > $o]:((![X26:b]:(((X2 @ X26)<=>~(~($true))))=>(X1 @ X2))))&![X4:(b > $o) > $o, X2:b > $o]:(((![X5:b > $o]:(((X4 @ X5)=>(X1 @ X5)))&![X27:b]:(((X2 @ X27)<=>?[X6:b > $o]:(((X4 @ X6)&(X6 @ X27))))))=>(X1 @ X2))))&![X7:b > $o, X8:b > $o, X6:b > $o]:(((((X1 @ X7)&(X1 @ X8))&![X28:b]:(((X6 @ X28)<=>((X7 @ X28)&(X8 @ X28)))))=>(X1 @ X6)))))), introduced(definition)).
% 0.09/0.24 thf(c_0_3, negated_conjecture, ~(![X1:(b > $o) > $o]:(((epred1_1 @ X1)=>![X9:b > $o, X3:b]:(((X9 @ X3)=>![X6:b > $o]:(((![X10:b]:(((X9 @ X10)=>(X6 @ X10)))&![X2:b > $o]:((![X29:b]:(((X2 @ X29)<=>~((X6 @ X29))))=>(X1 @ X2))))=>(X6 @ X3)))))))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]), c_0_2])).
% 0.09/0.24 thf(c_0_4, negated_conjecture, ![X34:b, X35:b > $o]:(((epred1_1 @ epred2_0)&((epred3_0 @ esk1_0)&(((~(epred3_0 @ X34)|(epred4_0 @ X34))&((~(X35 @ (esk2_1 @ X35))|(epred4_0 @ (esk2_1 @ X35))|(epred2_0 @ X35))&((X35 @ (esk2_1 @ X35))|~(epred4_0 @ (esk2_1 @ X35))|(epred2_0 @ X35))))&~(epred4_0 @ esk1_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_3])])])])])])).
% 0.09/0.24 thf(c_0_5, negated_conjecture, ![X3:b]:(((epred4_0 @ X3)|~((epred3_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.09/0.24 thf(c_0_6, negated_conjecture, (epred3_0 @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.09/0.24 thf(c_0_7, negated_conjecture, ~((epred4_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.09/0.24 thf(c_0_8, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_7]), ['proof']).
% 0.09/0.24 % SZS output end CNFRefutation
% 0.09/0.24 % Parsed axioms : 2
% 0.09/0.24 % Removed by relevancy pruning/SinE : 0
% 0.09/0.24 % Initial clauses : 20
% 0.09/0.24 % Removed in clause preprocessing : 3
% 0.09/0.24 % Initial clauses in saturation : 17
% 0.09/0.24 % Processed clauses : 4
% 0.09/0.24 % ...of these trivial : 0
% 0.09/0.24 % ...subsumed : 0
% 0.09/0.24 % ...remaining for further processing : 4
% 0.09/0.24 % Other redundant clauses eliminated : 0
% 0.09/0.24 % Clauses deleted for lack of memory : 0
% 0.09/0.24 % Backward-subsumed : 0
% 0.09/0.24 % Backward-rewritten : 0
% 0.09/0.24 % Generated clauses : 1
% 0.09/0.24 % ...of the previous two non-redundant : 0
% 0.09/0.24 % ...aggressively subsumed : 0
% 0.09/0.24 % Contextual simplify-reflections : 0
% 0.09/0.24 % Paramodulations : 1
% 0.09/0.24 % Factorizations : 0
% 0.09/0.24 % NegExts : 0
% 0.09/0.24 % Equation resolutions : 0
% 0.09/0.24 % Disequality decompositions : 0
% 0.09/0.24 % Total rewrite steps : 0
% 0.09/0.24 % ...of those cached : 0
% 0.09/0.24 % Propositional unsat checks : 0
% 0.09/0.24 % Propositional check models : 0
% 0.09/0.24 % Propositional check unsatisfiable : 0
% 0.09/0.24 % Propositional clauses : 0
% 0.09/0.24 % Propositional clauses after purity: 0
% 0.09/0.24 % Propositional unsat core size : 0
% 0.09/0.24 % Propositional preprocessing time : 0.000
% 0.09/0.24 % Propositional encoding time : 0.000
% 0.09/0.24 % Propositional solver time : 0.000
% 0.09/0.24 % Success case prop preproc time : 0.000
% 0.09/0.24 % Success case prop encoding time : 0.000
% 0.09/0.24 % Success case prop solver time : 0.000
% 0.09/0.24 % Current number of processed clauses : 4
% 0.09/0.24 % Positive orientable unit clauses : 2
% 0.09/0.24 % Positive unorientable unit clauses: 0
% 0.09/0.24 % Negative unit clauses : 1
% 0.09/0.24 % Non-unit-clauses : 1
% 0.09/0.24 % Current number of unprocessed clauses: 13
% 0.09/0.24 % ...number of literals in the above : 63
% 0.09/0.24 % Current number of archived formulas : 0
% 0.09/0.24 % Current number of archived clauses : 0
% 0.09/0.24 % Clause-clause subsumption calls (NU) : 0
% 0.09/0.24 % Rec. Clause-clause subsumption calls : 0
% 0.09/0.24 % Non-unit clause-clause subsumptions : 0
% 0.09/0.24 % Unit Clause-clause subsumption calls : 0
% 0.09/0.24 % Rewrite failures with RHS unbound : 0
% 0.09/0.24 % BW rewrite match attempts : 0
% 0.09/0.24 % BW rewrite match successes : 0
% 0.09/0.24 % Condensation attempts : 0
% 0.09/0.24 % Condensation successes : 0
% 0.09/0.24 % Termbank termtop insertions : 2106
% 0.09/0.24 % Search garbage collected termcells : 830
% 0.09/0.24
% 0.09/0.24 % -------------------------------------------------
% 0.09/0.24 % User time : 0.003 s
% 0.09/0.24 % System time : 0.002 s
% 0.09/0.24 % Total time : 0.005 s
% 0.09/0.24 % Maximum resident set size: 3640 pages
% 0.09/0.24
% 0.09/0.24 % -------------------------------------------------
% 0.09/0.24 % User time : 0.004 s
% 0.09/0.24 % System time : 0.005 s
% 0.09/0.24 % Total time : 0.009 s
% 0.09/0.24 % Maximum resident set size: 4608 pages
% 0.09/0.24 % E exiting
%------------------------------------------------------------------------------