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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SEU132+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/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 : n021.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:42 EDT 2023

% Result   : Theorem 14.31s 5.11s
% Output   : CNFRefutation 14.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   37 (   5 unt;  13 typ;   0 def)
%            Number of atoms       :   55 (   1 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   52 (  21   ~;  25   |;   1   &)
%                                         (   3 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   15 (   7   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-3 aty)
%            Number of variables   :   55 (;  55   !;   0   ?;   0   :)

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

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_48,axiom,
    ! [A,B,C] :
      ( ( C = set_difference(A,B) )
    <=> ! [D] :
          ( in(D,C)
        <=> ( in(D,A)
            & ~ in(D,B) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).

tff(f_62,negated_conjecture,
    ~ ! [A,B,C] :
        ( subset(A,B)
       => subset(set_difference(A,C),set_difference(B,C)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_xboole_1) ).

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_144,plain,
    ! [D_44,A_45,B_46] :
      ( in(D_44,A_45)
      | ~ in(D_44,set_difference(A_45,B_46)) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_958,plain,
    ! [A_140,B_141,B_142] :
      ( in('#skF_1'(set_difference(A_140,B_141),B_142),A_140)
      | subset(set_difference(A_140,B_141),B_142) ),
    inference(resolution,[status(thm)],[c_8,c_144]) ).

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_1012,plain,
    ! [A_140,B_141] : subset(set_difference(A_140,B_141),A_140),
    inference(resolution,[status(thm)],[c_958,c_6]) ).

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

tff(c_175,plain,
    ! [C_55,B_56,A_57] :
      ( in(C_55,B_56)
      | ~ in(C_55,A_57)
      | ~ subset(A_57,B_56) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_289,plain,
    ! [A_73,B_74,B_75] :
      ( in('#skF_1'(A_73,B_74),B_75)
      | ~ subset(A_73,B_75)
      | subset(A_73,B_74) ),
    inference(resolution,[status(thm)],[c_8,c_175]) ).

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_24225,plain,
    ! [A_698,B_699,B_700,B_701] :
      ( in('#skF_1'(A_698,B_699),B_700)
      | ~ subset(B_701,B_700)
      | ~ subset(A_698,B_701)
      | subset(A_698,B_699) ),
    inference(resolution,[status(thm)],[c_289,c_4]) ).

tff(c_24280,plain,
    ! [A_702,B_703] :
      ( in('#skF_1'(A_702,B_703),'#skF_7')
      | ~ subset(A_702,'#skF_6')
      | subset(A_702,B_703) ),
    inference(resolution,[status(thm)],[c_42,c_24225]) ).

tff(c_181,plain,
    ! [D_59,A_60,B_61] :
      ( in(D_59,set_difference(A_60,B_61))
      | in(D_59,B_61)
      | ~ in(D_59,A_60) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_206,plain,
    ! [A_3,A_60,B_61] :
      ( subset(A_3,set_difference(A_60,B_61))
      | in('#skF_1'(A_3,set_difference(A_60,B_61)),B_61)
      | ~ in('#skF_1'(A_3,set_difference(A_60,B_61)),A_60) ),
    inference(resolution,[status(thm)],[c_181,c_6]) ).

tff(c_25884,plain,
    ! [A_721,B_722] :
      ( in('#skF_1'(A_721,set_difference('#skF_7',B_722)),B_722)
      | ~ subset(A_721,'#skF_6')
      | subset(A_721,set_difference('#skF_7',B_722)) ),
    inference(resolution,[status(thm)],[c_24280,c_206]) ).

tff(c_127,plain,
    ! [A_42,B_43] :
      ( in('#skF_1'(A_42,B_43),A_42)
      | subset(A_42,B_43) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_12,plain,
    ! [D_13,B_9,A_8] :
      ( ~ in(D_13,B_9)
      | ~ in(D_13,set_difference(A_8,B_9)) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_141,plain,
    ! [A_8,B_9,B_43] :
      ( ~ in('#skF_1'(set_difference(A_8,B_9),B_43),B_9)
      | subset(set_difference(A_8,B_9),B_43) ),
    inference(resolution,[status(thm)],[c_127,c_12]) ).

tff(c_26266,plain,
    ! [A_730,B_731] :
      ( ~ subset(set_difference(A_730,B_731),'#skF_6')
      | subset(set_difference(A_730,B_731),set_difference('#skF_7',B_731)) ),
    inference(resolution,[status(thm)],[c_25884,c_141]) ).

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

tff(c_26317,plain,
    ~ subset(set_difference('#skF_6','#skF_8'),'#skF_6'),
    inference(resolution,[status(thm)],[c_26266,c_40]) ).

tff(c_26447,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_1012,c_26317]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SEU132+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/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.13/0.36  % Computer : n021.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit : 300
% 0.13/0.36  % WCLimit  : 300
% 0.13/0.36  % DateTime : Thu Aug  3 11:29:21 EDT 2023
% 0.13/0.36  % CPUTime  : 
% 14.31/5.11  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.31/5.11  
% 14.31/5.11  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 14.31/5.14  
% 14.31/5.14  Inference rules
% 14.31/5.14  ----------------------
% 14.31/5.14  #Ref     : 0
% 14.31/5.14  #Sup     : 6653
% 14.31/5.14  #Fact    : 0
% 14.31/5.14  #Define  : 0
% 14.31/5.14  #Split   : 8
% 14.31/5.14  #Chain   : 0
% 14.31/5.14  #Close   : 0
% 14.31/5.14  
% 14.31/5.14  Ordering : KBO
% 14.31/5.14  
% 14.31/5.14  Simplification rules
% 14.31/5.14  ----------------------
% 14.31/5.14  #Subsume      : 3727
% 14.31/5.14  #Demod        : 3490
% 14.31/5.14  #Tautology    : 1022
% 14.31/5.14  #SimpNegUnit  : 76
% 14.31/5.14  #BackRed      : 17
% 14.31/5.14  
% 14.31/5.14  #Partial instantiations: 0
% 14.31/5.14  #Strategies tried      : 1
% 14.31/5.14  
% 14.31/5.14  Timing (in seconds)
% 14.31/5.14  ----------------------
% 14.31/5.14  Preprocessing        : 0.49
% 14.31/5.14  Parsing              : 0.25
% 14.31/5.14  CNF conversion       : 0.04
% 14.31/5.14  Main loop            : 3.59
% 14.31/5.14  Inferencing          : 1.04
% 14.31/5.14  Reduction            : 1.00
% 14.31/5.14  Demodulation         : 0.71
% 14.31/5.14  BG Simplification    : 0.08
% 14.31/5.15  Subsumption          : 1.24
% 14.31/5.15  Abstraction          : 0.11
% 14.31/5.15  MUC search           : 0.00
% 14.31/5.15  Cooper               : 0.00
% 14.31/5.15  Total                : 4.13
% 14.31/5.15  Index Insertion      : 0.00
% 14.31/5.15  Index Deletion       : 0.00
% 14.31/5.15  Index Matching       : 0.00
% 14.31/5.15  BG Taut test         : 0.00
%------------------------------------------------------------------------------