TSTP Solution File: SEU323-10 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SEU323-10 : TPTP v8.1.2. Released v7.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 : n020.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:25 EDT 2023

% Result   : Unsatisfiable 5.23s 2.31s
% Output   : CNFRefutation 5.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   33
% Syntax   : Number of formulae    :   55 (  33 unt;  22 typ;   0 def)
%            Number of atoms       :   33 (  32 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   30 (  17   >;  13   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   22 (  22 usr;   5 con; 0-4 aty)
%            Number of variables   :   32 (;  32   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ ifeq2 > ifeq > topstr_closure > subset_complement > subset > open_subset > interior > element > closed_subset > #nlpp > topological_space > top_str > the_carrier > sK7_rc6_pre_topc_B > sK4_existence_m1_subset_1_B > sK3_rc1_tops_1_B > powerset > one_sorted_str > true > sK6_existence_l1_struct_0_A > sK5_existence_l1_pre_topc_A > sK2_t51_tops_1_A > sK1_t51_tops_1_B

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(sK1_t51_tops_1_B,type,
    sK1_t51_tops_1_B: $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_67,axiom,
    open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A) != true,
    file(unknown,unknown) ).

tff(f_26,axiom,
    ! [A,B,C] : ( ifeq(A,A,B,C) = B ),
    file(unknown,unknown) ).

tff(f_63,axiom,
    top_str(sK2_t51_tops_1_A) = true,
    file(unknown,unknown) ).

tff(f_64,axiom,
    topological_space(sK2_t51_tops_1_A) = true,
    file(unknown,unknown) ).

tff(f_65,axiom,
    element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A))) = true,
    file(unknown,unknown) ).

tff(f_39,axiom,
    ! [B,A] : ( ifeq(element(B,powerset(A)),true,element(subset_complement(A,B),powerset(A)),true) = true ),
    file(unknown,unknown) ).

tff(f_43,axiom,
    ! [B,A] : ( ifeq(element(B,powerset(the_carrier(A))),true,ifeq(topological_space(A),true,ifeq(top_str(A),true,closed_subset(topstr_closure(A,B),A),true),true),true) = true ),
    file(unknown,unknown) ).

tff(f_24,axiom,
    ! [A,B,C] : ( ifeq2(A,A,B,C) = B ),
    file(unknown,unknown) ).

tff(f_62,axiom,
    ! [B,A] : ( ifeq2(element(B,powerset(the_carrier(A))),true,ifeq2(top_str(A),true,subset_complement(the_carrier(A),topstr_closure(A,subset_complement(the_carrier(A),B))),interior(A,B)),interior(A,B)) = interior(A,B) ),
    file(unknown,unknown) ).

tff(f_41,axiom,
    ! [B,A] : ( ifeq(element(B,powerset(the_carrier(A))),true,ifeq(top_str(A),true,element(topstr_closure(A,B),powerset(the_carrier(A))),true),true) = true ),
    file(unknown,unknown) ).

tff(f_28,axiom,
    ! [B,A] : ( ifeq(element(B,powerset(the_carrier(A))),true,ifeq(closed_subset(B,A),true,ifeq(topological_space(A),true,ifeq(top_str(A),true,open_subset(subset_complement(the_carrier(A),B),A),true),true),true),true) = true ),
    file(unknown,unknown) ).

tff(c_50,plain,
    open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A) != true,
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_4,plain,
    ! [A_4,B_5,C_6] : ( ifeq(A_4,A_4,B_5,C_6) = B_5 ),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_44,plain,
    top_str(sK2_t51_tops_1_A) = true,
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_46,plain,
    topological_space(sK2_t51_tops_1_A) = true,
    inference(cnfTransformation,[status(thm)],[f_64]) ).

tff(c_48,plain,
    element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A))) = true,
    inference(cnfTransformation,[status(thm)],[f_65]) ).

tff(c_289,plain,
    ! [B_52,A_53] : ( ifeq(element(B_52,powerset(A_53)),true,element(subset_complement(A_53,B_52),powerset(A_53)),true) = true ),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_299,plain,
    ifeq(true,true,element(subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B),powerset(the_carrier(sK2_t51_tops_1_A))),true) = true,
    inference(superposition,[status(thm),theory(equality)],[c_48,c_289]) ).

tff(c_1848,plain,
    element(subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B),powerset(the_carrier(sK2_t51_tops_1_A))) = true,
    inference(superposition,[status(thm),theory(equality)],[c_299,c_4]) ).

tff(c_22,plain,
    ! [B_18,A_19] : ( ifeq(element(B_18,powerset(the_carrier(A_19))),true,ifeq(topological_space(A_19),true,ifeq(top_str(A_19),true,closed_subset(topstr_closure(A_19,B_18),A_19),true),true),true) = true ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_1869,plain,
    ifeq(true,true,ifeq(topological_space(sK2_t51_tops_1_A),true,ifeq(top_str(sK2_t51_tops_1_A),true,closed_subset(topstr_closure(sK2_t51_tops_1_A,subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B)),sK2_t51_tops_1_A),true),true),true) = true,
    inference(superposition,[status(thm),theory(equality)],[c_1848,c_22]) ).

tff(c_1896,plain,
    closed_subset(topstr_closure(sK2_t51_tops_1_A,subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B)),sK2_t51_tops_1_A) = true,
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_4,c_4,c_44,c_46,c_1869]) ).

tff(c_2,plain,
    ! [A_1,B_2,C_3] : ( ifeq2(A_1,A_1,B_2,C_3) = B_2 ),
    inference(cnfTransformation,[status(thm)],[f_24]) ).

tff(c_894,plain,
    ! [B_68,A_69] : ( ifeq2(element(B_68,powerset(the_carrier(A_69))),true,ifeq2(top_str(A_69),true,subset_complement(the_carrier(A_69),topstr_closure(A_69,subset_complement(the_carrier(A_69),B_68))),interior(A_69,B_68)),interior(A_69,B_68)) = interior(A_69,B_68) ),
    inference(cnfTransformation,[status(thm)],[f_62]) ).

tff(c_935,plain,
    ifeq2(true,true,ifeq2(top_str(sK2_t51_tops_1_A),true,subset_complement(the_carrier(sK2_t51_tops_1_A),topstr_closure(sK2_t51_tops_1_A,subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B))),interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B)),interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B)) = interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),
    inference(superposition,[status(thm),theory(equality)],[c_48,c_894]) ).

tff(c_956,plain,
    subset_complement(the_carrier(sK2_t51_tops_1_A),topstr_closure(sK2_t51_tops_1_A,subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B))) = interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_44,c_935]) ).

tff(c_20,plain,
    ! [B_16,A_17] : ( ifeq(element(B_16,powerset(the_carrier(A_17))),true,ifeq(top_str(A_17),true,element(topstr_closure(A_17,B_16),powerset(the_carrier(A_17))),true),true) = true ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_1875,plain,
    ifeq(true,true,ifeq(top_str(sK2_t51_tops_1_A),true,element(topstr_closure(sK2_t51_tops_1_A,subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B)),powerset(the_carrier(sK2_t51_tops_1_A))),true),true) = true,
    inference(superposition,[status(thm),theory(equality)],[c_1848,c_20]) ).

tff(c_1898,plain,
    element(topstr_closure(sK2_t51_tops_1_A,subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B)),powerset(the_carrier(sK2_t51_tops_1_A))) = true,
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_4,c_44,c_1875]) ).

tff(c_6,plain,
    ! [B_7,A_8] : ( ifeq(element(B_7,powerset(the_carrier(A_8))),true,ifeq(closed_subset(B_7,A_8),true,ifeq(topological_space(A_8),true,ifeq(top_str(A_8),true,open_subset(subset_complement(the_carrier(A_8),B_7),A_8),true),true),true),true) = true ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_2197,plain,
    ifeq(true,true,ifeq(closed_subset(topstr_closure(sK2_t51_tops_1_A,subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B)),sK2_t51_tops_1_A),true,ifeq(topological_space(sK2_t51_tops_1_A),true,ifeq(top_str(sK2_t51_tops_1_A),true,open_subset(subset_complement(the_carrier(sK2_t51_tops_1_A),topstr_closure(sK2_t51_tops_1_A,subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B))),sK2_t51_tops_1_A),true),true),true),true) = true,
    inference(superposition,[status(thm),theory(equality)],[c_1898,c_6]) ).

tff(c_2230,plain,
    open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A) = true,
    inference(demodulation,[status(thm),theory(equality)],[c_4,c_1896,c_956,c_4,c_4,c_4,c_44,c_46,c_2197]) ).

tff(c_2232,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_50,c_2230]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SEU323-10 : TPTP v8.1.2. Released v7.3.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.36  % Computer : n020.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu Aug  3 11:51:22 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 5.23/2.31  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.23/2.32  
% 5.23/2.32  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.69/2.35  
% 5.69/2.35  Inference rules
% 5.69/2.35  ----------------------
% 5.69/2.35  #Ref     : 0
% 5.69/2.35  #Sup     : 642
% 5.69/2.35  #Fact    : 0
% 5.69/2.35  #Define  : 0
% 5.69/2.35  #Split   : 0
% 5.69/2.35  #Chain   : 0
% 5.69/2.35  #Close   : 0
% 5.69/2.35  
% 5.69/2.35  Ordering : KBO
% 5.69/2.35  
% 5.69/2.35  Simplification rules
% 5.69/2.35  ----------------------
% 5.69/2.35  #Subsume      : 0
% 5.69/2.35  #Demod        : 1092
% 5.69/2.35  #Tautology    : 344
% 5.69/2.35  #SimpNegUnit  : 1
% 5.69/2.35  #BackRed      : 21
% 5.69/2.35  
% 5.69/2.35  #Partial instantiations: 0
% 5.69/2.35  #Strategies tried      : 1
% 5.69/2.35  
% 5.69/2.35  Timing (in seconds)
% 5.69/2.35  ----------------------
% 5.69/2.35  Preprocessing        : 0.51
% 5.69/2.35  Parsing              : 0.28
% 5.69/2.35  CNF conversion       : 0.02
% 5.69/2.35  Main loop            : 0.77
% 5.69/2.35  Inferencing          : 0.23
% 5.69/2.35  Reduction            : 0.34
% 5.69/2.35  Demodulation         : 0.28
% 5.69/2.35  BG Simplification    : 0.03
% 5.69/2.35  Subsumption          : 0.13
% 5.69/2.35  Abstraction          : 0.03
% 5.69/2.35  MUC search           : 0.00
% 5.69/2.35  Cooper               : 0.00
% 5.69/2.35  Total                : 1.33
% 5.69/2.35  Index Insertion      : 0.00
% 5.69/2.35  Index Deletion       : 0.00
% 5.69/2.35  Index Matching       : 0.00
% 5.69/2.35  BG Taut test         : 0.00
%------------------------------------------------------------------------------