%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM695^4 : TPTP v9.3.1. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:17:28 AM UTC 2026
% Result : Theorem 0.22s 0.36s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 41 ( 30 unt; 0 typ; 0 def)
% Number of atoms : 131 ( 44 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 198 ( 33 ~; 8 |; 2 &; 123 @)
% ( 0 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 17 usr; 5 con; 0-3 aty)
% Number of variables : 84 ( 66 ^; 18 !; 0 ?; 84 :)
% 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_62,type,
imp: $o > $o > $o ).
thf(decl_63,type,
d_not: $o > $o ).
thf(decl_72,type,
non: $i > ( $i > $o ) > $i > $o ).
thf(decl_73,type,
l_some: $i > ( $i > $o ) > $o ).
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_128,type,
n_some: ( $i > $o ) > $o ).
thf(decl_131,type,
n_1: $i ).
thf(decl_143,type,
n_pl: $i > $i > $i ).
thf(decl_148,type,
diffprop: $i > $i > $i > $o ).
thf(decl_149,type,
d_29_ii: $i > $i > $o ).
thf(decl_246,type,
esk89_0: $i ).
thf(def_d_not,axiom,
( d_not
= ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ScPTyZFfu9/E---3.1_2795125.p',def_d_not) ).
thf(def_imp,axiom,
( imp
= ( ^ [X74: $o,X75: $o] :
( X74
=> X75 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ScPTyZFfu9/E---3.1_2795125.p',def_imp) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X3: $i > $o,X2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ X3 )
=> ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ScPTyZFfu9/E---3.1_2795125.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ScPTyZFfu9/E---3.1_2795125.p',def_is_of) ).
thf(def_non,axiom,
( non
= ( ^ [X1: $i,X2: $i > $o,X4: $i] : ( d_not @ ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ScPTyZFfu9/E---3.1_2795125.p',def_non) ).
thf(def_l_some,axiom,
( l_some
= ( ^ [X1: $i,X2: $i > $o] :
( d_not
@ ( all_of
@ ^ [X4: $i] : ( in @ X4 @ X1 )
@ ( non @ X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ScPTyZFfu9/E---3.1_2795125.p',def_l_some) ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ScPTyZFfu9/E---3.1_2795125.p',def_e_is) ).
thf(def_diffprop,axiom,
( diffprop
= ( ^ [X1: $i,X207: $i,X4: $i] : ( n_is @ X1 @ ( n_pl @ X207 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ScPTyZFfu9/E---3.1_2795125.p',def_diffprop) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ScPTyZFfu9/E---3.1_2795125.p',def_n_is) ).
thf(def_d_29_ii,axiom,
( d_29_ii
= ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ScPTyZFfu9/E---3.1_2795125.p',def_d_29_ii) ).
thf(def_n_some,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X495: $i] :
( ( in @ X495 @ nat )
=> ( ( Z0 @ X495 )
=> ~ $true ) )
=> ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ScPTyZFfu9/E---3.1_2795125.p',def_n_some) ).
thf(satz24b,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] : ( d_29_ii @ ( ordsucc @ X1 ) @ n_1 ) ),
file('/export/starexec/sandbox/tmp/tmp.ScPTyZFfu9/E---3.1_2795125.p',satz24b) ).
thf(satz4g,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] : ( n_is @ ( ordsucc @ X1 ) @ ( n_pl @ n_1 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ScPTyZFfu9/E---3.1_2795125.p',satz4g) ).
thf(c_0_13,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_not]) ).
thf(c_0_14,plain,
( imp
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_imp]) ).
thf(c_0_15,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_16,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_17,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_non]) ).
thf(c_0_18,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_19,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X468: $i] :
( ( in @ X468 @ Z0 )
=> ( ( Z1 @ X468 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_l_some]) ).
thf(c_0_20,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_21,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_22,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_23,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X468: $i] :
( ( in @ X468 @ Z0 )
=> ( ( Z1 @ X468 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19,c_0_20]),c_0_18]),c_0_21]) ).
thf(c_0_24,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_diffprop]) ).
thf(c_0_25,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_22]) ).
thf(c_0_26,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X506: $i] :
( ( in @ X506 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X506 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).
thf(c_0_27,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X495: $i] :
( ( in @ X495 @ nat )
=> ( ( Z0 @ X495 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[def_n_some,c_0_23]) ).
thf(c_0_28,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_29,negated_conjecture,
~ ( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] : ( d_29_ii @ ( ordsucc @ X1 ) @ n_1 ) ),
inference(assume_negation,[status(cth)],[satz24b]) ).
thf(c_0_30,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X506: $i] :
( ( in @ X506 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X506 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
thf(c_0_31,negated_conjecture,
~ ! [X911: $i] :
( ( in @ X911 @ nat )
=> ( ! [X910: $i] :
( ( in @ X910 @ nat )
=> ( ( ( ordsucc @ X911 )
= ( n_pl @ n_1 @ X910 ) )
=> ~ $true ) )
=> ~ $true ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_29]),c_0_20]),c_0_30]) ).
thf(c_0_32,negated_conjecture,
! [X1463: $i] :
( ( in @ esk89_0 @ nat )
& ( ~ ( in @ X1463 @ nat )
| ( ( ordsucc @ esk89_0 )
!= ( n_pl @ n_1 @ X1463 ) )
| ~ $true )
& $true ),
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_31])])])])]) ).
thf(c_0_33,plain,
! [X616: $i] :
( ( in @ X616 @ nat )
=> ( ( ordsucc @ X616 )
= ( n_pl @ n_1 @ X616 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz4g]),c_0_20]),c_0_25]) ).
thf(c_0_34,negated_conjecture,
! [X1: $i] :
( ~ ( in @ X1 @ nat )
| ( ( ordsucc @ esk89_0 )
!= ( n_pl @ n_1 @ X1 ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_35,plain,
! [X1156: $i] :
( ~ ( in @ X1156 @ nat )
| ( ( ordsucc @ X1156 )
= ( n_pl @ n_1 @ X1156 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])]) ).
thf(c_0_36,negated_conjecture,
! [X1: $i] :
( ( ( ordsucc @ esk89_0 )
!= ( n_pl @ n_1 @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_34]) ).
thf(c_0_37,plain,
! [X1: $i] :
( ( ( ordsucc @ X1 )
= ( n_pl @ n_1 @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
thf(c_0_38,negated_conjecture,
in @ esk89_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_39,negated_conjecture,
! [X1: $i] :
( ( ( n_pl @ n_1 @ esk89_0 )
!= ( n_pl @ n_1 @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
thf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_39]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM695^4 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n010.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 12:41:18 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 Running higher-order theorem proving
% 0.08/0.25 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.ScPTyZFfu9/E---3.1_2795125.p
% 0.22/0.36 % Version: 3.5.1-ho
% 0.22/0.36 % Preprocessing class: HSLMSMSSLLLCHSA.
% 0.22/0.36 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.36 % Starting lpo1_fix with 900s (3) cores
% 0.22/0.36 % Starting full_lambda_9 with 300s (1) cores
% 0.22/0.36 % Starting almost_fo_4 with 300s (1) cores
% 0.22/0.36 % Starting new_ho_9 with 300s (1) cores
% 0.22/0.36 % Starting pre_casc_4 with 300s (1) cores
% 0.22/0.36 % Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.36 % ho_unfolding_6 with pid 2795143 completed with status 0
% 0.22/0.36 % Result found by ho_unfolding_6
% 0.22/0.36 % Preprocessing class: HSLMSMSSLLLCHSA.
% 0.22/0.36 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.36 % Starting lpo1_fix with 900s (3) cores
% 0.22/0.36 % Starting full_lambda_9 with 300s (1) cores
% 0.22/0.36 % Starting almost_fo_4 with 300s (1) cores
% 0.22/0.36 % Starting new_ho_9 with 300s (1) cores
% 0.22/0.36 % Starting pre_casc_4 with 300s (1) cores
% 0.22/0.36 % Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.36 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.36 % No SInE strategy applied
% 0.22/0.36 % Search class: HGHSM-FSLM32-DHSMMSBN
% 0.22/0.36 % partial match(1): HGHSM-FSLM32-MHSMMSBN
% 0.22/0.36 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.36 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.36 % SubtermCWHack with pid 2795144 completed with status 0
% 0.22/0.36 % Result found by SubtermCWHack
% 0.22/0.36 % Preprocessing class: HSLMSMSSLLLCHSA.
% 0.22/0.36 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.36 % Starting lpo1_fix with 900s (3) cores
% 0.22/0.36 % Starting full_lambda_9 with 300s (1) cores
% 0.22/0.36 % Starting almost_fo_4 with 300s (1) cores
% 0.22/0.36 % Starting new_ho_9 with 300s (1) cores
% 0.22/0.36 % Starting pre_casc_4 with 300s (1) cores
% 0.22/0.36 % Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.36 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.36 % No SInE strategy applied
% 0.22/0.36 % Search class: HGHSM-FSLM32-DHSMMSBN
% 0.22/0.36 % partial match(1): HGHSM-FSLM32-MHSMMSBN
% 0.22/0.36 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.36 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.36 % Preprocessing time : 0.011 s
% 0.22/0.36
% 0.22/0.36 % Proof found!
% 0.22/0.36 % SZS status Theorem
% 0.22/0.36 % SZS output start CNFRefutation
% See solution above
% 0.22/0.36 % Parsed axioms : 399
% 0.22/0.36 % Removed by relevancy pruning/SinE : 0
% 0.22/0.36 % Initial clauses : 1078
% 0.22/0.36 % Removed in clause preprocessing : 701
% 0.22/0.36 % Initial clauses in saturation : 377
% 0.22/0.36 % Processed clauses : 373
% 0.22/0.36 % ...of these trivial : 49
% 0.22/0.36 % ...subsumed : 95
% 0.22/0.36 % ...remaining for further processing : 229
% 0.22/0.36 % Other redundant clauses eliminated : 21
% 0.22/0.36 % Clauses deleted for lack of memory : 0
% 0.22/0.36 % Backward-subsumed : 4
% 0.22/0.36 % Backward-rewritten : 3
% 0.22/0.36 % Generated clauses : 619
% 0.22/0.36 % ...of the previous two non-redundant : 552
% 0.22/0.36 % ...aggressively subsumed : 0
% 0.22/0.36 % Contextual simplify-reflections : 1
% 0.22/0.36 % Paramodulations : 475
% 0.22/0.36 % Factorizations : 0
% 0.22/0.36 % NegExts : 0
% 0.22/0.36 % Equation resolutions : 23
% 0.22/0.36 % Disequality decompositions : 0
% 0.22/0.36 % Total rewrite steps : 226
% 0.22/0.36 % ...of those cached : 157
% 0.22/0.36 % Propositional unsat checks : 0
% 0.22/0.36 % Propositional check models : 0
% 0.22/0.36 % Propositional check unsatisfiable : 0
% 0.22/0.36 % Propositional clauses : 0
% 0.22/0.36 % Propositional clauses after purity: 0
% 0.22/0.36 % Propositional unsat core size : 0
% 0.22/0.36 % Propositional preprocessing time : 0.000
% 0.22/0.36 % Propositional encoding time : 0.000
% 0.22/0.36 % Propositional solver time : 0.000
% 0.22/0.36 % Success case prop preproc time : 0.000
% 0.22/0.36 % Success case prop encoding time : 0.000
% 0.22/0.36 % Success case prop solver time : 0.000
% 0.22/0.36 % Current number of processed clauses : 218
% 0.22/0.36 % Positive orientable unit clauses : 106
% 0.22/0.36 % Positive unorientable unit clauses: 1
% 0.22/0.36 % Negative unit clauses : 19
% 0.22/0.36 % Non-unit-clauses : 92
% 0.22/0.36 % Current number of unprocessed clauses: 556
% 0.22/0.36 % ...number of literals in the above : 2144
% 0.22/0.36 % Current number of archived formulas : 0
% 0.22/0.36 % Current number of archived clauses : 7
% 0.22/0.36 % Clause-clause subsumption calls (NU) : 2286
% 0.22/0.36 % Rec. Clause-clause subsumption calls : 1643
% 0.22/0.36 % Non-unit clause-clause subsumptions : 50
% 0.22/0.36 % Unit Clause-clause subsumption calls : 756
% 0.22/0.36 % Rewrite failures with RHS unbound : 0
% 0.22/0.36 % BW rewrite match attempts : 136
% 0.22/0.36 % BW rewrite match successes : 2
% 0.22/0.36 % Condensation attempts : 0
% 0.22/0.36 % Condensation successes : 0
% 0.22/0.36 % Termbank termtop insertions : 121649
% 0.22/0.36 % Search garbage collected termcells : 44642
% 0.22/0.36
% 0.22/0.36 % -------------------------------------------------
% 0.22/0.36 % User time : 0.065 s
% 0.22/0.36 % System time : 0.014 s
% 0.22/0.36 % Total time : 0.079 s
% 0.22/0.36 % Maximum resident set size: 9680 pages
% 0.22/0.36
% 0.22/0.36 % -------------------------------------------------
% 0.22/0.36 % User time : 0.077 s
% 0.22/0.36 % System time : 0.020 s
% 0.22/0.36 % Total time : 0.097 s
% 0.22/0.36 % Maximum resident set size: 5120 pages
% 0.22/0.36 % E exiting
%------------------------------------------------------------------------------