%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU499^2 : 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 : n004.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:24:16 AM UTC 2026
% Result : Theorem 0.28s 0.40s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 29 ( 13 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 68 ( 11 ~; 7 |; 9 &; 32 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 4 ^; 15 !; 6 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
exu: ( $i > $o ) > $o ).
thf(decl_24,type,
epred1_0: $i > $o ).
thf(decl_25,type,
esk1_0: $i ).
thf(decl_26,type,
esk2_1: $i > $i ).
thf(exuE1,conjecture,
! [X1: $i > $o] :
( ( exu
@ ^ [X2: $i] : ( X1 @ X2 ) )
=> ? [X2: $i] :
( ( X1 @ X2 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.O7dV3rSyqO/E---3.1_1307195.p',exuE1) ).
thf(exu,axiom,
( exu
= ( ^ [X1: $i > $o] :
? [X2: $i] :
( ( X1 @ X2 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.O7dV3rSyqO/E---3.1_1307195.p',exu) ).
thf(c_0_2,negated_conjecture,
~ ! [X1: $i > $o] :
( ( exu
@ ^ [X2: $i] : ( X1 @ X2 ) )
=> ? [X2: $i] :
( ( X1 @ X2 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ),
inference(assume_negation,[status(cth)],[exuE1]) ).
thf(c_0_3,plain,
( exu
= ( ^ [Z0: $i > $o] :
? [X2: $i] :
( ( Z0 @ X2 )
& ! [X3: $i] :
( ( Z0 @ X3 )
=> ( X2 = X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[exu]) ).
thf(c_0_4,negated_conjecture,
~ ! [X1: $i > $o] :
( ? [X7: $i] :
( ( X1 @ X7 )
& ! [X8: $i] :
( ( X1 @ X8 )
=> ( X7 = X8 ) ) )
=> ? [X2: $i] :
( ( X1 @ X2 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X11: $i,X12: $i] :
( ( epred1_0 @ esk1_0 )
& ( ~ ( epred1_0 @ X11 )
| ( esk1_0 = X11 ) )
& ( ( epred1_0 @ ( esk2_1 @ X12 ) )
| ~ ( epred1_0 @ X12 ) )
& ( ( X12
!= ( esk2_1 @ X12 ) )
| ~ ( epred1_0 @ X12 ) ) ),
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_4])])])])])]) ).
thf(c_0_6,negated_conjecture,
! [X2: $i] :
( ( esk1_0 = X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ ( esk2_1 @ X2 ) )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X2: $i] :
( ( X2
!= ( esk2_1 @ X2 ) )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i] :
( ( ( esk2_1 @ X2 )
= esk1_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,negated_conjecture,
epred1_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9])]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU499^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.28 % Computer : n004.cluster.edu
% 0.13/0.28 % Model : x86_64 x86_64
% 0.13/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.28 % Memory : 8046.5625MB
% 0.13/0.28 % OS : Linux 6.8.0-71-generic
% 0.13/0.28 % CPULimit : 300
% 0.13/0.28 % WCLimit : 300
% 0.13/0.28 % DateTime : Tue Sep 29 13:46:22 UTC 2026
% 0.13/0.29 % CPUTime :
% 0.13/0.29 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.28/0.35 Running higher-order theorem proving
% 0.28/0.37 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.O7dV3rSyqO/E---3.1_1307195.p
% 0.28/0.40 % Version: 3.5.1-ho
% 0.28/0.40 % Preprocessing class: HSSSSMSSSLSNHSA.
% 0.28/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.40 % Starting post_as_ho12 with 1500s (5) cores
% 0.28/0.40 % Starting post_as_ho4 with 300s (1) cores
% 0.28/0.40 % Starting lpo8_s with 300s (1) cores
% 0.28/0.40 % Starting sh5l with 300s (1) cores
% 0.28/0.40 % sh5l with pid 1307211 completed with status 0
% 0.28/0.40 % Result found by sh5l
% 0.28/0.40 % Preprocessing class: HSSSSMSSSLSNHSA.
% 0.28/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.40 % Starting post_as_ho12 with 1500s (5) cores
% 0.28/0.40 % Starting post_as_ho4 with 300s (1) cores
% 0.28/0.40 % Starting lpo8_s with 300s (1) cores
% 0.28/0.40 % Starting sh5l with 300s (1) cores
% 0.28/0.40 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.28/0.40 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.28/0.40 % Search class: HHHSF-FFSF11-SHSFMFNN
% 0.28/0.40 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.40 % Starting SubtermCWHack with 31s (1) cores
% 0.28/0.40 % SubtermCWHack with pid 1307212 completed with status 0
% 0.28/0.40 % Result found by SubtermCWHack
% 0.28/0.40 % Preprocessing class: HSSSSMSSSLSNHSA.
% 0.28/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.40 % Starting post_as_ho12 with 1500s (5) cores
% 0.28/0.40 % Starting post_as_ho4 with 300s (1) cores
% 0.28/0.40 % Starting lpo8_s with 300s (1) cores
% 0.28/0.40 % Starting sh5l with 300s (1) cores
% 0.28/0.40 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.28/0.40 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.28/0.40 % Search class: HHHSF-FFSF11-SHSFMFNN
% 0.28/0.40 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.40 % Starting SubtermCWHack with 31s (1) cores
% 0.28/0.40 % Preprocessing time : 0.002 s
% 0.28/0.40
% 0.28/0.40 % Proof found!
% 0.28/0.40 % SZS status Theorem
% 0.28/0.40 % SZS output start CNFRefutation
% See solution above
% 0.28/0.40 % Parsed axioms : 3
% 0.28/0.40 % Removed by relevancy pruning/SinE : 1
% 0.28/0.40 % Initial clauses : 4
% 0.28/0.40 % Removed in clause preprocessing : 0
% 0.28/0.40 % Initial clauses in saturation : 4
% 0.28/0.40 % Processed clauses : 5
% 0.28/0.40 % ...of these trivial : 0
% 0.28/0.40 % ...subsumed : 0
% 0.28/0.40 % ...remaining for further processing : 5
% 0.28/0.40 % Other redundant clauses eliminated : 1
% 0.28/0.40 % Clauses deleted for lack of memory : 0
% 0.28/0.40 % Backward-subsumed : 0
% 0.28/0.40 % Backward-rewritten : 0
% 0.28/0.40 % Generated clauses : 4
% 0.28/0.40 % ...of the previous two non-redundant : 1
% 0.28/0.40 % ...aggressively subsumed : 0
% 0.28/0.40 % Contextual simplify-reflections : 0
% 0.28/0.40 % Paramodulations : 3
% 0.28/0.40 % Factorizations : 0
% 0.28/0.40 % NegExts : 0
% 0.28/0.40 % Equation resolutions : 1
% 0.28/0.40 % Disequality decompositions : 0
% 0.28/0.40 % Total rewrite steps : 2
% 0.28/0.40 % ...of those cached : 1
% 0.28/0.40 % Propositional unsat checks : 0
% 0.28/0.40 % Propositional check models : 0
% 0.28/0.40 % Propositional check unsatisfiable : 0
% 0.28/0.40 % Propositional clauses : 0
% 0.28/0.40 % Propositional clauses after purity: 0
% 0.28/0.40 % Propositional unsat core size : 0
% 0.28/0.40 % Propositional preprocessing time : 0.000
% 0.28/0.40 % Propositional encoding time : 0.000
% 0.28/0.40 % Propositional solver time : 0.000
% 0.28/0.40 % Success case prop preproc time : 0.000
% 0.28/0.40 % Success case prop encoding time : 0.000
% 0.28/0.40 % Success case prop solver time : 0.000
% 0.28/0.40 % Current number of processed clauses : 5
% 0.28/0.40 % Positive orientable unit clauses : 1
% 0.28/0.40 % Positive unorientable unit clauses: 0
% 0.28/0.40 % Negative unit clauses : 0
% 0.28/0.40 % Non-unit-clauses : 4
% 0.28/0.40 % Current number of unprocessed clauses: 0
% 0.28/0.40 % ...number of literals in the above : 0
% 0.28/0.40 % Current number of archived formulas : 0
% 0.28/0.40 % Current number of archived clauses : 0
% 0.28/0.40 % Clause-clause subsumption calls (NU) : 2
% 0.28/0.40 % Rec. Clause-clause subsumption calls : 2
% 0.28/0.40 % Non-unit clause-clause subsumptions : 0
% 0.28/0.40 % Unit Clause-clause subsumption calls : 0
% 0.28/0.40 % Rewrite failures with RHS unbound : 0
% 0.28/0.40 % BW rewrite match attempts : 0
% 0.28/0.40 % BW rewrite match successes : 0
% 0.28/0.40 % Condensation attempts : 0
% 0.28/0.40 % Condensation successes : 0
% 0.28/0.40 % Termbank termtop insertions : 440
% 0.28/0.40 % Search garbage collected termcells : 180
% 0.28/0.40
% 0.28/0.40 % -------------------------------------------------
% 0.28/0.40 % User time : 0.002 s
% 0.28/0.40 % System time : 0.002 s
% 0.28/0.40 % Total time : 0.005 s
% 0.28/0.40 % Maximum resident set size: 3884 pages
% 0.28/0.40
% 0.28/0.40 % -------------------------------------------------
% 0.28/0.40 % User time : 0.004 s
% 0.28/0.40 % System time : 0.008 s
% 0.28/0.40 % Total time : 0.013 s
% 0.28/0.40 % Maximum resident set size: 4864 pages
% 0.28/0.40 % E exiting
%------------------------------------------------------------------------------