↑ Up

Beagle---0.9.52.THM-CRf.s

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

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

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

%Foreground sorts:

%Background operators:

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

tff('#skF_3',type,
    '#skF_3': ( $i * $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(empty,type,
    empty: $i > $o ).

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

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

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

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

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

tff(f_49,axiom,
    ! [A,B] :
      ( in(A,B)
     => subset(A,union(B)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l50_zfmisc_1) ).

tff(f_38,axiom,
    ! [A,B] :
      ( ( B = powerset(A) )
    <=> ! [C] :
          ( in(C,B)
        <=> subset(C,A) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).

tff(f_59,negated_conjecture,
    ~ ! [A] : subset(A,powerset(union(A))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t100_zfmisc_1) ).

tff(c_20,plain,
    ! [A_8,B_9] :
      ( in('#skF_3'(A_8,B_9),A_8)
      | subset(A_8,B_9) ),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_22,plain,
    ! [A_13,B_14] :
      ( subset(A_13,union(B_14))
      | ~ in(A_13,B_14) ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_6,plain,
    ! [C_7,A_3] :
      ( in(C_7,powerset(A_3))
      | ~ subset(C_7,A_3) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_49,plain,
    ! [A_28,B_29] :
      ( ~ in('#skF_3'(A_28,B_29),B_29)
      | subset(A_28,B_29) ),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_150,plain,
    ! [A_53,A_54] :
      ( subset(A_53,powerset(A_54))
      | ~ subset('#skF_3'(A_53,powerset(A_54)),A_54) ),
    inference(resolution,[status(thm)],[c_6,c_49]) ).

tff(c_526,plain,
    ! [A_105,B_106] :
      ( subset(A_105,powerset(union(B_106)))
      | ~ in('#skF_3'(A_105,powerset(union(B_106))),B_106) ),
    inference(resolution,[status(thm)],[c_22,c_150]) ).

tff(c_550,plain,
    ! [A_8] : subset(A_8,powerset(union(A_8))),
    inference(resolution,[status(thm)],[c_20,c_526]) ).

tff(c_30,plain,
    ~ subset('#skF_6',powerset(union('#skF_6'))),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_570,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_550,c_30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET947+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/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 : n013.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:52:02 EDT 2025
% 0.19/0.34  % CPUTime  : 
% 4.66/2.81  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.66/2.82  
% 4.66/2.82  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------