TSTP Solution File: SEU372+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU372+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n014.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 : Wed Jul 27 13:15:55 EDT 2022
% Result : Unknown 68.86s 69.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU372+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 07:39:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.99/2.15 ----- Otter 3.3f, August 2004 -----
% 1.99/2.15 The process was started by sandbox2 on n014.cluster.edu,
% 1.99/2.15 Wed Jul 27 07:39:39 2022
% 1.99/2.15 The command was "./otter". The process ID is 32708.
% 1.99/2.15
% 1.99/2.15 set(prolog_style_variables).
% 1.99/2.15 set(auto).
% 1.99/2.15 dependent: set(auto1).
% 1.99/2.15 dependent: set(process_input).
% 1.99/2.15 dependent: clear(print_kept).
% 1.99/2.15 dependent: clear(print_new_demod).
% 1.99/2.15 dependent: clear(print_back_demod).
% 1.99/2.15 dependent: clear(print_back_sub).
% 1.99/2.15 dependent: set(control_memory).
% 1.99/2.15 dependent: assign(max_mem, 12000).
% 1.99/2.15 dependent: assign(pick_given_ratio, 4).
% 1.99/2.15 dependent: assign(stats_level, 1).
% 1.99/2.15 dependent: assign(max_seconds, 10800).
% 1.99/2.15 clear(print_given).
% 1.99/2.15
% 1.99/2.15 formula_list(usable).
% 1.99/2.15 all A (A=A).
% 1.99/2.15 all A B (in(A,B)-> -in(B,A)).
% 1.99/2.15 all A (empty(A)->function(A)).
% 1.99/2.15 all A (empty(A)->relation(A)).
% 1.99/2.15 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.99/2.15 all A (top_str(A)-> (all B (element(B,powerset(the_carrier(A)))-> (all C (element(C,powerset(the_carrier(A)))-> (C=topstr_closure(A,B)<-> (all D (in(D,the_carrier(A))-> (in(D,C)<-> (all E (element(E,powerset(the_carrier(A)))-> -(open_subset(E,A)&in(D,E)&disjoint(B,E))))))))))))).
% 1.99/2.15 all A (-empty_carrier(A)&topological_space(A)&top_str(A)-> (all B (element(B,the_carrier(A))-> (all C (element(C,powerset(the_carrier(A)))-> (point_neighbourhood(C,A,B)<->in(B,interior(A,C)))))))).
% 1.99/2.15 all A B (top_str(A)&element(B,powerset(the_carrier(A)))->element(interior(A,B),powerset(the_carrier(A)))).
% 1.99/2.15 $T.
% 1.99/2.15 $T.
% 1.99/2.15 all A B (top_str(A)&element(B,powerset(the_carrier(A)))->element(topstr_closure(A,B),powerset(the_carrier(A)))).
% 1.99/2.15 all A (top_str(A)->one_sorted_str(A)).
% 1.99/2.15 $T.
% 1.99/2.15 all A B (-empty_carrier(A)&topological_space(A)&top_str(A)&element(B,the_carrier(A))-> (all C (point_neighbourhood(C,A,B)->element(C,powerset(the_carrier(A)))))).
% 1.99/2.15 $T.
% 1.99/2.15 $T.
% 1.99/2.15 exists A top_str(A).
% 1.99/2.15 exists A one_sorted_str(A).
% 1.99/2.15 all A B (-empty_carrier(A)&topological_space(A)&top_str(A)&element(B,the_carrier(A))-> (exists C point_neighbourhood(C,A,B))).
% 1.99/2.15 all A exists B element(B,A).
% 1.99/2.15 empty(empty_set).
% 1.99/2.15 relation(empty_set).
% 1.99/2.15 relation_empty_yielding(empty_set).
% 1.99/2.15 all A (-empty_carrier(A)&one_sorted_str(A)-> -empty(the_carrier(A))).
% 1.99/2.15 all A (-empty(powerset(A))).
% 1.99/2.15 empty(empty_set).
% 1.99/2.15 relation(empty_set).
% 1.99/2.15 exists A (relation(A)&function(A)).
% 1.99/2.15 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 1.99/2.15 exists A (empty(A)&relation(A)).
% 1.99/2.15 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.99/2.15 exists A (relation(A)&empty(A)&function(A)).
% 1.99/2.15 exists A (-empty(A)&relation(A)).
% 1.99/2.15 all A exists B (element(B,powerset(A))&empty(B)).
% 1.99/2.15 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.99/2.15 exists A (relation(A)&relation_empty_yielding(A)).
% 1.99/2.15 exists A (one_sorted_str(A)& -empty_carrier(A)).
% 1.99/2.15 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 1.99/2.15 all A (-empty_carrier(A)&one_sorted_str(A)-> (exists B (element(B,powerset(the_carrier(A)))& -empty(B)))).
% 1.99/2.15 all A B subset(A,A).
% 1.99/2.15 all A B (disjoint(A,B)->disjoint(B,A)).
% 1.99/2.15 all A B (in(A,B)->element(A,B)).
% 1.99/2.15 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.99/2.15 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.99/2.15 all A (top_str(A)-> (all B (element(B,powerset(the_carrier(A)))->subset(interior(A,B),B)))).
% 1.99/2.15 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.99/2.15 all A (topological_space(A)&top_str(A)-> (all B (element(B,powerset(the_carrier(A)))->open_subset(interior(A,B),A)))).
% 1.99/2.15 all A (-empty_carrier(A)&topological_space(A)&top_str(A)-> (all B (element(B,powerset(the_carrier(A)))-> (all C (element(C,the_carrier(A))-> (open_subset(B,A)&in(C,B)->point_neighbourhood(B,A,C))))))).
% 1.99/2.15 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.99/2.15 all A B C (subset(A,B)&disjoint(B,C)->disjoint(A,C)).
% 1.99/2.15 all A (empty(A)->A=empty_set).
% 1.99/2.15 -(all A (-empty_carrier(A)&topological_space(A)&top_str(A)-> (all B (element(B,powerset(the_carrier(A)))-> (all C (element(C,the_carrier(A))-> (in(C,topstr_closure(A,B))<-> (all D (point_neighbourhood(D,A,C)-> -disjoint(D,B)))))))))).
% 1.99/2.15 all A B (-(in(A,B)&empty(B))).
% 1.99/2.15 all A B (-(empty(A)&A!=B&empty(B))).
% 1.99/2.15 end_of_list.
% 1.99/2.15
% 1.99/2.15 -------> usable clausifies to:
% 1.99/2.15
% 1.99/2.15 list(usable).
% 1.99/2.15 0 [] A=A.
% 1.99/2.15 0 [] -in(A,B)| -in(B,A).
% 1.99/2.15 0 [] -empty(A)|function(A).
% 1.99/2.15 0 [] -empty(A)|relation(A).
% 1.99/2.15 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.99/2.15 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C!=topstr_closure(A,B)| -in(D,the_carrier(A))| -in(D,C)| -element(E,powerset(the_carrier(A)))| -open_subset(E,A)| -in(D,E)| -disjoint(B,E).
% 1.99/2.15 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C!=topstr_closure(A,B)| -in(D,the_carrier(A))|in(D,C)|element($f1(A,B,C,D),powerset(the_carrier(A))).
% 1.99/2.15 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C!=topstr_closure(A,B)| -in(D,the_carrier(A))|in(D,C)|open_subset($f1(A,B,C,D),A).
% 1.99/2.15 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C!=topstr_closure(A,B)| -in(D,the_carrier(A))|in(D,C)|in(D,$f1(A,B,C,D)).
% 1.99/2.15 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C!=topstr_closure(A,B)| -in(D,the_carrier(A))|in(D,C)|disjoint(B,$f1(A,B,C,D)).
% 1.99/2.15 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C=topstr_closure(A,B)|in($f3(A,B,C),the_carrier(A)).
% 1.99/2.15 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C=topstr_closure(A,B)|in($f3(A,B,C),C)| -element(X1,powerset(the_carrier(A)))| -open_subset(X1,A)| -in($f3(A,B,C),X1)| -disjoint(B,X1).
% 1.99/2.15 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C=topstr_closure(A,B)| -in($f3(A,B,C),C)|element($f2(A,B,C),powerset(the_carrier(A))).
% 1.99/2.15 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C=topstr_closure(A,B)| -in($f3(A,B,C),C)|open_subset($f2(A,B,C),A).
% 1.99/2.15 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C=topstr_closure(A,B)| -in($f3(A,B,C),C)|in($f3(A,B,C),$f2(A,B,C)).
% 1.99/2.15 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C=topstr_closure(A,B)| -in($f3(A,B,C),C)|disjoint(B,$f2(A,B,C)).
% 1.99/2.15 0 [] empty_carrier(A)| -topological_space(A)| -top_str(A)| -element(B,the_carrier(A))| -element(C,powerset(the_carrier(A)))| -point_neighbourhood(C,A,B)|in(B,interior(A,C)).
% 1.99/2.15 0 [] empty_carrier(A)| -topological_space(A)| -top_str(A)| -element(B,the_carrier(A))| -element(C,powerset(the_carrier(A)))|point_neighbourhood(C,A,B)| -in(B,interior(A,C)).
% 1.99/2.15 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))|element(interior(A,B),powerset(the_carrier(A))).
% 1.99/2.15 0 [] $T.
% 1.99/2.15 0 [] $T.
% 1.99/2.15 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))|element(topstr_closure(A,B),powerset(the_carrier(A))).
% 1.99/2.15 0 [] -top_str(A)|one_sorted_str(A).
% 1.99/2.15 0 [] $T.
% 1.99/2.15 0 [] empty_carrier(A)| -topological_space(A)| -top_str(A)| -element(B,the_carrier(A))| -point_neighbourhood(C,A,B)|element(C,powerset(the_carrier(A))).
% 1.99/2.15 0 [] $T.
% 1.99/2.15 0 [] $T.
% 1.99/2.15 0 [] top_str($c1).
% 1.99/2.15 0 [] one_sorted_str($c2).
% 1.99/2.15 0 [] empty_carrier(A)| -topological_space(A)| -top_str(A)| -element(B,the_carrier(A))|point_neighbourhood($f4(A,B),A,B).
% 1.99/2.15 0 [] element($f5(A),A).
% 1.99/2.15 0 [] empty(empty_set).
% 1.99/2.15 0 [] relation(empty_set).
% 1.99/2.15 0 [] relation_empty_yielding(empty_set).
% 1.99/2.15 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 1.99/2.15 0 [] -empty(powerset(A)).
% 1.99/2.15 0 [] empty(empty_set).
% 1.99/2.15 0 [] relation(empty_set).
% 1.99/2.15 0 [] relation($c3).
% 1.99/2.15 0 [] function($c3).
% 1.99/2.15 0 [] relation($c4).
% 1.99/2.15 0 [] relation_empty_yielding($c4).
% 1.99/2.15 0 [] function($c4).
% 1.99/2.15 0 [] empty($c5).
% 1.99/2.15 0 [] relation($c5).
% 1.99/2.15 0 [] empty(A)|element($f6(A),powerset(A)).
% 1.99/2.15 0 [] empty(A)| -empty($f6(A)).
% 1.99/2.15 0 [] relation($c6).
% 1.99/2.15 0 [] empty($c6).
% 1.99/2.15 0 [] function($c6).
% 1.99/2.15 0 [] -empty($c7).
% 1.99/2.15 0 [] relation($c7).
% 1.99/2.15 0 [] element($f7(A),powerset(A)).
% 1.99/2.15 0 [] empty($f7(A)).
% 1.99/2.15 0 [] relation($c8).
% 1.99/2.15 0 [] function($c8).
% 1.99/2.15 0 [] one_to_one($c8).
% 1.99/2.15 0 [] relation($c9).
% 1.99/2.15 0 [] relation_empty_yielding($c9).
% 1.99/2.15 0 [] one_sorted_str($c10).
% 1.99/2.15 0 [] -empty_carrier($c10).
% 1.99/2.15 0 [] relation($c11).
% 1.99/2.15 0 [] relation_empty_yielding($c11).
% 1.99/2.15 0 [] function($c11).
% 1.99/2.15 0 [] empty_carrier(A)| -one_sorted_str(A)|element($f8(A),powerset(the_carrier(A))).
% 1.99/2.15 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty($f8(A)).
% 1.99/2.15 0 [] subset(A,A).
% 1.99/2.15 0 [] -disjoint(A,B)|disjoint(B,A).
% 1.99/2.15 0 [] -in(A,B)|element(A,B).
% 1.99/2.15 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.99/2.16 0 [] -element(A,powerset(B))|subset(A,B).
% 1.99/2.16 0 [] element(A,powerset(B))| -subset(A,B).
% 1.99/2.16 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))|subset(interior(A,B),B).
% 1.99/2.16 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.99/2.16 0 [] -topological_space(A)| -top_str(A)| -element(B,powerset(the_carrier(A)))|open_subset(interior(A,B),A).
% 1.99/2.16 0 [] empty_carrier(A)| -topological_space(A)| -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,the_carrier(A))| -open_subset(B,A)| -in(C,B)|point_neighbourhood(B,A,C).
% 1.99/2.16 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.99/2.16 0 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 1.99/2.16 0 [] -empty(A)|A=empty_set.
% 1.99/2.16 0 [] -empty_carrier($c15).
% 1.99/2.16 0 [] topological_space($c15).
% 1.99/2.16 0 [] top_str($c15).
% 1.99/2.16 0 [] element($c14,powerset(the_carrier($c15))).
% 1.99/2.16 0 [] element($c13,the_carrier($c15)).
% 1.99/2.16 0 [] in($c13,topstr_closure($c15,$c14))| -point_neighbourhood(D,$c15,$c13)| -disjoint(D,$c14).
% 1.99/2.16 0 [] -in($c13,topstr_closure($c15,$c14))|point_neighbourhood($c12,$c15,$c13).
% 1.99/2.16 0 [] -in($c13,topstr_closure($c15,$c14))|disjoint($c12,$c14).
% 1.99/2.16 0 [] -in(A,B)| -empty(B).
% 1.99/2.16 0 [] -empty(A)|A=B| -empty(B).
% 1.99/2.16 end_of_list.
% 1.99/2.16
% 1.99/2.16 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 1.99/2.16
% 1.99/2.16 This ia a non-Horn set with equality. The strategy will be
% 1.99/2.16 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.99/2.16 deletion, with positive clauses in sos and nonpositive
% 1.99/2.16 clauses in usable.
% 1.99/2.16
% 1.99/2.16 dependent: set(knuth_bendix).
% 1.99/2.16 dependent: set(anl_eq).
% 1.99/2.16 dependent: set(para_from).
% 1.99/2.16 dependent: set(para_into).
% 1.99/2.16 dependent: clear(para_from_right).
% 1.99/2.16 dependent: clear(para_into_right).
% 1.99/2.16 dependent: set(para_from_vars).
% 1.99/2.16 dependent: set(eq_units_both_ways).
% 1.99/2.16 dependent: set(dynamic_demod_all).
% 1.99/2.16 dependent: set(dynamic_demod).
% 1.99/2.16 dependent: set(order_eq).
% 1.99/2.16 dependent: set(back_demod).
% 1.99/2.16 dependent: set(lrpo).
% 1.99/2.16 dependent: set(hyper_res).
% 1.99/2.16 dependent: set(unit_deletion).
% 1.99/2.16 dependent: set(factor).
% 1.99/2.16
% 1.99/2.16 ------------> process usable:
% 1.99/2.16 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.99/2.16 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.99/2.16 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 1.99/2.16 ** KEPT (pick-wt=8): 4 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.99/2.16 ** KEPT (pick-wt=38): 5 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C!=topstr_closure(A,B)| -in(D,the_carrier(A))| -in(D,C)| -element(E,powerset(the_carrier(A)))| -open_subset(E,A)| -in(D,E)| -disjoint(B,E).
% 1.99/2.16 ** KEPT (pick-wt=33): 6 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C!=topstr_closure(A,B)| -in(D,the_carrier(A))|in(D,C)|element($f1(A,B,C,D),powerset(the_carrier(A))).
% 1.99/2.16 ** KEPT (pick-wt=31): 7 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C!=topstr_closure(A,B)| -in(D,the_carrier(A))|in(D,C)|open_subset($f1(A,B,C,D),A).
% 1.99/2.16 ** KEPT (pick-wt=31): 8 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C!=topstr_closure(A,B)| -in(D,the_carrier(A))|in(D,C)|in(D,$f1(A,B,C,D)).
% 1.99/2.16 ** KEPT (pick-wt=31): 9 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C!=topstr_closure(A,B)| -in(D,the_carrier(A))|in(D,C)|disjoint(B,$f1(A,B,C,D)).
% 1.99/2.16 ** KEPT (pick-wt=24): 10 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C=topstr_closure(A,B)|in($f3(A,B,C),the_carrier(A)).
% 1.99/2.16 ** KEPT (pick-wt=40): 11 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C=topstr_closure(A,B)|in($f3(A,B,C),C)| -element(D,powerset(the_carrier(A)))| -open_subset(D,A)| -in($f3(A,B,C),D)| -disjoint(B,D).
% 1.99/2.16 ** KEPT (pick-wt=31): 12 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C=topstr_closure(A,B)| -in($f3(A,B,C),C)|element($f2(A,B,C),powerset(the_carrier(A))).
% 1.99/2.16 ** KEPT (pick-wt=29): 13 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C=topstr_closure(A,B)| -in($f3(A,B,C),C)|open_subset($f2(A,B,C),A).
% 1.99/2.16 ** KEPT (pick-wt=32): 14 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C=topstr_closure(A,B)| -in($f3(A,B,C),C)|in($f3(A,B,C),$f2(A,B,C)).
% 1.99/2.16 ** KEPT (pick-wt=29): 15 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,powerset(the_carrier(A)))|C=topstr_closure(A,B)| -in($f3(A,B,C),C)|disjoint(B,$f2(A,B,C)).
% 1.99/2.16 ** KEPT (pick-wt=24): 16 [] empty_carrier(A)| -topological_space(A)| -top_str(A)| -element(B,the_carrier(A))| -element(C,powerset(the_carrier(A)))| -point_neighbourhood(C,A,B)|in(B,interior(A,C)).
% 1.99/2.16 ** KEPT (pick-wt=24): 17 [] empty_carrier(A)| -topological_space(A)| -top_str(A)| -element(B,the_carrier(A))| -element(C,powerset(the_carrier(A)))|point_neighbourhood(C,A,B)| -in(B,interior(A,C)).
% 1.99/2.16 ** KEPT (pick-wt=14): 18 [] -top_str(A)| -element(B,powerset(the_carrier(A)))|element(interior(A,B),powerset(the_carrier(A))).
% 1.99/2.16 ** KEPT (pick-wt=14): 19 [] -top_str(A)| -element(B,powerset(the_carrier(A)))|element(topstr_closure(A,B),powerset(the_carrier(A))).
% 1.99/2.16 ** KEPT (pick-wt=4): 20 [] -top_str(A)|one_sorted_str(A).
% 1.99/2.16 ** KEPT (pick-wt=19): 21 [] empty_carrier(A)| -topological_space(A)| -top_str(A)| -element(B,the_carrier(A))| -point_neighbourhood(C,A,B)|element(C,powerset(the_carrier(A))).
% 1.99/2.16 ** KEPT (pick-wt=16): 22 [] empty_carrier(A)| -topological_space(A)| -top_str(A)| -element(B,the_carrier(A))|point_neighbourhood($f4(A,B),A,B).
% 1.99/2.16 ** KEPT (pick-wt=7): 23 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 1.99/2.16 ** KEPT (pick-wt=3): 24 [] -empty(powerset(A)).
% 1.99/2.16 ** KEPT (pick-wt=5): 25 [] empty(A)| -empty($f6(A)).
% 1.99/2.16 ** KEPT (pick-wt=2): 26 [] -empty($c7).
% 1.99/2.16 ** KEPT (pick-wt=2): 27 [] -empty_carrier($c10).
% 1.99/2.16 ** KEPT (pick-wt=10): 28 [] empty_carrier(A)| -one_sorted_str(A)|element($f8(A),powerset(the_carrier(A))).
% 1.99/2.16 ** KEPT (pick-wt=7): 29 [] empty_carrier(A)| -one_sorted_str(A)| -empty($f8(A)).
% 1.99/2.16 ** KEPT (pick-wt=6): 30 [] -disjoint(A,B)|disjoint(B,A).
% 1.99/2.16 ** KEPT (pick-wt=6): 31 [] -in(A,B)|element(A,B).
% 1.99/2.16 ** KEPT (pick-wt=8): 32 [] -element(A,B)|empty(B)|in(A,B).
% 1.99/2.16 ** KEPT (pick-wt=7): 33 [] -element(A,powerset(B))|subset(A,B).
% 1.99/2.16 ** KEPT (pick-wt=7): 34 [] element(A,powerset(B))| -subset(A,B).
% 1.99/2.16 ** KEPT (pick-wt=12): 35 [] -top_str(A)| -element(B,powerset(the_carrier(A)))|subset(interior(A,B),B).
% 1.99/2.16 ** KEPT (pick-wt=10): 36 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.99/2.16 ** KEPT (pick-wt=14): 37 [] -topological_space(A)| -top_str(A)| -element(B,powerset(the_carrier(A)))|open_subset(interior(A,B),A).
% 1.99/2.16 ** KEPT (pick-wt=25): 38 [] empty_carrier(A)| -topological_space(A)| -top_str(A)| -element(B,powerset(the_carrier(A)))| -element(C,the_carrier(A))| -open_subset(B,A)| -in(C,B)|point_neighbourhood(B,A,C).
% 1.99/2.16 ** KEPT (pick-wt=9): 39 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.99/2.16 ** KEPT (pick-wt=9): 40 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 1.99/2.16 ** KEPT (pick-wt=5): 41 [] -empty(A)|A=empty_set.
% 1.99/2.16 ** KEPT (pick-wt=2): 42 [] -empty_carrier($c15).
% 1.99/2.16 ** KEPT (pick-wt=12): 43 [] in($c13,topstr_closure($c15,$c14))| -point_neighbourhood(A,$c15,$c13)| -disjoint(A,$c14).
% 1.99/2.16 ** KEPT (pick-wt=9): 44 [] -in($c13,topstr_closure($c15,$c14))|point_neighbourhood($c12,$c15,$c13).
% 1.99/2.16 ** KEPT (pick-wt=8): 45 [] -in($c13,topstr_closure($c15,$c14))|disjoint($c12,$c14).
% 1.99/2.16 ** KEPT (pick-wt=5): 46 [] -in(A,B)| -empty(B).
% 1.99/2.16 ** KEPT (pick-wt=7): 47 [] -empty(A)|A=B| -empty(B).
% 1.99/2.16
% 1.99/2.16 ------------> process sos:
% 1.99/2.16 ** KEPT (pick-wt=3): 73 [] A=A.
% 1.99/2.16 ** KEPT (pick-wt=2): 74 [] top_str($c1).
% 1.99/2.16 ** KEPT (pick-wt=2): 75 [] one_sorted_str($c2).
% 1.99/2.16 ** KEPT (pick-wt=4): 76 [] element($f5(A),A).
% 1.99/2.16 ** KEPT (pick-wt=2): 77 [] empty(empty_set).
% 1.99/2.16 ** KEPT (pick-wt=2): 78 [] relation(empty_set).
% 1.99/2.16 ** KEPT (pick-wt=2): 79 [] relation_empty_yielding(empty_set).
% 1.99/2.16 Following clause subsumed by 77 during input processing: 0 [] empty(empty_set).
% 1.99/2.16 Following clause subsumed by 78 during input processing: 0 [] relation(empty_set).
% 1.99/2.16 ** KEPT (pick-wt=2): 80 [] relation($c3).
% 1.99/2.16 ** KEPT (pick-wt=2): 81 [] function($c3).
% 1.99/2.16 ** KEPT (pick-wt=2): 82 [] relation($c4).
% 1.99/2.16 ** KEPT (pick-wt=2): 83 [] relation_empty_yielding($c4).
% 1.99/2.16 ** KEPT (pick-wt=2): 84 [] function($c4).
% 1.99/2.16 ** KEPT (pick-wt=2): 85 [] empty($c5).
% 1.99/2.16 ** KEPT (pick-wt=2): 86 [] relation($c5).
% 1.99/2.16 ** KEPT (pick-wt=7): 87 [] empty(A)|element($f6(A),powerset(A)).
% 68.86/69.02 ** KEPT (pick-wt=2): 88 [] relation($c6).
% 68.86/69.02 ** KEPT (pick-wt=2): 89 [] empty($c6).
% 68.86/69.02 ** KEPT (pick-wt=2): 90 [] function($c6).
% 68.86/69.02 ** KEPT (pick-wt=2): 91 [] relation($c7).
% 68.86/69.02 ** KEPT (pick-wt=5): 92 [] element($f7(A),powerset(A)).
% 68.86/69.02 ** KEPT (pick-wt=3): 93 [] empty($f7(A)).
% 68.86/69.02 ** KEPT (pick-wt=2): 94 [] relation($c8).
% 68.86/69.02 ** KEPT (pick-wt=2): 95 [] function($c8).
% 68.86/69.02 ** KEPT (pick-wt=2): 96 [] one_to_one($c8).
% 68.86/69.02 ** KEPT (pick-wt=2): 97 [] relation($c9).
% 68.86/69.02 ** KEPT (pick-wt=2): 98 [] relation_empty_yielding($c9).
% 68.86/69.02 ** KEPT (pick-wt=2): 99 [] one_sorted_str($c10).
% 68.86/69.02 ** KEPT (pick-wt=2): 100 [] relation($c11).
% 68.86/69.02 ** KEPT (pick-wt=2): 101 [] relation_empty_yielding($c11).
% 68.86/69.02 ** KEPT (pick-wt=2): 102 [] function($c11).
% 68.86/69.02 ** KEPT (pick-wt=3): 103 [] subset(A,A).
% 68.86/69.02 ** KEPT (pick-wt=2): 104 [] topological_space($c15).
% 68.86/69.02 ** KEPT (pick-wt=2): 105 [] top_str($c15).
% 68.86/69.02 ** KEPT (pick-wt=5): 106 [] element($c14,powerset(the_carrier($c15))).
% 68.86/69.02 ** KEPT (pick-wt=4): 107 [] element($c13,the_carrier($c15)).
% 68.86/69.02 Following clause subsumed by 73 during input processing: 0 [copy,73,flip.1] A=A.
% 68.86/69.02 73 back subsumes 65.
% 68.86/69.02
% 68.86/69.02 ======= end of input processing =======
% 68.86/69.02
% 68.86/69.02 =========== start of search ===========
% 68.86/69.02
% 68.86/69.02
% 68.86/69.02 Resetting weight limit to 9.
% 68.86/69.02
% 68.86/69.02
% 68.86/69.02 Resetting weight limit to 9.
% 68.86/69.02
% 68.86/69.02 sos_size=1153
% 68.86/69.02
% 68.86/69.02
% 68.86/69.02 Resetting weight limit to 8.
% 68.86/69.02
% 68.86/69.02
% 68.86/69.02 Resetting weight limit to 8.
% 68.86/69.02
% 68.86/69.02 sos_size=1167
% 68.86/69.02
% 68.86/69.02
% 68.86/69.02 Resetting weight limit to 7.
% 68.86/69.02
% 68.86/69.02
% 68.86/69.02 Resetting weight limit to 7.
% 68.86/69.02
% 68.86/69.02 sos_size=1203
% 68.86/69.02
% 68.86/69.02 Search stopped because sos empty.
% 68.86/69.02
% 68.86/69.02
% 68.86/69.02 Search stopped because sos empty.
% 68.86/69.02
% 68.86/69.02 ============ end of search ============
% 68.86/69.02
% 68.86/69.02 -------------- statistics -------------
% 68.86/69.02 clauses given 1410
% 68.86/69.02 clauses generated 331387
% 68.86/69.02 clauses kept 1628
% 68.86/69.02 clauses forward subsumed 2223
% 68.86/69.02 clauses back subsumed 53
% 68.86/69.02 Kbytes malloced 7812
% 68.86/69.02
% 68.86/69.02 ----------- times (seconds) -----------
% 68.86/69.02 user CPU time 66.87 (0 hr, 1 min, 6 sec)
% 68.86/69.02 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 68.86/69.02 wall-clock time 68 (0 hr, 1 min, 8 sec)
% 68.86/69.02
% 68.86/69.02 Process 32708 finished Wed Jul 27 07:40:47 2022
% 68.86/69.02 Otter interrupted
% 68.86/69.02 PROOF NOT FOUND
%------------------------------------------------------------------------------