%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM926+7 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 : Thu Sep 24 01:51:05 PM UTC 2026
% Result : Theorem 206.69s 30.67s
% Output : CNFRefutation 206.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 47 ( 36 unt; 0 def)
% Number of atoms : 67 ( 46 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 40 ( 20 ~; 12 |; 4 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 10 con; 0-4 aty)
% Number of variables : 51 ( 8 sgn 22 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(tsy_c_Int_OBit1_res,hypothesis,
! [X4] : ti(int,bit1(X4)) = bit1(X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_c_Int_OBit1_res) ).
fof(fact_88_number__of__is__id,axiom,
! [X19] : number_number_of(int,X19) = ti(int,X19),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_88_number__of__is__id) ).
fof(conj_0,conjecture,
? [X6,X7] : hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X6),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X7),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(tsy_c_Int_OBit0_res,hypothesis,
! [X4] : ti(int,bit0(X4)) = bit0(X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_c_Int_OBit0_res) ).
fof(fact_160_one__is__num__one,axiom,
one_one(int) = number_number_of(int,bit1(pls)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_160_one__is__num__one) ).
fof(fact_91_zadd__commute,axiom,
! [X16,X12] : hAPP(int,int,plus_plus(int,X16),X12) = hAPP(int,int,plus_plus(int,X12),X16),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_91_zadd__commute) ).
fof(fact_22_zless__le,axiom,
! [X17,X18] :
( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X17),X18))
<=> ( ti(int,X17) != ti(int,X18)
& hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X17),X18)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_22_zless__le) ).
fof(fact_87_zmult__commute,axiom,
! [X16,X12] : hAPP(int,int,times_times(int,X16),X12) = hAPP(int,int,times_times(int,X12),X16),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_87_zmult__commute) ).
fof(fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06,axiom,
( t = one_one(int)
=> ? [X6,X7] : hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X6),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X7),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
fof(fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06,axiom,
( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t))
=> ? [X6,X7] : hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X6),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X7),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
fof(fact_0_tpos,axiom,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),one_one(int)),t)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_tpos) ).
fof(tsy_v_t_____res,axiom,
ti(int,t) = t,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_v_t_____res) ).
fof(c_0_12,hypothesis,
! [X579] : ti(int,bit1(X579)) = bit1(X579),
inference(variable_rename,[status(thm)],[tsy_c_Int_OBit1_res]) ).
fof(c_0_13,plain,
! [X627] : number_number_of(int,X627) = ti(int,X627),
inference(variable_rename,[status(thm)],[fact_88_number__of__is__id]) ).
fof(c_0_14,negated_conjecture,
~ ? [X6,X7] : hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X6),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X7),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)),
inference(assume_negation,[status(cth)],[conj_0]) ).
fof(c_0_15,hypothesis,
! [X577] : ti(int,bit0(X577)) = bit0(X577),
inference(variable_rename,[status(thm)],[tsy_c_Int_OBit0_res]) ).
cnf(c_0_16,hypothesis,
ti(int,bit1(X1)) = bit1(X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
number_number_of(int,X1) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,negated_conjecture,
! [X105,X106] : hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X105),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X106),number_number_of(nat,bit0(bit1(pls))))) != hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_19,hypothesis,
ti(int,bit0(X1)) = bit0(X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
one_one(int) = number_number_of(int,bit1(pls)),
inference(split_conjunct,[status(thm)],[fact_160_one__is__num__one]) ).
cnf(c_0_21,hypothesis,
number_number_of(int,bit1(X1)) = bit1(X1),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X1),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X2),number_number_of(nat,bit0(bit1(pls))))) != hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,hypothesis,
number_number_of(int,bit0(X1)) = bit0(X1),
inference(rw,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_24,plain,
one_one(int) = bit1(pls),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_25,plain,
! [X152,X153] : hAPP(int,int,plus_plus(int,X152),X153) = hAPP(int,int,plus_plus(int,X153),X152),
inference(variable_rename,[status(thm)],[fact_91_zadd__commute]) ).
fof(c_0_26,plain,
! [X17,X18] :
( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X17),X18))
<=> ( ti(int,X17) != ti(int,X18)
& hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X17),X18)) ) ),
inference(fof_simplification,[status(thm)],[fact_22_zless__le]) ).
cnf(c_0_27,negated_conjecture,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X1),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X2),number_number_of(nat,bit0(bit1(pls))))) != hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,bit0(bit0(bit1(pls)))),m)),bit1(pls)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_28,plain,
hAPP(int,int,plus_plus(int,X1),X2) = hAPP(int,int,plus_plus(int,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_29,plain,
! [X144,X145] : hAPP(int,int,times_times(int,X144),X145) = hAPP(int,int,times_times(int,X145),X144),
inference(variable_rename,[status(thm)],[fact_87_zmult__commute]) ).
fof(c_0_30,plain,
! [X122,X123] :
( ( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X122),X123))
| ti(int,X122) = ti(int,X123)
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X122),X123)) )
& ( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X122),X123))
| ti(int,X122) != ti(int,X123) )
& ( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X122),X123))
| hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X122),X123)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])]) ).
fof(c_0_31,plain,
( hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,esk21_0),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,esk22_0),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))
| t != one_one(int) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])])])]) ).
cnf(c_0_32,negated_conjecture,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X1),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X2),number_number_of(nat,bit0(bit1(pls))))) != hAPP(int,int,plus_plus(int,bit1(pls)),hAPP(int,int,times_times(int,bit0(bit0(bit1(pls)))),m)),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
hAPP(int,int,times_times(int,X1),X2) = hAPP(int,int,times_times(int,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_34,plain,
( hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,esk23_0),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,esk24_0),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])])])]) ).
cnf(c_0_35,plain,
( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X1),X2))
| hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X1),X2))
| ti(int,X1) = ti(int,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),one_one(int)),t)),
inference(split_conjunct,[status(thm)],[fact_0_tpos]) ).
cnf(c_0_37,plain,
ti(int,t) = t,
inference(split_conjunct,[status(thm)],[tsy_v_t_____res]) ).
cnf(c_0_38,plain,
( t != one_one(int)
| hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,esk21_0),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,esk22_0),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,negated_conjecture,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X1),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X2),number_number_of(nat,bit0(bit1(pls))))) != hAPP(int,int,plus_plus(int,bit1(pls)),hAPP(int,int,times_times(int,m),bit0(bit0(bit1(pls))))),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t))
| hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,esk23_0),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,esk24_0),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X1),X2))
| hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X1),X2))
| number_number_of(int,X1) = number_number_of(int,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_17]),c_0_17]) ).
cnf(c_0_42,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),bit1(pls)),t)),
inference(rw,[status(thm)],[c_0_36,c_0_24]) ).
cnf(c_0_43,plain,
number_number_of(int,t) = t,
inference(rw,[status(thm)],[c_0_37,c_0_17]) ).
cnf(c_0_44,plain,
bit1(pls) != t,
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_38,c_0_23]),c_0_33]),c_0_24]),c_0_28]),c_0_24]),c_0_39]) ).
cnf(c_0_45,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),bit1(pls)),t)),
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_40,c_0_23]),c_0_33]),c_0_24]),c_0_28]),c_0_24]),c_0_39]) ).
cnf(c_0_46,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_21]),c_0_43]),c_0_44]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM926+7 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n017.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Mon Sep 21 03:13:57 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.44 Running first-order theorem proving
% 0.13/0.45 Running: /export/starexec/sandbox2/solver/bin/eprover --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
% 206.69/30.67 % Version: 3.5.1
% 206.69/30.67 % Preprocessing class: FMLMSMSMSSSNFFN.
% 206.69/30.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 206.69/30.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 206.69/30.67 % Starting new_bool_3 with 300s (1) cores
% 206.69/30.67 % Starting new_bool_1 with 300s (1) cores
% 206.69/30.67 % Starting sh5l with 300s (1) cores
% 206.69/30.67 % sh5l with pid 1305811 completed with status 0
% 206.69/30.67 % Result found by sh5l
% 206.69/30.67 % Preprocessing class: FMLMSMSMSSSNFFN.
% 206.69/30.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 206.69/30.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 206.69/30.67 % Starting new_bool_3 with 300s (1) cores
% 206.69/30.67 % Starting new_bool_1 with 300s (1) cores
% 206.69/30.67 % Starting sh5l with 300s (1) cores
% 206.69/30.67 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 206.69/30.67 % SinE strategy is gf500_gu_R04_F100_L20000
% 206.69/30.67 % Search class: FGHSM-SSLM32-DFFFFFNN
% 206.69/30.67 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 206.69/30.67 % Starting SubtermCWHack with 28s (1) cores
% 206.69/30.67 % SubtermCWHack with pid 1305814 completed with status 8
% 206.69/30.67 % Starting sh5l with 31s (1) cores
% 206.69/30.67 % sh5l with pid 1305822 completed with status 0
% 206.69/30.67 % Result found by sh5l
% 206.69/30.67 % Preprocessing class: FMLMSMSMSSSNFFN.
% 206.69/30.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 206.69/30.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 206.69/30.67 % Starting new_bool_3 with 300s (1) cores
% 206.69/30.67 % Starting new_bool_1 with 300s (1) cores
% 206.69/30.67 % Starting sh5l with 300s (1) cores
% 206.69/30.67 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 206.69/30.67 % SinE strategy is gf500_gu_R04_F100_L20000
% 206.69/30.67 % Search class: FGHSM-SSLM32-DFFFFFNN
% 206.69/30.67 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 206.69/30.67 % Starting SubtermCWHack with 28s (1) cores
% 206.69/30.67 % SubtermCWHack with pid 1305814 completed with status 8
% 206.69/30.67 % Starting sh5l with 31s (1) cores
% 206.69/30.67 % Preprocessing time : 0.041 s
% 206.69/30.67 % Presaturation interreduction done
% 206.69/30.67
% 206.69/30.67 % Proof found!
% 206.69/30.67 % SZS status Theorem
% 206.69/30.67 % SZS output start CNFRefutation
% See solution above
% 206.69/30.67 % Parsed axioms : 1255
% 206.69/30.67 % Removed by relevancy pruning/SinE : 370
% 206.69/30.67 % Initial clauses : 1281
% 206.69/30.67 % Removed in clause preprocessing : 74
% 206.69/30.67 % Initial clauses in saturation : 1207
% 206.69/30.67 % Processed clauses : 6661
% 206.69/30.67 % ...of these trivial : 347
% 206.69/30.67 % ...subsumed : 4153
% 206.69/30.67 % ...remaining for further processing : 2161
% 206.69/30.67 % Other redundant clauses eliminated : 188
% 206.69/30.67 % Clauses deleted for lack of memory : 0
% 206.69/30.67 % Backward-subsumed : 61
% 206.69/30.67 % Backward-rewritten : 67
% 206.69/30.67 % Generated clauses : 25982
% 206.69/30.67 % ...of the previous two non-redundant : 22722
% 206.69/30.67 % ...aggressively subsumed : 0
% 206.69/30.67 % Contextual simplify-reflections : 21
% 206.69/30.67 % Paramodulations : 25785
% 206.69/30.67 % Factorizations : 2
% 206.69/30.67 % NegExts : 0
% 206.69/30.67 % Equation resolutions : 201
% 206.69/30.67 % Disequality decompositions : 0
% 206.69/30.67 % Total rewrite steps : 26834
% 206.69/30.67 % ...of those cached : 24807
% 206.69/30.67 % Propositional unsat checks : 0
% 206.69/30.67 % Propositional check models : 0
% 206.69/30.67 % Propositional check unsatisfiable : 0
% 206.69/30.67 % Propositional clauses : 0
% 206.69/30.67 % Propositional clauses after purity: 0
% 206.69/30.67 % Propositional unsat core size : 0
% 206.69/30.67 % Propositional preprocessing time : 0.000
% 206.69/30.67 % Propositional encoding time : 0.000
% 206.69/30.67 % Propositional solver time : 0.000
% 206.69/30.67 % Success case prop preproc time : 0.000
% 206.69/30.67 % Success case prop encoding time : 0.000
% 206.69/30.67 % Success case prop solver time : 0.000
% 206.69/30.67 % Current number of processed clauses : 986
% 206.69/30.67 % Positive orientable unit clauses : 236
% 206.69/30.67 % Positive unorientable unit clauses: 12
% 206.69/30.67 % Negative unit clauses : 59
% 206.69/30.67 % Non-unit-clauses : 679
% 206.69/30.67 % Current number of unprocessed clauses: 18018
% 206.69/30.67 % ...number of literals in the above : 44614
% 206.69/30.67 % Current number of archived formulas : 0
% 206.69/30.67 % Current number of archived clauses : 1116
% 206.69/30.67 % Clause-clause subsumption calls (NU) : 286979
% 206.69/30.67 % Rec. Clause-clause subsumption calls : 124384
% 206.69/30.67 % Non-unit clause-clause subsumptions : 2722
% 206.69/30.67 % Unit Clause-clause subsumption calls : 2492
% 206.69/30.67 % Rewrite failures with RHS unbound : 0
% 206.69/30.67 % BW rewrite match attempts : 12573
% 206.69/30.67 % BW rewrite match successes : 340
% 206.69/30.67 % Condensation attempts : 6661
% 206.69/30.67 % Condensation successes : 13
% 206.69/30.67 % Termbank termtop insertions : 870475
% 206.69/30.67 % Search garbage collected termcells : 17795
% 206.69/30.67
% 206.69/30.67 % -------------------------------------------------
% 206.69/30.67 % User time : 28.694 s
% 206.69/30.67 % System time : 0.908 s
% 206.69/30.67 % Total time : 29.602 s
% 206.69/30.67 % Maximum resident set size: 9404 pages
% 206.69/30.67
% 206.69/30.67 % -------------------------------------------------
% 206.69/30.67 % User time : 28.754 s
% 206.69/30.67 % System time : 0.915 s
% 206.69/30.67 % Total time : 29.669 s
% 206.69/30.67 % Maximum resident set size: 6144 pages
% 206.69/30.67 % E exiting
%------------------------------------------------------------------------------