%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO011^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:08 AM UTC 2026
% Result : Theorem 0.09s 0.24s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 19 ( 4 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 50 ( 7 ~; 2 |; 5 &; 30 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 21 ( 10 ^; 11 !; 0 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
leibeq: $i > $i > $o ).
thf(decl_24,type,
p: ( $i > $i ) > $o ).
thf(decl_25,type,
f: $i > $i ).
thf(conj,conjecture,
( ( ! [X4: $i] : ( leibeq @ ( f @ X4 ) @ X4 )
& ( p
@ ^ [X4: $i] : X4 ) )
=> ( p @ f ) ),
file('/export/starexec/sandbox/tmp/tmp.ZeiVrQ33nb/E---3.1_1244209.p',conj) ).
thf(leibeq,axiom,
( leibeq
= ( ^ [X1: $i,X2: $i] :
! [X3: $i > $o] :
( ( X3 @ X1 )
=> ( X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZeiVrQ33nb/E---3.1_1244209.p',leibeq) ).
thf(c_0_2,negated_conjecture,
~ ( ( ! [X4: $i] : ( leibeq @ ( f @ X4 ) @ X4 )
& ( p
@ ^ [X4: $i] : X4 ) )
=> ( p @ f ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_3,plain,
( leibeq
= ( ^ [Z0: $i,Z1: $i] :
! [X3: $i > $o] :
( ( X3 @ Z0 )
=> ( X3 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[leibeq]) ).
thf(c_0_4,negated_conjecture,
~ ( ( ! [X4: $i,X6: $i > $o] :
( ( X6 @ ( f @ X4 ) )
=> ( X6 @ X4 ) )
& ( p
@ ^ [Z0: $i] : Z0 ) )
=> ( p @ f ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X7: $i,X8: $i > $o] :
( ( ~ ( X8 @ ( f @ X7 ) )
| ( X8 @ X7 ) )
& ( p
@ ^ [Z0: $i] : Z0 )
& ~ ( p @ f ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
thf(c_0_6,negated_conjecture,
~ ( p @ f ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
( p
@ ^ [Z0: $i] : Z0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X3: $i > $o,X1: $i] :
( ( X3 @ X1 )
| ~ ( X3 @ ( f @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
( ( ^ [Z0: $i] : Z0 )
!= f ),
inference(ext_sup,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i] :
( ( f @ X1 )
= X1 ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_8]) ).
thf(c_0_11,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO011^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.16 % Computer : n020.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:22:04 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.ZeiVrQ33nb/E---3.1_1244209.p
% 0.09/0.24 % Version: 3.5.1-ho
% 0.09/0.24 % Preprocessing class: HSSSSMSSSLSNSSN.
% 0.09/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.24 % Starting ehoh_best3_fo with 1500s (5) cores
% 0.09/0.24 % Starting post_as_ho12 with 300s (1) cores
% 0.09/0.24 % Starting post_as_ho4 with 300s (1) cores
% 0.09/0.24 % Starting ehoh_best6_lambda with 300s (1) cores
% 0.09/0.24 % ehoh_best3_fo with pid 1244222 completed with status 0
% 0.09/0.24 % Result found by ehoh_best3_fo
% 0.09/0.24 % Preprocessing class: HSSSSMSSSLSNSSN.
% 0.09/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.24 % Starting ehoh_best3_fo with 1500s (5) cores
% 0.09/0.24 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.24 % No SInE strategy applied
% 0.09/0.24 % Search class: HHUNF-FFSF11-SSSFMSBN
% 0.09/0.24 % partial match(1): HHUSF-FFSF11-SSSFMSBN
% 0.09/0.24 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.24 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.24 % Starting ehoh_best3_fo with 151s (1) cores
% 0.09/0.24 % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.09/0.24 % Starting sh5l with 136s (1) cores
% 0.09/0.24 % Starting new_bool_3 with 136s (1) cores
% 0.09/0.24 % ehoh_best3_fo with pid 1244229 completed with status 0
% 0.09/0.24 % Result found by ehoh_best3_fo
% 0.09/0.24 % Preprocessing class: HSSSSMSSSLSNSSN.
% 0.09/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.24 % Starting ehoh_best3_fo with 1500s (5) cores
% 0.09/0.24 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.24 % No SInE strategy applied
% 0.09/0.24 % Search class: HHUNF-FFSF11-SSSFMSBN
% 0.09/0.24 % partial match(1): HHUSF-FFSF11-SSSFMSBN
% 0.09/0.24 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.24 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.24 % Starting ehoh_best3_fo with 151s (1) cores
% 0.09/0.24 % Preprocessing time : 0.001 s
% 0.09/0.24 % Presaturation interreduction done
% 0.09/0.24
% 0.09/0.24 % Proof found!
% 0.09/0.24 % SZS status Theorem
% 0.09/0.24 % SZS output start CNFRefutation
% See solution above
% 0.09/0.24 % Parsed axioms : 5
% 0.09/0.24 % Removed by relevancy pruning/SinE : 0
% 0.09/0.24 % Initial clauses : 6
% 0.09/0.24 % Removed in clause preprocessing : 3
% 0.09/0.24 % Initial clauses in saturation : 3
% 0.09/0.24 % Processed clauses : 9
% 0.09/0.24 % ...of these trivial : 1
% 0.09/0.24 % ...subsumed : 0
% 0.09/0.24 % ...remaining for further processing : 8
% 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 : 0
% 0.09/0.24 % Backward-rewritten : 1
% 0.09/0.24 % Generated clauses : 6
% 0.09/0.24 % ...of the previous two non-redundant : 3
% 0.09/0.24 % ...aggressively subsumed : 0
% 0.09/0.24 % Contextual simplify-reflections : 0
% 0.09/0.24 % Paramodulations : 0
% 0.09/0.24 % Factorizations : 0
% 0.09/0.24 % NegExts : 1
% 0.09/0.24 % Equation resolutions : 0
% 0.09/0.24 % Disequality decompositions : 0
% 0.09/0.24 % Total rewrite steps : 3
% 0.09/0.24 % ...of those cached : 1
% 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 : 4
% 0.09/0.24 % Positive orientable unit clauses : 2
% 0.09/0.24 % Positive unorientable unit clauses: 0
% 0.09/0.24 % Negative unit clauses : 2
% 0.09/0.24 % Non-unit-clauses : 0
% 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 : 4
% 0.09/0.24 % Clause-clause subsumption calls (NU) : 0
% 0.09/0.24 % Rec. Clause-clause subsumption calls : 0
% 0.09/0.24 % Non-unit clause-clause subsumptions : 0
% 0.09/0.24 % Unit Clause-clause subsumption calls : 1
% 0.09/0.24 % Rewrite failures with RHS unbound : 0
% 0.09/0.24 % BW rewrite match attempts : 2
% 0.09/0.24 % BW rewrite match successes : 1
% 0.09/0.24 % Condensation attempts : 0
% 0.09/0.24 % Condensation successes : 0
% 0.09/0.24 % Termbank termtop insertions : 363
% 0.09/0.24 % Search garbage collected termcells : 89
% 0.09/0.24
% 0.09/0.24 % -------------------------------------------------
% 0.09/0.24 % User time : 0.003 s
% 0.09/0.24 % System time : 0.002 s
% 0.09/0.24 % Total time : 0.005 s
% 0.09/0.24 % Maximum resident set size: 3632 pages
% 0.09/0.24
% 0.09/0.24 % -------------------------------------------------
% 0.09/0.24 % User time : 0.012 s
% 0.09/0.24 % System time : 0.007 s
% 0.09/0.24 % Total time : 0.019 s
% 0.09/0.24 % Maximum resident set size: 4864 pages
% 0.09/0.24 % E exiting
%------------------------------------------------------------------------------