%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV406^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 : n019.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:29 AM UTC 2026
% Result : Theorem 0.27s 0.32s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEV406^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.22 % Computer : n019.cluster.edu
% 0.11/0.22 % Model : x86_64 x86_64
% 0.11/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.22 % Memory : 8046.5625MB
% 0.11/0.22 % OS : Linux 6.8.0-71-generic
% 0.11/0.22 % CPULimit : 300
% 0.11/0.22 % WCLimit : 300
% 0.11/0.22 % DateTime : Tue Sep 29 15:45:02 UTC 2026
% 0.11/0.22 % CPUTime :
% 0.11/0.22 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.28 Running higher-order theorem proving
% 0.27/0.29 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.7DiHgIxVwJ/E---3.1_946187.p
% 0.27/0.32 % Version: 3.5.1-ho
% 0.27/0.32 % Preprocessing class: HSSSSMSSSSMNSSN.
% 0.27/0.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.32 % Starting sh3 with 1500s (5) cores
% 0.27/0.32 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.27/0.32 % Starting sh2lt with 300s (1) cores
% 0.27/0.32 % Starting ho_unfolding_1 with 300s (1) cores
% 0.27/0.32 % sh3 with pid 946202 completed with status 0
% 0.27/0.32 % Result found by sh3
% 0.27/0.32 % Preprocessing class: HSSSSMSSSSMNSSN.
% 0.27/0.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.32 % Starting sh3 with 1500s (5) cores
% 0.27/0.32 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.32 % No SInE strategy applied
% 0.27/0.32 % Search class: HGUNF-FFSF00-SSSFFFNN
% 0.27/0.32 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.32 % Starting SubtermCWHack with 151s (1) cores
% 0.27/0.32 % Starting sh3 with 901s (1) cores
% 0.27/0.32 % Starting sh5l with 151s (1) cores
% 0.27/0.32 % Starting new_bool_3 with 151s (1) cores
% 0.27/0.32 % Starting new_bool_1 with 146s (1) cores
% 0.27/0.32 % SubtermCWHack with pid 946207 completed with status 10
% 0.27/0.32 % sh3 with pid 946208 completed with status 0
% 0.27/0.32 % Result found by sh3
% 0.27/0.32 % Preprocessing class: HSSSSMSSSSMNSSN.
% 0.27/0.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.32 % Starting sh3 with 1500s (5) cores
% 0.27/0.32 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.32 % No SInE strategy applied
% 0.27/0.32 % Search class: HGUNF-FFSF00-SSSFFFNN
% 0.27/0.32 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.32 % Starting SubtermCWHack with 151s (1) cores
% 0.27/0.32 % Starting sh3 with 901s (1) cores
% 0.27/0.32 % Preprocessing time : 0.001 s
% 0.27/0.32 % Presaturation interreduction done
% 0.27/0.32
% 0.27/0.32 % Proof found!
% 0.27/0.32 % SZS status Theorem
% 0.27/0.32 % SZS output start CNFRefutation
% 0.27/0.32 thf(decl_23, type, cA: $i > $o).
% 0.27/0.32 thf(decl_24, type, cB: $i > $o).
% 0.27/0.32 thf(decl_25, type, cP: ($i > $o) > $o).
% 0.27/0.32 thf(decl_26, type, epred1_0: $i > $o).
% 0.27/0.32 thf(decl_27, type, epred2_0: $i > $o).
% 0.27/0.32 thf(decl_28, type, esk3_0: $i).
% 0.27/0.32 thf(cTRIVEXT2_pme, conjecture, ((cP @ (^[X1:$i]:((((cA @ X1))|((cB @ X1))))))=>(cP @ (^[X1:$i]:((((cB @ X1))|((cA @ X1))))))), file('/export/starexec/sandbox/tmp/tmp.7DiHgIxVwJ/E---3.1_946187.p', cTRIVEXT2_pme)).
% 0.27/0.32 thf(c_0_1, negated_conjecture, ~(((cP @ (^[X1:$i]:((((cA @ X1))|((cB @ X1))))))=>(cP @ (^[X1:$i]:((((cB @ X1))|((cA @ X1)))))))), inference(assume_negation,[status(cth)],[cTRIVEXT2_pme])).
% 0.27/0.32 thf(c_0_2, negated_conjecture, ~(((cP @ (^[Z0:$i]:((((cA @ Z0))|((cB @ Z0))))))=>(cP @ (^[Z0:$i]:((((cB @ Z0))|((cA @ Z0)))))))), inference(fof_simplification,[status(thm)],[c_0_1])).
% 0.27/0.32 thf(c_0_3, negated_conjecture, ((cP @ (^[Z0:$i]:((((cA @ Z0))|((cB @ Z0))))))&~(cP @ (^[Z0:$i]:((((cB @ Z0))|((cA @ Z0))))))), inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])).
% 0.27/0.32 thf(c_0_4, plain, ![X2:$i]:(((epred1_0 @ X2)<=>((cB @ X2)|(cA @ X2)))), introduced(definition)).
% 0.27/0.32 thf(c_0_5, plain, ![X3:$i]:(((epred2_0 @ X3)<=>((cA @ X3)|(cB @ X3)))), introduced(definition)).
% 0.27/0.32 thf(c_0_6, negated_conjecture, ~((((cP @ epred1_0))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4])).
% 0.27/0.32 thf(c_0_7, negated_conjecture, (((cP @ epred2_0))=(($true))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_5])).
% 0.27/0.32 thf(c_0_8, negated_conjecture, ~((cP @ epred1_0)), inference(cn,[status(thm)],[c_0_6])).
% 0.27/0.32 thf(c_0_9, negated_conjecture, (cP @ epred2_0), inference(cn,[status(thm)],[c_0_7])).
% 0.27/0.32 thf(c_0_10, plain, ((epred2_0)!=(epred1_0)), inference(ext_sup,[status(thm)],[c_0_8, c_0_9])).
% 0.27/0.32 thf(c_0_11, plain, ![X5:$i]:(((~(epred2_0 @ X5)|((cA @ X5)|(cB @ X5)))&((~(cA @ X5)|(epred2_0 @ X5))&(~(cB @ X5)|(epred2_0 @ X5))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])).
% 0.27/0.32 thf(c_0_12, plain, ![X4:$i]:(((~(epred1_0 @ X4)|((cB @ X4)|(cA @ X4)))&((~(cB @ X4)|(epred1_0 @ X4))&(~(cA @ X4)|(epred1_0 @ X4))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])).
% 0.27/0.32 thf(c_0_13, plain, ((epred2_0 @ esk3_0)<~>(epred1_0 @ esk3_0)), inference(neg_ext,[status(thm)],[c_0_10])).
% 0.27/0.32 thf(c_0_14, plain, ![X1:$i]:(((epred2_0 @ X1)|~((cB @ X1)))), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.27/0.32 thf(c_0_15, plain, ![X1:$i]:(((cB @ X1)|(cA @ X1)|~((epred1_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_12])).
% 0.27/0.32 thf(c_0_16, plain, ![X1:$i]:(((epred2_0 @ X1)|~((cA @ X1)))), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.27/0.32 thf(c_0_17, plain, (~((epred2_0 @ esk3_0))|~((epred1_0 @ esk3_0))), inference(dynamic_cnf,[status(thm)],[c_0_13])).
% 0.27/0.32 thf(c_0_18, plain, ![X1:$i]:(((epred2_0 @ X1)|~((epred1_0 @ X1)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16])).
% 0.27/0.32 thf(c_0_19, plain, ![X1:$i]:(((epred1_0 @ X1)|~((cB @ X1)))), inference(split_conjunct,[status(thm)],[c_0_12])).
% 0.27/0.32 thf(c_0_20, plain, ![X1:$i]:(((cA @ X1)|(cB @ X1)|~((epred2_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.27/0.32 thf(c_0_21, plain, ![X1:$i]:(((epred1_0 @ X1)|~((cA @ X1)))), inference(split_conjunct,[status(thm)],[c_0_12])).
% 0.27/0.32 thf(c_0_22, plain, ((epred1_0 @ esk3_0)|(epred2_0 @ esk3_0)), inference(dynamic_cnf,[status(thm)],[c_0_13])).
% 0.27/0.32 thf(c_0_23, plain, ~((epred1_0 @ esk3_0)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
% 0.27/0.32 thf(c_0_24, plain, ![X1:$i]:(((epred1_0 @ X1)|~((epred2_0 @ X1)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])).
% 0.27/0.32 thf(c_0_25, plain, (epred2_0 @ esk3_0), inference(sr,[status(thm)],[c_0_22, c_0_23])).
% 0.27/0.32 thf(c_0_26, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_23]), ['proof']).
% 0.27/0.32 % SZS output end CNFRefutation
% 0.27/0.32 % Parsed axioms : 4
% 0.27/0.32 % Removed by relevancy pruning/SinE : 0
% 0.27/0.32 % Initial clauses : 11
% 0.27/0.32 % Removed in clause preprocessing : 3
% 0.27/0.32 % Initial clauses in saturation : 8
% 0.27/0.32 % Processed clauses : 24
% 0.27/0.32 % ...of these trivial : 0
% 0.27/0.32 % ...subsumed : 0
% 0.27/0.32 % ...remaining for further processing : 24
% 0.27/0.32 % Other redundant clauses eliminated : 0
% 0.27/0.32 % Clauses deleted for lack of memory : 0
% 0.27/0.32 % Backward-subsumed : 1
% 0.27/0.32 % Backward-rewritten : 0
% 0.27/0.32 % Generated clauses : 13
% 0.27/0.32 % ...of the previous two non-redundant : 8
% 0.27/0.32 % ...aggressively subsumed : 0
% 0.27/0.32 % Contextual simplify-reflections : 2
% 0.27/0.32 % Paramodulations : 8
% 0.27/0.32 % Factorizations : 0
% 0.27/0.32 % NegExts : 1
% 0.27/0.32 % Equation resolutions : 0
% 0.27/0.32 % Disequality decompositions : 0
% 0.27/0.32 % Total rewrite steps : 0
% 0.27/0.32 % ...of those cached : 0
% 0.27/0.32 % Propositional unsat checks : 0
% 0.27/0.32 % Propositional check models : 0
% 0.27/0.32 % Propositional check unsatisfiable : 0
% 0.27/0.32 % Propositional clauses : 0
% 0.27/0.32 % Propositional clauses after purity: 0
% 0.27/0.32 % Propositional unsat core size : 0
% 0.27/0.32 % Propositional preprocessing time : 0.000
% 0.27/0.32 % Propositional encoding time : 0.000
% 0.27/0.32 % Propositional solver time : 0.000
% 0.27/0.32 % Success case prop preproc time : 0.000
% 0.27/0.32 % Success case prop encoding time : 0.000
% 0.27/0.32 % Success case prop solver time : 0.000
% 0.27/0.32 % Current number of processed clauses : 13
% 0.27/0.32 % Positive orientable unit clauses : 2
% 0.27/0.32 % Positive unorientable unit clauses: 0
% 0.27/0.32 % Negative unit clauses : 3
% 0.27/0.32 % Non-unit-clauses : 8
% 0.27/0.32 % Current number of unprocessed clauses: 0
% 0.27/0.32 % ...number of literals in the above : 0
% 0.27/0.32 % Current number of archived formulas : 0
% 0.27/0.32 % Current number of archived clauses : 11
% 0.27/0.32 % Clause-clause subsumption calls (NU) : 4
% 0.27/0.32 % Rec. Clause-clause subsumption calls : 2
% 0.27/0.32 % Non-unit clause-clause subsumptions : 2
% 0.27/0.32 % Unit Clause-clause subsumption calls : 7
% 0.27/0.32 % Rewrite failures with RHS unbound : 0
% 0.27/0.32 % BW rewrite match attempts : 0
% 0.27/0.32 % BW rewrite match successes : 0
% 0.27/0.32 % Condensation attempts : 0
% 0.27/0.32 % Condensation successes : 0
% 0.27/0.32 % Termbank termtop insertions : 758
% 0.27/0.32 % Search garbage collected termcells : 80
% 0.27/0.32
% 0.27/0.32 % -------------------------------------------------
% 0.27/0.32 % User time : 0.005 s
% 0.27/0.32 % System time : 0.006 s
% 0.27/0.32 % Total time : 0.011 s
% 0.27/0.32 % Maximum resident set size: 3624 pages
% 0.27/0.32
% 0.27/0.32 % -------------------------------------------------
% 0.27/0.32 % User time : 0.013 s
% 0.27/0.32 % System time : 0.014 s
% 0.27/0.32 % Total time : 0.027 s
% 0.27/0.32 % Maximum resident set size: 4864 pages
% 0.27/0.32 % E exiting
%------------------------------------------------------------------------------