%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO263^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 : n007.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:06 AM UTC 2026
% Result : Theorem 1.99s 0.53s
% Output : CNFRefutation 1.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 59 ( 0 equ; 0 cnn)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 493 ( 101 ~; 107 |; 21 &; 262 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 10 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 49 ( 14 ^; 31 !; 4 ?; 49 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
esk1_0: $i ).
thf(decl_24,type,
esk2_0: $i ).
thf(decl_25,type,
esk3_0: $i ).
thf(decl_26,type,
epred1_0: $i > $o ).
thf(decl_27,type,
esk4_2: ( $i > $o ) > ( $i > $o ) > $i ).
thf(cTHM125D,conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i > $o] :
? [X5: $i > $o,X6: $i > $o] :
( ( ( X6 @ X1 )
| ( X5 @ X1 ) )
& ( ( X4 @ X2 )
| ( X6 @ X2 ) )
& ( ( X5 @ X3 )
| ~ ( X4 @ X3 ) )
& ! [X7: $i] :
( ( X6 @ X7 )
<=> ~ ( X4 @ X7 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.5wIE7tS0TZ/E---3.1_3619810.p',cTHM125D) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: $i,X2: $i,X3: $i,X4: $i > $o] :
? [X5: $i > $o,X6: $i > $o] :
( ( ( X6 @ X1 )
| ( X5 @ X1 ) )
& ( ( X4 @ X2 )
| ( X6 @ X2 ) )
& ( ( X5 @ X3 )
| ~ ( X4 @ X3 ) )
& ! [X7: $i] :
( ( X6 @ X7 )
<=> ~ ( X4 @ X7 ) ) ),
inference(assume_negation,[status(cth)],[cTHM125D]) ).
thf(c_0_2,negated_conjecture,
! [X19: $i > $o,X20: $i > $o] :
( ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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,
! [X4: $i > $o,X5: $i > $o] :
( ( epred1_0 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X4 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X5 @ esk3_0 )
| ~ ( X4 @ esk2_0 )
| ~ ( X5 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X4: $i > $o,X5: $i > $o] :
( ( X4 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X5 @ esk3_0 )
| ~ ( X4 @ esk2_0 )
| ~ ( X5 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X5: $i > $o,X4: $i > $o] :
( ( epred1_0
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ( X5
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ( X5 @ esk2_0 )
| ~ ( X4 @ esk1_0 )
| ~ ( X4 @ esk3_0 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X4: $i > $o,X5: $i > $o] :
( ( epred1_0 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X4 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X5 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X5 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X4: $i > $o] :
( ( X4
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ X4 ) )
| ~ ( epred1_0
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ X4 ) )
| ~ ( X4 @ esk2_0 ) ),
inference(primitive_enumeration,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X4: $i > $o] :
( ( epred1_0
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( epred1_0 @ Z0 ) ) )
| ( epred1_0 @ esk2_0 )
| ~ ( X4 @ esk1_0 )
| ~ ( X4 @ esk3_0 ) ),
inference(ef,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X4: $i > $o,X5: $i > $o] :
( ( X4 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X5 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X5 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
! [X5: $i > $o,X4: $i > $o] :
( ( epred1_0
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ( X5
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X4 @ esk1_0 )
| ~ ( X4 @ esk3_0 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6]) ).
thf(c_0_11,negated_conjecture,
epred1_0 @ esk2_0,
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8])])]) ).
thf(c_0_12,negated_conjecture,
! [X4: $i > $o] :
( ( X4
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ X4 ) )
| ~ ( epred1_0
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ X4 ) )
| ~ ( epred1_0 @ esk2_0 ) ),
inference(primitive_enumeration,[status(thm)],[c_0_9]) ).
thf(c_0_13,negated_conjecture,
! [X5: $i > $o,X4: $i > $o] :
( ( epred1_0
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ( X5
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ~ ( X4 @ esk1_0 )
| ~ ( X4 @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
thf(c_0_14,negated_conjecture,
! [X4: $i > $o] :
( ( X4
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ X4 ) )
| ~ ( epred1_0
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ X4 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11])]) ).
thf(c_0_15,negated_conjecture,
! [X4: $i > $o] :
( ( epred1_0
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( epred1_0 @ Z0 ) ) )
| ~ ( X4 @ esk1_0 )
| ~ ( X4 @ esk3_0 ) ),
inference(ef,[status(thm)],[c_0_13]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15])])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO263^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.05/0.17 % Computer : n007.cluster.edu
% 0.05/0.17 % Model : x86_64 x86_64
% 0.05/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.17 % Memory : 8046.5625MB
% 0.05/0.17 % OS : Linux 6.8.0-71-generic
% 0.05/0.17 % CPULimit : 300
% 0.05/0.17 % WCLimit : 300
% 0.05/0.17 % DateTime : Tue Sep 29 16:40:10 UTC 2026
% 0.05/0.17 % CPUTime :
% 0.05/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/0.21 Running higher-order theorem proving
% 0.05/0.22 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.5wIE7tS0TZ/E---3.1_3619810.p
% 1.99/0.53 % Version: 3.5.1-ho
% 1.99/0.53 % Preprocessing class: HSSSSMSSSSSNSSA.
% 1.99/0.53 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 1.99/0.53 % Starting post_as_ho12 with 300s (1) cores
% 1.99/0.53 % Starting new_bool_9 with 300s (1) cores
% 1.99/0.53 % Starting post_as_ho1 with 300s (1) cores
% 1.99/0.53 % Starting post_as_ho4 with 300s (1) cores
% 1.99/0.53 % Starting post_as_ho2 with 300s (1) cores
% 1.99/0.53 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 1.99/0.53 % Starting full_lambda_10 with 300s (1) cores
% 1.99/0.53 % Starting new_ho_8 with 300s (1) cores
% 1.99/0.53 % post_as_ho12 with pid 3619823 completed with status 0
% 1.99/0.53 % Result found by post_as_ho12
% 1.99/0.53 % Preprocessing class: HSSSSMSSSSSNSSA.
% 1.99/0.53 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 1.99/0.53 % Starting post_as_ho12 with 300s (1) cores
% 1.99/0.53 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.99/0.53 % No SInE strategy applied
% 1.99/0.53 % Search class: HGUNF-FFMF22-SSSFFMBN
% 1.99/0.53 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.99/0.53 % Starting SubtermCWHack with 28s (1) cores
% 1.99/0.53 % SubtermCWHack with pid 3619832 completed with status 10
% 1.99/0.53 % Starting post_as_ho12 with 31s (1) cores
% 1.99/0.53 % post_as_ho12 with pid 3619840 completed with status 10
% 1.99/0.53 % Starting new_bool_2 with 28s (1) cores
% 1.99/0.53 % new_bool_2 with pid 3619849 completed with status 0
% 1.99/0.53 % Result found by new_bool_2
% 1.99/0.53 % Preprocessing class: HSSSSMSSSSSNSSA.
% 1.99/0.53 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 1.99/0.53 % Starting post_as_ho12 with 300s (1) cores
% 1.99/0.53 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.99/0.53 % No SInE strategy applied
% 1.99/0.53 % Search class: HGUNF-FFMF22-SSSFFMBN
% 1.99/0.53 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.99/0.53 % Starting SubtermCWHack with 28s (1) cores
% 1.99/0.53 % SubtermCWHack with pid 3619832 completed with status 10
% 1.99/0.53 % Starting post_as_ho12 with 31s (1) cores
% 1.99/0.53 % post_as_ho12 with pid 3619840 completed with status 10
% 1.99/0.53 % Starting new_bool_2 with 28s (1) cores
% 1.99/0.53 % Preprocessing time : 0.001 s
% 1.99/0.53 % Presaturation interreduction done
% 1.99/0.53
% 1.99/0.53 % Proof found!
% 1.99/0.53 % SZS status Theorem
% 1.99/0.53 % SZS output start CNFRefutation
% See solution above
% 1.99/0.53 % Parsed axioms : 1
% 1.99/0.53 % Removed by relevancy pruning/SinE : 0
% 1.99/0.53 % Initial clauses : 16
% 1.99/0.53 % Removed in clause preprocessing : 0
% 1.99/0.53 % Initial clauses in saturation : 16
% 1.99/0.53 % Processed clauses : 1019
% 1.99/0.53 % ...of these trivial : 118
% 1.99/0.53 % ...subsumed : 272
% 1.99/0.53 % ...remaining for further processing : 629
% 1.99/0.53 % Other redundant clauses eliminated : 3576
% 1.99/0.53 % Clauses deleted for lack of memory : 0
% 1.99/0.53 % Backward-subsumed : 76
% 1.99/0.53 % Backward-rewritten : 307
% 1.99/0.53 % Generated clauses : 8358
% 1.99/0.53 % ...of the previous two non-redundant : 4443
% 1.99/0.53 % ...aggressively subsumed : 0
% 1.99/0.53 % Contextual simplify-reflections : 0
% 1.99/0.53 % Paramodulations : 408
% 1.99/0.53 % Factorizations : 14
% 1.99/0.53 % NegExts : 125
% 1.99/0.53 % Equation resolutions : 3585
% 1.99/0.53 % Disequality decompositions : 0
% 1.99/0.53 % Total rewrite steps : 500
% 1.99/0.53 % ...of those cached : 497
% 1.99/0.53 % Propositional unsat checks : 0
% 1.99/0.53 % Propositional check models : 0
% 1.99/0.53 % Propositional check unsatisfiable : 0
% 1.99/0.53 % Propositional clauses : 0
% 1.99/0.53 % Propositional clauses after purity: 0
% 1.99/0.53 % Propositional unsat core size : 0
% 1.99/0.53 % Propositional preprocessing time : 0.000
% 1.99/0.53 % Propositional encoding time : 0.000
% 1.99/0.53 % Propositional solver time : 0.000
% 1.99/0.53 % Success case prop preproc time : 0.000
% 1.99/0.53 % Success case prop encoding time : 0.000
% 1.99/0.53 % Success case prop solver time : 0.000
% 1.99/0.53 % Current number of processed clauses : 142
% 1.99/0.53 % Positive orientable unit clauses : 3
% 1.99/0.53 % Positive unorientable unit clauses: 0
% 1.99/0.53 % Negative unit clauses : 0
% 1.99/0.53 % Non-unit-clauses : 139
% 1.99/0.53 % Current number of unprocessed clauses: 3326
% 1.99/0.53 % ...number of literals in the above : 25710
% 1.99/0.53 % Current number of archived formulas : 0
% 1.99/0.53 % Current number of archived clauses : 487
% 1.99/0.53 % Clause-clause subsumption calls (NU) : 25609
% 1.99/0.53 % Rec. Clause-clause subsumption calls : 1750
% 1.99/0.53 % Non-unit clause-clause subsumptions : 347
% 1.99/0.53 % Unit Clause-clause subsumption calls : 89
% 1.99/0.53 % Rewrite failures with RHS unbound : 0
% 1.99/0.53 % BW rewrite match attempts : 3
% 1.99/0.53 % BW rewrite match successes : 3
% 1.99/0.53 % Condensation attempts : 0
% 1.99/0.53 % Condensation successes : 0
% 1.99/0.53 % Termbank termtop insertions : 1336877
% 1.99/0.53 % Search garbage collected termcells : 238
% 1.99/0.53
% 1.99/0.53 % -------------------------------------------------
% 1.99/0.53 % User time : 0.283 s
% 1.99/0.53 % System time : 0.008 s
% 1.99/0.53 % Total time : 0.291 s
% 1.99/0.53 % Maximum resident set size: 3632 pages
% 1.99/0.53
% 1.99/0.53 % -------------------------------------------------
% 1.99/0.53 % User time : 0.284 s
% 1.99/0.53 % System time : 0.014 s
% 1.99/0.53 % Total time : 0.298 s
% 1.99/0.53 % Maximum resident set size: 4864 pages
% 1.99/0.53 % E exiting
%------------------------------------------------------------------------------