TSTP Solution File: SEU137+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU137+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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:52 EDT 2022
% Result : Theorem 1.81s 2.03s
% Output : Refutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 8 ( 7 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 6 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(30,axiom,
( ~ subset(A,B)
| set_union2(A,B) = B ),
file('SEU137+2.p',unknown),
[] ).
cnf(39,axiom,
dollar_c3 != set_union2(dollar_c4,set_difference(dollar_c3,dollar_c4)),
file('SEU137+2.p',unknown),
[] ).
cnf(40,plain,
set_union2(dollar_c4,set_difference(dollar_c3,dollar_c4)) != dollar_c3,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[39])]),
[iquote('copy,39,flip.1')] ).
cnf(89,axiom,
set_union2(A,set_difference(B,A)) = set_union2(A,B),
file('SEU137+2.p',unknown),
[] ).
cnf(96,axiom,
subset(dollar_c4,dollar_c3),
file('SEU137+2.p',unknown),
[] ).
cnf(110,plain,
set_union2(dollar_c4,dollar_c3) != dollar_c3,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[40]),89]),
[iquote('back_demod,40,demod,89')] ).
cnf(159,plain,
set_union2(dollar_c4,dollar_c3) = dollar_c3,
inference(hyper,[status(thm)],[96,30]),
[iquote('hyper,96,30')] ).
cnf(161,plain,
$false,
inference(binary,[status(thm)],[159,110]),
[iquote('binary,159.1,110.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU137+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n027.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 08:15:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.81/2.02 ----- Otter 3.3f, August 2004 -----
% 1.81/2.02 The process was started by sandbox on n027.cluster.edu,
% 1.81/2.02 Wed Jul 27 08:15:06 2022
% 1.81/2.02 The command was "./otter". The process ID is 19896.
% 1.81/2.02
% 1.81/2.02 set(prolog_style_variables).
% 1.81/2.02 set(auto).
% 1.81/2.02 dependent: set(auto1).
% 1.81/2.02 dependent: set(process_input).
% 1.81/2.02 dependent: clear(print_kept).
% 1.81/2.02 dependent: clear(print_new_demod).
% 1.81/2.02 dependent: clear(print_back_demod).
% 1.81/2.02 dependent: clear(print_back_sub).
% 1.81/2.02 dependent: set(control_memory).
% 1.81/2.02 dependent: assign(max_mem, 12000).
% 1.81/2.02 dependent: assign(pick_given_ratio, 4).
% 1.81/2.02 dependent: assign(stats_level, 1).
% 1.81/2.02 dependent: assign(max_seconds, 10800).
% 1.81/2.02 clear(print_given).
% 1.81/2.02
% 1.81/2.02 formula_list(usable).
% 1.81/2.02 all A (A=A).
% 1.81/2.02 all A B (in(A,B)-> -in(B,A)).
% 1.81/2.02 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.81/2.02 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.81/2.02 all A B (A=B<->subset(A,B)&subset(B,A)).
% 1.81/2.02 all A (A=empty_set<-> (all B (-in(B,A)))).
% 1.81/2.02 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 1.81/2.02 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.81/2.02 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 1.81/2.02 all A B C (C=set_difference(A,B)<-> (all D (in(D,C)<->in(D,A)& -in(D,B)))).
% 1.81/2.02 all A B (disjoint(A,B)<->set_intersection2(A,B)=empty_set).
% 1.81/2.02 $T.
% 1.81/2.02 $T.
% 1.81/2.02 $T.
% 1.81/2.02 $T.
% 1.81/2.02 empty(empty_set).
% 1.81/2.02 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 1.81/2.02 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 1.81/2.02 all A B (set_union2(A,A)=A).
% 1.81/2.02 all A B (set_intersection2(A,A)=A).
% 1.81/2.02 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 1.81/2.02 exists A empty(A).
% 1.81/2.02 exists A (-empty(A)).
% 1.81/2.02 all A B subset(A,A).
% 1.81/2.02 all A B (disjoint(A,B)->disjoint(B,A)).
% 1.81/2.02 all A B (subset(A,B)->set_union2(A,B)=B).
% 1.81/2.02 all A B subset(set_intersection2(A,B),A).
% 1.81/2.02 all A B C (subset(A,B)&subset(A,C)->subset(A,set_intersection2(B,C))).
% 1.81/2.02 all A (set_union2(A,empty_set)=A).
% 1.81/2.02 all A B C (subset(A,B)&subset(B,C)->subset(A,C)).
% 1.81/2.02 all A B C (subset(A,B)->subset(set_intersection2(A,C),set_intersection2(B,C))).
% 1.81/2.02 all A B (subset(A,B)->set_intersection2(A,B)=A).
% 1.81/2.02 all A (set_intersection2(A,empty_set)=empty_set).
% 1.81/2.02 all A B ((all C (in(C,A)<->in(C,B)))->A=B).
% 1.81/2.02 all A subset(empty_set,A).
% 1.81/2.02 all A B C (subset(A,B)->subset(set_difference(A,C),set_difference(B,C))).
% 1.81/2.02 all A B subset(set_difference(A,B),A).
% 1.81/2.02 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 1.81/2.02 all A B (set_union2(A,set_difference(B,A))=set_union2(A,B)).
% 1.81/2.02 all A (set_difference(A,empty_set)=A).
% 1.81/2.02 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.81/2.02 all A (subset(A,empty_set)->A=empty_set).
% 1.81/2.02 all A B (set_difference(set_union2(A,B),B)=set_difference(A,B)).
% 1.81/2.02 -(all A B (subset(A,B)->B=set_union2(A,set_difference(B,A)))).
% 1.81/2.02 all A (set_difference(empty_set,A)=empty_set).
% 1.81/2.02 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.81/2.02 all A (empty(A)->A=empty_set).
% 1.81/2.02 all A B (-(in(A,B)&empty(B))).
% 1.81/2.02 all A B subset(A,set_union2(A,B)).
% 1.81/2.02 all A B (-(empty(A)&A!=B&empty(B))).
% 1.81/2.02 all A B C (subset(A,B)&subset(C,B)->subset(set_union2(A,C),B)).
% 1.81/2.02 end_of_list.
% 1.81/2.02
% 1.81/2.02 -------> usable clausifies to:
% 1.81/2.02
% 1.81/2.02 list(usable).
% 1.81/2.02 0 [] A=A.
% 1.81/2.02 0 [] -in(A,B)| -in(B,A).
% 1.81/2.02 0 [] set_union2(A,B)=set_union2(B,A).
% 1.81/2.02 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.81/2.02 0 [] A!=B|subset(A,B).
% 1.81/2.02 0 [] A!=B|subset(B,A).
% 1.81/2.02 0 [] A=B| -subset(A,B)| -subset(B,A).
% 1.81/2.02 0 [] A!=empty_set| -in(B,A).
% 1.81/2.02 0 [] A=empty_set|in($f1(A),A).
% 1.81/2.02 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 1.81/2.02 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 1.81/2.02 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 1.81/2.02 0 [] C=set_union2(A,B)|in($f2(A,B,C),C)|in($f2(A,B,C),A)|in($f2(A,B,C),B).
% 1.81/2.02 0 [] C=set_union2(A,B)| -in($f2(A,B,C),C)| -in($f2(A,B,C),A).
% 1.81/2.02 0 [] C=set_union2(A,B)| -in($f2(A,B,C),C)| -in($f2(A,B,C),B).
% 1.81/2.02 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.81/2.02 0 [] subset(A,B)|in($f3(A,B),A).
% 1.81/2.02 0 [] subset(A,B)| -in($f3(A,B),B).
% 1.81/2.02 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 1.81/2.02 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 1.81/2.02 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 1.81/2.02 0 [] C=set_intersection2(A,B)|in($f4(A,B,C),C)|in($f4(A,B,C),A).
% 1.81/2.02 0 [] C=set_intersection2(A,B)|in($f4(A,B,C),C)|in($f4(A,B,C),B).
% 1.81/2.02 0 [] C=set_intersection2(A,B)| -in($f4(A,B,C),C)| -in($f4(A,B,C),A)| -in($f4(A,B,C),B).
% 1.81/2.03 0 [] C!=set_difference(A,B)| -in(D,C)|in(D,A).
% 1.81/2.03 0 [] C!=set_difference(A,B)| -in(D,C)| -in(D,B).
% 1.81/2.03 0 [] C!=set_difference(A,B)|in(D,C)| -in(D,A)|in(D,B).
% 1.81/2.03 0 [] C=set_difference(A,B)|in($f5(A,B,C),C)|in($f5(A,B,C),A).
% 1.81/2.03 0 [] C=set_difference(A,B)|in($f5(A,B,C),C)| -in($f5(A,B,C),B).
% 1.81/2.03 0 [] C=set_difference(A,B)| -in($f5(A,B,C),C)| -in($f5(A,B,C),A)|in($f5(A,B,C),B).
% 1.81/2.03 0 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 1.81/2.03 0 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 1.81/2.03 0 [] $T.
% 1.81/2.03 0 [] $T.
% 1.81/2.03 0 [] $T.
% 1.81/2.03 0 [] $T.
% 1.81/2.03 0 [] empty(empty_set).
% 1.81/2.03 0 [] empty(A)| -empty(set_union2(A,B)).
% 1.81/2.03 0 [] empty(A)| -empty(set_union2(B,A)).
% 1.81/2.03 0 [] set_union2(A,A)=A.
% 1.81/2.03 0 [] set_intersection2(A,A)=A.
% 1.81/2.03 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.81/2.03 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.81/2.03 0 [] empty($c1).
% 1.81/2.03 0 [] -empty($c2).
% 1.81/2.03 0 [] subset(A,A).
% 1.81/2.03 0 [] -disjoint(A,B)|disjoint(B,A).
% 1.81/2.03 0 [] -subset(A,B)|set_union2(A,B)=B.
% 1.81/2.03 0 [] subset(set_intersection2(A,B),A).
% 1.81/2.03 0 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 1.81/2.03 0 [] set_union2(A,empty_set)=A.
% 1.81/2.03 0 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 1.81/2.03 0 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 1.81/2.03 0 [] -subset(A,B)|set_intersection2(A,B)=A.
% 1.81/2.03 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.81/2.03 0 [] in($f6(A,B),A)|in($f6(A,B),B)|A=B.
% 1.81/2.03 0 [] -in($f6(A,B),A)| -in($f6(A,B),B)|A=B.
% 1.81/2.03 0 [] subset(empty_set,A).
% 1.81/2.03 0 [] -subset(A,B)|subset(set_difference(A,C),set_difference(B,C)).
% 1.81/2.03 0 [] subset(set_difference(A,B),A).
% 1.81/2.03 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.81/2.03 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.81/2.03 0 [] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 1.81/2.03 0 [] set_difference(A,empty_set)=A.
% 1.81/2.03 0 [] disjoint(A,B)|in($f7(A,B),A).
% 1.81/2.03 0 [] disjoint(A,B)|in($f7(A,B),B).
% 1.81/2.03 0 [] -in(C,A)| -in(C,B)| -disjoint(A,B).
% 1.81/2.03 0 [] -subset(A,empty_set)|A=empty_set.
% 1.81/2.03 0 [] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 1.81/2.03 0 [] subset($c4,$c3).
% 1.81/2.03 0 [] $c3!=set_union2($c4,set_difference($c3,$c4)).
% 1.81/2.03 0 [] set_difference(empty_set,A)=empty_set.
% 1.81/2.03 0 [] disjoint(A,B)|in($f8(A,B),set_intersection2(A,B)).
% 1.81/2.03 0 [] -in(C,set_intersection2(A,B))| -disjoint(A,B).
% 1.81/2.03 0 [] -empty(A)|A=empty_set.
% 1.81/2.03 0 [] -in(A,B)| -empty(B).
% 1.81/2.03 0 [] subset(A,set_union2(A,B)).
% 1.81/2.03 0 [] -empty(A)|A=B| -empty(B).
% 1.81/2.03 0 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 1.81/2.03 end_of_list.
% 1.81/2.03
% 1.81/2.03 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.81/2.03
% 1.81/2.03 This ia a non-Horn set with equality. The strategy will be
% 1.81/2.03 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.81/2.03 deletion, with positive clauses in sos and nonpositive
% 1.81/2.03 clauses in usable.
% 1.81/2.03
% 1.81/2.03 dependent: set(knuth_bendix).
% 1.81/2.03 dependent: set(anl_eq).
% 1.81/2.03 dependent: set(para_from).
% 1.81/2.03 dependent: set(para_into).
% 1.81/2.03 dependent: clear(para_from_right).
% 1.81/2.03 dependent: clear(para_into_right).
% 1.81/2.03 dependent: set(para_from_vars).
% 1.81/2.03 dependent: set(eq_units_both_ways).
% 1.81/2.03 dependent: set(dynamic_demod_all).
% 1.81/2.03 dependent: set(dynamic_demod).
% 1.81/2.03 dependent: set(order_eq).
% 1.81/2.03 dependent: set(back_demod).
% 1.81/2.03 dependent: set(lrpo).
% 1.81/2.03 dependent: set(hyper_res).
% 1.81/2.03 dependent: set(unit_deletion).
% 1.81/2.03 dependent: set(factor).
% 1.81/2.03
% 1.81/2.03 ------------> process usable:
% 1.81/2.03 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.81/2.03 ** KEPT (pick-wt=6): 2 [] A!=B|subset(A,B).
% 1.81/2.03 ** KEPT (pick-wt=6): 3 [] A!=B|subset(B,A).
% 1.81/2.03 ** KEPT (pick-wt=9): 4 [] A=B| -subset(A,B)| -subset(B,A).
% 1.81/2.03 ** KEPT (pick-wt=6): 5 [] A!=empty_set| -in(B,A).
% 1.81/2.03 ** KEPT (pick-wt=14): 6 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 1.81/2.03 ** KEPT (pick-wt=11): 7 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 1.81/2.03 ** KEPT (pick-wt=11): 8 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 1.81/2.03 ** KEPT (pick-wt=17): 9 [] A=set_union2(B,C)| -in($f2(B,C,A),A)| -in($f2(B,C,A),B).
% 1.81/2.03 ** KEPT (pick-wt=17): 10 [] A=set_union2(B,C)| -in($f2(B,C,A),A)| -in($f2(B,C,A),C).
% 1.81/2.03 ** KEPT (pick-wt=9): 11 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.81/2.03 ** KEPT (pick-wt=8): 12 [] subset(A,B)| -in($f3(A,B),B).
% 1.81/2.03 ** KEPT (pick-wt=11): 13 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 1.81/2.03 ** KEPT (pick-wt=11): 14 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 1.81/2.03 ** KEPT (pick-wt=14): 15 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 1.81/2.03 ** KEPT (pick-wt=23): 16 [] A=set_intersection2(B,C)| -in($f4(B,C,A),A)| -in($f4(B,C,A),B)| -in($f4(B,C,A),C).
% 1.81/2.03 ** KEPT (pick-wt=11): 17 [] A!=set_difference(B,C)| -in(D,A)|in(D,B).
% 1.81/2.03 ** KEPT (pick-wt=11): 18 [] A!=set_difference(B,C)| -in(D,A)| -in(D,C).
% 1.81/2.03 ** KEPT (pick-wt=14): 19 [] A!=set_difference(B,C)|in(D,A)| -in(D,B)|in(D,C).
% 1.81/2.03 ** KEPT (pick-wt=17): 20 [] A=set_difference(B,C)|in($f5(B,C,A),A)| -in($f5(B,C,A),C).
% 1.81/2.03 ** KEPT (pick-wt=23): 21 [] A=set_difference(B,C)| -in($f5(B,C,A),A)| -in($f5(B,C,A),B)|in($f5(B,C,A),C).
% 1.81/2.03 ** KEPT (pick-wt=8): 22 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 1.81/2.03 ** KEPT (pick-wt=8): 23 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 1.81/2.03 ** KEPT (pick-wt=6): 24 [] empty(A)| -empty(set_union2(A,B)).
% 1.81/2.03 ** KEPT (pick-wt=6): 25 [] empty(A)| -empty(set_union2(B,A)).
% 1.81/2.03 ** KEPT (pick-wt=8): 26 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.81/2.03 ** KEPT (pick-wt=8): 27 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.81/2.03 ** KEPT (pick-wt=2): 28 [] -empty($c2).
% 1.81/2.03 ** KEPT (pick-wt=6): 29 [] -disjoint(A,B)|disjoint(B,A).
% 1.81/2.03 ** KEPT (pick-wt=8): 30 [] -subset(A,B)|set_union2(A,B)=B.
% 1.81/2.03 ** KEPT (pick-wt=11): 31 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 1.81/2.03 ** KEPT (pick-wt=9): 32 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 1.81/2.03 ** KEPT (pick-wt=10): 33 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 1.81/2.03 ** KEPT (pick-wt=8): 34 [] -subset(A,B)|set_intersection2(A,B)=A.
% 1.81/2.03 ** KEPT (pick-wt=13): 35 [] -in($f6(A,B),A)| -in($f6(A,B),B)|A=B.
% 1.81/2.03 ** KEPT (pick-wt=10): 36 [] -subset(A,B)|subset(set_difference(A,C),set_difference(B,C)).
% 1.81/2.03 Following clause subsumed by 26 during input processing: 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.81/2.03 Following clause subsumed by 27 during input processing: 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.81/2.03 ** KEPT (pick-wt=9): 37 [] -in(A,B)| -in(A,C)| -disjoint(B,C).
% 1.81/2.03 ** KEPT (pick-wt=6): 38 [] -subset(A,empty_set)|A=empty_set.
% 1.81/2.03 ** KEPT (pick-wt=7): 40 [copy,39,flip.1] set_union2($c4,set_difference($c3,$c4))!=$c3.
% 1.81/2.03 ** KEPT (pick-wt=8): 41 [] -in(A,set_intersection2(B,C))| -disjoint(B,C).
% 1.81/2.03 ** KEPT (pick-wt=5): 42 [] -empty(A)|A=empty_set.
% 1.81/2.03 ** KEPT (pick-wt=5): 43 [] -in(A,B)| -empty(B).
% 1.81/2.03 ** KEPT (pick-wt=7): 44 [] -empty(A)|A=B| -empty(B).
% 1.81/2.03 ** KEPT (pick-wt=11): 45 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 1.81/2.03
% 1.81/2.03 ------------> process sos:
% 1.81/2.03 ** KEPT (pick-wt=3): 64 [] A=A.
% 1.81/2.03 ** KEPT (pick-wt=7): 65 [] set_union2(A,B)=set_union2(B,A).
% 1.81/2.03 ** KEPT (pick-wt=7): 66 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.81/2.03 ** KEPT (pick-wt=7): 67 [] A=empty_set|in($f1(A),A).
% 1.81/2.03 ** KEPT (pick-wt=23): 68 [] A=set_union2(B,C)|in($f2(B,C,A),A)|in($f2(B,C,A),B)|in($f2(B,C,A),C).
% 1.81/2.03 ** KEPT (pick-wt=8): 69 [] subset(A,B)|in($f3(A,B),A).
% 1.81/2.03 ** KEPT (pick-wt=17): 70 [] A=set_intersection2(B,C)|in($f4(B,C,A),A)|in($f4(B,C,A),B).
% 1.81/2.03 ** KEPT (pick-wt=17): 71 [] A=set_intersection2(B,C)|in($f4(B,C,A),A)|in($f4(B,C,A),C).
% 1.81/2.03 ** KEPT (pick-wt=17): 72 [] A=set_difference(B,C)|in($f5(B,C,A),A)|in($f5(B,C,A),B).
% 1.81/2.03 ** KEPT (pick-wt=2): 73 [] empty(empty_set).
% 1.81/2.03 ** KEPT (pick-wt=5): 74 [] set_union2(A,A)=A.
% 1.81/2.03 ---> New Demodulator: 75 [new_demod,74] set_union2(A,A)=A.
% 1.81/2.03 ** KEPT (pick-wt=5): 76 [] set_intersection2(A,A)=A.
% 1.81/2.03 ---> New Demodulator: 77 [new_demod,76] set_intersection2(A,A)=A.
% 1.81/2.03 ** KEPT (pick-wt=2): 78 [] empty($c1).
% 1.81/2.03 ** KEPT (pick-wt=3): 79 [] subset(A,A).
% 1.81/2.03 ** KEPT (pick-wt=5): 80 [] subset(set_intersection2(A,B),A).
% 1.81/2.03 ** KEPT (pick-wt=5): 81 [] set_union2(A,empty_set)=A.
% 1.81/2.03 ---> New Demodulator: 82 [new_demod,81] set_union2(A,empty_set)=A.
% 1.81/2.03 ** KEPT (pick-wt=5): 83 [] set_intersection2(A,empty_set)=empty_set.
% 1.81/2.03 ---> New Demodulator: 84 [new_demod,83] set_intersection2(A,empty_set)=empty_set.
% 1.81/2.03 ** KEPT (pick-wt=13): 85 [] in($f6(A,B),A)|in($f6(A,B),B)|A=B.
% 1.81/2.03 ** KEPT (pick-wt=3): 86 [] subset(empty_set,A).
% 1.81/2.03 ** KEPT (pick-wt=5): 87 [] subset(set_difference(A,B),A).
% 1.81/2.03 ** KEPT (pick-wt=9): 88 [] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 1.81/2.03 ---> New Demodulator: 89 [new_demod,88] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 1.81/2.03 ** KEPT (pick-wt=5): 90 [] set_difference(A,empty_set)=A.
% 1.81/2.03 ---> New Demodulator: 91 [new_demod,90] set_difference(A,empty_set)=A.
% 1.81/2.03 ** KEPT (pick-wt=8): 92 [] disjoint(A,B)|in($f7(A,B),A).
% 1.81/2.03 ** KEPT (pick-wt=8): 93 [] disjoint(A,B)|in($f7(A,B),B).
% 1.81/2.03 ** KEPT (pick-wt=9): 94 [] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 1.81/2.03 ---> New Demodulator: 95 [new_demod,94] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 1.81/2.03 ** KEPT (pick-wt=3): 96 [] subset($c4,$c3).
% 1.81/2.03 ** KEPT (pick-wt=5): 97 [] set_difference(empty_set,A)=empty_set.
% 1.81/2.03 ---> New Demodulator: 98 [new_demod,97] set_difference(empty_set,A)=empty_set.
% 1.81/2.03 ** KEPT (pick-wt=10): 99 [] disjoint(A,B)|in($f8(A,B),set_intersection2(A,B)).
% 1.81/2.03 ** KEPT (pick-wt=5): 100 [] subset(A,set_union2(A,B)).
% 1.81/2.03 Following clause subsumed by 64 during input processing: 0 [copy,64,flip.1] A=A.
% 1.81/2.03 64 back subsumes 61.
% 1.81/2.03 64 back subsumes 59.
% 1.81/2.03 64 back subsumes 47.
% 1.81/2.03 Following clause subsumed by 65 during input processing: 0 [copy,65,flip.1] set_union2(A,B)=set_union2(B,A).
% 1.81/2.03 Following clause subsumed by 66 during input processing: 0 [copy,66,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 1.81/2.03 >>>> Starting back demodulation with 75.
% 1.81/2.03 >> back demodulating 62 with 75.
% 1.81/2.03 >> back demodulating 48 with 75.
% 1.81/2.03 >>>> Starting back demodulation with 77.
% 1.81/2.03 >> back demodulating 63 with 77.
% 1.81/2.03 >> back demodulating 58 with 77.
% 1.81/2.03 >> back demodulating 54 with 77.
% 1.81/2.03 >> back demodulating 51 with 77.
% 1.81/2.03 >>>> Starting back demodulation with 82.
% 1.81/2.03 >>>> Starting back demodulation with 84.
% 1.81/2.03 >>>> Starting back demodulation with 89.
% 1.81/2.03 >> back demodulating 40 with 89.
% 1.81/2.03 >>>> Starting back demodulation with 91.
% 1.81/2.03 >>>> Starting back demodulation with 95.
% 1.81/2.03 >>>> Starting back demodulation with 98.
% 1.81/2.03
% 1.81/2.03 ======= end of input processing =======
% 1.81/2.03
% 1.81/2.03 =========== start of search ===========
% 1.81/2.03
% 1.81/2.03 -------- PROOF --------
% 1.81/2.03
% 1.81/2.03 ----> UNIT CONFLICT at 0.01 sec ----> 161 [binary,159.1,110.1] $F.
% 1.81/2.03
% 1.81/2.03 Length of proof is 3. Level of proof is 2.
% 1.81/2.03
% 1.81/2.03 ---------------- PROOF ----------------
% 1.81/2.03 % SZS status Theorem
% 1.81/2.03 % SZS output start Refutation
% See solution above
% 1.81/2.03 ------------ end of proof -------------
% 1.81/2.03
% 1.81/2.03
% 1.81/2.03 Search stopped by max_proofs option.
% 1.81/2.03
% 1.81/2.03
% 1.81/2.03 Search stopped by max_proofs option.
% 1.81/2.03
% 1.81/2.03 ============ end of search ============
% 1.81/2.03
% 1.81/2.03 -------------- statistics -------------
% 1.81/2.03 clauses given 5
% 1.81/2.03 clauses generated 104
% 1.81/2.03 clauses kept 144
% 1.81/2.03 clauses forward subsumed 65
% 1.81/2.03 clauses back subsumed 3
% 1.81/2.03 Kbytes malloced 976
% 1.81/2.03
% 1.81/2.03 ----------- times (seconds) -----------
% 1.81/2.03 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.81/2.03 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.81/2.03 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.81/2.03
% 1.81/2.03 That finishes the proof of the theorem.
% 1.81/2.03
% 1.81/2.03 Process 19896 finished Wed Jul 27 08:15:08 2022
% 1.81/2.03 Otter interrupted
% 1.81/2.03 PROOF FOUND
%------------------------------------------------------------------------------