%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU324+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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:40 EDT 2022
% Result : Theorem 1.98s 2.18s
% Output : Refutation 1.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of clauses : 29 ( 16 unt; 2 nHn; 28 RR)
% Number of literals : 50 ( 14 equ; 20 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ top_str(A)
| ~ element(B,powerset(the_carrier(A)))
| interior(A,B) = subset_complement(the_carrier(A),topstr_closure(A,subset_complement(the_carrier(A),B))) ),
file('SEU324+1.p',unknown),
[] ).
cnf(2,plain,
( ~ top_str(A)
| ~ element(B,powerset(the_carrier(A)))
| subset_complement(the_carrier(A),topstr_closure(A,subset_complement(the_carrier(A),B))) = interior(A,B) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.3')] ).
cnf(4,axiom,
( ~ element(A,powerset(B))
| element(subset_complement(B,A),powerset(B)) ),
file('SEU324+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ topological_space(A)
| ~ top_str(A)
| ~ element(B,powerset(the_carrier(A)))
| open_subset(interior(A,B),A) ),
file('SEU324+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ element(A,powerset(B))
| subset_complement(B,subset_complement(B,A)) = A ),
file('SEU324+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ top_str(A)
| ~ element(B,powerset(the_carrier(A)))
| ~ open_subset(B,A)
| closed_subset(subset_complement(the_carrier(A),B),A) ),
file('SEU324+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ top_str(A)
| ~ element(B,powerset(the_carrier(A)))
| ~ closed_subset(B,A)
| topstr_closure(A,B) = B ),
file('SEU324+1.p',unknown),
[] ).
cnf(25,axiom,
( open_subset(dollar_c3,dollar_c5)
| ~ open_subset(dollar_c4,dollar_c6) ),
file('SEU324+1.p',unknown),
[] ).
cnf(26,axiom,
( interior(dollar_c5,dollar_c3) != dollar_c3
| interior(dollar_c6,dollar_c4) = dollar_c4 ),
file('SEU324+1.p',unknown),
[] ).
cnf(27,axiom,
( interior(dollar_c5,dollar_c3) != dollar_c3
| ~ open_subset(dollar_c4,dollar_c6) ),
file('SEU324+1.p',unknown),
[] ).
cnf(28,axiom,
A = A,
file('SEU324+1.p',unknown),
[] ).
cnf(33,axiom,
topological_space(dollar_c6),
file('SEU324+1.p',unknown),
[] ).
cnf(34,axiom,
top_str(dollar_c6),
file('SEU324+1.p',unknown),
[] ).
cnf(35,axiom,
top_str(dollar_c5),
file('SEU324+1.p',unknown),
[] ).
cnf(36,axiom,
element(dollar_c4,powerset(the_carrier(dollar_c6))),
file('SEU324+1.p',unknown),
[] ).
cnf(37,axiom,
element(dollar_c3,powerset(the_carrier(dollar_c5))),
file('SEU324+1.p',unknown),
[] ).
cnf(38,axiom,
( open_subset(dollar_c3,dollar_c5)
| interior(dollar_c6,dollar_c4) = dollar_c4 ),
file('SEU324+1.p',unknown),
[] ).
cnf(71,plain,
open_subset(interior(dollar_c6,dollar_c4),dollar_c6),
inference(hyper,[status(thm)],[36,10,33,34]),
[iquote('hyper,36,10,33,34')] ).
cnf(97,plain,
subset_complement(the_carrier(dollar_c5),subset_complement(the_carrier(dollar_c5),dollar_c3)) = dollar_c3,
inference(hyper,[status(thm)],[37,11]),
[iquote('hyper,37,11')] ).
cnf(99,plain,
element(subset_complement(the_carrier(dollar_c5),dollar_c3),powerset(the_carrier(dollar_c5))),
inference(hyper,[status(thm)],[37,4]),
[iquote('hyper,37,4')] ).
cnf(101,plain,
subset_complement(the_carrier(dollar_c5),topstr_closure(dollar_c5,subset_complement(the_carrier(dollar_c5),dollar_c3))) = interior(dollar_c5,dollar_c3),
inference(hyper,[status(thm)],[37,2,35]),
[iquote('hyper,37,2,35')] ).
cnf(104,plain,
( open_subset(dollar_c4,dollar_c6)
| open_subset(dollar_c3,dollar_c5) ),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[38,10]),33,34,36]),
[iquote('para_from,38.2.1,10.4.1,unit_del,33,34,36')] ).
cnf(105,plain,
( open_subset(dollar_c4,dollar_c6)
| interior(dollar_c5,dollar_c3) != dollar_c3 ),
inference(para_into,[status(thm),theory(equality)],[71,26]),
[iquote('para_into,71.1.1,26.2.1')] ).
cnf(159,plain,
open_subset(dollar_c3,dollar_c5),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[104,25])]),
[iquote('hyper,104,25,factor_simp')] ).
cnf(161,plain,
closed_subset(subset_complement(the_carrier(dollar_c5),dollar_c3),dollar_c5),
inference(hyper,[status(thm)],[159,19,35,37]),
[iquote('hyper,159,19,35,37')] ).
cnf(402,plain,
topstr_closure(dollar_c5,subset_complement(the_carrier(dollar_c5),dollar_c3)) = subset_complement(the_carrier(dollar_c5),dollar_c3),
inference(hyper,[status(thm)],[99,23,35,161]),
[iquote('hyper,99,23,35,161')] ).
cnf(408,plain,
interior(dollar_c5,dollar_c3) = dollar_c3,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[101]),402,97])]),
[iquote('back_demod,101,demod,402,97,flip.1')] ).
cnf(413,plain,
open_subset(dollar_c4,dollar_c6),
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[105]),408]),28]),
[iquote('back_demod,105,demod,408,unit_del,28')] ).
cnf(414,plain,
$false,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[27]),408]),28,413]),
[iquote('back_demod,27,demod,408,unit_del,28,413')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU324+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 07:49:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.98/2.17 ----- Otter 3.3f, August 2004 -----
% 1.98/2.17 The process was started by sandbox on n015.cluster.edu,
% 1.98/2.17 Wed Jul 27 07:49:27 2022
% 1.98/2.17 The command was "./otter". The process ID is 23911.
% 1.98/2.17
% 1.98/2.17 set(prolog_style_variables).
% 1.98/2.17 set(auto).
% 1.98/2.17 dependent: set(auto1).
% 1.98/2.17 dependent: set(process_input).
% 1.98/2.17 dependent: clear(print_kept).
% 1.98/2.17 dependent: clear(print_new_demod).
% 1.98/2.17 dependent: clear(print_back_demod).
% 1.98/2.17 dependent: clear(print_back_sub).
% 1.98/2.17 dependent: set(control_memory).
% 1.98/2.17 dependent: assign(max_mem, 12000).
% 1.98/2.17 dependent: assign(pick_given_ratio, 4).
% 1.98/2.17 dependent: assign(stats_level, 1).
% 1.98/2.17 dependent: assign(max_seconds, 10800).
% 1.98/2.17 clear(print_given).
% 1.98/2.17
% 1.98/2.17 formula_list(usable).
% 1.98/2.17 all A (A=A).
% 1.98/2.17 all A (top_str(A)-> (all B (element(B,powerset(the_carrier(A)))->interior(A,B)=subset_complement(the_carrier(A),topstr_closure(A,subset_complement(the_carrier(A),B)))))).
% 1.98/2.17 all A B (top_str(A)&element(B,powerset(the_carrier(A)))->element(interior(A,B),powerset(the_carrier(A)))).
% 1.98/2.17 $T.
% 1.98/2.17 all A B (element(B,powerset(A))->element(subset_complement(A,B),powerset(A))).
% 1.98/2.17 all A B (top_str(A)&element(B,powerset(the_carrier(A)))->element(topstr_closure(A,B),powerset(the_carrier(A)))).
% 1.98/2.17 all A (top_str(A)->one_sorted_str(A)).
% 1.98/2.17 $T.
% 1.98/2.17 $T.
% 1.98/2.17 $T.
% 1.98/2.17 exists A top_str(A).
% 1.98/2.17 exists A one_sorted_str(A).
% 1.98/2.17 all A exists B element(B,A).
% 1.98/2.17 all A B (topological_space(A)&top_str(A)&element(B,powerset(the_carrier(A)))->closed_subset(topstr_closure(A,B),A)).
% 1.98/2.17 all A B (topological_space(A)&top_str(A)&closed_subset(B,A)&element(B,powerset(the_carrier(A)))->open_subset(subset_complement(the_carrier(A),B),A)).
% 1.98/2.17 all A B (topological_space(A)&top_str(A)&open_subset(B,A)&element(B,powerset(the_carrier(A)))->closed_subset(subset_complement(the_carrier(A),B),A)).
% 1.98/2.17 all A B (topological_space(A)&top_str(A)&element(B,powerset(the_carrier(A)))->open_subset(interior(A,B),A)).
% 1.98/2.17 all A B (element(B,powerset(A))->subset_complement(A,subset_complement(A,B))=B).
% 1.98/2.17 all A (topological_space(A)&top_str(A)-> (exists B (element(B,powerset(the_carrier(A)))&open_subset(B,A)))).
% 1.98/2.17 all A (topological_space(A)&top_str(A)-> (exists B (element(B,powerset(the_carrier(A)))&open_subset(B,A)&closed_subset(B,A)))).
% 1.98/2.17 all A (topological_space(A)&top_str(A)-> (exists B (element(B,powerset(the_carrier(A)))&closed_subset(B,A)))).
% 1.98/2.17 all A B subset(A,A).
% 1.98/2.17 all A (top_str(A)-> (all B (element(B,powerset(the_carrier(A)))-> (open_subset(B,A)<->closed_subset(subset_complement(the_carrier(A),B),A))))).
% 1.98/2.17 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.98/2.17 all A (top_str(A)-> (all B (element(B,powerset(the_carrier(A)))-> (closed_subset(B,A)->topstr_closure(A,B)=B)& (topological_space(A)&topstr_closure(A,B)=B->closed_subset(B,A))))).
% 1.98/2.17 -(all A (topological_space(A)&top_str(A)-> (all B (top_str(B)-> (all C (element(C,powerset(the_carrier(A)))-> (all D (element(D,powerset(the_carrier(B)))-> (open_subset(D,B)->interior(B,D)=D)& (interior(A,C)=C->open_subset(C,A)))))))))).
% 1.98/2.17 end_of_list.
% 1.98/2.17
% 1.98/2.17 -------> usable clausifies to:
% 1.98/2.17
% 1.98/2.17 list(usable).
% 1.98/2.17 0 [] A=A.
% 1.98/2.17 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))|interior(A,B)=subset_complement(the_carrier(A),topstr_closure(A,subset_complement(the_carrier(A),B))).
% 1.98/2.17 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))|element(interior(A,B),powerset(the_carrier(A))).
% 1.98/2.17 0 [] $T.
% 1.98/2.17 0 [] -element(B,powerset(A))|element(subset_complement(A,B),powerset(A)).
% 1.98/2.17 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))|element(topstr_closure(A,B),powerset(the_carrier(A))).
% 1.98/2.17 0 [] -top_str(A)|one_sorted_str(A).
% 1.98/2.17 0 [] $T.
% 1.98/2.17 0 [] $T.
% 1.98/2.17 0 [] $T.
% 1.98/2.17 0 [] top_str($c1).
% 1.98/2.17 0 [] one_sorted_str($c2).
% 1.98/2.17 0 [] element($f1(A),A).
% 1.98/2.17 0 [] -topological_space(A)| -top_str(A)| -element(B,powerset(the_carrier(A)))|closed_subset(topstr_closure(A,B),A).
% 1.98/2.17 0 [] -topological_space(A)| -top_str(A)| -closed_subset(B,A)| -element(B,powerset(the_carrier(A)))|open_subset(subset_complement(the_carrier(A),B),A).
% 1.98/2.17 0 [] -topological_space(A)| -top_str(A)| -open_subset(B,A)| -element(B,powerset(the_carrier(A)))|closed_subset(subset_complement(the_carrier(A),B),A).
% 1.98/2.17 0 [] -topological_space(A)| -top_str(A)| -element(B,powerset(the_carrier(A)))|open_subset(interior(A,B),A).
% 1.98/2.17 0 [] -element(B,powerset(A))|subset_complement(A,subset_complement(A,B))=B.
% 1.98/2.17 0 [] -topological_space(A)| -top_str(A)|element($f2(A),powerset(the_carrier(A))).
% 1.98/2.17 0 [] -topological_space(A)| -top_str(A)|open_subset($f2(A),A).
% 1.98/2.17 0 [] -topological_space(A)| -top_str(A)|element($f3(A),powerset(the_carrier(A))).
% 1.98/2.17 0 [] -topological_space(A)| -top_str(A)|open_subset($f3(A),A).
% 1.98/2.17 0 [] -topological_space(A)| -top_str(A)|closed_subset($f3(A),A).
% 1.98/2.17 0 [] -topological_space(A)| -top_str(A)|element($f4(A),powerset(the_carrier(A))).
% 1.98/2.17 0 [] -topological_space(A)| -top_str(A)|closed_subset($f4(A),A).
% 1.98/2.17 0 [] subset(A,A).
% 1.98/2.17 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -open_subset(B,A)|closed_subset(subset_complement(the_carrier(A),B),A).
% 1.98/2.17 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))|open_subset(B,A)| -closed_subset(subset_complement(the_carrier(A),B),A).
% 1.98/2.17 0 [] -element(A,powerset(B))|subset(A,B).
% 1.98/2.17 0 [] element(A,powerset(B))| -subset(A,B).
% 1.98/2.17 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -closed_subset(B,A)|topstr_closure(A,B)=B.
% 1.98/2.17 0 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -topological_space(A)|topstr_closure(A,B)!=B|closed_subset(B,A).
% 1.98/2.17 0 [] topological_space($c6).
% 1.98/2.17 0 [] top_str($c6).
% 1.98/2.17 0 [] top_str($c5).
% 1.98/2.17 0 [] element($c4,powerset(the_carrier($c6))).
% 1.98/2.17 0 [] element($c3,powerset(the_carrier($c5))).
% 1.98/2.17 0 [] open_subset($c3,$c5)|interior($c6,$c4)=$c4.
% 1.98/2.17 0 [] open_subset($c3,$c5)| -open_subset($c4,$c6).
% 1.98/2.17 0 [] interior($c5,$c3)!=$c3|interior($c6,$c4)=$c4.
% 1.98/2.17 0 [] interior($c5,$c3)!=$c3| -open_subset($c4,$c6).
% 1.98/2.17 end_of_list.
% 1.98/2.17
% 1.98/2.17 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.98/2.17
% 1.98/2.17 This ia a non-Horn set with equality. The strategy will be
% 1.98/2.17 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.98/2.17 deletion, with positive clauses in sos and nonpositive
% 1.98/2.17 clauses in usable.
% 1.98/2.17
% 1.98/2.17 dependent: set(knuth_bendix).
% 1.98/2.17 dependent: set(anl_eq).
% 1.98/2.17 dependent: set(para_from).
% 1.98/2.17 dependent: set(para_into).
% 1.98/2.17 dependent: clear(para_from_right).
% 1.98/2.17 dependent: clear(para_into_right).
% 1.98/2.17 dependent: set(para_from_vars).
% 1.98/2.17 dependent: set(eq_units_both_ways).
% 1.98/2.17 dependent: set(dynamic_demod_all).
% 1.98/2.17 dependent: set(dynamic_demod).
% 1.98/2.17 dependent: set(order_eq).
% 1.98/2.17 dependent: set(back_demod).
% 1.98/2.17 dependent: set(lrpo).
% 1.98/2.17 dependent: set(hyper_res).
% 1.98/2.17 dependent: set(unit_deletion).
% 1.98/2.17 dependent: set(factor).
% 1.98/2.17
% 1.98/2.17 ------------> process usable:
% 1.98/2.17 ** KEPT (pick-wt=20): 2 [copy,1,flip.3] -top_str(A)| -element(B,powerset(the_carrier(A)))|subset_complement(the_carrier(A),topstr_closure(A,subset_complement(the_carrier(A),B)))=interior(A,B).
% 1.98/2.17 ** KEPT (pick-wt=14): 3 [] -top_str(A)| -element(B,powerset(the_carrier(A)))|element(interior(A,B),powerset(the_carrier(A))).
% 1.98/2.17 ** KEPT (pick-wt=10): 4 [] -element(A,powerset(B))|element(subset_complement(B,A),powerset(B)).
% 1.98/2.17 ** KEPT (pick-wt=14): 5 [] -top_str(A)| -element(B,powerset(the_carrier(A)))|element(topstr_closure(A,B),powerset(the_carrier(A))).
% 1.98/2.17 ** KEPT (pick-wt=4): 6 [] -top_str(A)|one_sorted_str(A).
% 1.98/2.17 ** KEPT (pick-wt=14): 7 [] -topological_space(A)| -top_str(A)| -element(B,powerset(the_carrier(A)))|closed_subset(topstr_closure(A,B),A).
% 1.98/2.17 ** KEPT (pick-wt=18): 8 [] -topological_space(A)| -top_str(A)| -closed_subset(B,A)| -element(B,powerset(the_carrier(A)))|open_subset(subset_complement(the_carrier(A),B),A).
% 1.98/2.17 ** KEPT (pick-wt=18): 9 [] -topological_space(A)| -top_str(A)| -open_subset(B,A)| -element(B,powerset(the_carrier(A)))|closed_subset(subset_complement(the_carrier(A),B),A).
% 1.98/2.17 ** KEPT (pick-wt=14): 10 [] -topological_space(A)| -top_str(A)| -element(B,powerset(the_carrier(A)))|open_subset(interior(A,B),A).
% 1.98/2.17 ** KEPT (pick-wt=11): 11 [] -element(A,powerset(B))|subset_complement(B,subset_complement(B,A))=A.
% 1.98/2.17 ** KEPT (pick-wt=10): 12 [] -topological_space(A)| -top_str(A)|element($f2(A),powerset(the_carrier(A))).
% 1.98/2.17 ** KEPT (pick-wt=8): 13 [] -topological_space(A)| -top_str(A)|open_subset($f2(A),A).
% 1.98/2.17 ** KEPT (pick-wt=10): 14 [] -topological_space(A)| -top_str(A)|element($f3(A),powerset(the_carrier(A))).
% 1.98/2.17 ** KEPT (pick-wt=8): 15 [] -topological_space(A)| -top_str(A)|open_subset($f3(A),A).
% 1.98/2.17 ** KEPT (pick-wt=8): 16 [] -topological_space(A)| -top_str(A)|closed_subset($f3(A),A).
% 1.98/2.17 ** KEPT (pick-wt=10): 17 [] -topological_space(A)| -top_str(A)|element($f4(A),powerset(the_carrier(A))).
% 1.98/2.18 ** KEPT (pick-wt=8): 18 [] -topological_space(A)| -top_str(A)|closed_subset($f4(A),A).
% 1.98/2.18 ** KEPT (pick-wt=16): 19 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -open_subset(B,A)|closed_subset(subset_complement(the_carrier(A),B),A).
% 1.98/2.18 ** KEPT (pick-wt=16): 20 [] -top_str(A)| -element(B,powerset(the_carrier(A)))|open_subset(B,A)| -closed_subset(subset_complement(the_carrier(A),B),A).
% 1.98/2.18 ** KEPT (pick-wt=7): 21 [] -element(A,powerset(B))|subset(A,B).
% 1.98/2.18 ** KEPT (pick-wt=7): 22 [] element(A,powerset(B))| -subset(A,B).
% 1.98/2.18 ** KEPT (pick-wt=15): 23 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -closed_subset(B,A)|topstr_closure(A,B)=B.
% 1.98/2.18 ** KEPT (pick-wt=17): 24 [] -top_str(A)| -element(B,powerset(the_carrier(A)))| -topological_space(A)|topstr_closure(A,B)!=B|closed_subset(B,A).
% 1.98/2.18 ** KEPT (pick-wt=6): 25 [] open_subset($c3,$c5)| -open_subset($c4,$c6).
% 1.98/2.18 ** KEPT (pick-wt=10): 26 [] interior($c5,$c3)!=$c3|interior($c6,$c4)=$c4.
% 1.98/2.18 ** KEPT (pick-wt=8): 27 [] interior($c5,$c3)!=$c3| -open_subset($c4,$c6).
% 1.98/2.18 19 back subsumes 9.
% 1.98/2.18
% 1.98/2.18 ------------> process sos:
% 1.98/2.18 ** KEPT (pick-wt=3): 28 [] A=A.
% 1.98/2.18 ** KEPT (pick-wt=2): 29 [] top_str($c1).
% 1.98/2.18 ** KEPT (pick-wt=2): 30 [] one_sorted_str($c2).
% 1.98/2.18 ** KEPT (pick-wt=4): 31 [] element($f1(A),A).
% 1.98/2.18 ** KEPT (pick-wt=3): 32 [] subset(A,A).
% 1.98/2.18 ** KEPT (pick-wt=2): 33 [] topological_space($c6).
% 1.98/2.18 ** KEPT (pick-wt=2): 34 [] top_str($c6).
% 1.98/2.18 ** KEPT (pick-wt=2): 35 [] top_str($c5).
% 1.98/2.18 ** KEPT (pick-wt=5): 36 [] element($c4,powerset(the_carrier($c6))).
% 1.98/2.18 ** KEPT (pick-wt=5): 37 [] element($c3,powerset(the_carrier($c5))).
% 1.98/2.18 ** KEPT (pick-wt=8): 38 [] open_subset($c3,$c5)|interior($c6,$c4)=$c4.
% 1.98/2.18 Following clause subsumed by 28 during input processing: 0 [copy,28,flip.1] A=A.
% 1.98/2.18
% 1.98/2.18 ======= end of input processing =======
% 1.98/2.18
% 1.98/2.18 =========== start of search ===========
% 1.98/2.18
% 1.98/2.18 -------- PROOF --------
% 1.98/2.18
% 1.98/2.18 -----> EMPTY CLAUSE at 0.01 sec ----> 414 [back_demod,27,demod,408,unit_del,28,413] $F.
% 1.98/2.18
% 1.98/2.18 Length of proof is 12. Level of proof is 6.
% 1.98/2.18
% 1.98/2.18 ---------------- PROOF ----------------
% 1.98/2.18 % SZS status Theorem
% 1.98/2.18 % SZS output start Refutation
% See solution above
% 1.98/2.18 ------------ end of proof -------------
% 1.98/2.18
% 1.98/2.18
% 1.98/2.18 Search stopped by max_proofs option.
% 1.98/2.18
% 1.98/2.18
% 1.98/2.18 Search stopped by max_proofs option.
% 1.98/2.18
% 1.98/2.18 ============ end of search ============
% 1.98/2.18
% 1.98/2.18 -------------- statistics -------------
% 1.98/2.18 clauses given 83
% 1.98/2.18 clauses generated 343
% 1.98/2.18 clauses kept 323
% 1.98/2.18 clauses forward subsumed 120
% 1.98/2.18 clauses back subsumed 6
% 1.98/2.18 Kbytes malloced 3906
% 1.98/2.18
% 1.98/2.18 ----------- times (seconds) -----------
% 1.98/2.18 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.98/2.18 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.98/2.18 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.98/2.18
% 1.98/2.18 That finishes the proof of the theorem.
% 1.98/2.18
% 1.98/2.18 Process 23911 finished Wed Jul 27 07:49:28 2022
% 1.98/2.18 Otter interrupted
% 1.98/2.18 PROOF FOUND
%------------------------------------------------------------------------------