%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO241^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:37 AM UTC 2026
% Result : Theorem 0.06s 0.25s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 12 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 37 ( 26 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 106 ( 21 ~; 4 |; 13 &; 61 @)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 29 ( 29 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 34 ( 7 ^; 16 !; 11 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
esk1_0: ( $i > $o ) > $i ).
thf(decl_24,type,
epred1_0: $i > $o ).
thf(cTHM143_EXPAND,conjecture,
! [X1: ( $i > $o ) > $i] :
( ! [X2: $i > $o,X3: $i > $o] :
( ( ( X1 @ X2 )
= ( X1 @ X3 ) )
=> ( X2 = X3 ) )
=> ~ ? [X4: $i > $o] :
( ~ ( X4 @ ( X1 @ X4 ) )
& ( ( X1
@ ^ [X5: $i] :
? [X6: $i > $o] :
( ~ ( X6 @ ( X1 @ X6 ) )
& ( X5
= ( X1 @ X6 ) ) ) )
= ( X1 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.3M9ftGYiUW/E---3.1_320425.p',cTHM143_EXPAND) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: ( $i > $o ) > $i] :
( ! [X2: $i > $o,X3: $i > $o] :
( ( ( X1 @ X2 )
= ( X1 @ X3 ) )
=> ( X2 = X3 ) )
=> ~ ? [X4: $i > $o] :
( ~ ( X4 @ ( X1 @ X4 ) )
& ( ( X1
@ ^ [X5: $i] :
? [X6: $i > $o] :
( ~ ( X6 @ ( X1 @ X6 ) )
& ( X5
= ( X1 @ X6 ) ) ) )
= ( X1 @ X4 ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM143_EXPAND]) ).
thf(c_0_2,negated_conjecture,
~ ! [X1: ( $i > $o ) > $i] :
( ! [X2: $i > $o,X3: $i > $o] :
( ( ( X1 @ X2 )
= ( X1 @ X3 ) )
=> ( X2 = X3 ) )
=> ~ ? [X4: $i > $o] :
( ~ ( X4 @ ( X1 @ X4 ) )
& ( ( X1
@ ^ [Z0: $i] :
? [X6: $i > $o] :
( ~ ( X6 @ ( X1 @ X6 ) )
& ( Z0
= ( X1 @ X6 ) ) ) )
= ( X1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X12: $i > $o,X13: $i > $o] :
( ( ( ( esk1_0 @ X12 )
!= ( esk1_0 @ X13 ) )
| ( X12 = X13 ) )
& ~ ( epred1_0 @ ( esk1_0 @ epred1_0 ) )
& ( ( esk1_0
@ ^ [Z0: $i] :
? [X6: $i > $o] :
( ~ ( X6 @ ( esk1_0 @ X6 ) )
& ( Z0
= ( esk1_0 @ X6 ) ) ) )
= ( esk1_0 @ epred1_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_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,
( ( esk1_0
@ ^ [Z0: $i] :
? [X30: $i > $o] :
( ~ ( X30 @ ( esk1_0 @ X30 ) )
& ( Z0
= ( esk1_0 @ X30 ) ) ) )
= ( esk1_0 @ epred1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X2: $i > $o] :
( ( ( ^ [Z0: $i] :
? [X31: $i > $o] :
( ~ ( X31 @ ( esk1_0 @ X31 ) )
& ( Z0
= ( esk1_0 @ X31 ) ) ) )
= X2 )
| ( ( esk1_0 @ epred1_0 )
!= ( esk1_0 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_7,negated_conjecture,
( ( ^ [Z0: $i] :
? [X32: $i > $o] :
( ~ ( X32 @ ( esk1_0 @ X32 ) )
& ( Z0
= ( esk1_0 @ X32 ) ) ) )
= epred1_0 ),
inference(er,[status(thm)],[c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X24: $i] :
( ? [X33: $i > $o] :
( ~ ( X33 @ ( esk1_0 @ X33 ) )
& ( X24
= ( esk1_0 @ X33 ) ) )
<=> ( epred1_0 @ X24 ) ),
inference(arg_cong,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i > $o] :
( ( epred1_0 @ ( esk1_0 @ X2 ) )
| ( X2 @ ( esk1_0 @ X2 ) ) ),
inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_8])]) ).
thf(c_0_10,negated_conjecture,
~ ( epred1_0 @ ( esk1_0 @ epred1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO241^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.18 % Computer : n018.cluster.edu
% 0.06/0.18 % Model : x86_64 x86_64
% 0.06/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18 % Memory : 8046.5625MB
% 0.06/0.18 % OS : Linux 6.8.0-71-generic
% 0.06/0.18 % CPULimit : 300
% 0.06/0.18 % WCLimit : 300
% 0.06/0.18 % DateTime : Tue Sep 29 16:43:11 UTC 2026
% 0.06/0.18 % CPUTime :
% 0.06/0.18 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.3M9ftGYiUW/E---3.1_320425.p
% 0.06/0.25 % Version: 3.5.1-ho
% 0.06/0.25 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.06/0.25 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.25 % Starting sh2lt with 1200s (4) cores
% 0.06/0.25 % Starting new_ho_10_unif with 300s (1) cores
% 0.06/0.25 % Starting full_lambda_6 with 300s (1) cores
% 0.06/0.25 % Starting post_as_ho1 with 300s (1) cores
% 0.06/0.25 % Starting ehoh_best3_rw with 300s (1) cores
% 0.06/0.25 % new_ho_10_unif with pid 320439 completed with status 0
% 0.06/0.25 % Result found by new_ho_10_unif
% 0.06/0.25 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.06/0.25 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.25 % Starting sh2lt with 1200s (4) cores
% 0.06/0.25 % Starting new_ho_10_unif with 300s (1) cores
% 0.06/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.06/0.25 % No SInE strategy applied
% 0.06/0.25 % Search class: HHUSF-FFSF00-DHHFFFBN
% 0.06/0.25 % partial match(2): HHUPF-FFSF00-SHHFFFBN
% 0.06/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.06/0.25 % SubtermCWHack with pid 320443 completed with status 0
% 0.06/0.25 % Result found by SubtermCWHack
% 0.06/0.25 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.06/0.25 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.25 % Starting sh2lt with 1200s (4) cores
% 0.06/0.25 % Starting new_ho_10_unif with 300s (1) cores
% 0.06/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.06/0.25 % No SInE strategy applied
% 0.06/0.25 % Search class: HHUSF-FFSF00-DHHFFFBN
% 0.06/0.25 % partial match(2): HHUPF-FFSF00-SHHFFFBN
% 0.06/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.06/0.25 % Preprocessing time : 0.001 s
% 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 : 1
% 0.06/0.25 % Removed by relevancy pruning/SinE : 0
% 0.06/0.25 % Initial clauses : 3
% 0.06/0.25 % Removed in clause preprocessing : 0
% 0.06/0.25 % Initial clauses in saturation : 3
% 0.06/0.25 % Processed clauses : 15
% 0.06/0.25 % ...of these trivial : 0
% 0.06/0.25 % ...subsumed : 2
% 0.06/0.25 % ...remaining for further processing : 13
% 0.06/0.25 % Other redundant clauses eliminated : 6
% 0.06/0.25 % Clauses deleted for lack of memory : 0
% 0.06/0.25 % Backward-subsumed : 0
% 0.06/0.25 % Backward-rewritten : 2
% 0.06/0.25 % Generated clauses : 33
% 0.06/0.25 % ...of the previous two non-redundant : 22
% 0.06/0.25 % ...aggressively subsumed : 0
% 0.06/0.25 % Contextual simplify-reflections : 0
% 0.06/0.25 % Paramodulations : 12
% 0.06/0.25 % Factorizations : 2
% 0.06/0.25 % NegExts : 0
% 0.06/0.25 % Equation resolutions : 9
% 0.06/0.25 % Disequality decompositions : 0
% 0.06/0.25 % Total rewrite steps : 2
% 0.06/0.25 % ...of those cached : 1
% 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 : 8
% 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 : 6
% 0.06/0.25 % Current number of unprocessed clauses: 10
% 0.06/0.25 % ...number of literals in the above : 28
% 0.06/0.25 % Current number of archived formulas : 0
% 0.06/0.25 % Current number of archived clauses : 5
% 0.06/0.25 % Clause-clause subsumption calls (NU) : 22
% 0.06/0.25 % Rec. Clause-clause subsumption calls : 21
% 0.06/0.25 % Non-unit clause-clause subsumptions : 2
% 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 : 0
% 0.06/0.25 % Condensation successes : 0
% 0.06/0.25 % Termbank termtop insertions : 1743
% 0.06/0.25 % Search garbage collected termcells : 139
% 0.06/0.25
% 0.06/0.25 % -------------------------------------------------
% 0.06/0.25 % User time : 0.002 s
% 0.06/0.25 % System time : 0.002 s
% 0.06/0.25 % Total time : 0.004 s
% 0.06/0.25 % Maximum resident set size: 3632 pages
% 0.06/0.25
% 0.06/0.25 % -------------------------------------------------
% 0.06/0.25 % User time : 0.005 s
% 0.06/0.25 % System time : 0.006 s
% 0.06/0.25 % Total time : 0.010 s
% 0.06/0.25 % Maximum resident set size: 4864 pages
% 0.06/0.25 % E exiting
%------------------------------------------------------------------------------