↑ Up

EQP---0.9e.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : EQP---0.9e
% Problem  : SEU323-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_eqp %s

% Computer : n029.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  : 600s
% DateTime : Tue Jul 19 08:55:51 EDT 2022

% Result   : Unsatisfiable 0.74s 1.19s
% Output   : Refutation 0.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   17 (  17 unt;   0 nHn;  10 RR)
%            Number of literals    :   17 (   0 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   3 con; 0-4 aty)
%            Number of variables   :   16 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,plain,
    equal(ifeq2(A,A,B,C),B),
    file('SEU323-10.p',unknown),
    [] ).

cnf(2,plain,
    equal(ifeq(A,A,B,C),B),
    file('SEU323-10.p',unknown),
    [] ).

cnf(3,plain,
    equal(ifeq(element(A,powerset(the_carrier(B))),true,ifeq(closed_subset(A,B),true,ifeq(topological_space(B),true,ifeq(top_str(B),true,open_subset(subset_complement(the_carrier(B),A),B),true),true),true),true),true),
    file('SEU323-10.p',unknown),
    [] ).

cnf(9,plain,
    equal(ifeq(element(A,powerset(B)),true,element(subset_complement(B,A),powerset(B)),true),true),
    file('SEU323-10.p',unknown),
    [] ).

cnf(10,plain,
    equal(ifeq(element(A,powerset(the_carrier(B))),true,ifeq(top_str(B),true,element(topstr_closure(B,A),powerset(the_carrier(B))),true),true),true),
    file('SEU323-10.p',unknown),
    [] ).

cnf(11,plain,
    equal(ifeq(element(A,powerset(the_carrier(B))),true,ifeq(topological_space(B),true,ifeq(top_str(B),true,closed_subset(topstr_closure(B,A),B),true),true),true),true),
    file('SEU323-10.p',unknown),
    [] ).

cnf(21,plain,
    equal(ifeq2(element(A,powerset(the_carrier(B))),true,ifeq2(top_str(B),true,subset_complement(the_carrier(B),topstr_closure(B,subset_complement(the_carrier(B),A))),interior(B,A)),interior(B,A)),interior(B,A)),
    file('SEU323-10.p',unknown),
    [] ).

cnf(22,plain,
    equal(top_str(sK2_t51_tops_1_A),true),
    file('SEU323-10.p',unknown),
    [] ).

cnf(23,plain,
    equal(topological_space(sK2_t51_tops_1_A),true),
    file('SEU323-10.p',unknown),
    [] ).

cnf(24,plain,
    equal(element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A))),true),
    file('SEU323-10.p',unknown),
    [] ).

cnf(25,plain,
    ~ equal(open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A),true),
    file('SEU323-10.p',unknown),
    [] ).

cnf(66,plain,
    equal(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(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[24,9]),2]),
    [iquote('para(24,9),demod([2])')] ).

cnf(80,plain,
    equal(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(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[24,21]),22,1,1]),
    [iquote('para(24,21),demod([22,1,1])')] ).

cnf(220,plain,
    equal(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(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[66,10]),22,2,2]),
    [iquote('para(66,10),demod([22,2,2])')] ).

cnf(221,plain,
    equal(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(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[66,11]),23,22,2,2,2]),
    [iquote('para(66,11),demod([23,22,2,2,2])')] ).

cnf(283,plain,
    equal(open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[80,3]),220,221,23,22,2,2,2,2]),
    [iquote('para(80,3),demod([220,221,23,22,2,2,2,2])')] ).

cnf(284,plain,
    $false,
    inference(conflict,[status(thm)],[283,25]),
    [iquote('conflict(283,25)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU323-10 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.12  % Command  : tptp2X_and_run_eqp %s
% 0.12/0.34  % Computer : n029.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jun 19 18:58:30 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.71/1.08  ----- EQP 0.9e, May 2009 -----
% 0.71/1.08  The job began on n029.cluster.edu, Sun Jun 19 18:58:30 2022
% 0.71/1.08  The command was "./eqp09e".
% 0.71/1.08  
% 0.71/1.08  set(prolog_style_variables).
% 0.71/1.08  set(lrpo).
% 0.71/1.08  set(basic_paramod).
% 0.71/1.08  set(functional_subsume).
% 0.71/1.08  set(ordered_paramod).
% 0.71/1.08  set(prime_paramod).
% 0.71/1.08  set(para_pairs).
% 0.71/1.08  assign(pick_given_ratio,4).
% 0.71/1.08  clear(print_kept).
% 0.71/1.08  clear(print_new_demod).
% 0.71/1.08  clear(print_back_demod).
% 0.71/1.08  clear(print_given).
% 0.71/1.08  assign(max_mem,64000).
% 0.71/1.08  end_of_commands.
% 0.71/1.08  
% 0.71/1.08  Usable:
% 0.71/1.08  end_of_list.
% 0.71/1.08  
% 0.71/1.08  Sos:
% 0.71/1.08  0 (wt=-1) [] ifeq2(A,A,B,C) = B.
% 0.71/1.08  0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 0.71/1.08  0 (wt=-1) [] ifeq(element(A,powerset(the_carrier(B))),true,ifeq(closed_subset(A,B),true,ifeq(topological_space(B),true,ifeq(top_str(B),true,open_subset(subset_complement(the_carrier(B),A),B),true),true),true),true) = true.
% 0.71/1.08  0 (wt=-1) [] ifeq(topological_space(A),true,ifeq(top_str(A),true,element(sK7_rc6_pre_topc_B(A),powerset(the_carrier(A))),true),true) = true.
% 0.71/1.08  0 (wt=-1) [] ifeq(topological_space(A),true,ifeq(top_str(A),true,closed_subset(sK7_rc6_pre_topc_B(A),A),true),true) = true.
% 0.71/1.08  0 (wt=-1) [] ifeq2(element(A,powerset(B)),true,subset_complement(B,subset_complement(B,A)),A) = A.
% 0.71/1.08  0 (wt=-1) [] subset(A,A) = true.
% 0.71/1.08  0 (wt=-1) [] one_sorted_str(sK6_existence_l1_struct_0_A) = true.
% 0.71/1.08  0 (wt=-1) [] ifeq(element(A,powerset(B)),true,element(subset_complement(B,A),powerset(B)),true) = true.
% 0.71/1.08  0 (wt=-1) [] ifeq(element(A,powerset(the_carrier(B))),true,ifeq(top_str(B),true,element(topstr_closure(B,A),powerset(the_carrier(B))),true),true) = true.
% 0.71/1.08  0 (wt=-1) [] ifeq(element(A,powerset(the_carrier(B))),true,ifeq(topological_space(B),true,ifeq(top_str(B),true,closed_subset(topstr_closure(B,A),B),true),true),true) = true.
% 0.71/1.08  0 (wt=-1) [] ifeq(open_subset(A,B),true,ifeq(element(A,powerset(the_carrier(B))),true,ifeq(topological_space(B),true,ifeq(top_str(B),true,closed_subset(subset_complement(the_carrier(B),A),B),true),true),true),true) = true.
% 0.71/1.08  0 (wt=-1) [] top_str(sK5_existence_l1_pre_topc_A) = true.
% 0.71/1.08  0 (wt=-1) [] element(sK4_existence_m1_subset_1_B(A),A) = true.
% 0.71/1.08  0 (wt=-1) [] ifeq(element(A,powerset(the_carrier(B))),true,ifeq(top_str(B),true,element(interior(B,A),powerset(the_carrier(B))),true),true) = true.
% 0.71/1.08  0 (wt=-1) [] ifeq(top_str(A),true,one_sorted_str(A),true) = true.
% 0.71/1.08  0 (wt=-1) [] ifeq(topological_space(A),true,ifeq(top_str(A),true,open_subset(sK3_rc1_tops_1_B(A),A),true),true) = true.
% 0.71/1.08  0 (wt=-1) [] ifeq(topological_space(A),true,ifeq(top_str(A),true,element(sK3_rc1_tops_1_B(A),powerset(the_carrier(A))),true),true) = true.
% 0.71/1.08  0 (wt=-1) [] ifeq(subset(A,B),true,element(A,powerset(B)),true) = true.
% 0.71/1.08  0 (wt=-1) [] ifeq(element(A,powerset(B)),true,subset(A,B),true) = true.
% 0.71/1.08  0 (wt=-1) [] ifeq2(element(A,powerset(the_carrier(B))),true,ifeq2(top_str(B),true,subset_complement(the_carrier(B),topstr_closure(B,subset_complement(the_carrier(B),A))),interior(B,A)),interior(B,A)) = interior(B,A).
% 0.71/1.08  0 (wt=-1) [] top_str(sK2_t51_tops_1_A) = true.
% 0.71/1.08  0 (wt=-1) [] topological_space(sK2_t51_tops_1_A) = true.
% 0.71/1.08  0 (wt=-1) [] element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A))) = true.
% 0.71/1.08  0 (wt=-1) [] -(open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A) = true).
% 0.71/1.08  end_of_list.
% 0.71/1.08  
% 0.71/1.08  Demodulators:
% 0.71/1.08  end_of_list.
% 0.71/1.08  
% 0.71/1.08  Passive:
% 0.71/1.08  end_of_list.
% 0.71/1.08  
% 0.71/1.08  Starting to process input.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.71/1.08  1 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.71/1.08  2 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 3 (wt=32) [] ifeq(element(A,powerset(the_carrier(B))),true,ifeq(closed_subset(A,B),true,ifeq(topological_space(B),true,ifeq(top_str(B),true,open_subset(subset_complement(the_carrier(B),A),B),true),true),true),true) = true.
% 0.71/1.08  3 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 4 (wt=18) [] ifeq(topological_space(A),true,ifeq(top_str(A),true,element(sK7_rc6_pre_topc_B(A),powerset(the_carrier(A))),true),true) = true.
% 0.71/1.08  4 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 5 (wt=16) [] ifeq(topological_space(A),true,ifeq(top_str(A),true,closed_subset(sK7_rc6_pre_topc_B(A),A),true),true) = true.
% 0.71/1.08  5 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 6 (wt=14) [] ifeq2(element(A,powerset(B)),true,subset_complement(B,subset_complement(B,A)),A) = A.
% 0.71/1.08  6 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 7 (wt=5) [] subset(A,A) = true.
% 0.71/1.08  7 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 8 (wt=4) [] one_sorted_str(sK6_existence_l1_struct_0_A) = true.
% 0.71/1.08  8 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 9 (wt=15) [] ifeq(element(A,powerset(B)),true,element(subset_complement(B,A),powerset(B)),true) = true.
% 0.71/1.08  9 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 10 (wt=22) [] ifeq(element(A,powerset(the_carrier(B))),true,ifeq(top_str(B),true,element(topstr_closure(B,A),powerset(the_carrier(B))),true),true) = true.
% 0.71/1.08  10 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 11 (wt=25) [] ifeq(element(A,powerset(the_carrier(B))),true,ifeq(topological_space(B),true,ifeq(top_str(B),true,closed_subset(topstr_closure(B,A),B),true),true),true) = true.
% 0.71/1.08  11 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 12 (wt=32) [] ifeq(open_subset(A,B),true,ifeq(element(A,powerset(the_carrier(B))),true,ifeq(topological_space(B),true,ifeq(top_str(B),true,closed_subset(subset_complement(the_carrier(B),A),B),true),true),true),true) = true.
% 0.71/1.08  12 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 13 (wt=4) [] top_str(sK5_existence_l1_pre_topc_A) = true.
% 0.71/1.08  13 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 14 (wt=6) [] element(sK4_existence_m1_subset_1_B(A),A) = true.
% 0.71/1.08  14 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 15 (wt=22) [] ifeq(element(A,powerset(the_carrier(B))),true,ifeq(top_str(B),true,element(interior(B,A),powerset(the_carrier(B))),true),true) = true.
% 0.71/1.08  15 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 16 (wt=9) [] ifeq(top_str(A),true,one_sorted_str(A),true) = true.
% 0.71/1.08  16 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 17 (wt=16) [] ifeq(topological_space(A),true,ifeq(top_str(A),true,open_subset(sK3_rc1_tops_1_B(A),A),true),true) = true.
% 0.71/1.08  17 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 18 (wt=18) [] ifeq(topological_space(A),true,ifeq(top_str(A),true,element(sK3_rc1_tops_1_B(A),powerset(the_carrier(A))),true),true) = true.
% 0.71/1.08  18 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 19 (wt=12) [] ifeq(subset(A,B),true,element(A,powerset(B)),true) = true.
% 0.71/1.08  19 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 20 (wt=12) [] ifeq(element(A,powerset(B)),true,subset(A,B),true) = true.
% 0.71/1.08  20 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 21 (wt=30) [] ifeq2(element(A,powerset(the_carrier(B))),true,ifeq2(top_str(B),true,subset_complement(the_carrier(B),topstr_closure(B,subset_complement(the_carrier(B),A))),interior(B,A)),interior(B,A)) = interior(B,A).
% 0.71/1.08  21 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 22 (wt=4) [] top_str(sK2_t51_tops_1_A) = true.
% 0.71/1.08  22 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 23 (wt=4) [] topological_space(sK2_t51_tops_1_A) = true.
% 0.71/1.08  23 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 24 (wt=7) [] element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A))) = true.
% 0.71/1.08  24 is a new demodulator.
% 0.71/1.08  
% 0.71/1.08  ** KEPT: 25 (wt=7) [] -(open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A) = true).
% 0.71/1.08  
% 0.71/1.08  After processing input:
% 0.71/1.08  
% 0.71/1.08  Usable:
% 0.71/1.08  end_of_list.
% 0.71/1.08  
% 0.71/1.08  Sos:
% 0.71/1.08  8 (wt=4) [] one_sorted_str(sK6_existence_l1_struct_0_A) = true.
% 0.71/1.08  13 (wt=4) [] top_str(sK5_existence_l1_pre_topc_A) = true.
% 0.71/1.08  22 (wt=4) [] top_str(sK2_t51_tops_1_A) = true.
% 0.71/1.08  23 (wt=4) [] topological_space(sK2_t51_tops_1_A) = true.
% 0.71/1.08  7 (wt=5) [] subset(A,A) = true.
% 0.71/1.08  14 (wt=6) [] element(sK4_existence_m1_subset_1_B(A),A) = true.
% 0.71/1.08  1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.71/1.08  2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.71/1.08  24 (wt=7) [] element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A))) = true.
% 0.71/1.08  25 (wt=7) [] -(open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A) = true).
% 0.71/1.08  16 (wt=9) [] ifeq(top_str(A),true,one_sorted_str(A),true) = true.
% 0.71/1.08  19 (wt=12) [] ifeq(subset(A,B),true,element(A,powerset(B)),true) = true.
% 0.71/1.08  20 (wt=12) [] ifeq(element(A,powerset(B)),true,subset(A,B),true) = true.
% 0.71/1.08  6 (wt=14) [] ifeq2(element(A,powerset(B)),true,subset_complement(B,subset_complement(B,A)),A) = A.
% 0.71/1.08  9 (wt=15) [] ifeq(element(A,powerset(B)),true,element(subset_complement(B,A),powerset(B)),true) = true.
% 0.71/1.08  5 (wt=16) [] ifeq(topological_space(A),true,ifeq(top_str(A),true,closed_subset(sK7_rc6_pre_topc_B(A),A),true),true) = true.
% 0.71/1.08  17 (wt=16) [] ifeq(topological_space(A),true,ifeq(top_str(A),true,open_subset(sK3_rc1_tops_1_B(A),A),true),true) = true.
% 0.71/1.08  4 (wt=18) [] ifeq(topological_space(A),true,ifeq(top_str(A),true,element(sK7_rc6_pre_topc_B(A),powerset(the_carrier(A))),true),true) = true.
% 0.71/1.08  18 (wt=18) [] ifeq(topological_space(A),true,ifeq(top_str(A),true,element(sK3_rc1_tops_1_B(A),powerset(the_carrier(A))),true),true) = true.
% 0.74/1.18  10 (wt=22) [] ifeq(element(A,powerset(the_carrier(B))),true,ifeq(top_str(B),true,element(topstr_closure(B,A),powerset(the_carrier(B))),true),true) = true.
% 0.74/1.18  15 (wt=22) [] ifeq(element(A,powerset(the_carrier(B))),true,ifeq(top_str(B),true,element(interior(B,A),powerset(the_carrier(B))),true),true) = true.
% 0.74/1.18  11 (wt=25) [] ifeq(element(A,powerset(the_carrier(B))),true,ifeq(topological_space(B),true,ifeq(top_str(B),true,closed_subset(topstr_closure(B,A),B),true),true),true) = true.
% 0.74/1.18  21 (wt=30) [] ifeq2(element(A,powerset(the_carrier(B))),true,ifeq2(top_str(B),true,subset_complement(the_carrier(B),topstr_closure(B,subset_complement(the_carrier(B),A))),interior(B,A)),interior(B,A)) = interior(B,A).
% 0.74/1.18  3 (wt=32) [] ifeq(element(A,powerset(the_carrier(B))),true,ifeq(closed_subset(A,B),true,ifeq(topological_space(B),true,ifeq(top_str(B),true,open_subset(subset_complement(the_carrier(B),A),B),true),true),true),true) = true.
% 0.74/1.18  12 (wt=32) [] ifeq(open_subset(A,B),true,ifeq(element(A,powerset(the_carrier(B))),true,ifeq(topological_space(B),true,ifeq(top_str(B),true,closed_subset(subset_complement(the_carrier(B),A),B),true),true),true),true) = true.
% 0.74/1.18  end_of_list.
% 0.74/1.18  
% 0.74/1.18  Demodulators:
% 0.74/1.18  1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.74/1.18  2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.74/1.18  3 (wt=32) [] ifeq(element(A,powerset(the_carrier(B))),true,ifeq(closed_subset(A,B),true,ifeq(topological_space(B),true,ifeq(top_str(B),true,open_subset(subset_complement(the_carrier(B),A),B),true),true),true),true) = true.
% 0.74/1.18  4 (wt=18) [] ifeq(topological_space(A),true,ifeq(top_str(A),true,element(sK7_rc6_pre_topc_B(A),powerset(the_carrier(A))),true),true) = true.
% 0.74/1.18  5 (wt=16) [] ifeq(topological_space(A),true,ifeq(top_str(A),true,closed_subset(sK7_rc6_pre_topc_B(A),A),true),true) = true.
% 0.74/1.18  6 (wt=14) [] ifeq2(element(A,powerset(B)),true,subset_complement(B,subset_complement(B,A)),A) = A.
% 0.74/1.18  7 (wt=5) [] subset(A,A) = true.
% 0.74/1.18  8 (wt=4) [] one_sorted_str(sK6_existence_l1_struct_0_A) = true.
% 0.74/1.18  9 (wt=15) [] ifeq(element(A,powerset(B)),true,element(subset_complement(B,A),powerset(B)),true) = true.
% 0.74/1.19  10 (wt=22) [] ifeq(element(A,powerset(the_carrier(B))),true,ifeq(top_str(B),true,element(topstr_closure(B,A),powerset(the_carrier(B))),true),true) = true.
% 0.74/1.19  11 (wt=25) [] ifeq(element(A,powerset(the_carrier(B))),true,ifeq(topological_space(B),true,ifeq(top_str(B),true,closed_subset(topstr_closure(B,A),B),true),true),true) = true.
% 0.74/1.19  12 (wt=32) [] ifeq(open_subset(A,B),true,ifeq(element(A,powerset(the_carrier(B))),true,ifeq(topological_space(B),true,ifeq(top_str(B),true,closed_subset(subset_complement(the_carrie---------------- PROOF FOUND ----------------
% 0.74/1.19  % SZS status Unsatisfiable
% 0.74/1.19  
% 0.74/1.19  r(B),A),B),true),true),true),true) = true.
% 0.74/1.19  13 (wt=4) [] top_str(sK5_existence_l1_pre_topc_A) = true.
% 0.74/1.19  14 (wt=6) [] element(sK4_existence_m1_subset_1_B(A),A) = true.
% 0.74/1.19  15 (wt=22) [] ifeq(element(A,powerset(the_carrier(B))),true,ifeq(top_str(B),true,element(interior(B,A),powerset(the_carrier(B))),true),true) = true.
% 0.74/1.19  16 (wt=9) [] ifeq(top_str(A),true,one_sorted_str(A),true) = true.
% 0.74/1.19  17 (wt=16) [] ifeq(topological_space(A),true,ifeq(top_str(A),true,open_subset(sK3_rc1_tops_1_B(A),A),true),true) = true.
% 0.74/1.19  18 (wt=18) [] ifeq(topological_space(A),true,ifeq(top_str(A),true,element(sK3_rc1_tops_1_B(A),powerset(the_carrier(A))),true),true) = true.
% 0.74/1.19  19 (wt=12) [] ifeq(subset(A,B),true,element(A,powerset(B)),true) = true.
% 0.74/1.19  20 (wt=12) [] ifeq(element(A,powerset(B)),true,subset(A,B),true) = true.
% 0.74/1.19  21 (wt=30) [] ifeq2(element(A,powerset(the_carrier(B))),true,ifeq2(top_str(B),true,subset_complement(the_carrier(B),topstr_closure(B,subset_complement(the_carrier(B),A))),interior(B,A)),interior(B,A)) = interior(B,A).
% 0.74/1.19  22 (wt=4) [] top_str(sK2_t51_tops_1_A) = true.
% 0.74/1.19  23 (wt=4) [] topological_space(sK2_t51_tops_1_A) = true.
% 0.74/1.19  24 (wt=7) [] element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A))) = true.
% 0.74/1.19  end_of_list.
% 0.74/1.19  
% 0.74/1.19  Passive:
% 0.74/1.19  end_of_list.
% 0.74/1.19  
% 0.74/1.19  UNIT CONFLICT from 283 and 25 at   0.03 seconds.
% 0.74/1.19  
% 0.74/1.19  ---------------- PROOF ----------------
% 0.74/1.19  % SZS output start Refutation
% See solution above
% 0.74/1.19  ------------ end of proof -------------
% 0.74/1.19  
% 0.74/1.19  
% 0.74/1.19  ------------- memory usage ------------
% 0.74/1.19  Memory dynamically allocated (tp_alloc): 488.
% 0.74/1.19    type (bytes each)        gets      frees     in use      avail      bytes
% 0.74/1.19  sym_ent (  96)               73          0         73          0      6.8 K
% 0.74/1.19  term (  16)               22042      17648       4394         37     85.4 K
% 0.74/1.19  gen_ptr (   8)            24291       4261      20030         16    156.6 K
% 0.74/1.19  context ( 808)           250901     250899          2          2      3.2 K
% 0.74/1.19  trail (  12)                105        105          0          3      0.0 K
% 0.74/1.19  bt_node (  68)           132891     132887          4         26      2.0 K
% 0.74/1.19  ac_position (285432)          0          0          0          0      0.0 K
% 0.74/1.19  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.74/1.19  ac_match_free_vars_pos (4020)
% 0.74/1.19                                0          0          0          0      0.0 K
% 0.74/1.19  discrim (  12)             5467       1168       4299          0     50.4 K
% 0.74/1.19  flat (  40)               26673      26673          0         28      1.1 K
% 0.74/1.19  discrim_pos (  12)         1095       1095          0          1      0.0 K
% 0.74/1.19  fpa_head (  12)            2909          0       2909          0     34.1 K
% 0.74/1.19  fpa_tree (  28)            2674       2674          0         27      0.7 K
% 0.74/1.19  fpa_pos (  36)              564        564          0          1      0.0 K
% 0.74/1.19  literal (  12)              939        656        283          1      3.3 K
% 0.74/1.19  clause (  24)               939        656        283          1      6.7 K
% 0.74/1.19  list (  12)                 340        284         56          3      0.7 K
% 0.74/1.19  list_pos (  20)            1266        307        959          0     18.7 K
% 0.74/1.19  pair_index (   40)              2          0          2          0      0.1 K
% 0.74/1.19  
% 0.74/1.19  -------------- statistics -------------
% 0.74/1.19  Clauses input                 25
% 0.74/1.19    Usable input                   0
% 0.74/1.19    Sos input                     25
% 0.74/1.19    Demodulators input             0
% 0.74/1.19    Passive input                  0
% 0.74/1.19  
% 0.74/1.19  Processed BS (before search)  25
% 0.74/1.19  Forward subsumed BS            0
% 0.74/1.19  Kept BS                       25
% 0.74/1.19  New demodulators BS           24
% 0.74/1.19  Back demodulated BS            0
% 0.74/1.19  
% 0.74/1.19  Clauses or pairs given      8655
% 0.74/1.19  Clauses generated            632
% 0.74/1.19  Forward subsumed             374
% 0.74/1.19  Deleted by weight              0
% 0.74/1.19  Deleted by variable count      0
% 0.74/1.19  Kept                         258
% 0.74/1.19  New demodulators             257
% 0.74/1.19  Back demodulated              56
% 0.74/1.19  Ordered paramod prunes         0
% 0.74/1.19  Basic paramod prunes        6433
% 0.74/1.19  Prime paramod prunes           0
% 0.74/1.19  Semantic prunes                0
% 0.74/1.19  
% 0.74/1.19  Rewrite attmepts           11441
% 0.74/1.19  Rewrites                    1095
% 0.74/1.19  
% 0.74/1.19  FPA overloads                  0
% 0.74/1.19  FPA underloads                 0
% 0.74/1.19  
% 0.74/1.19  Usable size                    0
% 0.74/1.19  Sos size                     226
% 0.74/1.19  Demodulators size            225
% 0.74/1.19  Passive size                   0
% 0.74/1.19  Disabled size                 56
% 0.74/1.19  
% 0.74/1.19  Proofs found                   1
% 0.74/1.19  
% 0.74/1.19  ----------- times (seconds) ----------- Sun Jun 19 18:58:30 2022
% 0.74/1.19  
% 0.74/1.19  user CPU time             0.03   (0 hr, 0 min, 0 sec)
% 0.74/1.19  system CPU time           0.07   (0 hr, 0 min, 0 sec)
% 0.74/1.19  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.74/1.19  input time                0.00
% 0.74/1.19  paramodulation time       0.01
% 0.74/1.19  demodulation time         0.00
% 0.74/1.19  orient time               0.00
% 0.74/1.19  weigh time                0.00
% 0.74/1.19  forward subsume time      0.00
% 0.74/1.19  back demod find time      0.00
% 0.74/1.19  conflict time             0.00
% 0.74/1.19  LRPO time                 0.00
% 0.74/1.19  store clause time         0.00
% 0.74/1.19  disable clause time       0.00
% 0.74/1.19  prime paramod time        0.00
% 0.74/1.19  semantics time            0.00
% 0.74/1.19  
% 0.74/1.19  EQP interrupted
%------------------------------------------------------------------------------