TSTP Solution File: SEU148+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU148+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:14:55 EDT 2022
% Result : Theorem 2.29s 2.43s
% Output : Refutation 2.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 11 unt; 1 nHn; 10 RR)
% Number of literals : 24 ( 13 equ; 9 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(13,axiom,
( A != unordered_pair(B,C)
| ~ in(D,A)
| D = B
| D = C ),
file('SEU148+2.p',unknown),
[] ).
cnf(14,axiom,
( A != unordered_pair(B,C)
| in(D,A)
| D != B ),
file('SEU148+2.p',unknown),
[] ).
cnf(23,axiom,
( ~ subset(A,B)
| ~ in(C,A)
| in(C,B) ),
file('SEU148+2.p',unknown),
[] ).
cnf(67,axiom,
dollar_c4 != dollar_c3,
file('SEU148+2.p',unknown),
[] ).
cnf(75,plain,
( A != unordered_pair(B,B)
| ~ in(C,A)
| C = B ),
inference(factor,[status(thm)],[13]),
[iquote('factor,13.3.4')] ).
cnf(92,axiom,
A = A,
file('SEU148+2.p',unknown),
[] ).
cnf(93,axiom,
unordered_pair(A,B) = unordered_pair(B,A),
file('SEU148+2.p',unknown),
[] ).
cnf(138,axiom,
unordered_pair(A,A) = singleton(A),
file('SEU148+2.p',unknown),
[] ).
cnf(140,plain,
singleton(A) = unordered_pair(A,A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[138])]),
[iquote('copy,138,flip.1')] ).
cnf(141,axiom,
subset(singleton(dollar_c4),singleton(dollar_c3)),
file('SEU148+2.p',unknown),
[] ).
cnf(142,plain,
subset(unordered_pair(dollar_c4,dollar_c4),unordered_pair(dollar_c3,dollar_c3)),
inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[141]),140,140]),
[iquote('copy,141,demod,140,140')] ).
cnf(181,plain,
in(A,unordered_pair(A,B)),
inference(hyper,[status(thm)],[92,14,92]),
[iquote('hyper,92,14,92')] ).
cnf(1628,plain,
in(dollar_c4,unordered_pair(dollar_c3,dollar_c3)),
inference(hyper,[status(thm)],[142,23,181]),
[iquote('hyper,142,23,181')] ).
cnf(1633,plain,
dollar_c4 = dollar_c3,
inference(hyper,[status(thm)],[1628,75,93]),
[iquote('hyper,1628,75,93')] ).
cnf(1635,plain,
$false,
inference(binary,[status(thm)],[1633,67]),
[iquote('binary,1633.1,67.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU148+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n016.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:22:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.59/2.13 ----- Otter 3.3f, August 2004 -----
% 1.59/2.13 The process was started by sandbox2 on n016.cluster.edu,
% 1.59/2.13 Wed Jul 27 08:22:52 2022
% 1.59/2.13 The command was "./otter". The process ID is 2727.
% 1.59/2.13
% 1.59/2.13 set(prolog_style_variables).
% 1.59/2.13 set(auto).
% 1.59/2.13 dependent: set(auto1).
% 1.59/2.13 dependent: set(process_input).
% 1.59/2.13 dependent: clear(print_kept).
% 1.59/2.13 dependent: clear(print_new_demod).
% 1.59/2.13 dependent: clear(print_back_demod).
% 1.59/2.13 dependent: clear(print_back_sub).
% 1.59/2.13 dependent: set(control_memory).
% 1.59/2.13 dependent: assign(max_mem, 12000).
% 1.59/2.13 dependent: assign(pick_given_ratio, 4).
% 1.59/2.13 dependent: assign(stats_level, 1).
% 1.59/2.13 dependent: assign(max_seconds, 10800).
% 1.59/2.13 clear(print_given).
% 1.59/2.13
% 1.59/2.13 formula_list(usable).
% 1.59/2.13 all A (A=A).
% 1.59/2.13 all A B (in(A,B)-> -in(B,A)).
% 1.59/2.13 all A B (proper_subset(A,B)-> -proper_subset(B,A)).
% 1.59/2.13 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.59/2.13 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.59/2.13 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.59/2.13 all A B (A=B<->subset(A,B)&subset(B,A)).
% 1.59/2.13 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 1.59/2.13 all A (A=empty_set<-> (all B (-in(B,A)))).
% 1.59/2.13 all A B (B=powerset(A)<-> (all C (in(C,B)<->subset(C,A)))).
% 1.59/2.13 all A B C (C=unordered_pair(A,B)<-> (all D (in(D,C)<->D=A|D=B))).
% 1.59/2.13 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 1.59/2.13 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.59/2.13 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 1.59/2.13 all A B C (C=set_difference(A,B)<-> (all D (in(D,C)<->in(D,A)& -in(D,B)))).
% 1.59/2.13 all A B (disjoint(A,B)<->set_intersection2(A,B)=empty_set).
% 1.59/2.13 all A B (proper_subset(A,B)<->subset(A,B)&A!=B).
% 1.59/2.13 $T.
% 1.59/2.13 $T.
% 1.59/2.13 $T.
% 1.59/2.13 $T.
% 1.59/2.13 $T.
% 1.59/2.13 $T.
% 1.59/2.13 $T.
% 1.59/2.13 empty(empty_set).
% 1.59/2.13 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 1.59/2.13 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 1.59/2.13 all A B (set_union2(A,A)=A).
% 1.59/2.13 all A B (set_intersection2(A,A)=A).
% 1.59/2.13 all A B (-proper_subset(A,A)).
% 1.59/2.13 all A (singleton(A)!=empty_set).
% 1.59/2.13 all A B (subset(singleton(A),B)<->in(A,B)).
% 1.59/2.13 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 1.59/2.13 all A B C (subset(A,B)->in(C,A)|subset(A,set_difference(B,singleton(C)))).
% 1.59/2.13 all A B (subset(A,singleton(B))<->A=empty_set|A=singleton(B)).
% 1.59/2.13 exists A empty(A).
% 1.59/2.13 exists A (-empty(A)).
% 1.59/2.13 all A B subset(A,A).
% 1.59/2.13 all A B (disjoint(A,B)->disjoint(B,A)).
% 1.59/2.13 all A B (subset(A,B)->set_union2(A,B)=B).
% 1.59/2.13 all A B subset(set_intersection2(A,B),A).
% 1.59/2.13 all A B C (subset(A,B)&subset(A,C)->subset(A,set_intersection2(B,C))).
% 1.59/2.13 all A (set_union2(A,empty_set)=A).
% 1.59/2.13 all A B C (subset(A,B)&subset(B,C)->subset(A,C)).
% 1.59/2.13 powerset(empty_set)=singleton(empty_set).
% 1.59/2.13 all A B C (subset(A,B)->subset(set_intersection2(A,C),set_intersection2(B,C))).
% 1.59/2.13 all A B (subset(A,B)->set_intersection2(A,B)=A).
% 1.59/2.13 all A (set_intersection2(A,empty_set)=empty_set).
% 1.59/2.13 all A B ((all C (in(C,A)<->in(C,B)))->A=B).
% 1.59/2.13 all A subset(empty_set,A).
% 1.59/2.13 all A B C (subset(A,B)->subset(set_difference(A,C),set_difference(B,C))).
% 1.59/2.13 all A B subset(set_difference(A,B),A).
% 1.59/2.13 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 1.59/2.13 all A B (set_union2(A,set_difference(B,A))=set_union2(A,B)).
% 1.59/2.13 all A (set_difference(A,empty_set)=A).
% 1.59/2.13 all A B (-(-disjoint(A,B)& (all C (-(in(C,A)&in(C,B)))))& -((exists C (in(C,A)&in(C,B)))&disjoint(A,B))).
% 1.59/2.13 all A (subset(A,empty_set)->A=empty_set).
% 1.59/2.13 all A B (set_difference(set_union2(A,B),B)=set_difference(A,B)).
% 1.59/2.13 all A B (subset(A,B)->B=set_union2(A,set_difference(B,A))).
% 1.59/2.13 all A B (set_difference(A,set_difference(A,B))=set_intersection2(A,B)).
% 1.59/2.13 all A (set_difference(empty_set,A)=empty_set).
% 1.59/2.13 all A B (-(-disjoint(A,B)& (all C (-in(C,set_intersection2(A,B)))))& -((exists C in(C,set_intersection2(A,B)))&disjoint(A,B))).
% 1.59/2.13 all A B (-(subset(A,B)&proper_subset(B,A))).
% 1.59/2.13 all A B C (subset(A,B)&disjoint(B,C)->disjoint(A,C)).
% 1.59/2.13 all A (unordered_pair(A,A)=singleton(A)).
% 1.59/2.13 all A (empty(A)->A=empty_set).
% 1.59/2.13 -(all A B (subset(singleton(A),singleton(B))->A=B)).
% 1.59/2.13 all A B (-(in(A,B)&empty(B))).
% 1.59/2.13 all A B subset(A,set_union2(A,B)).
% 1.59/2.13 all A B (disjoint(A,B)<->set_difference(A,B)=A).
% 1.59/2.13 all A B (-(empty(A)&A!=B&empty(B))).
% 1.59/2.13 all A B C (subset(A,B)&subset(C,B)->subset(set_union2(A,C),B)).
% 1.59/2.13 end_of_list.
% 1.59/2.13
% 1.59/2.13 -------> usable clausifies to:
% 1.59/2.13
% 1.59/2.13 list(usable).
% 1.59/2.13 0 [] A=A.
% 1.59/2.13 0 [] -in(A,B)| -in(B,A).
% 1.59/2.13 0 [] -proper_subset(A,B)| -proper_subset(B,A).
% 1.59/2.13 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.59/2.13 0 [] set_union2(A,B)=set_union2(B,A).
% 1.59/2.13 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.59/2.13 0 [] A!=B|subset(A,B).
% 1.59/2.13 0 [] A!=B|subset(B,A).
% 1.59/2.13 0 [] A=B| -subset(A,B)| -subset(B,A).
% 1.59/2.13 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 1.59/2.13 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 1.59/2.13 0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A.
% 1.59/2.13 0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A.
% 1.59/2.13 0 [] A!=empty_set| -in(B,A).
% 1.59/2.13 0 [] A=empty_set|in($f2(A),A).
% 1.59/2.13 0 [] B!=powerset(A)| -in(C,B)|subset(C,A).
% 1.59/2.13 0 [] B!=powerset(A)|in(C,B)| -subset(C,A).
% 1.59/2.13 0 [] B=powerset(A)|in($f3(A,B),B)|subset($f3(A,B),A).
% 1.59/2.13 0 [] B=powerset(A)| -in($f3(A,B),B)| -subset($f3(A,B),A).
% 1.59/2.13 0 [] C!=unordered_pair(A,B)| -in(D,C)|D=A|D=B.
% 1.59/2.13 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=A.
% 1.59/2.13 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=B.
% 1.59/2.13 0 [] C=unordered_pair(A,B)|in($f4(A,B,C),C)|$f4(A,B,C)=A|$f4(A,B,C)=B.
% 1.59/2.13 0 [] C=unordered_pair(A,B)| -in($f4(A,B,C),C)|$f4(A,B,C)!=A.
% 1.59/2.13 0 [] C=unordered_pair(A,B)| -in($f4(A,B,C),C)|$f4(A,B,C)!=B.
% 1.59/2.13 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 1.59/2.13 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 1.59/2.13 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 1.59/2.13 0 [] C=set_union2(A,B)|in($f5(A,B,C),C)|in($f5(A,B,C),A)|in($f5(A,B,C),B).
% 1.59/2.13 0 [] C=set_union2(A,B)| -in($f5(A,B,C),C)| -in($f5(A,B,C),A).
% 1.59/2.13 0 [] C=set_union2(A,B)| -in($f5(A,B,C),C)| -in($f5(A,B,C),B).
% 1.59/2.13 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.59/2.13 0 [] subset(A,B)|in($f6(A,B),A).
% 1.59/2.13 0 [] subset(A,B)| -in($f6(A,B),B).
% 1.59/2.13 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 1.59/2.13 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 1.59/2.13 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 1.59/2.13 0 [] C=set_intersection2(A,B)|in($f7(A,B,C),C)|in($f7(A,B,C),A).
% 1.59/2.13 0 [] C=set_intersection2(A,B)|in($f7(A,B,C),C)|in($f7(A,B,C),B).
% 1.59/2.13 0 [] C=set_intersection2(A,B)| -in($f7(A,B,C),C)| -in($f7(A,B,C),A)| -in($f7(A,B,C),B).
% 1.59/2.13 0 [] C!=set_difference(A,B)| -in(D,C)|in(D,A).
% 1.59/2.13 0 [] C!=set_difference(A,B)| -in(D,C)| -in(D,B).
% 1.59/2.13 0 [] C!=set_difference(A,B)|in(D,C)| -in(D,A)|in(D,B).
% 1.59/2.13 0 [] C=set_difference(A,B)|in($f8(A,B,C),C)|in($f8(A,B,C),A).
% 1.59/2.13 0 [] C=set_difference(A,B)|in($f8(A,B,C),C)| -in($f8(A,B,C),B).
% 1.59/2.13 0 [] C=set_difference(A,B)| -in($f8(A,B,C),C)| -in($f8(A,B,C),A)|in($f8(A,B,C),B).
% 1.59/2.13 0 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 1.59/2.13 0 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 1.59/2.13 0 [] -proper_subset(A,B)|subset(A,B).
% 1.59/2.13 0 [] -proper_subset(A,B)|A!=B.
% 1.59/2.13 0 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 1.59/2.13 0 [] $T.
% 1.59/2.13 0 [] $T.
% 1.59/2.13 0 [] $T.
% 1.59/2.13 0 [] $T.
% 1.59/2.13 0 [] $T.
% 1.59/2.13 0 [] $T.
% 1.59/2.13 0 [] $T.
% 1.59/2.13 0 [] empty(empty_set).
% 1.59/2.13 0 [] empty(A)| -empty(set_union2(A,B)).
% 1.59/2.13 0 [] empty(A)| -empty(set_union2(B,A)).
% 1.59/2.13 0 [] set_union2(A,A)=A.
% 1.59/2.13 0 [] set_intersection2(A,A)=A.
% 1.59/2.13 0 [] -proper_subset(A,A).
% 1.59/2.13 0 [] singleton(A)!=empty_set.
% 1.59/2.13 0 [] -subset(singleton(A),B)|in(A,B).
% 1.59/2.13 0 [] subset(singleton(A),B)| -in(A,B).
% 1.59/2.13 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.59/2.13 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.59/2.13 0 [] -subset(A,B)|in(C,A)|subset(A,set_difference(B,singleton(C))).
% 1.59/2.13 0 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 1.59/2.13 0 [] subset(A,singleton(B))|A!=empty_set.
% 1.59/2.13 0 [] subset(A,singleton(B))|A!=singleton(B).
% 1.59/2.13 0 [] empty($c1).
% 1.59/2.13 0 [] -empty($c2).
% 1.59/2.13 0 [] subset(A,A).
% 1.59/2.13 0 [] -disjoint(A,B)|disjoint(B,A).
% 1.59/2.13 0 [] -subset(A,B)|set_union2(A,B)=B.
% 1.59/2.13 0 [] subset(set_intersection2(A,B),A).
% 1.59/2.13 0 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 1.59/2.13 0 [] set_union2(A,empty_set)=A.
% 1.59/2.13 0 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 1.59/2.13 0 [] powerset(empty_set)=singleton(empty_set).
% 1.59/2.13 0 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 1.59/2.13 0 [] -subset(A,B)|set_intersection2(A,B)=A.
% 1.59/2.13 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.59/2.13 0 [] in($f9(A,B),A)|in($f9(A,B),B)|A=B.
% 1.59/2.13 0 [] -in($f9(A,B),A)| -in($f9(A,B),B)|A=B.
% 1.59/2.13 0 [] subset(empty_set,A).
% 1.59/2.13 0 [] -subset(A,B)|subset(set_difference(A,C),set_difference(B,C)).
% 1.59/2.13 0 [] subset(set_difference(A,B),A).
% 1.59/2.13 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.59/2.13 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.59/2.13 0 [] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 1.59/2.13 0 [] set_difference(A,empty_set)=A.
% 1.59/2.13 0 [] disjoint(A,B)|in($f10(A,B),A).
% 1.59/2.13 0 [] disjoint(A,B)|in($f10(A,B),B).
% 1.59/2.13 0 [] -in(C,A)| -in(C,B)| -disjoint(A,B).
% 1.59/2.13 0 [] -subset(A,empty_set)|A=empty_set.
% 1.59/2.13 0 [] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 1.59/2.13 0 [] -subset(A,B)|B=set_union2(A,set_difference(B,A)).
% 1.59/2.13 0 [] set_difference(A,set_difference(A,B))=set_intersection2(A,B).
% 1.59/2.13 0 [] set_difference(empty_set,A)=empty_set.
% 1.59/2.13 0 [] disjoint(A,B)|in($f11(A,B),set_intersection2(A,B)).
% 1.59/2.13 0 [] -in(C,set_intersection2(A,B))| -disjoint(A,B).
% 1.59/2.13 0 [] -subset(A,B)| -proper_subset(B,A).
% 1.59/2.13 0 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 1.59/2.13 0 [] unordered_pair(A,A)=singleton(A).
% 1.59/2.13 0 [] -empty(A)|A=empty_set.
% 1.59/2.13 0 [] subset(singleton($c4),singleton($c3)).
% 1.59/2.13 0 [] $c4!=$c3.
% 1.59/2.13 0 [] -in(A,B)| -empty(B).
% 1.59/2.13 0 [] subset(A,set_union2(A,B)).
% 1.59/2.13 0 [] -disjoint(A,B)|set_difference(A,B)=A.
% 1.59/2.13 0 [] disjoint(A,B)|set_difference(A,B)!=A.
% 1.59/2.13 0 [] -empty(A)|A=B| -empty(B).
% 1.59/2.13 0 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 1.59/2.13 end_of_list.
% 1.59/2.13
% 1.59/2.13 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.59/2.13
% 1.59/2.13 This ia a non-Horn set with equality. The strategy will be
% 1.59/2.13 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.59/2.13 deletion, with positive clauses in sos and nonpositive
% 1.59/2.13 clauses in usable.
% 1.59/2.13
% 1.59/2.13 dependent: set(knuth_bendix).
% 1.59/2.13 dependent: set(anl_eq).
% 1.59/2.13 dependent: set(para_from).
% 1.59/2.13 dependent: set(para_into).
% 1.59/2.13 dependent: clear(para_from_right).
% 1.59/2.13 dependent: clear(para_into_right).
% 1.59/2.13 dependent: set(para_from_vars).
% 1.59/2.13 dependent: set(eq_units_both_ways).
% 1.59/2.13 dependent: set(dynamic_demod_all).
% 1.59/2.13 dependent: set(dynamic_demod).
% 1.59/2.13 dependent: set(order_eq).
% 1.59/2.13 dependent: set(back_demod).
% 1.59/2.13 dependent: set(lrpo).
% 1.59/2.13 dependent: set(hyper_res).
% 1.59/2.13 dependent: set(unit_deletion).
% 1.59/2.13 dependent: set(factor).
% 1.59/2.13
% 1.59/2.13 ------------> process usable:
% 1.59/2.13 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.59/2.13 ** KEPT (pick-wt=6): 2 [] -proper_subset(A,B)| -proper_subset(B,A).
% 1.59/2.13 ** KEPT (pick-wt=6): 3 [] A!=B|subset(A,B).
% 1.59/2.13 ** KEPT (pick-wt=6): 4 [] A!=B|subset(B,A).
% 1.59/2.13 ** KEPT (pick-wt=9): 5 [] A=B| -subset(A,B)| -subset(B,A).
% 1.59/2.13 ** KEPT (pick-wt=10): 6 [] A!=singleton(B)| -in(C,A)|C=B.
% 1.59/2.13 ** KEPT (pick-wt=10): 7 [] A!=singleton(B)|in(C,A)|C!=B.
% 1.59/2.13 ** KEPT (pick-wt=14): 8 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 1.59/2.13 ** KEPT (pick-wt=6): 9 [] A!=empty_set| -in(B,A).
% 1.59/2.13 ** KEPT (pick-wt=10): 10 [] A!=powerset(B)| -in(C,A)|subset(C,B).
% 1.59/2.13 ** KEPT (pick-wt=10): 11 [] A!=powerset(B)|in(C,A)| -subset(C,B).
% 1.59/2.13 ** KEPT (pick-wt=14): 12 [] A=powerset(B)| -in($f3(B,A),A)| -subset($f3(B,A),B).
% 1.59/2.13 ** KEPT (pick-wt=14): 13 [] A!=unordered_pair(B,C)| -in(D,A)|D=B|D=C.
% 1.59/2.13 ** KEPT (pick-wt=11): 14 [] A!=unordered_pair(B,C)|in(D,A)|D!=B.
% 1.59/2.13 ** KEPT (pick-wt=11): 15 [] A!=unordered_pair(B,C)|in(D,A)|D!=C.
% 1.59/2.13 ** KEPT (pick-wt=17): 16 [] A=unordered_pair(B,C)| -in($f4(B,C,A),A)|$f4(B,C,A)!=B.
% 1.59/2.13 ** KEPT (pick-wt=17): 17 [] A=unordered_pair(B,C)| -in($f4(B,C,A),A)|$f4(B,C,A)!=C.
% 1.59/2.13 ** KEPT (pick-wt=14): 18 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 1.59/2.13 ** KEPT (pick-wt=11): 19 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 1.59/2.13 ** KEPT (pick-wt=11): 20 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 1.59/2.13 ** KEPT (pick-wt=17): 21 [] A=set_union2(B,C)| -in($f5(B,C,A),A)| -in($f5(B,C,A),B).
% 1.59/2.13 ** KEPT (pick-wt=17): 22 [] A=set_union2(B,C)| -in($f5(B,C,A),A)| -in($f5(B,C,A),C).
% 1.59/2.13 ** KEPT (pick-wt=9): 23 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.59/2.13 ** KEPT (pick-wt=8): 24 [] subset(A,B)| -in($f6(A,B),B).
% 1.59/2.13 ** KEPT (pick-wt=11): 25 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 1.59/2.13 ** KEPT (pick-wt=11): 26 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 1.59/2.13 ** KEPT (pick-wt=14): 27 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 1.59/2.13 ** KEPT (pick-wt=23): 28 [] A=set_intersection2(B,C)| -in($f7(B,C,A),A)| -in($f7(B,C,A),B)| -in($f7(B,C,A),C).
% 1.59/2.13 ** KEPT (pick-wt=11): 29 [] A!=set_difference(B,C)| -in(D,A)|in(D,B).
% 1.59/2.13 ** KEPT (pick-wt=11): 30 [] A!=set_difference(B,C)| -in(D,A)| -in(D,C).
% 1.59/2.13 ** KEPT (pick-wt=14): 31 [] A!=set_difference(B,C)|in(D,A)| -in(D,B)|in(D,C).
% 1.59/2.13 ** KEPT (pick-wt=17): 32 [] A=set_difference(B,C)|in($f8(B,C,A),A)| -in($f8(B,C,A),C).
% 1.59/2.13 ** KEPT (pick-wt=23): 33 [] A=set_difference(B,C)| -in($f8(B,C,A),A)| -in($f8(B,C,A),B)|in($f8(B,C,A),C).
% 1.59/2.13 ** KEPT (pick-wt=8): 34 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 1.59/2.13 ** KEPT (pick-wt=8): 35 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 1.59/2.13 ** KEPT (pick-wt=6): 36 [] -proper_subset(A,B)|subset(A,B).
% 1.59/2.13 ** KEPT (pick-wt=6): 37 [] -proper_subset(A,B)|A!=B.
% 1.59/2.13 ** KEPT (pick-wt=9): 38 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 1.59/2.13 ** KEPT (pick-wt=6): 39 [] empty(A)| -empty(set_union2(A,B)).
% 1.59/2.13 ** KEPT (pick-wt=6): 40 [] empty(A)| -empty(set_union2(B,A)).
% 1.59/2.13 ** KEPT (pick-wt=3): 41 [] -proper_subset(A,A).
% 1.59/2.13 ** KEPT (pick-wt=4): 42 [] singleton(A)!=empty_set.
% 1.59/2.13 ** KEPT (pick-wt=7): 43 [] -subset(singleton(A),B)|in(A,B).
% 1.59/2.13 ** KEPT (pick-wt=7): 44 [] subset(singleton(A),B)| -in(A,B).
% 1.59/2.13 ** KEPT (pick-wt=8): 45 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.59/2.13 ** KEPT (pick-wt=8): 46 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.59/2.13 ** KEPT (pick-wt=12): 47 [] -subset(A,B)|in(C,A)|subset(A,set_difference(B,singleton(C))).
% 1.59/2.13 ** KEPT (pick-wt=11): 48 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 1.59/2.13 ** KEPT (pick-wt=7): 49 [] subset(A,singleton(B))|A!=empty_set.
% 1.59/2.13 Following clause subsumed by 3 during input processing: 0 [] subset(A,singleton(B))|A!=singleton(B).
% 1.59/2.13 ** KEPT (pick-wt=2): 50 [] -empty($c2).
% 1.59/2.13 ** KEPT (pick-wt=6): 51 [] -disjoint(A,B)|disjoint(B,A).
% 1.59/2.13 ** KEPT (pick-wt=8): 52 [] -subset(A,B)|set_union2(A,B)=B.
% 1.59/2.13 ** KEPT (pick-wt=11): 53 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 1.59/2.13 ** KEPT (pick-wt=9): 54 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 1.59/2.13 ** KEPT (pick-wt=10): 55 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 1.59/2.13 ** KEPT (pick-wt=8): 56 [] -subset(A,B)|set_intersection2(A,B)=A.
% 1.59/2.13 ** KEPT (pick-wt=13): 57 [] -in($f9(A,B),A)| -in($f9(A,B),B)|A=B.
% 1.59/2.13 ** KEPT (pick-wt=10): 58 [] -subset(A,B)|subset(set_difference(A,C),set_difference(B,C)).
% 1.59/2.13 Following clause subsumed by 45 during input processing: 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.59/2.13 Following clause subsumed by 46 during input processing: 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.59/2.13 ** KEPT (pick-wt=9): 59 [] -in(A,B)| -in(A,C)| -disjoint(B,C).
% 1.59/2.13 ** KEPT (pick-wt=6): 60 [] -subset(A,empty_set)|A=empty_set.
% 1.59/2.13 ** KEPT (pick-wt=10): 62 [copy,61,flip.2] -subset(A,B)|set_union2(A,set_difference(B,A))=B.
% 1.59/2.13 ** KEPT (pick-wt=8): 63 [] -in(A,set_intersection2(B,C))| -disjoint(B,C).
% 1.59/2.13 ** KEPT (pick-wt=6): 64 [] -subset(A,B)| -proper_subset(B,A).
% 1.59/2.13 ** KEPT (pick-wt=9): 65 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 1.59/2.13 ** KEPT (pick-wt=5): 66 [] -empty(A)|A=empty_set.
% 1.59/2.13 ** KEPT (pick-wt=3): 67 [] $c4!=$c3.
% 1.59/2.13 ** KEPT (pick-wt=5): 68 [] -in(A,B)| -empty(B).
% 1.59/2.13 ** KEPT (pick-wt=8): 69 [] -disjoint(A,B)|set_difference(A,B)=A.
% 1.59/2.13 ** KEPT (pick-wt=8): 70 [] disjoint(A,B)|set_difference(A,B)!=A.
% 1.59/2.13 ** KEPT (pick-wt=7): 71 [] -empty(A)|A=B| -empty(B).
% 1.59/2.13 ** KEPT (pick-wt=11): 72 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 1.59/2.13
% 1.59/2.13 ------------> process sos:
% 1.59/2.13 ** KEPT (pick-wt=3): 92 [] A=A.
% 1.59/2.13 ** KEPT (pick-wt=7): 93 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.59/2.13 ** KEPT (pick-wt=7): 94 [] set_union2(A,B)=set_union2(B,A).
% 1.59/2.13 ** KEPT (pick-wt=7): 95 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.59/2.13 ** KEPT (pick-wt=14): 96 [] A=singleton(B)|in($f1(B,A),A)|$f1(B,A)=B.
% 1.59/2.13 ** KEPT (pick-wt=7): 97 [] A=empty_set|in($f2(A),A).
% 1.59/2.13 ** KEPT (pick-wt=14): 98 [] A=powerset(B)|in($f3(B,A),A)|subset($f3(B,A),B).
% 1.59/2.13 ** KEPT (pick-wt=23): 99 [] A=unordered_pair(B,C)|in($f4(B,C,A),A)|$f4(B,C,A)=B|$f4(B,C,A)=C.
% 1.59/2.13 ** KEPT (pick-wt=23): 100 [] A=set_union2(B,C)|in($f5(B,C,A),A)|in($f5(B,C,A),B)|in($f5(B,C,A),C).
% 1.59/2.13 ** KEPT (pick-wt=8): 101 [] subset(A,B)|in($f6(A,B),A).
% 1.59/2.13 ** KEPT (pick-wt=17): 102 [] A=set_intersection2(B,C)|in($f7(B,C,A),A)|in($f7(B,C,A),B).
% 1.59/2.13 ** KEPT (pick-wt=17): 103 [] A=set_intersection2(B,C)|in($f7(B,C,A),A)|in($f7(B,C,A),C).
% 1.59/2.13 ** KEPT (pick-wt=17): 104 [] A=set_difference(B,C)|in($f8(B,C,A),A)|in($f8(B,C,A),B).
% 1.59/2.13 ** KEPT (pick-wt=2): 105 [] empty(empty_set).
% 1.59/2.13 ** KEPT (pick-wt=5): 106 [] set_union2(A,A)=A.
% 1.59/2.13 ---> New Demodulator: 107 [new_demod,106] set_union2(A,A)=A.
% 1.59/2.13 ** KEPT (pick-wt=5): 108 [] set_intersection2(A,A)=A.
% 1.59/2.13 ---> New Demodulator: 109 [new_demod,108] set_intersection2(A,A)=A.
% 1.59/2.13 ** KEPT (pick-wt=2): 110 [] empty($c1).
% 1.59/2.13 ** KEPT (pick-wt=3): 111 [] subset(A,A).
% 1.59/2.13 ** KEPT (pick-wt=5): 112 [] subset(set_intersection2(A,B),A).
% 1.59/2.13 ** KEPT (pick-wt=5): 113 [] set_union2(A,empty_set)=A.
% 1.59/2.13 ---> New Demodulator: 114 [new_demod,113] set_union2(A,empty_set)=A.
% 1.59/2.13 ** KEPT (pick-wt=5): 116 [copy,115,flip.1] singleton(empty_set)=powerset(empty_set).
% 1.59/2.13 ---> New Demodulator: 117 [new_demod,116] singleton(empty_set)=powerset(empty_set).
% 1.59/2.13 ** KEPT (pick-wt=5): 118 [] set_intersection2(A,empty_set)=empty_set.
% 1.59/2.13 ---> New Demodulator: 119 [new_demod,118] set_intersection2(A,empty_set)=empty_set.
% 1.59/2.13 ** KEPT (pick-wt=13): 120 [] in($f9(A,B),A)|in($f9(A,B),B)|A=B.
% 1.59/2.13 ** KEPT (pick-wt=3): 121 [] subset(empty_set,A).
% 1.59/2.13 ** KEPT (pick-wt=5): 122 [] subset(set_difference(A,B),A).
% 1.59/2.13 ** KEPT (pick-wt=9): 123 [] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 1.59/2.13 ---> New Demodulator: 124 [new_demod,123] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 1.59/2.13 ** KEPT (pick-wt=5): 125 [] set_difference(A,empty_set)=A.
% 1.59/2.13 ---> New Demodulator: 126 [new_demod,125] set_difference(A,empty_set)=A.
% 1.59/2.13 ** KEPT (pick-wt=8): 127 [] disjoint(A,B)|in($f10(A,B),A).
% 1.59/2.13 ** KEPT (pick-wt=8): 128 [] disjoint(A,B)|in($f10(A,B),B).
% 1.59/2.13 ** KEPT (pick-wt=9): 129 [] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 1.59/2.13 ---> New Demodulator: 130 [new_demod,129] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 1.59/2.13 ** KEPT (pick-wt=9): 132 [copy,131,flip.1] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 1.59/2.13 ---> New Demodulator: 133 [new_demod,132] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 1.59/2.13 ** KEPT (pick-wt=5): 134 [] set_difference(empty_set,A)=empty_set.
% 1.59/2.13 ---> New Demodulator: 135 [new_demod,134] set_difference(empty_set,A)=empty_set.
% 1.59/2.13 ** KEPT (pick-wt=12): 137 [copy,136,demod,133] disjoint(A,B)|in($f11(A,B),set_difference(A,set_difference(A,B))).
% 1.59/2.13 ** KEPT (pick-wt=6): 139 [copy,138,flip.1] singleton(A)=unordered_pair(A,A).
% 1.59/2.13 ---> New Demodulator: 140 [new_demod,139] singleton(A)=unordered_pair(A,A).
% 1.59/2.13 ** KEPT (pick-wt=7): 142 [copy,141,demod,140,140] subset(unordered_pair($c4,$c4),unordered_pair($c3,$c3)).
% 1.59/2.13 ** KEPT (pick-wt=5): 143 [] subset(A,set_union2(A,B)).
% 1.59/2.13 Following clause subsumed by 92 during input processing: 0 [copy,92,flip.1] A=A.
% 1.59/2.13 92 back subsumes 89.
% 1.59/2.13 92 back subsumes 87.
% 1.59/2.13 92 back subsumes 74.
% 1.59/2.13 Following clause subsumed by 93 during input processing: 0 [copy,93,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 1.59/2.13 Following clause subsumed by 94 during input processing: 0 [copy,94,flip.1] set_union2(A,B)=set_union2(B,A).
% 1.59/2.13 ** KEPT (pick-wt=11): 144 [copy,95,flip.1,demod,133,133] set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 1.59/2.13 >>>> Starting back demodulation with 107.
% 1.59/2.13 >> back demodulating 90 with 107.
% 1.59/2.13 >> back demodulating 76 with 107.
% 1.59/2.13 >>>> Starting back demodulation with 109.
% 1.59/2.13 >> back demodulating 91 with 109.
% 1.59/2.13 >> back demodulating 86 with 109.
% 1.59/2.13 >> back demodulating 82 with 109.
% 1.59/2.13 >> back demodulating 79 with 109.
% 1.59/2.13 >>>> Starting back demodulation with 114.
% 1.59/2.13 >>>> Starting back demodulation with 117.
% 1.59/2.13 >>>> Starting back demodulation with 119.
% 1.59/2.13 >>>> Starting back demodulation with 124.
% 1.59/2.13 >> back demodulating 62 with 124.
% 1.59/2.13 >>>> Starting back demodulation with 126.
% 1.59/2.13 >>>> Starting back demodulation with 130.
% 1.59/2.13 >>>> Starting back demodulation with 133.
% 1.59/2.13 >> back demodulating 118 with 133.
% 1.59/2.13 >> back demodulating 112 with 133.
% 1.59/2.13 >> back demodulating 108 with 133.
% 1.59/2.13 >> back demodulating 103 with 133.
% 1.59/2.13 >> back demodulating 102 with 133.
% 1.59/2.13 >> back demodulating 95 with 133.
% 1.59/2.13 >> back demodulating 81 with 133.
% 1.59/2.13 >> back demodulating 80 with 133.
% 1.59/2.13 >> back demodulating 63 with 133.
% 1.59/2.13 >> back demodulating 56 with 133.
% 1.59/2.13 >> back demodulating 55 with 133.
% 1.59/2.13 >> back demodulating 53 with 133.
% 1.59/2.13 >> back demodulating 35 with 133.
% 1.59/2.13 >> back demodulating 34 with 133.
% 1.59/2.13 >> back demodulating 28 with 133.
% 1.59/2.13 >> back demodulating 27 with 133.
% 1.59/2.13 >> back demodulating 26 with 133.
% 1.59/2.13 >> back demodulating 25 with 133.
% 1.59/2.13 >>>> Starting back demodulation with 135.
% 1.59/2.13 >>>> Starting back demodulation with 140.
% 1.59/2.13 >> back demodulating 116 with 140.
% 1.59/2.13 >> back demodulating 96 with 140.
% 1.59/2.13 >> back demodulating 49 with 140.
% 1.59/2.13 >> back demodulating 48 with 140.
% 1.59/2.13 >> back demodulating 47 with 140.
% 1.59/2.13 >> back demodulating 44 with 140.
% 1.59/2.13 >> back demodulating 43 with 140.
% 2.29/2.43 >> back demodulating 42 with 140.
% 2.29/2.43 >> back demodulating 8 with 140.
% 2.29/2.43 >> back demodulating 7 with 140.
% 2.29/2.43 >> back demodulating 6 with 140.
% 2.29/2.43 Following clause subsumed by 144 during input processing: 0 [copy,144,flip.1] set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 2.29/2.43 >>>> Starting back demodulation with 156.
% 2.29/2.43 >>>> Starting back demodulation with 171.
% 2.29/2.43
% 2.29/2.43 ======= end of input processing =======
% 2.29/2.43
% 2.29/2.43 =========== start of search ===========
% 2.29/2.43
% 2.29/2.43
% 2.29/2.43 Resetting weight limit to 8.
% 2.29/2.43
% 2.29/2.43
% 2.29/2.43 Resetting weight limit to 8.
% 2.29/2.43
% 2.29/2.43 sos_size=1304
% 2.29/2.43
% 2.29/2.43
% 2.29/2.43 Resetting weight limit to 7.
% 2.29/2.43
% 2.29/2.43
% 2.29/2.43 Resetting weight limit to 7.
% 2.29/2.43
% 2.29/2.43 sos_size=1294
% 2.29/2.43
% 2.29/2.43 -------- PROOF --------
% 2.29/2.43
% 2.29/2.43 ----> UNIT CONFLICT at 0.30 sec ----> 1635 [binary,1633.1,67.1] $F.
% 2.29/2.43
% 2.29/2.43 Length of proof is 6. Level of proof is 4.
% 2.29/2.43
% 2.29/2.43 ---------------- PROOF ----------------
% 2.29/2.43 % SZS status Theorem
% 2.29/2.43 % SZS output start Refutation
% See solution above
% 2.29/2.43 ------------ end of proof -------------
% 2.29/2.43
% 2.29/2.43
% 2.29/2.43 Search stopped by max_proofs option.
% 2.29/2.43
% 2.29/2.43
% 2.29/2.43 Search stopped by max_proofs option.
% 2.29/2.43
% 2.29/2.43 ============ end of search ============
% 2.29/2.43
% 2.29/2.43 -------------- statistics -------------
% 2.29/2.43 clauses given 79
% 2.29/2.43 clauses generated 6542
% 2.29/2.43 clauses kept 1603
% 2.29/2.43 clauses forward subsumed 1874
% 2.29/2.43 clauses back subsumed 94
% 2.29/2.43 Kbytes malloced 4882
% 2.29/2.43
% 2.29/2.43 ----------- times (seconds) -----------
% 2.29/2.43 user CPU time 0.30 (0 hr, 0 min, 0 sec)
% 2.29/2.43 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.29/2.43 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.29/2.43
% 2.29/2.43 That finishes the proof of the theorem.
% 2.29/2.43
% 2.29/2.43 Process 2727 finished Wed Jul 27 08:22:54 2022
% 2.29/2.43 Otter interrupted
% 2.29/2.43 PROOF FOUND
%------------------------------------------------------------------------------