%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU961^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 : n006.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:26:01 AM UTC 2026
% Result : Theorem 0.26s 0.35s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 24 ( 16 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 137 ( 11 ~; 7 |; 15 &; 83 @)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 40 ( 40 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 59 ( 13 ^; 46 !; 0 ?; 59 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
esk1_2: ( $i > $i ) > ( $i > $i ) > $i ).
thf(decl_24,type,
esk2_0: $i > $i ).
thf(decl_25,type,
esk3_0: $i > $i ).
thf(decl_26,type,
esk4_1: ( ( $i > $i ) > $o ) > $i > $i ).
thf(decl_27,type,
epred1_0: ( $i > $i ) > $o ).
thf(cTHM196C_pme,conjecture,
( ( ! [X1: $i,X2: $i] : ( X1 = X2 )
& ! [X3: $i > $i,X4: $i > $i] :
( ! [X5: $i] :
( ( X3 @ X5 )
= ( X4 @ X5 ) )
=> ( X3 = X4 ) ) )
=> ! [X6: $i > $i,X7: $i > $i] :
( ! [X8: ( $i > $i ) > $o] :
( ( ( X8 @ X6 )
& ! [X9: $i > $i] :
( ( X8 @ X9 )
=> ( X8
@ ^ [X5: $i] : ( X6 @ ( X9 @ X5 ) ) ) ) )
=> ( X8
@ ^ [X5: $i] : ( X7 @ ( X6 @ X5 ) ) ) )
=> ! [X8: ( $i > $i ) > $o] :
( ( ( X8 @ X6 )
& ! [X10: $i > $i] :
( ( X8 @ X10 )
=> ( X8
@ ^ [X5: $i] : ( X6 @ ( X10 @ X5 ) ) ) ) )
=> ( X8 @ X7 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.oTjyPtqsNA/E---3.1_828825.p',cTHM196C_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: $i,X2: $i] : ( X1 = X2 )
& ! [X3: $i > $i,X4: $i > $i] :
( ! [X5: $i] :
( ( X3 @ X5 )
= ( X4 @ X5 ) )
=> ( X3 = X4 ) ) )
=> ! [X6: $i > $i,X7: $i > $i] :
( ! [X8: ( $i > $i ) > $o] :
( ( ( X8 @ X6 )
& ! [X9: $i > $i] :
( ( X8 @ X9 )
=> ( X8
@ ^ [X5: $i] : ( X6 @ ( X9 @ X5 ) ) ) ) )
=> ( X8
@ ^ [X5: $i] : ( X7 @ ( X6 @ X5 ) ) ) )
=> ! [X8: ( $i > $i ) > $o] :
( ( ( X8 @ X6 )
& ! [X10: $i > $i] :
( ( X8 @ X10 )
=> ( X8
@ ^ [X5: $i] : ( X6 @ ( X10 @ X5 ) ) ) ) )
=> ( X8 @ X7 ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM196C_pme]) ).
thf(c_0_2,negated_conjecture,
~ ( ( ! [X1: $i,X2: $i] : ( X1 = X2 )
& ! [X3: $i > $i,X4: $i > $i] :
( ! [X5: $i] :
( ( X3 @ X5 )
= ( X4 @ X5 ) )
=> ( X3 = X4 ) ) )
=> ! [X6: $i > $i,X7: $i > $i] :
( ! [X8: ( $i > $i ) > $o] :
( ( ( X8 @ X6 )
& ! [X9: $i > $i] :
( ( X8 @ X9 )
=> ( X8
@ ^ [Z0: $i] : ( X6 @ ( X9 @ Z0 ) ) ) ) )
=> ( X8
@ ^ [Z0: $i] : ( X7 @ ( X6 @ Z0 ) ) ) )
=> ! [X8: ( $i > $i ) > $o] :
( ( ( X8 @ X6 )
& ! [X10: $i > $i] :
( ( X8 @ X10 )
=> ( X8
@ ^ [Z0: $i] : ( X6 @ ( X10 @ Z0 ) ) ) ) )
=> ( X8 @ X7 ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X22: $i,X23: $i,X24: $i > $i,X25: $i > $i,X29: ( $i > $i ) > $o,X32: $i > $i] :
( ( X22 = X23 )
& ( ( ( X24 @ ( esk1_2 @ X24 @ X25 ) )
!= ( X25 @ ( esk1_2 @ X24 @ X25 ) ) )
| ( X24 = X25 ) )
& ( ( X29 @ ( esk4_1 @ X29 ) )
| ~ ( X29 @ esk2_0 )
| ( X29
@ ^ [Z0: $i] : ( esk3_0 @ ( esk2_0 @ Z0 ) ) ) )
& ( ~ ( X29
@ ^ [Z0: $i] : ( esk2_0 @ ( esk4_1 @ X29 @ Z0 ) ) )
| ~ ( X29 @ esk2_0 )
| ( X29
@ ^ [Z0: $i] : ( esk3_0 @ ( esk2_0 @ Z0 ) ) ) )
& ( epred1_0 @ esk2_0 )
& ( ~ ( epred1_0 @ X32 )
| ( epred1_0
@ ^ [Z0: $i] : ( esk2_0 @ ( X32 @ Z0 ) ) ) )
& ~ ( epred1_0 @ esk3_0 ) ),
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,
! [X3: $i > $i,X4: $i > $i] :
( ( X3 = X4 )
| ( ( X3 @ ( esk1_2 @ X3 @ X4 ) )
!= ( X4 @ ( esk1_2 @ X3 @ X4 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i,X2: $i] : ( X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
~ ( epred1_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X3: $i > $i,X4: $i > $i] : ( X3 = X4 ),
inference(sr,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_8,negated_conjecture,
epred1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
! [X3: $i > $i] :
~ ( epred1_0 @ X3 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_8,c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU961^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.25 % Computer : n006.cluster.edu
% 0.12/0.25 % Model : x86_64 x86_64
% 0.12/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.25 % Memory : 8046.5625MB
% 0.12/0.25 % OS : Linux 6.8.0-71-generic
% 0.12/0.25 % CPULimit : 300
% 0.12/0.25 % WCLimit : 300
% 0.12/0.25 % DateTime : Tue Sep 29 14:50:54 UTC 2026
% 0.12/0.25 % CPUTime :
% 0.12/0.25 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.31 Running higher-order theorem proving
% 0.26/0.32 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.oTjyPtqsNA/E---3.1_828825.p
% 0.26/0.35 % Version: 3.5.1-ho
% 0.26/0.35 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.26/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.35 % Starting post_as_ho5 with 1500s (5) cores
% 0.26/0.35 % Starting sh2lt with 300s (1) cores
% 0.26/0.35 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.26/0.35 % Starting post_as_ho10 with 300s (1) cores
% 0.26/0.35 % ehoh_best8_lambda with pid 828840 completed with status 0
% 0.26/0.35 % Result found by ehoh_best8_lambda
% 0.26/0.35 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.26/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.35 % Starting post_as_ho5 with 1500s (5) cores
% 0.26/0.35 % Starting sh2lt with 300s (1) cores
% 0.26/0.35 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.26/0.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = Auto)
% 0.26/0.35 % No SInE strategy applied
% 0.26/0.35 % Search class: HGUSF-FFSF21-MHHFFSBN
% 0.26/0.35 % partial match(1): HGUSF-FFSF11-MHHFFSBN
% 0.26/0.35 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.35 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.35 % SubtermCWHack with pid 828843 completed with status 0
% 0.26/0.35 % Result found by SubtermCWHack
% 0.26/0.35 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.26/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.35 % Starting post_as_ho5 with 1500s (5) cores
% 0.26/0.35 % Starting sh2lt with 300s (1) cores
% 0.26/0.35 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.26/0.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = Auto)
% 0.26/0.35 % No SInE strategy applied
% 0.26/0.35 % Search class: HGUSF-FFSF21-MHHFFSBN
% 0.26/0.35 % partial match(1): HGUSF-FFSF11-MHHFFSBN
% 0.26/0.35 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.35 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.35 % Preprocessing time : 0.001 s
% 0.26/0.35
% 0.26/0.35 % Proof found!
% 0.26/0.35 % SZS status Theorem
% 0.26/0.35 % SZS output start CNFRefutation
% See solution above
% 0.26/0.35 % Parsed axioms : 1
% 0.26/0.35 % Removed by relevancy pruning/SinE : 0
% 0.26/0.35 % Initial clauses : 7
% 0.26/0.35 % Removed in clause preprocessing : 0
% 0.26/0.35 % Initial clauses in saturation : 7
% 0.26/0.35 % Processed clauses : 10
% 0.26/0.35 % ...of these trivial : 0
% 0.26/0.35 % ...subsumed : 0
% 0.26/0.35 % ...remaining for further processing : 10
% 0.26/0.35 % Other redundant clauses eliminated : 0
% 0.26/0.35 % Clauses deleted for lack of memory : 0
% 0.26/0.35 % Backward-subsumed : 3
% 0.26/0.35 % Backward-rewritten : 0
% 0.26/0.35 % Generated clauses : 17
% 0.26/0.35 % ...of the previous two non-redundant : 15
% 0.26/0.35 % ...aggressively subsumed : 0
% 0.26/0.35 % Contextual simplify-reflections : 1
% 0.26/0.35 % Paramodulations : 15
% 0.26/0.35 % Factorizations : 0
% 0.26/0.35 % NegExts : 0
% 0.26/0.35 % Equation resolutions : 0
% 0.26/0.35 % Disequality decompositions : 0
% 0.26/0.35 % Total rewrite steps : 1
% 0.26/0.35 % ...of those cached : 0
% 0.26/0.35 % Propositional unsat checks : 0
% 0.26/0.35 % Propositional check models : 0
% 0.26/0.35 % Propositional check unsatisfiable : 0
% 0.26/0.35 % Propositional clauses : 0
% 0.26/0.35 % Propositional clauses after purity: 0
% 0.26/0.35 % Propositional unsat core size : 0
% 0.26/0.35 % Propositional preprocessing time : 0.000
% 0.26/0.35 % Propositional encoding time : 0.000
% 0.26/0.35 % Propositional solver time : 0.000
% 0.26/0.35 % Success case prop preproc time : 0.000
% 0.26/0.35 % Success case prop encoding time : 0.000
% 0.26/0.35 % Success case prop solver time : 0.000
% 0.26/0.35 % Current number of processed clauses : 6
% 0.26/0.35 % Positive orientable unit clauses : 1
% 0.26/0.35 % Positive unorientable unit clauses: 2
% 0.26/0.35 % Negative unit clauses : 1
% 0.26/0.35 % Non-unit-clauses : 2
% 0.26/0.35 % Current number of unprocessed clauses: 12
% 0.26/0.35 % ...number of literals in the above : 22
% 0.26/0.35 % Current number of archived formulas : 0
% 0.26/0.35 % Current number of archived clauses : 4
% 0.26/0.35 % Clause-clause subsumption calls (NU) : 4
% 0.26/0.35 % Rec. Clause-clause subsumption calls : 4
% 0.26/0.35 % Non-unit clause-clause subsumptions : 1
% 0.26/0.35 % Unit Clause-clause subsumption calls : 10
% 0.26/0.35 % Rewrite failures with RHS unbound : 22
% 0.26/0.35 % BW rewrite match attempts : 43
% 0.26/0.35 % BW rewrite match successes : 7
% 0.26/0.35 % Condensation attempts : 0
% 0.26/0.35 % Condensation successes : 0
% 0.26/0.35 % Termbank termtop insertions : 975
% 0.26/0.35 % Search garbage collected termcells : 352
% 0.26/0.35
% 0.26/0.35 % -------------------------------------------------
% 0.26/0.35 % User time : 0.004 s
% 0.26/0.35 % System time : 0.003 s
% 0.26/0.35 % Total time : 0.006 s
% 0.26/0.35 % Maximum resident set size: 3636 pages
% 0.26/0.35
% 0.26/0.35 % -------------------------------------------------
% 0.26/0.35 % User time : 0.006 s
% 0.26/0.35 % System time : 0.008 s
% 0.26/0.35 % Total time : 0.014 s
% 0.26/0.35 % Maximum resident set size: 4864 pages
% 0.26/0.35 % E exiting
%------------------------------------------------------------------------------