TSTP Solution File: SEU306+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU306+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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:34 EDT 2022
% Result : Theorem 1.90s 2.10s
% Output : Refutation 1.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 5 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(54,axiom,
( ~ one_sorted_str(A)
| cast_as_carrier_subset(A) = the_carrier(A) ),
file('SEU306+1.p',unknown),
[] ).
cnf(55,plain,
( ~ one_sorted_str(A)
| the_carrier(A) = cast_as_carrier_subset(A) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[54])]),
[iquote('copy,54,flip.2')] ).
cnf(56,axiom,
cast_as_carrier_subset(dollar_c3) != the_carrier(dollar_c3),
file('SEU306+1.p',unknown),
[] ).
cnf(57,plain,
the_carrier(dollar_c3) != cast_as_carrier_subset(dollar_c3),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[56])]),
[iquote('copy,56,flip.1')] ).
cnf(78,axiom,
one_sorted_str(dollar_c3),
file('SEU306+1.p',unknown),
[] ).
cnf(84,plain,
the_carrier(dollar_c3) = cast_as_carrier_subset(dollar_c3),
inference(hyper,[status(thm)],[78,55]),
[iquote('hyper,78,55')] ).
cnf(86,plain,
$false,
inference(binary,[status(thm)],[84,57]),
[iquote('binary,84.1,57.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU306+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n012.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:58:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.90/2.10 ----- Otter 3.3f, August 2004 -----
% 1.90/2.10 The process was started by sandbox2 on n012.cluster.edu,
% 1.90/2.10 Wed Jul 27 07:58:35 2022
% 1.90/2.10 The command was "./otter". The process ID is 23899.
% 1.90/2.10
% 1.90/2.10 set(prolog_style_variables).
% 1.90/2.10 set(auto).
% 1.90/2.10 dependent: set(auto1).
% 1.90/2.10 dependent: set(process_input).
% 1.90/2.10 dependent: clear(print_kept).
% 1.90/2.10 dependent: clear(print_new_demod).
% 1.90/2.10 dependent: clear(print_back_demod).
% 1.90/2.10 dependent: clear(print_back_sub).
% 1.90/2.10 dependent: set(control_memory).
% 1.90/2.10 dependent: assign(max_mem, 12000).
% 1.90/2.10 dependent: assign(pick_given_ratio, 4).
% 1.90/2.10 dependent: assign(stats_level, 1).
% 1.90/2.10 dependent: assign(max_seconds, 10800).
% 1.90/2.10 clear(print_given).
% 1.90/2.10
% 1.90/2.10 formula_list(usable).
% 1.90/2.10 all A (A=A).
% 1.90/2.10 all A B (in(A,B)-> -in(B,A)).
% 1.90/2.10 $T.
% 1.90/2.10 all A (v5_membered(A)->v4_membered(A)).
% 1.90/2.10 all A (v4_membered(A)->v3_membered(A)).
% 1.90/2.10 all A (v3_membered(A)->v2_membered(A)).
% 1.90/2.10 all A (v2_membered(A)->v1_membered(A)).
% 1.90/2.10 exists A (-empty(A)&v1_membered(A)&v2_membered(A)&v3_membered(A)&v4_membered(A)&v5_membered(A)).
% 1.90/2.10 all A (v1_membered(A)-> (all B (element(B,A)->v1_xcmplx_0(B)))).
% 1.90/2.10 all A (v2_membered(A)-> (all B (element(B,A)->v1_xcmplx_0(B)&v1_xreal_0(B)))).
% 1.90/2.10 all A (v3_membered(A)-> (all B (element(B,A)->v1_xcmplx_0(B)&v1_xreal_0(B)&v1_rat_1(B)))).
% 1.90/2.10 all A (v4_membered(A)-> (all B (element(B,A)->v1_xcmplx_0(B)&v1_xreal_0(B)&v1_int_1(B)&v1_rat_1(B)))).
% 1.90/2.10 all A (v5_membered(A)-> (all B (element(B,A)->v1_xcmplx_0(B)&natural(B)&v1_xreal_0(B)&v1_int_1(B)&v1_rat_1(B)))).
% 1.90/2.10 empty(empty_set).
% 1.90/2.10 v1_membered(empty_set).
% 1.90/2.10 v2_membered(empty_set).
% 1.90/2.10 v3_membered(empty_set).
% 1.90/2.10 v4_membered(empty_set).
% 1.90/2.10 v5_membered(empty_set).
% 1.90/2.10 all A (v1_membered(A)-> (all B (element(B,powerset(A))->v1_membered(B)))).
% 1.90/2.10 all A (v2_membered(A)-> (all B (element(B,powerset(A))->v1_membered(B)&v2_membered(B)))).
% 1.90/2.10 all A (v3_membered(A)-> (all B (element(B,powerset(A))->v1_membered(B)&v2_membered(B)&v3_membered(B)))).
% 1.90/2.10 all A (v4_membered(A)-> (all B (element(B,powerset(A))->v1_membered(B)&v2_membered(B)&v3_membered(B)&v4_membered(B)))).
% 1.90/2.10 all A (v5_membered(A)-> (all B (element(B,powerset(A))->v1_membered(B)&v2_membered(B)&v3_membered(B)&v4_membered(B)&v5_membered(B)))).
% 1.90/2.10 all A B (in(A,B)->element(A,B)).
% 1.90/2.10 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.90/2.10 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.90/2.10 all A B subset(A,A).
% 1.90/2.10 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.90/2.10 all A exists B (element(B,powerset(A))&empty(B)).
% 1.90/2.10 all A (empty(A)->v1_membered(A)&v2_membered(A)&v3_membered(A)&v4_membered(A)&v5_membered(A)).
% 1.90/2.10 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.90/2.10 all A (empty(A)->A=empty_set).
% 1.90/2.10 all A B (-(in(A,B)&empty(B))).
% 1.90/2.10 all A B (-(empty(A)&A!=B&empty(B))).
% 1.90/2.10 all A exists B element(B,A).
% 1.90/2.10 $T.
% 1.90/2.10 $T.
% 1.90/2.10 all A (-empty(powerset(A))).
% 1.90/2.10 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.90/2.10 exists A one_sorted_str(A).
% 1.90/2.10 all A (one_sorted_str(A)->element(cast_as_carrier_subset(A),powerset(the_carrier(A)))).
% 1.90/2.10 $T.
% 1.90/2.10 $T.
% 1.90/2.10 all A (one_sorted_str(A)->cast_as_carrier_subset(A)=the_carrier(A)).
% 1.90/2.10 -(all A (one_sorted_str(A)->cast_as_carrier_subset(A)=the_carrier(A))).
% 1.90/2.10 end_of_list.
% 1.90/2.10
% 1.90/2.10 -------> usable clausifies to:
% 1.90/2.10
% 1.90/2.10 list(usable).
% 1.90/2.10 0 [] A=A.
% 1.90/2.10 0 [] -in(A,B)| -in(B,A).
% 1.90/2.10 0 [] $T.
% 1.90/2.10 0 [] -v5_membered(A)|v4_membered(A).
% 1.90/2.10 0 [] -v4_membered(A)|v3_membered(A).
% 1.90/2.10 0 [] -v3_membered(A)|v2_membered(A).
% 1.90/2.10 0 [] -v2_membered(A)|v1_membered(A).
% 1.90/2.10 0 [] -empty($c1).
% 1.90/2.10 0 [] v1_membered($c1).
% 1.90/2.10 0 [] v2_membered($c1).
% 1.90/2.10 0 [] v3_membered($c1).
% 1.90/2.10 0 [] v4_membered($c1).
% 1.90/2.10 0 [] v5_membered($c1).
% 1.90/2.10 0 [] -v1_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 1.90/2.10 0 [] -v2_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 1.90/2.10 0 [] -v2_membered(A)| -element(B,A)|v1_xreal_0(B).
% 1.90/2.10 0 [] -v3_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 1.90/2.10 0 [] -v3_membered(A)| -element(B,A)|v1_xreal_0(B).
% 1.90/2.10 0 [] -v3_membered(A)| -element(B,A)|v1_rat_1(B).
% 1.90/2.10 0 [] -v4_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 1.90/2.10 0 [] -v4_membered(A)| -element(B,A)|v1_xreal_0(B).
% 1.90/2.10 0 [] -v4_membered(A)| -element(B,A)|v1_int_1(B).
% 1.90/2.10 0 [] -v4_membered(A)| -element(B,A)|v1_rat_1(B).
% 1.90/2.10 0 [] -v5_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 1.90/2.10 0 [] -v5_membered(A)| -element(B,A)|natural(B).
% 1.90/2.10 0 [] -v5_membered(A)| -element(B,A)|v1_xreal_0(B).
% 1.90/2.10 0 [] -v5_membered(A)| -element(B,A)|v1_int_1(B).
% 1.90/2.10 0 [] -v5_membered(A)| -element(B,A)|v1_rat_1(B).
% 1.90/2.10 0 [] empty(empty_set).
% 1.90/2.10 0 [] v1_membered(empty_set).
% 1.90/2.10 0 [] v2_membered(empty_set).
% 1.90/2.10 0 [] v3_membered(empty_set).
% 1.90/2.10 0 [] v4_membered(empty_set).
% 1.90/2.10 0 [] v5_membered(empty_set).
% 1.90/2.10 0 [] -v1_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 1.90/2.10 0 [] -v2_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 1.90/2.10 0 [] -v2_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 1.90/2.10 0 [] -v3_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 1.90/2.10 0 [] -v3_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 1.90/2.10 0 [] -v3_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 1.90/2.10 0 [] -v4_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 1.90/2.10 0 [] -v4_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 1.90/2.10 0 [] -v4_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 1.90/2.10 0 [] -v4_membered(A)| -element(B,powerset(A))|v4_membered(B).
% 1.90/2.10 0 [] -v5_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 1.90/2.10 0 [] -v5_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 1.90/2.10 0 [] -v5_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 1.90/2.10 0 [] -v5_membered(A)| -element(B,powerset(A))|v4_membered(B).
% 1.90/2.10 0 [] -v5_membered(A)| -element(B,powerset(A))|v5_membered(B).
% 1.90/2.10 0 [] -in(A,B)|element(A,B).
% 1.90/2.10 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.90/2.10 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.90/2.10 0 [] subset(A,A).
% 1.90/2.10 0 [] empty(A)|element($f1(A),powerset(A)).
% 1.90/2.10 0 [] empty(A)| -empty($f1(A)).
% 1.90/2.10 0 [] element($f2(A),powerset(A)).
% 1.90/2.10 0 [] empty($f2(A)).
% 1.90/2.10 0 [] -empty(A)|v1_membered(A).
% 1.90/2.10 0 [] -empty(A)|v2_membered(A).
% 1.90/2.10 0 [] -empty(A)|v3_membered(A).
% 1.90/2.10 0 [] -empty(A)|v4_membered(A).
% 1.90/2.10 0 [] -empty(A)|v5_membered(A).
% 1.90/2.10 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.90/2.10 0 [] -empty(A)|A=empty_set.
% 1.90/2.10 0 [] -in(A,B)| -empty(B).
% 1.90/2.10 0 [] -empty(A)|A=B| -empty(B).
% 1.90/2.10 0 [] element($f3(A),A).
% 1.90/2.10 0 [] $T.
% 1.90/2.10 0 [] $T.
% 1.90/2.10 0 [] -empty(powerset(A)).
% 1.90/2.10 0 [] -element(A,powerset(B))|subset(A,B).
% 1.90/2.10 0 [] element(A,powerset(B))| -subset(A,B).
% 1.90/2.10 0 [] one_sorted_str($c2).
% 1.90/2.10 0 [] -one_sorted_str(A)|element(cast_as_carrier_subset(A),powerset(the_carrier(A))).
% 1.90/2.10 0 [] $T.
% 1.90/2.10 0 [] $T.
% 1.90/2.10 0 [] -one_sorted_str(A)|cast_as_carrier_subset(A)=the_carrier(A).
% 1.90/2.10 0 [] one_sorted_str($c3).
% 1.90/2.10 0 [] cast_as_carrier_subset($c3)!=the_carrier($c3).
% 1.90/2.10 end_of_list.
% 1.90/2.10
% 1.90/2.10 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.90/2.10
% 1.90/2.10 This ia a non-Horn set with equality. The strategy will be
% 1.90/2.10 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.90/2.10 deletion, with positive clauses in sos and nonpositive
% 1.90/2.10 clauses in usable.
% 1.90/2.10
% 1.90/2.10 dependent: set(knuth_bendix).
% 1.90/2.10 dependent: set(anl_eq).
% 1.90/2.10 dependent: set(para_from).
% 1.90/2.10 dependent: set(para_into).
% 1.90/2.10 dependent: clear(para_from_right).
% 1.90/2.10 dependent: clear(para_into_right).
% 1.90/2.10 dependent: set(para_from_vars).
% 1.90/2.10 dependent: set(eq_units_both_ways).
% 1.90/2.10 dependent: set(dynamic_demod_all).
% 1.90/2.10 dependent: set(dynamic_demod).
% 1.90/2.10 dependent: set(order_eq).
% 1.90/2.10 dependent: set(back_demod).
% 1.90/2.10 dependent: set(lrpo).
% 1.90/2.10 dependent: set(hyper_res).
% 1.90/2.10 dependent: set(unit_deletion).
% 1.90/2.10 dependent: set(factor).
% 1.90/2.10
% 1.90/2.10 ------------> process usable:
% 1.90/2.10 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.90/2.10 ** KEPT (pick-wt=4): 2 [] -v5_membered(A)|v4_membered(A).
% 1.90/2.10 ** KEPT (pick-wt=4): 3 [] -v4_membered(A)|v3_membered(A).
% 1.90/2.10 ** KEPT (pick-wt=4): 4 [] -v3_membered(A)|v2_membered(A).
% 1.90/2.10 ** KEPT (pick-wt=4): 5 [] -v2_membered(A)|v1_membered(A).
% 1.90/2.10 ** KEPT (pick-wt=2): 6 [] -empty($c1).
% 1.90/2.10 ** KEPT (pick-wt=7): 7 [] -v1_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 1.90/2.10 ** KEPT (pick-wt=7): 8 [] -v2_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 1.90/2.10 ** KEPT (pick-wt=7): 9 [] -v2_membered(A)| -element(B,A)|v1_xreal_0(B).
% 1.90/2.10 ** KEPT (pick-wt=7): 10 [] -v3_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 1.90/2.10 ** KEPT (pick-wt=7): 11 [] -v3_membered(A)| -element(B,A)|v1_xreal_0(B).
% 1.90/2.10 ** KEPT (pick-wt=7): 12 [] -v3_membered(A)| -element(B,A)|v1_rat_1(B).
% 1.90/2.10 ** KEPT (pick-wt=7): 13 [] -v4_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 1.90/2.10 ** KEPT (pick-wt=7): 14 [] -v4_membered(A)| -element(B,A)|v1_xreal_0(B).
% 1.90/2.10 ** KEPT (pick-wt=7): 15 [] -v4_membered(A)| -element(B,A)|v1_int_1(B).
% 1.90/2.10 ** KEPT (pick-wt=7): 16 [] -v4_membered(A)| -element(B,A)|v1_rat_1(B).
% 1.90/2.10 ** KEPT (pick-wt=7): 17 [] -v5_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 1.90/2.10 ** KEPT (pick-wt=7): 18 [] -v5_membered(A)| -element(B,A)|natural(B).
% 1.90/2.10 ** KEPT (pick-wt=7): 19 [] -v5_membered(A)| -element(B,A)|v1_xreal_0(B).
% 1.90/2.10 ** KEPT (pick-wt=7): 20 [] -v5_membered(A)| -element(B,A)|v1_int_1(B).
% 1.90/2.10 ** KEPT (pick-wt=7): 21 [] -v5_membered(A)| -element(B,A)|v1_rat_1(B).
% 1.90/2.10 ** KEPT (pick-wt=8): 22 [] -v1_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 1.90/2.10 ** KEPT (pick-wt=8): 23 [] -v2_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 1.90/2.10 ** KEPT (pick-wt=8): 24 [] -v2_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 1.90/2.10 ** KEPT (pick-wt=8): 25 [] -v3_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 1.90/2.10 ** KEPT (pick-wt=8): 26 [] -v3_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 1.90/2.10 ** KEPT (pick-wt=8): 27 [] -v3_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 1.90/2.10 ** KEPT (pick-wt=8): 28 [] -v4_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 1.90/2.10 ** KEPT (pick-wt=8): 29 [] -v4_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 1.90/2.10 ** KEPT (pick-wt=8): 30 [] -v4_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 1.90/2.10 ** KEPT (pick-wt=8): 31 [] -v4_membered(A)| -element(B,powerset(A))|v4_membered(B).
% 1.90/2.10 ** KEPT (pick-wt=8): 32 [] -v5_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 1.90/2.10 ** KEPT (pick-wt=8): 33 [] -v5_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 1.90/2.10 ** KEPT (pick-wt=8): 34 [] -v5_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 1.90/2.10 ** KEPT (pick-wt=8): 35 [] -v5_membered(A)| -element(B,powerset(A))|v4_membered(B).
% 1.90/2.10 ** KEPT (pick-wt=8): 36 [] -v5_membered(A)| -element(B,powerset(A))|v5_membered(B).
% 1.90/2.10 ** KEPT (pick-wt=6): 37 [] -in(A,B)|element(A,B).
% 1.90/2.10 ** KEPT (pick-wt=10): 38 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.90/2.10 ** KEPT (pick-wt=9): 39 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.90/2.10 ** KEPT (pick-wt=5): 40 [] empty(A)| -empty($f1(A)).
% 1.90/2.10 ** KEPT (pick-wt=4): 41 [] -empty(A)|v1_membered(A).
% 1.90/2.10 ** KEPT (pick-wt=4): 42 [] -empty(A)|v2_membered(A).
% 1.90/2.10 ** KEPT (pick-wt=4): 43 [] -empty(A)|v3_membered(A).
% 1.90/2.10 ** KEPT (pick-wt=4): 44 [] -empty(A)|v4_membered(A).
% 1.90/2.10 ** KEPT (pick-wt=4): 45 [] -empty(A)|v5_membered(A).
% 1.90/2.10 ** KEPT (pick-wt=8): 46 [] -element(A,B)|empty(B)|in(A,B).
% 1.90/2.10 ** KEPT (pick-wt=5): 47 [] -empty(A)|A=empty_set.
% 1.90/2.10 ** KEPT (pick-wt=5): 48 [] -in(A,B)| -empty(B).
% 1.90/2.10 ** KEPT (pick-wt=7): 49 [] -empty(A)|A=B| -empty(B).
% 1.90/2.10 ** KEPT (pick-wt=3): 50 [] -empty(powerset(A)).
% 1.90/2.10 ** KEPT (pick-wt=7): 51 [] -element(A,powerset(B))|subset(A,B).
% 1.90/2.10 ** KEPT (pick-wt=7): 52 [] element(A,powerset(B))| -subset(A,B).
% 1.90/2.10 ** KEPT (pick-wt=8): 53 [] -one_sorted_str(A)|element(cast_as_carrier_subset(A),powerset(the_carrier(A))).
% 1.90/2.10 ** KEPT (pick-wt=7): 55 [copy,54,flip.2] -one_sorted_str(A)|the_carrier(A)=cast_as_carrier_subset(A).
% 1.90/2.10 ** KEPT (pick-wt=5): 57 [copy,56,flip.1] the_carrier($c3)!=cast_as_carrier_subset($c3).
% 1.90/2.10
% 1.90/2.10 ------------> process sos:
% 1.90/2.10 ** KEPT (pick-wt=3): 60 [] A=A.
% 1.90/2.10 ** KEPT (pick-wt=2): 61 [] v1_membered($c1).
% 1.90/2.10 ** KEPT (pick-wt=2): 62 [] v2_membered($c1).
% 1.90/2.10 ** KEPT (pick-wt=2): 63 [] v3_membered($c1).
% 1.90/2.10 ** KEPT (pick-wt=2): 64 [] v4_membered($c1).
% 1.90/2.10 ** KEPT (pick-wt=2): 65 [] v5_membered($c1).
% 1.90/2.10 ** KEPT (pick-wt=2): 66 [] empty(empty_set).
% 1.90/2.10 ** KEPT (pick-wt=2): 67 [] v1_membered(empty_set).
% 1.90/2.10 ** KEPT (pick-wt=2): 68 [] v2_membered(empty_set).
% 1.90/2.10 ** KEPT (pick-wt=2): 69 [] v3_membered(empty_set).
% 1.90/2.10 ** KEPT (pick-wt=2): 70 [] v4_membered(empty_set).
% 1.90/2.10 ** KEPT (pick-wt=2): 71 [] v5_membered(empty_set).
% 1.90/2.10 ** KEPT (pick-wt=3): 72 [] subset(A,A).
% 1.90/2.10 ** KEPT (pick-wt=7): 73 [] empty(A)|element($f1(A),powerset(A)).
% 1.90/2.10 ** KEPT (pick-wt=5): 74 [] element($f2(A),powerset(A)).
% 1.90/2.10 ** KEPT (pick-wt=3): 75 [] empty($f2(A)).
% 1.90/2.10 ** KEPT (pick-wt=4): 76 [] element($f3(A),A).
% 1.90/2.10 ** KEPT (pick-wt=2): 77 [] one_sorted_str($c2).
% 1.90/2.10 ** KEPT (pick-wt=2): 78 [] one_sorted_str($c3).
% 1.90/2.10 Following clause subsumed by 60 during input processing: 0 [copy,60,flip.1] A=A.
% 1.90/2.10 60 back subsumes 59.
% 1.90/2.10
% 1.90/2.10 ======= end of input processing =======
% 1.90/2.10
% 1.90/2.10 =========== start of search ===========
% 1.90/2.10
% 1.90/2.10 -------- PROOF --------
% 1.90/2.10
% 1.90/2.10 ----> UNIT CONFLICT at 0.00 sec ----> 86 [binary,84.1,57.1] $F.
% 1.90/2.10
% 1.90/2.10 Length of proof is 3. Level of proof is 2.
% 1.90/2.10
% 1.90/2.10 ---------------- PROOF ----------------
% 1.90/2.10 % SZS status Theorem
% 1.90/2.10 % SZS output start Refutation
% See solution above
% 1.90/2.10 ------------ end of proof -------------
% 1.90/2.10
% 1.90/2.10
% 1.90/2.10 Search stopped by max_proofs option.
% 1.90/2.10
% 1.90/2.10
% 1.90/2.10 Search stopped by max_proofs option.
% 1.90/2.10
% 1.90/2.10 ============ end of search ============
% 1.90/2.10
% 1.90/2.10 -------------- statistics -------------
% 1.90/2.10 clauses given 14
% 1.90/2.10 clauses generated 46
% 1.90/2.10 clauses kept 81
% 1.90/2.10 clauses forward subsumed 39
% 1.90/2.10 clauses back subsumed 1
% 1.90/2.10 Kbytes malloced 976
% 1.90/2.10
% 1.90/2.10 ----------- times (seconds) -----------
% 1.90/2.10 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.90/2.10 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.90/2.10 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.90/2.10
% 1.90/2.10 That finishes the proof of the theorem.
% 1.90/2.10
% 1.90/2.10 Process 23899 finished Wed Jul 27 07:58:37 2022
% 1.90/2.10 Otter interrupted
% 1.90/2.10 PROOF FOUND
%------------------------------------------------------------------------------