↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : NUM560+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 : 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 07:56:24 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aSubsetOf0 > aElementOf0 > isFinite0 > isCountable0 > aSet0 > aFunction0 > aElement0 > slbdtsldtrb0 > sdtpldt0 > sdtmndt0 > sdtlpdtrp0 > sdtlbdtrb0 > #nlpp > szszuzczcdt0 > szmzizndt0 > szmzazxdt0 > szDzozmdt0 > slbdtrb0 > sbrdtbr0 > xy > xF > szNzAzT0 > sz00 > slcrc0 > #skF_7 > #skF_11 > #skF_17 > #skF_6 > #skF_1 > #skF_18 > #skF_4 > #skF_12 > #skF_5 > #skF_10 > #skF_8 > #skF_15 > #skF_13 > #skF_14 > #skF_3 > #skF_2 > #skF_9 > #skF_16

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(xy,type,
    xy: $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(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(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(aFunction0,type,
    aFunction0: $i > $o ).

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

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(xF,type,
    xF: $i ).

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

tff(f_585,hypothesis,
    ( aFunction0(xF)
    & aElement0(xy) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2693) ).

tff(f_582,definition,
    ! [W0,W1] :
      ( ( aFunction0(W0)
        & aElement0(W1) )
     => ! [W2] :
          ( ( W2 = sdtlbdtrb0(W0,W1) )
        <=> ( aSet0(W2)
            & ! [W3] :
                ( aElementOf0(W3,W2)
              <=> ( aElementOf0(W3,szDzozmdt0(W0))
                  & ( sdtlpdtrp0(W0,W3) = W1 ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefPtt) ).

tff(f_559,axiom,
    ! [W0] :
      ( aFunction0(W0)
     => aSet0(szDzozmdt0(W0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDomSet) ).

tff(f_84,definition,
    ! [W0] :
      ( aSet0(W0)
     => ! [W1] :
          ( aSubsetOf0(W1,W0)
        <=> ( aSet0(W1)
            & ! [W2] :
                ( aElementOf0(W2,W1)
               => aElementOf0(W2,W0) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).

tff(f_587,negated_conjecture,
    ~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

tff(c_288,plain,
    aFunction0(xF),
    inference(cnfTransformation,[status(thm)],[f_585]) ).

tff(c_286,plain,
    aElement0(xy),
    inference(cnfTransformation,[status(thm)],[f_585]) ).

tff(c_268,plain,
    ! [W0_188,W1_189] :
      ( aSet0(sdtlbdtrb0(W0_188,W1_189))
      | ~ aElement0(W1_189)
      | ~ aFunction0(W0_188) ),
    inference(cnfTransformation,[status(thm)],[f_582]) ).

tff(c_262,plain,
    ! [W0_184] :
      ( aSet0(szDzozmdt0(W0_184))
      | ~ aFunction0(W0_184) ),
    inference(cnfTransformation,[status(thm)],[f_559]) ).

tff(c_30,plain,
    ! [W0_14,W1_20] :
      ( aElementOf0('#skF_2'(W0_14,W1_20),W1_20)
      | aSubsetOf0(W1_20,W0_14)
      | ~ aSet0(W1_20)
      | ~ aSet0(W0_14) ),
    inference(cnfTransformation,[status(thm)],[f_84]) ).

tff(c_12098,plain,
    ! [W3_710,W0_711,W1_712] :
      ( aElementOf0(W3_710,szDzozmdt0(W0_711))
      | ~ aElementOf0(W3_710,sdtlbdtrb0(W0_711,W1_712))
      | ~ aElement0(W1_712)
      | ~ aFunction0(W0_711) ),
    inference(cnfTransformation,[status(thm)],[f_582]) ).

tff(c_108167,plain,
    ! [W0_1893,W0_1894,W1_1895] :
      ( aElementOf0('#skF_2'(W0_1893,sdtlbdtrb0(W0_1894,W1_1895)),szDzozmdt0(W0_1894))
      | ~ aElement0(W1_1895)
      | ~ aFunction0(W0_1894)
      | aSubsetOf0(sdtlbdtrb0(W0_1894,W1_1895),W0_1893)
      | ~ aSet0(sdtlbdtrb0(W0_1894,W1_1895))
      | ~ aSet0(W0_1893) ),
    inference(resolution,[status(thm)],[c_30,c_12098]) ).

tff(c_28,plain,
    ! [W0_14,W1_20] :
      ( ~ aElementOf0('#skF_2'(W0_14,W1_20),W0_14)
      | aSubsetOf0(W1_20,W0_14)
      | ~ aSet0(W1_20)
      | ~ aSet0(W0_14) ),
    inference(cnfTransformation,[status(thm)],[f_84]) ).

tff(c_120776,plain,
    ! [W1_1978,W0_1979] :
      ( ~ aElement0(W1_1978)
      | ~ aFunction0(W0_1979)
      | aSubsetOf0(sdtlbdtrb0(W0_1979,W1_1978),szDzozmdt0(W0_1979))
      | ~ aSet0(sdtlbdtrb0(W0_1979,W1_1978))
      | ~ aSet0(szDzozmdt0(W0_1979)) ),
    inference(resolution,[status(thm)],[c_108167,c_28]) ).

tff(c_290,plain,
    ~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)),
    inference(cnfTransformation,[status(thm)],[f_587]) ).

tff(c_120827,plain,
    ( ~ aElement0(xy)
    | ~ aFunction0(xF)
    | ~ aSet0(sdtlbdtrb0(xF,xy))
    | ~ aSet0(szDzozmdt0(xF)) ),
    inference(resolution,[status(thm)],[c_120776,c_290]) ).

tff(c_120852,plain,
    ( ~ aSet0(sdtlbdtrb0(xF,xy))
    | ~ aSet0(szDzozmdt0(xF)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_288,c_286,c_120827]) ).

tff(c_120853,plain,
    ~ aSet0(szDzozmdt0(xF)),
    inference(splitLeft,[status(thm)],[c_120852]) ).

tff(c_120856,plain,
    ~ aFunction0(xF),
    inference(resolution,[status(thm)],[c_262,c_120853]) ).

tff(c_120860,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_288,c_120856]) ).

tff(c_120861,plain,
    ~ aSet0(sdtlbdtrb0(xF,xy)),
    inference(splitRight,[status(thm)],[c_120852]) ).

tff(c_120881,plain,
    ( ~ aElement0(xy)
    | ~ aFunction0(xF) ),
    inference(resolution,[status(thm)],[c_268,c_120861]) ).

tff(c_120885,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_288,c_286,c_120881]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.26  % Problem  : NUM560+1 : TPTP v9.0.0. Released v4.0.0.
% 0.12/0.27  % 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.15/0.49  % Computer : n009.cluster.edu
% 0.15/0.49  % Model    : x86_64 x86_64
% 0.15/0.49  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.49  % Memory   : 8042.1875MB
% 0.15/0.49  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.50  % CPULimit : 300
% 0.15/0.50  % WCLimit  : 300
% 0.15/0.50  % DateTime : Tue Apr  8 13:34:56 EDT 2025
% 0.15/0.50  % CPUTime  : 
% 39.92/24.35  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 39.92/24.36  
% 39.92/24.36  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------