%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO030^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 : 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:42:10 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 19 ( 2 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 51 ( 10 ~; 4 |; 0 &; 33 @)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 4 ^; 13 !; 3 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
leibeq: $o > $o > $o ).
thf(decl_24,type,
epred1_1: ( $o > $o ) > $o ).
thf(conj,conjecture,
~ ! [X4: $o > $o] :
? [X1: $o] : ( leibeq @ ( X4 @ X1 ) @ X1 ),
file('/export/starexec/sandbox/tmp/tmp.qIiceViAL5/E---3.1_997462.p',conj) ).
thf(leibeq,axiom,
( leibeq
= ( ^ [X1: $o,X2: $o] :
! [X3: $o > $o] :
( ( X3 @ X1 )
=> ( X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.qIiceViAL5/E---3.1_997462.p',leibeq) ).
thf(c_0_2,negated_conjecture,
~ ~ ! [X4: $o > $o] :
? [X1: $o] : ( leibeq @ ( X4 @ X1 ) @ X1 ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_3,plain,
( leibeq
= ( ^ [Z0: $o,Z1: $o] :
! [X3: $o > $o] :
( ( X3 @ Z0 )
=> ( X3 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[leibeq]) ).
thf(c_0_4,negated_conjecture,
~ ~ ! [X4: $o > $o] :
? [X1: $o] :
! [X7: $o > $o] :
( ( X7 @ ( X4 @ X1 ) )
=> ( X7 @ X1 ) ),
inference(apply_def,[status(thm)],[c_0_2,c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X8: $o > $o,X10: $o > $o] :
( ~ ( X10 @ ( X8 @ ( epred1_1 @ X8 ) ) )
| ( X10 @ ( epred1_1 @ X8 ) ) ),
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,
! [X3: $o > $o,X4: $o > $o] :
( ( X3 @ ( epred1_1 @ X4 ) )
| ~ ( X3 @ ( X4 @ ( epred1_1 @ X4 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X4: $o > $o] :
( ( X4 @ ( epred1_1 @ X4 ) )
<=> ( epred1_1 @ X4 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X3: $o > $o] :
( ( X3 @ ( epred1_1 @ X3 ) )
| ~ ( epred1_1 @ X3 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X3: $o > $o] :
( ( epred1_1 @ X3 )
| ~ ( X3 @ ( epred1_1 @ X3 ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
~ ( epred1_1 @ $not ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_8]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO030^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.10/0.17 % Computer : n019.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Tue Sep 29 16:23:32 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running higher-order theorem proving
% 0.10/0.23 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.qIiceViAL5/E---3.1_997462.p
% 0.10/0.25 % Version: 3.5.1-ho
% 0.10/0.25 % Preprocessing class: HSSSSMSSSLSNSSN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting ehoh_best3_fo with 1500s (5) cores
% 0.10/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.10/0.25 % Starting post_as_ho4 with 300s (1) cores
% 0.10/0.25 % Starting ehoh_best6_lambda with 300s (1) cores
% 0.10/0.25 % ehoh_best3_fo with pid 997492 completed with status 0
% 0.10/0.25 % Result found by ehoh_best3_fo
% 0.10/0.25 % Preprocessing class: HSSSSMSSSLSNSSN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting ehoh_best3_fo with 1500s (5) cores
% 0.10/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.25 % No SInE strategy applied
% 0.10/0.25 % Search class: HHUNF-FFSF00-SSSFMMBN
% 0.10/0.25 % partial match(1): HHUNF-FFSF00-SSSFFMBN
% 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 ehoh_best3_fo with 151s (1) cores
% 0.10/0.25 % Starting sh2lt with 136s (1) cores
% 0.10/0.25 % Starting sh2l with 136s (1) cores
% 0.10/0.25 % Starting lpo1_def_fix with 136s (1) cores
% 0.10/0.25 % SubtermCWHack with pid 997497 completed with status 10
% 0.10/0.25 % Starting ehoh_best3_rw with 136s (1) cores
% 0.10/0.25 % sh2lt with pid 997501 completed with status 10
% 0.10/0.25 % Starting ehoh_best_nonlift with 669s (1) cores
% 0.10/0.25 % ehoh_best3_fo with pid 997500 completed with status 0
% 0.10/0.25 % Result found by ehoh_best3_fo
% 0.10/0.25 % Preprocessing class: HSSSSMSSSLSNSSN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting ehoh_best3_fo with 1500s (5) cores
% 0.10/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.25 % No SInE strategy applied
% 0.10/0.25 % Search class: HHUNF-FFSF00-SSSFMMBN
% 0.10/0.25 % partial match(1): HHUNF-FFSF00-SSSFFMBN
% 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 ehoh_best3_fo with 151s (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 : 2
% 0.10/0.25 % Removed in clause preprocessing : 1
% 0.10/0.25 % Initial clauses in saturation : 1
% 0.10/0.25 % Processed clauses : 8
% 0.10/0.25 % ...of these trivial : 0
% 0.10/0.25 % ...subsumed : 1
% 0.10/0.25 % ...remaining for further processing : 7
% 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 : 0
% 0.10/0.25 % Generated clauses : 15
% 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 : 0
% 0.10/0.25 % Equation resolutions : 0
% 0.10/0.25 % Disequality decompositions : 0
% 0.10/0.25 % Total rewrite steps : 0
% 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 : 4
% 0.10/0.25 % Positive orientable unit clauses : 0
% 0.10/0.25 % Positive unorientable unit clauses: 0
% 0.10/0.25 % Negative unit clauses : 1
% 0.10/0.25 % Non-unit-clauses : 3
% 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 : 3
% 0.10/0.25 % Clause-clause subsumption calls (NU) : 7
% 0.10/0.25 % Rec. Clause-clause subsumption calls : 5
% 0.10/0.25 % Non-unit clause-clause subsumptions : 1
% 0.10/0.25 % Unit Clause-clause subsumption calls : 0
% 0.10/0.25 % Rewrite failures with RHS unbound : 0
% 0.10/0.25 % BW rewrite match attempts : 0
% 0.10/0.25 % BW rewrite match successes : 0
% 0.10/0.25 % Condensation attempts : 0
% 0.10/0.25 % Condensation successes : 0
% 0.10/0.25 % Termbank termtop insertions : 638
% 0.10/0.25 % Search garbage collected termcells : 72
% 0.10/0.25
% 0.10/0.25 % -------------------------------------------------
% 0.10/0.25 % User time : 0.006 s
% 0.10/0.25 % System time : 0.005 s
% 0.10/0.25 % Total time : 0.011 s
% 0.10/0.25 % Maximum resident set size: 3884 pages
% 0.10/0.25
% 0.10/0.25 % -------------------------------------------------
% 0.10/0.25 % User time : 0.008 s
% 0.10/0.25 % System time : 0.012 s
% 0.10/0.25 % Total time : 0.020 s
% 0.10/0.25 % Maximum resident set size: 4608 pages
% 0.10/0.25 % E exiting
%------------------------------------------------------------------------------