%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM640^4 : TPTP v9.3.1. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:16:39 AM UTC 2026
% Result : Theorem 0.23s 0.32s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 57 ( 19 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 138 ( 8 ~; 4 |; 2 &; 117 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 43 ( 32 ^; 11 !; 0 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
is_of: $i > ( $i > $o ) > $o ).
thf(decl_24,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_26,type,
in: $i > $i > $o ).
thf(decl_48,type,
ordsucc: $i > $i ).
thf(decl_78,type,
e_is: $i > $i > $i > $o ).
thf(decl_124,type,
nat: $i ).
thf(decl_125,type,
n_is: $i > $i > $o ).
thf(decl_143,type,
n_pl: $i > $i > $i ).
thf(decl_144,type,
esk1_0: $i ).
thf(decl_145,type,
esk2_0: $i ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mTGoPPJ8RK/E---3.1_8889.p',def_e_is) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X3: $i > $o,X2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ X3 )
=> ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mTGoPPJ8RK/E---3.1_8889.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mTGoPPJ8RK/E---3.1_8889.p',def_is_of) ).
thf(satz4f,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X189: $i] : ( in @ X189 @ nat )
@ ^ [X190: $i] : ( n_is @ ( ordsucc @ ( n_pl @ X1 @ X190 ) ) @ ( n_pl @ X1 @ ( ordsucc @ X190 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mTGoPPJ8RK/E---3.1_8889.p',satz4f) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mTGoPPJ8RK/E---3.1_8889.p',def_n_is) ).
thf(satz4b,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X185: $i] : ( in @ X185 @ nat )
@ ^ [X186: $i] : ( n_is @ ( n_pl @ X1 @ ( ordsucc @ X186 ) ) @ ( ordsucc @ ( n_pl @ X1 @ X186 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mTGoPPJ8RK/E---3.1_8889.p',satz4b) ).
thf(c_0_6,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_7,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_all_of]) ).
thf(c_0_8,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_9,negated_conjecture,
~ ( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X189: $i] : ( in @ X189 @ nat )
@ ^ [X190: $i] : ( n_is @ ( ordsucc @ ( n_pl @ X1 @ X190 ) ) @ ( n_pl @ X1 @ ( ordsucc @ X190 ) ) ) ) ),
inference(assume_negation,[status(cth)],[satz4f]) ).
thf(c_0_10,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_6]) ).
thf(c_0_11,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_12,negated_conjecture,
~ ! [X352: $i] :
( ( in @ X352 @ nat )
=> ! [X351: $i] :
( ( in @ X351 @ nat )
=> ( ( ordsucc @ ( n_pl @ X352 @ X351 ) )
= ( n_pl @ X352 @ ( ordsucc @ X351 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_9]),c_0_10]),c_0_11]) ).
thf(c_0_13,plain,
! [X368: $i] :
( ( in @ X368 @ nat )
=> ! [X367: $i] :
( ( in @ X367 @ nat )
=> ( ( n_pl @ X368 @ ( ordsucc @ X367 ) )
= ( ordsucc @ ( n_pl @ X368 @ X367 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz4b]),c_0_10]),c_0_11]) ).
thf(c_0_14,negated_conjecture,
( ( in @ esk1_0 @ nat )
& ( in @ esk2_0 @ nat )
& ( ( ordsucc @ ( n_pl @ esk1_0 @ esk2_0 ) )
!= ( n_pl @ esk1_0 @ ( ordsucc @ esk2_0 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
thf(c_0_15,plain,
! [X456: $i,X457: $i] :
( ~ ( in @ X456 @ nat )
| ~ ( in @ X457 @ nat )
| ( ( n_pl @ X456 @ ( ordsucc @ X457 ) )
= ( ordsucc @ ( n_pl @ X456 @ X457 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
thf(c_0_16,negated_conjecture,
( ( ordsucc @ ( n_pl @ esk1_0 @ esk2_0 ) )
!= ( n_pl @ esk1_0 @ ( ordsucc @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_17,plain,
! [X1: $i,X4: $i] :
( ( ( n_pl @ X1 @ ( ordsucc @ X4 ) )
= ( ordsucc @ ( n_pl @ X1 @ X4 ) ) )
| ~ ( in @ X1 @ nat )
| ~ ( in @ X4 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_18,negated_conjecture,
in @ esk2_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_19,negated_conjecture,
in @ esk1_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM640^4 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.17 % Computer : n011.cluster.edu
% 0.11/0.17 % Model : x86_64 x86_64
% 0.11/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17 % Memory : 8046.5625MB
% 0.11/0.17 % OS : Linux 6.8.0-71-generic
% 0.11/0.17 % CPULimit : 300
% 0.11/0.17 % WCLimit : 300
% 0.11/0.17 % DateTime : Tue Sep 29 12:18:31 UTC 2026
% 0.11/0.18 % CPUTime :
% 0.11/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.21 Running higher-order theorem proving
% 0.11/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.mTGoPPJ8RK/E---3.1_8889.p
% 0.23/0.32 % Version: 3.5.1-ho
% 0.23/0.32 % Preprocessing class: HSLMSMSSLLLCHSA.
% 0.23/0.32 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.32 % Starting lpo1_fix with 900s (3) cores
% 0.23/0.32 % Starting full_lambda_9 with 300s (1) cores
% 0.23/0.32 % Starting almost_fo_4 with 300s (1) cores
% 0.23/0.32 % Starting new_ho_9 with 300s (1) cores
% 0.23/0.32 % Starting pre_casc_4 with 300s (1) cores
% 0.23/0.32 % Starting ho_unfolding_6 with 300s (1) cores
% 0.23/0.32 % full_lambda_9 with pid 8903 completed with status 0
% 0.23/0.32 % Result found by full_lambda_9
% 0.23/0.32 % Preprocessing class: HSLMSMSSLLLCHSA.
% 0.23/0.32 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.32 % Starting lpo1_fix with 900s (3) cores
% 0.23/0.32 % Starting full_lambda_9 with 300s (1) cores
% 0.23/0.32 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.23/0.32 % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.23/0.32 % Search class: HGHSM-FSLM32-DHSMMSBN
% 0.23/0.32 % partial match(1): HGHSM-FSLM32-MHSMMSBN
% 0.23/0.32 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.32 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.32 % SubtermCWHack with pid 8908 completed with status 0
% 0.23/0.32 % Result found by SubtermCWHack
% 0.23/0.32 % Preprocessing class: HSLMSMSSLLLCHSA.
% 0.23/0.32 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.32 % Starting lpo1_fix with 900s (3) cores
% 0.23/0.32 % Starting full_lambda_9 with 300s (1) cores
% 0.23/0.32 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.23/0.32 % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.23/0.32 % Search class: HGHSM-FSLM32-DHSMMSBN
% 0.23/0.32 % partial match(1): HGHSM-FSLM32-MHSMMSBN
% 0.23/0.32 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.32 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.32 % Preprocessing time : 0.003 s
% 0.23/0.32
% 0.23/0.32 % Proof found!
% 0.23/0.32 % SZS status Theorem
% 0.23/0.32 % SZS output start CNFRefutation
% See solution above
% 0.23/0.32 % Parsed axioms : 312
% 0.23/0.32 % Removed by relevancy pruning/SinE : 171
% 0.23/0.32 % Initial clauses : 214
% 0.23/0.32 % Removed in clause preprocessing : 36
% 0.23/0.32 % Initial clauses in saturation : 178
% 0.23/0.32 % Processed clauses : 275
% 0.23/0.32 % ...of these trivial : 39
% 0.23/0.32 % ...subsumed : 31
% 0.23/0.32 % ...remaining for further processing : 205
% 0.23/0.32 % Other redundant clauses eliminated : 13
% 0.23/0.32 % Clauses deleted for lack of memory : 0
% 0.23/0.32 % Backward-subsumed : 0
% 0.23/0.32 % Backward-rewritten : 1
% 0.23/0.32 % Generated clauses : 405
% 0.23/0.32 % ...of the previous two non-redundant : 347
% 0.23/0.32 % ...aggressively subsumed : 0
% 0.23/0.32 % Contextual simplify-reflections : 2
% 0.23/0.32 % Paramodulations : 307
% 0.23/0.32 % Factorizations : 0
% 0.23/0.32 % NegExts : 0
% 0.23/0.32 % Equation resolutions : 14
% 0.23/0.32 % Disequality decompositions : 0
% 0.23/0.32 % Total rewrite steps : 117
% 0.23/0.32 % ...of those cached : 28
% 0.23/0.32 % Propositional unsat checks : 0
% 0.23/0.32 % Propositional check models : 0
% 0.23/0.32 % Propositional check unsatisfiable : 0
% 0.23/0.32 % Propositional clauses : 0
% 0.23/0.32 % Propositional clauses after purity: 0
% 0.23/0.32 % Propositional unsat core size : 0
% 0.23/0.32 % Propositional preprocessing time : 0.000
% 0.23/0.32 % Propositional encoding time : 0.000
% 0.23/0.32 % Propositional solver time : 0.000
% 0.23/0.32 % Success case prop preproc time : 0.000
% 0.23/0.32 % Success case prop encoding time : 0.000
% 0.23/0.32 % Success case prop solver time : 0.000
% 0.23/0.32 % Current number of processed clauses : 201
% 0.23/0.32 % Positive orientable unit clauses : 102
% 0.23/0.32 % Positive unorientable unit clauses: 4
% 0.23/0.32 % Negative unit clauses : 12
% 0.23/0.32 % Non-unit-clauses : 83
% 0.23/0.32 % Current number of unprocessed clauses: 248
% 0.23/0.32 % ...number of literals in the above : 749
% 0.23/0.32 % Current number of archived formulas : 0
% 0.23/0.32 % Current number of archived clauses : 1
% 0.23/0.32 % Clause-clause subsumption calls (NU) : 955
% 0.23/0.32 % Rec. Clause-clause subsumption calls : 770
% 0.23/0.32 % Non-unit clause-clause subsumptions : 18
% 0.23/0.32 % Unit Clause-clause subsumption calls : 414
% 0.23/0.32 % Rewrite failures with RHS unbound : 16
% 0.23/0.32 % BW rewrite match attempts : 80
% 0.23/0.32 % BW rewrite match successes : 3
% 0.23/0.32 % Condensation attempts : 0
% 0.23/0.32 % Condensation successes : 0
% 0.23/0.32 % Termbank termtop insertions : 30504
% 0.23/0.32 % Search garbage collected termcells : 8742
% 0.23/0.32
% 0.23/0.32 % -------------------------------------------------
% 0.23/0.32 % User time : 0.025 s
% 0.23/0.32 % System time : 0.011 s
% 0.23/0.32 % Total time : 0.036 s
% 0.23/0.32 % Maximum resident set size: 5588 pages
% 0.23/0.32
% 0.23/0.32 % -------------------------------------------------
% 0.23/0.32 % User time : 0.031 s
% 0.23/0.32 % System time : 0.018 s
% 0.23/0.32 % Total time : 0.050 s
% 0.23/0.32 % Maximum resident set size: 5376 pages
% 0.23/0.32 % E exiting
%------------------------------------------------------------------------------