%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO024^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:42:09 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 26 ( 3 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 57 ( 29 ~; 8 |; 2 &; 14 @)
% ( 0 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 16 ^; 3 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
leibeq: ( $o > $o > $o ) > ( $o > $o > $o ) > $o ).
thf(decl_24,type,
epred1_0: ( $o > $o > $o ) > $o ).
thf(decl_25,type,
esk2_0: $o ).
thf(decl_26,type,
esk3_0: $o ).
thf(conj,conjecture,
( leibeq @ $and
@ ^ [X4: $o,X5: $o] :
~ ( ~ X4
| ~ X5 ) ),
file('/export/starexec/sandbox2/tmp/tmp.2hudcALojj/E---3.1_290253.p',conj) ).
thf(leibeq,axiom,
( leibeq
= ( ^ [X1: $o > $o > $o,X2: $o > $o > $o] :
! [X3: ( $o > $o > $o ) > $o] :
( ( X3 @ X1 )
=> ( X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2hudcALojj/E---3.1_290253.p',leibeq) ).
thf(c_0_2,negated_conjecture,
~ ( leibeq @ $and
@ ^ [X4: $o,X5: $o] :
~ ( ~ X4
| ~ X5 ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_3,plain,
( leibeq
= ( ^ [Z0: $o > $o > $o,Z1: $o > $o > $o] :
! [X3: ( $o > $o > $o ) > $o] :
( ( X3 @ Z0 )
=> ( X3 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[leibeq]) ).
thf(c_0_4,negated_conjecture,
~ ! [X6: ( $o > $o > $o ) > $o] :
( ( X6 @ $and )
=> ( X6
@ ^ [Z0: $o,Z1: $o] :
~ ( ~ Z0
| ~ Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ( epred1_0 @ $and )
& ~ ( epred1_0
@ ^ [Z0: $o,Z1: $o] :
~ ( ~ Z0
| ~ Z1 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
thf(c_0_6,negated_conjecture,
~ ( epred1_0
@ ^ [Z0: $o,Z1: $o] :
~ ( ~ Z0
| ~ Z1 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
epred1_0 @ $and,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
( ( ^ [Z0: $o,Z1: $o] :
~ ( ~ Z0
| ~ Z1 ) )
!= $and ),
inference(ext_sup,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_9,plain,
( ~ ( ~ esk2_0
| ~ esk3_0 )
<~> ( esk2_0
& esk3_0 ) ),
inference(neg_ext,[status(thm)],[c_0_8]) ).
thf(c_0_10,plain,
( ~ esk2_0
| ~ esk3_0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_9])]) ).
thf(c_0_11,plain,
esk3_0,
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_9])]) ).
thf(c_0_12,plain,
~ esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
thf(c_0_13,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_9])]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO024^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.18 % Computer : n011.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 16:23:24 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running higher-order theorem proving
% 0.10/0.23 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.2hudcALojj/E---3.1_290253.p
% 0.10/0.25 % Version: 3.5.1-ho
% 0.10/0.25 % Preprocessing class: HSSSSMSSSLMNHSN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting ho_unfolding_6 with 1500s (5) cores
% 0.10/0.25 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.10/0.25 % Starting sh2l with 300s (1) cores
% 0.10/0.25 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.10/0.25 % ho_unfolding_6 with pid 290266 completed with status 0
% 0.10/0.25 % Result found by ho_unfolding_6
% 0.10/0.25 % Preprocessing class: HSSSSMSSSLMNHSN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting ho_unfolding_6 with 1500s (5) cores
% 0.10/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.25 % No SInE strategy applied
% 0.10/0.25 % Search class: HUUNF-FFSF00-MHSFMFNN
% 0.10/0.25 % partial match(2): HUUNF-FFSF00-SHSSMFNN
% 0.10/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.25 % Starting ho_unfolding_6 with 151s (1) cores
% 0.10/0.25 % Starting sh5l with 136s (1) cores
% 0.10/0.25 % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.10/0.25 % Starting lpo1_def_fix with 136s (1) cores
% 0.10/0.25 % SubtermCWHack with pid 290271 completed with status 10
% 0.10/0.25 % Starting ehoh_best8_lambda with 136s (1) cores
% 0.10/0.25 % sh5l with pid 290273 completed with status 0
% 0.10/0.25 % Result found by sh5l
% 0.10/0.25 % Preprocessing class: HSSSSMSSSLMNHSN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting ho_unfolding_6 with 1500s (5) cores
% 0.10/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.25 % No SInE strategy applied
% 0.10/0.25 % Search class: HUUNF-FFSF00-MHSFMFNN
% 0.10/0.25 % partial match(2): HUUNF-FFSF00-SHSSMFNN
% 0.10/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.25 % Starting ho_unfolding_6 with 151s (1) cores
% 0.10/0.25 % Starting sh5l with 136s (1) cores
% 0.10/0.25 % Preprocessing time : 0.001 s
% 0.10/0.25 % Presaturation interreduction done
% 0.10/0.25
% 0.10/0.25 % Proof found!
% 0.10/0.25 % SZS status Theorem
% 0.10/0.25 % SZS output start CNFRefutation
% See solution above
% 0.10/0.25 % Parsed axioms : 3
% 0.10/0.25 % Removed by relevancy pruning/SinE : 0
% 0.10/0.25 % Initial clauses : 3
% 0.10/0.25 % Removed in clause preprocessing : 1
% 0.10/0.25 % Initial clauses in saturation : 2
% 0.10/0.25 % Processed clauses : 11
% 0.10/0.25 % ...of these trivial : 0
% 0.10/0.25 % ...subsumed : 0
% 0.10/0.25 % ...remaining for further processing : 10
% 0.10/0.25 % Other redundant clauses eliminated : 0
% 0.10/0.25 % Clauses deleted for lack of memory : 0
% 0.10/0.25 % Backward-subsumed : 0
% 0.10/0.25 % Backward-rewritten : 1
% 0.10/0.25 % Generated clauses : 9
% 0.10/0.25 % ...of the previous two non-redundant : 10
% 0.10/0.25 % ...aggressively subsumed : 0
% 0.10/0.25 % Contextual simplify-reflections : 0
% 0.10/0.25 % Paramodulations : 0
% 0.10/0.25 % Factorizations : 0
% 0.10/0.25 % NegExts : 3
% 0.10/0.25 % Equation resolutions : 0
% 0.10/0.25 % Disequality decompositions : 0
% 0.10/0.25 % Total rewrite steps : 1
% 0.10/0.25 % ...of those cached : 0
% 0.10/0.25 % Propositional unsat checks : 0
% 0.10/0.25 % Propositional check models : 0
% 0.10/0.25 % Propositional check unsatisfiable : 0
% 0.10/0.25 % Propositional clauses : 0
% 0.10/0.25 % Propositional clauses after purity: 0
% 0.10/0.25 % Propositional unsat core size : 0
% 0.10/0.25 % Propositional preprocessing time : 0.000
% 0.10/0.25 % Propositional encoding time : 0.000
% 0.10/0.25 % Propositional solver time : 0.000
% 0.10/0.25 % Success case prop preproc time : 0.000
% 0.10/0.25 % Success case prop encoding time : 0.000
% 0.10/0.25 % Success case prop solver time : 0.000
% 0.10/0.25 % Current number of processed clauses : 6
% 0.10/0.25 % Positive orientable unit clauses : 2
% 0.10/0.25 % Positive unorientable unit clauses: 0
% 0.10/0.25 % Negative unit clauses : 4
% 0.10/0.25 % Non-unit-clauses : 0
% 0.10/0.25 % Current number of unprocessed clauses: 3
% 0.10/0.25 % ...number of literals in the above : 5
% 0.10/0.25 % Current number of archived formulas : 0
% 0.10/0.25 % Current number of archived clauses : 4
% 0.10/0.25 % Clause-clause subsumption calls (NU) : 0
% 0.10/0.25 % Rec. Clause-clause subsumption calls : 0
% 0.10/0.25 % Non-unit clause-clause subsumptions : 0
% 0.10/0.25 % Unit Clause-clause subsumption calls : 4
% 0.10/0.25 % Rewrite failures with RHS unbound : 0
% 0.10/0.25 % BW rewrite match attempts : 1
% 0.10/0.25 % BW rewrite match successes : 1
% 0.10/0.25 % Condensation attempts : 11
% 0.10/0.25 % Condensation successes : 0
% 0.10/0.25 % Termbank termtop insertions : 480
% 0.10/0.25 % Search garbage collected termcells : 53
% 0.10/0.25
% 0.10/0.25 % -------------------------------------------------
% 0.10/0.25 % User time : 0.005 s
% 0.10/0.25 % System time : 0.003 s
% 0.10/0.25 % Total time : 0.007 s
% 0.10/0.25 % Maximum resident set size: 3580 pages
% 0.10/0.25
% 0.10/0.25 % -------------------------------------------------
% 0.10/0.25 % User time : 0.012 s
% 0.10/0.25 % System time : 0.009 s
% 0.10/0.25 % Total time : 0.021 s
% 0.10/0.25 % Maximum resident set size: 4864 pages
% 0.10/0.25 % E exiting
%------------------------------------------------------------------------------