TSTP Solution File: NUM653^4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM653^4 : TPTP v8.2.0. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:15:18 EDT 2024
% Result : Theorem 0.61s 0.60s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 51
% Syntax : Number of formulae : 111 ( 63 unt; 29 typ; 0 def)
% Number of atoms : 680 ( 144 equ; 0 cnn)
% Maximal formula atoms : 275 ( 8 avg)
% Number of connectives : 1458 ( 362 ~; 295 |; 43 &; 567 @)
% ( 0 <=>; 191 =>; 0 <=; 0 <~>)
% Maximal formula depth : 50 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 75 ( 75 >; 0 *; 0 +; 0 <<)
% Number of symbols : 32 ( 29 usr; 7 con; 0-3 aty)
% Number of variables : 186 ( 135 ^ 51 !; 0 ?; 186 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
is_of: $i > ( $i > $o ) > $o ).
thf(decl_23,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_25,type,
in: $i > $i > $o ).
thf(decl_61,type,
imp: $o > $o > $o ).
thf(decl_62,type,
d_not: $o > $o ).
thf(decl_65,type,
l_ec: $o > $o > $o ).
thf(decl_66,type,
d_and: $o > $o > $o ).
thf(decl_67,type,
l_or: $o > $o > $o ).
thf(decl_71,type,
non: $i > ( $i > $o ) > $i > $o ).
thf(decl_72,type,
l_some: $i > ( $i > $o ) > $o ).
thf(decl_73,type,
or3: $o > $o > $o > $o ).
thf(decl_74,type,
and3: $o > $o > $o > $o ).
thf(decl_75,type,
ec3: $o > $o > $o > $o ).
thf(decl_76,type,
orec3: $o > $o > $o > $o ).
thf(decl_77,type,
e_is: $i > $i > $i > $o ).
thf(decl_123,type,
nat: $i ).
thf(decl_124,type,
n_is: $i > $i > $o ).
thf(decl_127,type,
n_some: ( $i > $o ) > $o ).
thf(decl_142,type,
n_pl: $i > $i > $i ).
thf(decl_147,type,
diffprop: $i > $i > $i > $o ).
thf(decl_148,type,
d_29_ii: $i > $i > $o ).
thf(decl_149,type,
iii: $i > $i > $o ).
thf(decl_152,type,
lessis: $i > $i > $o ).
thf(decl_190,type,
esk34_2: $i > $i > $i ).
thf(decl_191,type,
esk35_2: $i > $i > $i ).
thf(decl_202,type,
esk46_0: $i ).
thf(decl_203,type,
esk47_0: $i ).
thf(decl_204,type,
esk48_0: $i ).
thf(decl_205,type,
esk49_0: $i ).
thf(def_d_not,axiom,
( d_not
= ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_d_not) ).
thf(def_imp,axiom,
( imp
= ( ^ [X74: $o,X75: $o] :
( X74
=> X75 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_imp) ).
thf(def_l_ec,axiom,
( l_ec
= ( ^ [X79: $o,X80: $o] : ( imp @ X79 @ ( d_not @ X80 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_l_ec) ).
thf(def_d_and,axiom,
( d_and
= ( ^ [X81: $o,X82: $o] : ( d_not @ ( l_ec @ X81 @ X82 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',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/sandbox2/benchmark/Axioms/NUM007^0.ax',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_is_of) ).
thf(def_non,axiom,
( non
= ( ^ [X1: $i,X2: $i > $o,X4: $i] : ( d_not @ ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_non) ).
thf(def_l_or,axiom,
( l_or
= ( ^ [X83: $o] : ( imp @ ( d_not @ X83 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_l_or) ).
thf(def_and3,axiom,
( and3
= ( ^ [X92: $o,X93: $o,X94: $o] : ( d_and @ X92 @ ( d_and @ X93 @ X94 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',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/sandbox2/benchmark/Axioms/NUM007^0.ax',def_l_some) ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_e_is) ).
thf(def_or3,axiom,
( or3
= ( ^ [X89: $o,X90: $o,X91: $o] : ( l_or @ X89 @ ( l_or @ X90 @ X91 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',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/sandbox2/benchmark/Axioms/NUM007^0.ax',def_ec3) ).
thf(def_diffprop,axiom,
( diffprop
= ( ^ [X1: $i,X207: $i,X4: $i] : ( n_is @ X1 @ ( n_pl @ X207 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_diffprop) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',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/sandbox2/benchmark/Axioms/NUM007^0.ax',def_orec3) ).
thf(def_iii,axiom,
( iii
= ( ^ [X1: $i,X211: $i] : ( n_some @ ( diffprop @ X211 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_iii) ).
thf(def_n_some,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X411: $i] :
( ( in @ X411 @ nat )
=> ( ( Z0 @ X411 )
=> ~ $true ) )
=> ~ $true ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax',def_n_some) ).
thf(def_d_29_ii,axiom,
( d_29_ii
= ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_d_29_ii) ).
thf(def_lessis,axiom,
( lessis
= ( ^ [X1: $i,X230: $i] : ( l_or @ ( iii @ X1 @ X230 ) @ ( n_is @ X1 @ X230 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_lessis) ).
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/sandbox2/benchmark/theBenchmark.p',satz9) ).
thf(satz10d,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X237: $i] : ( in @ X237 @ nat )
@ ^ [X238: $i] :
( ( lessis @ X1 @ X238 )
=> ( d_not @ ( d_29_ii @ X1 @ X238 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10d) ).
thf(c_0_22,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_not]) ).
thf(c_0_23,plain,
( imp
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_imp]) ).
thf(c_0_24,plain,
( l_ec
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> ( Z1
=> ~ $true ) ) ) ),
inference(fof_simplification,[status(thm)],[def_l_ec]) ).
thf(c_0_25,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_26,plain,
( d_and
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ( Z1
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_and]) ).
thf(c_0_27,plain,
( l_ec
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> ( Z1
=> ~ $true ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_24,c_0_23]),c_0_25]) ).
thf(c_0_28,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_29,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_30,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_non]) ).
thf(c_0_31,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_l_or]) ).
thf(c_0_32,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_33,plain,
( d_and
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ( Z1
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_26,c_0_25]),c_0_27]) ).
thf(c_0_34,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X384: $i] :
( ( in @ X384 @ Z0 )
=> ( ( Z1 @ X384 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_l_some]) ).
thf(c_0_35,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_36,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_30,c_0_25]) ).
thf(c_0_37,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_38,plain,
( or3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( Z0
=> ~ $true )
=> ( ( Z1
=> ~ $true )
=> Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_or3]) ).
thf(c_0_39,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_31,c_0_23]),c_0_25]) ).
thf(c_0_40,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_41,plain,
( and3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( Z0
=> ( ( ( Z1
=> ( Z2
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_32,c_0_33]) ).
thf(c_0_42,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X384: $i] :
( ( in @ X384 @ Z0 )
=> ( ( Z1 @ X384 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_34,c_0_35]),c_0_25]),c_0_36]) ).
thf(c_0_43,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_diffprop]) ).
thf(c_0_44,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_37]) ).
thf(c_0_45,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_46,plain,
( or3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( Z0
=> ~ $true )
=> ( ( Z1
=> ~ $true )
=> Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_38,c_0_39]) ).
thf(c_0_47,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_40,c_0_27]),c_0_41]) ).
thf(c_0_48,plain,
( iii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X423: $i] :
( ( in @ X423 @ nat )
=> ( ( Z1
= ( n_pl @ Z0 @ X423 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_iii]) ).
thf(c_0_49,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X411: $i] :
( ( in @ X411 @ nat )
=> ( ( Z0 @ X411 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[def_n_some,c_0_42]) ).
thf(c_0_50,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_43,c_0_44]) ).
thf(c_0_51,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_45,c_0_33]),c_0_46]),c_0_47]) ).
thf(c_0_52,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X422: $i] :
( ( in @ X422 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X422 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).
thf(c_0_53,plain,
( lessis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( ! [X427: $i] :
( ( in @ X427 @ nat )
=> ( ( Z1
= ( n_pl @ Z0 @ X427 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_lessis]) ).
thf(c_0_54,plain,
( iii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X423: $i] :
( ( in @ X423 @ nat )
=> ( ( Z1
= ( n_pl @ Z0 @ X423 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
thf(c_0_55,plain,
! [X555: $i] :
( ( in @ X555 @ nat )
=> ! [X554: $i] :
( ( in @ X554 @ nat )
=> ( ( ( ( ( X555 = X554 )
=> ~ $true )
=> ( ( ( ! [X552: $i] :
( ( in @ X552 @ nat )
=> ( ( X555
= ( n_pl @ X554 @ X552 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true )
=> ( ! [X553: $i] :
( ( in @ X553 @ nat )
=> ( ( X554
= ( n_pl @ X555 @ X553 ) )
=> ~ $true ) )
=> ~ $true ) ) )
=> ( ( ( ( ( X555 = X554 )
=> ( ( ! [X552: $i] :
( ( in @ X552 @ nat )
=> ( ( X555
= ( n_pl @ X554 @ X552 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ( ( ( ( ( ! [X552: $i] :
( ( in @ X552 @ nat )
=> ( ( X555
= ( n_pl @ X554 @ X552 ) )
=> ~ $true ) )
=> ~ $true )
=> ( ( ! [X553: $i] :
( ( in @ X553 @ nat )
=> ( ( X554
= ( n_pl @ X555 @ X553 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ( ( ( ! [X553: $i] :
( ( in @ X553 @ nat )
=> ( ( X554
= ( n_pl @ X555 @ X553 ) )
=> ~ $true ) )
=> ~ $true )
=> ( ( X555 = X554 )
=> ~ $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_35]),c_0_51]),c_0_44]),c_0_49]) ).
thf(c_0_56,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X422: $i] :
( ( in @ X422 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X422 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_52,c_0_49]),c_0_50]) ).
thf(c_0_57,plain,
( lessis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( ! [X427: $i] :
( ( in @ X427 @ nat )
=> ( ( Z1
= ( n_pl @ Z0 @ X427 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_53,c_0_39]),c_0_44]),c_0_54]) ).
thf(c_0_58,plain,
! [X1094: $i,X1095: $i,X1098: $i,X1099: $i,X1100: $i,X1101: $i] :
( ( ( in @ ( esk35_2 @ X1094 @ X1095 ) @ nat )
| ~ $true
| ( in @ ( esk34_2 @ X1094 @ X1095 ) @ nat )
| ~ $true
| ( X1094 = X1095 )
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ( X1095
= ( n_pl @ X1094 @ ( esk35_2 @ X1094 @ X1095 ) ) )
| ~ $true
| ( in @ ( esk34_2 @ X1094 @ X1095 ) @ nat )
| ~ $true
| ( X1094 = X1095 )
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( $true
| ~ $true
| ( in @ ( esk34_2 @ X1094 @ X1095 ) @ nat )
| ~ $true
| ( X1094 = X1095 )
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ( in @ ( esk35_2 @ X1094 @ X1095 ) @ nat )
| ~ $true
| ( X1094
= ( n_pl @ X1095 @ ( esk34_2 @ X1094 @ X1095 ) ) )
| ~ $true
| ( X1094 = X1095 )
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ( X1095
= ( n_pl @ X1094 @ ( esk35_2 @ X1094 @ X1095 ) ) )
| ~ $true
| ( X1094
= ( n_pl @ X1095 @ ( esk34_2 @ X1094 @ X1095 ) ) )
| ~ $true
| ( X1094 = X1095 )
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( $true
| ~ $true
| ( X1094
= ( n_pl @ X1095 @ ( esk34_2 @ X1094 @ X1095 ) ) )
| ~ $true
| ( X1094 = X1095 )
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ( in @ ( esk35_2 @ X1094 @ X1095 ) @ nat )
| ~ $true
| $true
| ~ $true
| ( X1094 = X1095 )
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ( X1095
= ( n_pl @ X1094 @ ( esk35_2 @ X1094 @ X1095 ) ) )
| ~ $true
| $true
| ~ $true
| ( X1094 = X1095 )
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( $true
| ~ $true
| $true
| ~ $true
| ( X1094 = X1095 )
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ( in @ ( esk35_2 @ X1094 @ X1095 ) @ nat )
| ~ $true
| $true
| ( X1094 = X1095 )
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ( X1095
= ( n_pl @ X1094 @ ( esk35_2 @ X1094 @ X1095 ) ) )
| ~ $true
| $true
| ( X1094 = X1095 )
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( $true
| ~ $true
| $true
| ( X1094 = X1095 )
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ( in @ ( esk35_2 @ X1094 @ X1095 ) @ nat )
| ~ $true
| ( in @ ( esk34_2 @ X1094 @ X1095 ) @ nat )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ( X1095
= ( n_pl @ X1094 @ ( esk35_2 @ X1094 @ X1095 ) ) )
| ~ $true
| ( in @ ( esk34_2 @ X1094 @ X1095 ) @ nat )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( $true
| ~ $true
| ( in @ ( esk34_2 @ X1094 @ X1095 ) @ nat )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ( in @ ( esk35_2 @ X1094 @ X1095 ) @ nat )
| ~ $true
| ( X1094
= ( n_pl @ X1095 @ ( esk34_2 @ X1094 @ X1095 ) ) )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ( X1095
= ( n_pl @ X1094 @ ( esk35_2 @ X1094 @ X1095 ) ) )
| ~ $true
| ( X1094
= ( n_pl @ X1095 @ ( esk34_2 @ X1094 @ X1095 ) ) )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( $true
| ~ $true
| ( X1094
= ( n_pl @ X1095 @ ( esk34_2 @ X1094 @ X1095 ) ) )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ( in @ ( esk35_2 @ X1094 @ X1095 ) @ nat )
| ~ $true
| $true
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ( X1095
= ( n_pl @ X1094 @ ( esk35_2 @ X1094 @ X1095 ) ) )
| ~ $true
| $true
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( $true
| ~ $true
| $true
| ~ $true
| $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ( in @ ( esk35_2 @ X1094 @ X1095 ) @ nat )
| ~ $true
| $true
| $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ( X1095
= ( n_pl @ X1094 @ ( esk35_2 @ X1094 @ X1095 ) ) )
| ~ $true
| $true
| $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( $true
| ~ $true
| $true
| $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ~ ( in @ X1098 @ nat )
| ( X1094
!= ( n_pl @ X1095 @ X1098 ) )
| ~ $true
| ~ $true
| ( X1094 != X1095 )
| ~ $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( $true
| ~ $true
| ( X1094 != X1095 )
| ~ $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ~ ( in @ X1100 @ nat )
| ( X1095
!= ( n_pl @ X1094 @ X1100 ) )
| ~ $true
| ~ $true
| ~ ( in @ X1099 @ nat )
| ( X1094
!= ( n_pl @ X1095 @ X1099 ) )
| ~ $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( $true
| ~ $true
| ~ ( in @ X1099 @ nat )
| ( X1094
!= ( n_pl @ X1095 @ X1099 ) )
| ~ $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ~ ( in @ X1100 @ nat )
| ( X1095
!= ( n_pl @ X1094 @ X1100 ) )
| ~ $true
| ~ $true
| $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( $true
| ~ $true
| $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( ~ ( in @ X1101 @ nat )
| ( X1095
!= ( n_pl @ X1094 @ X1101 ) )
| ~ $true
| ( X1094 != X1095 )
| ~ $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( $true
| ( X1094 != X1095 )
| ~ $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( $true
| ~ $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ nat ) )
& ( $true
| ~ $true
| ~ ( in @ X1095 @ nat )
| ~ ( in @ X1094 @ 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_55])])])])])]) ).
thf(c_0_59,negated_conjecture,
~ ! [X599: $i] :
( ( in @ X599 @ nat )
=> ! [X598: $i] :
( ( in @ X598 @ nat )
=> ( ( ( ( ! [X596: $i] :
( ( in @ X596 @ nat )
=> ( ( X598
= ( n_pl @ X599 @ X596 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true )
=> ( X599 = X598 ) )
=> ( ( ! [X597: $i] :
( ( in @ X597 @ nat )
=> ( ( X599
= ( n_pl @ X598 @ X597 ) )
=> ~ $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)],[inference(assume_negation,[status(cth)],[satz10d])]),c_0_35]),c_0_25]),c_0_56]),c_0_57]) ).
thf(c_0_60,plain,
! [X1: $i,X4: $i,X5: $i] :
( ~ ( in @ X1 @ nat )
| ( X4
!= ( n_pl @ X5 @ X1 ) )
| ~ $true
| ( X5 != X4 )
| ~ $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X4 @ nat )
| ~ ( in @ X5 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
thf(c_0_61,negated_conjecture,
( ( in @ esk46_0 @ nat )
& ( in @ esk47_0 @ nat )
& ( ( in @ esk48_0 @ nat )
| ~ $true
| ( esk46_0 = esk47_0 ) )
& ( ( esk47_0
= ( n_pl @ esk46_0 @ esk48_0 ) )
| ~ $true
| ( esk46_0 = esk47_0 ) )
& ( $true
| ~ $true
| ( esk46_0 = esk47_0 ) )
& ( $true
| ( esk46_0 = esk47_0 ) )
& ( ( in @ esk49_0 @ nat )
| ~ $true )
& ( ( esk46_0
= ( n_pl @ esk47_0 @ esk49_0 ) )
| ~ $true )
& ( $true
| ~ $true )
& $true ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_59])])])])]) ).
thf(c_0_62,plain,
! [X5: $i,X4: $i,X1: $i] :
( ( X4 != X5 )
| ( X4
!= ( n_pl @ X5 @ X1 ) )
| ~ ( in @ X5 @ nat )
| ~ ( in @ X4 @ nat )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_60]) ).
thf(c_0_63,negated_conjecture,
( ( esk46_0
= ( n_pl @ esk47_0 @ esk49_0 ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
thf(c_0_64,negated_conjecture,
( ( in @ esk49_0 @ nat )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
thf(c_0_65,plain,
! [X1: $i,X4: $i,X6: $i,X5: $i] :
( ~ ( in @ X1 @ nat )
| ( X4
!= ( n_pl @ X5 @ X1 ) )
| ~ $true
| ~ $true
| ~ ( in @ X6 @ nat )
| ( X5
!= ( n_pl @ X4 @ X6 ) )
| ~ $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X4 @ nat )
| ~ ( in @ X5 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
thf(c_0_66,negated_conjecture,
( ( esk47_0
= ( n_pl @ esk46_0 @ esk48_0 ) )
| ( esk46_0 = esk47_0 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
thf(c_0_67,plain,
! [X1: $i,X4: $i] :
( ( ( n_pl @ X1 @ X4 )
!= X1 )
| ~ ( in @ ( n_pl @ X1 @ X4 ) @ nat )
| ~ ( in @ X1 @ nat )
| ~ ( in @ X4 @ nat ) ),
inference(er,[status(thm)],[c_0_62]) ).
thf(c_0_68,negated_conjecture,
( esk46_0
= ( n_pl @ esk47_0 @ esk49_0 ) ),
inference(cn,[status(thm)],[c_0_63]) ).
thf(c_0_69,negated_conjecture,
in @ esk46_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_61]) ).
thf(c_0_70,negated_conjecture,
in @ esk47_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_61]) ).
thf(c_0_71,negated_conjecture,
in @ esk49_0 @ nat,
inference(cn,[status(thm)],[c_0_64]) ).
thf(c_0_72,negated_conjecture,
( ( in @ esk48_0 @ nat )
| ( esk46_0 = esk47_0 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
thf(c_0_73,plain,
! [X6: $i,X5: $i,X4: $i,X1: $i] :
( ( X5
!= ( n_pl @ X4 @ X6 ) )
| ( X4
!= ( n_pl @ X5 @ X1 ) )
| ~ ( in @ X6 @ nat )
| ~ ( in @ X5 @ nat )
| ~ ( in @ X4 @ nat )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_65]) ).
thf(c_0_74,negated_conjecture,
( ( esk47_0 = esk46_0 )
| ( esk47_0
= ( n_pl @ esk46_0 @ esk48_0 ) ) ),
inference(cn,[status(thm)],[c_0_66]) ).
thf(c_0_75,negated_conjecture,
esk47_0 != esk46_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_70]),c_0_71])]) ).
thf(c_0_76,negated_conjecture,
( ( esk47_0 = esk46_0 )
| ( in @ esk48_0 @ nat ) ),
inference(cn,[status(thm)],[c_0_72]) ).
thf(c_0_77,plain,
! [X1: $i,X4: $i,X5: $i] :
( ( ( n_pl @ ( n_pl @ X1 @ X4 ) @ X5 )
!= X1 )
| ~ ( in @ ( n_pl @ X1 @ X4 ) @ nat )
| ~ ( in @ X4 @ nat )
| ~ ( in @ X1 @ nat )
| ~ ( in @ X5 @ nat ) ),
inference(er,[status(thm)],[c_0_73]) ).
thf(c_0_78,negated_conjecture,
( ( n_pl @ esk46_0 @ esk48_0 )
= esk47_0 ),
inference(sr,[status(thm)],[c_0_74,c_0_75]) ).
thf(c_0_79,negated_conjecture,
in @ esk48_0 @ nat,
inference(sr,[status(thm)],[c_0_76,c_0_75]) ).
thf(c_0_80,negated_conjecture,
! [X1: $i] :
( ( ( n_pl @ esk47_0 @ X1 )
!= esk46_0 )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_70]),c_0_79]),c_0_69])]) ).
thf(c_0_81,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_68]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM653^4 : TPTP v8.2.0. Released v7.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 07:32:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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/benchmark/theBenchmark.p
% 0.51/0.56 # Type mismatch in argument #1 of indeq @ ($not @ db(4)) @ ($db_lam @ db(0) @ ($db_lam @ db(0) @ ($@_var @ db(6) @ db(1) @ db(0)))) @ db(3) @ (d_11_i @ ($not @ db(4)) @ ($db_lam @ db(0) @ ($db_lam @ db(0) @ ($@_var @ db(6) @ db(1) @ db(0)))) @ db(3) @ db(2) @ db(1)) @ db(0): expected $i but got $o
% 0.51/0.56 eprover: Type error
% 0.61/0.60 # Version: 3.1.0-ho
% 0.61/0.60 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.61/0.60 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.60 # Starting lpo1_fix with 900s (3) cores
% 0.61/0.60 # Starting full_lambda_9 with 300s (1) cores
% 0.61/0.60 # Starting almost_fo_4 with 300s (1) cores
% 0.61/0.60 # Starting new_ho_9 with 300s (1) cores
% 0.61/0.60 # Starting pre_casc_4 with 300s (1) cores
% 0.61/0.60 # Starting ho_unfolding_6 with 300s (1) cores
% 0.61/0.60 # almost_fo_4 with pid 8213 completed with status 0
% 0.61/0.60 # Result found by almost_fo_4
% 0.61/0.60 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.61/0.60 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.60 # Starting lpo1_fix with 900s (3) cores
% 0.61/0.60 # Starting full_lambda_9 with 300s (1) cores
% 0.61/0.60 # Starting almost_fo_4 with 300s (1) cores
% 0.61/0.60 # No SInE strategy applied
% 0.61/0.60 # Search class: HGHSM-FSLM32-DHSMMSBN
% 0.61/0.60 # partial match(1): HGHSM-FSLM32-MHSMMSBN
% 0.61/0.60 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.61/0.60 # Starting full_lambda_5 with 28s (1) cores
% 0.61/0.60 # full_lambda_5 with pid 8220 completed with status 0
% 0.61/0.60 # Result found by full_lambda_5
% 0.61/0.60 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.61/0.60 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.60 # Starting lpo1_fix with 900s (3) cores
% 0.61/0.60 # Starting full_lambda_9 with 300s (1) cores
% 0.61/0.60 # Starting almost_fo_4 with 300s (1) cores
% 0.61/0.60 # No SInE strategy applied
% 0.61/0.60 # Search class: HGHSM-FSLM32-DHSMMSBN
% 0.61/0.60 # partial match(1): HGHSM-FSLM32-MHSMMSBN
% 0.61/0.60 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.61/0.60 # Starting full_lambda_5 with 28s (1) cores
% 0.61/0.60 # Preprocessing time : 0.006 s
% 0.61/0.60 # Presaturation interreduction done
% 0.61/0.60
% 0.61/0.60 # Proof found!
% 0.61/0.60 # SZS status Theorem
% 0.61/0.60 # SZS output start CNFRefutation
% See solution above
% 0.61/0.60 # Parsed axioms : 352
% 0.61/0.60 # Removed by relevancy pruning/SinE : 0
% 0.61/0.60 # Initial clauses : 577
% 0.61/0.60 # Removed in clause preprocessing : 316
% 0.61/0.60 # Initial clauses in saturation : 261
% 0.61/0.60 # Processed clauses : 420
% 0.61/0.60 # ...of these trivial : 4
% 0.61/0.60 # ...subsumed : 36
% 0.61/0.60 # ...remaining for further processing : 380
% 0.61/0.60 # Other redundant clauses eliminated : 42
% 0.61/0.60 # Clauses deleted for lack of memory : 0
% 0.61/0.60 # Backward-subsumed : 2
% 0.61/0.60 # Backward-rewritten : 1
% 0.61/0.60 # Generated clauses : 495
% 0.61/0.60 # ...of the previous two non-redundant : 463
% 0.61/0.60 # ...aggressively subsumed : 0
% 0.61/0.60 # Contextual simplify-reflections : 5
% 0.61/0.60 # Paramodulations : 423
% 0.61/0.60 # Factorizations : 0
% 0.61/0.60 # NegExts : 0
% 0.61/0.60 # Equation resolutions : 45
% 0.61/0.60 # Disequality decompositions : 0
% 0.61/0.60 # Total rewrite steps : 88
% 0.61/0.60 # ...of those cached : 62
% 0.61/0.60 # Propositional unsat checks : 0
% 0.61/0.60 # Propositional check models : 0
% 0.61/0.60 # Propositional check unsatisfiable : 0
% 0.61/0.60 # Propositional clauses : 0
% 0.61/0.60 # Propositional clauses after purity: 0
% 0.61/0.60 # Propositional unsat core size : 0
% 0.61/0.60 # Propositional preprocessing time : 0.000
% 0.61/0.60 # Propositional encoding time : 0.000
% 0.61/0.60 # Propositional solver time : 0.000
% 0.61/0.60 # Success case prop preproc time : 0.000
% 0.61/0.60 # Success case prop encoding time : 0.000
% 0.61/0.60 # Success case prop solver time : 0.000
% 0.61/0.60 # Current number of processed clauses : 121
% 0.61/0.60 # Positive orientable unit clauses : 47
% 0.61/0.60 # Positive unorientable unit clauses: 2
% 0.61/0.60 # Negative unit clauses : 14
% 0.61/0.60 # Non-unit-clauses : 58
% 0.61/0.60 # Current number of unprocessed clauses: 529
% 0.61/0.60 # ...number of literals in the above : 1390
% 0.61/0.60 # Current number of archived formulas : 0
% 0.61/0.60 # Current number of archived clauses : 232
% 0.61/0.60 # Clause-clause subsumption calls (NU) : 8522
% 0.61/0.60 # Rec. Clause-clause subsumption calls : 1609
% 0.61/0.60 # Non-unit clause-clause subsumptions : 39
% 0.61/0.60 # Unit Clause-clause subsumption calls : 404
% 0.61/0.60 # Rewrite failures with RHS unbound : 2
% 0.61/0.60 # BW rewrite match attempts : 48
% 0.61/0.60 # BW rewrite match successes : 17
% 0.61/0.60 # Condensation attempts : 0
% 0.61/0.60 # Condensation successes : 0
% 0.61/0.60 # Termbank termtop insertions : 70309
% 0.61/0.60 # Search garbage collected termcells : 19290
% 0.61/0.60
% 0.61/0.60 # -------------------------------------------------
% 0.61/0.60 # User time : 0.090 s
% 0.61/0.60 # System time : 0.009 s
% 0.61/0.60 # Total time : 0.099 s
% 0.61/0.60 # Maximum resident set size: 5112 pages
% 0.61/0.60
% 0.61/0.60 # -------------------------------------------------
% 0.61/0.60 # User time : 0.097 s
% 0.61/0.60 # System time : 0.014 s
% 0.61/0.60 # Total time : 0.110 s
% 0.61/0.60 # Maximum resident set size: 2212 pages
% 0.61/0.60 % E---3.1 exiting
% 0.61/0.60 % E exiting
%------------------------------------------------------------------------------