TSTP Solution File: SET947+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SET947+1 : TPTP v8.1.2. 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 : 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 : Tue Aug 22 10:57:24 EDT 2023

% Result   : Theorem 3.59s 1.93s
% Output   : CNFRefutation 3.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   24 (   4 unt;  11 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  :   13 (   8   >;   5   *;   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.13  % Problem  : SET947+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14  % 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.15/0.35  % Computer : n016.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu Aug  3 17:21:23 EDT 2023
% 0.15/0.35  % CPUTime  : 
% 3.59/1.93  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.59/1.93  
% 3.59/1.93  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.59/1.96  
% 3.59/1.96  Inference rules
% 3.59/1.96  ----------------------
% 3.59/1.96  #Ref     : 0
% 3.59/1.96  #Sup     : 107
% 3.59/1.96  #Fact    : 0
% 3.59/1.96  #Define  : 0
% 3.59/1.96  #Split   : 0
% 3.59/1.96  #Chain   : 0
% 3.59/1.96  #Close   : 0
% 3.59/1.96  
% 3.59/1.96  Ordering : KBO
% 3.59/1.96  
% 3.59/1.96  Simplification rules
% 3.59/1.96  ----------------------
% 3.59/1.96  #Subsume      : 4
% 3.59/1.96  #Demod        : 3
% 3.59/1.96  #Tautology    : 5
% 3.59/1.96  #SimpNegUnit  : 0
% 3.59/1.96  #BackRed      : 1
% 3.59/1.96  
% 3.59/1.96  #Partial instantiations: 0
% 3.59/1.96  #Strategies tried      : 1
% 3.59/1.96  
% 3.59/1.96  Timing (in seconds)
% 3.59/1.96  ----------------------
% 3.59/1.96  Preprocessing        : 0.45
% 3.59/1.96  Parsing              : 0.24
% 3.59/1.96  CNF conversion       : 0.03
% 3.59/1.96  Main loop            : 0.41
% 3.59/1.96  Inferencing          : 0.17
% 3.59/1.96  Reduction            : 0.09
% 3.59/1.96  Demodulation         : 0.06
% 3.59/1.96  BG Simplification    : 0.02
% 3.59/1.96  Subsumption          : 0.10
% 3.59/1.96  Abstraction          : 0.02
% 3.59/1.96  MUC search           : 0.00
% 3.59/1.96  Cooper               : 0.00
% 3.59/1.96  Total                : 0.91
% 3.59/1.96  Index Insertion      : 0.00
% 3.59/1.96  Index Deletion       : 0.00
% 3.59/1.96  Index Matching       : 0.00
% 3.59/1.96  BG Taut test         : 0.00
%------------------------------------------------------------------------------