%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO277^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 : 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:42:41 AM UTC 2026
% Result : Theorem 0.31s 0.26s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 26 ( 4 equ; 0 cnn)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 106 ( 17 ~; 18 |; 4 &; 61 @)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 0 ^; 19 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
esk1_0: $i ).
thf(decl_24,type,
esk2_0: $i ).
thf(decl_25,type,
epred1_0: $i > $o ).
thf(decl_26,type,
epred2_0: $i > $i > $o ).
thf(decl_27,type,
esk3_1: ( $i > $i > $o ) > $i ).
thf(cTHM47D,conjecture,
! [X1: $i,X2: $i] :
( ! [X3: $i > $o] :
( ( X3 @ X1 )
=> ( X3 @ X2 ) )
<=> ! [X4: $i > $i > $o] :
( ! [X5: $i] : ( X4 @ X5 @ X5 )
=> ( X4 @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.BhVAxAAMkW/E---3.1_1033474.p',cTHM47D) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: $i,X2: $i] :
( ! [X3: $i > $o] :
( ( X3 @ X1 )
=> ( X3 @ X2 ) )
<=> ! [X4: $i > $i > $o] :
( ! [X5: $i] : ( X4 @ X5 @ X5 )
=> ( X4 @ X1 @ X2 ) ) ),
inference(assume_negation,[status(cth)],[cTHM47D]) ).
thf(c_0_2,negated_conjecture,
! [X15: $i,X16: $i > $o,X17: $i > $i > $o] :
( ( ( epred2_0 @ X15 @ X15 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ esk1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred2_0 @ X15 @ X15 )
| ~ ( epred1_0 @ esk2_0 ) )
& ( ~ ( epred2_0 @ esk1_0 @ esk2_0 )
| ~ ( epred1_0 @ esk2_0 ) )
& ( ~ ( X16 @ esk1_0 )
| ( X16 @ esk2_0 )
| ~ ( X17 @ ( esk3_1 @ X17 ) @ ( esk3_1 @ X17 ) )
| ( X17 @ esk1_0 @ esk2_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_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X3: $i > $o,X4: $i > $i > $o] :
( ( X3 @ esk2_0 )
| ( X4 @ esk1_0 @ esk2_0 )
| ~ ( X3 @ esk1_0 )
| ~ ( X4 @ ( esk3_1 @ X4 ) @ ( esk3_1 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X3: $i > $o] :
( ( esk1_0 = esk2_0 )
| ( X3 @ esk2_0 )
| ~ ( X3 @ esk1_0 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i] :
( ( epred2_0 @ X1 @ X1 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i] :
( ( epred2_0 @ X1 @ X1 )
| ~ ( epred1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
( ~ ( epred2_0 @ esk1_0 @ esk2_0 )
| ~ ( epred1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
( ( esk1_0 = esk2_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
thf(c_0_10,negated_conjecture,
( ( esk1_0 = esk2_0 )
| ~ ( epred1_0 @ esk2_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_7]),c_0_8]) ).
thf(c_0_11,negated_conjecture,
esk1_0 = esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_9]),c_0_10]) ).
thf(c_0_12,negated_conjecture,
~ ( epred1_0 @ esk2_0 ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_11]),c_0_7]) ).
thf(c_0_13,negated_conjecture,
~ ( epred2_0 @ esk2_0 @ esk2_0 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_11]),c_0_11]),c_0_12]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i] : ( epred2_0 @ X1 @ X1 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_11]),c_0_12]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO277^5 : TPTP v9.3.1. Released v4.0.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 16:42:47 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.22 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.BhVAxAAMkW/E---3.1_1033474.p
% 0.31/0.26 % Version: 3.5.1-ho
% 0.31/0.26 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.31/0.26 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.26 % Starting post_as_ho12 with 300s (1) cores
% 0.31/0.26 % Starting new_bool_9 with 300s (1) cores
% 0.31/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.31/0.26 % Starting post_as_ho4 with 300s (1) cores
% 0.31/0.26 % Starting post_as_ho2 with 300s (1) cores
% 0.31/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.31/0.26 % Starting full_lambda_10 with 300s (1) cores
% 0.31/0.26 % Starting new_ho_8 with 300s (1) cores
% 0.31/0.26 % post_as_ho2 with pid 1033505 completed with status 0
% 0.31/0.26 % Result found by post_as_ho2
% 0.31/0.26 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.31/0.26 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.26 % Starting post_as_ho12 with 300s (1) cores
% 0.31/0.26 % Starting new_bool_9 with 300s (1) cores
% 0.31/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.31/0.26 % Starting post_as_ho4 with 300s (1) cores
% 0.31/0.26 % Starting post_as_ho2 with 300s (1) cores
% 0.31/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.26 % No SInE strategy applied
% 0.31/0.26 % Search class: HGHNF-FFSF11-SSSFFSBN
% 0.31/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.31/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.31/0.26 % SubtermCWHack with pid 1033510 completed with status 10
% 0.31/0.26 % Starting post_as_ho2 with 31s (1) cores
% 0.31/0.26 % post_as_ho2 with pid 1033515 completed with status 10
% 0.31/0.26 % Starting sh2lt with 28s (1) cores
% 0.31/0.26 % sh2lt with pid 1033523 completed with status 0
% 0.31/0.26 % Result found by sh2lt
% 0.31/0.26 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.31/0.26 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.26 % Starting post_as_ho12 with 300s (1) cores
% 0.31/0.26 % Starting new_bool_9 with 300s (1) cores
% 0.31/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.31/0.26 % Starting post_as_ho4 with 300s (1) cores
% 0.31/0.26 % Starting post_as_ho2 with 300s (1) cores
% 0.31/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.26 % No SInE strategy applied
% 0.31/0.26 % Search class: HGHNF-FFSF11-SSSFFSBN
% 0.31/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.31/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.31/0.26 % SubtermCWHack with pid 1033510 completed with status 10
% 0.31/0.26 % Starting post_as_ho2 with 31s (1) cores
% 0.31/0.26 % post_as_ho2 with pid 1033515 completed with status 10
% 0.31/0.26 % Starting sh2lt with 28s (1) cores
% 0.31/0.26 % Preprocessing time : 0.001 s
% 0.31/0.26 % Presaturation interreduction done
% 0.31/0.26
% 0.31/0.26 % Proof found!
% 0.31/0.26 % SZS status Theorem
% 0.31/0.26 % SZS output start CNFRefutation
% See solution above
% 0.31/0.26 % Parsed axioms : 1
% 0.31/0.26 % Removed by relevancy pruning/SinE : 0
% 0.31/0.26 % Initial clauses : 5
% 0.31/0.26 % Removed in clause preprocessing : 0
% 0.31/0.26 % Initial clauses in saturation : 5
% 0.31/0.26 % Processed clauses : 17
% 0.31/0.26 % ...of these trivial : 0
% 0.31/0.26 % ...subsumed : 0
% 0.31/0.26 % ...remaining for further processing : 17
% 0.31/0.26 % Other redundant clauses eliminated : 0
% 0.31/0.26 % Clauses deleted for lack of memory : 0
% 0.31/0.26 % Backward-subsumed : 1
% 0.31/0.26 % Backward-rewritten : 8
% 0.31/0.26 % Generated clauses : 17
% 0.31/0.26 % ...of the previous two non-redundant : 14
% 0.31/0.26 % ...aggressively subsumed : 0
% 0.31/0.26 % Contextual simplify-reflections : 4
% 0.31/0.26 % Paramodulations : 5
% 0.31/0.26 % Factorizations : 0
% 0.31/0.26 % NegExts : 0
% 0.31/0.26 % Equation resolutions : 0
% 0.31/0.26 % Disequality decompositions : 0
% 0.31/0.26 % Total rewrite steps : 12
% 0.31/0.26 % ...of those cached : 10
% 0.31/0.26 % Propositional unsat checks : 0
% 0.31/0.26 % Propositional check models : 0
% 0.31/0.26 % Propositional check unsatisfiable : 0
% 0.31/0.26 % Propositional clauses : 0
% 0.31/0.26 % Propositional clauses after purity: 0
% 0.31/0.26 % Propositional unsat core size : 0
% 0.31/0.26 % Propositional preprocessing time : 0.000
% 0.31/0.26 % Propositional encoding time : 0.000
% 0.31/0.26 % Propositional solver time : 0.000
% 0.31/0.26 % Success case prop preproc time : 0.000
% 0.31/0.26 % Success case prop encoding time : 0.000
% 0.31/0.27 % Success case prop solver time : 0.000
% 0.31/0.27 % Current number of processed clauses : 3
% 0.31/0.27 % Positive orientable unit clauses : 2
% 0.31/0.27 % Positive unorientable unit clauses: 0
% 0.31/0.27 % Negative unit clauses : 1
% 0.31/0.27 % Non-unit-clauses : 0
% 0.31/0.27 % Current number of unprocessed clauses: 7
% 0.31/0.27 % ...number of literals in the above : 23
% 0.31/0.27 % Current number of archived formulas : 0
% 0.31/0.27 % Current number of archived clauses : 14
% 0.31/0.27 % Clause-clause subsumption calls (NU) : 10
% 0.31/0.27 % Rec. Clause-clause subsumption calls : 8
% 0.31/0.27 % Non-unit clause-clause subsumptions : 4
% 0.31/0.27 % Unit Clause-clause subsumption calls : 1
% 0.31/0.27 % Rewrite failures with RHS unbound : 0
% 0.31/0.27 % BW rewrite match attempts : 2
% 0.31/0.27 % BW rewrite match successes : 2
% 0.31/0.27 % Condensation attempts : 0
% 0.31/0.27 % Condensation successes : 0
% 0.31/0.27 % Termbank termtop insertions : 850
% 0.31/0.27 % Search garbage collected termcells : 172
% 0.31/0.27
% 0.31/0.27 % -------------------------------------------------
% 0.31/0.27 % User time : 0.005 s
% 0.31/0.27 % System time : 0.003 s
% 0.31/0.27 % Total time : 0.008 s
% 0.31/0.27 % Maximum resident set size: 3580 pages
% 0.31/0.27
% 0.31/0.27 % -------------------------------------------------
% 0.31/0.27 % User time : 0.007 s
% 0.31/0.27 % System time : 0.007 s
% 0.31/0.27 % Total time : 0.014 s
% 0.31/0.27 % Maximum resident set size: 4864 pages
% 0.31/0.27 % E exiting
%------------------------------------------------------------------------------