TSTP Solution File: NUM926_2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM926_2 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:58:02 EDT 2023
% Result : Theorem 0.44s 0.76s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 29
% Syntax : Number of formulae : 63 ( 30 unt; 17 typ; 0 def)
% Number of atoms : 67 ( 40 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 43 ( 22 ~; 14 |; 1 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 14 ( 9 >; 5 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn; 51 !; 8 ?; 59 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_25,type,
one_one_int: int ).
tff(decl_28,type,
plus_plus_int: ( int * int ) > int ).
tff(decl_31,type,
times_times_int: ( int * int ) > int ).
tff(decl_39,type,
bit0: int > int ).
tff(decl_40,type,
bit1: int > int ).
tff(decl_42,type,
pls: int ).
tff(decl_43,type,
number_number_of_int: int > int ).
tff(decl_44,type,
number_number_of_nat: int > nat ).
tff(decl_46,type,
ord_less_int: ( int * int ) > $o ).
tff(decl_49,type,
ord_less_eq_int: ( int * int ) > $o ).
tff(decl_52,type,
power_power_int: ( int * nat ) > int ).
tff(decl_63,type,
m: int ).
tff(decl_66,type,
t: int ).
tff(decl_67,type,
esk1_0: int ).
tff(decl_68,type,
esk2_0: int ).
tff(decl_69,type,
esk3_0: int ).
tff(decl_70,type,
esk4_0: int ).
tff(conj_0,conjecture,
? [X1: int,X2: int] : ( plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
file('/export/starexec/sandbox/tmp/tmp.jdjL3YUDEW/E---3.1_4253.p',conj_0) ).
tff(fact_142_number__of__is__id,axiom,
! [X31: int] : ( number_number_of_int(X31) = X31 ),
file('/export/starexec/sandbox/tmp/tmp.jdjL3YUDEW/E---3.1_4253.p',fact_142_number__of__is__id) ).
tff(fact_204_Bit0__def,axiom,
! [X31: int] : ( bit0(X31) = plus_plus_int(X31,X31) ),
file('/export/starexec/sandbox/tmp/tmp.jdjL3YUDEW/E---3.1_4253.p',fact_204_Bit0__def) ).
tff(fact_251_Bit1__def,axiom,
! [X31: int] : ( bit1(X31) = plus_plus_int(plus_plus_int(one_one_int,X31),X31) ),
file('/export/starexec/sandbox/tmp/tmp.jdjL3YUDEW/E---3.1_4253.p',fact_251_Bit1__def) ).
tff(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 )
=> ? [X1: int,X2: int] : ( plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
file('/export/starexec/sandbox/tmp/tmp.jdjL3YUDEW/E---3.1_4253.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) ).
tff(fact_201_add__Pls__right,axiom,
! [X31: int] : ( plus_plus_int(X31,pls) = X31 ),
file('/export/starexec/sandbox/tmp/tmp.jdjL3YUDEW/E---3.1_4253.p',fact_201_add__Pls__right) ).
tff(fact_126_comm__semiring__1__class_Onormalizing__semiring__rules_I25_J,axiom,
! [X184: int,X185: int,X186: int] : ( plus_plus_int(X184,plus_plus_int(X185,X186)) = plus_plus_int(plus_plus_int(X184,X185),X186) ),
file('/export/starexec/sandbox/tmp/tmp.jdjL3YUDEW/E---3.1_4253.p',fact_126_comm__semiring__1__class_Onormalizing__semiring__rules_I25_J) ).
tff(fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J,axiom,
! [X200: int,X201: int] : ( plus_plus_int(X200,X201) = plus_plus_int(X201,X200) ),
file('/export/starexec/sandbox/tmp/tmp.jdjL3YUDEW/E---3.1_4253.p',fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).
tff(fact_50_le__number__of__eq__not__less,axiom,
! [X44: int,X28: int] :
( ord_less_eq_int(number_number_of_int(X44),number_number_of_int(X28))
<=> ~ ord_less_int(number_number_of_int(X28),number_number_of_int(X44)) ),
file('/export/starexec/sandbox/tmp/tmp.jdjL3YUDEW/E---3.1_4253.p',fact_50_le__number__of__eq__not__less) ).
tff(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,
( ord_less_int(one_one_int,t)
=> ? [X1: int,X2: int] : ( plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
file('/export/starexec/sandbox/tmp/tmp.jdjL3YUDEW/E---3.1_4253.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) ).
tff(fact_40_zle__antisym,axiom,
! [X26: int,X25: int] :
( ord_less_eq_int(X26,X25)
=> ( ord_less_eq_int(X25,X26)
=> ( X26 = X25 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.jdjL3YUDEW/E---3.1_4253.p',fact_40_zle__antisym) ).
tff(fact_0_tpos,axiom,
ord_less_eq_int(one_one_int,t),
file('/export/starexec/sandbox/tmp/tmp.jdjL3YUDEW/E---3.1_4253.p',fact_0_tpos) ).
tff(c_0_12,negated_conjecture,
~ ? [X1: int,X2: int] : ( plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
tff(c_0_13,negated_conjecture,
! [X2150: int,X2151: int] : ( plus_plus_int(power_power_int(X2150,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2151,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
tff(c_0_14,plain,
! [X1077: int] : ( number_number_of_int(X1077) = X1077 ),
inference(variable_rename,[status(thm)],[fact_142_number__of__is__id]) ).
tff(c_0_15,plain,
! [X1197: int] : ( bit0(X1197) = plus_plus_int(X1197,X1197) ),
inference(variable_rename,[status(thm)],[fact_204_Bit0__def]) ).
tff(c_0_16,plain,
! [X1292: int] : ( bit1(X1292) = plus_plus_int(plus_plus_int(one_one_int,X1292),X1292) ),
inference(variable_rename,[status(thm)],[fact_251_Bit1__def]) ).
tff(c_0_17,plain,
( ( t != one_one_int )
| ( plus_plus_int(power_power_int(esk1_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk2_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
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])])]) ).
tcf(c_0_18,negated_conjecture,
! [X1: int,X2: int] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_19,plain,
! [X1: int] : number_number_of_int(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_20,plain,
! [X1: int] : bit0(X1) = plus_plus_int(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tcf(c_0_21,plain,
! [X1: int] : bit1(X1) = plus_plus_int(plus_plus_int(one_one_int,X1),X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tff(c_0_22,plain,
! [X1193: int] : ( plus_plus_int(X1193,pls) = X1193 ),
inference(variable_rename,[status(thm)],[fact_201_add__Pls__right]) ).
tff(c_0_23,plain,
! [X1040: int,X1041: int,X1042: int] : ( plus_plus_int(X1040,plus_plus_int(X1041,X1042)) = plus_plus_int(plus_plus_int(X1040,X1041),X1042) ),
inference(variable_rename,[status(thm)],[fact_126_comm__semiring__1__class_Onormalizing__semiring__rules_I25_J]) ).
tff(c_0_24,plain,
! [X1056: int,X1057: int] : ( plus_plus_int(X1056,X1057) = plus_plus_int(X1057,X1056) ),
inference(variable_rename,[status(thm)],[fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J]) ).
tcf(c_0_25,plain,
( ( plus_plus_int(power_power_int(esk1_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk2_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) )
| ( t != one_one_int ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tcf(c_0_26,negated_conjecture,
! [X1: int,X2: int] : plus_plus_int(power_power_int(X1,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)))),power_power_int(X2,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls))))) != plus_plus_int(times_times_int(plus_plus_int(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)),plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls))),m),one_one_int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_20]),c_0_20]),c_0_20]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]) ).
tcf(c_0_27,plain,
! [X1: int] : plus_plus_int(X1,pls) = X1,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
tcf(c_0_28,plain,
! [X1: int,X2: int,X3: int] : plus_plus_int(X1,plus_plus_int(X2,X3)) = plus_plus_int(plus_plus_int(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_29,plain,
! [X2: int,X1: int] : plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
tff(c_0_30,plain,
! [X44: int,X28: int] :
( ord_less_eq_int(number_number_of_int(X44),number_number_of_int(X28))
<=> ~ ord_less_int(number_number_of_int(X28),number_number_of_int(X44)) ),
inference(fof_simplification,[status(thm)],[fact_50_le__number__of__eq__not__less]) ).
tff(c_0_31,plain,
( ~ ord_less_int(one_one_int,t)
| ( plus_plus_int(power_power_int(esk3_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk4_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
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])])]) ).
tff(c_0_32,plain,
! [X831: int,X832: int] :
( ~ ord_less_eq_int(X831,X832)
| ~ ord_less_eq_int(X832,X831)
| ( X831 = X832 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_40_zle__antisym])]) ).
tcf(c_0_33,plain,
( ( plus_plus_int(power_power_int(esk1_0,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)))),power_power_int(esk2_0,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls))))) = plus_plus_int(times_times_int(plus_plus_int(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)),plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls))),m),one_one_int) )
| ( t != one_one_int ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_19]),c_0_20]),c_0_20]),c_0_20]),c_0_20]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]) ).
tcf(c_0_34,negated_conjecture,
! [X1: int,X2: int] : plus_plus_int(power_power_int(X1,number_number_of_nat(plus_plus_int(one_one_int,one_one_int))),power_power_int(X2,number_number_of_nat(plus_plus_int(one_one_int,one_one_int)))) != plus_plus_int(one_one_int,times_times_int(plus_plus_int(one_one_int,plus_plus_int(one_one_int,plus_plus_int(one_one_int,one_one_int))),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)],[c_0_26,c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_28]),c_0_29]) ).
tff(c_0_35,plain,
! [X852: int,X853: int] :
( ( ~ ord_less_eq_int(number_number_of_int(X852),number_number_of_int(X853))
| ~ ord_less_int(number_number_of_int(X853),number_number_of_int(X852)) )
& ( ord_less_int(number_number_of_int(X853),number_number_of_int(X852))
| ord_less_eq_int(number_number_of_int(X852),number_number_of_int(X853)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])]) ).
tcf(c_0_36,plain,
( ( plus_plus_int(power_power_int(esk3_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk4_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) )
| ~ ord_less_int(one_one_int,t) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
tcf(c_0_37,plain,
! [X2: int,X1: int] :
( ( X1 = X2 )
| ~ ord_less_eq_int(X1,X2)
| ~ ord_less_eq_int(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
tcf(c_0_38,plain,
ord_less_eq_int(one_one_int,t),
inference(split_conjunct,[status(thm)],[fact_0_tpos]) ).
tcf(c_0_39,plain,
t != one_one_int,
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)],[c_0_33,c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_28]),c_0_29]),c_0_34]) ).
tcf(c_0_40,plain,
! [X2: int,X1: int] :
( ord_less_int(number_number_of_int(X1),number_number_of_int(X2))
| ord_less_eq_int(number_number_of_int(X2),number_number_of_int(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
tcf(c_0_41,plain,
( ( plus_plus_int(power_power_int(esk3_0,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)))),power_power_int(esk4_0,number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls))))) = plus_plus_int(times_times_int(plus_plus_int(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)),plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls))),m),one_one_int) )
| ~ ord_less_int(one_one_int,t) ),
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_36,c_0_19]),c_0_20]),c_0_20]),c_0_20]),c_0_20]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]) ).
tcf(c_0_42,plain,
~ ord_less_eq_int(t,one_one_int),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
tcf(c_0_43,plain,
! [X2: int,X1: int] :
( ord_less_int(X1,X2)
| ord_less_eq_int(X2,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_19]),c_0_19]),c_0_19]),c_0_19]) ).
tcf(c_0_44,plain,
~ ord_less_int(one_one_int,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)],[c_0_41,c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_28]),c_0_29]),c_0_34]) ).
cnf(c_0_45,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.19/0.20 % Problem : NUM926_2 : TPTP v8.1.2. Released v5.3.0.
% 0.19/0.21 % Command : run_E %s %d THM
% 0.20/0.43 % Computer : n012.cluster.edu
% 0.20/0.43 % Model : x86_64 x86_64
% 0.20/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.43 % Memory : 8042.1875MB
% 0.20/0.43 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.43 % CPULimit : 2400
% 0.20/0.43 % WCLimit : 300
% 0.20/0.43 % DateTime : Mon Oct 2 14:42:35 EDT 2023
% 0.20/0.43 % CPUTime :
% 0.27/0.63 Running first-order theorem proving
% 0.27/0.63 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/tmp/tmp.jdjL3YUDEW/E---3.1_4253.p
% 0.44/0.76 # Version: 3.1pre001
% 0.44/0.76 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.44/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.76 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.44/0.76 # Starting new_bool_3 with 300s (1) cores
% 0.44/0.76 # Starting new_bool_1 with 300s (1) cores
% 0.44/0.76 # Starting sh5l with 300s (1) cores
% 0.44/0.76 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4333 completed with status 0
% 0.44/0.76 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.44/0.76 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.44/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.76 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.44/0.76 # No SInE strategy applied
% 0.44/0.76 # Search class: FGHSM-FSLM31-DFFFFFNN
% 0.44/0.76 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.44/0.76 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 680s (1) cores
% 0.44/0.76 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.44/0.76 # Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.44/0.76 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.44/0.76 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.44/0.76 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4339 completed with status 0
% 0.44/0.76 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.44/0.76 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.44/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.76 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.44/0.76 # No SInE strategy applied
% 0.44/0.76 # Search class: FGHSM-FSLM31-DFFFFFNN
% 0.44/0.76 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.44/0.76 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 680s (1) cores
% 0.44/0.76 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.44/0.76 # Preprocessing time : 0.010 s
% 0.44/0.76 # Presaturation interreduction done
% 0.44/0.76
% 0.44/0.76 # Proof found!
% 0.44/0.76 # SZS status Theorem
% 0.44/0.76 # SZS output start CNFRefutation
% See solution above
% 0.44/0.76 # Parsed axioms : 748
% 0.44/0.76 # Removed by relevancy pruning/SinE : 0
% 0.44/0.76 # Initial clauses : 984
% 0.44/0.76 # Removed in clause preprocessing : 93
% 0.44/0.76 # Initial clauses in saturation : 891
% 0.44/0.76 # Processed clauses : 1064
% 0.44/0.76 # ...of these trivial : 126
% 0.44/0.76 # ...subsumed : 172
% 0.44/0.76 # ...remaining for further processing : 766
% 0.44/0.76 # Other redundant clauses eliminated : 94
% 0.44/0.76 # Clauses deleted for lack of memory : 0
% 0.44/0.76 # Backward-subsumed : 3
% 0.44/0.76 # Backward-rewritten : 22
% 0.44/0.76 # Generated clauses : 208
% 0.44/0.76 # ...of the previous two non-redundant : 143
% 0.44/0.76 # ...aggressively subsumed : 0
% 0.44/0.76 # Contextual simplify-reflections : 1
% 0.44/0.76 # Paramodulations : 129
% 0.44/0.76 # Factorizations : 1
% 0.44/0.76 # NegExts : 0
% 0.44/0.76 # Equation resolutions : 96
% 0.44/0.76 # Total rewrite steps : 2195
% 0.44/0.76 # Propositional unsat checks : 0
% 0.44/0.76 # Propositional check models : 0
% 0.44/0.76 # Propositional check unsatisfiable : 0
% 0.44/0.76 # Propositional clauses : 0
% 0.44/0.76 # Propositional clauses after purity: 0
% 0.44/0.76 # Propositional unsat core size : 0
% 0.44/0.76 # Propositional preprocessing time : 0.000
% 0.44/0.76 # Propositional encoding time : 0.000
% 0.44/0.76 # Propositional solver time : 0.000
% 0.44/0.76 # Success case prop preproc time : 0.000
% 0.44/0.76 # Success case prop encoding time : 0.000
% 0.44/0.76 # Success case prop solver time : 0.000
% 0.44/0.76 # Current number of processed clauses : 105
% 0.44/0.76 # Positive orientable unit clauses : 47
% 0.44/0.76 # Positive unorientable unit clauses: 3
% 0.44/0.76 # Negative unit clauses : 24
% 0.44/0.76 # Non-unit-clauses : 31
% 0.44/0.76 # Current number of unprocessed clauses: 530
% 0.44/0.76 # ...number of literals in the above : 1129
% 0.44/0.76 # Current number of archived formulas : 0
% 0.44/0.76 # Current number of archived clauses : 588
% 0.44/0.76 # Clause-clause subsumption calls (NU) : 27688
% 0.44/0.76 # Rec. Clause-clause subsumption calls : 15908
% 0.44/0.76 # Non-unit clause-clause subsumptions : 100
% 0.44/0.76 # Unit Clause-clause subsumption calls : 424
% 0.44/0.76 # Rewrite failures with RHS unbound : 3
% 0.44/0.76 # BW rewrite match attempts : 316
% 0.44/0.76 # BW rewrite match successes : 171
% 0.44/0.76 # Condensation attempts : 0
% 0.44/0.76 # Condensation successes : 0
% 0.44/0.76 # Termbank termtop insertions : 64079
% 0.44/0.76
% 0.44/0.76 # -------------------------------------------------
% 0.44/0.76 # User time : 0.088 s
% 0.44/0.76 # System time : 0.009 s
% 0.44/0.76 # Total time : 0.097 s
% 0.44/0.76 # Maximum resident set size: 5292 pages
% 0.44/0.76
% 0.44/0.76 # -------------------------------------------------
% 0.44/0.76 # User time : 0.342 s
% 0.44/0.76 # System time : 0.032 s
% 0.44/0.76 # Total time : 0.374 s
% 0.44/0.76 # Maximum resident set size: 2828 pages
% 0.44/0.76 % E---3.1 exiting
% 0.44/0.76 % E---3.1 exiting
%------------------------------------------------------------------------------