TSTP Solution File: NUM926+2 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM926+2 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n011.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 : Wed May 31 12:31:02 EDT 2023
% Result : Theorem 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 26
% Syntax : Number of formulae : 119 ( 32 unt; 0 def)
% Number of atoms : 261 ( 77 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 259 ( 117 ~; 107 |; 17 &)
% ( 12 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 7 ( 3 avg)
% Number of predicates : 15 ( 13 usr; 11 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-2 aty)
% Number of variables : 65 (; 53 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
is_int(zero_zero_int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,hypothesis,
! [B_1_1] :
( is_int(B_1_1)
=> is_int(bit1(B_1_1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,hypothesis,
! [B_1_1] :
( is_int(B_1_1)
=> is_int(number_number_of_int(B_1_1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,axiom,
is_int(t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f19,axiom,
ord_less_eq_int(one_one_int,t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f20,axiom,
( t = one_one_int
=> ? [X,Y] :
( is_int(X)
& is_int(Y)
& plus_plus_int(power_power_int(X,number_number_of_nat(bit0(bit1(pls)))),power_power_int(Y,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/sandbox2/benchmark/theBenchmark.p') ).
fof(f21,axiom,
( ord_less_int(one_one_int,t)
=> ? [X,Y] :
( is_int(X)
& is_int(Y)
& plus_plus_int(power_power_int(X,number_number_of_nat(bit0(bit1(pls)))),power_power_int(Y,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/sandbox2/benchmark/theBenchmark.p') ).
fof(f40,axiom,
! [X_21] : times_times_int(X_21,X_21) = power_power_int(X_21,number_number_of_nat(bit0(bit1(pls)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f56,axiom,
! [Z_1,W_1] :
( ( is_int(Z_1)
& is_int(W_1) )
=> ( ord_less_int(Z_1,W_1)
<=> ( ord_less_eq_int(Z_1,W_1)
& Z_1 != W_1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f133,axiom,
! [A_56,B_17] : times_times_int(A_56,B_17) = times_times_int(B_17,A_56),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f151,axiom,
! [A_50,C_5] : plus_plus_int(A_50,C_5) = plus_plus_int(C_5,A_50),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f161,axiom,
! [K] :
( is_int(K)
=> number_number_of_int(K) = K ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f279,axiom,
number_number_of_int(bit1(pls)) = one_one_int,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f375,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f409,axiom,
zero_zero_int = number_number_of_int(pls),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f717,conjecture,
? [X,Y] : plus_plus_int(power_power_int(X,number_number_of_nat(bit0(bit1(pls)))),power_power_int(Y,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/sandbox2/benchmark/theBenchmark.p') ).
fof(f718,negated_conjecture,
~ ? [X,Y] : plus_plus_int(power_power_int(X,number_number_of_nat(bit0(bit1(pls)))),power_power_int(Y,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,[status(cth)],[f717]) ).
fof(f726,plain,
is_int(zero_zero_int),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f730,plain,
! [B_1_1] :
( ~ is_int(B_1_1)
| is_int(bit1(B_1_1)) ),
inference(pre_NNF_transformation,[status(esa)],[f8]) ).
fof(f731,plain,
! [X0] :
( ~ is_int(X0)
| is_int(bit1(X0)) ),
inference(cnf_transformation,[status(esa)],[f730]) ).
fof(f734,plain,
! [B_1_1] :
( ~ is_int(B_1_1)
| is_int(number_number_of_int(B_1_1)) ),
inference(pre_NNF_transformation,[status(esa)],[f11]) ).
fof(f735,plain,
! [X0] :
( ~ is_int(X0)
| is_int(number_number_of_int(X0)) ),
inference(cnf_transformation,[status(esa)],[f734]) ).
fof(f745,plain,
is_int(t),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f746,plain,
ord_less_eq_int(one_one_int,t),
inference(cnf_transformation,[status(esa)],[f19]) ).
fof(f747,plain,
( t != one_one_int
| ? [X,Y] :
( is_int(X)
& is_int(Y)
& plus_plus_int(power_power_int(X,number_number_of_nat(bit0(bit1(pls)))),power_power_int(Y,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(pre_NNF_transformation,[status(esa)],[f20]) ).
fof(f748,plain,
( t != one_one_int
| ( is_int(sk0_0)
& is_int(sk0_1)
& plus_plus_int(power_power_int(sk0_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sk0_1,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(skolemization,[status(esa)],[f747]) ).
fof(f751,plain,
( t != one_one_int
| plus_plus_int(power_power_int(sk0_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sk0_1,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,[status(esa)],[f748]) ).
fof(f752,plain,
( ~ ord_less_int(one_one_int,t)
| ? [X,Y] :
( is_int(X)
& is_int(Y)
& plus_plus_int(power_power_int(X,number_number_of_nat(bit0(bit1(pls)))),power_power_int(Y,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(pre_NNF_transformation,[status(esa)],[f21]) ).
fof(f753,plain,
( ~ ord_less_int(one_one_int,t)
| ( is_int(sk0_2)
& is_int(sk0_3)
& plus_plus_int(power_power_int(sk0_2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sk0_3,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(skolemization,[status(esa)],[f752]) ).
fof(f756,plain,
( ~ ord_less_int(one_one_int,t)
| plus_plus_int(power_power_int(sk0_2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sk0_3,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,[status(esa)],[f753]) ).
fof(f775,plain,
! [X0] : times_times_int(X0,X0) = power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),
inference(cnf_transformation,[status(esa)],[f40]) ).
fof(f794,plain,
! [Z_1,W_1] :
( ~ is_int(Z_1)
| ~ is_int(W_1)
| ( ord_less_int(Z_1,W_1)
<=> ( ord_less_eq_int(Z_1,W_1)
& Z_1 != W_1 ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f56]) ).
fof(f795,plain,
! [Z_1,W_1] :
( ~ is_int(Z_1)
| ~ is_int(W_1)
| ( ( ~ ord_less_int(Z_1,W_1)
| ( ord_less_eq_int(Z_1,W_1)
& Z_1 != W_1 ) )
& ( ord_less_int(Z_1,W_1)
| ~ ord_less_eq_int(Z_1,W_1)
| Z_1 = W_1 ) ) ),
inference(NNF_transformation,[status(esa)],[f794]) ).
fof(f798,plain,
! [X0,X1] :
( ~ is_int(X0)
| ~ is_int(X1)
| ord_less_int(X0,X1)
| ~ ord_less_eq_int(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f795]) ).
fof(f968,plain,
! [X0,X1] : times_times_int(X0,X1) = times_times_int(X1,X0),
inference(cnf_transformation,[status(esa)],[f133]) ).
fof(f986,plain,
! [X0,X1] : plus_plus_int(X0,X1) = plus_plus_int(X1,X0),
inference(cnf_transformation,[status(esa)],[f151]) ).
fof(f1018,plain,
! [K] :
( ~ is_int(K)
| number_number_of_int(K) = K ),
inference(pre_NNF_transformation,[status(esa)],[f161]) ).
fof(f1019,plain,
! [X0] :
( ~ is_int(X0)
| number_number_of_int(X0) = X0 ),
inference(cnf_transformation,[status(esa)],[f1018]) ).
fof(f1247,plain,
number_number_of_int(bit1(pls)) = one_one_int,
inference(cnf_transformation,[status(esa)],[f279]) ).
fof(f1470,plain,
pls = zero_zero_int,
inference(cnf_transformation,[status(esa)],[f375]) ).
fof(f1573,plain,
zero_zero_int = number_number_of_int(pls),
inference(cnf_transformation,[status(esa)],[f409]) ).
fof(f2405,plain,
! [X,Y] : plus_plus_int(power_power_int(X,number_number_of_nat(bit0(bit1(pls)))),power_power_int(Y,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(pre_NNF_transformation,[status(esa)],[f718]) ).
fof(f2406,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,[status(esa)],[f2405]) ).
fof(f2407,plain,
( spl0_0
<=> t = one_one_int ),
introduced(split_symbol_definition) ).
fof(f2418,plain,
( spl0_3
<=> plus_plus_int(power_power_int(sk0_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sk0_1,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) ),
introduced(split_symbol_definition) ).
fof(f2419,plain,
( plus_plus_int(power_power_int(sk0_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sk0_1,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)
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f2418]) ).
fof(f2421,plain,
( ~ spl0_0
| spl0_3 ),
inference(split_clause,[status(thm)],[f751,f2407,f2418]) ).
fof(f2422,plain,
( spl0_4
<=> ord_less_int(one_one_int,t) ),
introduced(split_symbol_definition) ).
fof(f2424,plain,
( ~ ord_less_int(one_one_int,t)
| spl0_4 ),
inference(component_clause,[status(thm)],[f2422]) ).
fof(f2433,plain,
( spl0_7
<=> plus_plus_int(power_power_int(sk0_2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sk0_3,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) ),
introduced(split_symbol_definition) ).
fof(f2434,plain,
( plus_plus_int(power_power_int(sk0_2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sk0_3,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)
| ~ spl0_7 ),
inference(component_clause,[status(thm)],[f2433]) ).
fof(f2436,plain,
( ~ spl0_4
| spl0_7 ),
inference(split_clause,[status(thm)],[f756,f2422,f2433]) ).
fof(f2534,plain,
( spl0_10
<=> is_int(pls) ),
introduced(split_symbol_definition) ).
fof(f2536,plain,
( ~ is_int(pls)
| spl0_10 ),
inference(component_clause,[status(thm)],[f2534]) ).
fof(f2537,plain,
( spl0_11
<=> is_int(zero_zero_int) ),
introduced(split_symbol_definition) ).
fof(f2540,plain,
( ~ is_int(pls)
| is_int(zero_zero_int) ),
inference(paramodulation,[status(thm)],[f1573,f735]) ).
fof(f2541,plain,
( ~ spl0_10
| spl0_11 ),
inference(split_clause,[status(thm)],[f2540,f2534,f2537]) ).
fof(f2551,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(zero_zero_int)))),m),one_one_int),
inference(backward_demodulation,[status(thm)],[f1470,f2406]) ).
fof(f2552,plain,
! [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(zero_zero_int)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(zero_zero_int)))),m),one_one_int),
inference(forward_demodulation,[status(thm)],[f1470,f2551]) ).
fof(f2553,plain,
! [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(zero_zero_int)))),power_power_int(X1,number_number_of_nat(bit0(bit1(zero_zero_int))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(zero_zero_int)))),m),one_one_int),
inference(forward_demodulation,[status(thm)],[f1470,f2552]) ).
fof(f2556,plain,
( ~ is_int(zero_zero_int)
| spl0_10 ),
inference(forward_demodulation,[status(thm)],[f1470,f2536]) ).
fof(f2557,plain,
( $false
| spl0_10 ),
inference(forward_subsumption_resolution,[status(thm)],[f2556,f726]) ).
fof(f2558,plain,
spl0_10,
inference(contradiction_clause,[status(thm)],[f2557]) ).
fof(f2607,plain,
( spl0_16
<=> is_int(t) ),
introduced(split_symbol_definition) ).
fof(f2609,plain,
( ~ is_int(t)
| spl0_16 ),
inference(component_clause,[status(thm)],[f2607]) ).
fof(f2877,plain,
( spl0_21
<=> is_int(one_one_int) ),
introduced(split_symbol_definition) ).
fof(f3354,plain,
number_number_of_int(bit1(zero_zero_int)) = one_one_int,
inference(forward_demodulation,[status(thm)],[f1470,f1247]) ).
fof(f3652,plain,
( spl0_23
<=> is_int(bit1(zero_zero_int)) ),
introduced(split_symbol_definition) ).
fof(f3653,plain,
( is_int(bit1(zero_zero_int))
| ~ spl0_23 ),
inference(component_clause,[status(thm)],[f3652]) ).
fof(f3654,plain,
( ~ is_int(bit1(zero_zero_int))
| spl0_23 ),
inference(component_clause,[status(thm)],[f3652]) ).
fof(f3660,plain,
! [X0] : times_times_int(X0,X0) = power_power_int(X0,number_number_of_nat(bit0(bit1(zero_zero_int)))),
inference(forward_demodulation,[status(thm)],[f1470,f775]) ).
fof(f3834,plain,
( ~ is_int(zero_zero_int)
| spl0_23 ),
inference(resolution,[status(thm)],[f3654,f731]) ).
fof(f3835,plain,
( $false
| spl0_23 ),
inference(forward_subsumption_resolution,[status(thm)],[f3834,f726]) ).
fof(f3836,plain,
spl0_23,
inference(contradiction_clause,[status(thm)],[f3835]) ).
fof(f3837,plain,
( number_number_of_int(bit1(zero_zero_int)) = bit1(zero_zero_int)
| ~ spl0_23 ),
inference(resolution,[status(thm)],[f3653,f1019]) ).
fof(f3838,plain,
( one_one_int = bit1(zero_zero_int)
| ~ spl0_23 ),
inference(forward_demodulation,[status(thm)],[f3354,f3837]) ).
fof(f3843,plain,
! [X0] :
( times_times_int(X0,X0) = power_power_int(X0,number_number_of_nat(bit0(one_one_int)))
| ~ spl0_23 ),
inference(backward_demodulation,[status(thm)],[f3838,f3660]) ).
fof(f4012,plain,
! [X0,X1] :
( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(zero_zero_int)))),power_power_int(X1,number_number_of_nat(bit0(bit1(zero_zero_int))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(one_one_int))),m),one_one_int)
| ~ spl0_23 ),
inference(backward_demodulation,[status(thm)],[f3838,f2553]) ).
fof(f4013,plain,
! [X0,X1] :
( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(one_one_int))),power_power_int(X1,number_number_of_nat(bit0(bit1(zero_zero_int))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(one_one_int))),m),one_one_int)
| ~ spl0_23 ),
inference(forward_demodulation,[status(thm)],[f3838,f4012]) ).
fof(f4014,plain,
! [X0,X1] :
( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(one_one_int))),power_power_int(X1,number_number_of_nat(bit0(one_one_int)))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(one_one_int))),m),one_one_int)
| ~ spl0_23 ),
inference(forward_demodulation,[status(thm)],[f3838,f4013]) ).
fof(f4015,plain,
! [X0,X1] :
( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(one_one_int))),power_power_int(X1,number_number_of_nat(bit0(one_one_int)))) != plus_plus_int(one_one_int,times_times_int(number_number_of_int(bit0(bit0(one_one_int))),m))
| ~ spl0_23 ),
inference(forward_demodulation,[status(thm)],[f986,f4014]) ).
fof(f4016,plain,
! [X0,X1] :
( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(one_one_int))),power_power_int(X1,number_number_of_nat(bit0(one_one_int)))) != plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(one_one_int)))))
| ~ spl0_23 ),
inference(forward_demodulation,[status(thm)],[f968,f4015]) ).
fof(f4017,plain,
( ~ is_int(zero_zero_int)
| is_int(one_one_int)
| ~ spl0_23 ),
inference(paramodulation,[status(thm)],[f3838,f731]) ).
fof(f4018,plain,
( ~ spl0_11
| spl0_21
| ~ spl0_23 ),
inference(split_clause,[status(thm)],[f4017,f2537,f2877,f3652]) ).
fof(f4032,plain,
! [X0,X1] :
( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(one_one_int))),times_times_int(X1,X1)) != plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(one_one_int)))))
| ~ spl0_23 ),
inference(paramodulation,[status(thm)],[f3843,f4016]) ).
fof(f4070,plain,
( $false
| spl0_16 ),
inference(forward_subsumption_resolution,[status(thm)],[f2609,f745]) ).
fof(f4071,plain,
spl0_16,
inference(contradiction_clause,[status(thm)],[f4070]) ).
fof(f5359,plain,
! [X0,X1] :
( plus_plus_int(times_times_int(X0,X0),times_times_int(X1,X1)) != plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(one_one_int)))))
| ~ spl0_23 ),
inference(paramodulation,[status(thm)],[f3843,f4032]) ).
fof(f9002,plain,
( spl0_231
<=> ord_less_eq_int(one_one_int,t) ),
introduced(split_symbol_definition) ).
fof(f9004,plain,
( ~ ord_less_eq_int(one_one_int,t)
| spl0_231 ),
inference(component_clause,[status(thm)],[f9002]) ).
fof(f9005,plain,
( ~ is_int(one_one_int)
| ~ is_int(t)
| ~ ord_less_eq_int(one_one_int,t)
| one_one_int = t
| spl0_4 ),
inference(resolution,[status(thm)],[f798,f2424]) ).
fof(f9006,plain,
( ~ spl0_21
| ~ spl0_16
| ~ spl0_231
| spl0_0
| spl0_4 ),
inference(split_clause,[status(thm)],[f9005,f2877,f2607,f9002,f2407,f2422]) ).
fof(f9039,plain,
( $false
| spl0_231 ),
inference(forward_subsumption_resolution,[status(thm)],[f9004,f746]) ).
fof(f9040,plain,
spl0_231,
inference(contradiction_clause,[status(thm)],[f9039]) ).
fof(f9041,plain,
( plus_plus_int(power_power_int(sk0_0,number_number_of_nat(bit0(bit1(zero_zero_int)))),power_power_int(sk0_1,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)
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f1470,f2419]) ).
fof(f9042,plain,
( plus_plus_int(power_power_int(sk0_0,number_number_of_nat(bit0(one_one_int))),power_power_int(sk0_1,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)
| ~ spl0_23
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f3838,f9041]) ).
fof(f9043,plain,
( plus_plus_int(times_times_int(sk0_0,sk0_0),power_power_int(sk0_1,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)
| ~ spl0_23
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f3843,f9042]) ).
fof(f9044,plain,
( plus_plus_int(times_times_int(sk0_0,sk0_0),power_power_int(sk0_1,number_number_of_nat(bit0(bit1(zero_zero_int))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int)
| ~ spl0_23
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f1470,f9043]) ).
fof(f9045,plain,
( plus_plus_int(times_times_int(sk0_0,sk0_0),power_power_int(sk0_1,number_number_of_nat(bit0(one_one_int)))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int)
| ~ spl0_23
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f3838,f9044]) ).
fof(f9046,plain,
( plus_plus_int(times_times_int(sk0_0,sk0_0),times_times_int(sk0_1,sk0_1)) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int)
| ~ spl0_23
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f3843,f9045]) ).
fof(f9047,plain,
( plus_plus_int(times_times_int(sk0_0,sk0_0),times_times_int(sk0_1,sk0_1)) = plus_plus_int(one_one_int,times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m))
| ~ spl0_23
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f986,f9046]) ).
fof(f9048,plain,
( plus_plus_int(times_times_int(sk0_0,sk0_0),times_times_int(sk0_1,sk0_1)) = plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(pls))))))
| ~ spl0_23
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f968,f9047]) ).
fof(f9049,plain,
( plus_plus_int(times_times_int(sk0_0,sk0_0),times_times_int(sk0_1,sk0_1)) = plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(zero_zero_int))))))
| ~ spl0_23
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f1470,f9048]) ).
fof(f9050,plain,
( plus_plus_int(times_times_int(sk0_0,sk0_0),times_times_int(sk0_1,sk0_1)) = plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(one_one_int)))))
| ~ spl0_23
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f3838,f9049]) ).
fof(f9051,plain,
( $false
| ~ spl0_23
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f9050,f5359]) ).
fof(f9052,plain,
( ~ spl0_23
| ~ spl0_3 ),
inference(contradiction_clause,[status(thm)],[f9051]) ).
fof(f9053,plain,
( plus_plus_int(power_power_int(sk0_2,number_number_of_nat(bit0(bit1(zero_zero_int)))),power_power_int(sk0_3,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)
| ~ spl0_7 ),
inference(forward_demodulation,[status(thm)],[f1470,f2434]) ).
fof(f9054,plain,
( plus_plus_int(power_power_int(sk0_2,number_number_of_nat(bit0(one_one_int))),power_power_int(sk0_3,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)
| ~ spl0_23
| ~ spl0_7 ),
inference(forward_demodulation,[status(thm)],[f3838,f9053]) ).
fof(f9055,plain,
( plus_plus_int(times_times_int(sk0_2,sk0_2),power_power_int(sk0_3,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)
| ~ spl0_23
| ~ spl0_7 ),
inference(forward_demodulation,[status(thm)],[f3843,f9054]) ).
fof(f9056,plain,
( plus_plus_int(times_times_int(sk0_2,sk0_2),power_power_int(sk0_3,number_number_of_nat(bit0(bit1(zero_zero_int))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int)
| ~ spl0_23
| ~ spl0_7 ),
inference(forward_demodulation,[status(thm)],[f1470,f9055]) ).
fof(f9057,plain,
( plus_plus_int(times_times_int(sk0_2,sk0_2),power_power_int(sk0_3,number_number_of_nat(bit0(one_one_int)))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int)
| ~ spl0_23
| ~ spl0_7 ),
inference(forward_demodulation,[status(thm)],[f3838,f9056]) ).
fof(f9058,plain,
( plus_plus_int(times_times_int(sk0_2,sk0_2),times_times_int(sk0_3,sk0_3)) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int)
| ~ spl0_23
| ~ spl0_7 ),
inference(forward_demodulation,[status(thm)],[f3843,f9057]) ).
fof(f9059,plain,
( plus_plus_int(times_times_int(sk0_2,sk0_2),times_times_int(sk0_3,sk0_3)) = plus_plus_int(one_one_int,times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m))
| ~ spl0_23
| ~ spl0_7 ),
inference(forward_demodulation,[status(thm)],[f986,f9058]) ).
fof(f9060,plain,
( plus_plus_int(times_times_int(sk0_2,sk0_2),times_times_int(sk0_3,sk0_3)) = plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(pls))))))
| ~ spl0_23
| ~ spl0_7 ),
inference(forward_demodulation,[status(thm)],[f968,f9059]) ).
fof(f9061,plain,
( plus_plus_int(times_times_int(sk0_2,sk0_2),times_times_int(sk0_3,sk0_3)) = plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(zero_zero_int))))))
| ~ spl0_23
| ~ spl0_7 ),
inference(forward_demodulation,[status(thm)],[f1470,f9060]) ).
fof(f9062,plain,
( plus_plus_int(times_times_int(sk0_2,sk0_2),times_times_int(sk0_3,sk0_3)) = plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(one_one_int)))))
| ~ spl0_23
| ~ spl0_7 ),
inference(forward_demodulation,[status(thm)],[f3838,f9061]) ).
fof(f9063,plain,
( $false
| ~ spl0_23
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f9062,f5359]) ).
fof(f9064,plain,
( ~ spl0_23
| ~ spl0_7 ),
inference(contradiction_clause,[status(thm)],[f9063]) ).
fof(f9065,plain,
$false,
inference(sat_refutation,[status(thm)],[f2421,f2436,f2541,f2558,f3836,f4018,f4071,f9006,f9040,f9052,f9064]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM926+2 : TPTP v8.1.2. Released v5.3.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue May 30 09:50:12 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.41 % Drodi V3.5.1
% 0.20/0.59 % Refutation found
% 0.20/0.59 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.59 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 1.25/0.63 % Elapsed time: 0.272710 seconds
% 1.25/0.63 % CPU time: 1.278784 seconds
% 1.25/0.63 % Memory used: 109.178 MB
%------------------------------------------------------------------------------