%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM926+8 : 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 : n004.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 233.81s 35.39s
% Output : CNFRefutation 233.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 29
% Syntax : Number of formulae : 113 ( 87 unt; 0 def)
% Number of atoms : 149 ( 99 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 70 ( 34 ~; 28 |; 0 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 29 ( 29 usr; 18 con; 0-4 aty)
% Number of variables : 128 ( 4 sgn 60 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_2897_succ__pred,axiom,
! [X10] : hAPP(int,int,succ,hAPP(int,int,pred,X10)) = ti(int,X10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2897_succ__pred) ).
fof(help_COMBI_1_1_U,axiom,
! [X1,X228] : hAPP(X1,X1,combi(X1),X228) = ti(X1,X228),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_COMBI_1_1_U) ).
fof(fact_89_number__of__is__id,axiom,
! [X19] : hAPP(int,int,number_number_of(int),X19) = ti(int,X19),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_89_number__of__is__id) ).
fof(fact_131_zmult__1,axiom,
! [X16] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),one_one(int)),X16) = ti(int,X16),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_131_zmult__1) ).
fof(help_fNot_1_1_U,axiom,
! [X228] :
( ~ hBOOL(X228)
| ~ hBOOL(hAPP(bool,bool,fNot,X228)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_fNot_1_1_U) ).
fof(tsy_c_hAPP_arg2,axiom,
! [X1,X3,X4,X5] : hAPP(X1,X3,X4,ti(X1,X5)) = hAPP(X1,X3,X4,X5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_c_hAPP_arg2) ).
fof(fact_2898_pred__Bit1,axiom,
! [X19] : hAPP(int,int,pred,hAPP(int,int,bit1,X19)) = hAPP(int,int,bit0,X19),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2898_pred__Bit1) ).
fof(tsy_v_m_res,hypothesis,
ti(int,m) = m,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_v_m_res) ).
fof(help_If_3_1_T,axiom,
! [X228] :
( ti(bool,X228) = fFalse
| ti(bool,X228) = fTrue ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_If_3_1_T) ).
fof(conj_0,conjecture,
? [X6,X7] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X6),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X7),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(fact_1128_nat__number__of__def,axiom,
! [X14] : hAPP(int,nat,number_number_of(nat),X14) = hAPP(int,nat,nat_1,hAPP(int,int,number_number_of(int),X14)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1128_nat__number__of__def) ).
fof(fact_161_one__is__num__one,axiom,
one_one(int) = hAPP(int,int,number_number_of(int),hAPP(int,int,bit1,pls)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_161_one__is__num__one) ).
fof(fact_123_Bit0__Pls,axiom,
hAPP(int,int,bit0,pls) = pls,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_123_Bit0__Pls) ).
fof(fact_1590_succ__Pls,axiom,
hAPP(int,int,succ,pls) = hAPP(int,int,bit1,pls),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1590_succ__Pls) ).
fof(fact_1593_succ__def,axiom,
! [X19] : hAPP(int,int,succ,X19) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X19),one_one(int)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1593_succ__def) ).
fof(tsy_c_hAPP_res,axiom,
! [X3,X1,X4,X5] : ti(X3,hAPP(X1,X3,X4,X5)) = hAPP(X1,X3,X4,X5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_c_hAPP_res) ).
fof(fact_2899_pred__Bit0,axiom,
! [X19] : hAPP(int,int,pred,hAPP(int,int,bit0,X19)) = hAPP(int,int,bit1,hAPP(int,int,pred,X19)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2899_pred__Bit0) ).
fof(fact_1592_succ__Bit1,axiom,
! [X19] : hAPP(int,int,succ,hAPP(int,int,bit1,X19)) = hAPP(int,int,bit0,hAPP(int,int,succ,X19)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1592_succ__Bit1) ).
fof(fact_125_mult__Bit0,axiom,
! [X19,X52] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,bit0,X19)),X52) = hAPP(int,int,bit0,hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X19),X52)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_125_mult__Bit0) ).
fof(fact_1591_succ__Bit0,axiom,
! [X19] : hAPP(int,int,succ,hAPP(int,int,bit0,X19)) = hAPP(int,int,bit1,X19),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1591_succ__Bit0) ).
fof(help_fTrue_1_1_U,axiom,
hBOOL(fTrue),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_fTrue_1_1_U) ).
fof(fact_1568_xt1_I12_J,axiom,
! [X1] :
( order(X1)
=> ! [X8,X9] :
( ti(X1,X8) != ti(X1,X9)
=> ( hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less_eq(X1),X9),X8))
=> hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less(X1),X9),X8)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1568_xt1_I12_J) ).
fof(tsy_v_t_____res,axiom,
ti(int,t) = t,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_v_t_____res) ).
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,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X6),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X7),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,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(help_fNot_2_1_U,axiom,
! [X228] :
( hBOOL(hAPP(bool,bool,fNot,X228))
| hBOOL(X228) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_fNot_2_1_U) ).
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,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X6),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X7),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,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(help_fFalse_1_1_U,axiom,
~ hBOOL(fFalse),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_fFalse_1_1_U) ).
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(arity_Int_Oint___Orderings_Oorder,axiom,
order(int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arity_Int_Oint___Orderings_Oorder) ).
fof(c_0_29,plain,
! [X7301] : hAPP(int,int,succ,hAPP(int,int,pred,X7301)) = ti(int,X7301),
inference(variable_rename,[status(thm)],[fact_2897_succ__pred]) ).
fof(c_0_30,plain,
! [X13980,X13981] : hAPP(X13980,X13980,combi(X13980),X13981) = ti(X13980,X13981),
inference(variable_rename,[status(thm)],[help_COMBI_1_1_U]) ).
fof(c_0_31,plain,
! [X594] : hAPP(int,int,number_number_of(int),X594) = ti(int,X594),
inference(variable_rename,[status(thm)],[fact_89_number__of__is__id]) ).
fof(c_0_32,plain,
! [X677] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),one_one(int)),X677) = ti(int,X677),
inference(variable_rename,[status(thm)],[fact_131_zmult__1]) ).
cnf(c_0_33,plain,
hAPP(int,int,succ,hAPP(int,int,pred,X1)) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
hAPP(X1,X1,combi(X1),X2) = ti(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
hAPP(int,int,number_number_of(int),X1) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_36,plain,
! [X228] :
( ~ hBOOL(X228)
| ~ hBOOL(hAPP(bool,bool,fNot,X228)) ),
inference(fof_simplification,[status(thm)],[help_fNot_1_1_U]) ).
fof(c_0_37,plain,
! [X384,X385,X386,X387] : hAPP(X384,X385,X386,ti(X384,X387)) = hAPP(X384,X385,X386,X387),
inference(variable_rename,[status(thm)],[tsy_c_hAPP_arg2]) ).
cnf(c_0_38,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),one_one(int)),X1) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
hAPP(int,int,succ,hAPP(int,int,pred,X1)) = hAPP(int,int,combi(int),X1),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
hAPP(int,int,number_number_of(int),X1) = hAPP(int,int,combi(int),X1),
inference(rw,[status(thm)],[c_0_35,c_0_34]) ).
fof(c_0_41,plain,
! [X7302] : hAPP(int,int,pred,hAPP(int,int,bit1,X7302)) = hAPP(int,int,bit0,X7302),
inference(variable_rename,[status(thm)],[fact_2898_pred__Bit1]) ).
cnf(c_0_42,hypothesis,
ti(int,m) = m,
inference(split_conjunct,[status(thm)],[tsy_v_m_res]) ).
fof(c_0_43,plain,
! [X13966] :
( ~ hBOOL(X13966)
| ~ hBOOL(hAPP(bool,bool,fNot,X13966)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_36])]) ).
cnf(c_0_44,plain,
hAPP(X1,X2,X3,ti(X1,X4)) = hAPP(X1,X2,X3,X4),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_45,plain,
! [X13962] :
( ti(bool,X13962) = fFalse
| ti(bool,X13962) = fTrue ),
inference(variable_rename,[status(thm)],[help_If_3_1_T]) ).
fof(c_0_46,negated_conjecture,
~ ? [X6,X7] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X6),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X7),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int)),
inference(assume_negation,[status(cth)],[conj_0]) ).
fof(c_0_47,plain,
! [X3357] : hAPP(int,nat,number_number_of(nat),X3357) = hAPP(int,nat,nat_1,hAPP(int,int,number_number_of(int),X3357)),
inference(variable_rename,[status(thm)],[fact_1128_nat__number__of__def]) ).
cnf(c_0_48,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),one_one(int)),X1) = hAPP(int,int,combi(int),X1),
inference(rw,[status(thm)],[c_0_38,c_0_34]) ).
cnf(c_0_49,plain,
one_one(int) = hAPP(int,int,number_number_of(int),hAPP(int,int,bit1,pls)),
inference(split_conjunct,[status(thm)],[fact_161_one__is__num__one]) ).
cnf(c_0_50,plain,
hAPP(int,int,number_number_of(int),X1) = hAPP(int,int,succ,hAPP(int,int,pred,X1)),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_51,plain,
hAPP(int,int,pred,hAPP(int,int,bit1,X1)) = hAPP(int,int,bit0,X1),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_52,plain,
hAPP(int,int,bit0,pls) = pls,
inference(split_conjunct,[status(thm)],[fact_123_Bit0__Pls]) ).
cnf(c_0_53,plain,
hAPP(int,int,succ,pls) = hAPP(int,int,bit1,pls),
inference(split_conjunct,[status(thm)],[fact_1590_succ__Pls]) ).
cnf(c_0_54,hypothesis,
hAPP(int,int,combi(int),m) = m,
inference(rw,[status(thm)],[c_0_42,c_0_34]) ).
fof(c_0_55,plain,
! [X4399] : hAPP(int,int,succ,X4399) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X4399),one_one(int)),
inference(variable_rename,[status(thm)],[fact_1593_succ__def]) ).
fof(c_0_56,plain,
! [X388,X389,X390,X391] : ti(X388,hAPP(X389,X388,X390,X391)) = hAPP(X389,X388,X390,X391),
inference(variable_rename,[status(thm)],[tsy_c_hAPP_res]) ).
cnf(c_0_57,plain,
( ~ hBOOL(X1)
| ~ hBOOL(hAPP(bool,bool,fNot,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_58,plain,
hAPP(X1,X2,X3,hAPP(X1,X1,combi(X1),X4)) = hAPP(X1,X2,X3,X4),
inference(rw,[status(thm)],[c_0_44,c_0_34]) ).
cnf(c_0_59,plain,
( ti(bool,X1) = fFalse
| ti(bool,X1) = fTrue ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
fof(c_0_60,negated_conjecture,
! [X14018,X14019] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X14018),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X14019),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) != hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])]) ).
cnf(c_0_61,plain,
hAPP(int,nat,number_number_of(nat),X1) = hAPP(int,nat,nat_1,hAPP(int,int,number_number_of(int),X1)),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
fof(c_0_62,plain,
! [X7303] : hAPP(int,int,pred,hAPP(int,int,bit0,X7303)) = hAPP(int,int,bit1,hAPP(int,int,pred,X7303)),
inference(variable_rename,[status(thm)],[fact_2899_pred__Bit0]) ).
fof(c_0_63,plain,
! [X4398] : hAPP(int,int,succ,hAPP(int,int,bit1,X4398)) = hAPP(int,int,bit0,hAPP(int,int,succ,X4398)),
inference(variable_rename,[status(thm)],[fact_1592_succ__Bit1]) ).
fof(c_0_64,plain,
! [X669,X670] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,bit0,X669)),X670) = hAPP(int,int,bit0,hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X669),X670)),
inference(variable_rename,[status(thm)],[fact_125_mult__Bit0]) ).
cnf(c_0_65,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),one_one(int)),X1) = hAPP(int,int,number_number_of(int),X1),
inference(rw,[status(thm)],[c_0_48,c_0_40]) ).
cnf(c_0_66,plain,
one_one(int) = hAPP(int,int,bit1,pls),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52]),c_0_53]) ).
cnf(c_0_67,hypothesis,
hAPP(int,int,number_number_of(int),m) = m,
inference(rw,[status(thm)],[c_0_54,c_0_40]) ).
cnf(c_0_68,plain,
hAPP(int,int,succ,X1) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X1),one_one(int)),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
fof(c_0_69,plain,
! [X4397] : hAPP(int,int,succ,hAPP(int,int,bit0,X4397)) = hAPP(int,int,bit1,X4397),
inference(variable_rename,[status(thm)],[fact_1591_succ__Bit0]) ).
cnf(c_0_70,plain,
ti(X1,hAPP(X2,X1,X3,X4)) = hAPP(X2,X1,X3,X4),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_71,plain,
( ~ hBOOL(hAPP(bool,bool,fNot,X1))
| ~ hBOOL(hAPP(bool,bool,combi(bool),X1)) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_72,plain,
( hAPP(bool,bool,combi(bool),X1) = fTrue
| hAPP(bool,bool,combi(bool),X1) = fFalse ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_34]),c_0_34]) ).
cnf(c_0_73,plain,
hBOOL(fTrue),
inference(split_conjunct,[status(thm)],[help_fTrue_1_1_U]) ).
fof(c_0_74,plain,
! [X1] :
( order(X1)
=> ! [X8,X9] :
( ti(X1,X8) != ti(X1,X9)
=> ( hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less_eq(X1),X9),X8))
=> hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less(X1),X9),X8)) ) ) ),
inference(fof_simplification,[status(thm)],[fact_1568_xt1_I12_J]) ).
cnf(c_0_75,plain,
ti(int,t) = t,
inference(split_conjunct,[status(thm)],[tsy_v_t_____res]) ).
fof(c_0_76,plain,
( hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),esk3_0),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),esk4_0),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,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_77,negated_conjecture,
hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X1),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X2),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) != hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int)),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_78,plain,
hAPP(int,nat,number_number_of(nat),X1) = hAPP(int,nat,nat_1,hAPP(int,int,succ,hAPP(int,int,pred,X1))),
inference(rw,[status(thm)],[c_0_61,c_0_50]) ).
cnf(c_0_79,plain,
hAPP(int,int,pred,hAPP(int,int,bit0,X1)) = hAPP(int,int,bit1,hAPP(int,int,pred,X1)),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_80,plain,
hAPP(int,int,succ,hAPP(int,int,bit1,X1)) = hAPP(int,int,bit0,hAPP(int,int,succ,X1)),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_81,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,bit0,X1)),X2) = hAPP(int,int,bit0,hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X1),X2)),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_82,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,bit1,pls)),X1) = hAPP(int,int,succ,hAPP(int,int,pred,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_50]),c_0_66]) ).
cnf(c_0_83,hypothesis,
hAPP(int,int,succ,hAPP(int,int,pred,m)) = m,
inference(rw,[status(thm)],[c_0_67,c_0_50]) ).
cnf(c_0_84,plain,
hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X1),hAPP(int,int,bit1,pls)) = hAPP(int,int,succ,X1),
inference(rw,[status(thm)],[c_0_68,c_0_66]) ).
cnf(c_0_85,plain,
hAPP(int,int,succ,hAPP(int,int,bit0,X1)) = hAPP(int,int,bit1,X1),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_86,plain,
hAPP(X1,X1,combi(X1),hAPP(X2,X1,X3,X4)) = hAPP(X2,X1,X3,X4),
inference(rw,[status(thm)],[c_0_70,c_0_34]) ).
cnf(c_0_87,plain,
( ~ hBOOL(hAPP(bool,bool,fNot,X1))
| hAPP(bool,bool,combi(bool),X1) = fFalse ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73])]) ).
fof(c_0_88,plain,
! [X13967] :
( hBOOL(hAPP(bool,bool,fNot,X13967))
| hBOOL(X13967) ),
inference(variable_rename,[status(thm)],[help_fNot_2_1_U]) ).
fof(c_0_89,plain,
! [X4331,X4332,X4333] :
( hBOOL(hAPP(X4331,bool,hAPP(X4331,fun(X4331,bool),ord_less(X4331),X4333),X4332))
| ~ hBOOL(hAPP(X4331,bool,hAPP(X4331,fun(X4331,bool),ord_less_eq(X4331),X4333),X4332))
| ti(X4331,X4332) = ti(X4331,X4333)
| ~ order(X4331) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_74])])])]) ).
cnf(c_0_90,plain,
hAPP(int,int,combi(int),t) = t,
inference(rw,[status(thm)],[c_0_75,c_0_34]) ).
cnf(c_0_91,plain,
( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t))
| hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),esk3_0),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),esk4_0),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int)) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_92,negated_conjecture,
hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X1),hAPP(int,nat,nat_1,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),X2),hAPP(int,nat,nat_1,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) != hAPP(int,int,bit1,hAPP(int,int,bit0,m)),
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)],[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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78]),c_0_79]),c_0_51]),c_0_52]),c_0_80]),c_0_53]),c_0_78]),c_0_79]),c_0_51]),c_0_52]),c_0_80]),c_0_53]),c_0_50]),c_0_79]),c_0_79]),c_0_51]),c_0_52]),c_0_80]),c_0_80]),c_0_53]),c_0_81]),c_0_81]),c_0_82]),c_0_83]),c_0_66]),c_0_84]),c_0_85]) ).
cnf(c_0_93,plain,
( ~ hBOOL(hAPP(bool,bool,fNot,hAPP(X1,bool,X2,X3)))
| hAPP(X1,bool,X2,X3) = fFalse ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_94,plain,
( hBOOL(hAPP(bool,bool,fNot,X1))
| hBOOL(X1) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
fof(c_0_95,plain,
( hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),esk1_0),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),esk2_0),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,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])])])]) ).
fof(c_0_96,plain,
~ hBOOL(fFalse),
inference(fof_simplification,[status(thm)],[help_fFalse_1_1_U]) ).
cnf(c_0_97,plain,
( ~ hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less_eq(X1),X3),X2))
| ~ order(X1)
| hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less(X1),X3),X2))
| ti(X1,X2) = ti(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_98,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_99,plain,
hAPP(int,int,number_number_of(int),t) = t,
inference(rw,[status(thm)],[c_0_90,c_0_40]) ).
cnf(c_0_100,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,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)],[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)],[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_91,c_0_78]),c_0_79]),c_0_51]),c_0_52]),c_0_80]),c_0_53]),c_0_78]),c_0_79]),c_0_51]),c_0_52]),c_0_80]),c_0_53]),c_0_50]),c_0_79]),c_0_79]),c_0_51]),c_0_52]),c_0_80]),c_0_80]),c_0_53]),c_0_81]),c_0_81]),c_0_82]),c_0_83]),c_0_66]),c_0_84]),c_0_85]),c_0_66]),c_0_92]) ).
cnf(c_0_101,plain,
( hBOOL(hAPP(X1,bool,X2,X3))
| hAPP(X1,bool,X2,X3) = fFalse ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_102,plain,
( t != one_one(int)
| hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),esk1_0),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),esk2_0),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int)) ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
fof(c_0_103,plain,
~ hBOOL(fFalse),
inference(fof_nnf,[status(thm)],[c_0_96]) ).
cnf(c_0_104,plain,
( ~ hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less_eq(X1),X3),X2))
| ~ order(X1)
| hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less(X1),X3),X2))
| hAPP(X1,X1,combi(X1),X2) = hAPP(X1,X1,combi(X1),X3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_34]),c_0_34]) ).
cnf(c_0_105,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),hAPP(int,int,bit1,pls)),t)),
inference(rw,[status(thm)],[c_0_98,c_0_66]) ).
cnf(c_0_106,plain,
hAPP(int,int,succ,hAPP(int,int,pred,t)) = t,
inference(rw,[status(thm)],[c_0_99,c_0_50]) ).
cnf(c_0_107,plain,
hAPP(int,int,combi(int),X1) = hAPP(int,int,succ,hAPP(int,int,pred,X1)),
inference(rw,[status(thm)],[c_0_40,c_0_50]) ).
cnf(c_0_108,plain,
hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,bit1,pls)),t) = fFalse,
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_109,plain,
order(int),
inference(split_conjunct,[status(thm)],[arity_Int_Oint___Orderings_Oorder]) ).
cnf(c_0_110,plain,
hAPP(int,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)],[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)],[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_102,c_0_78]),c_0_79]),c_0_51]),c_0_52]),c_0_80]),c_0_53]),c_0_78]),c_0_79]),c_0_51]),c_0_52]),c_0_80]),c_0_53]),c_0_50]),c_0_79]),c_0_79]),c_0_51]),c_0_52]),c_0_80]),c_0_80]),c_0_53]),c_0_81]),c_0_81]),c_0_82]),c_0_83]),c_0_66]),c_0_84]),c_0_85]),c_0_66]),c_0_92]) ).
cnf(c_0_111,plain,
~ hBOOL(fFalse),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_112,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[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(spm,[status(thm)],[c_0_104,c_0_105]),c_0_40]),c_0_50]),c_0_106]),c_0_107]),c_0_51]),c_0_52]),c_0_53]),c_0_108]),c_0_109])]),c_0_110]),c_0_111]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM926+8 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 03:18:20 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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
% 233.81/35.39 % Version: 3.5.1
% 233.81/35.39 % Preprocessing class: FMLMSMSLSSSNFFN.
% 233.81/35.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 233.81/35.39 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 233.81/35.39 % Starting new_bool_3 with 600s (2) cores
% 233.81/35.39 % Starting new_bool_1 with 600s (2) cores
% 233.81/35.39 % Starting sh5l with 300s (1) cores
% 233.81/35.39 % G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2131665 completed with status 0
% 233.81/35.39 % Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 233.81/35.39 % Preprocessing class: FMLMSMSLSSSNFFN.
% 233.81/35.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 233.81/35.39 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 233.81/35.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 233.81/35.39 % No SInE strategy applied
% 233.81/35.39 % Search class: FGHSM-SMLM33-DFFFFFNN
% 233.81/35.39 % Scheduled 7 strats onto 3 cores with 899 seconds (899 total)
% 233.81/35.39 % Starting SubtermCWHack with 81s (1) cores
% 233.81/35.39 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 90s (1) cores
% 233.81/35.39 % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 81s (1) cores
% 233.81/35.39 % G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2131682 completed with status 0
% 233.81/35.39 % Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 233.81/35.39 % Preprocessing class: FMLMSMSLSSSNFFN.
% 233.81/35.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 233.81/35.39 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 233.81/35.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 233.81/35.39 % No SInE strategy applied
% 233.81/35.39 % Search class: FGHSM-SMLM33-DFFFFFNN
% 233.81/35.39 % Scheduled 7 strats onto 3 cores with 899 seconds (899 total)
% 233.81/35.39 % Starting SubtermCWHack with 81s (1) cores
% 233.81/35.39 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 90s (1) cores
% 233.81/35.39 % Preprocessing time : 0.493 s
% 233.81/35.39 % Presaturation interreduction done
% 233.81/35.39
% 233.81/35.39 % Proof found!
% 233.81/35.39 % SZS status Theorem
% 233.81/35.39 % SZS output start CNFRefutation
% See solution above
% 233.81/35.39 % Parsed axioms : 5738
% 233.81/35.39 % Removed by relevancy pruning/SinE : 0
% 233.81/35.39 % Initial clauses : 8670
% 233.81/35.39 % Removed in clause preprocessing : 213
% 233.81/35.39 % Initial clauses in saturation : 8457
% 233.81/35.39 % Processed clauses : 36493
% 233.81/35.39 % ...of these trivial : 606
% 233.81/35.39 % ...subsumed : 21486
% 233.81/35.39 % ...remaining for further processing : 14401
% 233.81/35.39 % Other redundant clauses eliminated : 1667
% 233.81/35.39 % Clauses deleted for lack of memory : 0
% 233.81/35.39 % Backward-subsumed : 615
% 233.81/35.39 % Backward-rewritten : 436
% 233.81/35.39 % Generated clauses : 134278
% 233.81/35.39 % ...of the previous two non-redundant : 116823
% 233.81/35.39 % ...aggressively subsumed : 0
% 233.81/35.39 % Contextual simplify-reflections : 51
% 233.81/35.39 % Paramodulations : 132584
% 233.81/35.39 % Factorizations : 11
% 233.81/35.39 % NegExts : 0
% 233.81/35.39 % Equation resolutions : 1704
% 233.81/35.39 % Disequality decompositions : 0
% 233.81/35.39 % Total rewrite steps : 146295
% 233.81/35.39 % ...of those cached : 134441
% 233.81/35.39 % Propositional unsat checks : 3
% 233.81/35.39 % Propositional check models : 2
% 233.81/35.39 % Propositional check unsatisfiable : 0
% 233.81/35.39 % Propositional clauses : 0
% 233.81/35.39 % Propositional clauses after purity: 0
% 233.81/35.39 % Propositional unsat core size : 0
% 233.81/35.39 % Propositional preprocessing time : 0.000
% 233.81/35.39 % Propositional encoding time : 0.300
% 233.81/35.39 % Propositional solver time : 0.118
% 233.81/35.39 % Success case prop preproc time : 0.000
% 233.81/35.39 % Success case prop encoding time : 0.000
% 233.81/35.39 % Success case prop solver time : 0.000
% 233.81/35.39 % Current number of processed clauses : 5840
% 233.81/35.39 % Positive orientable unit clauses : 1952
% 233.81/35.39 % Positive unorientable unit clauses: 49
% 233.81/35.39 % Negative unit clauses : 475
% 233.81/35.39 % Non-unit-clauses : 3364
% 233.81/35.39 % Current number of unprocessed clauses: 95161
% 233.81/35.39 % ...number of literals in the above : 225090
% 233.81/35.39 % Current number of archived formulas : 0
% 233.81/35.39 % Current number of archived clauses : 8256
% 233.81/35.39 % Clause-clause subsumption calls (NU) : 9692771
% 233.81/35.39 % Rec. Clause-clause subsumption calls : 2184676
% 233.81/35.39 % Non-unit clause-clause subsumptions : 7432
% 233.81/35.39 % Unit Clause-clause subsumption calls : 52248
% 233.81/35.39 % Rewrite failures with RHS unbound : 0
% 233.81/35.39 % BW rewrite match attempts : 488850
% 233.81/35.39 % BW rewrite match successes : 1380
% 233.81/35.39 % Condensation attempts : 0
% 233.81/35.39 % Condensation successes : 0
% 233.81/35.39 % Termbank termtop insertions : 8975428
% 233.81/35.39 % Search garbage collected termcells : 114944
% 233.81/35.39
% 233.81/35.39 % -------------------------------------------------
% 233.81/35.39 % User time : 31.271 s
% 233.81/35.39 % System time : 0.483 s
% 233.81/35.39 % Total time : 31.754 s
% 233.81/35.39 % Maximum resident set size: 45340 pages
% 233.81/35.39
% 233.81/35.39 % -------------------------------------------------
% 233.81/35.39 % User time : 94.909 s
% 233.81/35.39 % System time : 1.669 s
% 233.81/35.39 % Total time : 96.578 s
% 233.81/35.39 % Maximum resident set size: 12800 pages
% 233.81/35.39 % E exiting
%------------------------------------------------------------------------------