%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM650^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 : 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:16:42 AM UTC 2026
% Result : Theorem 1.26s 0.50s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 19
% Syntax : Number of formulae : 74 ( 52 unt; 0 typ; 0 def)
% Number of atoms : 643 ( 127 equ; 0 cnn)
% Maximal formula atoms : 275 ( 8 avg)
% Number of connectives : 1461 ( 348 ~; 301 |; 40 &; 604 @)
% ( 0 <=>; 168 =>; 0 <=; 0 <~>)
% Maximal formula depth : 52 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 27 ( 24 usr; 5 con; 0-3 aty)
% Number of variables : 168 ( 121 ^; 47 !; 0 ?; 168 :)
% 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_62,type,
imp: $o > $o > $o ).
thf(decl_63,type,
d_not: $o > $o ).
thf(decl_66,type,
l_ec: $o > $o > $o ).
thf(decl_67,type,
d_and: $o > $o > $o ).
thf(decl_68,type,
l_or: $o > $o > $o ).
thf(decl_72,type,
non: $i > ( $i > $o ) > $i > $o ).
thf(decl_73,type,
l_some: $i > ( $i > $o ) > $o ).
thf(decl_74,type,
or3: $o > $o > $o > $o ).
thf(decl_75,type,
and3: $o > $o > $o > $o ).
thf(decl_76,type,
ec3: $o > $o > $o > $o ).
thf(decl_77,type,
orec3: $o > $o > $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_143,type,
n_pl: $i > $i > $i ).
thf(decl_148,type,
diffprop: $i > $i > $i > $o ).
thf(decl_189,type,
esk34_2: $i > $i > $i ).
thf(decl_190,type,
esk35_2: $i > $i > $i ).
thf(decl_191,type,
esk36_0: $i ).
thf(decl_192,type,
esk37_0: $i ).
thf(def_d_not,axiom,
( d_not
= ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FTrjLUvoQI/E---3.1_3288583.p',def_d_not) ).
thf(def_imp,axiom,
( imp
= ( ^ [X74: $o,X75: $o] :
( X74
=> X75 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FTrjLUvoQI/E---3.1_3288583.p',def_imp) ).
thf(def_l_ec,axiom,
( l_ec
= ( ^ [X79: $o,X80: $o] : ( imp @ X79 @ ( d_not @ X80 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FTrjLUvoQI/E---3.1_3288583.p',def_l_ec) ).
thf(def_d_and,axiom,
( d_and
= ( ^ [X81: $o,X82: $o] : ( d_not @ ( l_ec @ X81 @ X82 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FTrjLUvoQI/E---3.1_3288583.p',def_d_and) ).
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.FTrjLUvoQI/E---3.1_3288583.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FTrjLUvoQI/E---3.1_3288583.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.FTrjLUvoQI/E---3.1_3288583.p',def_non) ).
thf(def_l_or,axiom,
( l_or
= ( ^ [X83: $o] : ( imp @ ( d_not @ X83 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FTrjLUvoQI/E---3.1_3288583.p',def_l_or) ).
thf(def_and3,axiom,
( and3
= ( ^ [X92: $o,X93: $o,X94: $o] : ( d_and @ X92 @ ( d_and @ X93 @ X94 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FTrjLUvoQI/E---3.1_3288583.p',def_and3) ).
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.FTrjLUvoQI/E---3.1_3288583.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.FTrjLUvoQI/E---3.1_3288583.p',def_e_is) ).
thf(def_or3,axiom,
( or3
= ( ^ [X89: $o,X90: $o,X91: $o] : ( l_or @ X89 @ ( l_or @ X90 @ X91 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FTrjLUvoQI/E---3.1_3288583.p',def_or3) ).
thf(def_ec3,axiom,
( ec3
= ( ^ [X95: $o,X96: $o,X97: $o] : ( and3 @ ( l_ec @ X95 @ X96 ) @ ( l_ec @ X96 @ X97 ) @ ( l_ec @ X97 @ X95 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FTrjLUvoQI/E---3.1_3288583.p',def_ec3) ).
thf(def_diffprop,axiom,
( diffprop
= ( ^ [X1: $i,X207: $i,X4: $i] : ( n_is @ X1 @ ( n_pl @ X207 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FTrjLUvoQI/E---3.1_3288583.p',def_diffprop) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FTrjLUvoQI/E---3.1_3288583.p',def_n_is) ).
thf(def_orec3,axiom,
( orec3
= ( ^ [X98: $o,X99: $o,X100: $o] : ( d_and @ ( or3 @ X98 @ X99 @ X100 ) @ ( ec3 @ X98 @ X99 @ X100 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FTrjLUvoQI/E---3.1_3288583.p',def_orec3) ).
thf(satz9a,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X215: $i] : ( in @ X215 @ nat )
@ ^ [X216: $i] : ( or3 @ ( n_is @ X1 @ X216 ) @ ( n_some @ ( diffprop @ X1 @ X216 ) ) @ ( n_some @ ( diffprop @ X216 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FTrjLUvoQI/E---3.1_3288583.p',satz9a) ).
thf(def_n_some,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X389: $i] :
( ( in @ X389 @ nat )
=> ( ( Z0 @ X389 )
=> ~ $true ) )
=> ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FTrjLUvoQI/E---3.1_3288583.p',def_n_some) ).
thf(satz9,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X213: $i] : ( in @ X213 @ nat )
@ ^ [X214: $i] :
( orec3 @ ( n_is @ X1 @ X214 )
@ ( n_some
@ ^ [X4: $i] : ( n_is @ X1 @ ( n_pl @ X214 @ X4 ) ) )
@ ( n_some
@ ^ [X4: $i] : ( n_is @ X214 @ ( n_pl @ X1 @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.FTrjLUvoQI/E---3.1_3288583.p',satz9) ).
thf(c_0_19,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_not]) ).
thf(c_0_20,plain,
( imp
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_imp]) ).
thf(c_0_21,plain,
( l_ec
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> ( Z1
=> ~ $true ) ) ) ),
inference(fof_simplification,[status(thm)],[def_l_ec]) ).
thf(c_0_22,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_23,plain,
( d_and
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ( Z1
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_and]) ).
thf(c_0_24,plain,
( l_ec
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> ( Z1
=> ~ $true ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_21,c_0_20]),c_0_22]) ).
thf(c_0_25,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_26,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_27,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_non]) ).
thf(c_0_28,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_l_or]) ).
thf(c_0_29,plain,
( and3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( Z0
=> ( ( ( Z1
=> ( Z2
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_and3]) ).
thf(c_0_30,plain,
( d_and
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ( Z1
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_23,c_0_22]),c_0_24]) ).
thf(c_0_31,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X362: $i] :
( ( in @ X362 @ Z0 )
=> ( ( Z1 @ X362 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_l_some]) ).
thf(c_0_32,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_33,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_27,c_0_22]) ).
thf(c_0_34,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_35,plain,
( or3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( Z0
=> ~ $true )
=> ( ( Z1
=> ~ $true )
=> Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_or3]) ).
thf(c_0_36,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_28,c_0_20]),c_0_22]) ).
thf(c_0_37,plain,
( ec3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( ( Z0
=> ( Z1
=> ~ $true ) )
=> ( ( ( ( Z1
=> ( Z2
=> ~ $true ) )
=> ( ( Z2
=> ( Z0
=> ~ $true ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_ec3]) ).
thf(c_0_38,plain,
( and3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( Z0
=> ( ( ( Z1
=> ( Z2
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_39,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X362: $i] :
( ( in @ X362 @ Z0 )
=> ( ( Z1 @ X362 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_31,c_0_32]),c_0_22]),c_0_33]) ).
thf(c_0_40,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_diffprop]) ).
thf(c_0_41,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_34]) ).
thf(c_0_42,plain,
( orec3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( ( ( Z0
=> ~ $true )
=> ( ( Z1
=> ~ $true )
=> Z2 ) )
=> ( ( ( ( Z0
=> ( Z1
=> ~ $true ) )
=> ( ( ( ( Z1
=> ( Z2
=> ~ $true ) )
=> ( ( Z2
=> ( Z0
=> ~ $true ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_orec3]) ).
thf(c_0_43,plain,
( or3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( Z0
=> ~ $true )
=> ( ( Z1
=> ~ $true )
=> Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_35,c_0_36]) ).
thf(c_0_44,plain,
( ec3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( ( Z0
=> ( Z1
=> ~ $true ) )
=> ( ( ( ( Z1
=> ( Z2
=> ~ $true ) )
=> ( ( Z2
=> ( Z0
=> ~ $true ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_37,c_0_24]),c_0_38]) ).
thf(c_0_45,negated_conjecture,
~ ( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X215: $i] : ( in @ X215 @ nat )
@ ^ [X216: $i] : ( or3 @ ( n_is @ X1 @ X216 ) @ ( n_some @ ( diffprop @ X1 @ X216 ) ) @ ( n_some @ ( diffprop @ X216 @ X1 ) ) ) ) ),
inference(assume_negation,[status(cth)],[satz9a]) ).
thf(c_0_46,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X389: $i] :
( ( in @ X389 @ nat )
=> ( ( Z0 @ X389 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[def_n_some,c_0_39]) ).
thf(c_0_47,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_40,c_0_41]) ).
thf(c_0_48,plain,
( orec3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( ( ( Z0
=> ~ $true )
=> ( ( Z1
=> ~ $true )
=> Z2 ) )
=> ( ( ( ( Z0
=> ( Z1
=> ~ $true ) )
=> ( ( ( ( Z1
=> ( Z2
=> ~ $true ) )
=> ( ( Z2
=> ( Z0
=> ~ $true ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_42,c_0_30]),c_0_43]),c_0_44]) ).
thf(c_0_49,negated_conjecture,
~ ! [X535: $i] :
( ( in @ X535 @ nat )
=> ! [X534: $i] :
( ( in @ X534 @ nat )
=> ( ( ( X535 = X534 )
=> ~ $true )
=> ( ( ( ! [X532: $i] :
( ( in @ X532 @ nat )
=> ( ( X535
= ( n_pl @ X534 @ X532 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true )
=> ( ! [X533: $i] :
( ( in @ X533 @ nat )
=> ( ( X534
= ( n_pl @ X535 @ X533 ) )
=> ~ $true ) )
=> ~ $true ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_45]),c_0_32]),c_0_43]),c_0_41]),c_0_46]),c_0_47]) ).
thf(c_0_50,plain,
! [X531: $i] :
( ( in @ X531 @ nat )
=> ! [X530: $i] :
( ( in @ X530 @ nat )
=> ( ( ( ( ( X531 = X530 )
=> ~ $true )
=> ( ( ( ! [X528: $i] :
( ( in @ X528 @ nat )
=> ( ( X531
= ( n_pl @ X530 @ X528 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true )
=> ( ! [X529: $i] :
( ( in @ X529 @ nat )
=> ( ( X530
= ( n_pl @ X531 @ X529 ) )
=> ~ $true ) )
=> ~ $true ) ) )
=> ( ( ( ( ( X531 = X530 )
=> ( ( ! [X528: $i] :
( ( in @ X528 @ nat )
=> ( ( X531
= ( n_pl @ X530 @ X528 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ( ( ( ( ( ! [X528: $i] :
( ( in @ X528 @ nat )
=> ( ( X531
= ( n_pl @ X530 @ X528 ) )
=> ~ $true ) )
=> ~ $true )
=> ( ( ! [X529: $i] :
( ( in @ X529 @ nat )
=> ( ( X530
= ( n_pl @ X531 @ X529 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ( ( ( ! [X529: $i] :
( ( in @ X529 @ nat )
=> ( ( X530
= ( n_pl @ X531 @ X529 ) )
=> ~ $true ) )
=> ~ $true )
=> ( ( X531 = X530 )
=> ~ $true ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz9]),c_0_32]),c_0_48]),c_0_41]),c_0_46]) ).
thf(c_0_51,negated_conjecture,
! [X1040: $i,X1041: $i] :
( ( in @ esk36_0 @ nat )
& ( in @ esk37_0 @ nat )
& ( ( esk36_0 != esk37_0 )
| ~ $true )
& ( ~ ( in @ X1040 @ nat )
| ( esk36_0
!= ( n_pl @ esk37_0 @ X1040 ) )
| ~ $true
| ~ $true )
& ( $true
| ~ $true )
& ( ~ ( in @ X1041 @ nat )
| ( esk37_0
!= ( n_pl @ esk36_0 @ X1041 ) )
| ~ $true )
& $true ),
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_49])])])])])]) ).
thf(c_0_52,plain,
! [X1030: $i,X1031: $i,X1034: $i,X1035: $i,X1036: $i,X1037: $i] :
( ( ( in @ ( esk35_2 @ X1030 @ X1031 ) @ nat )
| ~ $true
| ( in @ ( esk34_2 @ X1030 @ X1031 ) @ nat )
| ~ $true
| ( X1030 = X1031 )
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ( X1031
= ( n_pl @ X1030 @ ( esk35_2 @ X1030 @ X1031 ) ) )
| ~ $true
| ( in @ ( esk34_2 @ X1030 @ X1031 ) @ nat )
| ~ $true
| ( X1030 = X1031 )
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( $true
| ~ $true
| ( in @ ( esk34_2 @ X1030 @ X1031 ) @ nat )
| ~ $true
| ( X1030 = X1031 )
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ( in @ ( esk35_2 @ X1030 @ X1031 ) @ nat )
| ~ $true
| ( X1030
= ( n_pl @ X1031 @ ( esk34_2 @ X1030 @ X1031 ) ) )
| ~ $true
| ( X1030 = X1031 )
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ( X1031
= ( n_pl @ X1030 @ ( esk35_2 @ X1030 @ X1031 ) ) )
| ~ $true
| ( X1030
= ( n_pl @ X1031 @ ( esk34_2 @ X1030 @ X1031 ) ) )
| ~ $true
| ( X1030 = X1031 )
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( $true
| ~ $true
| ( X1030
= ( n_pl @ X1031 @ ( esk34_2 @ X1030 @ X1031 ) ) )
| ~ $true
| ( X1030 = X1031 )
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ( in @ ( esk35_2 @ X1030 @ X1031 ) @ nat )
| ~ $true
| $true
| ~ $true
| ( X1030 = X1031 )
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ( X1031
= ( n_pl @ X1030 @ ( esk35_2 @ X1030 @ X1031 ) ) )
| ~ $true
| $true
| ~ $true
| ( X1030 = X1031 )
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( $true
| ~ $true
| $true
| ~ $true
| ( X1030 = X1031 )
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ( in @ ( esk35_2 @ X1030 @ X1031 ) @ nat )
| ~ $true
| $true
| ( X1030 = X1031 )
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ( X1031
= ( n_pl @ X1030 @ ( esk35_2 @ X1030 @ X1031 ) ) )
| ~ $true
| $true
| ( X1030 = X1031 )
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( $true
| ~ $true
| $true
| ( X1030 = X1031 )
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ( in @ ( esk35_2 @ X1030 @ X1031 ) @ nat )
| ~ $true
| ( in @ ( esk34_2 @ X1030 @ X1031 ) @ nat )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ( X1031
= ( n_pl @ X1030 @ ( esk35_2 @ X1030 @ X1031 ) ) )
| ~ $true
| ( in @ ( esk34_2 @ X1030 @ X1031 ) @ nat )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( $true
| ~ $true
| ( in @ ( esk34_2 @ X1030 @ X1031 ) @ nat )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ( in @ ( esk35_2 @ X1030 @ X1031 ) @ nat )
| ~ $true
| ( X1030
= ( n_pl @ X1031 @ ( esk34_2 @ X1030 @ X1031 ) ) )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ( X1031
= ( n_pl @ X1030 @ ( esk35_2 @ X1030 @ X1031 ) ) )
| ~ $true
| ( X1030
= ( n_pl @ X1031 @ ( esk34_2 @ X1030 @ X1031 ) ) )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( $true
| ~ $true
| ( X1030
= ( n_pl @ X1031 @ ( esk34_2 @ X1030 @ X1031 ) ) )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ( in @ ( esk35_2 @ X1030 @ X1031 ) @ nat )
| ~ $true
| $true
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ( X1031
= ( n_pl @ X1030 @ ( esk35_2 @ X1030 @ X1031 ) ) )
| ~ $true
| $true
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( $true
| ~ $true
| $true
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ( in @ ( esk35_2 @ X1030 @ X1031 ) @ nat )
| ~ $true
| $true
| $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ( X1031
= ( n_pl @ X1030 @ ( esk35_2 @ X1030 @ X1031 ) ) )
| ~ $true
| $true
| $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( $true
| ~ $true
| $true
| $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ~ ( in @ X1034 @ nat )
| ( X1030
!= ( n_pl @ X1031 @ X1034 ) )
| ~ $true
| ~ $true
| ( X1030 != X1031 )
| ~ $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( $true
| ~ $true
| ( X1030 != X1031 )
| ~ $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ~ ( in @ X1036 @ nat )
| ( X1031
!= ( n_pl @ X1030 @ X1036 ) )
| ~ $true
| ~ $true
| ~ ( in @ X1035 @ nat )
| ( X1030
!= ( n_pl @ X1031 @ X1035 ) )
| ~ $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( $true
| ~ $true
| ~ ( in @ X1035 @ nat )
| ( X1030
!= ( n_pl @ X1031 @ X1035 ) )
| ~ $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ~ ( in @ X1036 @ nat )
| ( X1031
!= ( n_pl @ X1030 @ X1036 ) )
| ~ $true
| ~ $true
| $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( $true
| ~ $true
| $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( ~ ( in @ X1037 @ nat )
| ( X1031
!= ( n_pl @ X1030 @ X1037 ) )
| ~ $true
| ( X1030 != X1031 )
| ~ $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( $true
| ( X1030 != X1031 )
| ~ $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( $true
| ~ $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) )
& ( $true
| ~ $true
| ~ ( in @ X1031 @ nat )
| ~ ( in @ X1030 @ nat ) ) ),
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_50])])])])])]) ).
thf(c_0_53,negated_conjecture,
! [X1: $i] :
( ~ ( in @ X1 @ nat )
| ( esk36_0
!= ( n_pl @ esk37_0 @ X1 ) )
| ~ $true
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
thf(c_0_54,plain,
! [X1: $i,X4: $i] :
( ( X1
= ( n_pl @ X4 @ ( esk35_2 @ X4 @ X1 ) ) )
| ( X4
= ( n_pl @ X1 @ ( esk34_2 @ X4 @ X1 ) ) )
| ( X4 = X1 )
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X1 @ nat )
| ~ ( in @ X4 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
thf(c_0_55,negated_conjecture,
( ( esk36_0 != esk37_0 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
thf(c_0_56,plain,
! [X1: $i,X4: $i] :
( ( X1
= ( n_pl @ X4 @ ( esk35_2 @ X4 @ X1 ) ) )
| ( in @ ( esk34_2 @ X4 @ X1 ) @ nat )
| ( X4 = X1 )
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X1 @ nat )
| ~ ( in @ X4 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
thf(c_0_57,negated_conjecture,
! [X1: $i] :
( ( esk36_0
!= ( n_pl @ esk37_0 @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_53]) ).
thf(c_0_58,plain,
! [X4: $i,X1: $i] :
( ( X1 = X4 )
| ( X4
= ( n_pl @ X1 @ ( esk34_2 @ X4 @ X1 ) ) )
| ( X1
= ( n_pl @ X4 @ ( esk35_2 @ X4 @ X1 ) ) )
| ~ ( in @ X4 @ nat )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_54]) ).
thf(c_0_59,negated_conjecture,
in @ esk37_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_51]) ).
thf(c_0_60,negated_conjecture,
in @ esk36_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_51]) ).
thf(c_0_61,negated_conjecture,
esk37_0 != esk36_0,
inference(cn,[status(thm)],[c_0_55]) ).
thf(c_0_62,plain,
! [X4: $i,X1: $i] :
( ( in @ ( esk35_2 @ X1 @ X4 ) @ nat )
| ( X1
= ( n_pl @ X4 @ ( esk34_2 @ X1 @ X4 ) ) )
| ( X1 = X4 )
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X4 @ nat )
| ~ ( in @ X1 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
thf(c_0_63,plain,
! [X4: $i,X1: $i] :
( ( X1 = X4 )
| ( X1
= ( n_pl @ X4 @ ( esk35_2 @ X4 @ X1 ) ) )
| ( in @ ( esk34_2 @ X4 @ X1 ) @ nat )
| ~ ( in @ X4 @ nat )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_56]) ).
thf(c_0_64,plain,
! [X4: $i,X1: $i] :
( ( in @ ( esk35_2 @ X1 @ X4 ) @ nat )
| ( in @ ( esk34_2 @ X1 @ X4 ) @ nat )
| ( X1 = X4 )
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X4 @ nat )
| ~ ( in @ X1 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
thf(c_0_65,negated_conjecture,
! [X1: $i] :
( ~ ( in @ X1 @ nat )
| ( esk37_0
!= ( n_pl @ esk36_0 @ X1 ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
thf(c_0_66,negated_conjecture,
( ( ( n_pl @ esk36_0 @ ( esk34_2 @ esk37_0 @ esk36_0 ) )
= esk37_0 )
| ~ ( in @ ( esk35_2 @ esk37_0 @ esk36_0 ) @ nat ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])])]),c_0_60])]),c_0_61]) ).
thf(c_0_67,plain,
! [X4: $i,X1: $i] :
( ( X1 = X4 )
| ( X1
= ( n_pl @ X4 @ ( esk34_2 @ X1 @ X4 ) ) )
| ( in @ ( esk35_2 @ X1 @ X4 ) @ nat )
| ~ ( in @ X4 @ nat )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_62]) ).
thf(c_0_68,negated_conjecture,
( ( in @ ( esk34_2 @ esk37_0 @ esk36_0 ) @ nat )
| ~ ( in @ ( esk35_2 @ esk37_0 @ esk36_0 ) @ nat ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_63]),c_0_59])])]),c_0_60])]),c_0_61]) ).
thf(c_0_69,plain,
! [X4: $i,X1: $i] :
( ( X1 = X4 )
| ( in @ ( esk34_2 @ X1 @ X4 ) @ nat )
| ( in @ ( esk35_2 @ X1 @ X4 ) @ nat )
| ~ ( in @ X4 @ nat )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_64]) ).
thf(c_0_70,negated_conjecture,
! [X1: $i] :
( ( esk37_0
!= ( n_pl @ esk36_0 @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_65]) ).
thf(c_0_71,negated_conjecture,
( ( n_pl @ esk36_0 @ ( esk34_2 @ esk37_0 @ esk36_0 ) )
= esk37_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_60]),c_0_59])]),c_0_61]) ).
thf(c_0_72,negated_conjecture,
in @ ( esk34_2 @ esk37_0 @ esk36_0 ) @ nat,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_60]),c_0_59])]),c_0_61]) ).
thf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM650^4 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n007.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 12:29:25 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.23/0.26 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.FTrjLUvoQI/E---3.1_3288583.p
% 1.26/0.50 % Version: 3.5.1-ho
% 1.26/0.50 % Preprocessing class: HSLMSMSSLLLCHSA.
% 1.26/0.50 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.50 % Starting lpo1_fix with 900s (3) cores
% 1.26/0.50 % Starting full_lambda_9 with 300s (1) cores
% 1.26/0.50 % Starting almost_fo_4 with 300s (1) cores
% 1.26/0.50 % Starting new_ho_9 with 300s (1) cores
% 1.26/0.50 % Starting pre_casc_4 with 300s (1) cores
% 1.26/0.50 % Starting ho_unfolding_6 with 300s (1) cores
% 1.26/0.50 % lpo1_fix with pid 3288596 completed with status 0
% 1.26/0.50 % Result found by lpo1_fix
% 1.26/0.50 % Preprocessing class: HSLMSMSSLLLCHSA.
% 1.26/0.50 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.50 % Starting lpo1_fix with 900s (3) cores
% 1.26/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.26/0.50 % No SInE strategy applied
% 1.26/0.50 % Search class: HGHSM-FSLM32-MHSMMSBN
% 1.26/0.50 % Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 1.26/0.50 % Starting SubtermCWHack with 91s (1) cores
% 1.26/0.50 % Starting full_lambda_5 with 82s (1) cores
% 1.26/0.50 % Starting new_ho_6 with 82s (1) cores
% 1.26/0.50 % full_lambda_5 with pid 3288607 completed with status 0
% 1.26/0.50 % Result found by full_lambda_5
% 1.26/0.50 % Preprocessing class: HSLMSMSSLLLCHSA.
% 1.26/0.50 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.50 % Starting lpo1_fix with 900s (3) cores
% 1.26/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.26/0.50 % No SInE strategy applied
% 1.26/0.50 % Search class: HGHSM-FSLM32-MHSMMSBN
% 1.26/0.50 % Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 1.26/0.50 % Starting SubtermCWHack with 91s (1) cores
% 1.26/0.50 % Starting full_lambda_5 with 82s (1) cores
% 1.26/0.50 % Preprocessing time : 0.009 s
% 1.26/0.50 % Presaturation interreduction done
% 1.26/0.50
% 1.26/0.50 % Proof found!
% 1.26/0.50 % SZS status Theorem
% 1.26/0.50 % SZS output start CNFRefutation
% See solution above
% 1.26/0.50 % Parsed axioms : 338
% 1.26/0.50 % Removed by relevancy pruning/SinE : 0
% 1.26/0.50 % Initial clauses : 510
% 1.26/0.50 % Removed in clause preprocessing : 215
% 1.26/0.50 % Initial clauses in saturation : 295
% 1.26/0.50 % Processed clauses : 696
% 1.26/0.50 % ...of these trivial : 6
% 1.26/0.50 % ...subsumed : 69
% 1.26/0.50 % ...remaining for further processing : 621
% 1.26/0.50 % Other redundant clauses eliminated : 134
% 1.26/0.50 % Clauses deleted for lack of memory : 0
% 1.26/0.50 % Backward-subsumed : 2
% 1.26/0.50 % Backward-rewritten : 10
% 1.26/0.50 % Generated clauses : 2813
% 1.26/0.50 % ...of the previous two non-redundant : 2599
% 1.26/0.50 % ...aggressively subsumed : 0
% 1.26/0.50 % Contextual simplify-reflections : 4
% 1.26/0.50 % Paramodulations : 2511
% 1.26/0.50 % Factorizations : 2
% 1.26/0.50 % NegExts : 10
% 1.26/0.50 % Equation resolutions : 139
% 1.26/0.50 % Disequality decompositions : 0
% 1.26/0.50 % Total rewrite steps : 557
% 1.26/0.50 % ...of those cached : 397
% 1.26/0.50 % Propositional unsat checks : 0
% 1.26/0.50 % Propositional check models : 0
% 1.26/0.50 % Propositional check unsatisfiable : 0
% 1.26/0.50 % Propositional clauses : 0
% 1.26/0.50 % Propositional clauses after purity: 0
% 1.26/0.50 % Propositional unsat core size : 0
% 1.26/0.50 % Propositional preprocessing time : 0.000
% 1.26/0.50 % Propositional encoding time : 0.000
% 1.26/0.50 % Propositional solver time : 0.000
% 1.26/0.50 % Success case prop preproc time : 0.000
% 1.26/0.50 % Success case prop encoding time : 0.000
% 1.26/0.50 % Success case prop solver time : 0.000
% 1.26/0.50 % Current number of processed clauses : 314
% 1.26/0.50 % Positive orientable unit clauses : 104
% 1.26/0.50 % Positive unorientable unit clauses: 4
% 1.26/0.50 % Negative unit clauses : 21
% 1.26/0.50 % Non-unit-clauses : 185
% 1.26/0.50 % Current number of unprocessed clauses: 2462
% 1.26/0.50 % ...number of literals in the above : 7746
% 1.26/0.50 % Current number of archived formulas : 0
% 1.26/0.50 % Current number of archived clauses : 286
% 1.26/0.50 % Clause-clause subsumption calls (NU) : 17783
% 1.26/0.50 % Rec. Clause-clause subsumption calls : 6325
% 1.26/0.50 % Non-unit clause-clause subsumptions : 56
% 1.26/0.50 % Unit Clause-clause subsumption calls : 1833
% 1.26/0.50 % Rewrite failures with RHS unbound : 0
% 1.26/0.50 % BW rewrite match attempts : 94
% 1.26/0.50 % BW rewrite match successes : 23
% 1.26/0.50 % Condensation attempts : 0
% 1.26/0.50 % Condensation successes : 0
% 1.26/0.50 % Termbank termtop insertions : 110042
% 1.26/0.50 % Search garbage collected termcells : 15279
% 1.26/0.50
% 1.26/0.50 % -------------------------------------------------
% 1.26/0.50 % User time : 0.178 s
% 1.26/0.50 % System time : 0.018 s
% 1.26/0.50 % Total time : 0.196 s
% 1.26/0.50 % Maximum resident set size: 6864 pages
% 1.26/0.50
% 1.26/0.50 % -------------------------------------------------
% 1.26/0.50 % User time : 0.341 s
% 1.26/0.50 % System time : 0.044 s
% 1.26/0.50 % Total time : 0.385 s
% 1.26/0.50 % Maximum resident set size: 5376 pages
% 1.26/0.50 % E exiting
%------------------------------------------------------------------------------