TSTP Solution File: SET589+3 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SET589+3 : TPTP v8.1.2. Released v2.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 : n018.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:56:38 EDT 2023

% Result   : Theorem 4.07s 2.06s
% Output   : CNFRefutation 4.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   22 (   4 unt;   8 typ;   0 def)
%            Number of atoms       :   29 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   27 (  12   ~;   9   |;   2   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    8 (   4   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   30 (;  30   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ subset > member > difference > #nlpp > #skF_5 > #skF_2 > #skF_3 > #skF_4 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(difference,type,
    difference: ( $i * $i ) > $i ).

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

tff(f_71,negated_conjecture,
    ~ ! [B,C,D,E] :
        ( ( subset(B,C)
          & subset(D,E) )
       => subset(difference(B,E),difference(C,D)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th48) ).

tff(f_39,axiom,
    ! [B,C,D] :
      ( subset(B,C)
     => subset(difference(B,D),difference(C,D)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_subset1) ).

tff(f_44,axiom,
    ! [B,C,D] :
      ( subset(B,C)
     => subset(difference(D,C),difference(D,B)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_subset2) ).

tff(f_34,axiom,
    ! [B,C,D] :
      ( ( subset(B,C)
        & subset(C,D) )
     => subset(B,D) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_subset) ).

tff(c_26,plain,
    subset('#skF_2','#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_24,plain,
    subset('#skF_4','#skF_5'),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_4,plain,
    ! [B_4,D_6,C_5] :
      ( subset(difference(B_4,D_6),difference(C_5,D_6))
      | ~ subset(B_4,C_5) ),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_95,plain,
    ! [D_43,C_44,B_45] :
      ( subset(difference(D_43,C_44),difference(D_43,B_45))
      | ~ subset(B_45,C_44) ),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_2,plain,
    ! [B_1,D_3,C_2] :
      ( subset(B_1,D_3)
      | ~ subset(C_2,D_3)
      | ~ subset(B_1,C_2) ),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_212,plain,
    ! [B_68,D_69,B_70,C_71] :
      ( subset(B_68,difference(D_69,B_70))
      | ~ subset(B_68,difference(D_69,C_71))
      | ~ subset(B_70,C_71) ),
    inference(resolution,[status(thm)],[c_95,c_2]) ).

tff(c_1307,plain,
    ! [B_140,D_141,C_142,B_143] :
      ( subset(difference(B_140,D_141),difference(C_142,B_143))
      | ~ subset(B_143,D_141)
      | ~ subset(B_140,C_142) ),
    inference(resolution,[status(thm)],[c_4,c_212]) ).

tff(c_22,plain,
    ~ subset(difference('#skF_2','#skF_5'),difference('#skF_3','#skF_4')),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_1336,plain,
    ( ~ subset('#skF_4','#skF_5')
    | ~ subset('#skF_2','#skF_3') ),
    inference(resolution,[status(thm)],[c_1307,c_22]) ).

tff(c_1350,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_26,c_24,c_1336]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SET589+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.15  % 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.16/0.36  % Computer : n018.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit : 300
% 0.16/0.36  % WCLimit  : 300
% 0.16/0.36  % DateTime : Thu Aug  3 16:42:20 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 4.07/2.06  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.07/2.06  
% 4.07/2.06  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.07/2.09  
% 4.07/2.09  Inference rules
% 4.07/2.09  ----------------------
% 4.07/2.09  #Ref     : 0
% 4.07/2.09  #Sup     : 302
% 4.07/2.09  #Fact    : 0
% 4.07/2.09  #Define  : 0
% 4.07/2.09  #Split   : 1
% 4.07/2.09  #Chain   : 0
% 4.07/2.09  #Close   : 0
% 4.07/2.09  
% 4.07/2.09  Ordering : KBO
% 4.07/2.09  
% 4.07/2.09  Simplification rules
% 4.07/2.09  ----------------------
% 4.07/2.09  #Subsume      : 49
% 4.07/2.09  #Demod        : 112
% 4.07/2.09  #Tautology    : 116
% 4.07/2.09  #SimpNegUnit  : 0
% 4.07/2.09  #BackRed      : 0
% 4.07/2.09  
% 4.07/2.09  #Partial instantiations: 0
% 4.07/2.09  #Strategies tried      : 1
% 4.07/2.09  
% 4.07/2.09  Timing (in seconds)
% 4.07/2.09  ----------------------
% 4.07/2.09  Preprocessing        : 0.44
% 4.07/2.09  Parsing              : 0.25
% 4.07/2.09  CNF conversion       : 0.03
% 4.07/2.09  Main loop            : 0.59
% 4.07/2.09  Inferencing          : 0.23
% 4.07/2.09  Reduction            : 0.16
% 4.07/2.09  Demodulation         : 0.12
% 4.07/2.09  BG Simplification    : 0.03
% 4.07/2.09  Subsumption          : 0.14
% 4.07/2.09  Abstraction          : 0.02
% 4.07/2.09  MUC search           : 0.00
% 4.07/2.09  Cooper               : 0.00
% 4.07/2.09  Total                : 1.08
% 4.07/2.09  Index Insertion      : 0.00
% 4.07/2.09  Index Deletion       : 0.00
% 4.07/2.09  Index Matching       : 0.00
% 4.07/2.09  BG Taut test         : 0.00
%------------------------------------------------------------------------------