↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : NUM924+1 : TPTP v9.3.1. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n017.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 : Fri Sep 25 02:21:19 PM UTC 2026

% Result   : Theorem 43.87s 6.90s
% Output   : Proof 43.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   35 (  35 unt;   0 def)
%            Number of atoms       :   35 (  22 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   1 avg)
%            Maximal term depth    :    8 (   3 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   6 con; 0-2 aty)
%            Number of variables   :   18 (   3 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f105,axiom,
    zero_zero_int = number_number_of_int(pls),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_105_zero__is__num__zero) ).

fof(f105_nnf,plain,
    zero_zero_int = number_number_of_int(pls),
    inference(nnf_transformation,[status(thm)],[f105]) ).

cnf(c157,plain,
    zero_zero_int = number_number_of_int(pls),
    inference(cnf_transformation,[status(esa)],[f105_nnf]) ).

fof(f24,axiom,
    ! [K_1] : number_number_of_int(K_1) = K_1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_24_number__of__is__id) ).

fof(f24_nnf,plain,
    ! [K_1] : number_number_of_int(K_1) = K_1,
    inference(nnf_transformation,[status(thm)],[f24]) ).

fof(f24_sk,plain,
    ! [K_1] : number_number_of_int(K_1) = K_1,
    inference(skolemisation,[status(esa)],[f24_nnf]) ).

cnf(c30,plain,
    number_number_of_int(X0) = X0,
    inference(cnf_transformation,[status(esa)],[f24_sk]) ).

cnf(p162,plain,
    zero_zero_int = pls,
    inference(superposition,[status(thm)],[c157,c30]) ).

fof(f66,axiom,
    ! [W] : times_times_int(pls,W) = pls,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_66_mult__Pls) ).

fof(f66_nnf,plain,
    ! [W] : times_times_int(pls,W) = pls,
    inference(nnf_transformation,[status(thm)],[f66]) ).

fof(f66_sk,plain,
    ! [W] : times_times_int(pls,W) = pls,
    inference(skolemisation,[status(esa)],[f66_nnf]) ).

cnf(c96,plain,
    times_times_int(pls,X0) = pls,
    inference(cnf_transformation,[status(esa)],[f66_sk]) ).

cnf(p172,plain,
    pls = zero_zero_int,
    inference(superposition,[status(thm)],[p162,c96]) ).

cnf(p221,plain,
    times_times_int(zero_zero_int,X0) = zero_zero_int,
    inference(demodulation,[status(thm)],[p172,c96]) ).

fof(f25,axiom,
    ! [Z,W] : times_times_int(Z,W) = times_times_int(W,Z),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_25_zmult__commute) ).

fof(f25_nnf,plain,
    ! [Z,W] : times_times_int(Z,W) = times_times_int(W,Z),
    inference(nnf_transformation,[status(thm)],[f25]) ).

fof(f25_sk,plain,
    ! [Z,W] : times_times_int(Z,W) = times_times_int(W,Z),
    inference(skolemisation,[status(esa)],[f25_nnf]) ).

cnf(c31,plain,
    times_times_int(X0,X1) = times_times_int(X1,X0),
    inference(cnf_transformation,[status(esa)],[f25_sk]) ).

cnf(p241,plain,
    times_times_int(X0,zero_zero_int) = zero_zero_int,
    inference(superposition,[status(thm)],[p221,c31]) ).

fof(f3,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',fact_3_t) ).

fof(f3_nnf,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(nnf_transformation,[status(thm)],[f3]) ).

cnf(c3,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(esa)],[f3_nnf]) ).

fof(f2,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',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A__hc6dfdf03bc803148) ).

fof(f2_nnf,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(nnf_transformation,[status(thm)],[f2]) ).

cnf(c2,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(esa)],[f2_nnf]) ).

cnf(p160,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(superposition,[status(thm)],[c3,c2]) ).

cnf(p237,plain,
    ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(zero_zero_int)))),one_one_int),times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(zero_zero_int))),m),one_one_int),zero_zero_int)),
    inference(demodulation,[status(thm)],[p172,p160]) ).

cnf(p244,plain,
    ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(zero_zero_int)))),one_one_int),zero_zero_int),
    inference(demodulation,[status(thm)],[p241,p237]) ).

fof(f106,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',conj_0) ).

fof(f106_neg,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)],[f106]) ).

fof(f106_nnf,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(nnf_transformation,[status(thm)],[f106_neg]) ).

fof(f106_sk,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(skolemisation,[status(esa)],[f106_nnf]) ).

cnf(c158,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(esa)],[f106_sk]) ).

cnf(p235,plain,
    ~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(zero_zero_int)))),one_one_int),zero_zero_int),
    inference(demodulation,[status(thm)],[p172,c158]) ).

cnf(p3152,plain,
    $false,
    inference(resolution,[status(thm)],[p244,p235]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : NUM924+1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.07  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.19/0.45  % Computer : n017.cluster.edu
% 0.19/0.45  % Model    : x86_64 x86_64
% 0.19/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45  % Memory   : 8046.5625MB
% 0.19/0.45  % OS       : Linux 6.8.0-71-generic
% 0.19/0.45  % CPULimit : 300
% 0.19/0.45  % WCLimit  : 300
% 0.19/0.45  % DateTime : Thu Sep 24 05:36:15 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.46  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 43.87/6.90  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 43.87/6.90  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------