↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : ARI620_1 : TPTP v9.0.0. Released v5.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Apr  9 05:40:43 PM UTC 2025

% Result   : Theorem 2.89s 1.72s
% Output   : CNFRefutation 2.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   27 (   2 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   20 (   6   ~;  10   |;   2   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number arithmetic     :   48 (   7 atm;   8 fun;  28 num;   5 var)
%            Number of types       :    2 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   1 usr;   4 con; 0-2 aty)
%            Number of variables   :    5 (   4   !;   1   ?;   5   :)

% Comments : 
%------------------------------------------------------------------------------
%$ pow2 > #nlpp > #skF_1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff('#skF_1',type,
    '#skF_1': $int > $int ).

tff(pow2,type,
    pow2: $int > $o ).

tff(f_41,negated_conjecture,
    ~ ( ! [Xa: $int] :
          ( pow2(Xa)
        <=> ( ( Xa = 1 )
            | ( $lesseq(2,Xa)
              & ? [Ya: $int] :
                  ( ( $product(2,Ya) = Xa )
                  & pow2(Ya) ) ) ) )
     => pow2(8) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pow_of_2_8) ).

tff(c_20,plain,
    ~ pow2(8),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_12,plain,
    pow2(1),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_8,plain,
    ! [Y_4a: $int] :
      ( ~ pow2(Y_4a)
      | pow2($product(2,Y_4a))
      | ~ $lesseq(2,$product(2,Y_4a)) ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_38,plain,
    ! [Y_10a: $int] :
      ( ~ pow2(Y_10a)
      | pow2($product(2,Y_10a))
      | $less(Y_10a,1) ),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_8]) ).

tff(c_41,plain,
    ( pow2($product(2,1))
    | $less(1,1) ),
    inference(resolution,[status(thm)],[c_12,c_38]) ).

tff(c_43,plain,
    pow2(2),
    inference(backgroundSimplification,[status(thm),theory('LIA')],[c_41]) ).

tff(c_16,plain,
    ! [Y_4a: $int] :
      ( ~ pow2(Y_4a)
      | pow2($product(2,Y_4a))
      | $less(Y_4a,1) ),
    inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_8]) ).

tff(c_52,plain,
    ( pow2($product(2,2))
    | $less(2,1) ),
    inference(resolution,[status(thm)],[c_43,c_16]) ).

tff(c_54,plain,
    pow2(4),
    inference(backgroundSimplification,[status(thm),theory('LIA')],[c_52]) ).

tff(c_69,plain,
    ( pow2($product(2,4))
    | $less(4,1) ),
    inference(resolution,[status(thm)],[c_54,c_16]) ).

tff(c_71,plain,
    pow2(8),
    inference(backgroundSimplification,[status(thm),theory('LIA')],[c_69]) ).

tff(c_78,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_20,c_71]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : ARI620_1 : TPTP v9.0.0. Released v5.1.0.
% 0.07/0.12  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.12/0.31  % Computer : n009.cluster.edu
% 0.12/0.31  % Model    : x86_64 x86_64
% 0.12/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31  % Memory   : 8042.1875MB
% 0.12/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31  % CPULimit : 300
% 0.12/0.31  % WCLimit  : 300
% 0.12/0.31  % DateTime : Mon Apr  7 15:14:26 EDT 2025
% 0.12/0.32  % CPUTime  : 
% 2.89/1.72  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.89/1.72  
% 2.89/1.72  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------