%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU455^1 : TPTP v9.3.1. Released v3.6.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:04 AM UTC 2026
% Result : Theorem 0.22s 0.28s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 28 ( 11 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 54 ( 5 ~; 3 |; 2 &; 39 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 35 ( 35 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 27 ( 13 ^; 14 !; 0 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(decl_26,type,
infl: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(decl_30,type,
rc: ( $i > $i > $o ) > $i > $i > $o ).
thf(decl_52,type,
epred1_0: $i > $i > $o ).
thf(decl_53,type,
esk1_0: $i ).
thf(decl_54,type,
esk2_0: $i ).
thf(inflationary,axiom,
( infl
= ( ^ [X5: ( $i > $i > $o ) > $i > $i > $o] :
! [X1: $i > $i > $o] : ( subrel @ X1 @ ( X5 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.FN7WRs2zGe/E---3.1_730228.p',inflationary) ).
thf(subrel,axiom,
( subrel
= ( ^ [X1: $i > $i > $o,X2: $i > $i > $o] :
! [X3: $i,X4: $i] :
( ( X1 @ X3 @ X4 )
=> ( X2 @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.FN7WRs2zGe/E---3.1_730228.p',subrel) ).
thf(reflexive_closure_op_is_inflationary,conjecture,
infl @ rc,
file('/export/starexec/sandbox2/tmp/tmp.FN7WRs2zGe/E---3.1_730228.p',reflexive_closure_op_is_inflationary) ).
thf(reflexive_closure,axiom,
( rc
= ( ^ [X1: $i > $i > $o,X3: $i,X4: $i] :
( ( X3 = X4 )
| ( X1 @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.FN7WRs2zGe/E---3.1_730228.p',reflexive_closure) ).
thf(c_0_4,plain,
( infl
= ( ^ [Z0: ( $i > $i > $o ) > $i > $i > $o] :
! [X1: $i > $i > $o,X9: $i,X10: $i] :
( ( X1 @ X9 @ X10 )
=> ( Z0 @ X1 @ X9 @ X10 ) ) ) ),
inference(fof_simplification,[status(thm)],[inflationary]) ).
thf(c_0_5,plain,
( subrel
= ( ^ [Z0: $i > $i > $o,Z1: $i > $i > $o] :
! [X3: $i,X4: $i] :
( ( Z0 @ X3 @ X4 )
=> ( Z1 @ X3 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[subrel]) ).
thf(c_0_6,negated_conjecture,
~ ( infl @ rc ),
inference(assume_negation,[status(cth)],[reflexive_closure_op_is_inflationary]) ).
thf(c_0_7,plain,
( infl
= ( ^ [Z0: ( $i > $i > $o ) > $i > $i > $o] :
! [X1: $i > $i > $o,X9: $i,X10: $i] :
( ( X1 @ X9 @ X10 )
=> ( Z0 @ X1 @ X9 @ X10 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_8,plain,
( rc
= ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] :
( ( Z1 = Z2 )
| ( Z0 @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[reflexive_closure]) ).
thf(c_0_9,negated_conjecture,
~ ! [X157: $i > $i > $o,X158: $i,X159: $i] :
( ( X157 @ X158 @ X159 )
=> ( ( X158 = X159 )
| ( X157 @ X158 @ X159 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
thf(c_0_10,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk2_0 )
& ( esk1_0 != esk2_0 )
& ~ ( epred1_0 @ esk1_0 @ esk2_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
thf(c_0_11,negated_conjecture,
~ ( epred1_0 @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_12,negated_conjecture,
epred1_0 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU455^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n006.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 13:41:25 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running higher-order theorem proving
% 0.09/0.26 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.FN7WRs2zGe/E---3.1_730228.p
% 0.22/0.28 % Version: 3.5.1-ho
% 0.22/0.28 % Preprocessing class: HSSSSMSSMLSNHHN.
% 0.22/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.28 % Starting new_ho_10 with 1500s (5) cores
% 0.22/0.28 % Starting pre_casc_5 with 300s (1) cores
% 0.22/0.28 % Starting post_as_ho11 with 300s (1) cores
% 0.22/0.28 % Starting ho_unfolding_1 with 300s (1) cores
% 0.22/0.28 % new_ho_10 with pid 730263 completed with status 0
% 0.22/0.28 % Result found by new_ho_10
% 0.22/0.28 % Preprocessing class: HSSSSMSSMLSNHHN.
% 0.22/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.28 % Starting new_ho_10 with 1500s (5) cores
% 0.22/0.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.28 % No SInE strategy applied
% 0.22/0.28 % Search class: HUUSF-FFSF00-SHHSMFNN
% 0.22/0.28 % partial match(2): HUUNF-FFSF00-SHSSMFNN
% 0.22/0.28 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.28 % Starting SubtermCWHack with 151s (1) cores
% 0.22/0.28 % Starting new_ho_10 with 901s (1) cores
% 0.22/0.28 % Starting sh5l with 151s (1) cores
% 0.22/0.28 % Starting ehoh_best_sine_rwall with 151s (1) cores
% 0.22/0.28 % Starting lpo1_def_fix with 146s (1) cores
% 0.22/0.28 % SubtermCWHack with pid 730268 completed with status 0
% 0.22/0.28 % Result found by SubtermCWHack
% 0.22/0.28 % Preprocessing class: HSSSSMSSMLSNHHN.
% 0.22/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.28 % Starting new_ho_10 with 1500s (5) cores
% 0.22/0.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.28 % No SInE strategy applied
% 0.22/0.28 % Search class: HUUSF-FFSF00-SHHSMFNN
% 0.22/0.28 % partial match(2): HUUNF-FFSF00-SHSSMFNN
% 0.22/0.28 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.28 % Starting SubtermCWHack with 151s (1) cores
% 0.22/0.28 % Preprocessing time : 0.001 s
% 0.22/0.28
% 0.22/0.28 % Proof found!
% 0.22/0.28 % SZS status Theorem
% 0.22/0.28 % SZS output start CNFRefutation
% See solution above
% 0.22/0.28 % Parsed axioms : 59
% 0.22/0.28 % Removed by relevancy pruning/SinE : 0
% 0.22/0.28 % Initial clauses : 32
% 0.22/0.28 % Removed in clause preprocessing : 29
% 0.22/0.28 % Initial clauses in saturation : 3
% 0.22/0.28 % Processed clauses : 3
% 0.22/0.28 % ...of these trivial : 0
% 0.22/0.28 % ...subsumed : 0
% 0.22/0.28 % ...remaining for further processing : 2
% 0.22/0.28 % Other redundant clauses eliminated : 0
% 0.22/0.28 % Clauses deleted for lack of memory : 0
% 0.22/0.28 % Backward-subsumed : 0
% 0.22/0.28 % Backward-rewritten : 0
% 0.22/0.28 % Generated clauses : 0
% 0.22/0.28 % ...of the previous two non-redundant : 0
% 0.22/0.28 % ...aggressively subsumed : 0
% 0.22/0.28 % Contextual simplify-reflections : 0
% 0.22/0.28 % Paramodulations : 0
% 0.22/0.28 % Factorizations : 0
% 0.22/0.28 % NegExts : 0
% 0.22/0.28 % Equation resolutions : 0
% 0.22/0.28 % Disequality decompositions : 0
% 0.22/0.28 % Total rewrite steps : 1
% 0.22/0.28 % ...of those cached : 0
% 0.22/0.28 % Propositional unsat checks : 0
% 0.22/0.28 % Propositional check models : 0
% 0.22/0.28 % Propositional check unsatisfiable : 0
% 0.22/0.28 % Propositional clauses : 0
% 0.22/0.28 % Propositional clauses after purity: 0
% 0.22/0.28 % Propositional unsat core size : 0
% 0.22/0.28 % Propositional preprocessing time : 0.000
% 0.22/0.28 % Propositional encoding time : 0.000
% 0.22/0.28 % Propositional solver time : 0.000
% 0.22/0.28 % Success case prop preproc time : 0.000
% 0.22/0.28 % Success case prop encoding time : 0.000
% 0.22/0.28 % Success case prop solver time : 0.000
% 0.22/0.28 % Current number of processed clauses : 2
% 0.22/0.28 % Positive orientable unit clauses : 1
% 0.22/0.28 % Positive unorientable unit clauses: 0
% 0.22/0.28 % Negative unit clauses : 1
% 0.22/0.28 % Non-unit-clauses : 0
% 0.22/0.28 % Current number of unprocessed clauses: 0
% 0.22/0.28 % ...number of literals in the above : 0
% 0.22/0.28 % Current number of archived formulas : 0
% 0.22/0.28 % Current number of archived clauses : 0
% 0.22/0.28 % Clause-clause subsumption calls (NU) : 0
% 0.22/0.28 % Rec. Clause-clause subsumption calls : 0
% 0.22/0.28 % Non-unit clause-clause subsumptions : 0
% 0.22/0.28 % Unit Clause-clause subsumption calls : 0
% 0.22/0.28 % Rewrite failures with RHS unbound : 0
% 0.22/0.28 % BW rewrite match attempts : 0
% 0.22/0.28 % BW rewrite match successes : 0
% 0.22/0.28 % Condensation attempts : 0
% 0.22/0.28 % Condensation successes : 0
% 0.22/0.28 % Termbank termtop insertions : 2766
% 0.22/0.28 % Search garbage collected termcells : 598
% 0.22/0.28
% 0.22/0.28 % -------------------------------------------------
% 0.22/0.28 % User time : 0.004 s
% 0.22/0.28 % System time : 0.002 s
% 0.22/0.28 % Total time : 0.006 s
% 0.22/0.28 % Maximum resident set size: 3940 pages
% 0.22/0.28
% 0.22/0.28 % -------------------------------------------------
% 0.22/0.28 % User time : 0.012 s
% 0.22/0.28 % System time : 0.010 s
% 0.22/0.28 % Total time : 0.022 s
% 0.22/0.28 % Maximum resident set size: 4864 pages
% 0.22/0.28 % E exiting
%------------------------------------------------------------------------------