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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SEU121+1 : TPTP v8.1.2. 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 : n026.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:39 EDT 2023

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

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

%Foreground sorts:

%Background operators:

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

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

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

tff(empty_set,type,
    empty_set: $i ).

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

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

tff(f_54,negated_conjecture,
    ~ ! [A,B,C] :
        ( ( subset(A,B)
          & subset(B,C) )
       => subset(A,C) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).

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

tff(c_20,plain,
    ~ subset('#skF_4','#skF_6'),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

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

tff(c_22,plain,
    subset('#skF_5','#skF_6'),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_8,plain,
    ! [A_3,B_4] :
      ( in('#skF_1'(A_3,B_4),A_3)
      | subset(A_3,B_4) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_76,plain,
    ! [C_28,B_29,A_30] :
      ( in(C_28,B_29)
      | ~ in(C_28,A_30)
      | ~ subset(A_30,B_29) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_86,plain,
    ! [A_35,B_36,B_37] :
      ( in('#skF_1'(A_35,B_36),B_37)
      | ~ subset(A_35,B_37)
      | subset(A_35,B_36) ),
    inference(resolution,[status(thm)],[c_8,c_76]) ).

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

tff(c_133,plain,
    ! [A_44,B_45,B_46,B_47] :
      ( in('#skF_1'(A_44,B_45),B_46)
      | ~ subset(B_47,B_46)
      | ~ subset(A_44,B_47)
      | subset(A_44,B_45) ),
    inference(resolution,[status(thm)],[c_86,c_4]) ).

tff(c_146,plain,
    ! [A_48,B_49] :
      ( in('#skF_1'(A_48,B_49),'#skF_6')
      | ~ subset(A_48,'#skF_5')
      | subset(A_48,B_49) ),
    inference(resolution,[status(thm)],[c_22,c_133]) ).

tff(c_6,plain,
    ! [A_3,B_4] :
      ( ~ in('#skF_1'(A_3,B_4),B_4)
      | subset(A_3,B_4) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_162,plain,
    ! [A_50] :
      ( ~ subset(A_50,'#skF_5')
      | subset(A_50,'#skF_6') ),
    inference(resolution,[status(thm)],[c_146,c_6]) ).

tff(c_173,plain,
    subset('#skF_4','#skF_6'),
    inference(resolution,[status(thm)],[c_24,c_162]) ).

tff(c_180,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_20,c_173]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU121+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/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.35  % Computer : n026.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu Aug  3 12:23:01 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 3.18/1.91  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.18/1.91  
% 3.18/1.91  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.18/1.94  
% 3.18/1.94  Inference rules
% 3.18/1.94  ----------------------
% 3.18/1.94  #Ref     : 0
% 3.18/1.94  #Sup     : 33
% 3.18/1.94  #Fact    : 0
% 3.18/1.94  #Define  : 0
% 3.18/1.94  #Split   : 2
% 3.18/1.94  #Chain   : 0
% 3.18/1.94  #Close   : 0
% 3.18/1.94  
% 3.18/1.94  Ordering : KBO
% 3.18/1.94  
% 3.18/1.94  Simplification rules
% 3.18/1.94  ----------------------
% 3.18/1.94  #Subsume      : 7
% 3.18/1.94  #Demod        : 5
% 3.18/1.94  #Tautology    : 9
% 3.18/1.94  #SimpNegUnit  : 1
% 3.18/1.94  #BackRed      : 2
% 3.18/1.94  
% 3.18/1.94  #Partial instantiations: 0
% 3.18/1.94  #Strategies tried      : 1
% 3.18/1.94  
% 3.18/1.94  Timing (in seconds)
% 3.18/1.94  ----------------------
% 3.18/1.94  Preprocessing        : 0.45
% 3.18/1.94  Parsing              : 0.25
% 3.18/1.94  CNF conversion       : 0.03
% 3.18/1.94  Main loop            : 0.29
% 3.18/1.94  Inferencing          : 0.12
% 3.18/1.94  Reduction            : 0.07
% 3.18/1.94  Demodulation         : 0.05
% 3.18/1.94  BG Simplification    : 0.02
% 3.18/1.94  Subsumption          : 0.07
% 3.18/1.94  Abstraction          : 0.01
% 3.18/1.94  MUC search           : 0.00
% 3.18/1.94  Cooper               : 0.00
% 3.18/1.94  Total                : 0.78
% 3.18/1.94  Index Insertion      : 0.00
% 3.18/1.94  Index Deletion       : 0.00
% 3.18/1.94  Index Matching       : 0.00
% 3.18/1.94  BG Taut test         : 0.00
%------------------------------------------------------------------------------