%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM924+7 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:56:55 PM UTC 2026
% Result : Theorem 6.56s 1.69s
% Output : CNFRefutation 6.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 24
% Syntax : Number of formulae : 94 ( 94 unt; 0 def)
% Number of atoms : 94 ( 80 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 15 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 8 con; 0-5 aty)
% Number of variables : 100 ( 5 sgn 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_132_Bit0__def,axiom,
! [X15] : bit0(X15) = hAPP(int,int,plus_plus(int,X15),X15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_132_Bit0__def) ).
fof(fact_954_zmod__minus1__right,axiom,
! [X10] : hAPP(int,int,div_mod(int,X10),number_number_of(int,min)) = zero_zero(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_954_zmod__minus1__right) ).
fof(fact_22_number__of__is__id,axiom,
! [X15] : number_number_of(int,X15) = ti(int,X15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_22_number__of__is__id) ).
fof(fact_917_zmod__self,axiom,
! [X10] : hAPP(int,int,div_mod(int,X10),X10) = zero_zero(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_917_zmod__self) ).
fof(fact_129_add__Pls__right,axiom,
! [X15] : hAPP(int,int,plus_plus(int,X15),pls) = ti(int,X15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_129_add__Pls__right) ).
fof(fact_228_nat__mult__2__right,axiom,
! [X16] : hAPP(nat,nat,times_times(nat,X16),number_number_of(nat,bit0(bit1(pls)))) = hAPP(nat,nat,plus_plus(nat,X16),X16),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_228_nat__mult__2__right) ).
fof(conj_0,conjecture,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),zero_zero(int))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
fof(fact_61_nat__1__add__1,axiom,
hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)) = number_number_of(nat,bit0(bit1(pls))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_61_nat__1__add__1) ).
fof(fact_81_Numeral1__eq1__nat,axiom,
one_one(nat) = number_number_of(nat,bit1(pls)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_81_Numeral1__eq1__nat) ).
fof(fact_122_Pls__def,axiom,
pls = zero_zero(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_122_Pls__def) ).
fof(fact_164_Bit1__def,axiom,
! [X15] : bit1(X15) = hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),X15)),X15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_164_Bit1__def) ).
fof(fact_111_one__is__num__one,axiom,
one_one(int) = number_number_of(int,bit1(pls)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_111_one__is__num__one) ).
fof(tsy_c_Int_OBit1_res,hypothesis,
! [X4] : ti(int,bit1(X4)) = bit1(X4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tsy_c_Int_OBit1_res) ).
fof(tsy_c_Int_OMin_res,axiom,
ti(int,min) = min,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tsy_c_Int_OMin_res) ).
fof(fact_98_zadd__commute,axiom,
! [X16,X12] : hAPP(int,int,plus_plus(int,X16),X12) = hAPP(int,int,plus_plus(int,X12),X16),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_98_zadd__commute) ).
fof(fact_130_add__Pls,axiom,
! [X15] : hAPP(int,int,plus_plus(int,pls),X15) = ti(int,X15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_130_add__Pls) ).
fof(fact_62_mult__Pls,axiom,
! [X12] : hAPP(int,int,times_times(int,pls),X12) = pls,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_62_mult__Pls) ).
fof(fact_96_zadd__assoc,axiom,
! [X19,X20,X21] : hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,X19),X20)),X21) = hAPP(int,int,plus_plus(int,X19),hAPP(int,int,plus_plus(int,X20),X21)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_96_zadd__assoc) ).
fof(fact_3_t,axiom,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)) = hAPP(int,int,times_times(int,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),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_t) ).
fof(tsy_c_hAPP_res,axiom,
! [X2,X3,X4,X5] : ti(X2,hAPP(X3,X2,X4,X5)) = hAPP(X3,X2,X4,X5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tsy_c_hAPP_res) ).
fof(fact_23_zmult__commute,axiom,
! [X16,X12] : hAPP(int,int,times_times(int,X16),X12) = hAPP(int,int,times_times(int,X12),X16),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_23_zmult__commute) ).
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,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,times_times(int,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)),hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int))),zero_zero(int)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',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(help_COMBC_1_1_U,axiom,
! [X3,X2,X1,X100,X101,X102] : hAPP(X3,X2,combc(X3,X1,X2,X100,X101),X102) = hAPP(X1,X2,hAPP(X3,fun(X1,X2),X100,X102),X101),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_COMBC_1_1_U) ).
fof(fact_31_zpower__zadd__distrib,axiom,
! [X6,X7,X16] : hAPP(nat,int,power_power(int,X6),hAPP(nat,nat,plus_plus(nat,X7),X16)) = hAPP(int,int,times_times(int,hAPP(nat,int,power_power(int,X6),X7)),hAPP(nat,int,power_power(int,X6),X16)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_31_zpower__zadd__distrib) ).
fof(c_0_24,plain,
! [X524] : bit0(X524) = hAPP(int,int,plus_plus(int,X524),X524),
inference(variable_rename,[status(thm)],[fact_132_Bit0__def]) ).
fof(c_0_25,plain,
! [X2775] : hAPP(int,int,div_mod(int,X2775),number_number_of(int,min)) = zero_zero(int),
inference(variable_rename,[status(thm)],[fact_954_zmod__minus1__right]) ).
fof(c_0_26,plain,
! [X312] : number_number_of(int,X312) = ti(int,X312),
inference(variable_rename,[status(thm)],[fact_22_number__of__is__id]) ).
fof(c_0_27,plain,
! [X2654] : hAPP(int,int,div_mod(int,X2654),X2654) = zero_zero(int),
inference(variable_rename,[status(thm)],[fact_917_zmod__self]) ).
fof(c_0_28,plain,
! [X520] : hAPP(int,int,plus_plus(int,X520),pls) = ti(int,X520),
inference(variable_rename,[status(thm)],[fact_129_add__Pls__right]) ).
fof(c_0_29,plain,
! [X730] : hAPP(nat,nat,times_times(nat,X730),number_number_of(nat,bit0(bit1(pls)))) = hAPP(nat,nat,plus_plus(nat,X730),X730),
inference(variable_rename,[status(thm)],[fact_228_nat__mult__2__right]) ).
fof(c_0_30,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),zero_zero(int))),
inference(assume_negation,[status(cth)],[conj_0]) ).
cnf(c_0_31,plain,
hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)) = number_number_of(nat,bit0(bit1(pls))),
inference(split_conjunct,[status(thm)],[fact_61_nat__1__add__1]) ).
cnf(c_0_32,plain,
bit0(X1) = hAPP(int,int,plus_plus(int,X1),X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
one_one(nat) = number_number_of(nat,bit1(pls)),
inference(split_conjunct,[status(thm)],[fact_81_Numeral1__eq1__nat]) ).
cnf(c_0_34,plain,
pls = zero_zero(int),
inference(split_conjunct,[status(thm)],[fact_122_Pls__def]) ).
fof(c_0_35,plain,
! [X579] : bit1(X579) = hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),X579)),X579),
inference(variable_rename,[status(thm)],[fact_164_Bit1__def]) ).
cnf(c_0_36,plain,
one_one(int) = number_number_of(int,bit1(pls)),
inference(split_conjunct,[status(thm)],[fact_111_one__is__num__one]) ).
fof(c_0_37,hypothesis,
! [X220] : ti(int,bit1(X220)) = bit1(X220),
inference(variable_rename,[status(thm)],[tsy_c_Int_OBit1_res]) ).
cnf(c_0_38,plain,
hAPP(int,int,div_mod(int,X1),number_number_of(int,min)) = zero_zero(int),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_39,plain,
number_number_of(int,X1) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_40,plain,
ti(int,min) = min,
inference(split_conjunct,[status(thm)],[tsy_c_Int_OMin_res]) ).
cnf(c_0_41,plain,
hAPP(int,int,div_mod(int,X1),X1) = zero_zero(int),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_42,plain,
! [X466,X467] : hAPP(int,int,plus_plus(int,X466),X467) = hAPP(int,int,plus_plus(int,X467),X466),
inference(variable_rename,[status(thm)],[fact_98_zadd__commute]) ).
cnf(c_0_43,plain,
hAPP(int,int,plus_plus(int,X1),pls) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_44,plain,
hAPP(nat,nat,times_times(nat,X1),number_number_of(nat,bit0(bit1(pls)))) = hAPP(nat,nat,plus_plus(nat,X1),X1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_45,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),zero_zero(int))),
inference(fof_simplification,[status(thm)],[c_0_30]) ).
cnf(c_0_46,plain,
hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)) = number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_47,plain,
one_one(nat) = number_number_of(nat,bit1(zero_zero(int))),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_48,plain,
bit1(X1) = hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),X1)),X1),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_49,plain,
one_one(int) = number_number_of(int,bit1(zero_zero(int))),
inference(rw,[status(thm)],[c_0_36,c_0_34]) ).
cnf(c_0_50,hypothesis,
ti(int,bit1(X1)) = bit1(X1),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_51,plain,
hAPP(int,int,div_mod(int,X1),min) = hAPP(int,int,div_mod(int,nat),nat),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41]) ).
cnf(c_0_52,plain,
hAPP(int,int,plus_plus(int,X1),X2) = hAPP(int,int,plus_plus(int,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_53,plain,
hAPP(int,int,plus_plus(int,X1),zero_zero(int)) = ti(int,X1),
inference(rw,[status(thm)],[c_0_43,c_0_34]) ).
cnf(c_0_54,plain,
hAPP(nat,nat,times_times(nat,X1),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls)))) = hAPP(nat,nat,plus_plus(nat,X1),X1),
inference(rw,[status(thm)],[c_0_44,c_0_32]) ).
fof(c_0_55,plain,
! [X521] : hAPP(int,int,plus_plus(int,pls),X521) = ti(int,X521),
inference(variable_rename,[status(thm)],[fact_130_add__Pls]) ).
fof(c_0_56,plain,
! [X392] : hAPP(int,int,times_times(int,pls),X392) = pls,
inference(variable_rename,[status(thm)],[fact_62_mult__Pls]) ).
fof(c_0_57,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),zero_zero(int))),
inference(fof_nnf,[status(thm)],[c_0_45]) ).
cnf(c_0_58,plain,
number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(zero_zero(int))),bit1(zero_zero(int)))) = hAPP(nat,nat,plus_plus(nat,number_number_of(nat,bit1(zero_zero(int)))),number_number_of(nat,bit1(zero_zero(int)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_47]),c_0_34]),c_0_34]) ).
cnf(c_0_59,plain,
bit1(X1) = hAPP(int,int,plus_plus(int,X1),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),X1)),
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_48,c_0_49]),c_0_39]),c_0_50]),c_0_41]),c_0_51]),c_0_52]) ).
cnf(c_0_60,plain,
hAPP(int,int,plus_plus(int,X1),hAPP(int,int,div_mod(int,nat),min)) = ti(int,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_41]),c_0_51]) ).
cnf(c_0_61,plain,
hAPP(nat,nat,times_times(nat,X1),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),bit1(hAPP(int,int,div_mod(int,nat),min))))) = hAPP(nat,nat,plus_plus(nat,X1),X1),
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_54,c_0_34]),c_0_41]),c_0_51]),c_0_34]),c_0_41]),c_0_51]) ).
fof(c_0_62,plain,
! [X460,X461,X462] : hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,X460),X461)),X462) = hAPP(int,int,plus_plus(int,X460),hAPP(int,int,plus_plus(int,X461),X462)),
inference(variable_rename,[status(thm)],[fact_96_zadd__assoc]) ).
cnf(c_0_63,plain,
hAPP(int,int,plus_plus(int,pls),X1) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_64,plain,
hAPP(int,int,times_times(int,pls),X1) = pls,
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_65,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),zero_zero(int))),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_66,plain,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)) = hAPP(int,int,times_times(int,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),
inference(split_conjunct,[status(thm)],[fact_3_t]) ).
fof(c_0_67,plain,
! [X280,X281,X282,X283] : ti(X280,hAPP(X281,X280,X282,X283)) = hAPP(X281,X280,X282,X283),
inference(variable_rename,[status(thm)],[tsy_c_hAPP_res]) ).
fof(c_0_68,plain,
! [X313,X314] : hAPP(int,int,times_times(int,X313),X314) = hAPP(int,int,times_times(int,X314),X313),
inference(variable_rename,[status(thm)],[fact_23_zmult__commute]) ).
cnf(c_0_69,plain,
number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,div_mod(int,nat),min)),bit1(hAPP(int,int,div_mod(int,nat),min)))),hAPP(int,int,plus_plus(int,hAPP(int,int,div_mod(int,nat),min)),bit1(hAPP(int,int,div_mod(int,nat),min))))) = hAPP(nat,nat,plus_plus(nat,number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,div_mod(int,nat),min)),bit1(hAPP(int,int,div_mod(int,nat),min))))),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,div_mod(int,nat),min)),bit1(hAPP(int,int,div_mod(int,nat),min))))),
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_58,c_0_59]),c_0_41]),c_0_51]),c_0_41]),c_0_51]),c_0_60]),c_0_50]),c_0_59]),c_0_41]),c_0_51]),c_0_41]),c_0_51]),c_0_60]),c_0_50]),c_0_61]),c_0_59]),c_0_41]),c_0_51]),c_0_41]),c_0_51]),c_0_60]),c_0_50]),c_0_61]) ).
cnf(c_0_70,plain,
hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,X1),X2)),X3) = hAPP(int,int,plus_plus(int,X1),hAPP(int,int,plus_plus(int,X2),X3)),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_71,plain,
hAPP(int,int,plus_plus(int,zero_zero(int)),X1) = ti(int,X1),
inference(rw,[status(thm)],[c_0_63,c_0_34]) ).
cnf(c_0_72,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,times_times(int,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)),hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,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_73,plain,
hAPP(int,int,times_times(int,zero_zero(int)),X1) = zero_zero(int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_34]),c_0_34]) ).
fof(c_0_74,plain,
! [X2896,X2897,X2898,X2899,X2900,X2901] : hAPP(X2896,X2897,combc(X2896,X2898,X2897,X2899,X2900),X2901) = hAPP(X2898,X2897,hAPP(X2896,fun(X2898,X2897),X2899,X2901),X2900),
inference(variable_rename,[status(thm)],[help_COMBC_1_1_U]) ).
cnf(c_0_75,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),one_one(int))),zero_zero(int))),
inference(rw,[status(thm)],[c_0_65,c_0_32]) ).
fof(c_0_76,plain,
! [X332,X333,X334] : hAPP(nat,int,power_power(int,X332),hAPP(nat,nat,plus_plus(nat,X333),X334)) = hAPP(int,int,times_times(int,hAPP(nat,int,power_power(int,X332),X333)),hAPP(nat,int,power_power(int,X332),X334)),
inference(variable_rename,[status(thm)],[fact_31_zpower__zadd__distrib]) ).
cnf(c_0_77,plain,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),one_one(int)) = hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),m)),one_one(int))),t),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_32]),c_0_32]),c_0_32]) ).
cnf(c_0_78,plain,
ti(X1,hAPP(X2,X1,X3,X4)) = hAPP(X2,X1,X3,X4),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_79,plain,
hAPP(int,int,times_times(int,X1),X2) = hAPP(int,int,times_times(int,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_80,plain,
number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,div_mod(int,nat),min)),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),hAPP(int,int,plus_plus(int,hAPP(int,int,div_mod(int,nat),min)),bit1(hAPP(int,int,div_mod(int,nat),min)))))) = hAPP(nat,nat,plus_plus(nat,number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,div_mod(int,nat),min)),bit1(hAPP(int,int,div_mod(int,nat),min))))),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,div_mod(int,nat),min)),bit1(hAPP(int,int,div_mod(int,nat),min))))),
inference(rw,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_81,plain,
hAPP(int,int,plus_plus(int,hAPP(int,int,div_mod(int,nat),min)),X1) = ti(int,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_41]),c_0_51]) ).
cnf(c_0_82,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),m)),one_one(int))),t)),hAPP(int,int,times_times(int,hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),m)),one_one(int))),zero_zero(int)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_32]),c_0_32]),c_0_32]),c_0_32]) ).
cnf(c_0_83,plain,
hAPP(int,int,times_times(int,hAPP(int,int,div_mod(int,nat),min)),X1) = hAPP(int,int,div_mod(int,nat),min),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_41]),c_0_41]),c_0_51]),c_0_51]) ).
cnf(c_0_84,plain,
hAPP(X1,X2,combc(X1,X3,X2,X4,X5),X6) = hAPP(X3,X2,hAPP(X1,fun(X3,X2),X4,X6),X5),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_85,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),hAPP(nat,nat,plus_plus(nat,number_number_of(nat,bit1(zero_zero(int)))),number_number_of(nat,bit1(zero_zero(int)))))),bit1(zero_zero(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)],[c_0_75,c_0_34]),c_0_34]),c_0_58]),c_0_49]),c_0_39]),c_0_50]) ).
cnf(c_0_86,plain,
hAPP(nat,int,power_power(int,X1),hAPP(nat,nat,plus_plus(nat,X2),X3)) = hAPP(int,int,times_times(int,hAPP(nat,int,power_power(int,X1),X2)),hAPP(nat,int,power_power(int,X1),X3)),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_87,plain,
hAPP(int,int,plus_plus(int,hAPP(int,int,div_mod(int,nat),min)),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),hAPP(nat,int,power_power(int,s),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),bit1(hAPP(int,int,div_mod(int,nat),min))))))) = hAPP(int,int,times_times(int,t),hAPP(int,int,plus_plus(int,hAPP(int,int,div_mod(int,nat),min)),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),hAPP(int,int,times_times(int,m),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),bit1(hAPP(int,int,div_mod(int,nat),min))))))))),
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)],[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_34]),c_0_41]),c_0_51]),c_0_34]),c_0_41]),c_0_51]),c_0_49]),c_0_39]),c_0_50]),c_0_59]),c_0_41]),c_0_51]),c_0_41]),c_0_51]),c_0_60]),c_0_50]),c_0_52]),c_0_70]),c_0_34]),c_0_41]),c_0_51]),c_0_34]),c_0_41]),c_0_51]),c_0_34]),c_0_41]),c_0_51]),c_0_34]),c_0_41]),c_0_51]),c_0_70]),c_0_39]),c_0_78]),c_0_79]),c_0_49]),c_0_39]),c_0_50]),c_0_59]),c_0_41]),c_0_51]),c_0_41]),c_0_51]),c_0_60]),c_0_50]),c_0_52]),c_0_70]),c_0_79]) ).
cnf(c_0_88,plain,
number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),bit1(hAPP(int,int,div_mod(int,nat),min)))) = hAPP(nat,nat,plus_plus(nat,number_number_of(nat,bit1(hAPP(int,int,div_mod(int,nat),min)))),number_number_of(nat,bit1(hAPP(int,int,div_mod(int,nat),min)))),
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_80,c_0_81]),c_0_50]),c_0_81]),c_0_78]),c_0_81]),c_0_50]),c_0_81]),c_0_50]) ).
cnf(c_0_89,plain,
hBOOL(hAPP(int,bool,combc(int,int,bool,ord_less(int),hAPP(int,int,div_mod(int,nat),min)),hAPP(int,int,times_times(int,t),hAPP(int,int,plus_plus(int,hAPP(int,int,div_mod(int,nat),min)),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),hAPP(int,int,times_times(int,m),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),bit1(hAPP(int,int,div_mod(int,nat),min))))))))))),
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)],[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)],[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_82,c_0_34]),c_0_41]),c_0_51]),c_0_34]),c_0_41]),c_0_51]),c_0_34]),c_0_41]),c_0_51]),c_0_34]),c_0_41]),c_0_51]),c_0_70]),c_0_39]),c_0_78]),c_0_79]),c_0_49]),c_0_39]),c_0_50]),c_0_59]),c_0_41]),c_0_51]),c_0_41]),c_0_51]),c_0_60]),c_0_50]),c_0_52]),c_0_70]),c_0_79]),c_0_34]),c_0_41]),c_0_51]),c_0_34]),c_0_41]),c_0_51]),c_0_34]),c_0_41]),c_0_51]),c_0_34]),c_0_41]),c_0_51]),c_0_70]),c_0_39]),c_0_78]),c_0_79]),c_0_49]),c_0_39]),c_0_50]),c_0_59]),c_0_41]),c_0_51]),c_0_41]),c_0_51]),c_0_60]),c_0_50]),c_0_52]),c_0_70]),c_0_41]),c_0_51]),c_0_79]),c_0_83]),c_0_84]) ).
cnf(c_0_90,negated_conjecture,
~ hBOOL(hAPP(int,bool,combc(int,int,bool,ord_less(int),hAPP(int,int,div_mod(int,nat),min)),hAPP(int,int,plus_plus(int,hAPP(int,int,div_mod(int,nat),min)),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),hAPP(int,int,times_times(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,div_mod(int,nat),min)),bit1(hAPP(int,int,div_mod(int,nat),min)))))),hAPP(nat,int,power_power(int,s),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,div_mod(int,nat),min)),bit1(hAPP(int,int,div_mod(int,nat),min)))))))))),
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_85,c_0_84]),c_0_41]),c_0_51]),c_0_61]),c_0_59]),c_0_41]),c_0_51]),c_0_41]),c_0_51]),c_0_60]),c_0_50]),c_0_61]),c_0_59]),c_0_41]),c_0_51]),c_0_41]),c_0_51]),c_0_60]),c_0_50]),c_0_52]),c_0_70]),c_0_86]) ).
cnf(c_0_91,plain,
hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),hAPP(int,int,times_times(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit1(hAPP(int,int,div_mod(int,nat),min))))),hAPP(nat,int,power_power(int,s),number_number_of(nat,bit1(hAPP(int,int,div_mod(int,nat),min)))))) = hAPP(int,int,times_times(int,t),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),hAPP(int,int,times_times(int,m),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),bit1(hAPP(int,int,div_mod(int,nat),min)))))))),
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_87,c_0_88]),c_0_86]),c_0_81]),c_0_78]),c_0_81]),c_0_78]) ).
cnf(c_0_92,plain,
hBOOL(hAPP(int,bool,combc(int,int,bool,ord_less(int),hAPP(int,int,div_mod(int,nat),min)),hAPP(int,int,times_times(int,t),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),hAPP(int,int,times_times(int,m),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),hAPP(int,int,plus_plus(int,bit1(hAPP(int,int,div_mod(int,nat),min))),bit1(hAPP(int,int,div_mod(int,nat),min)))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_81]),c_0_78]) ).
cnf(c_0_93,negated_conjecture,
$false,
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)],[c_0_90,c_0_81]),c_0_50]),c_0_81]),c_0_50]),c_0_91]),c_0_81]),c_0_78]),c_0_92])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM924+7 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.55 % Computer : n016.cluster.edu
% 0.09/0.55 % Model : x86_64 x86_64
% 0.09/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.55 % Memory : 8046.5625MB
% 0.09/0.55 % OS : Linux 6.8.0-71-generic
% 0.09/0.55 % CPULimit : 300
% 0.09/0.55 % WCLimit : 300
% 0.09/0.55 % DateTime : Mon Sep 21 03:21:38 UTC 2026
% 0.09/0.56 % CPUTime :
% 0.09/0.56 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.60 Running first-order theorem proving
% 0.15/0.60 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 6.56/1.69 % Version: 3.5.1
% 6.56/1.69 % Preprocessing class: FMLMSMSMSSSNFFN.
% 6.56/1.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.56/1.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.56/1.69 % Starting new_bool_3 with 300s (1) cores
% 6.56/1.69 % Starting new_bool_1 with 300s (1) cores
% 6.56/1.69 % Starting sh5l with 300s (1) cores
% 6.56/1.69 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1437850 completed with status 0
% 6.56/1.69 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.56/1.69 % Preprocessing class: FMLMSMSMSSSNFFN.
% 6.56/1.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.56/1.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.56/1.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.56/1.69 % No SInE strategy applied
% 6.56/1.69 % Search class: FGHSM-SMLM32-DFFFFFNN
% 6.56/1.69 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 6.56/1.69 % Starting SubtermCWHack with 136s (1) cores
% 6.56/1.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.56/1.69 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 6.56/1.69 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 6.56/1.69 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 6.56/1.69 % G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1437892 completed with status 0
% 6.56/1.69 % Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.56/1.69 % Preprocessing class: FMLMSMSMSSSNFFN.
% 6.56/1.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.56/1.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.56/1.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.56/1.69 % No SInE strategy applied
% 6.56/1.69 % Search class: FGHSM-SMLM32-DFFFFFNN
% 6.56/1.69 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 6.56/1.69 % Starting SubtermCWHack with 136s (1) cores
% 6.56/1.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.56/1.69 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 6.56/1.69 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 6.56/1.69 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 6.56/1.69 % Preprocessing time : 0.060 s
% 6.56/1.69 % Presaturation interreduction done
% 6.56/1.69
% 6.56/1.69 % Proof found!
% 6.56/1.69 % SZS status Theorem
% 6.56/1.69 % SZS output start CNFRefutation
% See solution above
% 6.56/1.69 % Parsed axioms : 1255
% 6.56/1.69 % Removed by relevancy pruning/SinE : 0
% 6.56/1.69 % Initial clauses : 1736
% 6.56/1.69 % Removed in clause preprocessing : 85
% 6.56/1.69 % Initial clauses in saturation : 1651
% 6.56/1.69 % Processed clauses : 3779
% 6.56/1.69 % ...of these trivial : 101
% 6.56/1.69 % ...subsumed : 1382
% 6.56/1.69 % ...remaining for further processing : 2295
% 6.56/1.69 % Other redundant clauses eliminated : 69
% 6.56/1.69 % Clauses deleted for lack of memory : 0
% 6.56/1.69 % Backward-subsumed : 55
% 6.56/1.69 % Backward-rewritten : 145
% 6.56/1.69 % Generated clauses : 10534
% 6.56/1.69 % ...of the previous two non-redundant : 9454
% 6.56/1.69 % ...aggressively subsumed : 0
% 6.56/1.69 % Contextual simplify-reflections : 2
% 6.56/1.69 % Paramodulations : 10468
% 6.56/1.69 % Factorizations : 0
% 6.56/1.69 % NegExts : 0
% 6.56/1.69 % Equation resolutions : 72
% 6.56/1.69 % Disequality decompositions : 0
% 6.56/1.69 % Total rewrite steps : 20116
% 6.56/1.69 % ...of those cached : 18696
% 6.56/1.69 % Propositional unsat checks : 0
% 6.56/1.69 % Propositional check models : 0
% 6.56/1.69 % Propositional check unsatisfiable : 0
% 6.56/1.69 % Propositional clauses : 0
% 6.56/1.69 % Propositional clauses after purity: 0
% 6.56/1.69 % Propositional unsat core size : 0
% 6.56/1.69 % Propositional preprocessing time : 0.000
% 6.56/1.69 % Propositional encoding time : 0.000
% 6.56/1.69 % Propositional solver time : 0.000
% 6.56/1.69 % Success case prop preproc time : 0.000
% 6.56/1.69 % Success case prop encoding time : 0.000
% 6.56/1.69 % Success case prop solver time : 0.000
% 6.56/1.69 % Current number of processed clauses : 651
% 6.56/1.69 % Positive orientable unit clauses : 334
% 6.56/1.69 % Positive unorientable unit clauses: 35
% 6.56/1.69 % Negative unit clauses : 37
% 6.56/1.69 % Non-unit-clauses : 245
% 6.56/1.69 % Current number of unprocessed clauses: 8685
% 6.56/1.69 % ...number of literals in the above : 20381
% 6.56/1.69 % Current number of archived formulas : 0
% 6.56/1.69 % Current number of archived clauses : 1584
% 6.56/1.69 % Clause-clause subsumption calls (NU) : 204418
% 6.56/1.69 % Rec. Clause-clause subsumption calls : 80468
% 6.56/1.69 % Non-unit clause-clause subsumptions : 1017
% 6.56/1.69 % Unit Clause-clause subsumption calls : 2535
% 6.56/1.69 % Rewrite failures with RHS unbound : 0
% 6.56/1.69 % BW rewrite match attempts : 21829
% 6.56/1.69 % BW rewrite match successes : 718
% 6.56/1.69 % Condensation attempts : 0
% 6.56/1.69 % Condensation successes : 0
% 6.56/1.69 % Termbank termtop insertions : 804936
% 6.56/1.69 % Search garbage collected termcells : 21131
% 6.56/1.69
% 6.56/1.69 % -------------------------------------------------
% 6.56/1.69 % User time : 0.914 s
% 6.56/1.69 % System time : 0.050 s
% 6.56/1.69 % Total time : 0.964 s
% 6.56/1.69 % Maximum resident set size: 11448 pages
% 6.56/1.69
% 6.56/1.69 % -------------------------------------------------
% 6.56/1.69 % User time : 3.896 s
% 6.56/1.69 % System time : 0.224 s
% 6.56/1.69 % Total time : 4.120 s
% 6.56/1.69 % Maximum resident set size: 6656 pages
% 6.56/1.69 % E exiting
%------------------------------------------------------------------------------