↑ Up

Drodi-SAT---4.1.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi-SAT---4.1.1
% Problem  : NUM924+1 : 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 : n001.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:04 PM UTC 2026

% Result   : Theorem 0.13s 0.39s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM924+1 : 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.08/0.35  % Computer : n001.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 03:22:13 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.37  % Drodi V4.1.1
% 0.13/0.39  % Refutation found
% 0.13/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.39  % SZS output start CNFRefutation for theBenchmark
% 0.13/0.39  fof(f3,axiom,(
% 0.13/0.39    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.13/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.39  fof(f4,axiom,(
% 0.13/0.39    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.13/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.39  fof(f25,axiom,(
% 0.13/0.39    (! [K_1] : number_number_of_int(K_1) = K_1 )),
% 0.13/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.39  fof(f26,axiom,(
% 0.13/0.39    (! [Z,W] : times_times_int(Z,W) = times_times_int(W,Z) )),
% 0.13/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.39  fof(f66,axiom,(
% 0.13/0.39    plus_plus_nat(one_one_nat,one_one_nat) = number_number_of_nat(bit0(bit1(pls))) ),
% 0.13/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.39  fof(f67,axiom,(
% 0.13/0.39    (! [W] : times_times_int(pls,W) = pls )),
% 0.13/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.39  fof(f68,axiom,(
% 0.13/0.39    (! [K_1,L_1] : times_times_int(bit0(K_1),L_1) = bit0(times_times_int(K_1,L_1)) )),
% 0.13/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.39  fof(f106,axiom,(
% 0.13/0.39    zero_zero_int = number_number_of_int(pls) ),
% 0.13/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.39  fof(f107,conjecture,(
% 0.13/0.39    ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int) ),
% 0.13/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.13/0.39  fof(f108,negated_conjecture,(
% 0.13/0.39    ~(ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int) )),
% 0.13/0.39    inference(negated_conjecture,[status(cth)],[f107])).
% 0.13/0.39  fof(f111,plain,(
% 0.13/0.39    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.13/0.39    inference(cnf_transformation,[status(thm)],[f3])).
% 0.13/0.39  fof(f112,plain,(
% 0.13/0.39    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.13/0.39    inference(cnf_transformation,[status(thm)],[f4])).
% 0.13/0.39  fof(f150,plain,(
% 0.13/0.39    ![X0]: (number_number_of_int(X0)=X0)),
% 0.13/0.39    inference(cnf_transformation,[status(thm)],[f25])).
% 0.13/0.39  fof(f151,plain,(
% 0.13/0.39    ![X0,X1]: (times_times_int(X0,X1)=times_times_int(X1,X0))),
% 0.13/0.39    inference(cnf_transformation,[status(thm)],[f26])).
% 0.13/0.39  fof(f270,plain,(
% 0.13/0.39    plus_plus_nat(one_one_nat,one_one_nat)=number_number_of_nat(bit0(bit1(pls)))),
% 0.13/0.39    inference(cnf_transformation,[status(thm)],[f66])).
% 0.13/0.39  fof(f271,plain,(
% 0.13/0.39    ![X0]: (times_times_int(pls,X0)=pls)),
% 0.13/0.39    inference(cnf_transformation,[status(thm)],[f67])).
% 0.13/0.39  fof(f272,plain,(
% 0.13/0.39    ![X0,X1]: (times_times_int(bit0(X0),X1)=bit0(times_times_int(X0,X1)))),
% 0.13/0.39    inference(cnf_transformation,[status(thm)],[f68])).
% 0.13/0.39  fof(f375,plain,(
% 0.13/0.39    zero_zero_int=number_number_of_int(pls)),
% 0.13/0.39    inference(cnf_transformation,[status(thm)],[f106])).
% 0.13/0.39  fof(f376,plain,(
% 0.13/0.39    ~ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int)),
% 0.13/0.39    inference(cnf_transformation,[status(thm)],[f108])).
% 0.13/0.39  fof(f377,plain,(
% 0.13/0.39    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.13/0.39    inference(backward_demodulation,[status(thm)],[f112,f111])).
% 0.13/0.39  fof(f465,plain,(
% 0.13/0.39    ![X0]: (times_times_int(pls,X0)=zero_zero_int)),
% 0.13/0.39    inference(backward_demodulation,[status(thm)],[f487,f271])).
% 0.13/0.39  fof(f487,plain,(
% 0.13/0.39    zero_zero_int=pls),
% 0.13/0.39    inference(forward_demodulation,[status(thm)],[f150,f375])).
% 0.13/0.39  fof(f488,plain,(
% 0.13/0.39    ~ord_less_int(plus_plus_int(power_power_int(s,plus_plus_nat(one_one_nat,one_one_nat)),one_one_int),zero_zero_int)),
% 0.13/0.39    inference(forward_demodulation,[status(thm)],[f270,f376])).
% 0.13/0.39  fof(f489,plain,(
% 0.13/0.39    ord_less_int(plus_plus_int(power_power_int(s,plus_plus_nat(one_one_nat,one_one_nat)),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.13/0.39    inference(forward_demodulation,[status(thm)],[f270,f377])).
% 0.13/0.39  fof(f490,plain,(
% 0.13/0.39    ord_less_int(plus_plus_int(power_power_int(s,plus_plus_nat(one_one_nat,one_one_nat)),one_one_int),times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),zero_zero_int))),
% 0.13/0.39    inference(forward_demodulation,[status(thm)],[f150,f489])).
% 0.13/0.39  fof(f491,plain,(
% 0.13/0.39    ord_less_int(plus_plus_int(power_power_int(s,plus_plus_nat(one_one_nat,one_one_nat)),one_one_int),times_times_int(plus_plus_int(bit0(times_times_int(bit0(bit1(pls)),m)),one_one_int),zero_zero_int))),
% 0.13/0.39    inference(forward_demodulation,[status(thm)],[f272,f490])).
% 0.13/0.39  fof(f492,plain,(
% 0.13/0.39    ord_less_int(plus_plus_int(power_power_int(s,plus_plus_nat(one_one_nat,one_one_nat)),one_one_int),times_times_int(plus_plus_int(bit0(bit0(times_times_int(bit1(pls),m))),one_one_int),zero_zero_int))),
% 0.13/0.39    inference(forward_demodulation,[status(thm)],[f272,f491])).
% 0.13/0.39  fof(f493,plain,(
% 0.13/0.39    ord_less_int(plus_plus_int(power_power_int(s,plus_plus_nat(one_one_nat,one_one_nat)),one_one_int),times_times_int(plus_plus_int(bit0(bit0(times_times_int(bit1(zero_zero_int),m))),one_one_int),zero_zero_int))),
% 0.13/0.39    inference(forward_demodulation,[status(thm)],[f487,f492])).
% 0.13/0.39  fof(f532,plain,(
% 0.13/0.39    ![X0]: (times_times_int(zero_zero_int,X0)=zero_zero_int)),
% 0.13/0.39    inference(forward_demodulation,[status(thm)],[f487,f465])).
% 0.13/0.39  fof(f548,plain,(
% 0.13/0.39    ![X0]: (zero_zero_int=times_times_int(X0,zero_zero_int))),
% 0.13/0.39    inference(paramodulation,[status(thm)],[f532,f151])).
% 0.13/0.39  fof(f564,plain,(
% 0.13/0.39    ord_less_int(plus_plus_int(power_power_int(s,plus_plus_nat(one_one_nat,one_one_nat)),one_one_int),zero_zero_int)),
% 0.13/0.39    inference(backward_demodulation,[status(thm)],[f548,f493])).
% 0.13/0.39  fof(f565,plain,(
% 0.13/0.39    $false),
% 0.13/0.39    inference(forward_subsumption_resolution,[status(thm)],[f564,f488])).
% 0.13/0.39  % SZS output end CNFRefutation for theBenchmark.p
% 0.13/0.42  % Elapsed time: 0.056708 seconds
% 0.13/0.42  % CPU time: 0.165812 seconds
% 0.13/0.42  % Total memory used: 108.340 MB
% 0.13/0.42  % Net memory used: 108.119 MB
%------------------------------------------------------------------------------