↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SEU158+3 : TPTP v9.0.0. Released v3.2.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 : 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 08:52:59 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ subset > in > empty > #nlpp > singleton > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

tff(f_43,negated_conjecture,
    ~ ! [A,B] :
        ( subset(singleton(A),B)
      <=> in(A,B) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_zfmisc_1) ).

tff(f_47,axiom,
    ! [A,B] :
      ( subset(singleton(A),B)
    <=> in(A,B) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).

tff(c_12,plain,
    ( in('#skF_3','#skF_4')
    | ~ in('#skF_5','#skF_6') ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_23,plain,
    ~ in('#skF_5','#skF_6'),
    inference(splitLeft,[status(thm)],[c_12]) ).

tff(c_16,plain,
    ( in('#skF_3','#skF_4')
    | subset(singleton('#skF_5'),'#skF_6') ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_24,plain,
    subset(singleton('#skF_5'),'#skF_6'),
    inference(splitLeft,[status(thm)],[c_16]) ).

tff(c_26,plain,
    ! [A_10,B_11] :
      ( in(A_10,B_11)
      | ~ subset(singleton(A_10),B_11) ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_29,plain,
    in('#skF_5','#skF_6'),
    inference(resolution,[status(thm)],[c_24,c_26]) ).

tff(c_37,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_23,c_29]) ).

tff(c_38,plain,
    in('#skF_3','#skF_4'),
    inference(splitRight,[status(thm)],[c_16]) ).

tff(c_20,plain,
    ! [A_5,B_6] :
      ( subset(singleton(A_5),B_6)
      | ~ in(A_5,B_6) ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_39,plain,
    ~ subset(singleton('#skF_5'),'#skF_6'),
    inference(splitRight,[status(thm)],[c_16]) ).

tff(c_14,plain,
    ( ~ subset(singleton('#skF_3'),'#skF_4')
    | subset(singleton('#skF_5'),'#skF_6') ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_63,plain,
    ~ subset(singleton('#skF_3'),'#skF_4'),
    inference(negUnitSimplification,[status(thm)],[c_39,c_14]) ).

tff(c_66,plain,
    ~ in('#skF_3','#skF_4'),
    inference(resolution,[status(thm)],[c_20,c_63]) ).

tff(c_70,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_38,c_66]) ).

tff(c_71,plain,
    in('#skF_3','#skF_4'),
    inference(splitRight,[status(thm)],[c_12]) ).

tff(c_82,plain,
    ! [A_18,B_19] :
      ( subset(singleton(A_18),B_19)
      | ~ in(A_18,B_19) ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_72,plain,
    in('#skF_5','#skF_6'),
    inference(splitRight,[status(thm)],[c_12]) ).

tff(c_10,plain,
    ( ~ subset(singleton('#skF_3'),'#skF_4')
    | ~ in('#skF_5','#skF_6') ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_81,plain,
    ~ subset(singleton('#skF_3'),'#skF_4'),
    inference(demodulation,[status(thm),theory(equality)],[c_72,c_10]) ).

tff(c_85,plain,
    ~ in('#skF_3','#skF_4'),
    inference(resolution,[status(thm)],[c_82,c_81]) ).

tff(c_89,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_71,c_85]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SEU158+3 : TPTP v9.0.0. Released v3.2.0.
% 0.10/0.13  % 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.13/0.34  % Computer : n012.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 22:08:59 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 2.78/1.67  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.78/1.67  
% 2.78/1.67  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------