%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO006^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 : n007.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:07 AM UTC 2026
% Result : Theorem 0.06s 0.25s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 23 ( 2 equ; 0 cnn)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 41 ( 9 ~; 6 |; 2 &; 14 @)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 4 ^; 11 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
leibeq: $o > $o > $o ).
thf(decl_24,type,
epred1_0: $o ).
thf(decl_25,type,
epred2_0: $o ).
thf(conj,conjecture,
! [X4: $o,X5: $o] :
( ( leibeq @ X4 @ X5 )
=> ( X4
<=> X5 ) ),
file('/export/starexec/sandbox/tmp/tmp.NbgMv9v4wi/E---3.1_3573960.p',conj) ).
thf(leibeq1,axiom,
( leibeq
= ( ^ [X1: $o,X2: $o] :
! [X3: $o > $o] :
( ( X3 @ X1 )
=> ( X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NbgMv9v4wi/E---3.1_3573960.p',leibeq1) ).
thf(c_0_2,negated_conjecture,
~ ! [X4: $o,X5: $o] :
( ( leibeq @ X4 @ X5 )
=> ( X4
<=> X5 ) ),
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)],[leibeq1]) ).
thf(c_0_4,negated_conjecture,
~ ! [X4: $o,X5: $o] :
( ! [X8: $o > $o] :
( ( X8 @ X4 )
=> ( X8 @ X5 ) )
=> ( X4
<=> X5 ) ),
inference(apply_def,[status(thm)],[c_0_2,c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X11: $o > $o] :
( ( ~ ( X11 @ epred1_0 )
| ( X11 @ epred2_0 ) )
& ( ~ epred1_0
| ~ epred2_0 )
& ( epred1_0
| epred2_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_4])])])])]) ).
thf(c_0_6,negated_conjecture,
! [X3: $o > $o] :
( ( X3 @ epred2_0 )
| ~ ( X3 @ epred1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
( epred1_0
<=> epred2_0 ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6]) ).
thf(c_0_8,negated_conjecture,
( epred1_0
| epred2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
( ~ epred1_0
| ~ epred2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,negated_conjecture,
epred2_0,
inference(csr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_7]),c_0_8]) ).
thf(c_0_11,negated_conjecture,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_7]),c_0_10])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO006^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.06/0.17 % Computer : n007.cluster.edu
% 0.06/0.17 % Model : x86_64 x86_64
% 0.06/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17 % Memory : 8046.5625MB
% 0.06/0.17 % OS : Linux 6.8.0-71-generic
% 0.06/0.17 % CPULimit : 300
% 0.06/0.17 % WCLimit : 300
% 0.06/0.17 % DateTime : Tue Sep 29 16:18:55 UTC 2026
% 0.06/0.17 % CPUTime :
% 0.06/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.22 Running higher-order theorem proving
% 0.06/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.NbgMv9v4wi/E---3.1_3573960.p
% 0.06/0.25 % Version: 3.5.1-ho
% 0.06/0.25 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.06/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.25 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.06/0.25 % Starting post_as_ho5 with 300s (1) cores
% 0.06/0.25 % Starting sh4l with 300s (1) cores
% 0.06/0.25 % Starting ho_unfolding_2 with 300s (1) cores
% 0.06/0.25 % ho_unfolding_3 with pid 3573973 completed with status 0
% 0.06/0.25 % Result found by ho_unfolding_3
% 0.06/0.25 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.06/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.25 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.06/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.06/0.25 % No SInE strategy applied
% 0.06/0.25 % Search class: HGHNF-FFSF00-SSFFMSBN
% 0.06/0.25 % partial match(1): HGHNF-FFSF00-SSFFMMBN
% 0.06/0.25 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.06/0.25 % Starting SubtermCWHack with 151s (1) cores
% 0.06/0.25 % Starting ho_unfolding_3 with 901s (1) cores
% 0.06/0.25 % Starting ehoh_best_sine_rwall with 151s (1) cores
% 0.06/0.25 % Starting sh5l with 151s (1) cores
% 0.06/0.25 % Starting new_bool_3 with 146s (1) cores
% 0.06/0.25 % SubtermCWHack with pid 3573978 completed with status 10
% 0.06/0.25 % ho_unfolding_3 with pid 3573979 completed with status 0
% 0.06/0.25 % Result found by ho_unfolding_3
% 0.06/0.25 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.06/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.25 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.06/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.06/0.25 % No SInE strategy applied
% 0.06/0.25 % Search class: HGHNF-FFSF00-SSFFMSBN
% 0.06/0.25 % partial match(1): HGHNF-FFSF00-SSFFMMBN
% 0.06/0.25 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.06/0.25 % Starting SubtermCWHack with 151s (1) cores
% 0.06/0.25 % Starting ho_unfolding_3 with 901s (1) cores
% 0.06/0.25 % Preprocessing time : 0.001 s
% 0.06/0.25 % Presaturation interreduction done
% 0.06/0.25
% 0.06/0.25 % Proof found!
% 0.06/0.25 % SZS status Theorem
% 0.06/0.25 % SZS output start CNFRefutation
% See solution above
% 0.06/0.25 % Parsed axioms : 3
% 0.06/0.25 % Removed by relevancy pruning/SinE : 0
% 0.06/0.25 % Initial clauses : 4
% 0.06/0.25 % Removed in clause preprocessing : 1
% 0.06/0.25 % Initial clauses in saturation : 3
% 0.06/0.25 % Processed clauses : 10
% 0.06/0.25 % ...of these trivial : 0
% 0.06/0.25 % ...subsumed : 0
% 0.06/0.25 % ...remaining for further processing : 9
% 0.06/0.25 % Other redundant clauses eliminated : 0
% 0.06/0.25 % Clauses deleted for lack of memory : 0
% 0.06/0.25 % Backward-subsumed : 0
% 0.06/0.25 % Backward-rewritten : 3
% 0.06/0.25 % Generated clauses : 6
% 0.06/0.25 % ...of the previous two non-redundant : 7
% 0.06/0.25 % ...aggressively subsumed : 0
% 0.06/0.25 % Contextual simplify-reflections : 1
% 0.06/0.25 % Paramodulations : 2
% 0.06/0.25 % Factorizations : 0
% 0.06/0.25 % NegExts : 0
% 0.06/0.25 % Equation resolutions : 0
% 0.06/0.25 % Disequality decompositions : 0
% 0.06/0.25 % Total rewrite steps : 4
% 0.06/0.25 % ...of those cached : 3
% 0.06/0.25 % Propositional unsat checks : 0
% 0.06/0.25 % Propositional check models : 0
% 0.06/0.25 % Propositional check unsatisfiable : 0
% 0.06/0.25 % Propositional clauses : 0
% 0.06/0.25 % Propositional clauses after purity: 0
% 0.06/0.25 % Propositional unsat core size : 0
% 0.06/0.25 % Propositional preprocessing time : 0.000
% 0.06/0.25 % Propositional encoding time : 0.000
% 0.06/0.25 % Propositional solver time : 0.000
% 0.06/0.25 % Success case prop preproc time : 0.000
% 0.06/0.25 % Success case prop encoding time : 0.000
% 0.06/0.25 % Success case prop solver time : 0.000
% 0.06/0.25 % Current number of processed clauses : 2
% 0.06/0.25 % Positive orientable unit clauses : 1
% 0.06/0.25 % Positive unorientable unit clauses: 0
% 0.06/0.25 % Negative unit clauses : 1
% 0.06/0.25 % Non-unit-clauses : 0
% 0.06/0.25 % Current number of unprocessed clauses: 3
% 0.06/0.25 % ...number of literals in the above : 6
% 0.06/0.25 % Current number of archived formulas : 0
% 0.06/0.25 % Current number of archived clauses : 7
% 0.06/0.25 % Clause-clause subsumption calls (NU) : 6
% 0.06/0.25 % Rec. Clause-clause subsumption calls : 5
% 0.06/0.25 % Non-unit clause-clause subsumptions : 1
% 0.06/0.25 % Unit Clause-clause subsumption calls : 0
% 0.06/0.25 % Rewrite failures with RHS unbound : 0
% 0.06/0.25 % BW rewrite match attempts : 1
% 0.06/0.25 % BW rewrite match successes : 1
% 0.06/0.25 % Condensation attempts : 10
% 0.06/0.25 % Condensation successes : 0
% 0.06/0.25 % Termbank termtop insertions : 453
% 0.06/0.25 % Search garbage collected termcells : 123
% 0.06/0.25
% 0.06/0.25 % -------------------------------------------------
% 0.06/0.25 % User time : 0.004 s
% 0.06/0.25 % System time : 0.004 s
% 0.06/0.25 % Total time : 0.008 s
% 0.06/0.25 % Maximum resident set size: 3628 pages
% 0.06/0.25
% 0.06/0.25 % -------------------------------------------------
% 0.06/0.25 % User time : 0.011 s
% 0.06/0.25 % System time : 0.009 s
% 0.06/0.25 % Total time : 0.020 s
% 0.06/0.25 % Maximum resident set size: 4864 pages
% 0.06/0.25 % E exiting
%------------------------------------------------------------------------------