TSTP Solution File: SEU227+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU227+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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:15:15 EDT 2022
% Result : Unknown 4.21s 4.40s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU227+3 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n023.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 08:15:48 EDT 2022
% 0.11/0.33 % CPUTime :
% 2.11/2.31 ----- Otter 3.3f, August 2004 -----
% 2.11/2.31 The process was started by sandbox2 on n023.cluster.edu,
% 2.11/2.31 Wed Jul 27 08:15:48 2022
% 2.11/2.31 The command was "./otter". The process ID is 14489.
% 2.11/2.31
% 2.11/2.31 set(prolog_style_variables).
% 2.11/2.31 set(auto).
% 2.11/2.31 dependent: set(auto1).
% 2.11/2.31 dependent: set(process_input).
% 2.11/2.31 dependent: clear(print_kept).
% 2.11/2.31 dependent: clear(print_new_demod).
% 2.11/2.31 dependent: clear(print_back_demod).
% 2.11/2.31 dependent: clear(print_back_sub).
% 2.11/2.31 dependent: set(control_memory).
% 2.11/2.31 dependent: assign(max_mem, 12000).
% 2.11/2.31 dependent: assign(pick_given_ratio, 4).
% 2.11/2.31 dependent: assign(stats_level, 1).
% 2.11/2.31 dependent: assign(max_seconds, 10800).
% 2.11/2.31 clear(print_given).
% 2.11/2.31
% 2.11/2.31 formula_list(usable).
% 2.11/2.31 all A (A=A).
% 2.11/2.31 all A B (in(A,B)-> -in(B,A)).
% 2.11/2.31 all A (empty(A)->function(A)).
% 2.11/2.31 all A (empty(A)->relation(A)).
% 2.11/2.31 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.11/2.31 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.11/2.31 all A (relation(A)-> (all B C (C=relation_image(A,B)<-> (all D (in(D,C)<-> (exists E (in(ordered_pair(E,D),A)&in(E,B)))))))).
% 2.11/2.31 all A (relation(A)-> (all B C (C=relation_inverse_image(A,B)<-> (all D (in(D,C)<-> (exists E (in(ordered_pair(D,E),A)&in(E,B)))))))).
% 2.11/2.31 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 2.11/2.31 all A (relation(A)-> (all B (B=relation_dom(A)<-> (all C (in(C,B)<-> (exists D in(ordered_pair(C,D),A))))))).
% 2.11/2.31 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 2.11/2.31 all A exists B element(B,A).
% 2.11/2.31 empty(empty_set).
% 2.11/2.31 relation(empty_set).
% 2.11/2.31 relation_empty_yielding(empty_set).
% 2.11/2.31 all A (-empty(powerset(A))).
% 2.11/2.31 empty(empty_set).
% 2.11/2.31 all A B (-empty(ordered_pair(A,B))).
% 2.11/2.31 all A (-empty(singleton(A))).
% 2.11/2.31 all A B (-empty(unordered_pair(A,B))).
% 2.11/2.31 empty(empty_set).
% 2.11/2.31 relation(empty_set).
% 2.11/2.31 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 2.11/2.31 all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 2.11/2.31 exists A (relation(A)&function(A)).
% 2.11/2.31 exists A (empty(A)&relation(A)).
% 2.11/2.31 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.11/2.31 exists A empty(A).
% 2.11/2.31 exists A (relation(A)&empty(A)&function(A)).
% 2.11/2.31 exists A (-empty(A)&relation(A)).
% 2.11/2.31 all A exists B (element(B,powerset(A))&empty(B)).
% 2.11/2.31 exists A (-empty(A)).
% 2.11/2.31 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.11/2.31 exists A (relation(A)&relation_empty_yielding(A)).
% 2.11/2.31 all A B subset(A,A).
% 2.11/2.31 -(all A B (relation(B)-> (subset(A,relation_dom(B))->subset(A,relation_inverse_image(B,relation_image(B,A)))))).
% 2.11/2.31 all A B (in(A,B)->element(A,B)).
% 2.11/2.31 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.11/2.31 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.11/2.31 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.11/2.31 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.11/2.31 all A (empty(A)->A=empty_set).
% 2.11/2.31 all A B (-(in(A,B)&empty(B))).
% 2.11/2.31 all A B (-(empty(A)&A!=B&empty(B))).
% 2.11/2.31 end_of_list.
% 2.11/2.31
% 2.11/2.31 -------> usable clausifies to:
% 2.11/2.31
% 2.11/2.31 list(usable).
% 2.11/2.31 0 [] A=A.
% 2.11/2.31 0 [] -in(A,B)| -in(B,A).
% 2.11/2.31 0 [] -empty(A)|function(A).
% 2.11/2.31 0 [] -empty(A)|relation(A).
% 2.11/2.31 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.11/2.31 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.11/2.31 0 [] -relation(A)|C!=relation_image(A,B)| -in(D,C)|in(ordered_pair($f1(A,B,C,D),D),A).
% 2.11/2.31 0 [] -relation(A)|C!=relation_image(A,B)| -in(D,C)|in($f1(A,B,C,D),B).
% 2.11/2.31 0 [] -relation(A)|C!=relation_image(A,B)|in(D,C)| -in(ordered_pair(E,D),A)| -in(E,B).
% 2.11/2.31 0 [] -relation(A)|C=relation_image(A,B)|in($f3(A,B,C),C)|in(ordered_pair($f2(A,B,C),$f3(A,B,C)),A).
% 2.11/2.31 0 [] -relation(A)|C=relation_image(A,B)|in($f3(A,B,C),C)|in($f2(A,B,C),B).
% 2.11/2.31 0 [] -relation(A)|C=relation_image(A,B)| -in($f3(A,B,C),C)| -in(ordered_pair(X1,$f3(A,B,C)),A)| -in(X1,B).
% 2.11/2.31 0 [] -relation(A)|C!=relation_inverse_image(A,B)| -in(D,C)|in(ordered_pair(D,$f4(A,B,C,D)),A).
% 2.11/2.31 0 [] -relation(A)|C!=relation_inverse_image(A,B)| -in(D,C)|in($f4(A,B,C,D),B).
% 2.11/2.31 0 [] -relation(A)|C!=relation_inverse_image(A,B)|in(D,C)| -in(ordered_pair(D,E),A)| -in(E,B).
% 2.11/2.31 0 [] -relation(A)|C=relation_inverse_image(A,B)|in($f6(A,B,C),C)|in(ordered_pair($f6(A,B,C),$f5(A,B,C)),A).
% 2.11/2.31 0 [] -relation(A)|C=relation_inverse_image(A,B)|in($f6(A,B,C),C)|in($f5(A,B,C),B).
% 2.11/2.31 0 [] -relation(A)|C=relation_inverse_image(A,B)| -in($f6(A,B,C),C)| -in(ordered_pair($f6(A,B,C),X2),A)| -in(X2,B).
% 2.11/2.31 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.11/2.31 0 [] subset(A,B)|in($f7(A,B),A).
% 2.11/2.31 0 [] subset(A,B)| -in($f7(A,B),B).
% 2.11/2.31 0 [] -relation(A)|B!=relation_dom(A)| -in(C,B)|in(ordered_pair(C,$f8(A,B,C)),A).
% 2.11/2.31 0 [] -relation(A)|B!=relation_dom(A)|in(C,B)| -in(ordered_pair(C,D),A).
% 2.11/2.31 0 [] -relation(A)|B=relation_dom(A)|in($f10(A,B),B)|in(ordered_pair($f10(A,B),$f9(A,B)),A).
% 2.11/2.31 0 [] -relation(A)|B=relation_dom(A)| -in($f10(A,B),B)| -in(ordered_pair($f10(A,B),X3),A).
% 2.11/2.31 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.11/2.31 0 [] element($f11(A),A).
% 2.11/2.31 0 [] empty(empty_set).
% 2.11/2.31 0 [] relation(empty_set).
% 2.11/2.31 0 [] relation_empty_yielding(empty_set).
% 2.11/2.31 0 [] -empty(powerset(A)).
% 2.11/2.31 0 [] empty(empty_set).
% 2.11/2.31 0 [] -empty(ordered_pair(A,B)).
% 2.11/2.31 0 [] -empty(singleton(A)).
% 2.11/2.31 0 [] -empty(unordered_pair(A,B)).
% 2.11/2.31 0 [] empty(empty_set).
% 2.11/2.31 0 [] relation(empty_set).
% 2.11/2.31 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.11/2.31 0 [] -empty(A)|empty(relation_dom(A)).
% 2.11/2.31 0 [] -empty(A)|relation(relation_dom(A)).
% 2.11/2.31 0 [] relation($c1).
% 2.11/2.31 0 [] function($c1).
% 2.11/2.31 0 [] empty($c2).
% 2.11/2.31 0 [] relation($c2).
% 2.11/2.31 0 [] empty(A)|element($f12(A),powerset(A)).
% 2.11/2.31 0 [] empty(A)| -empty($f12(A)).
% 2.11/2.31 0 [] empty($c3).
% 2.11/2.31 0 [] relation($c4).
% 2.11/2.31 0 [] empty($c4).
% 2.11/2.31 0 [] function($c4).
% 2.11/2.31 0 [] -empty($c5).
% 2.11/2.31 0 [] relation($c5).
% 2.11/2.31 0 [] element($f13(A),powerset(A)).
% 2.11/2.31 0 [] empty($f13(A)).
% 2.11/2.31 0 [] -empty($c6).
% 2.11/2.31 0 [] relation($c7).
% 2.11/2.31 0 [] function($c7).
% 2.11/2.31 0 [] one_to_one($c7).
% 2.11/2.31 0 [] relation($c8).
% 2.11/2.31 0 [] relation_empty_yielding($c8).
% 2.11/2.31 0 [] subset(A,A).
% 2.11/2.31 0 [] relation($c9).
% 2.11/2.31 0 [] subset($c10,relation_dom($c9)).
% 2.11/2.31 0 [] -subset($c10,relation_inverse_image($c9,relation_image($c9,$c10))).
% 2.11/2.31 0 [] -in(A,B)|element(A,B).
% 2.11/2.31 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.11/2.31 0 [] -element(A,powerset(B))|subset(A,B).
% 2.11/2.31 0 [] element(A,powerset(B))| -subset(A,B).
% 2.11/2.31 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.11/2.31 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.11/2.31 0 [] -empty(A)|A=empty_set.
% 2.11/2.31 0 [] -in(A,B)| -empty(B).
% 2.11/2.31 0 [] -empty(A)|A=B| -empty(B).
% 2.11/2.31 end_of_list.
% 2.11/2.31
% 2.11/2.31 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 2.11/2.31
% 2.11/2.31 This ia a non-Horn set with equality. The strategy will be
% 2.11/2.31 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.11/2.31 deletion, with positive clauses in sos and nonpositive
% 2.11/2.31 clauses in usable.
% 2.11/2.31
% 2.11/2.31 dependent: set(knuth_bendix).
% 2.11/2.31 dependent: set(anl_eq).
% 2.11/2.31 dependent: set(para_from).
% 2.11/2.31 dependent: set(para_into).
% 2.11/2.31 dependent: clear(para_from_right).
% 2.11/2.31 dependent: clear(para_into_right).
% 2.11/2.31 dependent: set(para_from_vars).
% 2.11/2.31 dependent: set(eq_units_both_ways).
% 2.11/2.31 dependent: set(dynamic_demod_all).
% 2.11/2.31 dependent: set(dynamic_demod).
% 2.11/2.31 dependent: set(order_eq).
% 2.11/2.31 dependent: set(back_demod).
% 2.11/2.31 dependent: set(lrpo).
% 2.11/2.31 dependent: set(hyper_res).
% 2.11/2.31 dependent: set(unit_deletion).
% 2.11/2.31 dependent: set(factor).
% 2.11/2.31
% 2.11/2.31 ------------> process usable:
% 2.11/2.31 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.11/2.31 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 2.11/2.31 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 2.11/2.31 ** KEPT (pick-wt=8): 4 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.11/2.31 ** KEPT (pick-wt=19): 5 [] -relation(A)|B!=relation_image(A,C)| -in(D,B)|in(ordered_pair($f1(A,C,B,D),D),A).
% 2.11/2.31 ** KEPT (pick-wt=17): 6 [] -relation(A)|B!=relation_image(A,C)| -in(D,B)|in($f1(A,C,B,D),C).
% 2.11/2.31 ** KEPT (pick-wt=18): 7 [] -relation(A)|B!=relation_image(A,C)|in(D,B)| -in(ordered_pair(E,D),A)| -in(E,C).
% 2.11/2.31 ** KEPT (pick-wt=24): 8 [] -relation(A)|B=relation_image(A,C)|in($f3(A,C,B),B)|in(ordered_pair($f2(A,C,B),$f3(A,C,B)),A).
% 2.11/2.31 ** KEPT (pick-wt=19): 9 [] -relation(A)|B=relation_image(A,C)|in($f3(A,C,B),B)|in($f2(A,C,B),C).
% 2.11/2.31 ** KEPT (pick-wt=24): 10 [] -relation(A)|B=relation_image(A,C)| -in($f3(A,C,B),B)| -in(ordered_pair(D,$f3(A,C,B)),A)| -in(D,C).
% 2.11/2.31 ** KEPT (pick-wt=19): 11 [] -relation(A)|B!=relation_inverse_image(A,C)| -in(D,B)|in(ordered_pair(D,$f4(A,C,B,D)),A).
% 2.11/2.31 ** KEPT (pick-wt=17): 12 [] -relation(A)|B!=relation_inverse_image(A,C)| -in(D,B)|in($f4(A,C,B,D),C).
% 2.11/2.31 ** KEPT (pick-wt=18): 13 [] -relation(A)|B!=relation_inverse_image(A,C)|in(D,B)| -in(ordered_pair(D,E),A)| -in(E,C).
% 2.11/2.31 ** KEPT (pick-wt=24): 14 [] -relation(A)|B=relation_inverse_image(A,C)|in($f6(A,C,B),B)|in(ordered_pair($f6(A,C,B),$f5(A,C,B)),A).
% 2.11/2.31 ** KEPT (pick-wt=19): 15 [] -relation(A)|B=relation_inverse_image(A,C)|in($f6(A,C,B),B)|in($f5(A,C,B),C).
% 4.21/4.40 ** KEPT (pick-wt=24): 16 [] -relation(A)|B=relation_inverse_image(A,C)| -in($f6(A,C,B),B)| -in(ordered_pair($f6(A,C,B),D),A)| -in(D,C).
% 4.21/4.40 ** KEPT (pick-wt=9): 17 [] -subset(A,B)| -in(C,A)|in(C,B).
% 4.21/4.40 ** KEPT (pick-wt=8): 18 [] subset(A,B)| -in($f7(A,B),B).
% 4.21/4.40 ** KEPT (pick-wt=17): 19 [] -relation(A)|B!=relation_dom(A)| -in(C,B)|in(ordered_pair(C,$f8(A,B,C)),A).
% 4.21/4.40 ** KEPT (pick-wt=14): 20 [] -relation(A)|B!=relation_dom(A)|in(C,B)| -in(ordered_pair(C,D),A).
% 4.21/4.40 ** KEPT (pick-wt=20): 21 [] -relation(A)|B=relation_dom(A)|in($f10(A,B),B)|in(ordered_pair($f10(A,B),$f9(A,B)),A).
% 4.21/4.40 ** KEPT (pick-wt=18): 22 [] -relation(A)|B=relation_dom(A)| -in($f10(A,B),B)| -in(ordered_pair($f10(A,B),C),A).
% 4.21/4.40 ** KEPT (pick-wt=3): 23 [] -empty(powerset(A)).
% 4.21/4.40 ** KEPT (pick-wt=4): 24 [] -empty(ordered_pair(A,B)).
% 4.21/4.40 ** KEPT (pick-wt=3): 25 [] -empty(singleton(A)).
% 4.21/4.40 ** KEPT (pick-wt=4): 26 [] -empty(unordered_pair(A,B)).
% 4.21/4.40 ** KEPT (pick-wt=7): 27 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 4.21/4.40 ** KEPT (pick-wt=5): 28 [] -empty(A)|empty(relation_dom(A)).
% 4.21/4.40 ** KEPT (pick-wt=5): 29 [] -empty(A)|relation(relation_dom(A)).
% 4.21/4.40 ** KEPT (pick-wt=5): 30 [] empty(A)| -empty($f12(A)).
% 4.21/4.40 ** KEPT (pick-wt=2): 31 [] -empty($c5).
% 4.21/4.40 ** KEPT (pick-wt=2): 32 [] -empty($c6).
% 4.21/4.40 ** KEPT (pick-wt=7): 33 [] -subset($c10,relation_inverse_image($c9,relation_image($c9,$c10))).
% 4.21/4.40 ** KEPT (pick-wt=6): 34 [] -in(A,B)|element(A,B).
% 4.21/4.40 ** KEPT (pick-wt=8): 35 [] -element(A,B)|empty(B)|in(A,B).
% 4.21/4.40 ** KEPT (pick-wt=7): 36 [] -element(A,powerset(B))|subset(A,B).
% 4.21/4.40 ** KEPT (pick-wt=7): 37 [] element(A,powerset(B))| -subset(A,B).
% 4.21/4.40 ** KEPT (pick-wt=10): 38 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 4.21/4.40 ** KEPT (pick-wt=9): 39 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 4.21/4.40 ** KEPT (pick-wt=5): 40 [] -empty(A)|A=empty_set.
% 4.21/4.40 ** KEPT (pick-wt=5): 41 [] -in(A,B)| -empty(B).
% 4.21/4.40 ** KEPT (pick-wt=7): 42 [] -empty(A)|A=B| -empty(B).
% 4.21/4.40
% 4.21/4.40 ------------> process sos:
% 4.21/4.40 ** KEPT (pick-wt=3): 47 [] A=A.
% 4.21/4.40 ** KEPT (pick-wt=7): 48 [] unordered_pair(A,B)=unordered_pair(B,A).
% 4.21/4.40 ** KEPT (pick-wt=8): 49 [] subset(A,B)|in($f7(A,B),A).
% 4.21/4.40 ** KEPT (pick-wt=10): 51 [copy,50,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 4.21/4.40 ---> New Demodulator: 52 [new_demod,51] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 4.21/4.40 ** KEPT (pick-wt=4): 53 [] element($f11(A),A).
% 4.21/4.40 ** KEPT (pick-wt=2): 54 [] empty(empty_set).
% 4.21/4.40 ** KEPT (pick-wt=2): 55 [] relation(empty_set).
% 4.21/4.40 ** KEPT (pick-wt=2): 56 [] relation_empty_yielding(empty_set).
% 4.21/4.40 Following clause subsumed by 54 during input processing: 0 [] empty(empty_set).
% 4.21/4.40 Following clause subsumed by 54 during input processing: 0 [] empty(empty_set).
% 4.21/4.40 Following clause subsumed by 55 during input processing: 0 [] relation(empty_set).
% 4.21/4.40 ** KEPT (pick-wt=2): 57 [] relation($c1).
% 4.21/4.40 ** KEPT (pick-wt=2): 58 [] function($c1).
% 4.21/4.40 ** KEPT (pick-wt=2): 59 [] empty($c2).
% 4.21/4.40 ** KEPT (pick-wt=2): 60 [] relation($c2).
% 4.21/4.40 ** KEPT (pick-wt=7): 61 [] empty(A)|element($f12(A),powerset(A)).
% 4.21/4.40 ** KEPT (pick-wt=2): 62 [] empty($c3).
% 4.21/4.40 ** KEPT (pick-wt=2): 63 [] relation($c4).
% 4.21/4.40 ** KEPT (pick-wt=2): 64 [] empty($c4).
% 4.21/4.40 ** KEPT (pick-wt=2): 65 [] function($c4).
% 4.21/4.40 ** KEPT (pick-wt=2): 66 [] relation($c5).
% 4.21/4.40 ** KEPT (pick-wt=5): 67 [] element($f13(A),powerset(A)).
% 4.21/4.40 ** KEPT (pick-wt=3): 68 [] empty($f13(A)).
% 4.21/4.40 ** KEPT (pick-wt=2): 69 [] relation($c7).
% 4.21/4.40 ** KEPT (pick-wt=2): 70 [] function($c7).
% 4.21/4.40 ** KEPT (pick-wt=2): 71 [] one_to_one($c7).
% 4.21/4.40 ** KEPT (pick-wt=2): 72 [] relation($c8).
% 4.21/4.40 ** KEPT (pick-wt=2): 73 [] relation_empty_yielding($c8).
% 4.21/4.40 ** KEPT (pick-wt=3): 74 [] subset(A,A).
% 4.21/4.40 ** KEPT (pick-wt=2): 75 [] relation($c9).
% 4.21/4.40 ** KEPT (pick-wt=4): 76 [] subset($c10,relation_dom($c9)).
% 4.21/4.40 Following clause subsumed by 47 during input processing: 0 [copy,47,flip.1] A=A.
% 4.21/4.40 47 back subsumes 46.
% 4.21/4.40 Following clause subsumed by 48 during input processing: 0 [copy,48,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 4.21/4.40 >>>> Starting back demodulation with 52.
% 4.21/4.40
% 4.21/4.40 ======= end of input processing =======
% 4.21/4.40
% 4.21/4.40 =========== start of search ===========
% 4.21/4.40
% 4.21/4.40
% 4.21/4.40 Resetting weight limit to 6.
% 4.21/4.40
% 4.21/4.40
% 4.21/4.40 Resetting weight limit to 6.
% 4.21/4.40
% 4.21/4.40 sos_size=287
% 4.21/4.40
% 4.21/4.40 Search stopped because sos empty.
% 4.21/4.40
% 4.21/4.40
% 4.21/4.40 Search stopped because sos empty.
% 4.21/4.40
% 4.21/4.40 ============ end of search ============
% 4.21/4.40
% 4.21/4.40 -------------- statistics -------------
% 4.21/4.40 clauses given 369
% 4.21/4.40 clauses generated 119192
% 4.21/4.40 clauses kept 476
% 4.21/4.40 clauses forward subsumed 417
% 4.21/4.40 clauses back subsumed 6
% 4.21/4.40 Kbytes malloced 7812
% 4.21/4.40
% 4.21/4.40 ----------- times (seconds) -----------
% 4.21/4.40 user CPU time 2.09 (0 hr, 0 min, 2 sec)
% 4.21/4.40 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 4.21/4.40 wall-clock time 4 (0 hr, 0 min, 4 sec)
% 4.21/4.40
% 4.21/4.40 Process 14489 finished Wed Jul 27 08:15:52 2022
% 4.21/4.40 Otter interrupted
% 4.21/4.40 PROOF NOT FOUND
%------------------------------------------------------------------------------