TSTP Solution File: SET641+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET641+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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:13:58 EDT 2022
% Result : Unknown 17.61s 17.85s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.11 % Problem : SET641+3 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n013.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:33:00 EDT 2022
% 0.18/0.33 % CPUTime :
% 2.00/2.20 ----- Otter 3.3f, August 2004 -----
% 2.00/2.20 The process was started by sandbox on n013.cluster.edu,
% 2.00/2.20 Wed Jul 27 10:33:00 2022
% 2.00/2.20 The command was "./otter". The process ID is 25790.
% 2.00/2.20
% 2.00/2.20 set(prolog_style_variables).
% 2.00/2.20 set(auto).
% 2.00/2.20 dependent: set(auto1).
% 2.00/2.20 dependent: set(process_input).
% 2.00/2.20 dependent: clear(print_kept).
% 2.00/2.20 dependent: clear(print_new_demod).
% 2.00/2.20 dependent: clear(print_back_demod).
% 2.00/2.20 dependent: clear(print_back_sub).
% 2.00/2.20 dependent: set(control_memory).
% 2.00/2.20 dependent: assign(max_mem, 12000).
% 2.00/2.20 dependent: assign(pick_given_ratio, 4).
% 2.00/2.20 dependent: assign(stats_level, 1).
% 2.00/2.20 dependent: assign(max_seconds, 10800).
% 2.00/2.20 clear(print_given).
% 2.00/2.20
% 2.00/2.20 formula_list(usable).
% 2.00/2.20 all A (A=A).
% 2.00/2.20 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)))))))).
% 2.00/2.20 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (exists D ilf_type(D,relation_type(C,B)))))).
% 2.00/2.20 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,set_type)-> (member(D,cross_product(B,C))<-> (exists E (ilf_type(E,set_type)& (exists F (ilf_type(F,set_type)&member(E,B)&member(F,C)&D=ordered_pair(E,F))))))))))).
% 2.00/2.20 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(cross_product(B,C),set_type)))).
% 2.00/2.20 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)))))))).
% 2.00/2.20 all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)->ilf_type(ordered_pair(B,C),set_type)))).
% 2.00/2.20 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))))))).
% 2.00/2.20 all B (ilf_type(B,set_type)-> (exists C ilf_type(C,subset_type(B)))).
% 2.00/2.20 all B (ilf_type(B,set_type)->subset(B,B)).
% 2.00/2.20 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)))))))).
% 2.00/2.20 all B (ilf_type(B,set_type)-> -empty(power_set(B))&ilf_type(power_set(B),set_type)).
% 2.00/2.20 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))))).
% 2.00/2.20 all B (-empty(B)&ilf_type(B,set_type)-> (exists C ilf_type(C,member_type(B)))).
% 2.00/2.20 all B (ilf_type(B,set_type)-> (empty(B)<-> (all C (ilf_type(C,set_type)-> -member(C,B))))).
% 2.00/2.20 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)))))))))).
% 2.00/2.20 all B (empty(B)&ilf_type(B,set_type)->relation_like(B)).
% 2.00/2.20 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)))))).
% 2.00/2.20 all B ilf_type(B,set_type).
% 2.00/2.20 -(all B (ilf_type(B,set_type)-> (all C (ilf_type(C,set_type)-> (all D (ilf_type(D,set_type)-> (subset(B,cross_product(C,D))->ilf_type(B,relation_type(C,D))))))))).
% 2.00/2.20 end_of_list.
% 2.00/2.20
% 2.00/2.20 -------> usable clausifies to:
% 2.00/2.20
% 2.00/2.20 list(usable).
% 2.00/2.20 0 [] A=A.
% 2.00/2.20 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)).
% 2.00/2.20 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))).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type($f1(B,C),relation_type(C,B)).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -member(D,cross_product(B,C))|ilf_type($f3(B,C,D),set_type).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -member(D,cross_product(B,C))|ilf_type($f2(B,C,D),set_type).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -member(D,cross_product(B,C))|member($f3(B,C,D),B).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -member(D,cross_product(B,C))|member($f2(B,C,D),C).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)| -member(D,cross_product(B,C))|D=ordered_pair($f3(B,C,D),$f2(B,C,D)).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,set_type)|member(D,cross_product(B,C))| -ilf_type(E,set_type)| -ilf_type(F,set_type)| -member(E,B)| -member(F,C)|D!=ordered_pair(E,F).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(cross_product(B,C),set_type).
% 2.00/2.20 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).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|subset(B,C)|ilf_type($f4(B,C),set_type).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|subset(B,C)|member($f4(B,C),B).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|subset(B,C)| -member($f4(B,C),C).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|ilf_type(ordered_pair(B,C),set_type).
% 2.00/2.20 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))).
% 2.00/2.20 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))).
% 2.00/2.20 0 [] -ilf_type(B,set_type)|ilf_type($f5(B),subset_type(B)).
% 2.00/2.20 0 [] -ilf_type(B,set_type)|subset(B,B).
% 2.00/2.20 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).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))|ilf_type($f6(B,C),set_type).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))|member($f6(B,C),B).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(B,power_set(C))| -member($f6(B,C),C).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -empty(power_set(B)).
% 2.00/2.20 0 [] -ilf_type(B,set_type)|ilf_type(power_set(B),set_type).
% 2.00/2.20 0 [] -ilf_type(B,set_type)|empty(C)| -ilf_type(C,set_type)| -ilf_type(B,member_type(C))|member(B,C).
% 2.00/2.20 0 [] -ilf_type(B,set_type)|empty(C)| -ilf_type(C,set_type)|ilf_type(B,member_type(C))| -member(B,C).
% 2.00/2.20 0 [] empty(B)| -ilf_type(B,set_type)|ilf_type($f7(B),member_type(B)).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -empty(B)| -ilf_type(C,set_type)| -member(C,B).
% 2.00/2.20 0 [] -ilf_type(B,set_type)|empty(B)|ilf_type($f8(B),set_type).
% 2.00/2.20 0 [] -ilf_type(B,set_type)|empty(B)|member($f8(B),B).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -relation_like(B)| -ilf_type(C,set_type)| -member(C,B)|ilf_type($f10(B,C),set_type).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -relation_like(B)| -ilf_type(C,set_type)| -member(C,B)|ilf_type($f9(B,C),set_type).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -relation_like(B)| -ilf_type(C,set_type)| -member(C,B)|C=ordered_pair($f10(B,C),$f9(B,C)).
% 2.00/2.20 0 [] -ilf_type(B,set_type)|relation_like(B)|ilf_type($f11(B),set_type).
% 2.00/2.20 0 [] -ilf_type(B,set_type)|relation_like(B)|member($f11(B),B).
% 2.00/2.20 0 [] -ilf_type(B,set_type)|relation_like(B)| -ilf_type(D,set_type)| -ilf_type(E,set_type)|$f11(B)!=ordered_pair(D,E).
% 2.00/2.20 0 [] -empty(B)| -ilf_type(B,set_type)|relation_like(B).
% 2.00/2.20 0 [] -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,subset_type(cross_product(B,C)))|relation_like(D).
% 2.00/2.20 0 [] ilf_type(B,set_type).
% 2.00/2.20 0 [] ilf_type($c3,set_type).
% 2.00/2.20 0 [] ilf_type($c2,set_type).
% 2.00/2.20 0 [] ilf_type($c1,set_type).
% 2.00/2.20 0 [] subset($c3,cross_product($c2,$c1)).
% 2.00/2.20 0 [] -ilf_type($c3,relation_type($c2,$c1)).
% 2.00/2.20 end_of_list.
% 2.00/2.20
% 2.00/2.20 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 2.00/2.20
% 2.00/2.20 This ia a non-Horn set with equality. The strategy will be
% 2.00/2.20 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.00/2.20 deletion, with positive clauses in sos and nonpositive
% 2.00/2.20 clauses in usable.
% 2.00/2.20
% 2.00/2.20 dependent: set(knuth_bendix).
% 2.00/2.20 dependent: set(anl_eq).
% 2.00/2.20 dependent: set(para_from).
% 2.00/2.20 dependent: set(para_into).
% 2.00/2.20 dependent: clear(para_from_right).
% 2.00/2.20 dependent: clear(para_into_right).
% 2.00/2.20 dependent: set(para_from_vars).
% 2.00/2.20 dependent: set(eq_units_both_ways).
% 2.00/2.20 dependent: set(dynamic_demod_all).
% 2.00/2.20 dependent: set(dynamic_demod).
% 2.00/2.20 dependent: set(order_eq).
% 2.00/2.20 dependent: set(back_demod).
% 2.00/2.20 dependent: set(lrpo).
% 2.00/2.20 dependent: set(hyper_res).
% 2.00/2.20 dependent: set(unit_deletion).
% 2.00/2.20 dependent: set(factor).
% 2.00/2.20
% 2.00/2.20 ------------> process usable:
% 2.00/2.20 ** KEPT (pick-wt=17): 1 [] -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)).
% 2.00/2.20 ** KEPT (pick-wt=17): 2 [] -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))).
% 2.06/2.24 ** KEPT (pick-wt=13): 3 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type($f1(A,B),relation_type(B,A)).
% 2.06/2.24 ** KEPT (pick-wt=20): 4 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -member(C,cross_product(A,B))|ilf_type($f3(A,B,C),set_type).
% 2.06/2.24 ** KEPT (pick-wt=20): 5 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -member(C,cross_product(A,B))|ilf_type($f2(A,B,C),set_type).
% 2.06/2.24 ** KEPT (pick-wt=20): 6 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -member(C,cross_product(A,B))|member($f3(A,B,C),A).
% 2.06/2.24 ** KEPT (pick-wt=20): 7 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -member(C,cross_product(A,B))|member($f2(A,B,C),B).
% 2.06/2.24 ** KEPT (pick-wt=25): 9 [copy,8,flip.5] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -member(C,cross_product(A,B))|ordered_pair($f3(A,B,C),$f2(A,B,C))=C.
% 2.06/2.24 ** KEPT (pick-wt=31): 10 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(C,cross_product(A,B))| -ilf_type(D,set_type)| -ilf_type(E,set_type)| -member(D,A)| -member(E,B)|C!=ordered_pair(D,E).
% 2.06/2.24 ** KEPT (pick-wt=11): 11 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(cross_product(A,B),set_type).
% 2.06/2.24 ** KEPT (pick-wt=18): 12 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -subset(A,B)| -ilf_type(C,set_type)| -member(C,A)|member(C,B).
% 2.06/2.24 ** KEPT (pick-wt=14): 13 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|subset(A,B)|ilf_type($f4(A,B),set_type).
% 2.06/2.24 ** KEPT (pick-wt=14): 14 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|subset(A,B)|member($f4(A,B),A).
% 2.06/2.24 ** KEPT (pick-wt=14): 15 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|subset(A,B)| -member($f4(A,B),B).
% 2.06/2.24 ** KEPT (pick-wt=11): 16 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(ordered_pair(A,B),set_type).
% 2.06/2.24 ** KEPT (pick-wt=15): 17 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(B,subset_type(A))|ilf_type(B,member_type(power_set(A))).
% 2.06/2.24 ** KEPT (pick-wt=15): 18 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(B,subset_type(A))| -ilf_type(B,member_type(power_set(A))).
% 2.06/2.24 ** KEPT (pick-wt=8): 19 [] -ilf_type(A,set_type)|ilf_type($f5(A),subset_type(A)).
% 2.06/2.24 ** KEPT (pick-wt=6): 20 [] -ilf_type(A,set_type)|subset(A,A).
% 2.06/2.24 ** KEPT (pick-wt=19): 21 [] -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).
% 2.06/2.24 ** KEPT (pick-wt=15): 22 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))|ilf_type($f6(A,B),set_type).
% 2.06/2.24 ** KEPT (pick-wt=15): 23 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))|member($f6(A,B),A).
% 2.06/2.24 ** KEPT (pick-wt=15): 24 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))| -member($f6(A,B),B).
% 2.06/2.24 ** KEPT (pick-wt=6): 25 [] -ilf_type(A,set_type)| -empty(power_set(A)).
% 2.06/2.24 ** KEPT (pick-wt=7): 26 [] -ilf_type(A,set_type)|ilf_type(power_set(A),set_type).
% 2.06/2.24 ** KEPT (pick-wt=15): 27 [] -ilf_type(A,set_type)|empty(B)| -ilf_type(B,set_type)| -ilf_type(A,member_type(B))|member(A,B).
% 2.06/2.24 ** KEPT (pick-wt=15): 28 [] -ilf_type(A,set_type)|empty(B)| -ilf_type(B,set_type)|ilf_type(A,member_type(B))| -member(A,B).
% 2.06/2.24 ** KEPT (pick-wt=10): 29 [] empty(A)| -ilf_type(A,set_type)|ilf_type($f7(A),member_type(A)).
% 2.06/2.24 ** KEPT (pick-wt=11): 30 [] -ilf_type(A,set_type)| -empty(A)| -ilf_type(B,set_type)| -member(B,A).
% 2.06/2.24 ** KEPT (pick-wt=9): 31 [] -ilf_type(A,set_type)|empty(A)|ilf_type($f8(A),set_type).
% 2.06/2.24 ** KEPT (pick-wt=9): 32 [] -ilf_type(A,set_type)|empty(A)|member($f8(A),A).
% 2.06/2.24 ** KEPT (pick-wt=16): 33 [] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ilf_type($f10(A,B),set_type).
% 2.06/2.24 ** KEPT (pick-wt=16): 34 [] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ilf_type($f9(A,B),set_type).
% 2.06/2.24 ** KEPT (pick-wt=20): 36 [copy,35,flip.5] -ilf_type(A,set_type)| -relation_like(A)| -ilf_type(B,set_type)| -member(B,A)|ordered_pair($f10(A,B),$f9(A,B))=B.
% 2.06/2.24 ** KEPT (pick-wt=9): 37 [] -ilf_type(A,set_type)|relation_like(A)|ilf_type($f11(A),set_type).
% 2.06/2.24 ** KEPT (pick-wt=9): 38 [] -ilf_type(A,set_type)|relation_like(A)|member($f11(A),A).
% 17.61/17.85 ** KEPT (pick-wt=17): 39 [] -ilf_type(A,set_type)|relation_like(A)| -ilf_type(B,set_type)| -ilf_type(C,set_type)|$f11(A)!=ordered_pair(B,C).
% 17.61/17.85 ** KEPT (pick-wt=7): 40 [] -empty(A)| -ilf_type(A,set_type)|relation_like(A).
% 17.61/17.85 ** KEPT (pick-wt=14): 41 [] -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,subset_type(cross_product(A,B)))|relation_like(C).
% 17.61/17.85 ** KEPT (pick-wt=5): 42 [] -ilf_type($c3,relation_type($c2,$c1)).
% 17.61/17.85
% 17.61/17.85 ------------> process sos:
% 17.61/17.85 ** KEPT (pick-wt=3): 140 [] A=A.
% 17.61/17.85 ** KEPT (pick-wt=3): 141 [] ilf_type(A,set_type).
% 17.61/17.85 Following clause subsumed by 141 during input processing: 0 [] ilf_type($c3,set_type).
% 17.61/17.85 Following clause subsumed by 141 during input processing: 0 [] ilf_type($c2,set_type).
% 17.61/17.85 Following clause subsumed by 141 during input processing: 0 [] ilf_type($c1,set_type).
% 17.61/17.85 ** KEPT (pick-wt=5): 142 [] subset($c3,cross_product($c2,$c1)).
% 17.61/17.85 Following clause subsumed by 140 during input processing: 0 [copy,140,flip.1] A=A.
% 17.61/17.85 141 back subsumes 95.
% 17.61/17.85 141 back subsumes 94.
% 17.61/17.85 141 back subsumes 88.
% 17.61/17.85 141 back subsumes 87.
% 17.61/17.85 141 back subsumes 81.
% 17.61/17.85 141 back subsumes 75.
% 17.61/17.85 141 back subsumes 72.
% 17.61/17.85 141 back subsumes 51.
% 17.61/17.85 141 back subsumes 50.
% 17.61/17.85 141 back subsumes 49.
% 17.61/17.85 141 back subsumes 48.
% 17.61/17.85 141 back subsumes 47.
% 17.61/17.85 141 back subsumes 46.
% 17.61/17.85 141 back subsumes 37.
% 17.61/17.85 141 back subsumes 34.
% 17.61/17.85 141 back subsumes 33.
% 17.61/17.85 141 back subsumes 31.
% 17.61/17.85 141 back subsumes 26.
% 17.61/17.85 141 back subsumes 22.
% 17.61/17.85 141 back subsumes 16.
% 17.61/17.85 141 back subsumes 13.
% 17.61/17.85 141 back subsumes 11.
% 17.61/17.85 141 back subsumes 5.
% 17.61/17.85 141 back subsumes 4.
% 17.61/17.85
% 17.61/17.85 ======= end of input processing =======
% 17.61/17.85
% 17.61/17.85 =========== start of search ===========
% 17.61/17.85
% 17.61/17.85
% 17.61/17.85 Resetting weight limit to 10.
% 17.61/17.85
% 17.61/17.85
% 17.61/17.85 Resetting weight limit to 10.
% 17.61/17.85
% 17.61/17.85 sos_size=187
% 17.61/17.85
% 17.61/17.85 Search stopped because sos empty.
% 17.61/17.85
% 17.61/17.85
% 17.61/17.85 Search stopped because sos empty.
% 17.61/17.85
% 17.61/17.85 ============ end of search ============
% 17.61/17.85
% 17.61/17.85 -------------- statistics -------------
% 17.61/17.85 clauses given 254
% 17.61/17.85 clauses generated 723716
% 17.61/17.85 clauses kept 690
% 17.61/17.85 clauses forward subsumed 805
% 17.61/17.85 clauses back subsumed 342
% 17.61/17.85 Kbytes malloced 6835
% 17.61/17.85
% 17.61/17.85 ----------- times (seconds) -----------
% 17.61/17.85 user CPU time 15.65 (0 hr, 0 min, 15 sec)
% 17.61/17.85 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 17.61/17.85 wall-clock time 17 (0 hr, 0 min, 17 sec)
% 17.61/17.85
% 17.61/17.85 Process 25790 finished Wed Jul 27 10:33:17 2022
% 17.61/17.85 Otter interrupted
% 17.61/17.85 PROOF NOT FOUND
%------------------------------------------------------------------------------