%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM676^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 : n019.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:24 AM UTC 2026
% Result : Theorem 0.93s 0.48s
% Output : CNFRefutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 48 ( 34 unt; 0 typ; 0 def)
% Number of atoms : 185 ( 52 equ; 0 cnn)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 372 ( 46 ~; 18 |; 9 &; 253 @)
% ( 0 <=>; 46 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 19 usr; 8 con; 0-3 aty)
% Number of variables : 111 ( 82 ^; 29 !; 0 ?; 111 :)
% 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_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_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_225,type,
esk68_0: $i ).
thf(decl_226,type,
esk69_0: $i ).
thf(decl_227,type,
esk70_0: $i ).
thf(decl_228,type,
esk71_0: $i ).
thf(decl_229,type,
esk72_0: $i ).
thf(def_d_not,axiom,
( d_not
= ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JOkYiPd7Xa/E---3.1_694111.p',def_d_not) ).
thf(def_imp,axiom,
( imp
= ( ^ [X74: $o,X75: $o] :
( X74
=> X75 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JOkYiPd7Xa/E---3.1_694111.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.JOkYiPd7Xa/E---3.1_694111.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JOkYiPd7Xa/E---3.1_694111.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.JOkYiPd7Xa/E---3.1_694111.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.JOkYiPd7Xa/E---3.1_694111.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.JOkYiPd7Xa/E---3.1_694111.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.JOkYiPd7Xa/E---3.1_694111.p',def_diffprop) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JOkYiPd7Xa/E---3.1_694111.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.JOkYiPd7Xa/E---3.1_694111.p',def_d_29_ii) ).
thf(def_n_some,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X453: $i] :
( ( in @ X453 @ nat )
=> ( ( Z0 @ X453 )
=> ~ $true ) )
=> ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JOkYiPd7Xa/E---3.1_694111.p',def_n_some) ).
thf(satz19g,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X279: $i] : ( in @ X279 @ nat )
@ ^ [X280: $i] :
( all_of
@ ^ [X4: $i] : ( in @ X4 @ nat )
@ ^ [X4: $i] :
( all_of
@ ^ [X13: $i] : ( in @ X13 @ nat )
@ ^ [X13: $i] :
( ( n_is @ X1 @ X280 )
=> ( ( d_29_ii @ X4 @ X13 )
=> ( d_29_ii @ ( n_pl @ X1 @ X4 ) @ ( n_pl @ X280 @ X13 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JOkYiPd7Xa/E---3.1_694111.p',satz19g) ).
thf(satz5,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X194: $i] : ( in @ X194 @ nat )
@ ^ [X195: $i] :
( all_of
@ ^ [X4: $i] : ( in @ X4 @ nat )
@ ^ [X4: $i] : ( n_is @ ( n_pl @ ( n_pl @ X1 @ X195 ) @ X4 ) @ ( n_pl @ X1 @ ( n_pl @ X195 @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JOkYiPd7Xa/E---3.1_694111.p',satz5) ).
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] :
( ! [X426: $i] :
( ( in @ X426 @ Z0 )
=> ( ( Z1 @ X426 )
=> ~ $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] :
( ! [X426: $i] :
( ( in @ X426 @ Z0 )
=> ( ( Z1 @ X426 )
=> ~ $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] :
( ! [X464: $i] :
( ( in @ X464 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X464 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).
thf(c_0_27,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X453: $i] :
( ( in @ X453 @ nat )
=> ( ( Z0 @ X453 )
=> ~ $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] :
( all_of
@ ^ [X279: $i] : ( in @ X279 @ nat )
@ ^ [X280: $i] :
( all_of
@ ^ [X4: $i] : ( in @ X4 @ nat )
@ ^ [X4: $i] :
( all_of
@ ^ [X13: $i] : ( in @ X13 @ nat )
@ ^ [X13: $i] :
( ( n_is @ X1 @ X280 )
=> ( ( d_29_ii @ X4 @ X13 )
=> ( d_29_ii @ ( n_pl @ X1 @ X4 ) @ ( n_pl @ X280 @ X13 ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[satz19g]) ).
thf(c_0_30,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X464: $i] :
( ( in @ X464 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X464 ) )
=> ~ $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,
~ ! [X743: $i] :
( ( in @ X743 @ nat )
=> ! [X742: $i] :
( ( in @ X742 @ nat )
=> ! [X741: $i] :
( ( in @ X741 @ nat )
=> ! [X740: $i] :
( ( in @ X740 @ nat )
=> ( ( X743 = X742 )
=> ( ( ! [X738: $i] :
( ( in @ X738 @ nat )
=> ( ( X741
= ( n_pl @ X740 @ X738 ) )
=> ~ $true ) )
=> ~ $true )
=> ( ! [X739: $i] :
( ( in @ X739 @ nat )
=> ( ( ( n_pl @ X743 @ X741 )
= ( n_pl @ ( n_pl @ X742 @ X740 ) @ X739 ) )
=> ~ $true ) )
=> ~ $true ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_29]),c_0_20]),c_0_25]),c_0_30]) ).
thf(c_0_32,negated_conjecture,
! [X1399: $i] :
( ( in @ esk68_0 @ nat )
& ( in @ esk69_0 @ nat )
& ( in @ esk70_0 @ nat )
& ( in @ esk71_0 @ nat )
& ( esk68_0 = esk69_0 )
& ( ( in @ esk72_0 @ nat )
| ~ $true )
& ( ( esk70_0
= ( n_pl @ esk71_0 @ esk72_0 ) )
| ~ $true )
& ( $true
| ~ $true )
& ( ~ ( in @ X1399 @ nat )
| ( ( n_pl @ esk68_0 @ esk70_0 )
!= ( n_pl @ ( n_pl @ esk69_0 @ esk71_0 ) @ X1399 ) )
| ~ $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_31])])])])])]) ).
thf(c_0_33,negated_conjecture,
! [X1: $i] :
( ~ ( in @ X1 @ nat )
| ( ( n_pl @ esk68_0 @ esk70_0 )
!= ( n_pl @ ( n_pl @ esk69_0 @ esk71_0 ) @ X1 ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_34,plain,
! [X579: $i] :
( ( in @ X579 @ nat )
=> ! [X578: $i] :
( ( in @ X578 @ nat )
=> ! [X577: $i] :
( ( in @ X577 @ nat )
=> ( ( n_pl @ ( n_pl @ X579 @ X578 ) @ X577 )
= ( n_pl @ X579 @ ( n_pl @ X578 @ X577 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz5]),c_0_20]),c_0_25]) ).
thf(c_0_35,negated_conjecture,
! [X1: $i] :
( ( ( n_pl @ esk68_0 @ esk70_0 )
!= ( n_pl @ ( n_pl @ esk69_0 @ esk71_0 ) @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_33]) ).
thf(c_0_36,negated_conjecture,
esk68_0 = esk69_0,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_37,plain,
! [X1221: $i,X1222: $i,X1223: $i] :
( ~ ( in @ X1221 @ nat )
| ~ ( in @ X1222 @ nat )
| ~ ( in @ X1223 @ nat )
| ( ( n_pl @ ( n_pl @ X1221 @ X1222 ) @ X1223 )
= ( n_pl @ X1221 @ ( n_pl @ X1222 @ X1223 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])]) ).
thf(c_0_38,negated_conjecture,
! [X1: $i] :
( ( ( n_pl @ ( n_pl @ esk68_0 @ esk71_0 ) @ X1 )
!= ( n_pl @ esk68_0 @ esk70_0 ) )
| ~ ( in @ X1 @ nat ) ),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
thf(c_0_39,plain,
! [X1: $i,X4: $i,X5: $i] :
( ( ( n_pl @ ( n_pl @ X1 @ X4 ) @ X5 )
= ( n_pl @ X1 @ ( n_pl @ X4 @ X5 ) ) )
| ~ ( in @ X1 @ nat )
| ~ ( in @ X4 @ nat )
| ~ ( in @ X5 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
thf(c_0_40,negated_conjecture,
in @ esk71_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_41,negated_conjecture,
in @ esk68_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_42,negated_conjecture,
( ( esk70_0
= ( n_pl @ esk71_0 @ esk72_0 ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_43,negated_conjecture,
( ( in @ esk72_0 @ nat )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_44,negated_conjecture,
! [X1: $i] :
( ( ( n_pl @ esk68_0 @ ( n_pl @ esk71_0 @ X1 ) )
!= ( n_pl @ esk68_0 @ esk70_0 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41])]) ).
thf(c_0_45,negated_conjecture,
( esk70_0
= ( n_pl @ esk71_0 @ esk72_0 ) ),
inference(cn,[status(thm)],[c_0_42]) ).
thf(c_0_46,negated_conjecture,
in @ esk72_0 @ nat,
inference(cn,[status(thm)],[c_0_43]) ).
thf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM676^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.09/0.16 % Computer : n019.cluster.edu
% 0.09/0.16 % Model : x86_64 x86_64
% 0.09/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16 % Memory : 8046.5625MB
% 0.09/0.16 % OS : Linux 6.8.0-71-generic
% 0.09/0.16 % CPULimit : 300
% 0.09/0.16 % WCLimit : 300
% 0.09/0.16 % DateTime : Tue Sep 29 12:36:18 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 Running higher-order theorem proving
% 0.09/0.24 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.JOkYiPd7Xa/E---3.1_694111.p
% 0.93/0.48 % Version: 3.5.1-ho
% 0.93/0.48 % Preprocessing class: HSLMSMSSLLLCHSA.
% 0.93/0.48 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.48 % Starting lpo1_fix with 900s (3) cores
% 0.93/0.48 % Starting full_lambda_9 with 300s (1) cores
% 0.93/0.48 % Starting almost_fo_4 with 300s (1) cores
% 0.93/0.48 % Starting new_ho_9 with 300s (1) cores
% 0.93/0.48 % Starting pre_casc_4 with 300s (1) cores
% 0.93/0.48 % Starting ho_unfolding_6 with 300s (1) cores
% 0.93/0.48 % lpo1_fix with pid 694124 completed with status 0
% 0.93/0.48 % Result found by lpo1_fix
% 0.93/0.48 % Preprocessing class: HSLMSMSSLLLCHSA.
% 0.93/0.48 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.48 % Starting lpo1_fix with 900s (3) cores
% 0.93/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.93/0.48 % No SInE strategy applied
% 0.93/0.48 % Search class: HGHSM-FSLM32-MHSMMSBN
% 0.93/0.48 % Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 0.93/0.48 % Starting SubtermCWHack with 91s (1) cores
% 0.93/0.48 % Starting full_lambda_5 with 82s (1) cores
% 0.93/0.48 % Starting new_ho_6 with 82s (1) cores
% 0.93/0.48 % full_lambda_5 with pid 694131 completed with status 0
% 0.93/0.48 % Result found by full_lambda_5
% 0.93/0.48 % Preprocessing class: HSLMSMSSLLLCHSA.
% 0.93/0.48 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.48 % Starting lpo1_fix with 900s (3) cores
% 0.93/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.93/0.48 % No SInE strategy applied
% 0.93/0.48 % Search class: HGHSM-FSLM32-MHSMMSBN
% 0.93/0.48 % Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 0.93/0.48 % Starting SubtermCWHack with 91s (1) cores
% 0.93/0.48 % Starting full_lambda_5 with 82s (1) cores
% 0.93/0.48 % Preprocessing time : 0.007 s
% 0.93/0.48 % Presaturation interreduction done
% 0.93/0.48
% 0.93/0.48 % Proof found!
% 0.93/0.48 % SZS status Theorem
% 0.93/0.48 % SZS output start CNFRefutation
% See solution above
% 0.93/0.48 % Parsed axioms : 375
% 0.93/0.48 % Removed by relevancy pruning/SinE : 0
% 0.93/0.48 % Initial clauses : 898
% 0.93/0.48 % Removed in clause preprocessing : 507
% 0.93/0.48 % Initial clauses in saturation : 391
% 0.93/0.48 % Processed clauses : 795
% 0.93/0.48 % ...of these trivial : 6
% 0.93/0.48 % ...subsumed : 64
% 0.93/0.48 % ...remaining for further processing : 725
% 0.93/0.48 % Other redundant clauses eliminated : 201
% 0.93/0.48 % Clauses deleted for lack of memory : 0
% 0.93/0.48 % Backward-subsumed : 8
% 0.93/0.48 % Backward-rewritten : 10
% 0.93/0.48 % Generated clauses : 2033
% 0.93/0.48 % ...of the previous two non-redundant : 1876
% 0.93/0.48 % ...aggressively subsumed : 0
% 0.93/0.48 % Contextual simplify-reflections : 14
% 0.93/0.48 % Paramodulations : 1704
% 0.93/0.48 % Factorizations : 2
% 0.93/0.48 % NegExts : 8
% 0.93/0.48 % Equation resolutions : 204
% 0.93/0.48 % Disequality decompositions : 0
% 0.93/0.48 % Total rewrite steps : 394
% 0.93/0.48 % ...of those cached : 278
% 0.93/0.48 % Propositional unsat checks : 0
% 0.93/0.48 % Propositional check models : 0
% 0.93/0.48 % Propositional check unsatisfiable : 0
% 0.93/0.48 % Propositional clauses : 0
% 0.93/0.48 % Propositional clauses after purity: 0
% 0.93/0.48 % Propositional unsat core size : 0
% 0.93/0.48 % Propositional preprocessing time : 0.000
% 0.93/0.48 % Propositional encoding time : 0.000
% 0.93/0.48 % Propositional solver time : 0.000
% 0.93/0.48 % Success case prop preproc time : 0.000
% 0.93/0.48 % Success case prop encoding time : 0.000
% 0.93/0.48 % Success case prop solver time : 0.000
% 0.93/0.48 % Current number of processed clauses : 277
% 0.93/0.48 % Positive orientable unit clauses : 98
% 0.93/0.48 % Positive unorientable unit clauses: 4
% 0.93/0.48 % Negative unit clauses : 17
% 0.93/0.48 % Non-unit-clauses : 158
% 0.93/0.48 % Current number of unprocessed clauses: 1813
% 0.93/0.48 % ...number of literals in the above : 5207
% 0.93/0.48 % Current number of archived formulas : 0
% 0.93/0.48 % Current number of archived clauses : 370
% 0.93/0.48 % Clause-clause subsumption calls (NU) : 48065
% 0.93/0.48 % Rec. Clause-clause subsumption calls : 9722
% 0.93/0.48 % Non-unit clause-clause subsumptions : 71
% 0.93/0.48 % Unit Clause-clause subsumption calls : 2481
% 0.93/0.48 % Rewrite failures with RHS unbound : 0
% 0.93/0.48 % BW rewrite match attempts : 98
% 0.93/0.48 % BW rewrite match successes : 22
% 0.93/0.48 % Condensation attempts : 0
% 0.93/0.48 % Condensation successes : 0
% 0.93/0.48 % Termbank termtop insertions : 138496
% 0.93/0.48 % Search garbage collected termcells : 32339
% 0.93/0.48
% 0.93/0.48 % -------------------------------------------------
% 0.93/0.48 % User time : 0.121 s
% 0.93/0.48 % System time : 0.011 s
% 0.93/0.48 % Total time : 0.132 s
% 0.93/0.48 % Maximum resident set size: 8576 pages
% 0.93/0.48
% 0.93/0.48 % -------------------------------------------------
% 0.93/0.48 % User time : 0.368 s
% 0.93/0.48 % System time : 0.042 s
% 0.93/0.48 % Total time : 0.410 s
% 0.93/0.48 % Maximum resident set size: 5120 pages
% 0.93/0.48 % E exiting
%------------------------------------------------------------------------------