%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : NUM924+5 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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:05 PM UTC 2026
% Result : Theorem 0.11s 0.43s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM924+5 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.38 % Computer : n003.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 03:18:46 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.40 % Drodi V4.1.1
% 0.11/0.43 % Refutation found
% 0.11/0.43 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.43 % SZS output start CNFRefutation for theBenchmark
% 0.11/0.43 fof(f42,axiom,(
% 0.11/0.43 ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))) ),
% 0.11/0.43 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/0.43 fof(f43,axiom,(
% 0.11/0.43 plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t) ),
% 0.11/0.43 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/0.43 fof(f62,axiom,(
% 0.11/0.43 (! [K_1] : number_number_of(int,K_1) = K_1 )),
% 0.11/0.43 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/0.43 fof(f63,axiom,(
% 0.11/0.43 (! [Z,W] : times_times(int,Z,W) = times_times(int,W,Z) )),
% 0.11/0.43 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/0.43 fof(f102,axiom,(
% 0.11/0.43 (! [W] : times_times(int,pls,W) = pls )),
% 0.11/0.43 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/0.43 fof(f137,axiom,(
% 0.11/0.43 zero_zero(int) = number_number_of(int,pls) ),
% 0.11/0.43 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/0.43 fof(f155,conjecture,(
% 0.11/0.43 ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)) ),
% 0.11/0.43 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.11/0.43 fof(f156,negated_conjecture,(
% 0.11/0.43 ~(ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)) )),
% 0.11/0.43 inference(negated_conjecture,[status(cth)],[f155])).
% 0.11/0.43 fof(f273,plain,(
% 0.11/0.43 ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int)))),
% 0.11/0.43 inference(cnf_transformation,[status(thm)],[f42])).
% 0.11/0.43 fof(f274,plain,(
% 0.11/0.43 plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int))=times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t)),
% 0.11/0.43 inference(cnf_transformation,[status(thm)],[f43])).
% 0.11/0.43 fof(f320,plain,(
% 0.11/0.43 ![X0]: (number_number_of(int,X0)=X0)),
% 0.11/0.43 inference(cnf_transformation,[status(thm)],[f62])).
% 0.11/0.43 fof(f321,plain,(
% 0.11/0.43 ![X0,X1]: (times_times(int,X0,X1)=times_times(int,X1,X0))),
% 0.11/0.43 inference(cnf_transformation,[status(thm)],[f63])).
% 0.11/0.43 fof(f445,plain,(
% 0.11/0.43 ![X0]: (times_times(int,pls,X0)=pls)),
% 0.11/0.43 inference(cnf_transformation,[status(thm)],[f102])).
% 0.11/0.43 fof(f545,plain,(
% 0.11/0.43 zero_zero(int)=number_number_of(int,pls)),
% 0.11/0.43 inference(cnf_transformation,[status(thm)],[f137])).
% 0.11/0.43 fof(f563,plain,(
% 0.11/0.43 ~ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int))),
% 0.11/0.43 inference(cnf_transformation,[status(thm)],[f156])).
% 0.11/0.43 fof(f575,plain,(
% 0.11/0.43 plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int))=times_times(int,plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),one_one(int)),t)),
% 0.11/0.43 inference(forward_demodulation,[status(thm)],[f320,f274])).
% 0.11/0.43 fof(f621,plain,(
% 0.11/0.43 ~ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),pls)),
% 0.11/0.43 inference(backward_demodulation,[status(thm)],[f622,f563])).
% 0.11/0.43 fof(f622,plain,(
% 0.11/0.43 zero_zero(int)=pls),
% 0.11/0.43 inference(forward_demodulation,[status(thm)],[f320,f545])).
% 0.11/0.43 fof(f739,plain,(
% 0.11/0.43 ord_less(int,times_times(int,plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int)))),
% 0.11/0.43 inference(forward_demodulation,[status(thm)],[f320,f273])).
% 0.11/0.43 fof(f740,plain,(
% 0.11/0.43 ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int)))),
% 0.11/0.43 inference(forward_demodulation,[status(thm)],[f575,f739])).
% 0.11/0.43 fof(f741,plain,(
% 0.11/0.43 ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),times_times(int,plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),one_one(int)),zero_zero(int)))),
% 0.11/0.44 inference(forward_demodulation,[status(thm)],[f320,f740])).
% 0.11/0.44 fof(f742,plain,(
% 0.11/0.44 ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),times_times(int,plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),one_one(int)),pls))),
% 0.11/0.44 inference(forward_demodulation,[status(thm)],[f622,f741])).
% 0.11/0.44 fof(f844,plain,(
% 0.11/0.44 ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),times_times(int,pls,plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),one_one(int))))),
% 0.11/0.44 inference(paramodulation,[status(thm)],[f321,f742])).
% 0.11/0.44 fof(f856,plain,(
% 0.11/0.44 ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),pls)),
% 0.11/0.44 inference(forward_demodulation,[status(thm)],[f445,f844])).
% 0.11/0.44 fof(f857,plain,(
% 0.11/0.44 $false),
% 0.11/0.44 inference(forward_subsumption_resolution,[status(thm)],[f856,f621])).
% 0.11/0.44 % SZS output end CNFRefutation for theBenchmark.p
% 0.11/0.47 % Elapsed time: 0.072605 seconds
% 0.11/0.47 % CPU time: 0.241117 seconds
% 0.11/0.47 % Total memory used: 88.366 MB
% 0.11/0.47 % Net memory used: 88.180 MB
%------------------------------------------------------------------------------