↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SEU145+1 : TPTP v9.0.0. Released v3.3.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 : n017.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:55 PM UTC 2025

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

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

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_63,negated_conjecture,
    ~ ! [A,B,C] :
        ( subset(A,B)
       => ( in(C,A)
          | subset(A,set_difference(B,singleton(C))) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_zfmisc_1) ).

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_55,axiom,
    ! [A,B,C] :
      ( ( C = set_difference(A,B) )
    <=> ! [D] :
          ( in(D,C)
        <=> ( in(D,A)
            & ~ in(D,B) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).

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

tff(c_44,plain,
    ~ subset('#skF_6',set_difference('#skF_7',singleton('#skF_8'))),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_46,plain,
    ~ in('#skF_8','#skF_6'),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_48,plain,
    subset('#skF_6','#skF_7'),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

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_93,plain,
    ! [C_40,B_41,A_42] :
      ( in(C_40,B_41)
      | ~ in(C_40,A_42)
      | ~ subset(A_42,B_41) ),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_98,plain,
    ! [A_8,B_9,B_41] :
      ( in('#skF_3'(A_8,B_9),B_41)
      | ~ subset(A_8,B_41)
      | subset(A_8,B_9) ),
    inference(resolution,[status(thm)],[c_20,c_93]) ).

tff(c_132,plain,
    ! [D_51,A_52,B_53] :
      ( in(D_51,set_difference(A_52,B_53))
      | in(D_51,B_53)
      | ~ in(D_51,A_52) ),
    inference(cnfTransformation,[status(thm)],[f_55]) ).

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

tff(c_10551,plain,
    ! [A_3006,A_3007,B_3008] :
      ( subset(A_3006,set_difference(A_3007,B_3008))
      | in('#skF_3'(A_3006,set_difference(A_3007,B_3008)),B_3008)
      | ~ in('#skF_3'(A_3006,set_difference(A_3007,B_3008)),A_3007) ),
    inference(resolution,[status(thm)],[c_132,c_18]) ).

tff(c_24602,plain,
    ! [A_3258,B_3259,B_3260] :
      ( in('#skF_3'(A_3258,set_difference(B_3259,B_3260)),B_3260)
      | ~ subset(A_3258,B_3259)
      | subset(A_3258,set_difference(B_3259,B_3260)) ),
    inference(resolution,[status(thm)],[c_98,c_10551]) ).

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_323759,plain,
    ! [A_45396,B_45397,A_45398] :
      ( ( '#skF_3'(A_45396,set_difference(B_45397,singleton(A_45398))) = A_45398 )
      | ~ subset(A_45396,B_45397)
      | subset(A_45396,set_difference(B_45397,singleton(A_45398))) ),
    inference(resolution,[status(thm)],[c_24602,c_4]) ).

tff(c_324327,plain,
    ( ( '#skF_3'('#skF_6',set_difference('#skF_7',singleton('#skF_8'))) = '#skF_8' )
    | ~ subset('#skF_6','#skF_7') ),
    inference(resolution,[status(thm)],[c_323759,c_44]) ).

tff(c_324921,plain,
    '#skF_3'('#skF_6',set_difference('#skF_7',singleton('#skF_8'))) = '#skF_8',
    inference(demodulation,[status(thm),theory(equality)],[c_48,c_324327]) ).

tff(c_325052,plain,
    ( in('#skF_8','#skF_6')
    | subset('#skF_6',set_difference('#skF_7',singleton('#skF_8'))) ),
    inference(superposition,[status(thm),theory(equality)],[c_324921,c_20]) ).

tff(c_325172,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_44,c_46,c_325052]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SEU145+1 : TPTP v9.0.0. Released v3.3.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.12/0.33  % Computer : n017.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue Apr  8 22:07:25 EDT 2025
% 0.19/0.34  % CPUTime  : 
% 72.16/55.18  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 72.16/55.18  
% 72.16/55.18  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------