TSTP Solution File: NUM926+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM926+1 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 11:33:46 EDT 2023
% Result : Theorem 0.47s 1.27s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of formulae : 87 ( 45 unt; 0 def)
% Number of atoms : 139 ( 69 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 99 ( 47 ~; 39 |; 3 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-2 aty)
% Number of variables : 154 ( 4 sgn; 94 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
ord_less_eq_int(one_one_int,t),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_tpos) ).
fof(f2,axiom,
( one_one_int = t
=> ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,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/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(f3,axiom,
( ord_less_int(one_one_int,t)
=> ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,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/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(f30,axiom,
! [X18,X19] :
( ord_less_int(X19,X18)
| X18 = X19
| ord_less_int(X18,X19) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_29_zless__linear) ).
fof(f39,axiom,
! [X27,X17] :
( ord_less_eq_int(number_number_of_int(X27),number_number_of_int(X17))
<=> ~ ord_less_int(number_number_of_int(X17),number_number_of_int(X27)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_38_le__number__of__eq__not__less) ).
fof(f59,axiom,
! [X35,X36] :
( ord_less_int(number_number_of_int(X35),number_number_of_int(X36))
<=> ord_less_int(X35,X36) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_58_less__number__of__int__code) ).
fof(f60,axiom,
! [X35,X36] :
( ord_less_eq_int(number_number_of_int(X35),number_number_of_int(X36))
<=> ord_less_eq_int(X35,X36) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_59_less__eq__number__of__int__code) ).
fof(f85,axiom,
! [X54,X55,X56] : times_times_int(times_times_int(X54,X55),X56) = times_times_int(X54,times_times_int(X55,X56)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_84_comm__semiring__1__class_Onormalizing__semiring__rules_I17_J) ).
fof(f86,axiom,
! [X54,X55,X56] : times_times_nat(times_times_nat(X54,X55),X56) = times_times_nat(X54,times_times_nat(X55,X56)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_85_comm__semiring__1__class_Onormalizing__semiring__rules_I17_J) ).
fof(f91,axiom,
! [X63,X64] : times_times_int(X63,X64) = times_times_int(X64,X63),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J) ).
fof(f92,axiom,
! [X63,X64] : times_times_nat(X63,X64) = times_times_nat(X64,X63),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_91_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J) ).
fof(f97,axiom,
! [X72,X73,X74] : plus_plus_int(plus_plus_int(X72,X73),X74) = plus_plus_int(X72,plus_plus_int(X73,X74)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_96_comm__semiring__1__class_Onormalizing__semiring__rules_I21_J) ).
fof(f98,axiom,
! [X72,X73,X74] : plus_plus_nat(plus_plus_nat(X72,X73),X74) = plus_plus_nat(X72,plus_plus_nat(X73,X74)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_97_comm__semiring__1__class_Onormalizing__semiring__rules_I21_J) ).
fof(f103,axiom,
! [X81,X82] : plus_plus_int(X81,X82) = plus_plus_int(X82,X81),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).
fof(f104,axiom,
! [X81,X82] : plus_plus_nat(X81,X82) = plus_plus_nat(X82,X81),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_103_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).
fof(f124,conjecture,
? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,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/benchmark/theBenchmark.p',conj_0) ).
fof(f125,negated_conjecture,
~ ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,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(negated_conjecture,[],[f124]) ).
fof(f145,plain,
! [X0,X1] :
( ord_less_int(X1,X0)
| X0 = X1
| ord_less_int(X0,X1) ),
inference(rectify,[],[f30]) ).
fof(f154,plain,
! [X0,X1] :
( ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1))
<=> ~ ord_less_int(number_number_of_int(X1),number_number_of_int(X0)) ),
inference(rectify,[],[f39]) ).
fof(f171,plain,
! [X0,X1] :
( ord_less_int(number_number_of_int(X0),number_number_of_int(X1))
<=> ord_less_int(X0,X1) ),
inference(rectify,[],[f59]) ).
fof(f172,plain,
! [X0,X1] :
( ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1))
<=> ord_less_eq_int(X0,X1) ),
inference(rectify,[],[f60]) ).
fof(f194,plain,
! [X0,X1,X2] : times_times_int(times_times_int(X0,X1),X2) = times_times_int(X0,times_times_int(X1,X2)),
inference(rectify,[],[f85]) ).
fof(f195,plain,
! [X0,X1,X2] : times_times_nat(times_times_nat(X0,X1),X2) = times_times_nat(X0,times_times_nat(X1,X2)),
inference(rectify,[],[f86]) ).
fof(f200,plain,
! [X0,X1] : times_times_int(X1,X0) = times_times_int(X0,X1),
inference(rectify,[],[f91]) ).
fof(f201,plain,
! [X0,X1] : times_times_nat(X0,X1) = times_times_nat(X1,X0),
inference(rectify,[],[f92]) ).
fof(f206,plain,
! [X0,X1,X2] : plus_plus_int(plus_plus_int(X0,X1),X2) = plus_plus_int(X0,plus_plus_int(X1,X2)),
inference(rectify,[],[f97]) ).
fof(f207,plain,
! [X0,X1,X2] : plus_plus_nat(plus_plus_nat(X0,X1),X2) = plus_plus_nat(X0,plus_plus_nat(X1,X2)),
inference(rectify,[],[f98]) ).
fof(f212,plain,
! [X0,X1] : plus_plus_int(X0,X1) = plus_plus_int(X1,X0),
inference(rectify,[],[f103]) ).
fof(f213,plain,
! [X0,X1] : plus_plus_nat(X0,X1) = plus_plus_nat(X1,X0),
inference(rectify,[],[f104]) ).
fof(f235,plain,
( ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,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)
| one_one_int != t ),
inference(ennf_transformation,[],[f2]) ).
fof(f236,plain,
( ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,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(ennf_transformation,[],[f3]) ).
fof(f250,plain,
! [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,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(ennf_transformation,[],[f125]) ).
fof(f251,plain,
( ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,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)
=> plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK1,number_number_of_nat(bit0(bit1(pls))))) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK1,number_number_of_nat(bit0(bit1(pls)))))
| one_one_int != t ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f235,f251]) ).
fof(f253,plain,
( ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,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)
=> plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK3,number_number_of_nat(bit0(bit1(pls))))) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK3,number_number_of_nat(bit0(bit1(pls)))))
| ~ ord_less_int(one_one_int,t) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f236,f253]) ).
fof(f260,plain,
! [X0,X1] :
( ( ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1))
| ord_less_int(number_number_of_int(X1),number_number_of_int(X0)) )
& ( ~ ord_less_int(number_number_of_int(X1),number_number_of_int(X0))
| ~ ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1)) ) ),
inference(nnf_transformation,[],[f154]) ).
fof(f271,plain,
! [X0,X1] :
( ( ord_less_int(number_number_of_int(X0),number_number_of_int(X1))
| ~ ord_less_int(X0,X1) )
& ( ord_less_int(X0,X1)
| ~ ord_less_int(number_number_of_int(X0),number_number_of_int(X1)) ) ),
inference(nnf_transformation,[],[f171]) ).
fof(f272,plain,
! [X0,X1] :
( ( ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1))
| ~ ord_less_eq_int(X0,X1) )
& ( ord_less_eq_int(X0,X1)
| ~ ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1)) ) ),
inference(nnf_transformation,[],[f172]) ).
fof(f294,plain,
ord_less_eq_int(one_one_int,t),
inference(cnf_transformation,[],[f1]) ).
fof(f295,plain,
( plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK1,number_number_of_nat(bit0(bit1(pls)))))
| one_one_int != t ),
inference(cnf_transformation,[],[f252]) ).
fof(f296,plain,
( plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK3,number_number_of_nat(bit0(bit1(pls)))))
| ~ ord_less_int(one_one_int,t) ),
inference(cnf_transformation,[],[f254]) ).
fof(f324,plain,
! [X0,X1] :
( ord_less_int(X1,X0)
| X0 = X1
| ord_less_int(X0,X1) ),
inference(cnf_transformation,[],[f145]) ).
fof(f334,plain,
! [X0,X1] :
( ~ ord_less_int(number_number_of_int(X1),number_number_of_int(X0))
| ~ ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1)) ),
inference(cnf_transformation,[],[f260]) ).
fof(f366,plain,
! [X0,X1] :
( ord_less_int(number_number_of_int(X0),number_number_of_int(X1))
| ~ ord_less_int(X0,X1) ),
inference(cnf_transformation,[],[f271]) ).
fof(f368,plain,
! [X0,X1] :
( ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1))
| ~ ord_less_eq_int(X0,X1) ),
inference(cnf_transformation,[],[f272]) ).
fof(f402,plain,
! [X2,X0,X1] : times_times_int(times_times_int(X0,X1),X2) = times_times_int(X0,times_times_int(X1,X2)),
inference(cnf_transformation,[],[f194]) ).
fof(f403,plain,
! [X2,X0,X1] : times_times_nat(times_times_nat(X0,X1),X2) = times_times_nat(X0,times_times_nat(X1,X2)),
inference(cnf_transformation,[],[f195]) ).
fof(f408,plain,
! [X0,X1] : times_times_int(X1,X0) = times_times_int(X0,X1),
inference(cnf_transformation,[],[f200]) ).
fof(f409,plain,
! [X0,X1] : times_times_nat(X0,X1) = times_times_nat(X1,X0),
inference(cnf_transformation,[],[f201]) ).
fof(f414,plain,
! [X2,X0,X1] : plus_plus_int(plus_plus_int(X0,X1),X2) = plus_plus_int(X0,plus_plus_int(X1,X2)),
inference(cnf_transformation,[],[f206]) ).
fof(f415,plain,
! [X2,X0,X1] : plus_plus_nat(plus_plus_nat(X0,X1),X2) = plus_plus_nat(X0,plus_plus_nat(X1,X2)),
inference(cnf_transformation,[],[f207]) ).
fof(f420,plain,
! [X0,X1] : plus_plus_int(X0,X1) = plus_plus_int(X1,X0),
inference(cnf_transformation,[],[f212]) ).
fof(f421,plain,
! [X0,X1] : plus_plus_nat(X0,X1) = plus_plus_nat(X1,X0),
inference(cnf_transformation,[],[f213]) ).
fof(f454,plain,
! [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,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(cnf_transformation,[],[f250]) ).
cnf(c_49,plain,
ord_less_eq_int(one_one_int,t),
inference(cnf_transformation,[],[f294]) ).
cnf(c_50,plain,
( one_one_int != t
| plus_plus_int(power_power_int(sK0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK1,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(cnf_transformation,[],[f295]) ).
cnf(c_51,plain,
( ~ ord_less_int(one_one_int,t)
| plus_plus_int(power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK3,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(cnf_transformation,[],[f296]) ).
cnf(c_79,plain,
( X0 = X1
| ord_less_int(X0,X1)
| ord_less_int(X1,X0) ),
inference(cnf_transformation,[],[f324]) ).
cnf(c_90,plain,
( ~ ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1))
| ~ ord_less_int(number_number_of_int(X1),number_number_of_int(X0)) ),
inference(cnf_transformation,[],[f334]) ).
cnf(c_120,plain,
( ~ ord_less_int(X0,X1)
| ord_less_int(number_number_of_int(X0),number_number_of_int(X1)) ),
inference(cnf_transformation,[],[f366]) ).
cnf(c_122,plain,
( ~ ord_less_eq_int(X0,X1)
| ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1)) ),
inference(cnf_transformation,[],[f368]) ).
cnf(c_157,plain,
times_times_int(times_times_int(X0,X1),X2) = times_times_int(X0,times_times_int(X1,X2)),
inference(cnf_transformation,[],[f402]) ).
cnf(c_158,plain,
times_times_nat(times_times_nat(X0,X1),X2) = times_times_nat(X0,times_times_nat(X1,X2)),
inference(cnf_transformation,[],[f403]) ).
cnf(c_163,plain,
times_times_int(X0,X1) = times_times_int(X1,X0),
inference(cnf_transformation,[],[f408]) ).
cnf(c_164,plain,
times_times_nat(X0,X1) = times_times_nat(X1,X0),
inference(cnf_transformation,[],[f409]) ).
cnf(c_169,plain,
plus_plus_int(plus_plus_int(X0,X1),X2) = plus_plus_int(X0,plus_plus_int(X1,X2)),
inference(cnf_transformation,[],[f414]) ).
cnf(c_170,plain,
plus_plus_nat(plus_plus_nat(X0,X1),X2) = plus_plus_nat(X0,plus_plus_nat(X1,X2)),
inference(cnf_transformation,[],[f415]) ).
cnf(c_175,plain,
plus_plus_int(X0,X1) = plus_plus_int(X1,X0),
inference(cnf_transformation,[],[f420]) ).
cnf(c_176,plain,
plus_plus_nat(X0,X1) = plus_plus_nat(X1,X0),
inference(cnf_transformation,[],[f421]) ).
cnf(c_202,negated_conjecture,
plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,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(cnf_transformation,[],[f454]) ).
cnf(c_281,plain,
( one_one_int != t
| plus_plus_int(power_power_int(sK0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(pls)))))) ),
inference(theory_normalisation,[status(thm)],[c_50,c_158,c_164,c_170,c_176,c_169,c_175,c_157,c_163]) ).
cnf(c_282,plain,
( ~ ord_less_int(one_one_int,t)
| plus_plus_int(power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK3,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(pls)))))) ),
inference(theory_normalisation,[status(thm)],[c_51,c_158,c_164,c_170,c_176,c_169,c_175,c_157,c_163]) ).
cnf(c_292,negated_conjecture,
plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(pls)))))),
inference(theory_normalisation,[status(thm)],[c_202,c_158,c_164,c_170,c_176,c_169,c_175,c_157,c_163]) ).
cnf(c_301,plain,
( ~ ord_less_eq_int(X0,X1)
| ~ ord_less_int(number_number_of_int(X1),number_number_of_int(X0)) ),
inference(prop_impl_just,[status(thm)],[c_122,c_90]) ).
cnf(c_302,plain,
( ~ ord_less_int(number_number_of_int(X0),number_number_of_int(X1))
| ~ ord_less_eq_int(X1,X0) ),
inference(renaming,[status(thm)],[c_301]) ).
cnf(c_307,plain,
( ~ ord_less_int(X0,X1)
| ord_less_int(number_number_of_int(X0),number_number_of_int(X1)) ),
inference(prop_impl_just,[status(thm)],[c_120]) ).
cnf(c_373,plain,
( one_one_int != t
| plus_plus_int(power_power_int(sK0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(pls)))))) ),
inference(prop_impl_just,[status(thm)],[c_281]) ).
cnf(c_375,plain,
( ~ ord_less_int(one_one_int,t)
| plus_plus_int(power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK3,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(pls)))))) ),
inference(prop_impl_just,[status(thm)],[c_282]) ).
cnf(c_571,plain,
( ~ ord_less_eq_int(X0,X1)
| ~ ord_less_int(X1,X0) ),
inference(bin_hyper_res,[status(thm)],[c_302,c_307]) ).
cnf(c_652,plain,
one_one_int != t,
inference(backward_subsumption_resolution,[status(thm)],[c_373,c_292]) ).
cnf(c_653,plain,
~ ord_less_int(one_one_int,t),
inference(backward_subsumption_resolution,[status(thm)],[c_375,c_292]) ).
cnf(c_2617,plain,
( ~ ord_less_int(X1,X0)
| ~ ord_less_eq_int(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_571]) ).
cnf(c_2618,plain,
( ~ ord_less_eq_int(X0,X1)
| ~ ord_less_int(X1,X0) ),
inference(renaming,[status(thm)],[c_2617]) ).
cnf(c_4612,plain,
~ ord_less_int(t,one_one_int),
inference(superposition,[status(thm)],[c_49,c_2618]) ).
cnf(c_5018,plain,
( one_one_int = t
| ord_less_int(one_one_int,t) ),
inference(superposition,[status(thm)],[c_79,c_4612]) ).
cnf(c_5032,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5018,c_653,c_652]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.15 % Problem : NUM926+1 : TPTP v8.1.2. Released v5.3.0.
% 0.14/0.16 % Command : run_iprover %s %d THM
% 0.14/0.37 % Computer : n017.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Fri Aug 25 08:58:25 EDT 2023
% 0.14/0.38 % CPUTime :
% 0.21/0.52 Running first-order theorem proving
% 0.21/0.52 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.47/1.27 % SZS status Started for theBenchmark.p
% 0.47/1.27 % SZS status Theorem for theBenchmark.p
% 0.47/1.27
% 0.47/1.27 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.47/1.27
% 0.47/1.27 ------ iProver source info
% 0.47/1.27
% 0.47/1.27 git: date: 2023-05-31 18:12:56 +0000
% 0.47/1.27 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.47/1.27 git: non_committed_changes: false
% 0.47/1.27 git: last_make_outside_of_git: false
% 0.47/1.27
% 0.47/1.27 ------ Parsing...
% 0.47/1.27 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.47/1.27
% 0.47/1.27 ------ Preprocessing... sup_sim: 30 sf_s rm: 8 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 0.47/1.27
% 0.47/1.27 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.27
% 0.47/1.27 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.47/1.27 ------ Proving...
% 0.47/1.27 ------ Problem Properties
% 0.47/1.27
% 0.47/1.27
% 0.47/1.27 clauses 85
% 0.47/1.27 conjectures 0
% 0.47/1.27 EPR 10
% 0.47/1.27 Horn 73
% 0.47/1.27 unary 40
% 0.47/1.27 binary 40
% 0.47/1.27 lits 135
% 0.47/1.27 lits eq 43
% 0.47/1.27 fd_pure 0
% 0.47/1.27 fd_pseudo 0
% 0.47/1.27 fd_cond 0
% 0.47/1.27 fd_pseudo_cond 3
% 0.47/1.27 AC symbols 4
% 0.47/1.27
% 0.47/1.27 ------ Schedule dynamic 5 is on
% 0.47/1.27
% 0.47/1.27 ------ no conjectures: strip conj schedule
% 0.47/1.27
% 0.47/1.27 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.47/1.27
% 0.47/1.27
% 0.47/1.27 ------
% 0.47/1.27 Current options:
% 0.47/1.27 ------
% 0.47/1.27
% 0.47/1.27
% 0.47/1.27
% 0.47/1.27
% 0.47/1.27 ------ Proving...
% 0.47/1.27
% 0.47/1.27
% 0.47/1.27 % SZS status Theorem for theBenchmark.p
% 0.47/1.27
% 0.47/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.27
% 0.47/1.28
%------------------------------------------------------------------------------