↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : NUM924+5 : TPTP v9.3.1. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n018.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:41:58 PM UTC 2026

% Result   : Theorem 0.14s 5.43s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   23 (  23 unt;   0 def)
%            Number of atoms       :   23 (  12 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  14 usr;   6 con; 0-3 aty)
%            Number of variables   :    9 (   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f42,axiom,
    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))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f43,axiom,
    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),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f62,axiom,
    ! [K_1] : number_number_of(int,K_1) = K_1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f63,axiom,
    ! [Z,W] : times_times(int,Z,W) = times_times(int,W,Z),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f102,axiom,
    ! [W] : times_times(int,pls,W) = pls,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f137,axiom,
    zero_zero(int) = number_number_of(int,pls),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f155,conjecture,
    ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f156,negated_conjecture,
    ~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
    inference(negated_conjecture,[status(cth)],[f155]) ).

fof(f273,plain,
    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))),
    inference(cnf_transformation,[status(thm)],[f42]) ).

fof(f274,plain,
    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),
    inference(cnf_transformation,[status(thm)],[f43]) ).

fof(f320,plain,
    ! [X0] : number_number_of(int,X0) = X0,
    inference(cnf_transformation,[status(thm)],[f62]) ).

fof(f321,plain,
    ! [X0,X1] : times_times(int,X0,X1) = times_times(int,X1,X0),
    inference(cnf_transformation,[status(thm)],[f63]) ).

fof(f445,plain,
    ! [X0] : times_times(int,pls,X0) = pls,
    inference(cnf_transformation,[status(thm)],[f102]) ).

fof(f545,plain,
    zero_zero(int) = number_number_of(int,pls),
    inference(cnf_transformation,[status(thm)],[f137]) ).

fof(f563,plain,
    ~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
    inference(cnf_transformation,[status(thm)],[f156]) ).

fof(f571,plain,
    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))),
    inference(backward_demodulation,[status(thm)],[f274,f273]) ).

fof(f592,plain,
    zero_zero(int) = pls,
    inference(forward_demodulation,[status(thm)],[f320,f545]) ).

fof(f593,plain,
    ~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),pls),
    inference(forward_demodulation,[status(thm)],[f592,f563]) ).

fof(f595,plain,
    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))),
    inference(forward_demodulation,[status(thm)],[f320,f571]) ).

fof(f596,plain,
    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)),
    inference(forward_demodulation,[status(thm)],[f592,f595]) ).

fof(f756,plain,
    ! [X0] : pls = times_times(int,X0,pls),
    inference(paramodulation,[status(thm)],[f445,f321]) ).

fof(f776,plain,
    ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),pls),
    inference(backward_demodulation,[status(thm)],[f756,f596]) ).

fof(f777,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f776,f593]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM924+5 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/5.36  % Computer : n018.cluster.edu
% 0.10/5.36  % Model    : x86_64 x86_64
% 0.10/5.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.36  % Memory   : 8046.5625MB
% 0.10/5.36  % OS       : Linux 6.8.0-71-generic
% 0.10/5.36  % CPULimit : 300
% 0.10/5.36  % WCLimit  : 300
% 0.10/5.36  % DateTime : Mon Sep 21 03:19:19 UTC 2026
% 0.10/5.37  % CPUTime  : 
% 0.10/5.39  % Drodi V4.1.1
% 0.14/5.43  % Refutation found
% 0.14/5.43  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/5.43  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/5.45  % Elapsed time: 0.081348 seconds
% 0.14/5.45  % CPU time: 0.354753 seconds
% 0.14/5.45  % Total memory used: 116.818 MB
% 0.14/5.45  % Net memory used: 116.326 MB
%------------------------------------------------------------------------------