↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : NUM548+3 : 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/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 : n003.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:21 PM UTC 2025

% Result   : Theorem 6.38s 2.38s
% Output   : CNFRefutation 6.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   12 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   23 (   2 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   17 (   6   ~;   4   |;   4   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :   35 (  35 usr;   9 con; 0-3 aty)
%            Number of variables   :    3 (   3   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aSubsetOf0 > aElementOf0 > isFinite0 > isCountable0 > aSet0 > aElement0 > slbdtsldtrb0 > sdtpldt0 > sdtmndt0 > #nlpp > szszuzczcdt0 > szmzizndt0 > szmzazxdt0 > slbdtrb0 > sbrdtbr0 > xx > xk > xT > xS > xQ > szNzAzT0 > sz00 > slcrc0 > #skF_7 > #skF_11 > #skF_16 > #skF_18 > #skF_17 > #skF_6 > #skF_19 > #skF_1 > #skF_4 > #skF_12 > #skF_5 > #skF_10 > #skF_8 > #skF_15 > #skF_13 > #skF_14 > #skF_3 > #skF_2 > #skF_9

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(xk,type,
    xk: $i ).

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

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

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

tff(sbrdtbr0,type,
    sbrdtbr0: $i > $i ).

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

tff(szszuzczcdt0,type,
    szszuzczcdt0: $i > $i ).

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

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

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

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

tff(sdtmndt0,type,
    sdtmndt0: ( $i * $i ) > $i ).

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

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

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

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

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

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

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

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

tff(sdtpldt0,type,
    sdtpldt0: ( $i * $i ) > $i ).

tff(slbdtsldtrb0,type,
    slbdtsldtrb0: ( $i * $i ) > $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(szmzizndt0,type,
    szmzizndt0: $i > $i ).

tff(szmzazxdt0,type,
    szmzazxdt0: $i > $i ).

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

tff(slbdtrb0,type,
    slbdtrb0: $i > $i ).

tff(f_639,negated_conjecture,
    ~ isFinite0(xQ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

tff(f_637,hypothesis,
    ( aSet0(xQ)
    & ! [W0] :
        ( aElementOf0(W0,xQ)
       => aElementOf0(W0,xS) )
    & aSubsetOf0(xQ,xS)
    & ( sbrdtbr0(xQ) = xk )
    & aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2270) ).

tff(f_520,hypothesis,
    aElementOf0(xk,szNzAzT0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2202) ).

tff(f_324,axiom,
    ! [W0] :
      ( aSet0(W0)
     => ( aElementOf0(sbrdtbr0(W0),szNzAzT0)
      <=> isFinite0(W0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardNum) ).

tff(c_326,plain,
    ~ isFinite0(xQ),
    inference(cnfTransformation,[status(thm)],[f_639]) ).

tff(c_324,plain,
    aSet0(xQ),
    inference(cnfTransformation,[status(thm)],[f_637]) ).

tff(c_252,plain,
    aElementOf0(xk,szNzAzT0),
    inference(cnfTransformation,[status(thm)],[f_520]) ).

tff(c_318,plain,
    sbrdtbr0(xQ) = xk,
    inference(cnfTransformation,[status(thm)],[f_637]) ).

tff(c_764,plain,
    ! [W0_224] :
      ( isFinite0(W0_224)
      | ~ aElementOf0(sbrdtbr0(W0_224),szNzAzT0)
      | ~ aSet0(W0_224) ),
    inference(cnfTransformation,[status(thm)],[f_324]) ).

tff(c_779,plain,
    ( isFinite0(xQ)
    | ~ aElementOf0(xk,szNzAzT0)
    | ~ aSet0(xQ) ),
    inference(superposition,[status(thm),theory(equality)],[c_318,c_764]) ).

tff(c_789,plain,
    isFinite0(xQ),
    inference(demodulation,[status(thm),theory(equality)],[c_324,c_252,c_779]) ).

tff(c_791,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_326,c_789]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : NUM548+3 : TPTP v9.0.0. Released v4.0.0.
% 0.11/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.33  % Computer : n003.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Tue Apr  8 13:29:03 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 6.38/2.38  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.38/2.38  
% 6.38/2.38  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------