TSTP Solution File: SEU060+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU060+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:43 EDT 2022
% Result : Unknown 89.55s 89.73s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU060+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n006.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:52:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.14/2.34 ----- Otter 3.3f, August 2004 -----
% 2.14/2.34 The process was started by sandbox2 on n006.cluster.edu,
% 2.14/2.34 Wed Jul 27 07:52:32 2022
% 2.14/2.34 The command was "./otter". The process ID is 17238.
% 2.14/2.34
% 2.14/2.34 set(prolog_style_variables).
% 2.14/2.34 set(auto).
% 2.14/2.34 dependent: set(auto1).
% 2.14/2.34 dependent: set(process_input).
% 2.14/2.34 dependent: clear(print_kept).
% 2.14/2.34 dependent: clear(print_new_demod).
% 2.14/2.34 dependent: clear(print_back_demod).
% 2.14/2.34 dependent: clear(print_back_sub).
% 2.14/2.34 dependent: set(control_memory).
% 2.14/2.34 dependent: assign(max_mem, 12000).
% 2.14/2.34 dependent: assign(pick_given_ratio, 4).
% 2.14/2.34 dependent: assign(stats_level, 1).
% 2.14/2.34 dependent: assign(max_seconds, 10800).
% 2.14/2.34 clear(print_given).
% 2.14/2.34
% 2.14/2.34 formula_list(usable).
% 2.14/2.34 all A (A=A).
% 2.14/2.34 all A B (in(A,B)-> -in(B,A)).
% 2.14/2.34 all A (empty(A)->function(A)).
% 2.14/2.34 all A (empty(A)->relation(A)).
% 2.14/2.34 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.14/2.34 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.14/2.34 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 2.14/2.34 all A B (A=B<->subset(A,B)&subset(B,A)).
% 2.14/2.34 all A (relation(A)-> (all B C (relation(C)-> (C=relation_dom_restriction(A,B)<-> (all D E (in(ordered_pair(D,E),C)<->in(D,B)&in(ordered_pair(D,E),A))))))).
% 2.14/2.34 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.14/2.34 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 2.14/2.34 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 2.14/2.34 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 2.14/2.34 all A B (relation(A)->relation(relation_dom_restriction(A,B))).
% 2.14/2.34 all A exists B element(B,A).
% 2.14/2.34 empty(empty_set).
% 2.14/2.34 relation(empty_set).
% 2.14/2.34 relation_empty_yielding(empty_set).
% 2.14/2.34 all A B (relation(A)&relation_empty_yielding(A)->relation(relation_dom_restriction(A,B))&relation_empty_yielding(relation_dom_restriction(A,B))).
% 2.14/2.34 all A B (relation(A)&relation(B)->relation(set_intersection2(A,B))).
% 2.14/2.34 all A (-empty(powerset(A))).
% 2.14/2.34 empty(empty_set).
% 2.14/2.34 all A B (-empty(ordered_pair(A,B))).
% 2.14/2.34 all A (-empty(singleton(A))).
% 2.14/2.34 all A B (-empty(unordered_pair(A,B))).
% 2.14/2.34 all A B (relation(A)&function(A)->relation(relation_dom_restriction(A,B))&function(relation_dom_restriction(A,B))).
% 2.14/2.34 empty(empty_set).
% 2.14/2.34 relation(empty_set).
% 2.14/2.34 all A B (set_intersection2(A,A)=A).
% 2.14/2.34 exists A (relation(A)&function(A)).
% 2.14/2.34 exists A (empty(A)&relation(A)).
% 2.14/2.34 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.14/2.34 exists A empty(A).
% 2.14/2.34 exists A (relation(A)&empty(A)&function(A)).
% 2.14/2.34 exists A (-empty(A)&relation(A)).
% 2.14/2.34 all A exists B (element(B,powerset(A))&empty(B)).
% 2.14/2.34 exists A (-empty(A)).
% 2.14/2.34 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.14/2.34 exists A (relation(A)&relation_empty_yielding(A)).
% 2.14/2.34 all A B subset(A,A).
% 2.14/2.34 -(all A B C (relation(C)->relation_inverse_image(relation_dom_restriction(C,A),B)=set_intersection2(A,relation_inverse_image(C,B)))).
% 2.14/2.34 all A B (in(A,B)->element(A,B)).
% 2.14/2.34 all A (set_intersection2(A,empty_set)=empty_set).
% 2.14/2.34 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.14/2.34 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.14/2.34 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.14/2.34 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.14/2.34 all A (empty(A)->A=empty_set).
% 2.14/2.34 all A B (-(in(A,B)&empty(B))).
% 2.14/2.34 all A B (relation(B)->subset(relation_dom_restriction(B,A),B)).
% 2.14/2.34 all A B (-(empty(A)&A!=B&empty(B))).
% 2.14/2.34 end_of_list.
% 2.14/2.34
% 2.14/2.34 -------> usable clausifies to:
% 2.14/2.34
% 2.14/2.34 list(usable).
% 2.14/2.34 0 [] A=A.
% 2.14/2.34 0 [] -in(A,B)| -in(B,A).
% 2.14/2.34 0 [] -empty(A)|function(A).
% 2.14/2.34 0 [] -empty(A)|relation(A).
% 2.14/2.34 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.14/2.34 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.14/2.34 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.14/2.34 0 [] A!=B|subset(A,B).
% 2.14/2.34 0 [] A!=B|subset(B,A).
% 2.14/2.34 0 [] A=B| -subset(A,B)| -subset(B,A).
% 2.14/2.34 0 [] -relation(A)| -relation(C)|C!=relation_dom_restriction(A,B)| -in(ordered_pair(D,E),C)|in(D,B).
% 2.14/2.34 0 [] -relation(A)| -relation(C)|C!=relation_dom_restriction(A,B)| -in(ordered_pair(D,E),C)|in(ordered_pair(D,E),A).
% 2.14/2.34 0 [] -relation(A)| -relation(C)|C!=relation_dom_restriction(A,B)|in(ordered_pair(D,E),C)| -in(D,B)| -in(ordered_pair(D,E),A).
% 2.14/2.34 0 [] -relation(A)| -relation(C)|C=relation_dom_restriction(A,B)|in(ordered_pair($f2(A,B,C),$f1(A,B,C)),C)|in($f2(A,B,C),B).
% 2.14/2.34 0 [] -relation(A)| -relation(C)|C=relation_dom_restriction(A,B)|in(ordered_pair($f2(A,B,C),$f1(A,B,C)),C)|in(ordered_pair($f2(A,B,C),$f1(A,B,C)),A).
% 2.14/2.34 0 [] -relation(A)| -relation(C)|C=relation_dom_restriction(A,B)| -in(ordered_pair($f2(A,B,C),$f1(A,B,C)),C)| -in($f2(A,B,C),B)| -in(ordered_pair($f2(A,B,C),$f1(A,B,C)),A).
% 2.14/2.34 0 [] -relation(A)|C!=relation_inverse_image(A,B)| -in(D,C)|in(ordered_pair(D,$f3(A,B,C,D)),A).
% 2.14/2.34 0 [] -relation(A)|C!=relation_inverse_image(A,B)| -in(D,C)|in($f3(A,B,C,D),B).
% 2.14/2.34 0 [] -relation(A)|C!=relation_inverse_image(A,B)|in(D,C)| -in(ordered_pair(D,E),A)| -in(E,B).
% 2.14/2.34 0 [] -relation(A)|C=relation_inverse_image(A,B)|in($f5(A,B,C),C)|in(ordered_pair($f5(A,B,C),$f4(A,B,C)),A).
% 2.14/2.34 0 [] -relation(A)|C=relation_inverse_image(A,B)|in($f5(A,B,C),C)|in($f4(A,B,C),B).
% 2.14/2.34 0 [] -relation(A)|C=relation_inverse_image(A,B)| -in($f5(A,B,C),C)| -in(ordered_pair($f5(A,B,C),X1),A)| -in(X1,B).
% 2.14/2.34 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.14/2.34 0 [] subset(A,B)|in($f6(A,B),A).
% 2.14/2.34 0 [] subset(A,B)| -in($f6(A,B),B).
% 2.14/2.34 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 2.14/2.34 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 2.14/2.34 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 2.14/2.34 0 [] C=set_intersection2(A,B)|in($f7(A,B,C),C)|in($f7(A,B,C),A).
% 2.14/2.34 0 [] C=set_intersection2(A,B)|in($f7(A,B,C),C)|in($f7(A,B,C),B).
% 2.14/2.34 0 [] C=set_intersection2(A,B)| -in($f7(A,B,C),C)| -in($f7(A,B,C),A)| -in($f7(A,B,C),B).
% 2.14/2.34 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.14/2.34 0 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 2.14/2.34 0 [] element($f8(A),A).
% 2.14/2.34 0 [] empty(empty_set).
% 2.14/2.34 0 [] relation(empty_set).
% 2.14/2.34 0 [] relation_empty_yielding(empty_set).
% 2.14/2.34 0 [] -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 2.14/2.34 0 [] -relation(A)| -relation_empty_yielding(A)|relation_empty_yielding(relation_dom_restriction(A,B)).
% 2.14/2.34 0 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 2.14/2.34 0 [] -empty(powerset(A)).
% 2.14/2.34 0 [] empty(empty_set).
% 2.14/2.34 0 [] -empty(ordered_pair(A,B)).
% 2.14/2.34 0 [] -empty(singleton(A)).
% 2.14/2.34 0 [] -empty(unordered_pair(A,B)).
% 2.14/2.34 0 [] -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 2.14/2.34 0 [] -relation(A)| -function(A)|function(relation_dom_restriction(A,B)).
% 2.14/2.34 0 [] empty(empty_set).
% 2.14/2.34 0 [] relation(empty_set).
% 2.14/2.34 0 [] set_intersection2(A,A)=A.
% 2.14/2.34 0 [] relation($c1).
% 2.14/2.34 0 [] function($c1).
% 2.14/2.34 0 [] empty($c2).
% 2.14/2.34 0 [] relation($c2).
% 2.14/2.34 0 [] empty(A)|element($f9(A),powerset(A)).
% 2.14/2.34 0 [] empty(A)| -empty($f9(A)).
% 2.14/2.34 0 [] empty($c3).
% 2.14/2.34 0 [] relation($c4).
% 2.14/2.34 0 [] empty($c4).
% 2.14/2.34 0 [] function($c4).
% 2.14/2.34 0 [] -empty($c5).
% 2.14/2.34 0 [] relation($c5).
% 2.14/2.34 0 [] element($f10(A),powerset(A)).
% 2.14/2.34 0 [] empty($f10(A)).
% 2.14/2.34 0 [] -empty($c6).
% 2.14/2.34 0 [] relation($c7).
% 2.14/2.34 0 [] function($c7).
% 2.14/2.34 0 [] one_to_one($c7).
% 2.14/2.34 0 [] relation($c8).
% 2.14/2.34 0 [] relation_empty_yielding($c8).
% 2.14/2.34 0 [] subset(A,A).
% 2.14/2.34 0 [] relation($c9).
% 2.14/2.34 0 [] relation_inverse_image(relation_dom_restriction($c9,$c11),$c10)!=set_intersection2($c11,relation_inverse_image($c9,$c10)).
% 2.14/2.34 0 [] -in(A,B)|element(A,B).
% 2.14/2.34 0 [] set_intersection2(A,empty_set)=empty_set.
% 2.14/2.34 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.14/2.34 0 [] -element(A,powerset(B))|subset(A,B).
% 2.14/2.34 0 [] element(A,powerset(B))| -subset(A,B).
% 2.14/2.34 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.14/2.34 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.14/2.34 0 [] -empty(A)|A=empty_set.
% 2.14/2.34 0 [] -in(A,B)| -empty(B).
% 2.14/2.34 0 [] -relation(B)|subset(relation_dom_restriction(B,A),B).
% 2.14/2.34 0 [] -empty(A)|A=B| -empty(B).
% 2.14/2.34 end_of_list.
% 2.14/2.34
% 2.14/2.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 2.14/2.34
% 2.14/2.34 This ia a non-Horn set with equality. The strategy will be
% 2.14/2.34 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.14/2.34 deletion, with positive clauses in sos and nonpositive
% 2.14/2.34 clauses in usable.
% 2.14/2.34
% 2.14/2.34 dependent: set(knuth_bendix).
% 2.14/2.34 dependent: set(anl_eq).
% 2.14/2.34 dependent: set(para_from).
% 2.14/2.34 dependent: set(para_into).
% 2.14/2.34 dependent: clear(para_from_right).
% 2.14/2.34 dependent: clear(para_into_right).
% 2.14/2.34 dependent: set(para_from_vars).
% 2.14/2.34 dependent: set(eq_units_both_ways).
% 2.14/2.34 dependent: set(dynamic_demod_all).
% 2.14/2.34 dependent: set(dynamic_demod).
% 2.14/2.34 dependent: set(order_eq).
% 2.14/2.34 dependent: set(back_demod).
% 2.14/2.34 dependent: set(lrpo).
% 2.14/2.34 dependent: set(hyper_res).
% 2.14/2.34 dependent: set(unit_deletion).
% 2.14/2.34 dependent: set(factor).
% 2.14/2.34
% 2.14/2.34 ------------> process usable:
% 2.14/2.34 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.14/2.34 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 2.14/2.34 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 2.14/2.34 ** KEPT (pick-wt=8): 4 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.14/2.34 ** KEPT (pick-wt=6): 5 [] A!=B|subset(A,B).
% 2.14/2.34 ** KEPT (pick-wt=6): 6 [] A!=B|subset(B,A).
% 2.14/2.34 ** KEPT (pick-wt=9): 7 [] A=B| -subset(A,B)| -subset(B,A).
% 2.14/2.34 ** KEPT (pick-wt=17): 8 [] -relation(A)| -relation(B)|B!=relation_dom_restriction(A,C)| -in(ordered_pair(D,E),B)|in(D,C).
% 2.14/2.34 ** KEPT (pick-wt=19): 9 [] -relation(A)| -relation(B)|B!=relation_dom_restriction(A,C)| -in(ordered_pair(D,E),B)|in(ordered_pair(D,E),A).
% 2.14/2.34 ** KEPT (pick-wt=22): 10 [] -relation(A)| -relation(B)|B!=relation_dom_restriction(A,C)|in(ordered_pair(D,E),B)| -in(D,C)| -in(ordered_pair(D,E),A).
% 2.14/2.34 ** KEPT (pick-wt=26): 11 [] -relation(A)| -relation(B)|B=relation_dom_restriction(A,C)|in(ordered_pair($f2(A,C,B),$f1(A,C,B)),B)|in($f2(A,C,B),C).
% 2.14/2.34 ** KEPT (pick-wt=31): 12 [] -relation(A)| -relation(B)|B=relation_dom_restriction(A,C)|in(ordered_pair($f2(A,C,B),$f1(A,C,B)),B)|in(ordered_pair($f2(A,C,B),$f1(A,C,B)),A).
% 2.14/2.34 ** KEPT (pick-wt=37): 13 [] -relation(A)| -relation(B)|B=relation_dom_restriction(A,C)| -in(ordered_pair($f2(A,C,B),$f1(A,C,B)),B)| -in($f2(A,C,B),C)| -in(ordered_pair($f2(A,C,B),$f1(A,C,B)),A).
% 2.14/2.34 ** KEPT (pick-wt=19): 14 [] -relation(A)|B!=relation_inverse_image(A,C)| -in(D,B)|in(ordered_pair(D,$f3(A,C,B,D)),A).
% 2.14/2.34 ** KEPT (pick-wt=17): 15 [] -relation(A)|B!=relation_inverse_image(A,C)| -in(D,B)|in($f3(A,C,B,D),C).
% 2.14/2.34 ** KEPT (pick-wt=18): 16 [] -relation(A)|B!=relation_inverse_image(A,C)|in(D,B)| -in(ordered_pair(D,E),A)| -in(E,C).
% 2.14/2.34 ** KEPT (pick-wt=24): 17 [] -relation(A)|B=relation_inverse_image(A,C)|in($f5(A,C,B),B)|in(ordered_pair($f5(A,C,B),$f4(A,C,B)),A).
% 2.14/2.34 ** KEPT (pick-wt=19): 18 [] -relation(A)|B=relation_inverse_image(A,C)|in($f5(A,C,B),B)|in($f4(A,C,B),C).
% 2.14/2.34 ** KEPT (pick-wt=24): 19 [] -relation(A)|B=relation_inverse_image(A,C)| -in($f5(A,C,B),B)| -in(ordered_pair($f5(A,C,B),D),A)| -in(D,C).
% 2.14/2.34 ** KEPT (pick-wt=9): 20 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.14/2.34 ** KEPT (pick-wt=8): 21 [] subset(A,B)| -in($f6(A,B),B).
% 2.14/2.34 ** KEPT (pick-wt=11): 22 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 2.14/2.34 ** KEPT (pick-wt=11): 23 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 2.14/2.34 ** KEPT (pick-wt=14): 24 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 2.14/2.34 ** KEPT (pick-wt=23): 25 [] A=set_intersection2(B,C)| -in($f7(B,C,A),A)| -in($f7(B,C,A),B)| -in($f7(B,C,A),C).
% 2.14/2.34 ** KEPT (pick-wt=6): 26 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 2.14/2.34 Following clause subsumed by 26 during input processing: 0 [] -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 2.14/2.34 ** KEPT (pick-wt=8): 27 [] -relation(A)| -relation_empty_yielding(A)|relation_empty_yielding(relation_dom_restriction(A,B)).
% 2.14/2.34 ** KEPT (pick-wt=8): 28 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 2.14/2.34 ** KEPT (pick-wt=3): 29 [] -empty(powerset(A)).
% 2.14/2.34 ** KEPT (pick-wt=4): 30 [] -empty(ordered_pair(A,B)).
% 2.14/2.34 ** KEPT (pick-wt=3): 31 [] -empty(singleton(A)).
% 2.14/2.34 ** KEPT (pick-wt=4): 32 [] -empty(unordered_pair(A,B)).
% 2.14/2.34 Following clause subsumed by 26 during input processing: 0 [] -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 2.14/2.34 ** KEPT (pick-wt=8): 33 [] -relation(A)| -function(A)|function(relation_dom_restriction(A,B)).
% 2.14/2.34 ** KEPT (pick-wt=5): 34 [] empty(A)| -empty($f9(A)).
% 2.14/2.34 ** KEPT (pick-wt=2): 35 [] -empty($c5).
% 2.14/2.34 ** KEPT (pick-wt=2): 36 [] -empty($c6).
% 2.14/2.34 ** KEPT (pick-wt=11): 38 [copy,37,flip.1] set_intersection2($c11,relation_inverse_image($c9,$c10))!=relation_inverse_image(relation_dom_restriction($c9,$c11),$c10).
% 2.14/2.34 ** KEPT (pick-wt=6): 39 [] -in(A,B)|element(A,B).
% 2.14/2.34 ** KEPT (pick-wt=8): 40 [] -element(A,B)|empty(B)|in(A,B).
% 2.14/2.34 ** KEPT (pick-wt=7): 41 [] -element(A,powerset(B))|subset(A,B).
% 2.14/2.34 ** KEPT (pick-wt=7): 42 [] element(A,powerset(B))| -subset(A,B).
% 2.14/2.34 ** KEPT (pick-wt=10): 43 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.14/2.34 ** KEPT (pick-wt=9): 44 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.14/2.34 ** KEPT (pick-wt=5): 45 [] -empty(A)|A=empty_set.
% 2.14/2.34 ** KEPT (pick-wt=5): 46 [] -in(A,B)| -empty(B).
% 89.55/89.73 ** KEPT (pick-wt=7): 47 [] -relation(A)|subset(relation_dom_restriction(A,B),A).
% 89.55/89.73 ** KEPT (pick-wt=7): 48 [] -empty(A)|A=B| -empty(B).
% 89.55/89.73 53 back subsumes 52.
% 89.55/89.73
% 89.55/89.73 ------------> process sos:
% 89.55/89.73 ** KEPT (pick-wt=3): 63 [] A=A.
% 89.55/89.73 ** KEPT (pick-wt=7): 64 [] unordered_pair(A,B)=unordered_pair(B,A).
% 89.55/89.73 ** KEPT (pick-wt=7): 65 [] set_intersection2(A,B)=set_intersection2(B,A).
% 89.55/89.73 ** KEPT (pick-wt=8): 66 [] subset(A,B)|in($f6(A,B),A).
% 89.55/89.73 ** KEPT (pick-wt=17): 67 [] A=set_intersection2(B,C)|in($f7(B,C,A),A)|in($f7(B,C,A),B).
% 89.55/89.73 ** KEPT (pick-wt=17): 68 [] A=set_intersection2(B,C)|in($f7(B,C,A),A)|in($f7(B,C,A),C).
% 89.55/89.73 ** KEPT (pick-wt=10): 70 [copy,69,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 89.55/89.73 ---> New Demodulator: 71 [new_demod,70] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 89.55/89.73 ** KEPT (pick-wt=4): 72 [] element($f8(A),A).
% 89.55/89.73 ** KEPT (pick-wt=2): 73 [] empty(empty_set).
% 89.55/89.73 ** KEPT (pick-wt=2): 74 [] relation(empty_set).
% 89.55/89.73 ** KEPT (pick-wt=2): 75 [] relation_empty_yielding(empty_set).
% 89.55/89.73 Following clause subsumed by 73 during input processing: 0 [] empty(empty_set).
% 89.55/89.73 Following clause subsumed by 73 during input processing: 0 [] empty(empty_set).
% 89.55/89.73 Following clause subsumed by 74 during input processing: 0 [] relation(empty_set).
% 89.55/89.73 ** KEPT (pick-wt=5): 76 [] set_intersection2(A,A)=A.
% 89.55/89.73 ---> New Demodulator: 77 [new_demod,76] set_intersection2(A,A)=A.
% 89.55/89.73 ** KEPT (pick-wt=2): 78 [] relation($c1).
% 89.55/89.73 ** KEPT (pick-wt=2): 79 [] function($c1).
% 89.55/89.73 ** KEPT (pick-wt=2): 80 [] empty($c2).
% 89.55/89.73 ** KEPT (pick-wt=2): 81 [] relation($c2).
% 89.55/89.73 ** KEPT (pick-wt=7): 82 [] empty(A)|element($f9(A),powerset(A)).
% 89.55/89.73 ** KEPT (pick-wt=2): 83 [] empty($c3).
% 89.55/89.73 ** KEPT (pick-wt=2): 84 [] relation($c4).
% 89.55/89.73 ** KEPT (pick-wt=2): 85 [] empty($c4).
% 89.55/89.73 ** KEPT (pick-wt=2): 86 [] function($c4).
% 89.55/89.73 ** KEPT (pick-wt=2): 87 [] relation($c5).
% 89.55/89.73 ** KEPT (pick-wt=5): 88 [] element($f10(A),powerset(A)).
% 89.55/89.73 ** KEPT (pick-wt=3): 89 [] empty($f10(A)).
% 89.55/89.73 ** KEPT (pick-wt=2): 90 [] relation($c7).
% 89.55/89.73 ** KEPT (pick-wt=2): 91 [] function($c7).
% 89.55/89.73 ** KEPT (pick-wt=2): 92 [] one_to_one($c7).
% 89.55/89.73 ** KEPT (pick-wt=2): 93 [] relation($c8).
% 89.55/89.73 ** KEPT (pick-wt=2): 94 [] relation_empty_yielding($c8).
% 89.55/89.73 ** KEPT (pick-wt=3): 95 [] subset(A,A).
% 89.55/89.73 ** KEPT (pick-wt=2): 96 [] relation($c9).
% 89.55/89.73 ** KEPT (pick-wt=5): 97 [] set_intersection2(A,empty_set)=empty_set.
% 89.55/89.73 ---> New Demodulator: 98 [new_demod,97] set_intersection2(A,empty_set)=empty_set.
% 89.55/89.73 Following clause subsumed by 63 during input processing: 0 [copy,63,flip.1] A=A.
% 89.55/89.73 63 back subsumes 61.
% 89.55/89.73 63 back subsumes 50.
% 89.55/89.73 Following clause subsumed by 64 during input processing: 0 [copy,64,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 89.55/89.73 Following clause subsumed by 65 during input processing: 0 [copy,65,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 89.55/89.73 >>>> Starting back demodulation with 71.
% 89.55/89.73 >>>> Starting back demodulation with 77.
% 89.55/89.73 >> back demodulating 62 with 77.
% 89.55/89.73 >> back demodulating 60 with 77.
% 89.55/89.73 >> back demodulating 59 with 77.
% 89.55/89.73 >> back demodulating 56 with 77.
% 89.55/89.73 >>>> Starting back demodulation with 98.
% 89.55/89.73
% 89.55/89.73 ======= end of input processing =======
% 89.55/89.73
% 89.55/89.73 =========== start of search ===========
% 89.55/89.73
% 89.55/89.73
% 89.55/89.73 Resetting weight limit to 4.
% 89.55/89.73
% 89.55/89.73
% 89.55/89.73 Resetting weight limit to 4.
% 89.55/89.73
% 89.55/89.73 sos_size=551
% 89.55/89.73
% 89.55/89.73 Search stopped because sos empty.
% 89.55/89.73
% 89.55/89.73
% 89.55/89.73 Search stopped because sos empty.
% 89.55/89.73
% 89.55/89.73 ============ end of search ============
% 89.55/89.73
% 89.55/89.73 -------------- statistics -------------
% 89.55/89.73 clauses given 590
% 89.55/89.73 clauses generated 1818605
% 89.55/89.73 clauses kept 728
% 89.55/89.73 clauses forward subsumed 927
% 89.55/89.73 clauses back subsumed 9
% 89.55/89.73 Kbytes malloced 8789
% 89.55/89.73
% 89.55/89.73 ----------- times (seconds) -----------
% 89.55/89.73 user CPU time 87.38 (0 hr, 1 min, 27 sec)
% 89.55/89.73 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 89.55/89.73 wall-clock time 89 (0 hr, 1 min, 29 sec)
% 89.55/89.73
% 89.55/89.73 Process 17238 finished Wed Jul 27 07:54:01 2022
% 89.55/89.73 Otter interrupted
% 89.55/89.73 PROOF NOT FOUND
%------------------------------------------------------------------------------