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