TSTP Solution File: SET662+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET662+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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:01 EDT 2022
% Result : Theorem 1.79s 2.00s
% Output : Refutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 16 ( 8 unt; 4 nHn; 9 RR)
% Number of literals : 35 ( 0 equ; 18 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 21 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ ilf_type(A,set_type)
| ~ ilf_type(B,set_type)
| ~ ilf_type(C,subset_type(cross_product(A,B)))
| ilf_type(C,relation_type(A,B)) ),
file('SET662+3.p',unknown),
[] ).
cnf(8,axiom,
( ~ ilf_type(A,set_type)
| ~ ilf_type(B,set_type)
| ilf_type(B,subset_type(A))
| ~ ilf_type(B,member_type(power_set(A))) ),
file('SET662+3.p',unknown),
[] ).
cnf(15,axiom,
( ~ ilf_type(A,set_type)
| ~ empty(A)
| ~ ilf_type(B,set_type)
| ~ member(B,A) ),
file('SET662+3.p',unknown),
[] ).
cnf(20,axiom,
( ~ ilf_type(A,set_type)
| ~ ilf_type(B,set_type)
| member(A,power_set(B))
| member(dollar_f5(A,B),A) ),
file('SET662+3.p',unknown),
[] ).
cnf(22,axiom,
( ~ ilf_type(A,set_type)
| ~ empty(power_set(A)) ),
file('SET662+3.p',unknown),
[] ).
cnf(25,axiom,
( ~ ilf_type(A,set_type)
| empty(B)
| ~ ilf_type(B,set_type)
| ilf_type(A,member_type(B))
| ~ member(A,B) ),
file('SET662+3.p',unknown),
[] ).
cnf(37,axiom,
~ ilf_type(empty_set,relation_type(dollar_c2,dollar_c1)),
file('SET662+3.p',unknown),
[] ).
cnf(66,axiom,
empty(empty_set),
file('SET662+3.p',unknown),
[] ).
cnf(68,axiom,
ilf_type(A,set_type),
file('SET662+3.p',unknown),
[] ).
cnf(75,plain,
( member(A,power_set(B))
| member(dollar_f5(A,B),A) ),
inference(hyper,[status(thm)],[68,20,68]),
[iquote('hyper,68,20,68')] ).
cnf(119,plain,
member(empty_set,power_set(A)),
inference(hyper,[status(thm)],[75,15,68,66,68]),
[iquote('hyper,75,15,68,66,68')] ).
cnf(126,plain,
( empty(power_set(A))
| ilf_type(empty_set,member_type(power_set(A))) ),
inference(hyper,[status(thm)],[119,25,68,68]),
[iquote('hyper,119,25,68,68')] ).
cnf(196,plain,
ilf_type(empty_set,member_type(power_set(A))),
inference(hyper,[status(thm)],[126,22,68]),
[iquote('hyper,126,22,68')] ).
cnf(200,plain,
ilf_type(empty_set,subset_type(A)),
inference(hyper,[status(thm)],[196,8,68,68]),
[iquote('hyper,196,8,68,68')] ).
cnf(202,plain,
ilf_type(empty_set,relation_type(A,B)),
inference(hyper,[status(thm)],[200,2,68,68]),
[iquote('hyper,200,2,68,68')] ).
cnf(203,plain,
$false,
inference(binary,[status(thm)],[202,37]),
[iquote('binary,202.1,37.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET662+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n028.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 10:42:04 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.79/1.99 ----- Otter 3.3f, August 2004 -----
% 1.79/1.99 The process was started by sandbox on n028.cluster.edu,
% 1.79/1.99 Wed Jul 27 10:42:04 2022
% 1.79/1.99 The command was "./otter". The process ID is 23655.
% 1.79/1.99
% 1.79/1.99 set(prolog_style_variables).
% 1.79/1.99 set(auto).
% 1.79/1.99 dependent: set(auto1).
% 1.79/1.99 dependent: set(process_input).
% 1.79/1.99 dependent: clear(print_kept).
% 1.79/1.99 dependent: clear(print_new_demod).
% 1.79/1.99 dependent: clear(print_back_demod).
% 1.79/1.99 dependent: clear(print_back_sub).
% 1.79/1.99 dependent: set(control_memory).
% 1.79/1.99 dependent: assign(max_mem, 12000).
% 1.79/1.99 dependent: assign(pick_given_ratio, 4).
% 1.79/1.99 dependent: assign(stats_level, 1).
% 1.79/1.99 dependent: assign(max_seconds, 10800).
% 1.79/1.99 clear(print_given).
% 1.79/1.99
% 1.79/1.99 formula_list(usable).
% 1.79/1.99 all A (A=A).
% 1.79/1.99 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->subset(empty_set,cross_product(B,C))))).
% 1.79/1.99 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,subset_type(cross_product(B,C)))->ilf_type(D,relation_type(B,C))))& (all E (ilf_type(E,relation_type(B,C))->ilf_type(E,subset_type(cross_product(B,C)))))))).
% 1.79/1.99 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (exists D ilf_type(D,relation_type(C,B)))))).
% 1.79/1.99 all B (ilf_type(B,set_type)-> -member(B,empty_set)).
% 1.79/1.99 empty(empty_set).
% 1.79/1.99 type(empty_set,set_type).
% 1.79/1.99 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(cross_product(B,C),set_type)))).
% 1.79/1.99 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (ilf_type(C,subset_type(B))<->ilf_type(C,member_type(power_set(B))))))).
% 1.79/1.99 all B (ilf_type(B,set_type)-> (exists C ilf_type(C,subset_type(B)))).
% 1.79/1.99 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (subset(B,C)<-> (all D (ilf_type(D,set_type)-> (member(D,B)->member(D,C)))))))).
% 1.79/1.99 all B (ilf_type(B,set_type)->subset(B,B)).
% 1.79/1.99 all B (ilf_type(B,set_type)-> (empty(B)<-> (all C (ilf_type(C,set_type)-> -member(C,B))))).
% 1.79/1.99 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (member(B,power_set(C))<-> (all D (ilf_type(D,set_type)-> (member(D,B)->member(D,C)))))))).
% 1.79/1.99 all B (ilf_type(B,set_type)-> -empty(power_set(B))&ilf_type(power_set(B),set_type)).
% 1.79/1.99 all B (ilf_type(B,set_type)-> (all C (-empty(C)&ilf_type(C,set_type)-> (ilf_type(B,member_type(C))<->member(B,C))))).
% 1.79/1.99 all B (-empty(B)&ilf_type(B,set_type)-> (exists C ilf_type(C,member_type(B)))).
% 1.79/1.99 all B (ilf_type(B,set_type)-> (relation_like(B)<-> (all C (ilf_type(C,set_type)-> (member(C,B)-> (exists D (ilf_type(D,set_type)& (exists E (ilf_type(E,set_type)&C=ordered_pair(D,E)))))))))).
% 1.79/1.99 all B (empty(B)&ilf_type(B,set_type)->relation_like(B)).
% 1.79/1.99 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,subset_type(cross_product(B,C)))->relation_like(D)))))).
% 1.79/1.99 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(ordered_pair(B,C),set_type)))).
% 1.79/1.99 all B ilf_type(B,set_type).
% 1.79/1.99 -(all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(empty_set,relation_type(B,C)))))).
% 1.79/1.99 end_of_list.
% 1.79/1.99
% 1.79/1.99 -------> usable clausifies to:
% 1.79/1.99
% 1.79/1.99 list(usable).
% 1.79/1.99 0 [] A=A.
% 1.79/1.99 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|subset(empty_set,cross_product(B,C)).
% 1.79/1.99 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,subset_type(cross_product(B,C)))|ilf_type(D,relation_type(B,C)).
% 1.79/1.99 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(E,relation_type(B,C))|ilf_type(E,subset_type(cross_product(B,C))).
% 1.79/1.99 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type($f1(B,C),relation_type(C,B)).
% 1.79/1.99 0 [] -ilf_type(B,set_type)| -member(B,empty_set).
% 1.79/1.99 0 [] empty(empty_set).
% 1.79/1.99 0 [] type(empty_set,set_type).
% 1.79/1.99 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(cross_product(B,C),set_type).
% 1.79/1.99 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(C,subset_type(B))|ilf_type(C,member_type(power_set(B))).
% 1.79/1.99 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(C,subset_type(B))| -ilf_type(C,member_type(power_set(B))).
% 1.79/1.99 0 [] -ilf_type(B,set_type)|ilf_type($f2(B),subset_type(B)).
% 1.79/1.99 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -subset(B,C)| -ilf_type(D,set_type)| -member(D,B)|member(D,C).
% 1.79/1.99 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|subset(B,C)|ilf_type($f3(B,C),set_type).
% 1.79/1.99 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|subset(B,C)|member($f3(B,C),B).
% 1.79/2.00 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|subset(B,C)| -member($f3(B,C),C).
% 1.79/2.00 0 [] -ilf_type(B,set_type)|subset(B,B).
% 1.79/2.00 0 [] -ilf_type(B,set_type)| -empty(B)| -ilf_type(C,set_type)| -member(C,B).
% 1.79/2.00 0 [] -ilf_type(B,set_type)|empty(B)|ilf_type($f4(B),set_type).
% 1.79/2.00 0 [] -ilf_type(B,set_type)|empty(B)|member($f4(B),B).
% 1.79/2.00 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -member(B,power_set(C))| -ilf_type(D,set_type)| -member(D,B)|member(D,C).
% 1.79/2.00 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))|ilf_type($f5(B,C),set_type).
% 1.79/2.00 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))|member($f5(B,C),B).
% 1.79/2.00 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))| -member($f5(B,C),C).
% 1.79/2.00 0 [] -ilf_type(B,set_type)| -empty(power_set(B)).
% 1.79/2.00 0 [] -ilf_type(B,set_type)|ilf_type(power_set(B),set_type).
% 1.79/2.00 0 [] -ilf_type(B,set_type)|empty(C)| -ilf_type(C,set_type)| -ilf_type(B,member_type(C))|member(B,C).
% 1.79/2.00 0 [] -ilf_type(B,set_type)|empty(C)| -ilf_type(C,set_type)|ilf_type(B,member_type(C))| -member(B,C).
% 1.79/2.00 0 [] empty(B)| -ilf_type(B,set_type)|ilf_type($f6(B),member_type(B)).
% 1.79/2.00 0 [] -ilf_type(B,set_type)| -relation_like(B)| -ilf_type(C,set_type)| -member(C,B)|ilf_type($f8(B,C),set_type).
% 1.79/2.00 0 [] -ilf_type(B,set_type)| -relation_like(B)| -ilf_type(C,set_type)| -member(C,B)|ilf_type($f7(B,C),set_type).
% 1.79/2.00 0 [] -ilf_type(B,set_type)| -relation_like(B)| -ilf_type(C,set_type)| -member(C,B)|C=ordered_pair($f8(B,C),$f7(B,C)).
% 1.79/2.00 0 [] -ilf_type(B,set_type)|relation_like(B)|ilf_type($f9(B),set_type).
% 1.79/2.00 0 [] -ilf_type(B,set_type)|relation_like(B)|member($f9(B),B).
% 1.79/2.00 0 [] -ilf_type(B,set_type)|relation_like(B)| -ilf_type(D,set_type)| -ilf_type(E,set_type)|$f9(B)!=ordered_pair(D,E).
% 1.79/2.00 0 [] -empty(B)| -ilf_type(B,set_type)|relation_like(B).
% 1.79/2.00 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,subset_type(cross_product(B,C)))|relation_like(D).
% 1.79/2.00 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(ordered_pair(B,C),set_type).
% 1.79/2.00 0 [] ilf_type(B,set_type).
% 1.79/2.00 0 [] ilf_type($c2,set_type).
% 1.79/2.00 0 [] ilf_type($c1,set_type).
% 1.79/2.00 0 [] -ilf_type(empty_set,relation_type($c2,$c1)).
% 1.79/2.00 end_of_list.
% 1.79/2.00
% 1.79/2.00 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.79/2.00
% 1.79/2.00 This ia a non-Horn set with equality. The strategy will be
% 1.79/2.00 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.79/2.00 deletion, with positive clauses in sos and nonpositive
% 1.79/2.00 clauses in usable.
% 1.79/2.00
% 1.79/2.00 dependent: set(knuth_bendix).
% 1.79/2.00 dependent: set(anl_eq).
% 1.79/2.00 dependent: set(para_from).
% 1.79/2.00 dependent: set(para_into).
% 1.79/2.00 dependent: clear(para_from_right).
% 1.79/2.00 dependent: clear(para_into_right).
% 1.79/2.00 dependent: set(para_from_vars).
% 1.79/2.00 dependent: set(eq_units_both_ways).
% 1.79/2.00 dependent: set(dynamic_demod_all).
% 1.79/2.00 dependent: set(dynamic_demod).
% 1.79/2.00 dependent: set(order_eq).
% 1.79/2.00 dependent: set(back_demod).
% 1.79/2.00 dependent: set(lrpo).
% 1.79/2.00 dependent: set(hyper_res).
% 1.79/2.00 dependent: set(unit_deletion).
% 1.79/2.00 dependent: set(factor).
% 1.79/2.00
% 1.79/2.00 ------------> process usable:
% 1.79/2.00 ** KEPT (pick-wt=11): 1 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|subset(empty_set,cross_product(A,B)).
% 1.79/2.00 ** KEPT (pick-wt=17): 2 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,subset_type(cross_product(A,B)))|ilf_type(C,relation_type(A,B)).
% 1.79/2.00 ** KEPT (pick-wt=17): 3 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,relation_type(A,B))|ilf_type(C,subset_type(cross_product(A,B))).
% 1.79/2.00 ** KEPT (pick-wt=13): 4 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type($f1(A,B),relation_type(B,A)).
% 1.79/2.00 ** KEPT (pick-wt=6): 5 [] -ilf_type(A,set_type)| -member(A,empty_set).
% 1.79/2.00 ** KEPT (pick-wt=11): 6 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(cross_product(A,B),set_type).
% 1.79/2.00 ** KEPT (pick-wt=15): 7 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(B,subset_type(A))|ilf_type(B,member_type(power_set(A))).
% 1.79/2.00 ** KEPT (pick-wt=15): 8 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(B,subset_type(A))| -ilf_type(B,member_type(power_set(A))).
% 1.79/2.00 ** KEPT (pick-wt=8): 9 [] -ilf_type(A,set_type)|ilf_type($f2(A),subset_type(A)).
% 1.79/2.00 ** KEPT (pick-wt=18): 10 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -subset(A,B)| -ilf_type(C,set_type)| -member(C,A)|member(C,B).
% 1.79/2.00 ** KEPT (pick-wt=14): 11 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|subset(A,B)|ilf_type($f3(A,B),set_type).
% 1.79/2.00 ** KEPT (pick-wt=14): 12 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|subset(A,B)|member($f3(A,B),A).
% 1.79/2.00 ** KEPT (pick-wt=14): 13 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|subset(A,B)| -member($f3(A,B),B).
% 1.79/2.00 ** KEPT (pick-wt=6): 14 [] -ilf_type(A,set_type)|subset(A,A).
% 1.79/2.00 ** KEPT (pick-wt=11): 15 [] -ilf_type(A,set_type)| -empty(A)| -ilf_type(B,set_type)| -member(B,A).
% 1.79/2.00 ** KEPT (pick-wt=9): 16 [] -ilf_type(A,set_type)|empty(A)|ilf_type($f4(A),set_type).
% 1.79/2.00 ** KEPT (pick-wt=9): 17 [] -ilf_type(A,set_type)|empty(A)|member($f4(A),A).
% 1.79/2.00 ** KEPT (pick-wt=19): 18 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -member(A,power_set(B))| -ilf_type(C,set_type)| -member(C,A)|member(C,B).
% 1.79/2.00 ** KEPT (pick-wt=15): 19 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))|ilf_type($f5(A,B),set_type).
% 1.79/2.00 ** KEPT (pick-wt=15): 20 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))|member($f5(A,B),A).
% 1.79/2.00 ** KEPT (pick-wt=15): 21 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))| -member($f5(A,B),B).
% 1.79/2.00 ** KEPT (pick-wt=6): 22 [] -ilf_type(A,set_type)| -empty(power_set(A)).
% 1.79/2.00 ** KEPT (pick-wt=7): 23 [] -ilf_type(A,set_type)|ilf_type(power_set(A),set_type).
% 1.79/2.00 ** KEPT (pick-wt=15): 24 [] -ilf_type(A,set_type)|empty(B)| -ilf_type(B,set_type)| -ilf_type(A,member_type(B))|member(A,B).
% 1.79/2.00 ** KEPT (pick-wt=15): 25 [] -ilf_type(A,set_type)|empty(B)| -ilf_type(B,set_type)|ilf_type(A,member_type(B))| -member(A,B).
% 1.79/2.00 ** KEPT (pick-wt=10): 26 [] empty(A)| -ilf_type(A,set_type)|ilf_type($f6(A),member_type(A)).
% 1.79/2.00 ** KEPT (pick-wt=16): 27 [] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ilf_type($f8(A,B),set_type).
% 1.79/2.00 ** KEPT (pick-wt=16): 28 [] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ilf_type($f7(A,B),set_type).
% 1.79/2.00 ** KEPT (pick-wt=20): 30 [copy,29,flip.5] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ordered_pair($f8(A,B),$f7(A,B))=B.
% 1.79/2.00 ** KEPT (pick-wt=9): 31 [] -ilf_type(A,set_type)|relation_like(A)|ilf_type($f9(A),set_type).
% 1.79/2.00 ** KEPT (pick-wt=9): 32 [] -ilf_type(A,set_type)|relation_like(A)|member($f9(A),A).
% 1.79/2.00 ** KEPT (pick-wt=17): 33 [] -ilf_type(A,set_type)|relation_like(A)| -ilf_type(B,set_type)| -ilf_type(C,set_type)|$f9(A)!=ordered_pair(B,C).
% 1.79/2.00 ** KEPT (pick-wt=7): 34 [] -empty(A)| -ilf_type(A,set_type)|relation_like(A).
% 1.79/2.00 ** KEPT (pick-wt=14): 35 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,subset_type(cross_product(A,B)))|relation_like(C).
% 1.79/2.00 ** KEPT (pick-wt=11): 36 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(ordered_pair(A,B),set_type).
% 1.79/2.00 ** KEPT (pick-wt=5): 37 [] -ilf_type(empty_set,relation_type($c2,$c1)).
% 1.79/2.00
% 1.79/2.00 ------------> process sos:
% 1.79/2.00 ** KEPT (pick-wt=3): 65 [] A=A.
% 1.79/2.00 ** KEPT (pick-wt=2): 66 [] empty(empty_set).
% 1.79/2.00 ** KEPT (pick-wt=3): 67 [] type(empty_set,set_type).
% 1.79/2.00 ** KEPT (pick-wt=3): 68 [] ilf_type(A,set_type).
% 1.79/2.00 Following clause subsumed by 68 during input processing: 0 [] ilf_type($c2,set_type).
% 1.79/2.00 Following clause subsumed by 68 during input processing: 0 [] ilf_type($c1,set_type).
% 1.79/2.00 Following clause subsumed by 65 during input processing: 0 [copy,65,flip.1] A=A.
% 1.79/2.00 68 back subsumes 63.
% 1.79/2.00 68 back subsumes 57.
% 1.79/2.00 68 back subsumes 56.
% 1.79/2.00 68 back subsumes 51.
% 1.79/2.00 68 back subsumes 42.
% 1.79/2.00 68 back subsumes 36.
% 1.79/2.00 68 back subsumes 31.
% 1.79/2.00 68 back subsumes 28.
% 1.79/2.00 68 back subsumes 27.
% 1.79/2.00 68 back subsumes 23.
% 1.79/2.00 68 back subsumes 19.
% 1.79/2.00 68 back subsumes 16.
% 1.79/2.00 68 back subsumes 11.
% 1.79/2.00 68 back subsumes 6.
% 1.79/2.00
% 1.79/2.00 ======= end of input processing =======
% 1.79/2.00
% 1.79/2.00 =========== start of search ===========
% 1.79/2.00
% 1.79/2.00 -------- PROOF --------
% 1.79/2.00
% 1.79/2.00 ----> UNIT CONFLICT at 0.01 sec ----> 203 [binary,202.1,37.1] $F.
% 1.79/2.00
% 1.79/2.00 Length of proof is 6. Level of proof is 6.
% 1.79/2.00
% 1.79/2.00 ---------------- PROOF ----------------
% 1.79/2.00 % SZS status Theorem
% 1.79/2.00 % SZS output start Refutation
% See solution above
% 1.79/2.00 ------------ end of proof -------------
% 1.79/2.00
% 1.79/2.00
% 1.79/2.00 Search stopped by max_proofs option.
% 1.79/2.00
% 1.79/2.00
% 1.79/2.00 Search stopped by max_proofs option.
% 1.79/2.00
% 1.79/2.00 ============ end of search ============
% 1.79/2.00
% 1.79/2.00 -------------- statistics -------------
% 1.79/2.00 clauses given 38
% 1.79/2.00 clauses generated 354
% 1.79/2.00 clauses kept 201
% 1.79/2.00 clauses forward subsumed 190
% 1.79/2.00 clauses back subsumed 77
% 1.79/2.00 Kbytes malloced 1953
% 1.79/2.00
% 1.79/2.00 ----------- times (seconds) -----------
% 1.79/2.00 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.79/2.00 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.79/2.00 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.79/2.00
% 1.79/2.00 That finishes the proof of the theorem.
% 1.79/2.00
% 1.79/2.00 Process 23655 finished Wed Jul 27 10:42:05 2022
% 1.79/2.00 Otter interrupted
% 1.79/2.00 PROOF FOUND
%------------------------------------------------------------------------------