↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n005.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:20 PM UTC 2026

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

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

fof(f103_nnf,plain,
    pls = zero_zero_int,
    inference(nnf_transformation,[status(thm)],[f103]) ).

cnf(c154,plain,
    pls = zero_zero_int,
    inference(cnf_transformation,[status(esa)],[f103_nnf]) ).

fof(f53,axiom,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_48_rel__simps_I2_J) ).

fof(f53_nnf,plain,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls)),
    inference(nnf_transformation,[status(thm)],[f53]) ).

fof(f53_sk,plain,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls)),
    inference(skolemisation,[status(esa)],[f53_nnf]) ).

cnf(c68,plain,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls)),
    inference(cnf_transformation,[status(esa)],[f53_sk]) ).

cnf(p1034,plain,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),zero_zero_int)),
    inference(superposition,[status(thm)],[c154,c68]) ).

fof(f15,axiom,
    ! [A_24] :
      ( hAPP_nat_int(power_power_int(A_24),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int
    <=> A_24 = zero_zero_int ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_10_zero__eq__power2) ).

fof(f15_nnf,plain,
    ! [A_24] :
      ( ( A_24 != zero_zero_int
        | hAPP_nat_int(power_power_int(A_24),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int )
      & ( A_24 = zero_zero_int
        | hAPP_nat_int(power_power_int(A_24),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int ) ),
    inference(nnf_transformation,[status(thm)],[f15]) ).

fof(f15_sk,plain,
    ! [A_24] :
      ( ( A_24 != zero_zero_int
        | hAPP_nat_int(power_power_int(A_24),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int )
      & ( A_24 = zero_zero_int
        | hAPP_nat_int(power_power_int(A_24),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int ) ),
    inference(skolemisation,[status(esa)],[f15_nnf]) ).

cnf(c19,plain,
    ( X0 = zero_zero_int
    | hAPP_nat_int(power_power_int(X0),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int ),
    inference(cnf_transformation,[status(esa)],[f15_sk]) ).

fof(f707,conjecture,
    hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

fof(f707_neg,negated_conjecture,
    ~ ( hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int ),
    inference(negated_conjecture,[status(cth)],[f707]) ).

fof(f707_nnf,plain,
    hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int,
    inference(nnf_transformation,[status(thm)],[f707_neg]) ).

cnf(c1011,plain,
    hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int,
    inference(cnf_transformation,[status(esa)],[f707_nnf]) ).

cnf(p1023,plain,
    hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n)) = zero_zero_int,
    inference(resolution,[status(thm)],[c19,c1011]) ).

fof(f5,axiom,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_n1pos) ).

fof(f5_nnf,plain,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n)))),
    inference(nnf_transformation,[status(thm)],[f5]) ).

cnf(c5,plain,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n)))),
    inference(cnf_transformation,[status(esa)],[f5_nnf]) ).

cnf(p1024,plain,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),zero_zero_int)),
    inference(demodulation,[status(thm)],[p1023,c5]) ).

cnf(p1064,plain,
    $false,
    inference(resolution,[status(thm)],[p1034,p1024]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM925+2 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.36  % Computer : n005.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Thu Sep 24 05:42:17 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 48.21/6.55  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 48.21/6.55  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------