%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO226^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 : n013.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:44:02 AM UTC 2026
% Result : Theorem 0.30s 0.27s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 7 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 11 ( 10 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 62 ( 6 ~; 3 |; 1 &; 48 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 8 ^; 12 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
esk1_0: $i ).
thf(decl_24,type,
esk2_0: $i ).
thf(decl_25,type,
esk3_1: ( $i > $i > $o ) > $i ).
thf(cTHM47B,conjecture,
! [X1: $i,X2: $i] :
( ! [X3: $i > $i > $o] :
( ! [X4: $i] : ( X3 @ X4 @ X4 )
=> ( X3 @ X1 @ X2 ) )
=> ( X1 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.uSXgtg7Txm/E---3.1_2351048.p',cTHM47B) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: $i,X2: $i] :
( ! [X3: $i > $i > $o] :
( ! [X4: $i] : ( X3 @ X4 @ X4 )
=> ( X3 @ X1 @ X2 ) )
=> ( X1 = X2 ) ),
inference(assume_negation,[status(cth)],[cTHM47B]) ).
thf(c_0_2,negated_conjecture,
! [X11: $i > $i > $o] :
( ( ~ ( X11 @ ( esk3_1 @ X11 ) @ ( esk3_1 @ X11 ) )
| ( X11 @ esk1_0 @ esk2_0 ) )
& ( esk1_0 != esk2_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_1])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X3: $i > $i > $o] :
( ( X3 @ esk1_0 @ esk2_0 )
| ~ ( X3 @ ( esk3_1 @ X3 ) @ ( esk3_1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X13: $i > $i > $i,X14: $i > $i > $i] :
( ( ( X13 @ esk1_0 @ esk2_0 )
= ( X14 @ esk1_0 @ esk2_0 ) )
| ( ( X13
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] :
( ( X13 @ Z0 @ Z1 )
= ( X14 @ Z0 @ Z1 ) ) )
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] :
( ( X13 @ Z0 @ Z1 )
= ( X14 @ Z0 @ Z1 ) ) ) )
!= ( X14
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] :
( ( X13 @ Z0 @ Z1 )
= ( X14 @ Z0 @ Z1 ) ) )
@ ( esk3_1
@ ^ [Z0: $i,Z1: $i] :
( ( X13 @ Z0 @ Z1 )
= ( X14 @ Z0 @ Z1 ) ) ) ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_4]),c_0_5]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO226^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n013.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 16:39:36 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.25 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.uSXgtg7Txm/E---3.1_2351048.p
% 0.30/0.27 % Version: 3.5.1-ho
% 0.30/0.27 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.30/0.27 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.27 % Starting post_as_ho12 with 300s (1) cores
% 0.30/0.27 % Starting new_bool_9 with 300s (1) cores
% 0.30/0.27 % Starting post_as_ho1 with 300s (1) cores
% 0.30/0.27 % Starting post_as_ho4 with 300s (1) cores
% 0.30/0.27 % Starting post_as_ho2 with 300s (1) cores
% 0.30/0.27 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.30/0.27 % Starting full_lambda_10 with 300s (1) cores
% 0.30/0.27 % Starting new_ho_8 with 300s (1) cores
% 0.30/0.27 % post_as_ho12 with pid 2351087 completed with status 0
% 0.30/0.27 % Result found by post_as_ho12
% 0.30/0.27 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.30/0.27 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.27 % Starting post_as_ho12 with 300s (1) cores
% 0.30/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.27 % No SInE strategy applied
% 0.30/0.27 % Search class: HHUSF-FFSF11-SSSFFMBN
% 0.30/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.30/0.27 % SubtermCWHack with pid 2351092 completed with status 10
% 0.30/0.27 % Starting post_as_ho12 with 31s (1) cores
% 0.30/0.27 % post_as_ho12 with pid 2351099 completed with status 0
% 0.30/0.27 % Result found by post_as_ho12
% 0.30/0.27 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.30/0.27 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.27 % Starting post_as_ho12 with 300s (1) cores
% 0.30/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.27 % No SInE strategy applied
% 0.30/0.27 % Search class: HHUSF-FFSF11-SSSFFMBN
% 0.30/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.30/0.27 % SubtermCWHack with pid 2351092 completed with status 10
% 0.30/0.27 % Starting post_as_ho12 with 31s (1) cores
% 0.30/0.27 % Preprocessing time : 0.001 s
% 0.30/0.27 % Presaturation interreduction done
% 0.30/0.27
% 0.30/0.27 % Proof found!
% 0.30/0.27 % SZS status Theorem
% 0.30/0.27 % SZS output start CNFRefutation
% See solution above
% 0.30/0.27 % Parsed axioms : 1
% 0.30/0.27 % Removed by relevancy pruning/SinE : 0
% 0.30/0.27 % Initial clauses : 2
% 0.30/0.27 % Removed in clause preprocessing : 0
% 0.30/0.27 % Initial clauses in saturation : 2
% 0.30/0.27 % Processed clauses : 5
% 0.30/0.27 % ...of these trivial : 0
% 0.30/0.27 % ...subsumed : 0
% 0.30/0.27 % ...remaining for further processing : 5
% 0.30/0.27 % Other redundant clauses eliminated : 0
% 0.30/0.27 % Clauses deleted for lack of memory : 0
% 0.30/0.27 % Backward-subsumed : 0
% 0.30/0.27 % Backward-rewritten : 0
% 0.30/0.27 % Generated clauses : 8
% 0.30/0.27 % ...of the previous two non-redundant : 1
% 0.30/0.27 % ...aggressively subsumed : 0
% 0.30/0.27 % Contextual simplify-reflections : 0
% 0.30/0.27 % Paramodulations : 0
% 0.30/0.27 % Factorizations : 0
% 0.30/0.27 % NegExts : 0
% 0.30/0.27 % Equation resolutions : 5
% 0.30/0.27 % Disequality decompositions : 0
% 0.30/0.27 % Total rewrite steps : 0
% 0.30/0.27 % ...of those cached : 0
% 0.30/0.27 % Propositional unsat checks : 0
% 0.30/0.27 % Propositional check models : 0
% 0.30/0.27 % Propositional check unsatisfiable : 0
% 0.30/0.27 % Propositional clauses : 0
% 0.30/0.27 % Propositional clauses after purity: 0
% 0.30/0.27 % Propositional unsat core size : 0
% 0.30/0.27 % Propositional preprocessing time : 0.000
% 0.30/0.27 % Propositional encoding time : 0.000
% 0.30/0.27 % Propositional solver time : 0.000
% 0.30/0.27 % Success case prop preproc time : 0.000
% 0.30/0.27 % Success case prop encoding time : 0.000
% 0.30/0.27 % Success case prop solver time : 0.000
% 0.30/0.27 % Current number of processed clauses : 3
% 0.30/0.27 % Positive orientable unit clauses : 0
% 0.30/0.27 % Positive unorientable unit clauses: 0
% 0.30/0.27 % Negative unit clauses : 1
% 0.30/0.27 % Non-unit-clauses : 2
% 0.30/0.27 % Current number of unprocessed clauses: 0
% 0.30/0.27 % ...number of literals in the above : 0
% 0.30/0.27 % Current number of archived formulas : 0
% 0.30/0.27 % Current number of archived clauses : 2
% 0.30/0.27 % Clause-clause subsumption calls (NU) : 0
% 0.30/0.27 % Rec. Clause-clause subsumption calls : 0
% 0.30/0.27 % Non-unit clause-clause subsumptions : 0
% 0.30/0.27 % Unit Clause-clause subsumption calls : 0
% 0.30/0.27 % Rewrite failures with RHS unbound : 0
% 0.30/0.27 % BW rewrite match attempts : 0
% 0.30/0.27 % BW rewrite match successes : 0
% 0.30/0.27 % Condensation attempts : 0
% 0.30/0.27 % Condensation successes : 0
% 0.30/0.27 % Termbank termtop insertions : 534
% 0.30/0.27 % Search garbage collected termcells : 76
% 0.30/0.27
% 0.30/0.27 % -------------------------------------------------
% 0.30/0.27 % User time : 0.003 s
% 0.30/0.27 % System time : 0.002 s
% 0.30/0.27 % Total time : 0.005 s
% 0.30/0.27 % Maximum resident set size: 3628 pages
% 0.30/0.27
% 0.30/0.27 % -------------------------------------------------
% 0.30/0.27 % User time : 0.005 s
% 0.30/0.27 % System time : 0.007 s
% 0.30/0.27 % Total time : 0.012 s
% 0.30/0.27 % Maximum resident set size: 4864 pages
% 0.30/0.27 % E exiting
%------------------------------------------------------------------------------