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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SEU341+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 : 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:58:28 EDT 2023

% Result   : Theorem 5.90s 2.49s
% Output   : CNFRefutation 6.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   37
% Syntax   : Number of formulae    :   59 (  12 unt;  34 typ;   0 def)
%            Number of atoms       :   78 (   6 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :   89 (  36   ~;  32   |;   7   &)
%                                         (   1 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   35 (  27   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :   22 (  20 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  14 usr;   7 con; 0-2 aty)
%            Number of variables   :   24 (;  24   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ point_neighbourhood > subset > open_subset > in > element > v5_membered > v4_membered > v3_membered > v2_membered > v1_xreal_0 > v1_xcmplx_0 > v1_rat_1 > v1_membered > v1_int_1 > topological_space > top_str > one_sorted_str > natural > empty_carrier > empty > interior > #nlpp > the_carrier > powerset > empty_set > #skF_7 > #skF_4 > #skF_3 > #skF_10 > #skF_5 > #skF_2 > #skF_1 > #skF_9 > #skF_8 > #skF_6

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_334,negated_conjecture,
    ~ ! [A] :
        ( ( ~ empty_carrier(A)
          & topological_space(A)
          & top_str(A) )
       => ! [B] :
            ( element(B,powerset(the_carrier(A)))
           => ! [C] :
                ( element(C,the_carrier(A))
               => ( ( open_subset(B,A)
                    & in(C,B) )
                 => point_neighbourhood(B,A,C) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_connsp_2) ).

tff(f_314,axiom,
    ! [A] :
      ( ( topological_space(A)
        & top_str(A) )
     => ! [B] :
          ( top_str(B)
         => ! [C] :
              ( element(C,powerset(the_carrier(A)))
             => ! [D] :
                  ( element(D,powerset(the_carrier(B)))
                 => ( ( open_subset(D,B)
                     => ( interior(B,D) = D ) )
                    & ( ( interior(A,C) = C )
                     => open_subset(C,A) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t55_tops_1) ).

tff(f_186,axiom,
    ! [A] :
      ( ( ~ empty_carrier(A)
        & topological_space(A)
        & top_str(A) )
     => ! [B] :
          ( element(B,the_carrier(A))
         => ! [C] :
              ( element(C,powerset(the_carrier(A)))
             => ( point_neighbourhood(C,A,B)
              <=> in(B,interior(A,C)) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_connsp_2) ).

tff(c_160,plain,
    ~ point_neighbourhood('#skF_9','#skF_8','#skF_10'),
    inference(cnfTransformation,[status(thm)],[f_334]) ).

tff(c_162,plain,
    in('#skF_10','#skF_9'),
    inference(cnfTransformation,[status(thm)],[f_334]) ).

tff(c_166,plain,
    element('#skF_10',the_carrier('#skF_8')),
    inference(cnfTransformation,[status(thm)],[f_334]) ).

tff(c_174,plain,
    ~ empty_carrier('#skF_8'),
    inference(cnfTransformation,[status(thm)],[f_334]) ).

tff(c_172,plain,
    topological_space('#skF_8'),
    inference(cnfTransformation,[status(thm)],[f_334]) ).

tff(c_170,plain,
    top_str('#skF_8'),
    inference(cnfTransformation,[status(thm)],[f_334]) ).

tff(c_168,plain,
    element('#skF_9',powerset(the_carrier('#skF_8'))),
    inference(cnfTransformation,[status(thm)],[f_334]) ).

tff(c_164,plain,
    open_subset('#skF_9','#skF_8'),
    inference(cnfTransformation,[status(thm)],[f_334]) ).

tff(c_158,plain,
    ! [B_81,D_87,C_85,A_73] :
      ( ( interior(B_81,D_87) = D_87 )
      | ~ open_subset(D_87,B_81)
      | ~ element(D_87,powerset(the_carrier(B_81)))
      | ~ element(C_85,powerset(the_carrier(A_73)))
      | ~ top_str(B_81)
      | ~ top_str(A_73)
      | ~ topological_space(A_73) ),
    inference(cnfTransformation,[status(thm)],[f_314]) ).

tff(c_2223,plain,
    ! [C_315,A_316] :
      ( ~ element(C_315,powerset(the_carrier(A_316)))
      | ~ top_str(A_316)
      | ~ topological_space(A_316) ),
    inference(splitLeft,[status(thm)],[c_158]) ).

tff(c_2243,plain,
    ( ~ top_str('#skF_8')
    | ~ topological_space('#skF_8') ),
    inference(resolution,[status(thm)],[c_168,c_2223]) ).

tff(c_2252,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_172,c_170,c_2243]) ).

tff(c_2304,plain,
    ! [B_321,D_322] :
      ( ( interior(B_321,D_322) = D_322 )
      | ~ open_subset(D_322,B_321)
      | ~ element(D_322,powerset(the_carrier(B_321)))
      | ~ top_str(B_321) ),
    inference(splitRight,[status(thm)],[c_158]) ).

tff(c_2326,plain,
    ( ( interior('#skF_8','#skF_9') = '#skF_9' )
    | ~ open_subset('#skF_9','#skF_8')
    | ~ top_str('#skF_8') ),
    inference(resolution,[status(thm)],[c_168,c_2304]) ).

tff(c_2334,plain,
    interior('#skF_8','#skF_9') = '#skF_9',
    inference(demodulation,[status(thm),theory(equality)],[c_170,c_164,c_2326]) ).

tff(c_2391,plain,
    ! [C_328,A_329,B_330] :
      ( point_neighbourhood(C_328,A_329,B_330)
      | ~ in(B_330,interior(A_329,C_328))
      | ~ element(C_328,powerset(the_carrier(A_329)))
      | ~ element(B_330,the_carrier(A_329))
      | ~ top_str(A_329)
      | ~ topological_space(A_329)
      | empty_carrier(A_329) ),
    inference(cnfTransformation,[status(thm)],[f_186]) ).

tff(c_2393,plain,
    ! [B_330] :
      ( point_neighbourhood('#skF_9','#skF_8',B_330)
      | ~ in(B_330,'#skF_9')
      | ~ element('#skF_9',powerset(the_carrier('#skF_8')))
      | ~ element(B_330,the_carrier('#skF_8'))
      | ~ top_str('#skF_8')
      | ~ topological_space('#skF_8')
      | empty_carrier('#skF_8') ),
    inference(superposition,[status(thm),theory(equality)],[c_2334,c_2391]) ).

tff(c_2398,plain,
    ! [B_330] :
      ( point_neighbourhood('#skF_9','#skF_8',B_330)
      | ~ in(B_330,'#skF_9')
      | ~ element(B_330,the_carrier('#skF_8'))
      | empty_carrier('#skF_8') ),
    inference(demodulation,[status(thm),theory(equality)],[c_172,c_170,c_168,c_2393]) ).

tff(c_2408,plain,
    ! [B_335] :
      ( point_neighbourhood('#skF_9','#skF_8',B_335)
      | ~ in(B_335,'#skF_9')
      | ~ element(B_335,the_carrier('#skF_8')) ),
    inference(negUnitSimplification,[status(thm)],[c_174,c_2398]) ).

tff(c_2418,plain,
    ( point_neighbourhood('#skF_9','#skF_8','#skF_10')
    | ~ in('#skF_10','#skF_9') ),
    inference(resolution,[status(thm)],[c_166,c_2408]) ).

tff(c_2423,plain,
    point_neighbourhood('#skF_9','#skF_8','#skF_10'),
    inference(demodulation,[status(thm),theory(equality)],[c_162,c_2418]) ).

tff(c_2425,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_160,c_2423]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SEU341+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14  % 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.14/0.35  % Computer : n016.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 12:13:52 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 5.90/2.49  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.90/2.49  
% 5.90/2.49  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.80/2.52  
% 6.80/2.52  Inference rules
% 6.80/2.52  ----------------------
% 6.80/2.52  #Ref     : 0
% 6.80/2.52  #Sup     : 481
% 6.80/2.52  #Fact    : 0
% 6.80/2.52  #Define  : 0
% 6.80/2.52  #Split   : 23
% 6.80/2.52  #Chain   : 0
% 6.80/2.52  #Close   : 0
% 6.80/2.52  
% 6.80/2.52  Ordering : KBO
% 6.80/2.52  
% 6.80/2.52  Simplification rules
% 6.80/2.52  ----------------------
% 6.80/2.52  #Subsume      : 246
% 6.80/2.52  #Demod        : 72
% 6.80/2.52  #Tautology    : 76
% 6.80/2.52  #SimpNegUnit  : 46
% 6.80/2.52  #BackRed      : 1
% 6.80/2.52  
% 6.80/2.52  #Partial instantiations: 0
% 6.80/2.52  #Strategies tried      : 1
% 6.80/2.52  
% 6.80/2.52  Timing (in seconds)
% 6.80/2.52  ----------------------
% 6.80/2.53  Preprocessing        : 0.61
% 6.80/2.53  Parsing              : 0.33
% 6.80/2.53  CNF conversion       : 0.05
% 6.80/2.53  Main loop            : 0.86
% 6.80/2.53  Inferencing          : 0.32
% 6.80/2.53  Reduction            : 0.24
% 6.80/2.53  Demodulation         : 0.15
% 6.80/2.53  BG Simplification    : 0.04
% 6.80/2.53  Subsumption          : 0.18
% 6.80/2.53  Abstraction          : 0.02
% 6.80/2.53  MUC search           : 0.00
% 6.80/2.53  Cooper               : 0.00
% 6.80/2.53  Total                : 1.52
% 6.80/2.53  Index Insertion      : 0.00
% 6.80/2.53  Index Deletion       : 0.00
% 6.80/2.53  Index Matching       : 0.00
% 6.80/2.53  BG Taut test         : 0.00
%------------------------------------------------------------------------------