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