%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU902^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:28:04 AM UTC 2026
% Result : Theorem 0.09s 0.14s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 50 ( 20 equ; 0 cnn)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 130 ( 26 ~; 15 |; 10 &; 71 @)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 33 ( 2 ^; 28 !; 3 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
d: $i > $o ).
thf(decl_24,type,
esk1_0: ( $i > $o ) > $i ).
thf(decl_25,type,
epred1_1: $i > $i > $o ).
thf(cTHM143_pme,conjecture,
! [X1: ( $i > $o ) > $i] :
( ( ! [X2: $i > $o,X3: $i > $o] :
( ( ( X1 @ X2 )
= ( X1 @ X3 ) )
=> ( X2 = X3 ) )
& ( d
= ( ^ [X4: $i] :
? [X5: $i > $o] :
( ~ ( X5 @ ( X1 @ X5 ) )
& ( X4
= ( X1 @ X5 ) ) ) ) ) )
=> ~ ( d @ ( X1 @ d ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CvSvKCibpl/E---3.1_198374.p',cTHM143_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: ( $i > $o ) > $i] :
( ( ! [X2: $i > $o,X3: $i > $o] :
( ( ( X1 @ X2 )
= ( X1 @ X3 ) )
=> ( X2 = X3 ) )
& ( d
= ( ^ [X4: $i] :
? [X5: $i > $o] :
( ~ ( X5 @ ( X1 @ X5 ) )
& ( X4
= ( X1 @ X5 ) ) ) ) ) )
=> ~ ( d @ ( X1 @ d ) ) ),
inference(assume_negation,[status(cth)],[cTHM143_pme]) ).
thf(c_0_2,negated_conjecture,
~ ! [X1: ( $i > $o ) > $i] :
( ( ! [X2: $i > $o,X3: $i > $o] :
( ( ( X1 @ X2 )
= ( X1 @ X3 ) )
=> ( X2 = X3 ) )
& ! [X9: $i] :
( ( d @ X9 )
<=> ? [X5: $i > $o] :
( ~ ( X5 @ ( X1 @ X5 ) )
& ( X9
= ( X1 @ X5 ) ) ) ) )
=> ~ ( d @ ( X1 @ d ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])])]) ).
thf(c_0_3,negated_conjecture,
! [X11: $i > $o,X12: $i > $o,X13: $i,X15: $i > $o] :
( ( ( ( esk1_0 @ X11 )
!= ( esk1_0 @ X12 ) )
| ( X11 = X12 ) )
& ( ~ ( epred1_1 @ X13 @ ( esk1_0 @ ( epred1_1 @ X13 ) ) )
| ~ ( d @ X13 ) )
& ( ( X13
= ( esk1_0 @ ( epred1_1 @ X13 ) ) )
| ~ ( d @ X13 ) )
& ( ( X15 @ ( esk1_0 @ X15 ) )
| ( X13
!= ( esk1_0 @ X15 ) )
| ( d @ X13 ) )
& ( d @ ( esk1_0 @ d ) ) ),
inference(distribute,[status(thm)],[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_2])])])])])]) ).
thf(c_0_4,negated_conjecture,
! [X2: $i > $o,X3: $i > $o] :
( ( X2 = X3 )
| ( ( esk1_0 @ X2 )
!= ( esk1_0 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X2: $i > $o,X16: $i,X3: $i > $o] :
( ( ( X2 @ X16 )
<=> ( X3 @ X16 ) )
| ( ( esk1_0 @ X2 )
!= ( esk1_0 @ X3 ) ) ),
inference(arg_cong,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X4: $i] :
( ~ ( epred1_1 @ X4 @ ( esk1_0 @ ( epred1_1 @ X4 ) ) )
| ~ ( d @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X4: $i] :
( ( X4
= ( esk1_0 @ ( epred1_1 @ X4 ) ) )
| ~ ( d @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
! [X2: $i > $o,X3: $i > $o,X4: $i] :
( ( X2 @ X4 )
| ( ( esk1_0 @ X2 )
!= ( esk1_0 @ X3 ) )
| ~ ( X3 @ X4 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X4: $i] :
( ~ ( epred1_1 @ X4 @ X4 )
| ~ ( d @ X4 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X2: $i > $o,X4: $i] :
( ( epred1_1 @ ( esk1_0 @ X2 ) @ X4 )
| ~ ( d @ ( esk1_0 @ X2 ) )
| ~ ( X2 @ X4 ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_7])]) ).
thf(c_0_11,negated_conjecture,
! [X2: $i > $o] :
( ~ ( d @ ( esk1_0 @ X2 ) )
| ~ ( X2 @ ( esk1_0 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,negated_conjecture,
d @ ( esk1_0 @ d ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU902^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Tue Sep 29 14:44:03 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.12 Running higher-order theorem proving
% 0.09/0.13 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.CvSvKCibpl/E---3.1_198374.p
% 0.09/0.14 % Version: 3.5.1-ho
% 0.09/0.14 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.09/0.14 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.14 % Starting sh2lt with 1200s (4) cores
% 0.09/0.14 % Starting new_ho_10_unif with 300s (1) cores
% 0.09/0.14 % Starting full_lambda_6 with 300s (1) cores
% 0.09/0.14 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.14 % Starting ehoh_best3_rw with 300s (1) cores
% 0.09/0.14 % new_ho_10_unif with pid 198388 completed with status 0
% 0.09/0.14 % Result found by new_ho_10_unif
% 0.09/0.14 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.09/0.14 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.14 % Starting sh2lt with 1200s (4) cores
% 0.09/0.14 % Starting new_ho_10_unif with 300s (1) cores
% 0.09/0.14 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.14 % No SInE strategy applied
% 0.09/0.14 % Search class: HGHSF-FFSF00-SHHFFSBN
% 0.09/0.14 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.14 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.14 % SubtermCWHack with pid 198396 completed with status 0
% 0.09/0.14 % Result found by SubtermCWHack
% 0.09/0.14 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.09/0.14 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.14 % Starting sh2lt with 1200s (4) cores
% 0.09/0.14 % Starting new_ho_10_unif with 300s (1) cores
% 0.09/0.14 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.14 % No SInE strategy applied
% 0.09/0.14 % Search class: HGHSF-FFSF00-SHHFFSBN
% 0.09/0.14 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.14 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.14 % Preprocessing time : 0.001 s
% 0.09/0.14
% 0.09/0.14 % Proof found!
% 0.09/0.14 % SZS status Theorem
% 0.09/0.14 % SZS output start CNFRefutation
% See solution above
% 0.09/0.14 % Parsed axioms : 2
% 0.09/0.14 % Removed by relevancy pruning/SinE : 0
% 0.09/0.14 % Initial clauses : 6
% 0.09/0.14 % Removed in clause preprocessing : 1
% 0.09/0.14 % Initial clauses in saturation : 5
% 0.09/0.14 % Processed clauses : 17
% 0.09/0.14 % ...of these trivial : 0
% 0.09/0.14 % ...subsumed : 3
% 0.09/0.14 % ...remaining for further processing : 14
% 0.09/0.14 % Other redundant clauses eliminated : 5
% 0.09/0.14 % Clauses deleted for lack of memory : 0
% 0.09/0.14 % Backward-subsumed : 0
% 0.09/0.14 % Backward-rewritten : 0
% 0.09/0.14 % Generated clauses : 33
% 0.09/0.14 % ...of the previous two non-redundant : 17
% 0.09/0.14 % ...aggressively subsumed : 0
% 0.09/0.14 % Contextual simplify-reflections : 0
% 0.09/0.14 % Paramodulations : 20
% 0.09/0.14 % Factorizations : 2
% 0.09/0.14 % NegExts : 0
% 0.09/0.14 % Equation resolutions : 7
% 0.09/0.14 % Disequality decompositions : 0
% 0.09/0.14 % Total rewrite steps : 3
% 0.09/0.14 % ...of those cached : 2
% 0.09/0.14 % Propositional unsat checks : 0
% 0.09/0.14 % Propositional check models : 0
% 0.09/0.14 % Propositional check unsatisfiable : 0
% 0.09/0.14 % Propositional clauses : 0
% 0.09/0.14 % Propositional clauses after purity: 0
% 0.09/0.14 % Propositional unsat core size : 0
% 0.09/0.14 % Propositional preprocessing time : 0.000
% 0.09/0.14 % Propositional encoding time : 0.000
% 0.09/0.14 % Propositional solver time : 0.000
% 0.09/0.14 % Success case prop preproc time : 0.000
% 0.09/0.14 % Success case prop encoding time : 0.000
% 0.09/0.14 % Success case prop solver time : 0.000
% 0.09/0.14 % Current number of processed clauses : 12
% 0.09/0.14 % Positive orientable unit clauses : 1
% 0.09/0.14 % Positive unorientable unit clauses: 0
% 0.09/0.14 % Negative unit clauses : 0
% 0.09/0.14 % Non-unit-clauses : 11
% 0.09/0.14 % Current number of unprocessed clauses: 3
% 0.09/0.14 % ...number of literals in the above : 7
% 0.09/0.14 % Current number of archived formulas : 0
% 0.09/0.14 % Current number of archived clauses : 1
% 0.09/0.14 % Clause-clause subsumption calls (NU) : 27
% 0.09/0.14 % Rec. Clause-clause subsumption calls : 25
% 0.09/0.14 % Non-unit clause-clause subsumptions : 3
% 0.09/0.14 % Unit Clause-clause subsumption calls : 0
% 0.09/0.14 % Rewrite failures with RHS unbound : 0
% 0.09/0.14 % BW rewrite match attempts : 0
% 0.09/0.14 % BW rewrite match successes : 0
% 0.09/0.14 % Condensation attempts : 0
% 0.09/0.14 % Condensation successes : 0
% 0.09/0.14 % Termbank termtop insertions : 1020
% 0.09/0.14 % Search garbage collected termcells : 213
% 0.09/0.14
% 0.09/0.14 % -------------------------------------------------
% 0.09/0.14 % User time : 0.004 s
% 0.09/0.14 % System time : 0.000 s
% 0.09/0.14 % Total time : 0.004 s
% 0.09/0.14 % Maximum resident set size: 3632 pages
% 0.09/0.14
% 0.09/0.14 % -------------------------------------------------
% 0.09/0.14 % User time : 0.004 s
% 0.09/0.14 % System time : 0.003 s
% 0.09/0.14 % Total time : 0.007 s
% 0.09/0.14 % Maximum resident set size: 4864 pages
% 0.09/0.14 % E exiting
%------------------------------------------------------------------------------