%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM924+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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 : 600s
% DateTime : Mon Jul 18 09:37:41 EDT 2022
% Result : Theorem 0.29s 1.47s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 67 ( 54 unt; 0 def)
% Number of atoms : 87 ( 40 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 43 ( 23 ~; 14 |; 2 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 63 ( 10 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_64_le__special_I2_J,axiom,
! [X4] :
( ord_less_eq_int(one_one_int,number_number_of_int(X4))
<=> ord_less_eq_int(bit1(pls),X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_64_le__special_I2_J) ).
fof(fact_24_number__of__is__id,axiom,
! [X11] : number_number_of_int(X11) = X11,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_24_number__of__is__id) ).
fof(fact_63_le__special_I4_J,axiom,
! [X3] :
( ord_less_eq_int(number_number_of_int(X3),one_one_int)
<=> ord_less_eq_int(X3,bit1(pls)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_63_le__special_I4_J) ).
fof(fact_105_zero__is__num__zero,axiom,
zero_zero_int = number_number_of_int(pls),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_105_zero__is__num__zero) ).
fof(fact_7_not__sum__power2__lt__zero,axiom,
! [X1,X2] : ~ ord_less_int(plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))),zero_zero_int),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_7_not__sum__power2__lt__zero) ).
fof(fact_23_zle__refl,axiom,
! [X10] : ord_less_eq_int(X10,X10),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_23_zle__refl) ).
fof(fact_20__096_B_Bthesis_O_A_I_B_Bt_O_As_A_094_A2_A_L_A1_A_061_A_I4_A_K_Am_A_L_A1_,axiom,
~ ! [X9] : plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int) != times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),X9),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_20__096_B_Bthesis_O_A_I_B_Bt_O_As_A_094_A2_A_L_A1_A_061_A_I4_A_K_Am_A_L_A1_) ).
fof(fact_3_t,axiom,
plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int) = times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_3_t) ).
fof(fact_13_one__power2,axiom,
power_power_int(one_one_int,number_number_of_nat(bit0(bit1(pls)))) = one_one_int,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_13_one__power2) ).
fof(fact_104_zadd__commute,axiom,
! [X12,X10] : plus_plus_int(X12,X10) = plus_plus_int(X10,X12),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_104_zadd__commute) ).
fof(fact_32_zle__antisym,axiom,
! [X12,X10] :
( ord_less_eq_int(X12,X10)
=> ( ord_less_eq_int(X10,X12)
=> X12 = X10 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_32_zle__antisym) ).
fof(fact_66_mult__Pls,axiom,
! [X10] : times_times_int(pls,X10) = pls,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_66_mult__Pls) ).
fof(fact_25_zmult__commute,axiom,
! [X12,X10] : times_times_int(X12,X10) = times_times_int(X10,X12),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_25_zmult__commute) ).
fof(fact_73_zadd__zmult__distrib2,axiom,
! [X10,X16,X17] : times_times_int(X10,plus_plus_int(X16,X17)) = plus_plus_int(times_times_int(X10,X16),times_times_int(X10,X17)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_73_zadd__zmult__distrib2) ).
fof(fact_69_zmult__1__right,axiom,
! [X12] : times_times_int(X12,one_one_int) = X12,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_69_zmult__1__right) ).
fof(fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096,axiom,
ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),zero_zero_int)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).
fof(c_0_16,plain,
! [X5,X5] :
( ( ~ ord_less_eq_int(one_one_int,number_number_of_int(X5))
| ord_less_eq_int(bit1(pls),X5) )
& ( ~ ord_less_eq_int(bit1(pls),X5)
| ord_less_eq_int(one_one_int,number_number_of_int(X5)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_64_le__special_I2_J])])])]) ).
fof(c_0_17,plain,
! [X12] : number_number_of_int(X12) = X12,
inference(variable_rename,[status(thm)],[fact_24_number__of__is__id]) ).
fof(c_0_18,plain,
! [X4,X4] :
( ( ~ ord_less_eq_int(number_number_of_int(X4),one_one_int)
| ord_less_eq_int(X4,bit1(pls)) )
& ( ~ ord_less_eq_int(X4,bit1(pls))
| ord_less_eq_int(number_number_of_int(X4),one_one_int) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_63_le__special_I4_J])])])]) ).
cnf(c_0_19,plain,
( ord_less_eq_int(one_one_int,number_number_of_int(X1))
| ~ ord_less_eq_int(bit1(pls),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
number_number_of_int(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
zero_zero_int = number_number_of_int(pls),
inference(split_conjunct,[status(thm)],[fact_105_zero__is__num__zero]) ).
cnf(c_0_22,plain,
( ord_less_eq_int(number_number_of_int(X1),one_one_int)
| ~ ord_less_eq_int(X1,bit1(pls)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,plain,
! [X3,X4] : ~ ord_less_int(plus_plus_int(power_power_int(X3,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X4,number_number_of_nat(bit0(bit1(pls))))),zero_zero_int),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_7_not__sum__power2__lt__zero])]) ).
cnf(c_0_24,plain,
( ord_less_eq_int(one_one_int,X1)
| ~ ord_less_eq_int(bit1(pls),X1) ),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
pls = zero_zero_int,
inference(rw,[status(thm)],[c_0_21,c_0_20]) ).
fof(c_0_26,plain,
! [X11] : ord_less_eq_int(X11,X11),
inference(variable_rename,[status(thm)],[fact_23_zle__refl]) ).
cnf(c_0_27,plain,
( ord_less_eq_int(X1,one_one_int)
| ~ ord_less_eq_int(X1,bit1(pls)) ),
inference(rw,[status(thm)],[c_0_22,c_0_20]) ).
fof(c_0_28,plain,
plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int) = times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_20__096_B_Bthesis_O_A_I_B_Bt_O_As_A_094_A2_A_L_A1_A_061_A_I4_A_K_Am_A_L_A1_])])]) ).
cnf(c_0_29,plain,
plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int) = times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),
inference(split_conjunct,[status(thm)],[fact_3_t]) ).
cnf(c_0_30,plain,
~ ord_less_int(plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))),zero_zero_int),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
power_power_int(one_one_int,number_number_of_nat(bit0(bit1(pls)))) = one_one_int,
inference(split_conjunct,[status(thm)],[fact_13_one__power2]) ).
fof(c_0_32,plain,
! [X13,X14] : plus_plus_int(X13,X14) = plus_plus_int(X14,X13),
inference(variable_rename,[status(thm)],[fact_104_zadd__commute]) ).
fof(c_0_33,plain,
! [X13,X14] :
( ~ ord_less_eq_int(X13,X14)
| ~ ord_less_eq_int(X14,X13)
| X13 = X14 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_32_zle__antisym])]) ).
cnf(c_0_34,plain,
( ord_less_eq_int(one_one_int,X1)
| ~ ord_less_eq_int(bit1(zero_zero_int),X1) ),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_35,plain,
ord_less_eq_int(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
( ord_less_eq_int(X1,one_one_int)
| ~ ord_less_eq_int(X1,bit1(zero_zero_int)) ),
inference(rw,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_37,plain,
plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int) = times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int) = times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),t),
inference(rw,[status(thm)],[c_0_29,c_0_20]) ).
fof(c_0_39,plain,
! [X11] : times_times_int(pls,X11) = pls,
inference(variable_rename,[status(thm)],[fact_66_mult__Pls]) ).
cnf(c_0_40,plain,
~ ord_less_int(plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(zero_zero_int)))),power_power_int(X2,number_number_of_nat(bit0(bit1(zero_zero_int))))),zero_zero_int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_25]),c_0_25]) ).
cnf(c_0_41,plain,
power_power_int(one_one_int,number_number_of_nat(bit0(bit1(zero_zero_int)))) = one_one_int,
inference(rw,[status(thm)],[c_0_31,c_0_25]) ).
cnf(c_0_42,plain,
plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_43,plain,
( X1 = X2
| ~ ord_less_eq_int(X2,X1)
| ~ ord_less_eq_int(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_44,plain,
ord_less_eq_int(one_one_int,bit1(zero_zero_int)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,plain,
ord_less_eq_int(bit1(zero_zero_int),one_one_int),
inference(spm,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_46,plain,
plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int) = times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),esk1_0),
inference(rw,[status(thm)],[c_0_37,c_0_20]) ).
cnf(c_0_47,plain,
plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(zero_zero_int)))),one_one_int) = times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(zero_zero_int))),m),one_one_int),t),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_25]),c_0_25]) ).
fof(c_0_48,plain,
! [X13,X14] : times_times_int(X13,X14) = times_times_int(X14,X13),
inference(variable_rename,[status(thm)],[fact_25_zmult__commute]) ).
fof(c_0_49,plain,
! [X18,X19,X20] : times_times_int(X18,plus_plus_int(X19,X20)) = plus_plus_int(times_times_int(X18,X19),times_times_int(X18,X20)),
inference(variable_rename,[status(thm)],[fact_73_zadd__zmult__distrib2]) ).
fof(c_0_50,plain,
! [X13] : times_times_int(X13,one_one_int) = X13,
inference(variable_rename,[status(thm)],[fact_69_zmult__1__right]) ).
cnf(c_0_51,plain,
ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),zero_zero_int)),
inference(split_conjunct,[status(thm)],[fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096]) ).
cnf(c_0_52,plain,
times_times_int(pls,X1) = pls,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_53,plain,
~ ord_less_int(plus_plus_int(one_one_int,power_power_int(X1,number_number_of_nat(bit0(bit1(zero_zero_int))))),zero_zero_int),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_54,plain,
bit1(zero_zero_int) = one_one_int,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_55,plain,
times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(zero_zero_int))),m),one_one_int),t) = times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(zero_zero_int))),m),one_one_int),esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_25]),c_0_47]),c_0_25]) ).
cnf(c_0_56,plain,
times_times_int(X1,X2) = times_times_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_57,plain,
times_times_int(X1,plus_plus_int(X2,X3)) = plus_plus_int(times_times_int(X1,X2),times_times_int(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_58,plain,
times_times_int(X1,one_one_int) = X1,
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_59,plain,
ord_less_int(times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),zero_zero_int)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_20]),c_0_20]) ).
cnf(c_0_60,plain,
times_times_int(zero_zero_int,X1) = zero_zero_int,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_25]),c_0_25]) ).
cnf(c_0_61,plain,
~ ord_less_int(plus_plus_int(one_one_int,power_power_int(X1,number_number_of_nat(bit0(one_one_int)))),zero_zero_int),
inference(rw,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_62,plain,
plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(one_one_int)))) = plus_plus_int(esk1_0,times_times_int(esk1_0,times_times_int(m,bit0(bit0(one_one_int))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_55]),c_0_42]),c_0_54]),c_0_56]),c_0_56]),c_0_54]),c_0_42]),c_0_57]),c_0_58]) ).
cnf(c_0_63,plain,
ord_less_int(times_times_int(t,plus_plus_int(times_times_int(m,bit0(bit0(bit1(zero_zero_int)))),one_one_int)),zero_zero_int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_25]),c_0_56]),c_0_56]),c_0_25]),c_0_56]),c_0_56]),c_0_60]) ).
cnf(c_0_64,plain,
plus_plus_int(t,times_times_int(t,times_times_int(m,bit0(bit0(one_one_int))))) = plus_plus_int(esk1_0,times_times_int(esk1_0,times_times_int(m,bit0(bit0(one_one_int))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_42]),c_0_54]),c_0_57]),c_0_58]),c_0_42]),c_0_54]),c_0_57]),c_0_58]) ).
cnf(c_0_65,plain,
~ ord_less_int(plus_plus_int(esk1_0,times_times_int(esk1_0,times_times_int(m,bit0(bit0(one_one_int))))),zero_zero_int),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_66,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_42]),c_0_54]),c_0_57]),c_0_58]),c_0_64]),c_0_65]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : NUM924+1 : TPTP v8.1.0. Released v5.3.0.
% 0.04/0.14 % Command : run_ET %s %d
% 0.16/0.36 % Computer : n020.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 600
% 0.16/0.36 % DateTime : Wed Jul 6 00:26:44 EDT 2022
% 0.16/0.37 % CPUTime :
% 0.29/1.47 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.29/1.47 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.29/1.47 # Preprocessing time : 0.024 s
% 0.29/1.47
% 0.29/1.47 # Proof found!
% 0.29/1.47 # SZS status Theorem
% 0.29/1.47 # SZS output start CNFRefutation
% See solution above
% 0.29/1.47 # Proof object total steps : 67
% 0.29/1.47 # Proof object clause steps : 39
% 0.29/1.47 # Proof object formula steps : 28
% 0.29/1.47 # Proof object conjectures : 0
% 0.29/1.47 # Proof object clause conjectures : 0
% 0.29/1.47 # Proof object formula conjectures : 0
% 0.29/1.47 # Proof object initial clauses used : 16
% 0.29/1.47 # Proof object initial formulas used : 16
% 0.29/1.47 # Proof object generating inferences : 5
% 0.29/1.47 # Proof object simplifying inferences : 57
% 0.29/1.47 # Training examples: 0 positive, 0 negative
% 0.29/1.47 # Parsed axioms : 107
% 0.29/1.47 # Removed by relevancy pruning/SinE : 20
% 0.29/1.47 # Initial clauses : 130
% 0.29/1.47 # Removed in clause preprocessing : 21
% 0.29/1.47 # Initial clauses in saturation : 109
% 0.29/1.47 # Processed clauses : 356
% 0.29/1.47 # ...of these trivial : 29
% 0.29/1.47 # ...subsumed : 127
% 0.29/1.47 # ...remaining for further processing : 199
% 0.29/1.47 # Other redundant clauses eliminated : 1
% 0.29/1.47 # Clauses deleted for lack of memory : 0
% 0.29/1.47 # Backward-subsumed : 2
% 0.29/1.47 # Backward-rewritten : 56
% 0.29/1.47 # Generated clauses : 1184
% 0.29/1.47 # ...of the previous two non-trivial : 1054
% 0.29/1.47 # Contextual simplify-reflections : 0
% 0.29/1.47 # Paramodulations : 1176
% 0.29/1.47 # Factorizations : 4
% 0.29/1.47 # Equation resolutions : 3
% 0.29/1.47 # Current number of processed clauses : 139
% 0.29/1.47 # Positive orientable unit clauses : 43
% 0.29/1.47 # Positive unorientable unit clauses: 3
% 0.29/1.47 # Negative unit clauses : 28
% 0.29/1.47 # Non-unit-clauses : 65
% 0.29/1.47 # Current number of unprocessed clauses: 516
% 0.29/1.47 # ...number of literals in the above : 1052
% 0.29/1.47 # Current number of archived formulas : 0
% 0.29/1.47 # Current number of archived clauses : 60
% 0.29/1.47 # Clause-clause subsumption calls (NU) : 919
% 0.29/1.47 # Rec. Clause-clause subsumption calls : 792
% 0.29/1.47 # Non-unit clause-clause subsumptions : 45
% 0.29/1.47 # Unit Clause-clause subsumption calls : 644
% 0.29/1.47 # Rewrite failures with RHS unbound : 0
% 0.29/1.47 # BW rewrite match attempts : 38
% 0.29/1.47 # BW rewrite match successes : 37
% 0.29/1.47 # Condensation attempts : 0
% 0.29/1.47 # Condensation successes : 0
% 0.29/1.47 # Termbank termtop insertions : 17728
% 0.29/1.47
% 0.29/1.47 # -------------------------------------------------
% 0.29/1.47 # User time : 0.048 s
% 0.29/1.47 # System time : 0.004 s
% 0.29/1.47 # Total time : 0.052 s
% 0.29/1.47 # Maximum resident set size: 4116 pages
%------------------------------------------------------------------------------