%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU525^2 : 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:24:22 AM UTC 2026
% Result : Theorem 0.26s 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 48 ( 28 equ; 0 cnn)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 143 ( 16 ~; 17 |; 16 &; 70 @)
% ( 5 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 46 ( 6 ^; 28 !; 12 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
exu: ( $i > $o ) > $o ).
thf(decl_24,type,
exuE1: $o ).
thf(decl_25,type,
esk1_2: ( $i > $o ) > $i > $i ).
thf(decl_26,type,
esk2_1: ( $i > $o ) > $i ).
thf(decl_27,type,
epred1_0: $i > $o ).
thf(decl_28,type,
esk3_0: $i ).
thf(decl_29,type,
esk4_1: $i > $i ).
thf(exuE1,axiom,
( exuE1
<=> ! [X1: $i > $o] :
( ( exu
@ ^ [X2: $i] : ( X1 @ X2 ) )
=> ? [X2: $i] :
( ( X1 @ X2 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ma8NRsoPBy/E---3.1_791692.p',exuE1) ).
thf(exu,axiom,
( exu
= ( ^ [X1: $i > $o] :
? [X2: $i] :
( ( X1 @ X2 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ma8NRsoPBy/E---3.1_791692.p',exu) ).
thf(exuE2,conjecture,
( exuE1
=> ! [X1: $i > $o] :
( ( exu
@ ^ [X2: $i] : ( X1 @ X2 ) )
=> ? [X2: $i] :
! [X3: $i] :
( ( X1 @ X3 )
<=> ( X3 = X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ma8NRsoPBy/E---3.1_791692.p',exuE2) ).
thf(c_0_3,plain,
( exuE1
<=> ! [X1: $i > $o] :
( ( exu
@ ^ [Z0: $i] : ( X1 @ Z0 ) )
=> ? [X2: $i] :
( ( X1 @ X2 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[exuE1]) ).
thf(c_0_4,plain,
( exu
= ( ^ [Z0: $i > $o] :
? [X2: $i] :
( ( Z0 @ X2 )
& ! [X3: $i] :
( ( Z0 @ X3 )
=> ( X2 = X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[exu]) ).
thf(c_0_5,negated_conjecture,
~ ( exuE1
=> ! [X1: $i > $o] :
( ( exu
@ ^ [X2: $i] : ( X1 @ X2 ) )
=> ? [X2: $i] :
! [X3: $i] :
( ( X1 @ X3 )
<=> ( X3 = X2 ) ) ) ),
inference(assume_negation,[status(cth)],[exuE2]) ).
thf(c_0_6,plain,
( exuE1
= ( ! [X1: $i > $o] :
( ? [X10: $i] :
( ( X1 @ X10 )
& ! [X11: $i] :
( ( X1 @ X11 )
=> ( X10 = X11 ) ) )
=> ? [X2: $i] :
( ( X1 @ X2 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
~ ( ! [X12: $i > $o] :
( ? [X13: $i] :
( ( X12 @ X13 )
& ! [X14: $i] :
( ( X12 @ X14 )
=> ( X13 = X14 ) ) )
=> ? [X15: $i] :
( ( X12 @ X15 )
& ! [X16: $i] :
( ( X12 @ X16 )
=> ( X15 = X16 ) ) ) )
=> ! [X1: $i > $o] :
( ? [X17: $i] :
( ( X1 @ X17 )
& ! [X18: $i] :
( ( X1 @ X18 )
=> ( X17 = X18 ) ) )
=> ? [X2: $i] :
! [X3: $i] :
( ( X1 @ X3 )
<=> ( X3 = X2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5]),c_0_4]),c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X19: $i > $o,X20: $i,X23: $i,X26: $i,X27: $i] :
( ( ( X19 @ ( esk2_1 @ X19 ) )
| ( X19 @ ( esk1_2 @ X19 @ X20 ) )
| ~ ( X19 @ X20 ) )
& ( ~ ( X19 @ X23 )
| ( ( esk2_1 @ X19 )
= X23 )
| ( X19 @ ( esk1_2 @ X19 @ X20 ) )
| ~ ( X19 @ X20 ) )
& ( ( X19 @ ( esk2_1 @ X19 ) )
| ( X20
!= ( esk1_2 @ X19 @ X20 ) )
| ~ ( X19 @ X20 ) )
& ( ~ ( X19 @ X23 )
| ( ( esk2_1 @ X19 )
= X23 )
| ( X20
!= ( esk1_2 @ X19 @ X20 ) )
| ~ ( X19 @ X20 ) )
& ( epred1_0 @ esk3_0 )
& ( ~ ( epred1_0 @ X26 )
| ( esk3_0 = X26 ) )
& ( ~ ( epred1_0 @ ( esk4_1 @ X27 ) )
| ( ( esk4_1 @ X27 )
!= X27 ) )
& ( ( epred1_0 @ ( esk4_1 @ X27 ) )
| ( ( esk4_1 @ X27 )
= X27 ) ) ),
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_7])])])])])]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i] :
( ( esk3_0 = X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ ( esk4_1 @ X2 ) )
| ( ( esk4_1 @ X2 )
= X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X2: $i] :
( ( ( esk4_1 @ X2 )
= esk3_0 )
| ( ( esk4_1 @ X2 )
= X2 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,negated_conjecture,
! [X2: $i] :
( ~ ( epred1_0 @ ( esk4_1 @ X2 ) )
| ( ( esk4_1 @ X2 )
!= X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
( ( esk4_1 @ esk3_0 )
= esk3_0 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_11])]) ).
thf(c_0_14,negated_conjecture,
epred1_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU525^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n019.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:48:17 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.24 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.ma8NRsoPBy/E---3.1_791692.p
% 0.26/0.26 % Version: 3.5.1-ho
% 0.26/0.26 % Preprocessing class: HSSSSMSSSLMNHSA.
% 0.26/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.26/0.26 % Starting sh5l with 300s (1) cores
% 0.26/0.26 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.26 % Starting new_bool_2 with 300s (1) cores
% 0.26/0.26 % sh5l with pid 791706 completed with status 0
% 0.26/0.26 % Result found by sh5l
% 0.26/0.26 % Preprocessing class: HSSSSMSSSLMNHSA.
% 0.26/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.26/0.26 % Starting sh5l with 300s (1) cores
% 0.26/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.26 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.26 % Search class: HGHSF-FFSF21-SHSFMMBN
% 0.26/0.26 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.26 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.26 % SubtermCWHack with pid 791709 completed with status 0
% 0.26/0.26 % Result found by SubtermCWHack
% 0.26/0.26 % Preprocessing class: HSSSSMSSSLMNHSA.
% 0.26/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.26/0.26 % Starting sh5l with 300s (1) cores
% 0.26/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.26 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.26 % Search class: HGHSF-FFSF21-SHSFMMBN
% 0.26/0.26 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.26 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.26 % Preprocessing time : 0.001 s
% 0.26/0.26
% 0.26/0.26 % Proof found!
% 0.26/0.26 % SZS status Theorem
% 0.26/0.26 % SZS output start CNFRefutation
% See solution above
% 0.26/0.26 % Parsed axioms : 5
% 0.26/0.26 % Removed by relevancy pruning/SinE : 2
% 0.26/0.26 % Initial clauses : 8
% 0.26/0.26 % Removed in clause preprocessing : 0
% 0.26/0.26 % Initial clauses in saturation : 8
% 0.26/0.26 % Processed clauses : 6
% 0.26/0.26 % ...of these trivial : 0
% 0.26/0.26 % ...subsumed : 0
% 0.26/0.26 % ...remaining for further processing : 6
% 0.26/0.26 % Other redundant clauses eliminated : 3
% 0.26/0.26 % Clauses deleted for lack of memory : 0
% 0.26/0.26 % Backward-subsumed : 0
% 0.26/0.26 % Backward-rewritten : 0
% 0.26/0.26 % Generated clauses : 11
% 0.26/0.26 % ...of the previous two non-redundant : 5
% 0.26/0.26 % ...aggressively subsumed : 0
% 0.26/0.26 % Contextual simplify-reflections : 0
% 0.26/0.26 % Paramodulations : 6
% 0.26/0.26 % Factorizations : 2
% 0.26/0.26 % NegExts : 0
% 0.26/0.26 % Equation resolutions : 3
% 0.26/0.26 % Disequality decompositions : 0
% 0.26/0.26 % Total rewrite steps : 3
% 0.26/0.26 % ...of those cached : 2
% 0.26/0.26 % Propositional unsat checks : 0
% 0.26/0.26 % Propositional check models : 0
% 0.26/0.26 % Propositional check unsatisfiable : 0
% 0.26/0.26 % Propositional clauses : 0
% 0.26/0.26 % Propositional clauses after purity: 0
% 0.26/0.26 % Propositional unsat core size : 0
% 0.26/0.26 % Propositional preprocessing time : 0.000
% 0.26/0.26 % Propositional encoding time : 0.000
% 0.26/0.26 % Propositional solver time : 0.000
% 0.26/0.26 % Success case prop preproc time : 0.000
% 0.26/0.26 % Success case prop encoding time : 0.000
% 0.26/0.26 % Success case prop solver time : 0.000
% 0.26/0.26 % Current number of processed clauses : 6
% 0.26/0.26 % Positive orientable unit clauses : 2
% 0.26/0.26 % Positive unorientable unit clauses: 0
% 0.26/0.26 % Negative unit clauses : 0
% 0.26/0.26 % Non-unit-clauses : 4
% 0.26/0.26 % Current number of unprocessed clauses: 7
% 0.26/0.26 % ...number of literals in the above : 18
% 0.26/0.26 % Current number of archived formulas : 0
% 0.26/0.26 % Current number of archived clauses : 0
% 0.26/0.26 % Clause-clause subsumption calls (NU) : 0
% 0.26/0.26 % Rec. Clause-clause subsumption calls : 0
% 0.26/0.26 % Non-unit clause-clause subsumptions : 0
% 0.26/0.26 % Unit Clause-clause subsumption calls : 0
% 0.26/0.26 % Rewrite failures with RHS unbound : 0
% 0.26/0.26 % BW rewrite match attempts : 0
% 0.26/0.26 % BW rewrite match successes : 0
% 0.26/0.26 % Condensation attempts : 0
% 0.26/0.26 % Condensation successes : 0
% 0.26/0.26 % Termbank termtop insertions : 938
% 0.26/0.26 % Search garbage collected termcells : 386
% 0.26/0.26
% 0.26/0.26 % -------------------------------------------------
% 0.26/0.26 % User time : 0.003 s
% 0.26/0.26 % System time : 0.002 s
% 0.26/0.26 % Total time : 0.004 s
% 0.26/0.26 % Maximum resident set size: 3632 pages
% 0.26/0.26
% 0.26/0.26 % -------------------------------------------------
% 0.26/0.26 % User time : 0.004 s
% 0.26/0.26 % System time : 0.006 s
% 0.26/0.26 % Total time : 0.010 s
% 0.26/0.26 % Maximum resident set size: 4864 pages
% 0.26/0.26 % E exiting
%------------------------------------------------------------------------------