TSTP Solution File: SEU376+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU376+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n003.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:57 EDT 2022
% Result : Unknown 35.72s 35.95s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU376+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n003.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 08:01:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.08/2.30 ----- Otter 3.3f, August 2004 -----
% 2.08/2.30 The process was started by sandbox2 on n003.cluster.edu,
% 2.08/2.30 Wed Jul 27 08:01:11 2022
% 2.08/2.30 The command was "./otter". The process ID is 14667.
% 2.08/2.30
% 2.08/2.30 set(prolog_style_variables).
% 2.08/2.30 set(auto).
% 2.08/2.30 dependent: set(auto1).
% 2.08/2.30 dependent: set(process_input).
% 2.08/2.30 dependent: clear(print_kept).
% 2.08/2.30 dependent: clear(print_new_demod).
% 2.08/2.30 dependent: clear(print_back_demod).
% 2.08/2.30 dependent: clear(print_back_sub).
% 2.08/2.30 dependent: set(control_memory).
% 2.08/2.30 dependent: assign(max_mem, 12000).
% 2.08/2.30 dependent: assign(pick_given_ratio, 4).
% 2.08/2.30 dependent: assign(stats_level, 1).
% 2.08/2.30 dependent: assign(max_seconds, 10800).
% 2.08/2.30 clear(print_given).
% 2.08/2.30
% 2.08/2.30 formula_list(usable).
% 2.08/2.30 all A (A=A).
% 2.08/2.30 all A B (in(A,B)-> -in(B,A)).
% 2.08/2.30 all A (empty(A)->function(A)).
% 2.08/2.30 all A (empty(A)->relation(A)).
% 2.08/2.30 all A B C (element(C,powerset(cartesian_product2(A,B)))->relation(C)).
% 2.08/2.30 all A (rel_str(A)-> (empty_carrier(A)->v1_yellow_3(A))).
% 2.08/2.30 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.08/2.30 all A (rel_str(A)-> (-v1_yellow_3(A)-> -empty_carrier(A))).
% 2.08/2.30 all A (-empty_carrier(A)&one_sorted_str(A)-> (all B (-empty_carrier(B)&net_str(B,A)-> (all C (is_eventually_in(A,B,C)<-> (exists D (element(D,the_carrier(B))& (all E (element(E,the_carrier(B))-> (related(B,D,E)->in(apply_netmap(A,B,E),C))))))))))).
% 2.08/2.30 all A (-empty_carrier(A)&one_sorted_str(A)-> (all B (-empty_carrier(B)&net_str(B,A)-> (all C (is_often_in(A,B,C)<-> (all D (element(D,the_carrier(B))-> (exists E (element(E,the_carrier(B))&related(B,D,E)&in(apply_netmap(A,B,E),C)))))))))).
% 2.08/2.30 all A (-empty_carrier(A)&rel_str(A)-> (directed_relstr(A)<-> (all B (element(B,the_carrier(A))-> (all C (element(C,the_carrier(A))-> (exists D (element(D,the_carrier(A))&related(A,B,D)&related(A,C,D))))))))).
% 2.08/2.30 all A (-empty_carrier(A)&one_sorted_str(A)-> (all B (-empty_carrier(B)&net_str(B,A)-> (all C (element(C,the_carrier(B))->apply_netmap(A,B,C)=apply_on_structs(B,A,the_mapping(A,B),C)))))).
% 2.08/2.30 $T.
% 2.08/2.30 all A B C D (-empty_carrier(A)&one_sorted_str(A)& -empty_carrier(B)&one_sorted_str(B)&function(C)&quasi_total(C,the_carrier(A),the_carrier(B))&relation_of2(C,the_carrier(A),the_carrier(B))&element(D,the_carrier(A))->element(apply_on_structs(A,B,C,D),the_carrier(B))).
% 2.08/2.30 $T.
% 2.08/2.30 $T.
% 2.08/2.30 $T.
% 2.08/2.30 all A B C (-empty_carrier(A)&one_sorted_str(A)& -empty_carrier(B)&net_str(B,A)&element(C,the_carrier(B))->element(apply_netmap(A,B,C),the_carrier(A))).
% 2.08/2.30 all A (rel_str(A)->one_sorted_str(A)).
% 2.08/2.30 $T.
% 2.08/2.30 all A (one_sorted_str(A)-> (all B (net_str(B,A)->rel_str(B)))).
% 2.08/2.30 $T.
% 2.08/2.30 $T.
% 2.08/2.30 all A B C (relation_of2_as_subset(C,A,B)->element(C,powerset(cartesian_product2(A,B)))).
% 2.08/2.30 $T.
% 2.08/2.30 all A B (one_sorted_str(A)&net_str(B,A)->function(the_mapping(A,B))&quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A))&relation_of2_as_subset(the_mapping(A,B),the_carrier(B),the_carrier(A))).
% 2.08/2.30 exists A rel_str(A).
% 2.08/2.30 exists A one_sorted_str(A).
% 2.08/2.30 all A (one_sorted_str(A)-> (exists B net_str(B,A))).
% 2.08/2.30 all A B exists C relation_of2(C,A,B).
% 2.08/2.30 all A exists B element(B,A).
% 2.08/2.30 all A B exists C relation_of2_as_subset(C,A,B).
% 2.08/2.30 empty(empty_set).
% 2.08/2.30 relation(empty_set).
% 2.08/2.30 relation_empty_yielding(empty_set).
% 2.08/2.30 all A B (-empty_carrier(A)&one_sorted_str(A)& -empty_carrier(B)&net_str(B,A)-> -empty(the_mapping(A,B))&relation(the_mapping(A,B))&function(the_mapping(A,B))&quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A))).
% 2.08/2.30 all A (-empty_carrier(A)&one_sorted_str(A)-> -empty(the_carrier(A))).
% 2.08/2.30 all A (-empty(powerset(A))).
% 2.08/2.30 empty(empty_set).
% 2.08/2.30 relation(empty_set).
% 2.08/2.30 all A B (-empty(A)& -empty(B)-> -empty(cartesian_product2(A,B))).
% 2.08/2.30 exists A (relation(A)&function(A)).
% 2.08/2.30 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 2.08/2.30 exists A (empty(A)&relation(A)).
% 2.08/2.30 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.08/2.30 exists A (relation(A)&empty(A)&function(A)).
% 2.08/2.30 exists A (-empty(A)&relation(A)).
% 2.08/2.30 all A exists B (element(B,powerset(A))&empty(B)).
% 2.08/2.30 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.08/2.30 exists A (relation(A)&relation_empty_yielding(A)).
% 2.08/2.30 exists A (one_sorted_str(A)& -empty_carrier(A)).
% 2.08/2.30 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 2.08/2.30 all A (-empty_carrier(A)&one_sorted_str(A)-> (exists B (element(B,powerset(the_carrier(A)))& -empty(B)))).
% 2.08/2.30 all A B C D (-empty_carrier(A)&one_sorted_str(A)& -empty_carrier(B)&one_sorted_str(B)&function(C)&quasi_total(C,the_carrier(A),the_carrier(B))&relation_of2(C,the_carrier(A),the_carrier(B))&element(D,the_carrier(A))->apply_on_structs(A,B,C,D)=apply(C,D)).
% 2.08/2.30 all A B C (relation_of2_as_subset(C,A,B)<->relation_of2(C,A,B)).
% 2.08/2.30 all A B subset(A,A).
% 2.08/2.30 all A B (in(A,B)->element(A,B)).
% 2.08/2.30 -(all A (-empty_carrier(A)&one_sorted_str(A)-> (all B (-empty_carrier(B)&transitive_relstr(B)&directed_relstr(B)&net_str(B,A)-> (all C (is_eventually_in(A,B,C)->is_often_in(A,B,C))))))).
% 2.08/2.30 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.08/2.30 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.08/2.30 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.08/2.30 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.08/2.30 all A (empty(A)->A=empty_set).
% 2.08/2.30 all A B (-(in(A,B)&empty(B))).
% 2.08/2.30 all A B (-(empty(A)&A!=B&empty(B))).
% 2.08/2.30 end_of_list.
% 2.08/2.30
% 2.08/2.30 -------> usable clausifies to:
% 2.08/2.30
% 2.08/2.30 list(usable).
% 2.08/2.30 0 [] A=A.
% 2.08/2.30 0 [] -in(A,B)| -in(B,A).
% 2.08/2.30 0 [] -empty(A)|function(A).
% 2.08/2.30 0 [] -empty(A)|relation(A).
% 2.08/2.30 0 [] -element(C,powerset(cartesian_product2(A,B)))|relation(C).
% 2.08/2.30 0 [] -rel_str(A)| -empty_carrier(A)|v1_yellow_3(A).
% 2.08/2.30 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.08/2.30 0 [] -rel_str(A)|v1_yellow_3(A)| -empty_carrier(A).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -is_eventually_in(A,B,C)|element($f1(A,B,C),the_carrier(B)).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -is_eventually_in(A,B,C)| -element(E,the_carrier(B))| -related(B,$f1(A,B,C),E)|in(apply_netmap(A,B,E),C).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|is_eventually_in(A,B,C)| -element(D,the_carrier(B))|element($f2(A,B,C,D),the_carrier(B)).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|is_eventually_in(A,B,C)| -element(D,the_carrier(B))|related(B,D,$f2(A,B,C,D)).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|is_eventually_in(A,B,C)| -element(D,the_carrier(B))| -in(apply_netmap(A,B,$f2(A,B,C,D)),C).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -is_often_in(A,B,C)| -element(D,the_carrier(B))|element($f3(A,B,C,D),the_carrier(B)).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -is_often_in(A,B,C)| -element(D,the_carrier(B))|related(B,D,$f3(A,B,C,D)).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -is_often_in(A,B,C)| -element(D,the_carrier(B))|in(apply_netmap(A,B,$f3(A,B,C,D)),C).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|is_often_in(A,B,C)|element($f4(A,B,C),the_carrier(B)).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|is_often_in(A,B,C)| -element(E,the_carrier(B))| -related(B,$f4(A,B,C),E)| -in(apply_netmap(A,B,E),C).
% 2.08/2.30 0 [] empty_carrier(A)| -rel_str(A)| -directed_relstr(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))|element($f5(A,B,C),the_carrier(A)).
% 2.08/2.30 0 [] empty_carrier(A)| -rel_str(A)| -directed_relstr(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))|related(A,B,$f5(A,B,C)).
% 2.08/2.30 0 [] empty_carrier(A)| -rel_str(A)| -directed_relstr(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))|related(A,C,$f5(A,B,C)).
% 2.08/2.30 0 [] empty_carrier(A)| -rel_str(A)|directed_relstr(A)|element($f7(A),the_carrier(A)).
% 2.08/2.30 0 [] empty_carrier(A)| -rel_str(A)|directed_relstr(A)|element($f6(A),the_carrier(A)).
% 2.08/2.30 0 [] empty_carrier(A)| -rel_str(A)|directed_relstr(A)| -element(D,the_carrier(A))| -related(A,$f7(A),D)| -related(A,$f6(A),D).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -element(C,the_carrier(B))|apply_netmap(A,B,C)=apply_on_structs(B,A,the_mapping(A,B),C).
% 2.08/2.30 0 [] $T.
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -one_sorted_str(B)| -function(C)| -quasi_total(C,the_carrier(A),the_carrier(B))| -relation_of2(C,the_carrier(A),the_carrier(B))| -element(D,the_carrier(A))|element(apply_on_structs(A,B,C,D),the_carrier(B)).
% 2.08/2.30 0 [] $T.
% 2.08/2.30 0 [] $T.
% 2.08/2.30 0 [] $T.
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -element(C,the_carrier(B))|element(apply_netmap(A,B,C),the_carrier(A)).
% 2.08/2.30 0 [] -rel_str(A)|one_sorted_str(A).
% 2.08/2.30 0 [] $T.
% 2.08/2.30 0 [] -one_sorted_str(A)| -net_str(B,A)|rel_str(B).
% 2.08/2.30 0 [] $T.
% 2.08/2.30 0 [] $T.
% 2.08/2.30 0 [] -relation_of2_as_subset(C,A,B)|element(C,powerset(cartesian_product2(A,B))).
% 2.08/2.30 0 [] $T.
% 2.08/2.30 0 [] -one_sorted_str(A)| -net_str(B,A)|function(the_mapping(A,B)).
% 2.08/2.30 0 [] -one_sorted_str(A)| -net_str(B,A)|quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 2.08/2.30 0 [] -one_sorted_str(A)| -net_str(B,A)|relation_of2_as_subset(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 2.08/2.30 0 [] rel_str($c1).
% 2.08/2.30 0 [] one_sorted_str($c2).
% 2.08/2.30 0 [] -one_sorted_str(A)|net_str($f8(A),A).
% 2.08/2.30 0 [] relation_of2($f9(A,B),A,B).
% 2.08/2.30 0 [] element($f10(A),A).
% 2.08/2.30 0 [] relation_of2_as_subset($f11(A,B),A,B).
% 2.08/2.30 0 [] empty(empty_set).
% 2.08/2.30 0 [] relation(empty_set).
% 2.08/2.30 0 [] relation_empty_yielding(empty_set).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -empty(the_mapping(A,B)).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|relation(the_mapping(A,B)).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|function(the_mapping(A,B)).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 2.08/2.30 0 [] -empty(powerset(A)).
% 2.08/2.30 0 [] empty(empty_set).
% 2.08/2.30 0 [] relation(empty_set).
% 2.08/2.30 0 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 2.08/2.30 0 [] relation($c3).
% 2.08/2.30 0 [] function($c3).
% 2.08/2.30 0 [] relation($c4).
% 2.08/2.30 0 [] relation_empty_yielding($c4).
% 2.08/2.30 0 [] function($c4).
% 2.08/2.30 0 [] empty($c5).
% 2.08/2.30 0 [] relation($c5).
% 2.08/2.30 0 [] empty(A)|element($f12(A),powerset(A)).
% 2.08/2.30 0 [] empty(A)| -empty($f12(A)).
% 2.08/2.30 0 [] relation($c6).
% 2.08/2.30 0 [] empty($c6).
% 2.08/2.30 0 [] function($c6).
% 2.08/2.30 0 [] -empty($c7).
% 2.08/2.30 0 [] relation($c7).
% 2.08/2.30 0 [] element($f13(A),powerset(A)).
% 2.08/2.30 0 [] empty($f13(A)).
% 2.08/2.30 0 [] relation($c8).
% 2.08/2.30 0 [] function($c8).
% 2.08/2.30 0 [] one_to_one($c8).
% 2.08/2.30 0 [] relation($c9).
% 2.08/2.30 0 [] relation_empty_yielding($c9).
% 2.08/2.30 0 [] one_sorted_str($c10).
% 2.08/2.30 0 [] -empty_carrier($c10).
% 2.08/2.30 0 [] relation($c11).
% 2.08/2.30 0 [] relation_empty_yielding($c11).
% 2.08/2.30 0 [] function($c11).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|element($f14(A),powerset(the_carrier(A))).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty($f14(A)).
% 2.08/2.30 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -one_sorted_str(B)| -function(C)| -quasi_total(C,the_carrier(A),the_carrier(B))| -relation_of2(C,the_carrier(A),the_carrier(B))| -element(D,the_carrier(A))|apply_on_structs(A,B,C,D)=apply(C,D).
% 2.08/2.30 0 [] -relation_of2_as_subset(C,A,B)|relation_of2(C,A,B).
% 2.08/2.30 0 [] relation_of2_as_subset(C,A,B)| -relation_of2(C,A,B).
% 2.08/2.30 0 [] subset(A,A).
% 2.08/2.30 0 [] -in(A,B)|element(A,B).
% 2.08/2.30 0 [] -empty_carrier($c14).
% 2.08/2.30 0 [] one_sorted_str($c14).
% 2.08/2.30 0 [] -empty_carrier($c13).
% 2.08/2.30 0 [] transitive_relstr($c13).
% 2.08/2.30 0 [] directed_relstr($c13).
% 2.08/2.30 0 [] net_str($c13,$c14).
% 2.08/2.30 0 [] is_eventually_in($c14,$c13,$c12).
% 2.08/2.30 0 [] -is_often_in($c14,$c13,$c12).
% 2.08/2.30 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.08/2.30 0 [] -element(A,powerset(B))|subset(A,B).
% 2.08/2.30 0 [] element(A,powerset(B))| -subset(A,B).
% 2.08/2.30 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.08/2.30 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.08/2.30 0 [] -empty(A)|A=empty_set.
% 2.08/2.30 0 [] -in(A,B)| -empty(B).
% 2.08/2.30 0 [] -empty(A)|A=B| -empty(B).
% 2.08/2.30 end_of_list.
% 2.08/2.30
% 2.08/2.30 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 2.08/2.30
% 2.08/2.30 This ia a non-Horn set with equality. The strategy will be
% 2.08/2.30 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.08/2.30 deletion, with positive clauses in sos and nonpositive
% 2.08/2.30 clauses in usable.
% 2.08/2.30
% 2.08/2.30 dependent: set(knuth_bendix).
% 2.08/2.30 dependent: set(anl_eq).
% 2.08/2.30 dependent: set(para_from).
% 2.08/2.30 dependent: set(para_into).
% 2.08/2.30 dependent: clear(para_from_right).
% 2.08/2.30 dependent: clear(para_into_right).
% 2.08/2.30 dependent: set(para_from_vars).
% 2.08/2.30 dependent: set(eq_units_both_ways).
% 2.08/2.30 dependent: set(dynamic_demod_all).
% 2.08/2.30 dependent: set(dynamic_demod).
% 2.08/2.30 dependent: set(order_eq).
% 2.08/2.30 dependent: set(back_demod).
% 2.08/2.30 dependent: set(lrpo).
% 2.08/2.30 dependent: set(hyper_res).
% 2.08/2.30 dependent: set(unit_deletion).
% 2.08/2.30 dependent: set(factor).
% 2.08/2.30
% 2.08/2.30 ------------> process usable:
% 2.08/2.30 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.08/2.30 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 2.13/2.31 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 2.13/2.31 ** KEPT (pick-wt=8): 4 [] -element(A,powerset(cartesian_product2(B,C)))|relation(A).
% 2.13/2.31 ** KEPT (pick-wt=6): 5 [] -rel_str(A)| -empty_carrier(A)|v1_yellow_3(A).
% 2.13/2.31 ** KEPT (pick-wt=8): 6 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.13/2.31 Following clause subsumed by 5 during input processing: 0 [] -rel_str(A)|v1_yellow_3(A)| -empty_carrier(A).
% 2.13/2.31 ** KEPT (pick-wt=20): 7 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -is_eventually_in(A,B,C)|element($f1(A,B,C),the_carrier(B)).
% 2.13/2.31 ** KEPT (pick-wt=30): 8 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -is_eventually_in(A,B,C)| -element(D,the_carrier(B))| -related(B,$f1(A,B,C),D)|in(apply_netmap(A,B,D),C).
% 2.13/2.31 ** KEPT (pick-wt=25): 9 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|is_eventually_in(A,B,C)| -element(D,the_carrier(B))|element($f2(A,B,C,D),the_carrier(B)).
% 2.13/2.31 ** KEPT (pick-wt=25): 10 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|is_eventually_in(A,B,C)| -element(D,the_carrier(B))|related(B,D,$f2(A,B,C,D)).
% 2.13/2.31 ** KEPT (pick-wt=27): 11 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|is_eventually_in(A,B,C)| -element(D,the_carrier(B))| -in(apply_netmap(A,B,$f2(A,B,C,D)),C).
% 2.13/2.31 ** KEPT (pick-wt=25): 12 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -is_often_in(A,B,C)| -element(D,the_carrier(B))|element($f3(A,B,C,D),the_carrier(B)).
% 2.13/2.31 ** KEPT (pick-wt=25): 13 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -is_often_in(A,B,C)| -element(D,the_carrier(B))|related(B,D,$f3(A,B,C,D)).
% 2.13/2.31 ** KEPT (pick-wt=27): 14 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -is_often_in(A,B,C)| -element(D,the_carrier(B))|in(apply_netmap(A,B,$f3(A,B,C,D)),C).
% 2.13/2.31 ** KEPT (pick-wt=20): 15 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|is_often_in(A,B,C)|element($f4(A,B,C),the_carrier(B)).
% 2.13/2.31 ** KEPT (pick-wt=30): 16 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|is_often_in(A,B,C)| -element(D,the_carrier(B))| -related(B,$f4(A,B,C),D)| -in(apply_netmap(A,B,D),C).
% 2.13/2.31 ** KEPT (pick-wt=21): 17 [] empty_carrier(A)| -rel_str(A)| -directed_relstr(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))|element($f5(A,B,C),the_carrier(A)).
% 2.13/2.31 ** KEPT (pick-wt=21): 18 [] empty_carrier(A)| -rel_str(A)| -directed_relstr(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))|related(A,B,$f5(A,B,C)).
% 2.13/2.31 ** KEPT (pick-wt=21): 19 [] empty_carrier(A)| -rel_str(A)| -directed_relstr(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))|related(A,C,$f5(A,B,C)).
% 2.13/2.31 ** KEPT (pick-wt=11): 20 [] empty_carrier(A)| -rel_str(A)|directed_relstr(A)|element($f7(A),the_carrier(A)).
% 2.13/2.31 ** KEPT (pick-wt=11): 21 [] empty_carrier(A)| -rel_str(A)|directed_relstr(A)|element($f6(A),the_carrier(A)).
% 2.13/2.31 ** KEPT (pick-wt=20): 22 [] empty_carrier(A)| -rel_str(A)|directed_relstr(A)| -element(B,the_carrier(A))| -related(A,$f7(A),B)| -related(A,$f6(A),B).
% 2.13/2.31 ** KEPT (pick-wt=25): 23 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -element(C,the_carrier(B))|apply_netmap(A,B,C)=apply_on_structs(B,A,the_mapping(A,B),C).
% 2.13/2.31 ** KEPT (pick-wt=34): 24 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -one_sorted_str(B)| -function(C)| -quasi_total(C,the_carrier(A),the_carrier(B))| -relation_of2(C,the_carrier(A),the_carrier(B))| -element(D,the_carrier(A))|element(apply_on_structs(A,B,C,D),the_carrier(B)).
% 2.13/2.31 ** KEPT (pick-wt=20): 25 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -element(C,the_carrier(B))|element(apply_netmap(A,B,C),the_carrier(A)).
% 2.13/2.31 ** KEPT (pick-wt=4): 26 [] -rel_str(A)|one_sorted_str(A).
% 2.13/2.31 ** KEPT (pick-wt=7): 27 [] -one_sorted_str(A)| -net_str(B,A)|rel_str(B).
% 2.13/2.31 ** KEPT (pick-wt=10): 28 [] -relation_of2_as_subset(A,B,C)|element(A,powerset(cartesian_product2(B,C))).
% 2.13/2.31 ** KEPT (pick-wt=9): 29 [] -one_sorted_str(A)| -net_str(B,A)|function(the_mapping(A,B)).
% 2.13/2.31 ** KEPT (pick-wt=13): 30 [] -one_sorted_str(A)| -net_str(B,A)|quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 2.13/2.31 ** KEPT (pick-wt=13): 31 [] -one_sorted_str(A)| -net_str(B,A)|relation_of2_as_subset(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 2.13/2.31 ** KEPT (pick-wt=6): 32 [] -one_sorted_str(A)|net_str($f8(A),A).
% 2.13/2.31 ** KEPT (pick-wt=13): 33 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)| -empty(the_mapping(A,B)).
% 2.13/2.31 ** KEPT (pick-wt=13): 34 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|relation(the_mapping(A,B)).
% 2.13/2.31 Following clause subsumed by 29 during input processing: 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|function(the_mapping(A,B)).
% 2.13/2.31 Following clause subsumed by 30 during input processing: 0 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -net_str(B,A)|quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 2.13/2.31 ** KEPT (pick-wt=7): 35 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 2.13/2.31 ** KEPT (pick-wt=3): 36 [] -empty(powerset(A)).
% 2.13/2.31 ** KEPT (pick-wt=8): 37 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 2.13/2.31 ** KEPT (pick-wt=5): 38 [] empty(A)| -empty($f12(A)).
% 2.13/2.31 ** KEPT (pick-wt=2): 39 [] -empty($c7).
% 2.13/2.31 ** KEPT (pick-wt=2): 40 [] -empty_carrier($c10).
% 2.13/2.31 ** KEPT (pick-wt=10): 41 [] empty_carrier(A)| -one_sorted_str(A)|element($f14(A),powerset(the_carrier(A))).
% 2.13/2.31 ** KEPT (pick-wt=7): 42 [] empty_carrier(A)| -one_sorted_str(A)| -empty($f14(A)).
% 2.13/2.31 ** KEPT (pick-wt=35): 43 [] empty_carrier(A)| -one_sorted_str(A)|empty_carrier(B)| -one_sorted_str(B)| -function(C)| -quasi_total(C,the_carrier(A),the_carrier(B))| -relation_of2(C,the_carrier(A),the_carrier(B))| -element(D,the_carrier(A))|apply_on_structs(A,B,C,D)=apply(C,D).
% 2.13/2.31 ** KEPT (pick-wt=8): 44 [] -relation_of2_as_subset(A,B,C)|relation_of2(A,B,C).
% 2.13/2.31 ** KEPT (pick-wt=8): 45 [] relation_of2_as_subset(A,B,C)| -relation_of2(A,B,C).
% 2.13/2.31 ** KEPT (pick-wt=6): 46 [] -in(A,B)|element(A,B).
% 2.13/2.31 ** KEPT (pick-wt=2): 47 [] -empty_carrier($c14).
% 2.13/2.31 ** KEPT (pick-wt=2): 48 [] -empty_carrier($c13).
% 2.13/2.31 ** KEPT (pick-wt=4): 49 [] -is_often_in($c14,$c13,$c12).
% 2.13/2.31 ** KEPT (pick-wt=8): 50 [] -element(A,B)|empty(B)|in(A,B).
% 2.13/2.31 ** KEPT (pick-wt=7): 51 [] -element(A,powerset(B))|subset(A,B).
% 2.13/2.31 ** KEPT (pick-wt=7): 52 [] element(A,powerset(B))| -subset(A,B).
% 2.13/2.31 ** KEPT (pick-wt=10): 53 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.13/2.31 ** KEPT (pick-wt=9): 54 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.13/2.31 ** KEPT (pick-wt=5): 55 [] -empty(A)|A=empty_set.
% 2.13/2.31 ** KEPT (pick-wt=5): 56 [] -in(A,B)| -empty(B).
% 2.13/2.31 ** KEPT (pick-wt=7): 57 [] -empty(A)|A=B| -empty(B).
% 2.13/2.31
% 2.13/2.31 ------------> process sos:
% 2.13/2.31 ** KEPT (pick-wt=3): 79 [] A=A.
% 2.13/2.31 ** KEPT (pick-wt=2): 80 [] rel_str($c1).
% 2.13/2.31 ** KEPT (pick-wt=2): 81 [] one_sorted_str($c2).
% 2.13/2.31 ** KEPT (pick-wt=6): 82 [] relation_of2($f9(A,B),A,B).
% 2.13/2.31 ** KEPT (pick-wt=4): 83 [] element($f10(A),A).
% 2.13/2.31 ** KEPT (pick-wt=6): 84 [] relation_of2_as_subset($f11(A,B),A,B).
% 2.13/2.31 ** KEPT (pick-wt=2): 85 [] empty(empty_set).
% 2.13/2.31 ** KEPT (pick-wt=2): 86 [] relation(empty_set).
% 2.13/2.31 ** KEPT (pick-wt=2): 87 [] relation_empty_yielding(empty_set).
% 2.13/2.31 Following clause subsumed by 85 during input processing: 0 [] empty(empty_set).
% 2.13/2.31 Following clause subsumed by 86 during input processing: 0 [] relation(empty_set).
% 2.13/2.31 ** KEPT (pick-wt=2): 88 [] relation($c3).
% 2.13/2.31 ** KEPT (pick-wt=2): 89 [] function($c3).
% 2.13/2.31 ** KEPT (pick-wt=2): 90 [] relation($c4).
% 2.13/2.31 ** KEPT (pick-wt=2): 91 [] relation_empty_yielding($c4).
% 2.13/2.31 ** KEPT (pick-wt=2): 92 [] function($c4).
% 2.13/2.31 ** KEPT (pick-wt=2): 93 [] empty($c5).
% 2.13/2.31 ** KEPT (pick-wt=2): 94 [] relation($c5).
% 2.13/2.31 ** KEPT (pick-wt=7): 95 [] empty(A)|element($f12(A),powerset(A)).
% 2.13/2.31 ** KEPT (pick-wt=2): 96 [] relation($c6).
% 2.13/2.31 ** KEPT (pick-wt=2): 97 [] empty($c6).
% 2.13/2.31 ** KEPT (pick-wt=2): 98 [] function($c6).
% 2.13/2.31 ** KEPT (pick-wt=2): 99 [] relation($c7).
% 2.13/2.31 ** KEPT (pick-wt=5): 100 [] element($f13(A),powerset(A)).
% 2.13/2.31 ** KEPT (pick-wt=3): 101 [] empty($f13(A)).
% 2.13/2.31 ** KEPT (pick-wt=2): 102 [] relation($c8).
% 2.13/2.31 ** KEPT (pick-wt=2): 103 [] function($c8).
% 2.13/2.31 ** KEPT (pick-wt=2): 104 [] one_to_one($c8).
% 2.13/2.31 ** KEPT (pick-wt=2): 105 [] relation($c9).
% 2.13/2.31 ** KEPT (pick-wt=2): 106 [] relation_empty_yielding($c9).
% 2.13/2.31 ** KEPT (pick-wt=2): 107 [] one_sorted_str($c10).
% 35.72/35.95 ** KEPT (pick-wt=2): 108 [] relation($c11).
% 35.72/35.95 ** KEPT (pick-wt=2): 109 [] relation_empty_yielding($c11).
% 35.72/35.95 ** KEPT (pick-wt=2): 110 [] function($c11).
% 35.72/35.95 ** KEPT (pick-wt=3): 111 [] subset(A,A).
% 35.72/35.95 ** KEPT (pick-wt=2): 112 [] one_sorted_str($c14).
% 35.72/35.95 ** KEPT (pick-wt=2): 113 [] transitive_relstr($c13).
% 35.72/35.95 ** KEPT (pick-wt=2): 114 [] directed_relstr($c13).
% 35.72/35.95 ** KEPT (pick-wt=3): 115 [] net_str($c13,$c14).
% 35.72/35.95 ** KEPT (pick-wt=4): 116 [] is_eventually_in($c14,$c13,$c12).
% 35.72/35.95 Following clause subsumed by 79 during input processing: 0 [copy,79,flip.1] A=A.
% 35.72/35.95 79 back subsumes 78.
% 35.72/35.95
% 35.72/35.95 ======= end of input processing =======
% 35.72/35.95
% 35.72/35.95 =========== start of search ===========
% 35.72/35.95
% 35.72/35.95
% 35.72/35.95 Resetting weight limit to 6.
% 35.72/35.95
% 35.72/35.95
% 35.72/35.95 Resetting weight limit to 6.
% 35.72/35.95
% 35.72/35.95 sos_size=583
% 35.72/35.95
% 35.72/35.95 Search stopped because sos empty.
% 35.72/35.95
% 35.72/35.95
% 35.72/35.95 Search stopped because sos empty.
% 35.72/35.95
% 35.72/35.95 ============ end of search ============
% 35.72/35.95
% 35.72/35.95 -------------- statistics -------------
% 35.72/35.95 clauses given 779
% 35.72/35.95 clauses generated 1461901
% 35.72/35.95 clauses kept 875
% 35.72/35.95 clauses forward subsumed 1048
% 35.72/35.95 clauses back subsumed 7
% 35.72/35.95 Kbytes malloced 8789
% 35.72/35.95
% 35.72/35.95 ----------- times (seconds) -----------
% 35.72/35.95 user CPU time 33.65 (0 hr, 0 min, 33 sec)
% 35.72/35.95 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 35.72/35.95 wall-clock time 36 (0 hr, 0 min, 36 sec)
% 35.72/35.95
% 35.72/35.95 Process 14667 finished Wed Jul 27 08:01:47 2022
% 35.72/35.95 Otter interrupted
% 35.72/35.95 PROOF NOT FOUND
%------------------------------------------------------------------------------