TSTP Solution File: SEU258+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU258+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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:22 EDT 2022
% Result : Unknown 14.05s 14.26s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU258+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n005.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 07:42:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.85/2.05 ----- Otter 3.3f, August 2004 -----
% 1.85/2.05 The process was started by sandbox on n005.cluster.edu,
% 1.85/2.05 Wed Jul 27 07:42:50 2022
% 1.85/2.05 The command was "./otter". The process ID is 27042.
% 1.85/2.05
% 1.85/2.05 set(prolog_style_variables).
% 1.85/2.05 set(auto).
% 1.85/2.05 dependent: set(auto1).
% 1.85/2.05 dependent: set(process_input).
% 1.85/2.05 dependent: clear(print_kept).
% 1.85/2.05 dependent: clear(print_new_demod).
% 1.85/2.05 dependent: clear(print_back_demod).
% 1.85/2.05 dependent: clear(print_back_sub).
% 1.85/2.05 dependent: set(control_memory).
% 1.85/2.05 dependent: assign(max_mem, 12000).
% 1.85/2.05 dependent: assign(pick_given_ratio, 4).
% 1.85/2.05 dependent: assign(stats_level, 1).
% 1.85/2.05 dependent: assign(max_seconds, 10800).
% 1.85/2.05 clear(print_given).
% 1.85/2.05
% 1.85/2.05 formula_list(usable).
% 1.85/2.05 all A (A=A).
% 1.85/2.05 all A B (in(A,B)-> -in(B,A)).
% 1.85/2.05 all A (empty(A)->function(A)).
% 1.85/2.05 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.85/2.05 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.85/2.05 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.85/2.05 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.85/2.05 all A B (A=B<->subset(A,B)&subset(B,A)).
% 1.85/2.05 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.85/2.05 all A (relation(A)-> (well_ordering(A)<->reflexive(A)&transitive(A)&antisymmetric(A)&connected(A)&well_founded_relation(A))).
% 1.85/2.05 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.85/2.05 all A (relation(A)->relation_field(A)=set_union2(relation_dom(A),relation_rng(A))).
% 1.85/2.05 all A (relation(A)-> (all B (relation_restriction(A,B)=set_intersection2(A,cartesian_product2(B,B))))).
% 1.85/2.05 $T.
% 1.85/2.05 $T.
% 1.85/2.05 $T.
% 1.85/2.05 $T.
% 1.85/2.05 $T.
% 1.85/2.05 $T.
% 1.85/2.05 all A B (relation(A)->relation(relation_restriction(A,B))).
% 1.85/2.05 $T.
% 1.85/2.05 $T.
% 1.85/2.05 $T.
% 1.85/2.05 $T.
% 1.85/2.05 $T.
% 1.85/2.05 $T.
% 1.85/2.05 all A exists B element(B,A).
% 1.85/2.05 empty(empty_set).
% 1.85/2.05 all A B (-empty(ordered_pair(A,B))).
% 1.85/2.05 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 1.85/2.05 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 1.85/2.05 all A B (set_union2(A,A)=A).
% 1.85/2.05 all A B (set_intersection2(A,A)=A).
% 1.85/2.05 all A (relation(A)-> (reflexive(A)<-> (all B (in(B,relation_field(A))->in(ordered_pair(B,B),A))))).
% 1.85/2.05 exists A (relation(A)&function(A)).
% 1.85/2.05 exists A empty(A).
% 1.85/2.05 exists A (relation(A)&empty(A)&function(A)).
% 1.85/2.05 exists A (-empty(A)).
% 1.85/2.05 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.85/2.05 all A B subset(A,A).
% 1.85/2.05 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 1.85/2.05 all A B C (relation(C)-> (in(A,relation_restriction(C,B))<->in(A,C)&in(A,cartesian_product2(B,B)))).
% 1.85/2.05 all A (set_union2(A,empty_set)=A).
% 1.85/2.05 all A B (in(A,B)->element(A,B)).
% 1.85/2.05 all A B (relation(B)->subset(relation_field(relation_restriction(B,A)),relation_field(B))&subset(relation_field(relation_restriction(B,A)),A)).
% 1.85/2.05 all A (set_intersection2(A,empty_set)=empty_set).
% 1.85/2.05 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.85/2.05 all A B C (relation(C)-> (in(ordered_pair(A,B),C)->in(A,relation_field(C))&in(B,relation_field(C)))).
% 1.85/2.05 -(all A B (relation(B)-> (well_ordering(B)&subset(A,relation_field(B))->relation_field(relation_restriction(B,A))=A))).
% 1.85/2.05 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.85/2.05 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.85/2.05 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.85/2.05 all A (empty(A)->A=empty_set).
% 1.85/2.05 all A B (-(in(A,B)&empty(B))).
% 1.85/2.05 all A B (-(empty(A)&A!=B&empty(B))).
% 1.85/2.05 end_of_list.
% 1.85/2.05
% 1.85/2.05 -------> usable clausifies to:
% 1.85/2.05
% 1.85/2.05 list(usable).
% 1.85/2.05 0 [] A=A.
% 1.85/2.05 0 [] -in(A,B)| -in(B,A).
% 1.85/2.05 0 [] -empty(A)|function(A).
% 1.85/2.05 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.85/2.05 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.85/2.05 0 [] set_union2(A,B)=set_union2(B,A).
% 1.85/2.05 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.85/2.05 0 [] A!=B|subset(A,B).
% 1.85/2.05 0 [] A!=B|subset(B,A).
% 1.85/2.05 0 [] A=B| -subset(A,B)| -subset(B,A).
% 1.85/2.05 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.85/2.05 0 [] subset(A,B)|in($f1(A,B),A).
% 1.85/2.05 0 [] subset(A,B)| -in($f1(A,B),B).
% 1.85/2.05 0 [] -relation(A)| -well_ordering(A)|reflexive(A).
% 1.85/2.05 0 [] -relation(A)| -well_ordering(A)|transitive(A).
% 1.85/2.05 0 [] -relation(A)| -well_ordering(A)|antisymmetric(A).
% 1.85/2.05 0 [] -relation(A)| -well_ordering(A)|connected(A).
% 1.85/2.05 0 [] -relation(A)| -well_ordering(A)|well_founded_relation(A).
% 1.85/2.05 0 [] -relation(A)|well_ordering(A)| -reflexive(A)| -transitive(A)| -antisymmetric(A)| -connected(A)| -well_founded_relation(A).
% 1.85/2.05 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.85/2.05 0 [] -relation(A)|relation_field(A)=set_union2(relation_dom(A),relation_rng(A)).
% 1.85/2.05 0 [] -relation(A)|relation_restriction(A,B)=set_intersection2(A,cartesian_product2(B,B)).
% 1.85/2.05 0 [] $T.
% 1.85/2.05 0 [] $T.
% 1.85/2.05 0 [] $T.
% 1.85/2.05 0 [] $T.
% 1.85/2.05 0 [] $T.
% 1.85/2.05 0 [] $T.
% 1.85/2.05 0 [] -relation(A)|relation(relation_restriction(A,B)).
% 1.85/2.05 0 [] $T.
% 1.85/2.05 0 [] $T.
% 1.85/2.05 0 [] $T.
% 1.85/2.05 0 [] $T.
% 1.85/2.05 0 [] $T.
% 1.85/2.05 0 [] $T.
% 1.85/2.05 0 [] element($f2(A),A).
% 1.85/2.05 0 [] empty(empty_set).
% 1.85/2.05 0 [] -empty(ordered_pair(A,B)).
% 1.85/2.05 0 [] empty(A)| -empty(set_union2(A,B)).
% 1.85/2.05 0 [] empty(A)| -empty(set_union2(B,A)).
% 1.85/2.05 0 [] set_union2(A,A)=A.
% 1.85/2.05 0 [] set_intersection2(A,A)=A.
% 1.85/2.05 0 [] -relation(A)| -reflexive(A)| -in(B,relation_field(A))|in(ordered_pair(B,B),A).
% 1.85/2.05 0 [] -relation(A)|reflexive(A)|in($f3(A),relation_field(A)).
% 1.85/2.05 0 [] -relation(A)|reflexive(A)| -in(ordered_pair($f3(A),$f3(A)),A).
% 1.85/2.05 0 [] relation($c1).
% 1.85/2.05 0 [] function($c1).
% 1.85/2.05 0 [] empty($c2).
% 1.85/2.05 0 [] relation($c3).
% 1.85/2.05 0 [] empty($c3).
% 1.85/2.05 0 [] function($c3).
% 1.85/2.05 0 [] -empty($c4).
% 1.85/2.05 0 [] relation($c5).
% 1.85/2.05 0 [] function($c5).
% 1.85/2.05 0 [] one_to_one($c5).
% 1.85/2.05 0 [] subset(A,A).
% 1.85/2.05 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 1.85/2.05 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 1.85/2.05 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 1.85/2.05 0 [] -relation(C)| -in(A,relation_restriction(C,B))|in(A,C).
% 1.85/2.05 0 [] -relation(C)| -in(A,relation_restriction(C,B))|in(A,cartesian_product2(B,B)).
% 1.85/2.05 0 [] -relation(C)|in(A,relation_restriction(C,B))| -in(A,C)| -in(A,cartesian_product2(B,B)).
% 1.85/2.05 0 [] set_union2(A,empty_set)=A.
% 1.85/2.05 0 [] -in(A,B)|element(A,B).
% 1.85/2.05 0 [] -relation(B)|subset(relation_field(relation_restriction(B,A)),relation_field(B)).
% 1.85/2.05 0 [] -relation(B)|subset(relation_field(relation_restriction(B,A)),A).
% 1.85/2.05 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.85/2.05 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.85/2.05 0 [] -relation(C)| -in(ordered_pair(A,B),C)|in(A,relation_field(C)).
% 1.85/2.05 0 [] -relation(C)| -in(ordered_pair(A,B),C)|in(B,relation_field(C)).
% 1.85/2.05 0 [] relation($c6).
% 1.85/2.05 0 [] well_ordering($c6).
% 1.85/2.05 0 [] subset($c7,relation_field($c6)).
% 1.85/2.05 0 [] relation_field(relation_restriction($c6,$c7))!=$c7.
% 1.85/2.05 0 [] -element(A,powerset(B))|subset(A,B).
% 1.85/2.05 0 [] element(A,powerset(B))| -subset(A,B).
% 1.85/2.05 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.85/2.05 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.85/2.05 0 [] -empty(A)|A=empty_set.
% 1.85/2.05 0 [] -in(A,B)| -empty(B).
% 1.85/2.05 0 [] -empty(A)|A=B| -empty(B).
% 1.85/2.05 end_of_list.
% 1.85/2.05
% 1.85/2.05 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.85/2.05
% 1.85/2.05 This ia a non-Horn set with equality. The strategy will be
% 1.85/2.05 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.85/2.05 deletion, with positive clauses in sos and nonpositive
% 1.85/2.05 clauses in usable.
% 1.85/2.05
% 1.85/2.05 dependent: set(knuth_bendix).
% 1.85/2.05 dependent: set(anl_eq).
% 1.85/2.05 dependent: set(para_from).
% 1.85/2.05 dependent: set(para_into).
% 1.85/2.05 dependent: clear(para_from_right).
% 1.85/2.05 dependent: clear(para_into_right).
% 1.85/2.05 dependent: set(para_from_vars).
% 1.85/2.05 dependent: set(eq_units_both_ways).
% 1.85/2.05 dependent: set(dynamic_demod_all).
% 1.85/2.05 dependent: set(dynamic_demod).
% 1.85/2.05 dependent: set(order_eq).
% 1.85/2.05 dependent: set(back_demod).
% 1.85/2.05 dependent: set(lrpo).
% 1.85/2.05 dependent: set(hyper_res).
% 1.85/2.05 dependent: set(unit_deletion).
% 1.85/2.05 dependent: set(factor).
% 1.85/2.05
% 1.85/2.05 ------------> process usable:
% 1.85/2.05 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.85/2.05 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.85/2.05 ** KEPT (pick-wt=8): 3 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.85/2.05 ** KEPT (pick-wt=6): 4 [] A!=B|subset(A,B).
% 1.85/2.05 ** KEPT (pick-wt=6): 5 [] A!=B|subset(B,A).
% 1.85/2.05 ** KEPT (pick-wt=9): 6 [] A=B| -subset(A,B)| -subset(B,A).
% 1.85/2.05 ** KEPT (pick-wt=9): 7 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.85/2.05 ** KEPT (pick-wt=8): 8 [] subset(A,B)| -in($f1(A,B),B).
% 1.85/2.05 ** KEPT (pick-wt=6): 9 [] -relation(A)| -well_ordering(A)|reflexive(A).
% 1.85/2.05 ** KEPT (pick-wt=6): 10 [] -relation(A)| -well_ordering(A)|transitive(A).
% 1.85/2.05 ** KEPT (pick-wt=6): 11 [] -relation(A)| -well_ordering(A)|antisymmetric(A).
% 1.85/2.05 ** KEPT (pick-wt=6): 12 [] -relation(A)| -well_ordering(A)|connected(A).
% 1.85/2.05 ** KEPT (pick-wt=6): 13 [] -relation(A)| -well_ordering(A)|well_founded_relation(A).
% 1.85/2.05 ** KEPT (pick-wt=14): 14 [] -relation(A)|well_ordering(A)| -reflexive(A)| -transitive(A)| -antisymmetric(A)| -connected(A)| -well_founded_relation(A).
% 1.85/2.05 ** KEPT (pick-wt=10): 16 [copy,15,flip.2] -relation(A)|set_union2(relation_dom(A),relation_rng(A))=relation_field(A).
% 1.85/2.05 ** KEPT (pick-wt=11): 18 [copy,17,flip.2] -relation(A)|set_intersection2(A,cartesian_product2(B,B))=relation_restriction(A,B).
% 1.85/2.05 ** KEPT (pick-wt=6): 19 [] -relation(A)|relation(relation_restriction(A,B)).
% 1.85/2.05 ** KEPT (pick-wt=4): 20 [] -empty(ordered_pair(A,B)).
% 1.85/2.05 ** KEPT (pick-wt=6): 21 [] empty(A)| -empty(set_union2(A,B)).
% 1.85/2.05 ** KEPT (pick-wt=6): 22 [] empty(A)| -empty(set_union2(B,A)).
% 1.85/2.05 ** KEPT (pick-wt=13): 23 [] -relation(A)| -reflexive(A)| -in(B,relation_field(A))|in(ordered_pair(B,B),A).
% 1.85/2.05 ** KEPT (pick-wt=9): 24 [] -relation(A)|reflexive(A)|in($f3(A),relation_field(A)).
% 1.85/2.05 ** KEPT (pick-wt=11): 25 [] -relation(A)|reflexive(A)| -in(ordered_pair($f3(A),$f3(A)),A).
% 1.85/2.05 ** KEPT (pick-wt=2): 26 [] -empty($c4).
% 1.85/2.05 ** KEPT (pick-wt=10): 27 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 1.85/2.05 ** KEPT (pick-wt=10): 28 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 1.85/2.05 ** KEPT (pick-wt=13): 29 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 1.85/2.05 ** KEPT (pick-wt=10): 30 [] -relation(A)| -in(B,relation_restriction(A,C))|in(B,A).
% 1.85/2.05 ** KEPT (pick-wt=12): 31 [] -relation(A)| -in(B,relation_restriction(A,C))|in(B,cartesian_product2(C,C)).
% 1.85/2.05 ** KEPT (pick-wt=15): 32 [] -relation(A)|in(B,relation_restriction(A,C))| -in(B,A)| -in(B,cartesian_product2(C,C)).
% 1.85/2.05 ** KEPT (pick-wt=6): 33 [] -in(A,B)|element(A,B).
% 1.85/2.05 ** KEPT (pick-wt=9): 34 [] -relation(A)|subset(relation_field(relation_restriction(A,B)),relation_field(A)).
% 1.85/2.05 ** KEPT (pick-wt=8): 35 [] -relation(A)|subset(relation_field(relation_restriction(A,B)),B).
% 1.85/2.05 ** KEPT (pick-wt=8): 36 [] -element(A,B)|empty(B)|in(A,B).
% 1.85/2.05 ** KEPT (pick-wt=11): 37 [] -relation(A)| -in(ordered_pair(B,C),A)|in(B,relation_field(A)).
% 1.85/2.05 ** KEPT (pick-wt=11): 38 [] -relation(A)| -in(ordered_pair(B,C),A)|in(C,relation_field(A)).
% 1.85/2.05 ** KEPT (pick-wt=6): 39 [] relation_field(relation_restriction($c6,$c7))!=$c7.
% 1.85/2.05 ** KEPT (pick-wt=7): 40 [] -element(A,powerset(B))|subset(A,B).
% 1.85/2.05 ** KEPT (pick-wt=7): 41 [] element(A,powerset(B))| -subset(A,B).
% 1.85/2.05 ** KEPT (pick-wt=10): 42 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.85/2.05 ** KEPT (pick-wt=9): 43 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.85/2.05 ** KEPT (pick-wt=5): 44 [] -empty(A)|A=empty_set.
% 1.85/2.05 ** KEPT (pick-wt=5): 45 [] -in(A,B)| -empty(B).
% 1.85/2.05 ** KEPT (pick-wt=7): 46 [] -empty(A)|A=B| -empty(B).
% 1.85/2.05
% 1.85/2.05 ------------> process sos:
% 1.85/2.05 ** KEPT (pick-wt=3): 52 [] A=A.
% 1.85/2.05 ** KEPT (pick-wt=7): 53 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.85/2.05 ** KEPT (pick-wt=7): 54 [] set_union2(A,B)=set_union2(B,A).
% 1.85/2.05 ** KEPT (pick-wt=7): 55 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.85/2.05 ** KEPT (pick-wt=8): 56 [] subset(A,B)|in($f1(A,B),A).
% 1.85/2.05 ** KEPT (pick-wt=10): 58 [copy,57,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 1.85/2.05 ---> New Demodulator: 59 [new_demod,58] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 1.85/2.05 ** KEPT (pick-wt=4): 60 [] element($f2(A),A).
% 1.85/2.05 ** KEPT (pick-wt=2): 61 [] empty(empty_set).
% 1.85/2.05 ** KEPT (pick-wt=5): 62 [] set_union2(A,A)=A.
% 1.85/2.05 ---> New Demodulator: 63 [new_demod,62] set_union2(A,A)=A.
% 1.85/2.05 ** KEPT (pick-wt=5): 64 [] set_intersection2(A,A)=A.
% 1.85/2.05 ---> New Demodulator: 65 [new_demod,64] set_intersection2(A,A)=A.
% 1.85/2.05 ** KEPT (pick-wt=2): 66 [] relation($c1).
% 1.85/2.05 ** KEPT (pick-wt=2): 67 [] function($c1).
% 1.85/2.05 ** KEPT (pick-wt=2): 68 [] empty($c2).
% 1.85/2.05 ** KEPT (pick-wt=2): 69 [] relation($c3).
% 1.85/2.05 ** KEPT (pick-wt=2): 70 [] empty($c3).
% 1.85/2.05 ** KEPT (pick-wt=2): 71 [] function($c3).
% 1.85/2.05 ** KEPT (pick-wt=2): 72 [] relation($c5).
% 1.85/2.05 ** KEPT (pick-wt=2): 73 [] function($c5).
% 1.85/2.05 ** KEPT (pick-wt=2): 74 [] one_to_one($c5).
% 1.85/2.05 ** KEPT (pick-wt=3): 75 [] subset(A,A).
% 1.85/2.05 ** KEPT (pick-wt=5): 76 [] set_union2(A,empty_set)=A.
% 1.85/2.05 ---> New Demodulator: 77 [new_demod,76] set_union2(A,empty_set)=A.
% 1.85/2.05 ** KEPT (pick-wt=5): 78 [] set_intersection2(A,empty_set)=empty_set.
% 1.85/2.05 ---> New Demodulator: 79 [new_demod,78] set_intersection2(A,empty_set)=empty_set.
% 1.85/2.05 ** KEPT (pick-wt=2): 80 [] relation($c6).
% 1.85/2.05 ** KEPT (pick-wt=2): 81 [] well_ordering($c6).
% 1.85/2.05 ** KEPT (pick-wt=4): 82 [] subset($c7,relation_field($c6)).
% 1.85/2.05 Following clause subsumed by 52 during input processing: 0 [copy,52,flip.1] A=A.
% 1.85/2.05 52 back subsumes 51.
% 1.85/2.05 52 back subsumes 48.
% 1.85/2.05 Following clause subsumed by 53 during input processing: 0 [copy,53,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 14.05/14.26 Following clause subsumed by 54 during input processing: 0 [copy,54,flip.1] set_union2(A,B)=set_union2(B,A).
% 14.05/14.26 Following clause subsumed by 55 during input processing: 0 [copy,55,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 14.05/14.26 >>>> Starting back demodulation with 59.
% 14.05/14.26 >>>> Starting back demodulation with 63.
% 14.05/14.26 >>>> Starting back demodulation with 65.
% 14.05/14.26 >>>> Starting back demodulation with 77.
% 14.05/14.26 >>>> Starting back demodulation with 79.
% 14.05/14.26
% 14.05/14.26 ======= end of input processing =======
% 14.05/14.26
% 14.05/14.26 =========== start of search ===========
% 14.05/14.26
% 14.05/14.26
% 14.05/14.26 Resetting weight limit to 8.
% 14.05/14.26
% 14.05/14.26
% 14.05/14.26 Resetting weight limit to 8.
% 14.05/14.26
% 14.05/14.26 sos_size=1150
% 14.05/14.26
% 14.05/14.26
% 14.05/14.26 Resetting weight limit to 7.
% 14.05/14.26
% 14.05/14.26
% 14.05/14.26 Resetting weight limit to 7.
% 14.05/14.26
% 14.05/14.26 sos_size=1009
% 14.05/14.26
% 14.05/14.26 Search stopped because sos empty.
% 14.05/14.26
% 14.05/14.26
% 14.05/14.26 Search stopped because sos empty.
% 14.05/14.26
% 14.05/14.26 ============ end of search ============
% 14.05/14.26
% 14.05/14.26 -------------- statistics -------------
% 14.05/14.26 clauses given 1245
% 14.05/14.26 clauses generated 910630
% 14.05/14.26 clauses kept 1766
% 14.05/14.26 clauses forward subsumed 9873
% 14.05/14.26 clauses back subsumed 328
% 14.05/14.26 Kbytes malloced 6835
% 14.05/14.26
% 14.05/14.26 ----------- times (seconds) -----------
% 14.05/14.26 user CPU time 12.21 (0 hr, 0 min, 12 sec)
% 14.05/14.26 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 14.05/14.26 wall-clock time 14 (0 hr, 0 min, 14 sec)
% 14.05/14.26
% 14.05/14.26 Process 27042 finished Wed Jul 27 07:43:04 2022
% 14.05/14.26 Otter interrupted
% 14.05/14.26 PROOF NOT FOUND
%------------------------------------------------------------------------------