%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU309+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:35 EDT 2022
% Result : Theorem 2.82s 2.97s
% Output : Refutation 2.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 28 ( 18 unt; 0 nHn; 23 RR)
% Number of literals : 44 ( 19 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(41,axiom,
( ~ element(A,powerset(B))
| ~ element(C,powerset(B))
| subset_intersection2(B,A,C) = subset_intersection2(B,C,A) ),
file('SEU309+1.p',unknown),
[] ).
cnf(42,axiom,
( ~ one_sorted_str(A)
| cast_as_carrier_subset(A) = the_carrier(A) ),
file('SEU309+1.p',unknown),
[] ).
cnf(43,plain,
( ~ one_sorted_str(A)
| the_carrier(A) = cast_as_carrier_subset(A) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[42])]),
[iquote('copy,42,flip.2')] ).
cnf(46,axiom,
( ~ element(A,powerset(B))
| ~ element(C,powerset(B))
| element(subset_difference(B,A,C),powerset(B)) ),
file('SEU309+1.p',unknown),
[] ).
cnf(97,axiom,
( ~ element(A,powerset(B))
| ~ element(C,powerset(B))
| subset_intersection2(B,A,C) = set_intersection2(A,C) ),
file('SEU309+1.p',unknown),
[] ).
cnf(98,axiom,
( ~ element(A,powerset(B))
| ~ element(C,powerset(B))
| subset_difference(B,A,C) = set_difference(A,C) ),
file('SEU309+1.p',unknown),
[] ).
cnf(99,axiom,
( ~ one_sorted_str(A)
| ~ element(B,powerset(the_carrier(A)))
| subset_intersection2(the_carrier(A),B,cast_as_carrier_subset(A)) = B ),
file('SEU309+1.p',unknown),
[] ).
cnf(101,axiom,
subset_difference(the_carrier(dollar_c4),cast_as_carrier_subset(dollar_c4),subset_difference(the_carrier(dollar_c4),cast_as_carrier_subset(dollar_c4),dollar_c3)) != dollar_c3,
file('SEU309+1.p',unknown),
[] ).
cnf(104,axiom,
( element(A,powerset(B))
| ~ subset(A,B) ),
file('SEU309+1.p',unknown),
[] ).
cnf(117,axiom,
A = A,
file('SEU309+1.p',unknown),
[] ).
cnf(137,axiom,
subset(A,A),
file('SEU309+1.p',unknown),
[] ).
cnf(138,axiom,
one_sorted_str(dollar_c4),
file('SEU309+1.p',unknown),
[] ).
cnf(139,axiom,
element(dollar_c3,powerset(the_carrier(dollar_c4))),
file('SEU309+1.p',unknown),
[] ).
cnf(144,axiom,
set_difference(A,set_difference(A,B)) = set_intersection2(A,B),
file('SEU309+1.p',unknown),
[] ).
cnf(146,plain,
set_intersection2(A,B) = set_difference(A,set_difference(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[144])]),
[iquote('copy,144,flip.1')] ).
cnf(152,plain,
( ~ element(A,powerset(B))
| ~ element(C,powerset(B))
| subset_intersection2(B,A,C) = set_difference(A,set_difference(A,C)) ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[97]),146]),
[iquote('back_demod,97,demod,146')] ).
cnf(217,plain,
the_carrier(dollar_c4) = cast_as_carrier_subset(dollar_c4),
inference(hyper,[status(thm)],[138,43]),
[iquote('hyper,138,43')] ).
cnf(221,plain,
element(dollar_c3,powerset(cast_as_carrier_subset(dollar_c4))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[139]),217]),
[iquote('back_demod,139,demod,217')] ).
cnf(222,plain,
subset_difference(cast_as_carrier_subset(dollar_c4),cast_as_carrier_subset(dollar_c4),subset_difference(cast_as_carrier_subset(dollar_c4),cast_as_carrier_subset(dollar_c4),dollar_c3)) != dollar_c3,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[101]),217,217]),
[iquote('back_demod,101,demod,217,217')] ).
cnf(240,plain,
element(A,powerset(A)),
inference(hyper,[status(thm)],[137,104]),
[iquote('hyper,137,104')] ).
cnf(438,plain,
( ~ element(A,powerset(cast_as_carrier_subset(dollar_c4)))
| subset_intersection2(cast_as_carrier_subset(dollar_c4),A,cast_as_carrier_subset(dollar_c4)) = A ),
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[217,99]),217]),138]),
[iquote('para_from,216.1.1,99.3.1.1,demod,217,unit_del,138')] ).
cnf(445,plain,
set_difference(cast_as_carrier_subset(dollar_c4),set_difference(cast_as_carrier_subset(dollar_c4),dollar_c3)) = subset_intersection2(cast_as_carrier_subset(dollar_c4),cast_as_carrier_subset(dollar_c4),dollar_c3),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[221,152,240])]),
[iquote('hyper,221,152,240,flip.1')] ).
cnf(463,plain,
set_difference(cast_as_carrier_subset(dollar_c4),dollar_c3) = subset_difference(cast_as_carrier_subset(dollar_c4),cast_as_carrier_subset(dollar_c4),dollar_c3),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[221,98,240])]),
[iquote('hyper,221,98,240,flip.1')] ).
cnf(476,plain,
element(subset_difference(cast_as_carrier_subset(dollar_c4),cast_as_carrier_subset(dollar_c4),dollar_c3),powerset(cast_as_carrier_subset(dollar_c4))),
inference(hyper,[status(thm)],[221,46,240]),
[iquote('hyper,221,46,240')] ).
cnf(485,plain,
subset_intersection2(cast_as_carrier_subset(dollar_c4),cast_as_carrier_subset(dollar_c4),dollar_c3) = subset_intersection2(cast_as_carrier_subset(dollar_c4),dollar_c3,cast_as_carrier_subset(dollar_c4)),
inference(hyper,[status(thm)],[221,41,240]),
[iquote('hyper,221,41,240')] ).
cnf(489,plain,
set_difference(cast_as_carrier_subset(dollar_c4),subset_difference(cast_as_carrier_subset(dollar_c4),cast_as_carrier_subset(dollar_c4),dollar_c3)) = subset_intersection2(cast_as_carrier_subset(dollar_c4),dollar_c3,cast_as_carrier_subset(dollar_c4)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[445]),463,485]),
[iquote('back_demod,445,demod,463,485')] ).
cnf(845,plain,
subset_intersection2(cast_as_carrier_subset(dollar_c4),dollar_c3,cast_as_carrier_subset(dollar_c4)) != dollar_c3,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[222,98]),489]),240,476]),
[iquote('para_into,222.1.1,98.3.1,demod,489,unit_del,240,476')] ).
cnf(1234,plain,
$false,
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[845,438]),117,221]),
[iquote('para_into,845.1.1,438.2.1,unit_del,117,221')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU309+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/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 08:15:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.36/2.55 ----- Otter 3.3f, August 2004 -----
% 2.36/2.55 The process was started by sandbox2 on n015.cluster.edu,
% 2.36/2.55 Wed Jul 27 08:15:42 2022
% 2.36/2.55 The command was "./otter". The process ID is 21379.
% 2.36/2.55
% 2.36/2.55 set(prolog_style_variables).
% 2.36/2.55 set(auto).
% 2.36/2.55 dependent: set(auto1).
% 2.36/2.55 dependent: set(process_input).
% 2.36/2.55 dependent: clear(print_kept).
% 2.36/2.55 dependent: clear(print_new_demod).
% 2.36/2.55 dependent: clear(print_back_demod).
% 2.36/2.55 dependent: clear(print_back_sub).
% 2.36/2.55 dependent: set(control_memory).
% 2.36/2.55 dependent: assign(max_mem, 12000).
% 2.36/2.55 dependent: assign(pick_given_ratio, 4).
% 2.36/2.55 dependent: assign(stats_level, 1).
% 2.36/2.55 dependent: assign(max_seconds, 10800).
% 2.36/2.55 clear(print_given).
% 2.36/2.55
% 2.36/2.55 formula_list(usable).
% 2.36/2.55 all A (A=A).
% 2.36/2.55 all A B (in(A,B)-> -in(B,A)).
% 2.36/2.55 all A (v1_membered(A)-> (all B (element(B,A)->v1_xcmplx_0(B)))).
% 2.36/2.55 all A (v2_membered(A)-> (all B (element(B,A)->v1_xcmplx_0(B)&v1_xreal_0(B)))).
% 2.36/2.55 all A (v3_membered(A)-> (all B (element(B,A)->v1_xcmplx_0(B)&v1_xreal_0(B)&v1_rat_1(B)))).
% 2.36/2.55 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)))).
% 2.36/2.55 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)))).
% 2.36/2.55 all A (empty(A)->v1_membered(A)&v2_membered(A)&v3_membered(A)&v4_membered(A)&v5_membered(A)).
% 2.36/2.55 all A (v1_membered(A)-> (all B (element(B,powerset(A))->v1_membered(B)))).
% 2.36/2.55 all A (v2_membered(A)-> (all B (element(B,powerset(A))->v1_membered(B)&v2_membered(B)))).
% 2.36/2.55 all A (v3_membered(A)-> (all B (element(B,powerset(A))->v1_membered(B)&v2_membered(B)&v3_membered(B)))).
% 2.36/2.55 all A (v4_membered(A)-> (all B (element(B,powerset(A))->v1_membered(B)&v2_membered(B)&v3_membered(B)&v4_membered(B)))).
% 2.36/2.55 all A (v5_membered(A)->v4_membered(A)).
% 2.36/2.55 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)))).
% 2.36/2.55 all A (v4_membered(A)->v3_membered(A)).
% 2.36/2.55 all A (v3_membered(A)->v2_membered(A)).
% 2.36/2.55 all A (v2_membered(A)->v1_membered(A)).
% 2.36/2.55 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 2.36/2.55 all A B C (element(B,powerset(A))&element(C,powerset(A))->subset_intersection2(A,B,C)=subset_intersection2(A,C,B)).
% 2.36/2.55 all A (one_sorted_str(A)->cast_as_carrier_subset(A)=the_carrier(A)).
% 2.36/2.55 $T.
% 2.36/2.55 $T.
% 2.36/2.55 all A (one_sorted_str(A)->element(cast_as_carrier_subset(A),powerset(the_carrier(A)))).
% 2.36/2.55 $T.
% 2.36/2.55 $T.
% 2.36/2.55 all A B C (element(B,powerset(A))&element(C,powerset(A))->element(subset_intersection2(A,B,C),powerset(A))).
% 2.36/2.55 all A B C (element(B,powerset(A))&element(C,powerset(A))->element(subset_difference(A,B,C),powerset(A))).
% 2.36/2.55 $T.
% 2.36/2.55 $T.
% 2.36/2.55 $T.
% 2.36/2.55 exists A one_sorted_str(A).
% 2.36/2.55 all A exists B element(B,A).
% 2.36/2.55 all A (-empty(powerset(A))).
% 2.36/2.55 all A B (v1_membered(A)->v1_membered(set_intersection2(A,B))).
% 2.36/2.55 all A B (v1_membered(A)->v1_membered(set_intersection2(B,A))).
% 2.36/2.55 all A B (v2_membered(A)->v1_membered(set_intersection2(A,B))&v2_membered(set_intersection2(A,B))).
% 2.36/2.55 all A B (v2_membered(A)->v1_membered(set_intersection2(B,A))&v2_membered(set_intersection2(B,A))).
% 2.36/2.55 all A B (v3_membered(A)->v1_membered(set_intersection2(A,B))&v2_membered(set_intersection2(A,B))&v3_membered(set_intersection2(A,B))).
% 2.36/2.55 all A B (v3_membered(A)->v1_membered(set_intersection2(B,A))&v2_membered(set_intersection2(B,A))&v3_membered(set_intersection2(B,A))).
% 2.36/2.55 all A B (v4_membered(A)->v1_membered(set_intersection2(A,B))&v2_membered(set_intersection2(A,B))&v3_membered(set_intersection2(A,B))&v4_membered(set_intersection2(A,B))).
% 2.36/2.55 all A B (v4_membered(A)->v1_membered(set_intersection2(B,A))&v2_membered(set_intersection2(B,A))&v3_membered(set_intersection2(B,A))&v4_membered(set_intersection2(B,A))).
% 2.36/2.55 all A B (v5_membered(A)->v1_membered(set_intersection2(A,B))&v2_membered(set_intersection2(A,B))&v3_membered(set_intersection2(A,B))&v4_membered(set_intersection2(A,B))&v5_membered(set_intersection2(A,B))).
% 2.36/2.55 all A B (v5_membered(A)->v1_membered(set_intersection2(B,A))&v2_membered(set_intersection2(B,A))&v3_membered(set_intersection2(B,A))&v4_membered(set_intersection2(B,A))&v5_membered(set_intersection2(B,A))).
% 2.36/2.55 all A B (v1_membered(A)->v1_membered(set_difference(A,B))).
% 2.36/2.55 all A B (v2_membered(A)->v1_membered(set_difference(A,B))&v2_membered(set_difference(A,B))).
% 2.36/2.55 all A B (v3_membered(A)->v1_membered(set_difference(A,B))&v2_membered(set_difference(A,B))&v3_membered(set_difference(A,B))).
% 2.36/2.55 all A B (v4_membered(A)->v1_membered(set_difference(A,B))&v2_membered(set_difference(A,B))&v3_membered(set_difference(A,B))&v4_membered(set_difference(A,B))).
% 2.36/2.55 all A B (v5_membered(A)->v1_membered(set_difference(A,B))&v2_membered(set_difference(A,B))&v3_membered(set_difference(A,B))&v4_membered(set_difference(A,B))&v5_membered(set_difference(A,B))).
% 2.36/2.55 empty(empty_set).
% 2.36/2.55 v1_membered(empty_set).
% 2.36/2.55 v2_membered(empty_set).
% 2.36/2.55 v3_membered(empty_set).
% 2.36/2.55 v4_membered(empty_set).
% 2.36/2.55 v5_membered(empty_set).
% 2.36/2.55 all A B (set_intersection2(A,A)=A).
% 2.36/2.55 all A B C (element(B,powerset(A))&element(C,powerset(A))->subset_intersection2(A,B,B)=B).
% 2.36/2.55 exists A (-empty(A)&v1_membered(A)&v2_membered(A)&v3_membered(A)&v4_membered(A)&v5_membered(A)).
% 2.36/2.55 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.36/2.55 all A exists B (element(B,powerset(A))&empty(B)).
% 2.36/2.55 all A B C (element(B,powerset(A))&element(C,powerset(A))->subset_intersection2(A,B,C)=set_intersection2(B,C)).
% 2.36/2.55 all A B C (element(B,powerset(A))&element(C,powerset(A))->subset_difference(A,B,C)=set_difference(B,C)).
% 2.36/2.55 all A B subset(A,A).
% 2.36/2.55 all A (one_sorted_str(A)-> (all B (element(B,powerset(the_carrier(A)))->subset_intersection2(the_carrier(A),B,cast_as_carrier_subset(A))=B))).
% 2.36/2.55 all A B (in(A,B)->element(A,B)).
% 2.36/2.55 -(all A (one_sorted_str(A)-> (all B (element(B,powerset(the_carrier(A)))->subset_difference(the_carrier(A),cast_as_carrier_subset(A),subset_difference(the_carrier(A),cast_as_carrier_subset(A),B))=B)))).
% 2.36/2.55 all A (set_intersection2(A,empty_set)=empty_set).
% 2.36/2.55 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.36/2.55 all A (set_difference(A,empty_set)=A).
% 2.36/2.55 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.36/2.55 all A B (set_difference(A,set_difference(A,B))=set_intersection2(A,B)).
% 2.36/2.55 all A (set_difference(empty_set,A)=empty_set).
% 2.36/2.55 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.36/2.55 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.36/2.55 all A (empty(A)->A=empty_set).
% 2.36/2.55 all A B (-(in(A,B)&empty(B))).
% 2.36/2.55 all A B (-(empty(A)&A!=B&empty(B))).
% 2.36/2.55 end_of_list.
% 2.36/2.55
% 2.36/2.55 -------> usable clausifies to:
% 2.36/2.55
% 2.36/2.55 list(usable).
% 2.36/2.55 0 [] A=A.
% 2.36/2.55 0 [] -in(A,B)| -in(B,A).
% 2.36/2.55 0 [] -v1_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.36/2.55 0 [] -v2_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.36/2.55 0 [] -v2_membered(A)| -element(B,A)|v1_xreal_0(B).
% 2.36/2.55 0 [] -v3_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.36/2.55 0 [] -v3_membered(A)| -element(B,A)|v1_xreal_0(B).
% 2.36/2.55 0 [] -v3_membered(A)| -element(B,A)|v1_rat_1(B).
% 2.36/2.55 0 [] -v4_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.36/2.55 0 [] -v4_membered(A)| -element(B,A)|v1_xreal_0(B).
% 2.36/2.55 0 [] -v4_membered(A)| -element(B,A)|v1_int_1(B).
% 2.36/2.55 0 [] -v4_membered(A)| -element(B,A)|v1_rat_1(B).
% 2.36/2.55 0 [] -v5_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.36/2.55 0 [] -v5_membered(A)| -element(B,A)|natural(B).
% 2.36/2.55 0 [] -v5_membered(A)| -element(B,A)|v1_xreal_0(B).
% 2.36/2.55 0 [] -v5_membered(A)| -element(B,A)|v1_int_1(B).
% 2.36/2.55 0 [] -v5_membered(A)| -element(B,A)|v1_rat_1(B).
% 2.36/2.55 0 [] -empty(A)|v1_membered(A).
% 2.36/2.55 0 [] -empty(A)|v2_membered(A).
% 2.36/2.55 0 [] -empty(A)|v3_membered(A).
% 2.36/2.55 0 [] -empty(A)|v4_membered(A).
% 2.36/2.55 0 [] -empty(A)|v5_membered(A).
% 2.36/2.55 0 [] -v1_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.36/2.55 0 [] -v2_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.36/2.55 0 [] -v2_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 2.36/2.55 0 [] -v3_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.36/2.55 0 [] -v3_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 2.36/2.55 0 [] -v3_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 2.36/2.55 0 [] -v4_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.36/2.55 0 [] -v4_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 2.36/2.55 0 [] -v4_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 2.36/2.55 0 [] -v4_membered(A)| -element(B,powerset(A))|v4_membered(B).
% 2.36/2.55 0 [] -v5_membered(A)|v4_membered(A).
% 2.36/2.55 0 [] -v5_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.36/2.55 0 [] -v5_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 2.36/2.55 0 [] -v5_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 2.36/2.55 0 [] -v5_membered(A)| -element(B,powerset(A))|v4_membered(B).
% 2.36/2.55 0 [] -v5_membered(A)| -element(B,powerset(A))|v5_membered(B).
% 2.36/2.55 0 [] -v4_membered(A)|v3_membered(A).
% 2.36/2.55 0 [] -v3_membered(A)|v2_membered(A).
% 2.36/2.55 0 [] -v2_membered(A)|v1_membered(A).
% 2.36/2.55 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.36/2.55 0 [] -element(B,powerset(A))| -element(C,powerset(A))|subset_intersection2(A,B,C)=subset_intersection2(A,C,B).
% 2.36/2.55 0 [] -one_sorted_str(A)|cast_as_carrier_subset(A)=the_carrier(A).
% 2.36/2.55 0 [] $T.
% 2.36/2.55 0 [] $T.
% 2.36/2.55 0 [] -one_sorted_str(A)|element(cast_as_carrier_subset(A),powerset(the_carrier(A))).
% 2.36/2.55 0 [] $T.
% 2.36/2.55 0 [] $T.
% 2.36/2.55 0 [] -element(B,powerset(A))| -element(C,powerset(A))|element(subset_intersection2(A,B,C),powerset(A)).
% 2.36/2.55 0 [] -element(B,powerset(A))| -element(C,powerset(A))|element(subset_difference(A,B,C),powerset(A)).
% 2.36/2.55 0 [] $T.
% 2.36/2.55 0 [] $T.
% 2.36/2.55 0 [] $T.
% 2.36/2.55 0 [] one_sorted_str($c1).
% 2.36/2.55 0 [] element($f1(A),A).
% 2.36/2.55 0 [] -empty(powerset(A)).
% 2.36/2.55 0 [] -v1_membered(A)|v1_membered(set_intersection2(A,B)).
% 2.36/2.55 0 [] -v1_membered(A)|v1_membered(set_intersection2(B,A)).
% 2.36/2.55 0 [] -v2_membered(A)|v1_membered(set_intersection2(A,B)).
% 2.36/2.55 0 [] -v2_membered(A)|v2_membered(set_intersection2(A,B)).
% 2.36/2.55 0 [] -v2_membered(A)|v1_membered(set_intersection2(B,A)).
% 2.36/2.55 0 [] -v2_membered(A)|v2_membered(set_intersection2(B,A)).
% 2.36/2.55 0 [] -v3_membered(A)|v1_membered(set_intersection2(A,B)).
% 2.36/2.55 0 [] -v3_membered(A)|v2_membered(set_intersection2(A,B)).
% 2.36/2.55 0 [] -v3_membered(A)|v3_membered(set_intersection2(A,B)).
% 2.36/2.55 0 [] -v3_membered(A)|v1_membered(set_intersection2(B,A)).
% 2.36/2.55 0 [] -v3_membered(A)|v2_membered(set_intersection2(B,A)).
% 2.36/2.55 0 [] -v3_membered(A)|v3_membered(set_intersection2(B,A)).
% 2.36/2.55 0 [] -v4_membered(A)|v1_membered(set_intersection2(A,B)).
% 2.36/2.55 0 [] -v4_membered(A)|v2_membered(set_intersection2(A,B)).
% 2.36/2.55 0 [] -v4_membered(A)|v3_membered(set_intersection2(A,B)).
% 2.36/2.55 0 [] -v4_membered(A)|v4_membered(set_intersection2(A,B)).
% 2.36/2.55 0 [] -v4_membered(A)|v1_membered(set_intersection2(B,A)).
% 2.36/2.55 0 [] -v4_membered(A)|v2_membered(set_intersection2(B,A)).
% 2.36/2.55 0 [] -v4_membered(A)|v3_membered(set_intersection2(B,A)).
% 2.36/2.55 0 [] -v4_membered(A)|v4_membered(set_intersection2(B,A)).
% 2.36/2.55 0 [] -v5_membered(A)|v1_membered(set_intersection2(A,B)).
% 2.36/2.55 0 [] -v5_membered(A)|v2_membered(set_intersection2(A,B)).
% 2.36/2.55 0 [] -v5_membered(A)|v3_membered(set_intersection2(A,B)).
% 2.36/2.55 0 [] -v5_membered(A)|v4_membered(set_intersection2(A,B)).
% 2.36/2.55 0 [] -v5_membered(A)|v5_membered(set_intersection2(A,B)).
% 2.36/2.55 0 [] -v5_membered(A)|v1_membered(set_intersection2(B,A)).
% 2.36/2.55 0 [] -v5_membered(A)|v2_membered(set_intersection2(B,A)).
% 2.36/2.55 0 [] -v5_membered(A)|v3_membered(set_intersection2(B,A)).
% 2.36/2.55 0 [] -v5_membered(A)|v4_membered(set_intersection2(B,A)).
% 2.36/2.55 0 [] -v5_membered(A)|v5_membered(set_intersection2(B,A)).
% 2.36/2.55 0 [] -v1_membered(A)|v1_membered(set_difference(A,B)).
% 2.36/2.55 0 [] -v2_membered(A)|v1_membered(set_difference(A,B)).
% 2.36/2.55 0 [] -v2_membered(A)|v2_membered(set_difference(A,B)).
% 2.36/2.55 0 [] -v3_membered(A)|v1_membered(set_difference(A,B)).
% 2.36/2.55 0 [] -v3_membered(A)|v2_membered(set_difference(A,B)).
% 2.36/2.55 0 [] -v3_membered(A)|v3_membered(set_difference(A,B)).
% 2.36/2.55 0 [] -v4_membered(A)|v1_membered(set_difference(A,B)).
% 2.36/2.55 0 [] -v4_membered(A)|v2_membered(set_difference(A,B)).
% 2.36/2.55 0 [] -v4_membered(A)|v3_membered(set_difference(A,B)).
% 2.36/2.55 0 [] -v4_membered(A)|v4_membered(set_difference(A,B)).
% 2.36/2.55 0 [] -v5_membered(A)|v1_membered(set_difference(A,B)).
% 2.36/2.55 0 [] -v5_membered(A)|v2_membered(set_difference(A,B)).
% 2.36/2.55 0 [] -v5_membered(A)|v3_membered(set_difference(A,B)).
% 2.36/2.55 0 [] -v5_membered(A)|v4_membered(set_difference(A,B)).
% 2.36/2.55 0 [] -v5_membered(A)|v5_membered(set_difference(A,B)).
% 2.36/2.55 0 [] empty(empty_set).
% 2.36/2.55 0 [] v1_membered(empty_set).
% 2.36/2.55 0 [] v2_membered(empty_set).
% 2.36/2.55 0 [] v3_membered(empty_set).
% 2.36/2.55 0 [] v4_membered(empty_set).
% 2.36/2.55 0 [] v5_membered(empty_set).
% 2.36/2.55 0 [] set_intersection2(A,A)=A.
% 2.36/2.55 0 [] -element(B,powerset(A))| -element(C,powerset(A))|subset_intersection2(A,B,B)=B.
% 2.36/2.55 0 [] -empty($c2).
% 2.36/2.55 0 [] v1_membered($c2).
% 2.36/2.55 0 [] v2_membered($c2).
% 2.36/2.55 0 [] v3_membered($c2).
% 2.36/2.55 0 [] v4_membered($c2).
% 2.36/2.55 0 [] v5_membered($c2).
% 2.36/2.55 0 [] empty(A)|element($f2(A),powerset(A)).
% 2.36/2.55 0 [] empty(A)| -empty($f2(A)).
% 2.36/2.55 0 [] element($f3(A),powerset(A)).
% 2.36/2.55 0 [] empty($f3(A)).
% 2.36/2.55 0 [] -element(B,powerset(A))| -element(C,powerset(A))|subset_intersection2(A,B,C)=set_intersection2(B,C).
% 2.36/2.55 0 [] -element(B,powerset(A))| -element(C,powerset(A))|subset_difference(A,B,C)=set_difference(B,C).
% 2.36/2.55 0 [] subset(A,A).
% 2.36/2.55 0 [] -one_sorted_str(A)| -element(B,powerset(the_carrier(A)))|subset_intersection2(the_carrier(A),B,cast_as_carrier_subset(A))=B.
% 2.36/2.55 0 [] -in(A,B)|element(A,B).
% 2.36/2.55 0 [] one_sorted_str($c4).
% 2.36/2.55 0 [] element($c3,powerset(the_carrier($c4))).
% 2.36/2.55 0 [] subset_difference(the_carrier($c4),cast_as_carrier_subset($c4),subset_difference(the_carrier($c4),cast_as_carrier_subset($c4),$c3))!=$c3.
% 2.36/2.55 0 [] set_intersection2(A,empty_set)=empty_set.
% 2.36/2.55 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.36/2.55 0 [] set_difference(A,empty_set)=A.
% 2.36/2.55 0 [] -element(A,powerset(B))|subset(A,B).
% 2.36/2.55 0 [] element(A,powerset(B))| -subset(A,B).
% 2.36/2.55 0 [] set_difference(A,set_difference(A,B))=set_intersection2(A,B).
% 2.36/2.55 0 [] set_difference(empty_set,A)=empty_set.
% 2.36/2.55 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.36/2.55 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.36/2.55 0 [] -empty(A)|A=empty_set.
% 2.36/2.55 0 [] -in(A,B)| -empty(B).
% 2.36/2.55 0 [] -empty(A)|A=B| -empty(B).
% 2.36/2.55 end_of_list.
% 2.36/2.55
% 2.36/2.55 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 2.36/2.55
% 2.36/2.55 This ia a non-Horn set with equality. The strategy will be
% 2.36/2.55 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.36/2.55 deletion, with positive clauses in sos and nonpositive
% 2.36/2.55 clauses in usable.
% 2.36/2.55
% 2.36/2.55 dependent: set(knuth_bendix).
% 2.36/2.55 dependent: set(anl_eq).
% 2.36/2.55 dependent: set(para_from).
% 2.36/2.55 dependent: set(para_into).
% 2.36/2.55 dependent: clear(para_from_right).
% 2.36/2.55 dependent: clear(para_into_right).
% 2.36/2.55 dependent: set(para_from_vars).
% 2.36/2.55 dependent: set(eq_units_both_ways).
% 2.36/2.55 dependent: set(dynamic_demod_all).
% 2.36/2.55 dependent: set(dynamic_demod).
% 2.36/2.55 dependent: set(order_eq).
% 2.36/2.55 dependent: set(back_demod).
% 2.36/2.55 dependent: set(lrpo).
% 2.36/2.55 dependent: set(hyper_res).
% 2.36/2.55 dependent: set(unit_deletion).
% 2.36/2.55 dependent: set(factor).
% 2.36/2.55
% 2.36/2.55 ------------> process usable:
% 2.36/2.55 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.36/2.55 ** KEPT (pick-wt=7): 2 [] -v1_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.36/2.55 ** KEPT (pick-wt=7): 3 [] -v2_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.36/2.55 ** KEPT (pick-wt=7): 4 [] -v2_membered(A)| -element(B,A)|v1_xreal_0(B).
% 2.36/2.55 ** KEPT (pick-wt=7): 5 [] -v3_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.36/2.55 ** KEPT (pick-wt=7): 6 [] -v3_membered(A)| -element(B,A)|v1_xreal_0(B).
% 2.36/2.55 ** KEPT (pick-wt=7): 7 [] -v3_membered(A)| -element(B,A)|v1_rat_1(B).
% 2.36/2.55 ** KEPT (pick-wt=7): 8 [] -v4_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.36/2.55 ** KEPT (pick-wt=7): 9 [] -v4_membered(A)| -element(B,A)|v1_xreal_0(B).
% 2.36/2.55 ** KEPT (pick-wt=7): 10 [] -v4_membered(A)| -element(B,A)|v1_int_1(B).
% 2.36/2.55 ** KEPT (pick-wt=7): 11 [] -v4_membered(A)| -element(B,A)|v1_rat_1(B).
% 2.36/2.55 ** KEPT (pick-wt=7): 12 [] -v5_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.36/2.55 ** KEPT (pick-wt=7): 13 [] -v5_membered(A)| -element(B,A)|natural(B).
% 2.36/2.55 ** KEPT (pick-wt=7): 14 [] -v5_membered(A)| -element(B,A)|v1_xreal_0(B).
% 2.36/2.55 ** KEPT (pick-wt=7): 15 [] -v5_membered(A)| -element(B,A)|v1_int_1(B).
% 2.36/2.55 ** KEPT (pick-wt=7): 16 [] -v5_membered(A)| -element(B,A)|v1_rat_1(B).
% 2.36/2.55 ** KEPT (pick-wt=4): 17 [] -empty(A)|v1_membered(A).
% 2.36/2.55 ** KEPT (pick-wt=4): 18 [] -empty(A)|v2_membered(A).
% 2.36/2.55 ** KEPT (pick-wt=4): 19 [] -empty(A)|v3_membered(A).
% 2.36/2.55 ** KEPT (pick-wt=4): 20 [] -empty(A)|v4_membered(A).
% 2.36/2.55 ** KEPT (pick-wt=4): 21 [] -empty(A)|v5_membered(A).
% 2.36/2.55 ** KEPT (pick-wt=8): 22 [] -v1_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.36/2.55 ** KEPT (pick-wt=8): 23 [] -v2_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.36/2.55 ** KEPT (pick-wt=8): 24 [] -v2_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 2.36/2.55 ** KEPT (pick-wt=8): 25 [] -v3_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.36/2.55 ** KEPT (pick-wt=8): 26 [] -v3_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 2.36/2.55 ** KEPT (pick-wt=8): 27 [] -v3_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 2.36/2.55 ** KEPT (pick-wt=8): 28 [] -v4_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.36/2.55 ** KEPT (pick-wt=8): 29 [] -v4_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 2.36/2.55 ** KEPT (pick-wt=8): 30 [] -v4_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 2.36/2.55 ** KEPT (pick-wt=8): 31 [] -v4_membered(A)| -element(B,powerset(A))|v4_membered(B).
% 2.36/2.55 ** KEPT (pick-wt=4): 32 [] -v5_membered(A)|v4_membered(A).
% 2.36/2.55 ** KEPT (pick-wt=8): 33 [] -v5_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.36/2.55 ** KEPT (pick-wt=8): 34 [] -v5_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 2.36/2.55 ** KEPT (pick-wt=8): 35 [] -v5_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 2.36/2.55 ** KEPT (pick-wt=8): 36 [] -v5_membered(A)| -element(B,powerset(A))|v4_membered(B).
% 2.36/2.55 ** KEPT (pick-wt=8): 37 [] -v5_membered(A)| -element(B,powerset(A))|v5_membered(B).
% 2.36/2.55 ** KEPT (pick-wt=4): 38 [] -v4_membered(A)|v3_membered(A).
% 2.36/2.55 ** KEPT (pick-wt=4): 39 [] -v3_membered(A)|v2_membered(A).
% 2.36/2.55 ** KEPT (pick-wt=4): 40 [] -v2_membered(A)|v1_membered(A).
% 2.36/2.55 ** KEPT (pick-wt=17): 41 [] -element(A,powerset(B))| -element(C,powerset(B))|subset_intersection2(B,A,C)=subset_intersection2(B,C,A).
% 2.36/2.55 ** KEPT (pick-wt=7): 43 [copy,42,flip.2] -one_sorted_str(A)|the_carrier(A)=cast_as_carrier_subset(A).
% 2.36/2.55 ** KEPT (pick-wt=8): 44 [] -one_sorted_str(A)|element(cast_as_carrier_subset(A),powerset(the_carrier(A))).
% 2.36/2.55 ** KEPT (pick-wt=15): 45 [] -element(A,powerset(B))| -element(C,powerset(B))|element(subset_intersection2(B,A,C),powerset(B)).
% 2.36/2.55 ** KEPT (pick-wt=15): 46 [] -element(A,powerset(B))| -element(C,powerset(B))|element(subset_difference(B,A,C),powerset(B)).
% 2.36/2.55 ** KEPT (pick-wt=3): 47 [] -empty(powerset(A)).
% 2.36/2.55 ** KEPT (pick-wt=6): 48 [] -v1_membered(A)|v1_membered(set_intersection2(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 49 [] -v1_membered(A)|v1_membered(set_intersection2(B,A)).
% 2.36/2.55 ** KEPT (pick-wt=6): 50 [] -v2_membered(A)|v1_membered(set_intersection2(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 51 [] -v2_membered(A)|v2_membered(set_intersection2(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 52 [] -v2_membered(A)|v1_membered(set_intersection2(B,A)).
% 2.36/2.55 ** KEPT (pick-wt=6): 53 [] -v2_membered(A)|v2_membered(set_intersection2(B,A)).
% 2.36/2.55 ** KEPT (pick-wt=6): 54 [] -v3_membered(A)|v1_membered(set_intersection2(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 55 [] -v3_membered(A)|v2_membered(set_intersection2(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 56 [] -v3_membered(A)|v3_membered(set_intersection2(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 57 [] -v3_membered(A)|v1_membered(set_intersection2(B,A)).
% 2.36/2.55 ** KEPT (pick-wt=6): 58 [] -v3_membered(A)|v2_membered(set_intersection2(B,A)).
% 2.36/2.55 ** KEPT (pick-wt=6): 59 [] -v3_membered(A)|v3_membered(set_intersection2(B,A)).
% 2.36/2.55 ** KEPT (pick-wt=6): 60 [] -v4_membered(A)|v1_membered(set_intersection2(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 61 [] -v4_membered(A)|v2_membered(set_intersection2(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 62 [] -v4_membered(A)|v3_membered(set_intersection2(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 63 [] -v4_membered(A)|v4_membered(set_intersection2(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 64 [] -v4_membered(A)|v1_membered(set_intersection2(B,A)).
% 2.36/2.55 ** KEPT (pick-wt=6): 65 [] -v4_membered(A)|v2_membered(set_intersection2(B,A)).
% 2.36/2.55 ** KEPT (pick-wt=6): 66 [] -v4_membered(A)|v3_membered(set_intersection2(B,A)).
% 2.36/2.55 ** KEPT (pick-wt=6): 67 [] -v4_membered(A)|v4_membered(set_intersection2(B,A)).
% 2.36/2.55 ** KEPT (pick-wt=6): 68 [] -v5_membered(A)|v1_membered(set_intersection2(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 69 [] -v5_membered(A)|v2_membered(set_intersection2(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 70 [] -v5_membered(A)|v3_membered(set_intersection2(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 71 [] -v5_membered(A)|v4_membered(set_intersection2(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 72 [] -v5_membered(A)|v5_membered(set_intersection2(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 73 [] -v5_membered(A)|v1_membered(set_intersection2(B,A)).
% 2.36/2.55 ** KEPT (pick-wt=6): 74 [] -v5_membered(A)|v2_membered(set_intersection2(B,A)).
% 2.36/2.55 ** KEPT (pick-wt=6): 75 [] -v5_membered(A)|v3_membered(set_intersection2(B,A)).
% 2.36/2.55 ** KEPT (pick-wt=6): 76 [] -v5_membered(A)|v4_membered(set_intersection2(B,A)).
% 2.36/2.55 ** KEPT (pick-wt=6): 77 [] -v5_membered(A)|v5_membered(set_intersection2(B,A)).
% 2.36/2.55 ** KEPT (pick-wt=6): 78 [] -v1_membered(A)|v1_membered(set_difference(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 79 [] -v2_membered(A)|v1_membered(set_difference(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 80 [] -v2_membered(A)|v2_membered(set_difference(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 81 [] -v3_membered(A)|v1_membered(set_difference(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 82 [] -v3_membered(A)|v2_membered(set_difference(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 83 [] -v3_membered(A)|v3_membered(set_difference(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 84 [] -v4_membered(A)|v1_membered(set_difference(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 85 [] -v4_membered(A)|v2_membered(set_difference(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 86 [] -v4_membered(A)|v3_membered(set_difference(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 87 [] -v4_membered(A)|v4_membered(set_difference(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 88 [] -v5_membered(A)|v1_membered(set_difference(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 89 [] -v5_membered(A)|v2_membered(set_difference(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 90 [] -v5_membered(A)|v3_membered(set_difference(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 91 [] -v5_membered(A)|v4_membered(set_difference(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=6): 92 [] -v5_membered(A)|v5_membered(set_difference(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=10): 94 [copy,93,factor_simp] -element(A,powerset(B))|subset_intersection2(B,A,A)=A.
% 2.36/2.55 ** KEPT (pick-wt=2): 95 [] -empty($c2).
% 2.36/2.55 ** KEPT (pick-wt=5): 96 [] empty(A)| -empty($f2(A)).
% 2.36/2.55 ** KEPT (pick-wt=16): 97 [] -element(A,powerset(B))| -element(C,powerset(B))|subset_intersection2(B,A,C)=set_intersection2(A,C).
% 2.36/2.55 ** KEPT (pick-wt=16): 98 [] -element(A,powerset(B))| -element(C,powerset(B))|subset_difference(B,A,C)=set_difference(A,C).
% 2.36/2.55 ** KEPT (pick-wt=15): 99 [] -one_sorted_str(A)| -element(B,powerset(the_carrier(A)))|subset_intersection2(the_carrier(A),B,cast_as_carrier_subset(A))=B.
% 2.36/2.55 ** KEPT (pick-wt=6): 100 [] -in(A,B)|element(A,B).
% 2.36/2.55 ** KEPT (pick-wt=13): 101 [] subset_difference(the_carrier($c4),cast_as_carrier_subset($c4),subset_difference(the_carrier($c4),cast_as_carrier_subset($c4),$c3))!=$c3.
% 2.36/2.55 ** KEPT (pick-wt=8): 102 [] -element(A,B)|empty(B)|in(A,B).
% 2.36/2.55 ** KEPT (pick-wt=7): 103 [] -element(A,powerset(B))|subset(A,B).
% 2.36/2.55 ** KEPT (pick-wt=7): 104 [] element(A,powerset(B))| -subset(A,B).
% 2.36/2.55 ** KEPT (pick-wt=10): 105 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.36/2.55 ** KEPT (pick-wt=9): 106 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.36/2.55 ** KEPT (pick-wt=5): 107 [] -empty(A)|A=empty_set.
% 2.36/2.55 ** KEPT (pick-wt=5): 108 [] -in(A,B)| -empty(B).
% 2.36/2.55 ** KEPT (pick-wt=7): 109 [] -empty(A)|A=B| -empty(B).
% 2.36/2.55
% 2.36/2.55 ------------> process sos:
% 2.36/2.55 ** KEPT (pick-wt=3): 117 [] A=A.
% 2.36/2.55 ** KEPT (pick-wt=7): 118 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.36/2.55 ** KEPT (pick-wt=2): 119 [] one_sorted_str($c1).
% 2.36/2.55 ** KEPT (pick-wt=4): 120 [] element($f1(A),A).
% 2.36/2.55 ** KEPT (pick-wt=2): 121 [] empty(empty_set).
% 2.36/2.55 ** KEPT (pick-wt=2): 122 [] v1_membered(empty_set).
% 2.36/2.55 ** KEPT (pick-wt=2): 123 [] v2_membered(empty_set).
% 2.36/2.55 ** KEPT (pick-wt=2): 124 [] v3_membered(empty_set).
% 2.36/2.55 ** KEPT (pick-wt=2): 125 [] v4_membered(empty_set).
% 2.36/2.55 ** KEPT (pick-wt=2): 126 [] v5_membered(empty_set).
% 2.36/2.55 ** KEPT (pick-wt=5): 127 [] set_intersection2(A,A)=A.
% 2.36/2.55 ---> New Demodulator: 128 [new_demod,127] set_intersection2(A,A)=A.
% 2.36/2.55 ** KEPT (pick-wt=2): 129 [] v1_membered($c2).
% 2.36/2.55 ** KEPT (pick-wt=2): 130 [] v2_membered($c2).
% 2.36/2.55 ** KEPT (pick-wt=2): 131 [] v3_membered($c2).
% 2.36/2.55 ** KEPT (pick-wt=2): 132 [] v4_membered($c2).
% 2.36/2.55 ** KEPT (pick-wt=2): 133 [] v5_membered($c2).
% 2.36/2.55 ** KEPT (pick-wt=7): 134 [] empty(A)|element($f2(A),powerset(A)).
% 2.36/2.55 ** KEPT (pick-wt=5): 135 [] element($f3(A),powerset(A)).
% 2.36/2.55 ** KEPT (pick-wt=3): 136 [] empty($f3(A)).
% 2.36/2.55 ** KEPT (pick-wt=3): 137 [] subset(A,A).
% 2.36/2.55 ** KEPT (pick-wt=2): 138 [] one_sorted_str($c4).
% 2.36/2.55 ** KEPT (pick-wt=5): 139 [] element($c3,powerset(the_carrier($c4))).
% 2.36/2.55 ** KEPT (pick-wt=5): 140 [] set_intersection2(A,empty_set)=empty_set.
% 2.36/2.55 ---> New Demodulator: 141 [new_demod,140] set_intersection2(A,empty_set)=empty_set.
% 2.36/2.55 ** KEPT (pick-wt=5): 142 [] set_difference(A,empty_set)=A.
% 2.36/2.55 ---> New Demodulator: 143 [new_demod,142] set_difference(A,empty_set)=A.
% 2.36/2.55 ** KEPT (pick-wt=9): 145 [copy,144,flip.1] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 2.36/2.55 ---> New Demodulator: 146 [new_demod,145] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 2.36/2.55 ** KEPT (pick-wt=5): 147 [] set_difference(empty_set,A)=empty_set.
% 2.36/2.55 ---> New Demodulator: 148 [new_demod,147] set_difference(empty_set,A)=empty_set.
% 2.36/2.55 Following clause subsumed by 117 during input processing: 0 [copy,117,flip.1] A=A.
% 2.36/2.55 117 back subsumes 116.
% 2.36/2.55 117 back subsumes 111.
% 2.36/2.55 ** KEPT (pick-wt=11): 149 [copy,118,flip.1,demod,146,146] set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 2.36/2.55 >>>> Starting back demodulation with 128.
% 2.36/2.55 >> back demodulating 114 with 128.
% 2.36/2.55 >>>> Starting back demodulation with 141.
% 2.82/2.97 >>>> Starting back demodulation with 143.
% 2.82/2.97 >>>> Starting back demodulation with 146.
% 2.82/2.97 >> back demodulating 140 with 146.
% 2.82/2.97 >> back demodulating 127 with 146.
% 2.82/2.97 >> back demodulating 118 with 146.
% 2.82/2.97 >> back demodulating 97 with 146.
% 2.82/2.97 >> back demodulating 77 with 146.
% 2.82/2.97 >> back demodulating 76 with 146.
% 2.82/2.97 >> back demodulating 75 with 146.
% 2.82/2.97 >> back demodulating 74 with 146.
% 2.82/2.97 >> back demodulating 73 with 146.
% 2.82/2.97 >> back demodulating 72 with 146.
% 2.82/2.97 >> back demodulating 71 with 146.
% 2.82/2.97 >> back demodulating 70 with 146.
% 2.82/2.97 >> back demodulating 69 with 146.
% 2.82/2.97 >> back demodulating 68 with 146.
% 2.82/2.97 >> back demodulating 67 with 146.
% 2.82/2.97 >> back demodulating 66 with 146.
% 2.82/2.97 >> back demodulating 65 with 146.
% 2.82/2.97 >> back demodulating 64 with 146.
% 2.82/2.97 >> back demodulating 63 with 146.
% 2.82/2.97 >> back demodulating 62 with 146.
% 2.82/2.97 >> back demodulating 61 with 146.
% 2.82/2.97 >> back demodulating 60 with 146.
% 2.82/2.97 >> back demodulating 59 with 146.
% 2.82/2.97 >> back demodulating 58 with 146.
% 2.82/2.97 >> back demodulating 57 with 146.
% 2.82/2.97 >> back demodulating 56 with 146.
% 2.82/2.97 >> back demodulating 55 with 146.
% 2.82/2.97 >> back demodulating 54 with 146.
% 2.82/2.97 >> back demodulating 53 with 146.
% 2.82/2.97 >> back demodulating 52 with 146.
% 2.82/2.97 >> back demodulating 51 with 146.
% 2.82/2.97 >> back demodulating 50 with 146.
% 2.82/2.97 >> back demodulating 49 with 146.
% 2.82/2.97 >> back demodulating 48 with 146.
% 2.82/2.97 >>>> Starting back demodulation with 148.
% 2.82/2.97 Following clause subsumed by 149 during input processing: 0 [copy,149,flip.1] set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 2.82/2.97 >>>> Starting back demodulation with 151.
% 2.82/2.97 >> back demodulating 115 with 151.
% 2.82/2.97
% 2.82/2.97 ======= end of input processing =======
% 2.82/2.97
% 2.82/2.97 =========== start of search ===========
% 2.82/2.97
% 2.82/2.97
% 2.82/2.97 Resetting weight limit to 6.
% 2.82/2.97
% 2.82/2.97
% 2.82/2.97 Resetting weight limit to 6.
% 2.82/2.97
% 2.82/2.97 sos_size=769
% 2.82/2.97
% 2.82/2.97 -------- PROOF --------
% 2.82/2.97
% 2.82/2.97 -----> EMPTY CLAUSE at 0.42 sec ----> 1234 [para_into,845.1.1,438.2.1,unit_del,117,221] $F.
% 2.82/2.97
% 2.82/2.97 Length of proof is 14. Level of proof is 6.
% 2.82/2.97
% 2.82/2.97 ---------------- PROOF ----------------
% 2.82/2.97 % SZS status Theorem
% 2.82/2.97 % SZS output start Refutation
% See solution above
% 2.82/2.97 ------------ end of proof -------------
% 2.82/2.97
% 2.82/2.97
% 2.82/2.97 Search stopped by max_proofs option.
% 2.82/2.97
% 2.82/2.97
% 2.82/2.97 Search stopped by max_proofs option.
% 2.82/2.97
% 2.82/2.97 ============ end of search ============
% 2.82/2.97
% 2.82/2.97 -------------- statistics -------------
% 2.82/2.97 clauses given 485
% 2.82/2.97 clauses generated 40936
% 2.82/2.97 clauses kept 1130
% 2.82/2.97 clauses forward subsumed 5080
% 2.82/2.97 clauses back subsumed 12
% 2.82/2.97 Kbytes malloced 5859
% 2.82/2.97
% 2.82/2.97 ----------- times (seconds) -----------
% 2.82/2.97 user CPU time 0.42 (0 hr, 0 min, 0 sec)
% 2.82/2.97 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.82/2.97 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.82/2.97
% 2.82/2.97 That finishes the proof of the theorem.
% 2.82/2.97
% 2.82/2.97 Process 21379 finished Wed Jul 27 08:15:44 2022
% 2.82/2.97 Otter interrupted
% 2.82/2.97 PROOF FOUND
%------------------------------------------------------------------------------