%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO271^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 : n010.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:44:07 AM UTC 2026
% Result : Theorem 0.07s 0.23s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO271^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.16 % Computer : n010.cluster.edu
% 0.07/0.16 % Model : x86_64 x86_64
% 0.07/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.16 % Memory : 8046.5625MB
% 0.07/0.16 % OS : Linux 6.8.0-71-generic
% 0.07/0.16 % CPULimit : 300
% 0.07/0.16 % WCLimit : 300
% 0.07/0.16 % DateTime : Tue Sep 29 16:42:33 UTC 2026
% 0.07/0.16 % CPUTime :
% 0.07/0.16 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.20 Running higher-order theorem proving
% 0.07/0.21 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.uF6rixqfPx/E---3.1_3115751.p
% 0.07/0.23 % Version: 3.5.1-ho
% 0.07/0.23 % Preprocessing class: HSSSSMSSSSMCSSA.
% 0.07/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.23 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.07/0.23 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.07/0.23 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.23 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.23 % ho_unfolding_3 with pid 3115764 completed with status 0
% 0.07/0.23 % Result found by ho_unfolding_3
% 0.07/0.23 % Preprocessing class: HSSSSMSSSSMCSSA.
% 0.07/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.23 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.07/0.23 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.23 % No SInE strategy applied
% 0.07/0.23 % Search class: HGHSF-FFSF11-SSSFFSBC
% 0.07/0.23 % partial match(1): HGHSF-FFSF11-SSSFFSBN
% 0.07/0.23 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.23 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.23 % Starting ho_unfolding_3 with 151s (1) cores
% 0.07/0.23 % Starting ehoh_best2_full with 136s (1) cores
% 0.07/0.23 % Starting sh2lt with 136s (1) cores
% 0.07/0.23 % Starting sh2l with 136s (1) cores
% 0.07/0.23 % SubtermCWHack with pid 3115771 completed with status 10
% 0.07/0.23 % Starting lpo1_def_fix with 136s (1) cores
% 0.07/0.23 % sh2l with pid 3115775 completed with status 0
% 0.07/0.23 % Result found by sh2l
% 0.07/0.23 % Preprocessing class: HSSSSMSSSSMCSSA.
% 0.07/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.23 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.07/0.23 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.23 % No SInE strategy applied
% 0.07/0.23 % Search class: HGHSF-FFSF11-SSSFFSBC
% 0.07/0.23 % partial match(1): HGHSF-FFSF11-SSSFFSBN
% 0.07/0.23 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.23 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.23 % Starting ho_unfolding_3 with 151s (1) cores
% 0.07/0.23 % Starting ehoh_best2_full with 136s (1) cores
% 0.07/0.23 % Starting sh2lt with 136s (1) cores
% 0.07/0.23 % Starting sh2l with 136s (1) cores
% 0.07/0.23 % Preprocessing time : 0.001 s
% 0.07/0.23 % Presaturation interreduction done
% 0.07/0.23
% 0.07/0.23 % Proof found!
% 0.07/0.23 % SZS status Theorem
% 0.07/0.23 % SZS output start CNFRefutation
% 0.07/0.23 thf(decl_sort1, type, b: $tType).
% 0.07/0.23 thf(decl_sort2, type, a: $tType).
% 0.07/0.23 thf(decl_23, type, cJ: (b > $o) > b).
% 0.07/0.23 thf(decl_24, type, esk1_0: b > a).
% 0.07/0.23 thf(decl_25, type, esk2_0: b > a).
% 0.07/0.23 thf(decl_26, type, epred1_0: b > $o).
% 0.07/0.23 thf(decl_27, type, esk3_0: b).
% 0.07/0.23 thf(cX5500, conjecture, (![X1:b > $o]:((?[X2:b]:((X1 @ X2))=>(X1 @ (cJ @ X1))))=>![X3:b > a, X4:b > a]:((((X3 @ (cJ @ (^[X2:b]:(((X3 @ X2)!=(X4 @ X2))))))=(X4 @ (cJ @ (^[X2:b]:(((X3 @ X2)!=(X4 @ X2)))))))=>((X3)=(X4))))), file('/export/starexec/sandbox2/tmp/tmp.uF6rixqfPx/E---3.1_3115751.p', cX5500)).
% 0.07/0.23 thf(c_0_1, negated_conjecture, ~((![X1:b > $o]:((?[X2:b]:((X1 @ X2))=>(X1 @ (cJ @ X1))))=>![X3:b > a, X4:b > a]:((((X3 @ (cJ @ (^[X2:b]:(((X3 @ X2)!=(X4 @ X2))))))=(X4 @ (cJ @ (^[X2:b]:(((X3 @ X2)!=(X4 @ X2)))))))=>((X3)=(X4)))))), inference(assume_negation,[status(cth)],[cX5500])).
% 0.07/0.23 thf(c_0_2, negated_conjecture, ~((![X1:b > $o]:((?[X2:b]:((X1 @ X2))=>(X1 @ (cJ @ X1))))=>![X3:b > a, X4:b > a]:((((X3 @ (cJ @ (^[Z0:b]:(~(((X3 @ Z0)=(X4 @ Z0)))))))=(X4 @ (cJ @ (^[Z0:b]:(~(((X3 @ Z0)=(X4 @ Z0))))))))=>((X3)=(X4)))))), inference(fof_simplification,[status(thm)],[c_0_1])).
% 0.07/0.23 thf(c_0_3, plain, ![X15:b]:(((~(epred1_0 @ X15)|((esk1_0 @ X15)!=(esk2_0 @ X15)))&(((esk1_0 @ X15)=(esk2_0 @ X15))|(epred1_0 @ X15)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[])])])])).
% 0.07/0.23 thf(c_0_4, negated_conjecture, ![X9:b > $o, X10:b]:(((~(X9 @ X10)|(X9 @ (cJ @ X9)))&(((esk1_0 @ (cJ @ (^[Z0:b]:(~(((esk1_0 @ Z0)=(esk2_0 @ Z0)))))))=(esk2_0 @ (cJ @ (^[Z0:b]:(~(((esk1_0 @ Z0)=(esk2_0 @ Z0))))))))&((esk1_0)!=(esk2_0))))), 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.07/0.23 thf(c_0_5, plain, ![X13:b]:(((epred1_0 @ X13)<=>~(((esk1_0 @ X13)=(esk2_0 @ X13))))), introduced(definition)).
% 0.07/0.23 thf(c_0_6, plain, ![X2:b]:((~((epred1_0 @ X2))|((esk1_0 @ X2)!=(esk2_0 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.07/0.23 thf(c_0_7, negated_conjecture, ((esk1_0 @ (cJ @ epred1_0))=(esk2_0 @ (cJ @ epred1_0))), inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4]), c_0_5]), c_0_5])).
% 0.07/0.23 thf(c_0_8, negated_conjecture, ![X1:b > $o, X2:b]:(((X1 @ (cJ @ X1))|~((X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.07/0.23 thf(c_0_9, negated_conjecture, ~((epred1_0 @ (cJ @ epred1_0))), inference(spm,[status(thm)],[c_0_6, c_0_7])).
% 0.07/0.23 thf(c_0_10, negated_conjecture, ((esk1_0)!=(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.07/0.23 thf(c_0_11, plain, ![X2:b]:((((esk1_0 @ X2)=(esk2_0 @ X2))|(epred1_0 @ X2))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.07/0.23 thf(c_0_12, negated_conjecture, ![X2:b]:(~((epred1_0 @ X2))), inference(sr,[status(thm)],[inference(choice_inst,[status(thm)],[c_0_7, c_0_8]), c_0_9])).
% 0.07/0.23 thf(c_0_13, negated_conjecture, ((esk1_0 @ esk3_0)!=(esk2_0 @ esk3_0)), inference(neg_ext,[status(thm)],[c_0_10])).
% 0.07/0.23 thf(c_0_14, plain, ![X2:b]:(((esk1_0 @ X2)=(esk2_0 @ X2))), inference(sr,[status(thm)],[c_0_11, c_0_12])).
% 0.07/0.23 thf(c_0_15, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_14])]), ['proof']).
% 0.07/0.23 % SZS output end CNFRefutation
% 0.07/0.23 % Parsed axioms : 4
% 0.07/0.23 % Removed by relevancy pruning/SinE : 0
% 0.07/0.23 % Initial clauses : 8
% 0.07/0.23 % Removed in clause preprocessing : 3
% 0.07/0.23 % Initial clauses in saturation : 5
% 0.07/0.23 % Processed clauses : 14
% 0.07/0.23 % ...of these trivial : 0
% 0.07/0.23 % ...subsumed : 0
% 0.07/0.23 % ...remaining for further processing : 14
% 0.07/0.23 % Other redundant clauses eliminated : 0
% 0.07/0.23 % Clauses deleted for lack of memory : 0
% 0.07/0.23 % Backward-subsumed : 3
% 0.07/0.23 % Backward-rewritten : 2
% 0.07/0.23 % Generated clauses : 10
% 0.07/0.23 % ...of the previous two non-redundant : 8
% 0.07/0.23 % ...aggressively subsumed : 0
% 0.07/0.23 % Contextual simplify-reflections : 0
% 0.07/0.23 % Paramodulations : 3
% 0.07/0.23 % Factorizations : 0
% 0.07/0.23 % NegExts : 1
% 0.07/0.23 % Equation resolutions : 0
% 0.07/0.23 % Disequality decompositions : 0
% 0.07/0.23 % Total rewrite steps : 2
% 0.07/0.23 % ...of those cached : 0
% 0.07/0.23 % Propositional unsat checks : 0
% 0.07/0.23 % Propositional check models : 0
% 0.07/0.23 % Propositional check unsatisfiable : 0
% 0.07/0.23 % Propositional clauses : 0
% 0.07/0.23 % Propositional clauses after purity: 0
% 0.07/0.23 % Propositional unsat core size : 0
% 0.07/0.23 % Propositional preprocessing time : 0.000
% 0.07/0.23 % Propositional encoding time : 0.000
% 0.07/0.23 % Propositional solver time : 0.000
% 0.07/0.23 % Success case prop preproc time : 0.000
% 0.07/0.23 % Success case prop encoding time : 0.000
% 0.07/0.23 % Success case prop solver time : 0.000
% 0.07/0.23 % Current number of processed clauses : 3
% 0.07/0.23 % Positive orientable unit clauses : 1
% 0.07/0.23 % Positive unorientable unit clauses: 0
% 0.07/0.23 % Negative unit clauses : 2
% 0.07/0.23 % Non-unit-clauses : 0
% 0.07/0.23 % Current number of unprocessed clauses: 3
% 0.07/0.23 % ...number of literals in the above : 6
% 0.07/0.23 % Current number of archived formulas : 0
% 0.07/0.23 % Current number of archived clauses : 11
% 0.07/0.23 % Clause-clause subsumption calls (NU) : 0
% 0.07/0.23 % Rec. Clause-clause subsumption calls : 0
% 0.07/0.23 % Non-unit clause-clause subsumptions : 0
% 0.07/0.23 % Unit Clause-clause subsumption calls : 4
% 0.07/0.23 % Rewrite failures with RHS unbound : 0
% 0.07/0.23 % BW rewrite match attempts : 3
% 0.07/0.23 % BW rewrite match successes : 2
% 0.07/0.23 % Condensation attempts : 0
% 0.07/0.23 % Condensation successes : 0
% 0.07/0.23 % Termbank termtop insertions : 656
% 0.07/0.23 % Search garbage collected termcells : 138
% 0.07/0.23
% 0.07/0.23 % -------------------------------------------------
% 0.07/0.23 % User time : 0.002 s
% 0.07/0.23 % System time : 0.006 s
% 0.07/0.23 % Total time : 0.008 s
% 0.07/0.23 % Maximum resident set size: 3632 pages
% 0.07/0.23
% 0.07/0.23 % -------------------------------------------------
% 0.07/0.23 % User time : 0.009 s
% 0.07/0.23 % System time : 0.013 s
% 0.07/0.23 % Total time : 0.023 s
% 0.07/0.23 % Maximum resident set size: 4864 pages
% 0.07/0.23 % E exiting
%------------------------------------------------------------------------------