↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SET876+1 : 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/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 : n016.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:39:30 PM UTC 2025

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

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

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

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

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

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

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

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

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

tff(f_58,negated_conjecture,
    ~ ! [A,B] :
        ( ( A != B )
       => disjoint(singleton(A),singleton(B)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_zfmisc_1) ).

tff(f_43,axiom,
    ! [A,B] :
      ( ~ in(A,B)
     => disjoint(singleton(A),B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_zfmisc_1) ).

tff(f_38,axiom,
    ! [A,B] :
      ( ( B = singleton(A) )
    <=> ! [C] :
          ( in(C,B)
        <=> ( C = A ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).

tff(c_26,plain,
    '#skF_5' != '#skF_6',
    inference(cnfTransformation,[status(thm)],[f_58]) ).

tff(c_40,plain,
    ! [A_20,B_21] :
      ( disjoint(singleton(A_20),B_21)
      | in(A_20,B_21) ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_24,plain,
    ~ disjoint(singleton('#skF_5'),singleton('#skF_6')),
    inference(cnfTransformation,[status(thm)],[f_58]) ).

tff(c_47,plain,
    in('#skF_5',singleton('#skF_6')),
    inference(resolution,[status(thm)],[c_40,c_24]) ).

tff(c_4,plain,
    ! [C_7,A_3] :
      ( ( C_7 = A_3 )
      | ~ in(C_7,singleton(A_3)) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_50,plain,
    '#skF_5' = '#skF_6',
    inference(resolution,[status(thm)],[c_47,c_4]) ).

tff(c_56,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_26,c_50]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET876+1 : TPTP v9.0.0. Released v3.2.0.
% 0.12/0.13  % 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.34  % Computer : n016.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 21:48:23 EDT 2025
% 0.19/0.34  % CPUTime  : 
% 2.79/1.63  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.79/1.63  
% 2.79/1.63  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------