TSTP Solution File: SEU102+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU102+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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:46 EDT 2022
% Result : Theorem 2.00s 2.15s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 15 unt; 2 nHn; 15 RR)
% Number of literals : 25 ( 5 equ; 11 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
( empty(A)
| ~ preboolean(A)
| ~ element(B,A)
| ~ element(C,A)
| element(prebool_difference(A,B,C),A) ),
file('SEU102+1.p',unknown),
[] ).
cnf(18,axiom,
( empty(A)
| ~ preboolean(A)
| ~ element(B,A)
| ~ element(C,A)
| prebool_difference(A,B,C) = set_difference(B,C) ),
file('SEU102+1.p',unknown),
[] ).
cnf(19,axiom,
~ empty(dollar_c5),
file('SEU102+1.p',unknown),
[] ).
cnf(20,axiom,
~ element(set_intersection2(dollar_c7,dollar_c6),dollar_c5),
file('SEU102+1.p',unknown),
[] ).
cnf(64,axiom,
preboolean(dollar_c5),
file('SEU102+1.p',unknown),
[] ).
cnf(65,axiom,
element(dollar_c7,dollar_c5),
file('SEU102+1.p',unknown),
[] ).
cnf(66,axiom,
element(dollar_c6,dollar_c5),
file('SEU102+1.p',unknown),
[] ).
cnf(71,axiom,
set_difference(A,set_difference(A,B)) = set_intersection2(A,B),
file('SEU102+1.p',unknown),
[] ).
cnf(73,plain,
set_intersection2(A,B) = set_difference(A,set_difference(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[71])]),
[iquote('copy,71,flip.1')] ).
cnf(79,plain,
~ element(set_difference(dollar_c7,set_difference(dollar_c7,dollar_c6)),dollar_c5),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[20]),73]),
[iquote('back_demod,20,demod,73')] ).
cnf(186,plain,
set_difference(dollar_c7,dollar_c6) = prebool_difference(dollar_c5,dollar_c7,dollar_c6),
inference(flip,[status(thm),theory(equality)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[66,18,64,65]),19])]),
[iquote('hyper,66,18,64,65,unit_del,19,flip.1')] ).
cnf(193,plain,
element(prebool_difference(dollar_c5,dollar_c7,dollar_c6),dollar_c5),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[66,7,64,65]),19]),
[iquote('hyper,66,7,64,65,unit_del,19')] ).
cnf(197,plain,
~ element(set_difference(dollar_c7,prebool_difference(dollar_c5,dollar_c7,dollar_c6)),dollar_c5),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[79]),186]),
[iquote('back_demod,79,demod,186')] ).
cnf(763,plain,
set_difference(dollar_c7,prebool_difference(dollar_c5,dollar_c7,dollar_c6)) = prebool_difference(dollar_c5,dollar_c7,prebool_difference(dollar_c5,dollar_c7,dollar_c6)),
inference(flip,[status(thm),theory(equality)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[193,18,64,65]),19])]),
[iquote('hyper,193,18,64,65,unit_del,19,flip.1')] ).
cnf(775,plain,
element(prebool_difference(dollar_c5,dollar_c7,prebool_difference(dollar_c5,dollar_c7,dollar_c6)),dollar_c5),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[193,7,64,65]),19]),
[iquote('hyper,193,7,64,65,unit_del,19')] ).
cnf(780,plain,
~ element(prebool_difference(dollar_c5,dollar_c7,prebool_difference(dollar_c5,dollar_c7,dollar_c6)),dollar_c5),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[197]),763]),
[iquote('back_demod,197,demod,763')] ).
cnf(781,plain,
$false,
inference(binary,[status(thm)],[780,775]),
[iquote('binary,780.1,775.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU102+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 07:14:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.89/2.07 ----- Otter 3.3f, August 2004 -----
% 1.89/2.07 The process was started by sandbox2 on n007.cluster.edu,
% 1.89/2.07 Wed Jul 27 07:14:16 2022
% 1.89/2.07 The command was "./otter". The process ID is 13426.
% 1.89/2.07
% 1.89/2.07 set(prolog_style_variables).
% 1.89/2.07 set(auto).
% 1.89/2.07 dependent: set(auto1).
% 1.89/2.07 dependent: set(process_input).
% 1.89/2.07 dependent: clear(print_kept).
% 1.89/2.07 dependent: clear(print_new_demod).
% 1.89/2.07 dependent: clear(print_back_demod).
% 1.89/2.07 dependent: clear(print_back_sub).
% 1.89/2.07 dependent: set(control_memory).
% 1.89/2.07 dependent: assign(max_mem, 12000).
% 1.89/2.07 dependent: assign(pick_given_ratio, 4).
% 1.89/2.07 dependent: assign(stats_level, 1).
% 1.89/2.07 dependent: assign(max_seconds, 10800).
% 1.89/2.07 clear(print_given).
% 1.89/2.07
% 1.89/2.07 formula_list(usable).
% 1.89/2.07 all A (A=A).
% 1.89/2.07 all A B (in(A,B)-> -in(B,A)).
% 1.89/2.07 all A (empty(A)->finite(A)).
% 1.89/2.07 all A (preboolean(A)->cup_closed(A)&diff_closed(A)).
% 1.89/2.07 all A (finite(A)-> (all B (element(B,powerset(A))->finite(B)))).
% 1.89/2.07 all A (cup_closed(A)&diff_closed(A)->preboolean(A)).
% 1.89/2.07 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.89/2.07 all A B C (-empty(A)&preboolean(A)&element(B,A)&element(C,A)->element(prebool_difference(A,B,C),A)).
% 1.89/2.07 all A exists B element(B,A).
% 1.89/2.07 all A B (finite(B)->finite(set_intersection2(A,B))).
% 1.89/2.07 all A B (finite(A)->finite(set_intersection2(A,B))).
% 1.89/2.07 all A B (finite(A)->finite(set_difference(A,B))).
% 1.89/2.07 all A (-empty(powerset(A))).
% 1.89/2.07 empty(empty_set).
% 1.89/2.07 all A B (set_intersection2(A,A)=A).
% 1.89/2.07 exists A (-empty(A)&finite(A)).
% 1.89/2.07 exists A (-empty(A)&cup_closed(A)&cap_closed(A)&diff_closed(A)&preboolean(A)).
% 1.89/2.07 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.89/2.07 exists A empty(A).
% 1.89/2.07 all A exists B (element(B,powerset(A))&empty(B)&relation(B)&function(B)&one_to_one(B)&epsilon_transitive(B)&epsilon_connected(B)&ordinal(B)&natural(B)&finite(B)).
% 1.89/2.07 all A exists B (element(B,powerset(A))&empty(B)).
% 1.89/2.07 exists A (-empty(A)).
% 1.89/2.07 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 1.89/2.07 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 1.89/2.07 all A B C (-empty(A)&preboolean(A)&element(B,A)&element(C,A)->prebool_difference(A,B,C)=set_difference(B,C)).
% 1.89/2.07 all A B subset(A,A).
% 1.89/2.07 -(all A B C (-empty(C)&preboolean(C)-> (element(A,C)&element(B,C)->element(set_intersection2(A,B),C)))).
% 1.89/2.07 all A B (in(A,B)->element(A,B)).
% 1.89/2.07 all A (set_intersection2(A,empty_set)=empty_set).
% 1.89/2.07 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.89/2.07 all A (set_difference(A,empty_set)=A).
% 1.89/2.07 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.89/2.07 all A B (set_difference(A,set_difference(A,B))=set_intersection2(A,B)).
% 1.89/2.07 all A (set_difference(empty_set,A)=empty_set).
% 1.89/2.07 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.89/2.07 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.89/2.07 all A (empty(A)->A=empty_set).
% 1.89/2.07 all A B (-(in(A,B)&empty(B))).
% 1.89/2.07 all A B (-(empty(A)&A!=B&empty(B))).
% 1.89/2.07 end_of_list.
% 1.89/2.07
% 1.89/2.07 -------> usable clausifies to:
% 1.89/2.07
% 1.89/2.07 list(usable).
% 1.89/2.07 0 [] A=A.
% 1.89/2.07 0 [] -in(A,B)| -in(B,A).
% 1.89/2.07 0 [] -empty(A)|finite(A).
% 1.89/2.07 0 [] -preboolean(A)|cup_closed(A).
% 1.89/2.07 0 [] -preboolean(A)|diff_closed(A).
% 1.89/2.07 0 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 1.89/2.07 0 [] -cup_closed(A)| -diff_closed(A)|preboolean(A).
% 1.89/2.07 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.89/2.07 0 [] empty(A)| -preboolean(A)| -element(B,A)| -element(C,A)|element(prebool_difference(A,B,C),A).
% 1.89/2.07 0 [] element($f1(A),A).
% 1.89/2.07 0 [] -finite(B)|finite(set_intersection2(A,B)).
% 1.89/2.07 0 [] -finite(A)|finite(set_intersection2(A,B)).
% 1.89/2.07 0 [] -finite(A)|finite(set_difference(A,B)).
% 1.89/2.07 0 [] -empty(powerset(A)).
% 1.89/2.07 0 [] empty(empty_set).
% 1.89/2.07 0 [] set_intersection2(A,A)=A.
% 1.89/2.07 0 [] -empty($c1).
% 1.89/2.07 0 [] finite($c1).
% 1.89/2.07 0 [] -empty($c2).
% 1.89/2.07 0 [] cup_closed($c2).
% 1.89/2.07 0 [] cap_closed($c2).
% 1.89/2.07 0 [] diff_closed($c2).
% 1.89/2.07 0 [] preboolean($c2).
% 1.89/2.07 0 [] empty(A)|element($f2(A),powerset(A)).
% 1.89/2.07 0 [] empty(A)| -empty($f2(A)).
% 1.89/2.07 0 [] empty($c3).
% 1.89/2.07 0 [] element($f3(A),powerset(A)).
% 1.89/2.07 0 [] empty($f3(A)).
% 1.89/2.07 0 [] relation($f3(A)).
% 1.89/2.07 0 [] function($f3(A)).
% 1.89/2.07 0 [] one_to_one($f3(A)).
% 1.89/2.07 0 [] epsilon_transitive($f3(A)).
% 1.89/2.07 0 [] epsilon_connected($f3(A)).
% 1.89/2.07 0 [] ordinal($f3(A)).
% 1.89/2.07 0 [] natural($f3(A)).
% 1.89/2.07 0 [] finite($f3(A)).
% 1.89/2.07 0 [] element($f4(A),powerset(A)).
% 1.89/2.07 0 [] empty($f4(A)).
% 1.89/2.07 0 [] -empty($c4).
% 1.89/2.07 0 [] empty(A)|element($f5(A),powerset(A)).
% 1.89/2.07 0 [] empty(A)| -empty($f5(A)).
% 1.89/2.07 0 [] empty(A)|finite($f5(A)).
% 1.89/2.07 0 [] empty(A)|element($f6(A),powerset(A)).
% 1.89/2.07 0 [] empty(A)| -empty($f6(A)).
% 1.89/2.07 0 [] empty(A)|finite($f6(A)).
% 1.89/2.07 0 [] empty(A)| -preboolean(A)| -element(B,A)| -element(C,A)|prebool_difference(A,B,C)=set_difference(B,C).
% 1.89/2.07 0 [] subset(A,A).
% 1.89/2.07 0 [] -empty($c5).
% 1.89/2.07 0 [] preboolean($c5).
% 1.89/2.07 0 [] element($c7,$c5).
% 1.89/2.07 0 [] element($c6,$c5).
% 1.89/2.07 0 [] -element(set_intersection2($c7,$c6),$c5).
% 1.89/2.07 0 [] -in(A,B)|element(A,B).
% 1.89/2.07 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.89/2.07 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.89/2.07 0 [] set_difference(A,empty_set)=A.
% 1.89/2.07 0 [] -element(A,powerset(B))|subset(A,B).
% 1.89/2.07 0 [] element(A,powerset(B))| -subset(A,B).
% 1.89/2.07 0 [] set_difference(A,set_difference(A,B))=set_intersection2(A,B).
% 1.89/2.07 0 [] set_difference(empty_set,A)=empty_set.
% 1.89/2.07 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.89/2.07 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.89/2.07 0 [] -empty(A)|A=empty_set.
% 1.89/2.07 0 [] -in(A,B)| -empty(B).
% 1.89/2.07 0 [] -empty(A)|A=B| -empty(B).
% 1.89/2.07 end_of_list.
% 1.89/2.07
% 1.89/2.07 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.89/2.07
% 1.89/2.07 This ia a non-Horn set with equality. The strategy will be
% 1.89/2.07 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.89/2.07 deletion, with positive clauses in sos and nonpositive
% 1.89/2.07 clauses in usable.
% 1.89/2.07
% 1.89/2.07 dependent: set(knuth_bendix).
% 1.89/2.07 dependent: set(anl_eq).
% 1.89/2.07 dependent: set(para_from).
% 1.89/2.07 dependent: set(para_into).
% 1.89/2.07 dependent: clear(para_from_right).
% 1.89/2.07 dependent: clear(para_into_right).
% 1.89/2.07 dependent: set(para_from_vars).
% 1.89/2.07 dependent: set(eq_units_both_ways).
% 1.89/2.07 dependent: set(dynamic_demod_all).
% 1.89/2.07 dependent: set(dynamic_demod).
% 1.89/2.07 dependent: set(order_eq).
% 1.89/2.07 dependent: set(back_demod).
% 1.89/2.07 dependent: set(lrpo).
% 1.89/2.07 dependent: set(hyper_res).
% 1.89/2.07 dependent: set(unit_deletion).
% 1.89/2.07 dependent: set(factor).
% 1.89/2.07
% 1.89/2.07 ------------> process usable:
% 1.89/2.07 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.89/2.07 ** KEPT (pick-wt=4): 2 [] -empty(A)|finite(A).
% 1.89/2.07 ** KEPT (pick-wt=4): 3 [] -preboolean(A)|cup_closed(A).
% 1.89/2.07 ** KEPT (pick-wt=4): 4 [] -preboolean(A)|diff_closed(A).
% 1.89/2.07 ** KEPT (pick-wt=8): 5 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 1.89/2.07 ** KEPT (pick-wt=6): 6 [] -cup_closed(A)| -diff_closed(A)|preboolean(A).
% 1.89/2.07 ** KEPT (pick-wt=16): 7 [] empty(A)| -preboolean(A)| -element(B,A)| -element(C,A)|element(prebool_difference(A,B,C),A).
% 1.89/2.07 ** KEPT (pick-wt=6): 8 [] -finite(A)|finite(set_intersection2(B,A)).
% 1.89/2.07 ** KEPT (pick-wt=6): 9 [] -finite(A)|finite(set_intersection2(A,B)).
% 1.89/2.07 ** KEPT (pick-wt=6): 10 [] -finite(A)|finite(set_difference(A,B)).
% 1.89/2.07 ** KEPT (pick-wt=3): 11 [] -empty(powerset(A)).
% 1.89/2.07 ** KEPT (pick-wt=2): 12 [] -empty($c1).
% 1.89/2.07 ** KEPT (pick-wt=2): 13 [] -empty($c2).
% 1.89/2.07 ** KEPT (pick-wt=5): 14 [] empty(A)| -empty($f2(A)).
% 1.89/2.07 ** KEPT (pick-wt=2): 15 [] -empty($c4).
% 1.89/2.07 ** KEPT (pick-wt=5): 16 [] empty(A)| -empty($f5(A)).
% 1.89/2.07 ** KEPT (pick-wt=5): 17 [] empty(A)| -empty($f6(A)).
% 1.89/2.07 ** KEPT (pick-wt=18): 18 [] empty(A)| -preboolean(A)| -element(B,A)| -element(C,A)|prebool_difference(A,B,C)=set_difference(B,C).
% 1.89/2.07 ** KEPT (pick-wt=2): 19 [] -empty($c5).
% 1.89/2.07 ** KEPT (pick-wt=5): 20 [] -element(set_intersection2($c7,$c6),$c5).
% 1.89/2.07 ** KEPT (pick-wt=6): 21 [] -in(A,B)|element(A,B).
% 1.89/2.07 ** KEPT (pick-wt=8): 22 [] -element(A,B)|empty(B)|in(A,B).
% 1.89/2.07 ** KEPT (pick-wt=7): 23 [] -element(A,powerset(B))|subset(A,B).
% 1.89/2.07 ** KEPT (pick-wt=7): 24 [] element(A,powerset(B))| -subset(A,B).
% 1.89/2.07 ** KEPT (pick-wt=10): 25 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.89/2.07 ** KEPT (pick-wt=9): 26 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.89/2.07 ** KEPT (pick-wt=5): 27 [] -empty(A)|A=empty_set.
% 1.89/2.07 ** KEPT (pick-wt=5): 28 [] -in(A,B)| -empty(B).
% 1.89/2.07 ** KEPT (pick-wt=7): 29 [] -empty(A)|A=B| -empty(B).
% 1.89/2.07
% 1.89/2.07 ------------> process sos:
% 1.89/2.07 ** KEPT (pick-wt=3): 34 [] A=A.
% 1.89/2.07 ** KEPT (pick-wt=7): 35 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.89/2.07 ** KEPT (pick-wt=4): 36 [] element($f1(A),A).
% 1.89/2.07 ** KEPT (pick-wt=2): 37 [] empty(empty_set).
% 1.89/2.07 ** KEPT (pick-wt=5): 38 [] set_intersection2(A,A)=A.
% 1.89/2.07 ---> New Demodulator: 39 [new_demod,38] set_intersection2(A,A)=A.
% 1.89/2.07 ** KEPT (pick-wt=2): 40 [] finite($c1).
% 1.89/2.07 ** KEPT (pick-wt=2): 41 [] cup_closed($c2).
% 1.89/2.07 ** KEPT (pick-wt=2): 42 [] cap_closed($c2).
% 1.89/2.07 ** KEPT (pick-wt=2): 43 [] diff_closed($c2).
% 1.89/2.07 ** KEPT (pick-wt=2): 44 [] preboolean($c2).
% 1.89/2.07 ** KEPT (pick-wt=7): 45 [] empty(A)|element($f2(A),powerset(A)).
% 1.89/2.07 ** KEPT (pick-wt=2): 46 [] empty($c3).
% 2.00/2.15 ** KEPT (pick-wt=5): 47 [] element($f3(A),powerset(A)).
% 2.00/2.15 ** KEPT (pick-wt=3): 48 [] empty($f3(A)).
% 2.00/2.15 ** KEPT (pick-wt=3): 49 [] relation($f3(A)).
% 2.00/2.15 ** KEPT (pick-wt=3): 50 [] function($f3(A)).
% 2.00/2.15 ** KEPT (pick-wt=3): 51 [] one_to_one($f3(A)).
% 2.00/2.15 ** KEPT (pick-wt=3): 52 [] epsilon_transitive($f3(A)).
% 2.00/2.15 ** KEPT (pick-wt=3): 53 [] epsilon_connected($f3(A)).
% 2.00/2.15 ** KEPT (pick-wt=3): 54 [] ordinal($f3(A)).
% 2.00/2.15 ** KEPT (pick-wt=3): 55 [] natural($f3(A)).
% 2.00/2.15 ** KEPT (pick-wt=3): 56 [] finite($f3(A)).
% 2.00/2.15 ** KEPT (pick-wt=5): 57 [] element($f4(A),powerset(A)).
% 2.00/2.15 ** KEPT (pick-wt=3): 58 [] empty($f4(A)).
% 2.00/2.15 ** KEPT (pick-wt=7): 59 [] empty(A)|element($f5(A),powerset(A)).
% 2.00/2.15 ** KEPT (pick-wt=5): 60 [] empty(A)|finite($f5(A)).
% 2.00/2.15 ** KEPT (pick-wt=7): 61 [] empty(A)|element($f6(A),powerset(A)).
% 2.00/2.15 ** KEPT (pick-wt=5): 62 [] empty(A)|finite($f6(A)).
% 2.00/2.15 ** KEPT (pick-wt=3): 63 [] subset(A,A).
% 2.00/2.15 ** KEPT (pick-wt=2): 64 [] preboolean($c5).
% 2.00/2.15 ** KEPT (pick-wt=3): 65 [] element($c7,$c5).
% 2.00/2.15 ** KEPT (pick-wt=3): 66 [] element($c6,$c5).
% 2.00/2.15 ** KEPT (pick-wt=5): 67 [] set_intersection2(A,empty_set)=empty_set.
% 2.00/2.15 ---> New Demodulator: 68 [new_demod,67] set_intersection2(A,empty_set)=empty_set.
% 2.00/2.15 ** KEPT (pick-wt=5): 69 [] set_difference(A,empty_set)=A.
% 2.00/2.15 ---> New Demodulator: 70 [new_demod,69] set_difference(A,empty_set)=A.
% 2.00/2.15 ** KEPT (pick-wt=9): 72 [copy,71,flip.1] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 2.00/2.15 ---> New Demodulator: 73 [new_demod,72] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 2.00/2.15 ** KEPT (pick-wt=5): 74 [] set_difference(empty_set,A)=empty_set.
% 2.00/2.15 ---> New Demodulator: 75 [new_demod,74] set_difference(empty_set,A)=empty_set.
% 2.00/2.15 Following clause subsumed by 34 during input processing: 0 [copy,34,flip.1] A=A.
% 2.00/2.15 34 back subsumes 33.
% 2.00/2.15 ** KEPT (pick-wt=11): 76 [copy,35,flip.1,demod,73,73] set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 2.00/2.15 >>>> Starting back demodulation with 39.
% 2.00/2.15 >>>> Starting back demodulation with 68.
% 2.00/2.15 >>>> Starting back demodulation with 70.
% 2.00/2.15 >>>> Starting back demodulation with 73.
% 2.00/2.15 >> back demodulating 67 with 73.
% 2.00/2.15 >> back demodulating 38 with 73.
% 2.00/2.15 >> back demodulating 35 with 73.
% 2.00/2.15 >> back demodulating 20 with 73.
% 2.00/2.15 >> back demodulating 9 with 73.
% 2.00/2.15 >> back demodulating 8 with 73.
% 2.00/2.15 >>>> Starting back demodulation with 75.
% 2.00/2.15 Following clause subsumed by 76 during input processing: 0 [copy,76,flip.1] set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 2.00/2.15 >>>> Starting back demodulation with 78.
% 2.00/2.15 >> back demodulating 32 with 78.
% 2.00/2.15
% 2.00/2.15 ======= end of input processing =======
% 2.00/2.15
% 2.00/2.15 =========== start of search ===========
% 2.00/2.15
% 2.00/2.15 -------- PROOF --------
% 2.00/2.15
% 2.00/2.15 ----> UNIT CONFLICT at 0.08 sec ----> 781 [binary,780.1,775.1] $F.
% 2.00/2.15
% 2.00/2.15 Length of proof is 8. Level of proof is 4.
% 2.00/2.15
% 2.00/2.15 ---------------- PROOF ----------------
% 2.00/2.15 % SZS status Theorem
% 2.00/2.15 % SZS output start Refutation
% See solution above
% 2.00/2.15 ------------ end of proof -------------
% 2.00/2.15
% 2.00/2.15
% 2.00/2.15 Search stopped by max_proofs option.
% 2.00/2.15
% 2.00/2.15
% 2.00/2.15 Search stopped by max_proofs option.
% 2.00/2.15
% 2.00/2.15 ============ end of search ============
% 2.00/2.15
% 2.00/2.15 -------------- statistics -------------
% 2.00/2.15 clauses given 137
% 2.00/2.15 clauses generated 2924
% 2.00/2.15 clauses kept 736
% 2.00/2.15 clauses forward subsumed 2296
% 2.00/2.15 clauses back subsumed 13
% 2.00/2.15 Kbytes malloced 3906
% 2.00/2.15
% 2.00/2.15 ----------- times (seconds) -----------
% 2.00/2.15 user CPU time 0.08 (0 hr, 0 min, 0 sec)
% 2.00/2.15 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.00/2.15 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.00/2.15
% 2.00/2.15 That finishes the proof of the theorem.
% 2.00/2.15
% 2.00/2.15 Process 13426 finished Wed Jul 27 07:14:18 2022
% 2.00/2.15 Otter interrupted
% 2.00/2.15 PROOF FOUND
%------------------------------------------------------------------------------