%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN984^1 : TPTP v9.3.1. Released v3.6.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:41:05 AM UTC 2026
% Result : Theorem 0.09s 0.23s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN984^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.16 % Computer : n019.cluster.edu
% 0.09/0.16 % Model : x86_64 x86_64
% 0.09/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16 % Memory : 8046.5625MB
% 0.09/0.16 % OS : Linux 6.8.0-71-generic
% 0.09/0.16 % CPULimit : 300
% 0.09/0.16 % WCLimit : 300
% 0.09/0.16 % DateTime : Tue Sep 29 16:19:47 UTC 2026
% 0.09/0.16 % CPUTime :
% 0.09/0.16 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 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.yafsIY95QR/E---3.1_988894.p
% 0.09/0.23 % Version: 3.5.1-ho
% 0.09/0.23 % partial match(1): HSSSSMSSSSMNSSN
% 0.09/0.23 % Preprocessing class: HSSSSLSSSSMNSSN.
% 0.09/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.23 % Starting sh3 with 1500s (5) cores
% 0.09/0.23 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.09/0.23 % Starting sh2lt with 300s (1) cores
% 0.09/0.23 % Starting ho_unfolding_1 with 300s (1) cores
% 0.09/0.23 % sh3 with pid 988927 completed with status 0
% 0.09/0.23 % Result found by sh3
% 0.09/0.23 % partial match(1): HSSSSMSSSSMNSSN
% 0.09/0.23 % Preprocessing class: HSSSSLSSSSMNSSN.
% 0.09/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.23 % Starting sh3 with 1500s (5) cores
% 0.09/0.23 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.23 % No SInE strategy applied
% 0.09/0.23 % Search class: HHUNF-FFSF00-SSSFFFNN
% 0.09/0.23 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.23 % Starting SubtermCWHack with 151s (1) cores
% 0.09/0.23 % Starting sh3 with 901s (1) cores
% 0.09/0.23 % Starting sh5l with 151s (1) cores
% 0.09/0.23 % Starting new_bool_3 with 151s (1) cores
% 0.09/0.23 % Starting new_bool_1 with 146s (1) cores
% 0.09/0.23 % SubtermCWHack with pid 988931 completed with status 10
% 0.09/0.23 % new_bool_3 with pid 988934 completed with status 0
% 0.09/0.23 % Result found by new_bool_3
% 0.09/0.23 % partial match(1): HSSSSMSSSSMNSSN
% 0.09/0.23 % Preprocessing class: HSSSSLSSSSMNSSN.
% 0.09/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.23 % Starting sh3 with 1500s (5) cores
% 0.09/0.23 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.23 % No SInE strategy applied
% 0.09/0.23 % Search class: HHUNF-FFSF00-SSSFFFNN
% 0.09/0.23 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.23 % Starting SubtermCWHack with 151s (1) cores
% 0.09/0.23 % Starting sh3 with 901s (1) cores
% 0.09/0.23 % Starting sh5l with 151s (1) cores
% 0.09/0.23 % Starting new_bool_3 with 151s (1) cores
% 0.09/0.23 % Preprocessing time : 0.001 s
% 0.09/0.23 % Presaturation interreduction done
% 0.09/0.23
% 0.09/0.23 % Proof found!
% 0.09/0.23 % SZS status Theorem
% 0.09/0.23 % SZS output start CNFRefutation
% 0.09/0.23 thf(decl_23, type, a: $o).
% 0.09/0.23 thf(decl_24, type, b: $o).
% 0.09/0.23 thf(decl_25, type, p: ($i > $o) > $o).
% 0.09/0.23 thf(decl_26, type, epred1_0: $i > $o).
% 0.09/0.23 thf(decl_27, type, epred2_0: $i > $o).
% 0.09/0.23 thf(decl_28, type, epred3_0: $i > $o).
% 0.09/0.23 thf(decl_29, type, esk4_0: $i).
% 0.09/0.23 thf(decl_30, type, esk5_0: $i).
% 0.09/0.23 thf(thm, conjecture, (((p @ (^[X1:$i]:((a))))&(p @ (^[X1:$i]:((b)))))=>(p @ (^[X1:$i]:((((a))&((b))))))), file('/export/starexec/sandbox/tmp/tmp.yafsIY95QR/E---3.1_988894.p', thm)).
% 0.09/0.23 thf(c_0_1, negated_conjecture, ~((((p @ (^[X1:$i]:((a))))&(p @ (^[X1:$i]:((b)))))=>(p @ (^[X1:$i]:((((a))&((b)))))))), inference(assume_negation,[status(cth)],[thm])).
% 0.09/0.23 thf(c_0_2, negated_conjecture, ~((((p @ (^[Z0:$i]:((a))))&(p @ (^[Z0:$i]:((b)))))=>(p @ (^[Z0:$i]:((((a))&((b)))))))), inference(fof_simplification,[status(thm)],[c_0_1])).
% 0.09/0.23 thf(c_0_3, negated_conjecture, (((p @ (^[Z0:$i]:((a))))&(p @ (^[Z0:$i]:((b)))))&~(p @ (^[Z0:$i]:((((a))&((b))))))), inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])).
% 0.09/0.23 thf(c_0_4, plain, ![X2:$i]:(((epred1_0 @ X2)<=>((a)&(b)))), introduced(definition)).
% 0.09/0.23 thf(c_0_5, plain, ![X3:$i]:(((epred2_0 @ X3)<=>(b))), introduced(definition)).
% 0.09/0.23 thf(c_0_6, plain, ![X4:$i]:(((epred3_0 @ X4)<=>(a))), introduced(definition)).
% 0.09/0.23 thf(c_0_7, negated_conjecture, ~((((p @ epred1_0))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4])).
% 0.09/0.23 thf(c_0_8, negated_conjecture, (((p @ epred2_0))=(($true))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_5])).
% 0.09/0.23 thf(c_0_9, negated_conjecture, (((p @ epred3_0))=(($true))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_6])).
% 0.09/0.23 thf(c_0_10, negated_conjecture, ~((p @ epred1_0)), inference(cn,[status(thm)],[c_0_7])).
% 0.09/0.23 thf(c_0_11, negated_conjecture, (p @ epred2_0), inference(cn,[status(thm)],[c_0_8])).
% 0.09/0.23 thf(c_0_12, negated_conjecture, (p @ epred3_0), inference(cn,[status(thm)],[c_0_9])).
% 0.09/0.23 thf(c_0_13, plain, ((epred2_0)!=(epred1_0)), inference(ext_sup,[status(thm)],[c_0_10, c_0_11])).
% 0.09/0.23 thf(c_0_14, plain, ((epred3_0)!=(epred1_0)), inference(ext_sup,[status(thm)],[c_0_10, c_0_12])).
% 0.09/0.23 thf(c_0_15, plain, ((epred2_0 @ esk4_0)<~>(epred1_0 @ esk4_0)), inference(neg_ext,[status(thm)],[c_0_13])).
% 0.09/0.23 thf(c_0_16, plain, ![X6:$i]:(((~(epred2_0 @ X6)|(b))&(~(b)|(epred2_0 @ X6)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])).
% 0.09/0.23 thf(c_0_17, plain, ![X5:$i]:(((((a)|~(epred1_0 @ X5))&((b)|~(epred1_0 @ X5)))&(~(a)|~(b)|(epred1_0 @ X5)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])).
% 0.09/0.23 thf(c_0_18, plain, ((epred3_0 @ esk5_0)<~>(epred1_0 @ esk5_0)), inference(neg_ext,[status(thm)],[c_0_14])).
% 0.09/0.23 thf(c_0_19, plain, ![X7:$i]:(((~(epred3_0 @ X7)|(a))&(~(a)|(epred3_0 @ X7)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])).
% 0.09/0.23 thf(c_0_20, plain, (~((epred2_0 @ esk4_0))|~((epred1_0 @ esk4_0))), inference(dynamic_cnf,[status(thm)],[c_0_15])).
% 0.09/0.23 thf(c_0_21, plain, ![X1:$i]:(((epred2_0 @ X1)|~((b)))), inference(split_conjunct,[status(thm)],[c_0_16])).
% 0.09/0.23 thf(c_0_22, plain, ![X1:$i]:(((b)|~((epred1_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_17])).
% 0.09/0.23 thf(c_0_23, plain, (~((epred3_0 @ esk5_0))|~((epred1_0 @ esk5_0))), inference(dynamic_cnf,[status(thm)],[c_0_18])).
% 0.09/0.23 thf(c_0_24, plain, ![X1:$i]:(((epred3_0 @ X1)|~((a)))), inference(split_conjunct,[status(thm)],[c_0_19])).
% 0.09/0.23 thf(c_0_25, plain, ![X1:$i]:(((a)|~((epred1_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_17])).
% 0.09/0.23 thf(c_0_26, plain, ~((epred1_0 @ esk4_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])).
% 0.09/0.23 thf(c_0_27, plain, ~((epred1_0 @ esk5_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25])).
% 0.09/0.23 thf(c_0_28, plain, ![X1:$i]:(((epred1_0 @ X1)|~((a))|~((b)))), inference(split_conjunct,[status(thm)],[c_0_17])).
% 0.09/0.23 thf(c_0_29, plain, ![X1:$i]:(((b)|~((epred2_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_16])).
% 0.09/0.23 thf(c_0_30, plain, (epred2_0 @ esk4_0), inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_15]), c_0_26])).
% 0.09/0.23 thf(c_0_31, plain, (~((a))|~((b))), inference(spm,[status(thm)],[c_0_27, c_0_28])).
% 0.09/0.24 thf(c_0_32, plain, (b), inference(spm,[status(thm)],[c_0_29, c_0_30])).
% 0.09/0.24 thf(c_0_33, plain, ![X1:$i]:(((a)|~((epred3_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_19])).
% 0.09/0.24 thf(c_0_34, plain, (epred3_0 @ esk5_0), inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_18]), c_0_27])).
% 0.09/0.24 thf(c_0_35, plain, ~((a)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31, c_0_32])])).
% 0.09/0.24 thf(c_0_36, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_35]), ['proof']).
% 0.09/0.24 % SZS output end CNFRefutation
% 0.09/0.24 % Parsed axioms : 4
% 0.09/0.24 % Removed by relevancy pruning/SinE : 0
% 0.09/0.24 % Initial clauses : 13
% 0.09/0.24 % Removed in clause preprocessing : 3
% 0.09/0.24 % Initial clauses in saturation : 10
% 0.09/0.24 % Processed clauses : 34
% 0.09/0.24 % ...of these trivial : 0
% 0.09/0.24 % ...subsumed : 0
% 0.09/0.24 % ...remaining for further processing : 34
% 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 : 4
% 0.09/0.24 % Backward-rewritten : 5
% 0.09/0.24 % Generated clauses : 18
% 0.09/0.24 % ...of the previous two non-redundant : 15
% 0.09/0.24 % ...aggressively subsumed : 0
% 0.09/0.24 % Contextual simplify-reflections : 2
% 0.09/0.24 % Paramodulations : 10
% 0.09/0.24 % Factorizations : 0
% 0.09/0.24 % NegExts : 2
% 0.09/0.24 % Equation resolutions : 0
% 0.09/0.24 % Disequality decompositions : 0
% 0.09/0.24 % Total rewrite steps : 5
% 0.09/0.24 % ...of those cached : 3
% 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 : 13
% 0.09/0.24 % Positive orientable unit clauses : 5
% 0.09/0.24 % Positive unorientable unit clauses: 0
% 0.09/0.24 % Negative unit clauses : 6
% 0.09/0.24 % Non-unit-clauses : 2
% 0.09/0.24 % Current number of unprocessed clauses: 0
% 0.09/0.24 % ...number of literals in the above : 0
% 0.09/0.24 % Current number of archived formulas : 0
% 0.09/0.24 % Current number of archived clauses : 21
% 0.09/0.24 % Clause-clause subsumption calls (NU) : 10
% 0.09/0.24 % Rec. Clause-clause subsumption calls : 8
% 0.09/0.24 % Non-unit clause-clause subsumptions : 3
% 0.09/0.24 % Unit Clause-clause subsumption calls : 13
% 0.09/0.24 % Rewrite failures with RHS unbound : 0
% 0.09/0.24 % BW rewrite match attempts : 3
% 0.09/0.24 % BW rewrite match successes : 2
% 0.09/0.24 % Condensation attempts : 0
% 0.09/0.24 % Condensation successes : 0
% 0.09/0.24 % Termbank termtop insertions : 901
% 0.09/0.24 % Search garbage collected termcells : 83
% 0.09/0.24
% 0.09/0.24 % -------------------------------------------------
% 0.09/0.24 % User time : 0.004 s
% 0.09/0.24 % System time : 0.003 s
% 0.09/0.24 % Total time : 0.007 s
% 0.09/0.24 % Maximum resident set size: 3628 pages
% 0.09/0.24
% 0.09/0.24 % -------------------------------------------------
% 0.09/0.24 % User time : 0.009 s
% 0.09/0.24 % System time : 0.011 s
% 0.09/0.24 % Total time : 0.020 s
% 0.09/0.24 % Maximum resident set size: 4864 pages
% 0.09/0.24 % E exiting
%------------------------------------------------------------------------------