↑ Up

Beagle---0.9.52.THM-CRf.s

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

% Computer : n014.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 07:56:16 PM UTC 2025

% Result   : Theorem 2.62s 1.66s
% Output   : CNFRefutation 2.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   18 (   2 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   15 (   8   ~;   3   |;   2   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :    3 (   3   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ aElementOf0 > isFinite0 > isCountable0 > aSet0 > aElement0 > #nlpp > slcrc0 > #skF_1 > #skF_2

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(aSet0,type,
    aSet0: $i > $o ).

tff('#skF_1',type,
    '#skF_1': $i > $i ).

tff(aElement0,type,
    aElement0: $i > $o ).

tff('#skF_2',type,
    '#skF_2': $i ).

tff(isCountable0,type,
    isCountable0: $i > $o ).

tff(aElementOf0,type,
    aElementOf0: ( $i * $i ) > $o ).

tff(slcrc0,type,
    slcrc0: $i ).

tff(isFinite0,type,
    isFinite0: $i > $o ).

tff(f_73,negated_conjecture,
    ~ ! [W0] :
        ( ( aSet0(W0)
          & isCountable0(W0) )
       => ( W0 != slcrc0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

tff(f_53,axiom,
    isFinite0(slcrc0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEmpFin) ).

tff(f_65,axiom,
    ! [W0] :
      ( ( aSet0(W0)
        & isCountable0(W0) )
     => ~ isFinite0(W0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCountNFin) ).

tff(c_26,plain,
    aSet0('#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_73]) ).

tff(c_24,plain,
    isCountable0('#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_73]) ).

tff(c_22,plain,
    slcrc0 = '#skF_2',
    inference(cnfTransformation,[status(thm)],[f_73]) ).

tff(c_16,plain,
    isFinite0(slcrc0),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_27,plain,
    isFinite0('#skF_2'),
    inference(demodulation,[status(thm),theory(equality)],[c_22,c_16]) ).

tff(c_36,plain,
    ! [W0_14] :
      ( ~ isFinite0(W0_14)
      | ~ isCountable0(W0_14)
      | ~ aSet0(W0_14) ),
    inference(cnfTransformation,[status(thm)],[f_65]) ).

tff(c_39,plain,
    ( ~ isCountable0('#skF_2')
    | ~ aSet0('#skF_2') ),
    inference(resolution,[status(thm)],[c_27,c_36]) ).

tff(c_43,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_26,c_24,c_39]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM531+1 : TPTP v9.0.0. Released v4.0.0.
% 0.03/0.13  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue Apr  8 13:19:34 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 2.62/1.66  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.62/1.67  
% 2.62/1.67  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------