↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : NUM532+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 : n010.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.98s 1.88s
% Output   : CNFRefutation 2.98s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   10 (   6 unt;   0 typ;   1 def)
%            Number of atoms       :   21 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   20 (   9   ~;   7   |;   1   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 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  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :    8 (   8   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ aSubsetOf0 > aElementOf0 > isFinite0 > isCountable0 > aSet0 > aElement0 > #nlpp > xA > 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(aSubsetOf0,type,
    aSubsetOf0: ( $i * $i ) > $o ).

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('#skF_2',type,
    '#skF_2': ( $i * $i ) > $i ).

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

tff(f_94,hypothesis,
    aSet0(xA),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__467) ).

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_96,negated_conjecture,
    ~ aSubsetOf0(xA,xA),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

tff(c_34,plain,
    aSet0(xA),
    inference(cnfTransformation,[status(thm)],[f_94]) ).

tff(c_69,plain,
    ! [W0_42,W1_43] :
      ( aElementOf0('#skF_2'(W0_42,W1_43),W1_43)
      | aSubsetOf0(W1_43,W0_42)
      | ~ aSet0(W1_43)
      | ~ aSet0(W0_42) ),
    inference(cnfTransformation,[status(thm)],[f_84]) ).

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_89,plain,
    ! [W1_44] :
      ( aSubsetOf0(W1_44,W1_44)
      | ~ aSet0(W1_44) ),
    inference(resolution,[status(thm)],[c_69,c_28]) ).

tff(c_36,plain,
    ~ aSubsetOf0(xA,xA),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_98,plain,
    ~ aSet0(xA),
    inference(resolution,[status(thm)],[c_89,c_36]) ).

tff(c_104,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_34,c_98]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.26  % Problem  : NUM532+1 : TPTP v9.0.0. Released v4.0.0.
% 0.11/0.26  % 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.48  % Computer : n010.cluster.edu
% 0.13/0.48  % Model    : x86_64 x86_64
% 0.13/0.48  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.48  % Memory   : 8042.1875MB
% 0.13/0.48  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.48  % CPULimit : 300
% 0.13/0.48  % WCLimit  : 300
% 0.13/0.48  % DateTime : Tue Apr  8 13:20:49 EDT 2025
% 0.13/0.49  % CPUTime  : 
% 2.98/1.88  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.98/1.88  
% 2.98/1.88  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------