%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : NUM926+6 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n015.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:44:08 PM UTC 2026
% Result : Theorem 0.21s 1.00s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM926+6 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.06 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.58 % Computer : n015.cluster.edu
% 0.17/0.58 % Model : x86_64 x86_64
% 0.17/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.58 % Memory : 8046.5625MB
% 0.17/0.58 % OS : Linux 6.8.0-71-generic
% 0.17/0.58 % CPULimit : 300
% 0.17/0.58 % WCLimit : 300
% 0.17/0.58 % DateTime : Mon Sep 21 03:21:51 UTC 2026
% 0.17/0.58 % CPUTime :
% 0.21/0.65 % Drodi V4.1.1
% 0.21/1.00 % Refutation found
% 0.21/1.00 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/1.00 % SZS output start CNFRefutation for theBenchmark
% 0.21/1.00 fof(f40,hypothesis,(
% 0.21/1.00 (! [B_1_1] : ti(int,bit0(B_1_1)) = bit0(B_1_1) )),
% 0.21/1.00 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/1.00 fof(f42,hypothesis,(
% 0.21/1.00 (! [B_1_1] : ti(int,bit1(B_1_1)) = bit1(B_1_1) )),
% 0.21/1.00 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/1.00 fof(f70,axiom,(
% 0.21/1.00 ti(int,t) = t ),
% 0.21/1.00 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/1.00 fof(f71,axiom,(
% 0.21/1.00 ord_less_eq(int,one_one(int),t) ),
% 0.21/1.00 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/1.00 fof(f72,axiom,(
% 0.21/1.00 ( t = one_one(int)=> (? [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)) )) ),
% 0.21/1.00 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/1.00 fof(f73,axiom,(
% 0.21/1.00 ( ord_less(int,one_one(int),t)=> (? [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)) )) ),
% 0.21/1.00 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/1.00 fof(f93,axiom,(
% 0.21/1.00 (! [Z_1,W_1] :( ord_less(int,Z_1,W_1)<=> ( ord_less_eq(int,Z_1,W_1)& ti(int,Z_1) != ti(int,W_1) ) ) )),
% 0.21/1.00 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/1.00 fof(f157,axiom,(
% 0.21/1.00 (! [K] : number_number_of(int,K) = ti(int,K) )),
% 0.21/1.00 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/1.00 fof(f229,axiom,(
% 0.21/1.00 one_one(int) = number_number_of(int,bit1(pls)) ),
% 0.21/1.00 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/1.00 fof(f653,conjecture,(
% 0.21/1.00 (? [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)) )),
% 0.21/1.00 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/1.00 fof(f654,negated_conjecture,(
% 0.21/1.00 ~((? [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)) ))),
% 0.21/1.00 inference(negated_conjecture,[status(cth)],[f653])).
% 0.21/1.00 fof(f760,plain,(
% 0.21/1.00 ![X0]: (ti(int,bit0(X0))=bit0(X0))),
% 0.21/1.00 inference(cnf_transformation,[status(thm)],[f40])).
% 0.21/1.00 fof(f762,plain,(
% 0.21/1.00 ![X0]: (ti(int,bit1(X0))=bit1(X0))),
% 0.21/1.00 inference(cnf_transformation,[status(thm)],[f42])).
% 0.21/1.00 fof(f833,plain,(
% 0.21/1.00 ti(int,t)=t),
% 0.21/1.00 inference(cnf_transformation,[status(thm)],[f70])).
% 0.21/1.00 fof(f834,plain,(
% 0.21/1.00 ord_less_eq(int,one_one(int),t)),
% 0.21/1.00 inference(cnf_transformation,[status(thm)],[f71])).
% 0.21/1.00 fof(f835,plain,(
% 0.21/1.00 ~t=one_one(int)|(?[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)))),
% 0.21/1.00 inference(pre_NNF_transformation,[status(thm)],[f72])).
% 0.21/1.00 fof(f836,plain,(
% 0.21/1.00 ~t=one_one(int)|plus_plus(int,power_power(int,sK0_skl,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1_skl,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))),
% 0.21/1.00 inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(X,sK0_skl),skolemize(Y,sK1_skl)],[f835])).
% 0.21/1.00 fof(f837,plain,(
% 0.21/1.00 ~t=one_one(int)|plus_plus(int,power_power(int,sK0_skl,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1_skl,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))),
% 0.21/1.00 inference(cnf_transformation,[status(thm)],[f836])).
% 0.21/1.00 fof(f838,plain,(
% 0.21/1.00 ~ord_less(int,one_one(int),t)|(?[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)))),
% 0.21/1.00 inference(pre_NNF_transformation,[status(thm)],[f73])).
% 0.21/1.00 fof(f839,plain,(
% 0.21/1.00 ~ord_less(int,one_one(int),t)|plus_plus(int,power_power(int,sK2_skl,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3_skl,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))),
% 0.21/1.00 inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl,sK3_skl]),skolemize(X,sK2_skl),skolemize(Y,sK3_skl)],[f838])).
% 0.21/1.00 fof(f840,plain,(
% 0.21/1.00 ~ord_less(int,one_one(int),t)|plus_plus(int,power_power(int,sK2_skl,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3_skl,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))),
% 0.21/1.00 inference(cnf_transformation,[status(thm)],[f839])).
% 0.21/1.00 fof(f871,plain,(
% 0.21/1.00 ![Z_1,W_1]: ((~ord_less(int,Z_1,W_1)|(ord_less_eq(int,Z_1,W_1)&~ti(int,Z_1)=ti(int,W_1)))&(ord_less(int,Z_1,W_1)|(~ord_less_eq(int,Z_1,W_1)|ti(int,Z_1)=ti(int,W_1))))),
% 0.21/1.00 inference(NNF_transformation,[status(thm)],[f93])).
% 0.21/1.00 fof(f872,plain,(
% 0.21/1.00 (![Z_1,W_1]: (~ord_less(int,Z_1,W_1)|(ord_less_eq(int,Z_1,W_1)&~ti(int,Z_1)=ti(int,W_1))))&(![Z_1,W_1]: (ord_less(int,Z_1,W_1)|(~ord_less_eq(int,Z_1,W_1)|ti(int,Z_1)=ti(int,W_1))))),
% 0.21/1.00 inference(miniscoping,[status(thm)],[f871])).
% 0.21/1.00 fof(f875,plain,(
% 0.21/1.00 ![X0,X1]: (ord_less(int,X0,X1)|~ord_less_eq(int,X0,X1)|ti(int,X0)=ti(int,X1))),
% 0.21/1.00 inference(cnf_transformation,[status(thm)],[f872])).
% 0.21/1.00 fof(f1052,plain,(
% 0.21/1.00 ![X0]: (number_number_of(int,X0)=ti(int,X0))),
% 0.21/1.00 inference(cnf_transformation,[status(thm)],[f157])).
% 0.21/1.00 fof(f1220,plain,(
% 0.21/1.00 one_one(int)=number_number_of(int,bit1(pls))),
% 0.21/1.00 inference(cnf_transformation,[status(thm)],[f229])).
% 0.21/1.00 fof(f2269,plain,(
% 0.21/1.00 (![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)))),
% 0.21/1.00 inference(pre_NNF_transformation,[status(thm)],[f654])).
% 0.21/1.00 fof(f2270,plain,(
% 0.21/1.00 ![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)))),
% 0.21/1.00 inference(cnf_transformation,[status(thm)],[f2269])).
% 0.21/1.00 fof(f2271,definition,(
% 0.21/1.00 sQ0_spl <=> (t=one_one(int))),
% 0.21/1.00 introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.21/1.00 fof(f2273,plain,(
% 0.21/1.00 ~t=one_one(int)|sQ0_spl),
% 0.21/1.00 inference(component_clause,[status(thm)],[f2271])).
% 0.21/1.00 fof(f2274,definition,(
% 0.21/1.00 sQ1_spl <=> (plus_plus(int,power_power(int,sK0_skl,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1_skl,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)))),
% 0.21/1.00 introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.21/1.00 fof(f2275,plain,(
% 0.21/1.00 plus_plus(int,power_power(int,sK0_skl,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1_skl,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))|~sQ1_spl),
% 0.21/1.00 inference(component_clause,[status(thm)],[f2274])).
% 0.21/1.00 fof(f2277,plain,(
% 0.21/1.00 ~sQ0_spl|sQ1_spl),
% 0.21/1.00 inference(split_clause,[status(thm)],[f837,f2271,f2274])).
% 0.21/1.00 fof(f2278,definition,(
% 0.21/1.00 sQ2_spl <=> (ord_less(int,one_one(int),t))),
% 0.21/1.00 introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.21/1.00 fof(f2280,plain,(
% 0.21/1.00 ~ord_less(int,one_one(int),t)|sQ2_spl),
% 0.21/1.00 inference(component_clause,[status(thm)],[f2278])).
% 0.21/1.00 fof(f2281,definition,(
% 0.21/1.00 sQ3_spl <=> (plus_plus(int,power_power(int,sK2_skl,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3_skl,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)))),
% 0.21/1.00 introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.21/1.00 fof(f2282,plain,(
% 0.21/1.00 plus_plus(int,power_power(int,sK2_skl,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3_skl,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))|~sQ3_spl),
% 0.21/1.00 inference(component_clause,[status(thm)],[f2281])).
% 0.21/1.00 fof(f2284,plain,(
% 0.21/1.00 ~sQ2_spl|sQ3_spl),
% 0.21/1.00 inference(split_clause,[status(thm)],[f840,f2278,f2281])).
% 0.21/1.00 fof(f3279,plain,(
% 0.21/1.00 one_one(int)=ti(int,bit1(pls))),
% 0.21/1.00 inference(backward_demodulation,[status(thm)],[f1052,f1220])).
% 0.21/1.00 fof(f3304,plain,(
% 0.21/1.00 ![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,ti(int,bit0(bit0(bit1(pls)))),m),one_one(int)))),
% 0.21/1.00 inference(backward_demodulation,[status(thm)],[f1052,f2270])).
% 0.21/1.00 fof(f3305,plain,(
% 0.21/1.00 one_one(int)=bit1(pls)),
% 0.21/1.00 inference(forward_demodulation,[status(thm)],[f762,f3279])).
% 0.21/1.00 fof(f3330,plain,(
% 0.21/1.00 ![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,bit0(bit0(bit1(pls))),m),one_one(int)))),
% 0.21/1.00 inference(forward_demodulation,[status(thm)],[f760,f3304])).
% 0.21/1.00 fof(f3347,plain,(
% 0.21/1.00 ti(int,one_one(int))=bit1(pls)),
% 0.21/1.00 inference(paramodulation,[status(thm)],[f3305,f762])).
% 0.21/1.00 fof(f3366,plain,(
% 0.21/1.00 ti(int,one_one(int))=one_one(int)),
% 0.21/1.00 inference(forward_demodulation,[status(thm)],[f3305,f3347])).
% 0.21/1.00 fof(f3434,plain,(
% 0.21/1.00 ![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(pls)))))=plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),one_one(int)))),
% 0.21/1.00 inference(forward_demodulation,[status(thm)],[f3305,f3330])).
% 0.21/1.00 fof(f3435,plain,(
% 0.21/1.00 ![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,bit0(bit0(bit1(pls))),m),one_one(int)))),
% 0.21/1.00 inference(forward_demodulation,[status(thm)],[f3305,f3434])).
% 0.21/1.00 fof(f3436,plain,(
% 0.21/1.00 ![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,bit0(bit0(one_one(int))),m),one_one(int)))),
% 0.21/1.00 inference(forward_demodulation,[status(thm)],[f3305,f3435])).
% 0.21/1.00 fof(f4915,plain,(
% 0.21/1.00 ~ord_less_eq(int,one_one(int),t)|ti(int,one_one(int))=ti(int,t)|sQ2_spl),
% 0.21/1.00 inference(resolution,[status(thm)],[f875,f2280])).
% 0.21/1.00 fof(f4943,definition,(
% 0.21/1.00 sQ76_spl <=> (ord_less_eq(int,one_one(int),t))),
% 0.21/1.00 introduced(definition,[new_symbols(definition,[sQ76_spl])],[split_symbol_definition])).
% 0.21/1.00 fof(f4945,plain,(
% 0.21/1.00 ~ord_less_eq(int,one_one(int),t)|sQ76_spl),
% 0.21/1.00 inference(component_clause,[status(thm)],[f4943])).
% 0.21/1.00 fof(f4946,definition,(
% 0.21/1.00 sQ77_spl <=> (ti(int,one_one(int))=ti(int,t))),
% 0.21/1.00 introduced(definition,[new_symbols(definition,[sQ77_spl])],[split_symbol_definition])).
% 0.21/1.00 fof(f4947,plain,(
% 0.21/1.00 ti(int,one_one(int))=ti(int,t)|~sQ77_spl),
% 0.21/1.00 inference(component_clause,[status(thm)],[f4946])).
% 0.21/1.00 fof(f4949,plain,(
% 0.21/1.00 ~sQ76_spl|sQ77_spl|sQ2_spl),
% 0.21/1.00 inference(split_clause,[status(thm)],[f4915,f4943,f4946,f2278])).
% 0.21/1.00 fof(f4992,plain,(
% 0.21/1.00 plus_plus(int,power_power(int,sK2_skl,number_number_of(nat,bit0(one_one(int)))),power_power(int,sK3_skl,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))|~sQ3_spl),
% 0.21/1.00 inference(forward_demodulation,[status(thm)],[f3305,f2282])).
% 0.21/1.00 fof(f4993,plain,(
% 0.21/1.00 plus_plus(int,power_power(int,sK2_skl,number_number_of(nat,bit0(one_one(int)))),power_power(int,sK3_skl,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))|~sQ3_spl),
% 0.21/1.00 inference(forward_demodulation,[status(thm)],[f3305,f4992])).
% 0.21/1.00 fof(f4994,plain,(
% 0.21/1.00 plus_plus(int,power_power(int,sK2_skl,number_number_of(nat,bit0(one_one(int)))),power_power(int,sK3_skl,number_number_of(nat,bit0(one_one(int)))))=plus_plus(int,times_times(int,ti(int,bit0(bit0(bit1(pls)))),m),one_one(int))|~sQ3_spl),
% 0.21/1.00 inference(forward_demodulation,[status(thm)],[f1052,f4993])).
% 0.21/1.03 fof(f4995,plain,(
% 0.21/1.03 plus_plus(int,power_power(int,sK2_skl,number_number_of(nat,bit0(one_one(int)))),power_power(int,sK3_skl,number_number_of(nat,bit0(one_one(int)))))=plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),one_one(int))|~sQ3_spl),
% 0.21/1.03 inference(forward_demodulation,[status(thm)],[f760,f4994])).
% 0.21/1.03 fof(f4996,plain,(
% 0.21/1.03 plus_plus(int,power_power(int,sK2_skl,number_number_of(nat,bit0(one_one(int)))),power_power(int,sK3_skl,number_number_of(nat,bit0(one_one(int)))))=plus_plus(int,times_times(int,bit0(bit0(one_one(int))),m),one_one(int))|~sQ3_spl),
% 0.21/1.03 inference(forward_demodulation,[status(thm)],[f3305,f4995])).
% 0.21/1.03 fof(f4997,plain,(
% 0.21/1.03 $false|~sQ3_spl),
% 0.21/1.03 inference(forward_subsumption_resolution,[status(thm)],[f4996,f3436])).
% 0.21/1.03 fof(f4998,plain,(
% 0.21/1.03 ~sQ3_spl),
% 0.21/1.03 inference(contradiction_clause,[status(thm)],[f4997])).
% 0.21/1.03 fof(f5001,plain,(
% 0.21/1.03 $false|sQ76_spl),
% 0.21/1.03 inference(forward_subsumption_resolution,[status(thm)],[f4945,f834])).
% 0.21/1.03 fof(f5002,plain,(
% 0.21/1.03 sQ76_spl),
% 0.21/1.03 inference(contradiction_clause,[status(thm)],[f5001])).
% 0.21/1.03 fof(f5008,plain,(
% 0.21/1.03 one_one(int)=ti(int,t)|~sQ77_spl),
% 0.21/1.03 inference(forward_demodulation,[status(thm)],[f3366,f4947])).
% 0.21/1.03 fof(f5009,plain,(
% 0.21/1.03 one_one(int)=t|~sQ77_spl),
% 0.21/1.03 inference(forward_demodulation,[status(thm)],[f833,f5008])).
% 0.21/1.03 fof(f5010,plain,(
% 0.21/1.03 $false|sQ0_spl|~sQ77_spl),
% 0.21/1.03 inference(forward_subsumption_resolution,[status(thm)],[f5009,f2273])).
% 0.21/1.03 fof(f5011,plain,(
% 0.21/1.03 sQ0_spl|~sQ77_spl),
% 0.21/1.03 inference(contradiction_clause,[status(thm)],[f5010])).
% 0.21/1.03 fof(f5012,plain,(
% 0.21/1.03 plus_plus(int,power_power(int,sK0_skl,number_number_of(nat,bit0(one_one(int)))),power_power(int,sK1_skl,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))|~sQ1_spl),
% 0.21/1.03 inference(forward_demodulation,[status(thm)],[f3305,f2275])).
% 0.21/1.03 fof(f5013,plain,(
% 0.21/1.03 plus_plus(int,power_power(int,sK0_skl,number_number_of(nat,bit0(one_one(int)))),power_power(int,sK1_skl,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))|~sQ1_spl),
% 0.21/1.03 inference(forward_demodulation,[status(thm)],[f3305,f5012])).
% 0.21/1.03 fof(f5014,plain,(
% 0.21/1.03 plus_plus(int,power_power(int,sK0_skl,number_number_of(nat,bit0(one_one(int)))),power_power(int,sK1_skl,number_number_of(nat,bit0(one_one(int)))))=plus_plus(int,times_times(int,ti(int,bit0(bit0(bit1(pls)))),m),one_one(int))|~sQ1_spl),
% 0.21/1.03 inference(forward_demodulation,[status(thm)],[f1052,f5013])).
% 0.21/1.03 fof(f5015,plain,(
% 0.21/1.03 plus_plus(int,power_power(int,sK0_skl,number_number_of(nat,bit0(one_one(int)))),power_power(int,sK1_skl,number_number_of(nat,bit0(one_one(int)))))=plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),one_one(int))|~sQ1_spl),
% 0.21/1.03 inference(forward_demodulation,[status(thm)],[f760,f5014])).
% 0.21/1.03 fof(f5016,plain,(
% 0.21/1.03 plus_plus(int,power_power(int,sK0_skl,number_number_of(nat,bit0(one_one(int)))),power_power(int,sK1_skl,number_number_of(nat,bit0(one_one(int)))))=plus_plus(int,times_times(int,bit0(bit0(one_one(int))),m),one_one(int))|~sQ1_spl),
% 0.21/1.03 inference(forward_demodulation,[status(thm)],[f3305,f5015])).
% 0.21/1.03 fof(f5017,plain,(
% 0.21/1.03 $false|~sQ1_spl),
% 0.21/1.03 inference(forward_subsumption_resolution,[status(thm)],[f5016,f3436])).
% 0.21/1.03 fof(f5018,plain,(
% 0.21/1.03 ~sQ1_spl),
% 0.21/1.03 inference(contradiction_clause,[status(thm)],[f5017])).
% 0.21/1.03 fof(f5019,plain,(
% 0.21/1.03 $false),
% 0.21/1.03 inference(sat_refutation,[status(thm)],[f2277,f2284,f4949,f4998,f5002,f5011,f5018])).
% 0.21/1.03 % SZS output end CNFRefutation for theBenchmark.p
% 0.21/1.04 % Elapsed time: 0.443746 seconds
% 0.21/1.04 % CPU time: 2.850089 seconds
% 0.21/1.04 % Total memory used: 178.154 MB
% 0.21/1.04 % Net memory used: 176.022 MB
%------------------------------------------------------------------------------