%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO043^1 : 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 : 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:43:40 AM UTC 2026
% Result : Unsatisfiable 0.24s 0.31s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO043^1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 % Computer : n010.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 16:24:27 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.27 Running higher-order theorem proving
% 0.24/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.oTPQnr4a4L/E---3.1_3077994.p
% 0.24/0.31 % Version: 3.5.1-ho
% 0.24/0.31 % Preprocessing class: HSSSSMSSSSSNSFN.
% 0.24/0.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.31 % Starting new_ho_10 with 1200s (4) cores
% 0.24/0.31 % Starting ehoh_best8_lambda with 600s (2) cores
% 0.24/0.31 % Starting ho_unfolding_6 with 300s (1) cores
% 0.24/0.31 % Starting sh4l with 300s (1) cores
% 0.24/0.31 % sh4l with pid 3078010 completed with status 0
% 0.24/0.31 % Result found by sh4l
% 0.24/0.31 % Preprocessing class: HSSSSMSSSSSNSFN.
% 0.24/0.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.31 % Starting new_ho_10 with 1200s (4) cores
% 0.24/0.31 % Starting ehoh_best8_lambda with 600s (2) cores
% 0.24/0.31 % Starting ho_unfolding_6 with 300s (1) cores
% 0.24/0.31 % Starting sh4l with 300s (1) cores
% 0.24/0.31 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.31 % No SInE strategy applied
% 0.24/0.31 % Search class: HGHNF-FFSS00-SSFFFFNN
% 0.24/0.31 % partial match(1): HGHNF-FFSS00-SFFFFFNN
% 0.24/0.31 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.31 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.31 % SubtermCWHack with pid 3078011 completed with status 0
% 0.24/0.31 % Result found by SubtermCWHack
% 0.24/0.31 % Preprocessing class: HSSSSMSSSSSNSFN.
% 0.24/0.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.31 % Starting new_ho_10 with 1200s (4) cores
% 0.24/0.31 % Starting ehoh_best8_lambda with 600s (2) cores
% 0.24/0.31 % Starting ho_unfolding_6 with 300s (1) cores
% 0.24/0.31 % Starting sh4l with 300s (1) cores
% 0.24/0.31 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.31 % No SInE strategy applied
% 0.24/0.31 % Search class: HGHNF-FFSS00-SSFFFFNN
% 0.24/0.31 % partial match(1): HGHNF-FFSS00-SFFFFFNN
% 0.24/0.31 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.31 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.31 % Preprocessing time : 0.002 s
% 0.24/0.31
% 0.24/0.31 % Proof found!
% 0.24/0.31 % SZS status Unsatisfiable
% 0.24/0.31 % SZS output start CNFRefutation
% 0.24/0.31 thf(decl_23, type, f: $o > $o).
% 0.24/0.31 thf(decl_24, type, q: ($o > $o) > $o > $o).
% 0.24/0.31 thf(decl_25, type, x: $o).
% 0.24/0.31 thf(decl_26, type, epred1_0: $o).
% 0.24/0.31 thf(5, axiom, (((q @ f @ ((x)))&(f @ ((f @ ((x))))))&((f @ ((q @ f @ ((x)))))<~>(f @ ((x))))), file('/export/starexec/sandbox/tmp/tmp.oTPQnr4a4L/E---3.1_3077994.p', 5)).
% 0.24/0.31 thf(c_0_1, plain, ((epred1_0)<=>((((~(x)|~(q @ f @ $true))&((x)|~(q @ f @ $false)))|(f @ $true))&(((~(x)|(q @ f @ $true))&((x)|(q @ f @ $false)))|(f @ $false)))), introduced(definition)).
% 0.24/0.31 thf(c_0_2, plain, ((((~(x)|(q @ f @ $true))&((x)|(q @ f @ $false)))&((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|(f @ $false))))&~(((epred1_0)<=>((~(x)|(f @ $true))&((x)|(f @ $false)))))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[5])]), c_0_1])).
% 0.24/0.31 thf(c_0_3, plain, ((((~(x)|(q @ f @ $true))&((x)|(q @ f @ $false)))&(((~(x)|~(f @ $true)|(f @ $true))&((x)|~(f @ $false)|(f @ $true)))&((~(x)|(f @ $true)|(f @ $false))&((x)|(f @ $false)|(f @ $false)))))&((((~(x)|(x)|~(epred1_0))&(~(f @ $false)|(x)|~(epred1_0)))&((~(x)|~(f @ $true)|~(epred1_0))&(~(f @ $false)|~(f @ $true)|~(epred1_0))))&((~(x)|(f @ $true)|(epred1_0))&((x)|(f @ $false)|(epred1_0))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])).
% 0.24/0.31 thf(c_0_4, plain, ((x)|(f @ (~($true)))|(f @ (~($true)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.24/0.31 thf(c_0_5, plain, ((x)|~((f @ (~($true))))|~((epred1_0))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.24/0.31 thf(c_0_6, plain, ((x)|(f @ (~($true)))), inference(cn,[status(thm)],[c_0_4])).
% 0.24/0.31 thf(c_0_7, plain, ((((~(x)|~(q @ f @ $true)|(f @ $true)|~(epred1_0))&((x)|~(q @ f @ $false)|(f @ $true)|~(epred1_0)))&((~(x)|(q @ f @ $true)|(f @ $false)|~(epred1_0))&((x)|(q @ f @ $false)|(f @ $false)|~(epred1_0))))&(((((((~(x)|(x)|(~(x)|(x))|(epred1_0))&(~(q @ f @ $false)|(x)|(~(x)|(x))|(epred1_0)))&((~(x)|~(q @ f @ $true)|(~(x)|(x))|(epred1_0))&(~(q @ f @ $false)|~(q @ f @ $true)|(~(x)|(x))|(epred1_0))))&(~(f @ $false)|(~(x)|(x))|(epred1_0)))&((((~(x)|(x)|((q @ f @ $false)|(x))|(epred1_0))&(~(q @ f @ $false)|(x)|((q @ f @ $false)|(x))|(epred1_0)))&((~(x)|~(q @ f @ $true)|((q @ f @ $false)|(x))|(epred1_0))&(~(q @ f @ $false)|~(q @ f @ $true)|((q @ f @ $false)|(x))|(epred1_0))))&(~(f @ $false)|((q @ f @ $false)|(x))|(epred1_0))))&(((((~(x)|(x)|(~(x)|(q @ f @ $true))|(epred1_0))&(~(q @ f @ $false)|(x)|(~(x)|(q @ f @ $true))|(epred1_0)))&((~(x)|~(q @ f @ $true)|(~(x)|(q @ f @ $true))|(epred1_0))&(~(q @ f @ $false)|~(q @ f @ $true)|(~(x)|(q @ f @ $true))|(epred1_0))))&(~(f @ $false)|(~(x)|(q @ f @ $true))|(epred1_0)))&((((~(x)|(x)|((q @ f @ $false)|(q @ f @ $true))|(epred1_0))&(~(q @ f @ $false)|(x)|((q @ f @ $false)|(q @ f @ $true))|(epred1_0)))&((~(x)|~(q @ f @ $true)|((q @ f @ $false)|(q @ f @ $true))|(epred1_0))&(~(q @ f @ $false)|~(q @ f @ $true)|((q @ f @ $false)|(q @ f @ $true))|(epred1_0))))&(~(f @ $false)|((q @ f @ $false)|(q @ f @ $true))|(epred1_0)))))&((((~(x)|(x)|~(f @ $true)|(epred1_0))&(~(q @ f @ $false)|(x)|~(f @ $true)|(epred1_0)))&((~(x)|~(q @ f @ $true)|~(f @ $true)|(epred1_0))&(~(q @ f @ $false)|~(q @ f @ $true)|~(f @ $true)|(epred1_0))))&(~(f @ $false)|~(f @ $true)|(epred1_0))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])).
% 0.24/0.31 thf(c_0_8, plain, (~((x))|~((f @ (($true))))|~((epred1_0))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.24/0.31 thf(c_0_9, plain, ((x)|~((epred1_0))), inference(csr,[status(thm)],[c_0_5, c_0_6])).
% 0.24/0.31 thf(c_0_10, plain, ((f @ (($true)))|(f @ (~($true)))|~((x))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.24/0.31 thf(c_0_11, plain, ((epred1_0)|~((f @ (~($true))))|~((f @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.24/0.31 thf(c_0_12, plain, (~((f @ (($true))))|~((epred1_0))), inference(csr,[status(thm)],[c_0_8, c_0_9])).
% 0.24/0.31 thf(c_0_13, plain, ((x)|(f @ (($true)))|~((f @ (~($true))))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.24/0.31 thf(c_0_14, plain, ((f @ (~($true)))|(f @ (($true)))), inference(csr,[status(thm)],[c_0_10, c_0_6])).
% 0.24/0.31 thf(c_0_15, plain, (~((f @ (($true))))|~((f @ (~($true))))), inference(csr,[status(thm)],[c_0_11, c_0_12])).
% 0.24/0.31 thf(c_0_16, plain, ((f @ (($true)))|(x)), inference(csr,[status(thm)],[c_0_13, c_0_14])).
% 0.24/0.31 thf(c_0_17, plain, ((q @ f @ (($true)))|~((x))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.24/0.31 thf(c_0_18, plain, (x), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_6]), c_0_16])).
% 0.24/0.31 thf(c_0_19, plain, ((f @ (($true)))|(epred1_0)|~((x))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.24/0.31 thf(c_0_20, plain, ((f @ (($true)))|~((x))|~((q @ f @ (($true))))|~((epred1_0))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.24/0.31 thf(c_0_21, plain, (q @ f @ (($true))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_18])])).
% 0.24/0.31 thf(c_0_22, plain, ((f @ (($true)))|(epred1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_18])])).
% 0.24/0.31 thf(c_0_23, plain, (f @ (($true))), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20, c_0_18]), c_0_21])]), c_0_22])).
% 0.24/0.31 thf(c_0_24, plain, ((epred1_0)|~((x))|~((q @ f @ (($true))))|~((f @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.24/0.31 thf(c_0_25, plain, ~((epred1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_23])])).
% 0.24/0.31 thf(c_0_26, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24, c_0_18]), c_0_23]), c_0_21])]), c_0_25]), ['proof']).
% 0.24/0.31 % SZS output end CNFRefutation
% 0.24/0.31 % Parsed axioms : 4
% 0.24/0.31 % Removed by relevancy pruning/SinE : 0
% 0.24/0.31 % Initial clauses : 44
% 0.24/0.31 % Removed in clause preprocessing : 23
% 0.24/0.31 % Initial clauses in saturation : 21
% 0.24/0.31 % Processed clauses : 25
% 0.24/0.31 % ...of these trivial : 6
% 0.24/0.31 % ...subsumed : 3
% 0.24/0.31 % ...remaining for further processing : 15
% 0.24/0.31 % Other redundant clauses eliminated : 0
% 0.24/0.31 % Clauses deleted for lack of memory : 0
% 0.24/0.31 % Backward-subsumed : 1
% 0.24/0.31 % Backward-rewritten : 9
% 0.24/0.31 % Generated clauses : 5
% 0.24/0.31 % ...of the previous two non-redundant : 6
% 0.24/0.31 % ...aggressively subsumed : 0
% 0.24/0.31 % Contextual simplify-reflections : 7
% 0.24/0.31 % Paramodulations : 5
% 0.24/0.31 % Factorizations : 0
% 0.24/0.31 % NegExts : 0
% 0.24/0.31 % Equation resolutions : 0
% 0.24/0.31 % Disequality decompositions : 0
% 0.24/0.31 % Total rewrite steps : 23
% 0.24/0.31 % ...of those cached : 20
% 0.24/0.31 % Propositional unsat checks : 0
% 0.24/0.31 % Propositional check models : 0
% 0.24/0.31 % Propositional check unsatisfiable : 0
% 0.24/0.31 % Propositional clauses : 0
% 0.24/0.31 % Propositional clauses after purity: 0
% 0.24/0.31 % Propositional unsat core size : 0
% 0.24/0.31 % Propositional preprocessing time : 0.000
% 0.24/0.31 % Propositional encoding time : 0.000
% 0.24/0.31 % Propositional solver time : 0.000
% 0.24/0.31 % Success case prop preproc time : 0.000
% 0.24/0.31 % Success case prop encoding time : 0.000
% 0.24/0.31 % Success case prop solver time : 0.000
% 0.24/0.31 % Current number of processed clauses : 5
% 0.24/0.31 % Positive orientable unit clauses : 3
% 0.24/0.31 % Positive unorientable unit clauses: 0
% 0.24/0.31 % Negative unit clauses : 2
% 0.24/0.31 % Non-unit-clauses : 0
% 0.24/0.31 % Current number of unprocessed clauses: 2
% 0.24/0.31 % ...number of literals in the above : 8
% 0.24/0.31 % Current number of archived formulas : 0
% 0.24/0.31 % Current number of archived clauses : 10
% 0.24/0.31 % Clause-clause subsumption calls (NU) : 11
% 0.24/0.31 % Rec. Clause-clause subsumption calls : 11
% 0.24/0.31 % Non-unit clause-clause subsumptions : 10
% 0.24/0.31 % Unit Clause-clause subsumption calls : 1
% 0.24/0.31 % Rewrite failures with RHS unbound : 0
% 0.24/0.31 % BW rewrite match attempts : 2
% 0.24/0.31 % BW rewrite match successes : 2
% 0.24/0.31 % Condensation attempts : 0
% 0.24/0.31 % Condensation successes : 0
% 0.24/0.31 % Termbank termtop insertions : 1817
% 0.24/0.31 % Search garbage collected termcells : 260
% 0.24/0.31
% 0.24/0.31 % -------------------------------------------------
% 0.24/0.31 % User time : 0.004 s
% 0.24/0.31 % System time : 0.004 s
% 0.24/0.31 % Total time : 0.008 s
% 0.24/0.31 % Maximum resident set size: 3624 pages
% 0.24/0.31
% 0.24/0.31 % -------------------------------------------------
% 0.24/0.31 % User time : 0.006 s
% 0.24/0.31 % System time : 0.008 s
% 0.24/0.31 % Total time : 0.014 s
% 0.24/0.31 % Maximum resident set size: 4864 pages
% 0.24/0.31 % E exiting
%------------------------------------------------------------------------------