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