↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : NUM533+2 : 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 : n012.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:17 PM UTC 2025

% Result   : Theorem 2.81s 1.78s
% Output   : CNFRefutation 3.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    8 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   18 (   0 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :   16 (   6   ~;   3   |;   3   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 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 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :    5 (   5   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ aSubsetOf0 > aElementOf0 > isFinite0 > isCountable0 > aSet0 > aElement0 > #nlpp > xC > xB > xA > slcrc0 > #skF_1 > #skF_3 > #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(xB,type,
    xB: $i ).

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

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

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

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

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

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_133,negated_conjecture,
    ~ ( ( ! [W0] :
            ( aElementOf0(W0,xA)
           => aElementOf0(W0,xB) )
        & aSubsetOf0(xA,xB)
        & ! [W0] :
            ( aElementOf0(W0,xB)
           => aElementOf0(W0,xC) )
        & aSubsetOf0(xB,xC) )
     => ( ! [W0] :
            ( aElementOf0(W0,xA)
           => aElementOf0(W0,xC) )
        | aSubsetOf0(xA,xC) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

tff(c_48,plain,
    aElementOf0('#skF_3',xA),
    inference(cnfTransformation,[status(thm)],[f_133]) ).

tff(c_56,plain,
    ! [W0_30] :
      ( aElementOf0(W0_30,xB)
      | ~ aElementOf0(W0_30,xA) ),
    inference(cnfTransformation,[status(thm)],[f_133]) ).

tff(c_69,plain,
    ! [W0_36] :
      ( aElementOf0(W0_36,xC)
      | ~ aElementOf0(W0_36,xB) ),
    inference(cnfTransformation,[status(thm)],[f_133]) ).

tff(c_46,plain,
    ~ aElementOf0('#skF_3',xC),
    inference(cnfTransformation,[status(thm)],[f_133]) ).

tff(c_73,plain,
    ~ aElementOf0('#skF_3',xB),
    inference(resolution,[status(thm)],[c_69,c_46]) ).

tff(c_76,plain,
    ~ aElementOf0('#skF_3',xA),
    inference(resolution,[status(thm)],[c_56,c_73]) ).

tff(c_80,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_48,c_76]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.16  % Problem  : NUM533+2 : TPTP v9.0.0. Released v4.0.0.
% 0.08/0.17  % 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.39  % Computer : n012.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8042.1875MB
% 0.13/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Tue Apr  8 13:19:44 EDT 2025
% 0.13/0.40  % CPUTime  : 
% 2.81/1.78  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.12/1.78  
% 3.12/1.78  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------