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