TSTP Solution File: SEU367+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU367+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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:53 EDT 2022
% Result : Unknown 6.62s 6.86s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU367+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n005.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:03:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.93/2.11 ----- Otter 3.3f, August 2004 -----
% 1.93/2.11 The process was started by sandbox2 on n005.cluster.edu,
% 1.93/2.11 Wed Jul 27 08:03:50 2022
% 1.93/2.11 The command was "./otter". The process ID is 27287.
% 1.93/2.11
% 1.93/2.11 set(prolog_style_variables).
% 1.93/2.11 set(auto).
% 1.93/2.11 dependent: set(auto1).
% 1.93/2.11 dependent: set(process_input).
% 1.93/2.11 dependent: clear(print_kept).
% 1.93/2.11 dependent: clear(print_new_demod).
% 1.93/2.11 dependent: clear(print_back_demod).
% 1.93/2.11 dependent: clear(print_back_sub).
% 1.93/2.11 dependent: set(control_memory).
% 1.93/2.11 dependent: assign(max_mem, 12000).
% 1.93/2.11 dependent: assign(pick_given_ratio, 4).
% 1.93/2.11 dependent: assign(stats_level, 1).
% 1.93/2.11 dependent: assign(max_seconds, 10800).
% 1.93/2.11 clear(print_given).
% 1.93/2.11
% 1.93/2.11 formula_list(usable).
% 1.93/2.11 all A (A=A).
% 1.93/2.11 all A B (in(A,B)-> -in(B,A)).
% 1.93/2.11 all A (empty(A)->finite(A)).
% 1.93/2.11 all A B C (element(C,powerset(cartesian_product2(A,B)))->relation(C)).
% 1.93/2.11 all A (finite(A)-> (all B (element(B,powerset(A))->finite(B)))).
% 1.93/2.11 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))))))))))).
% 1.93/2.11 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)))))))))).
% 1.93/2.11 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)))))).
% 1.93/2.11 $T.
% 1.93/2.11 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))).
% 1.93/2.11 $T.
% 1.93/2.11 $T.
% 1.93/2.11 $T.
% 1.93/2.11 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))).
% 1.93/2.11 all A (rel_str(A)->one_sorted_str(A)).
% 1.93/2.11 $T.
% 1.93/2.11 all A (one_sorted_str(A)-> (all B (net_str(B,A)->rel_str(B)))).
% 1.93/2.11 $T.
% 1.93/2.11 $T.
% 1.93/2.11 all A B C (relation_of2_as_subset(C,A,B)->element(C,powerset(cartesian_product2(A,B)))).
% 1.93/2.11 $T.
% 1.93/2.11 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))).
% 1.93/2.11 exists A rel_str(A).
% 1.93/2.11 exists A one_sorted_str(A).
% 1.93/2.11 all A (one_sorted_str(A)-> (exists B net_str(B,A))).
% 1.93/2.11 all A B exists C relation_of2(C,A,B).
% 1.93/2.11 all A exists B element(B,A).
% 1.93/2.11 all A B exists C relation_of2_as_subset(C,A,B).
% 1.93/2.11 all A B (finite(A)&finite(B)->finite(cartesian_product2(A,B))).
% 1.93/2.11 all A (-empty_carrier(A)&one_sorted_str(A)-> -empty(the_carrier(A))).
% 1.93/2.11 all A (-empty(powerset(A))).
% 1.93/2.11 empty(empty_set).
% 1.93/2.11 all A B (-empty(A)& -empty(B)-> -empty(cartesian_product2(A,B))).
% 1.93/2.11 exists A (-empty(A)&finite(A)).
% 1.93/2.11 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.93/2.11 exists A empty(A).
% 1.93/2.11 all A exists B (element(B,powerset(A))&empty(B)).
% 1.93/2.11 exists A (-empty(A)).
% 1.93/2.11 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 1.93/2.11 exists A (one_sorted_str(A)& -empty_carrier(A)).
% 1.93/2.11 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 1.93/2.11 all A (-empty_carrier(A)&one_sorted_str(A)-> (exists B (element(B,powerset(the_carrier(A)))& -empty(B)))).
% 1.93/2.11 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)).
% 1.93/2.11 all A B C (relation_of2_as_subset(C,A,B)<->relation_of2(C,A,B)).
% 1.93/2.11 all A B subset(A,A).
% 1.93/2.11 all A B (in(A,B)->element(A,B)).
% 1.93/2.11 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.93/2.11 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.93/2.11 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.93/2.11 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.93/2.11 all A (empty(A)->A=empty_set).
% 1.93/2.11 all A B (-(in(A,B)&empty(B))).
% 1.93/2.11 all A B (-(empty(A)&A!=B&empty(B))).
% 1.93/2.11 -(all A (-empty_carrier(A)&one_sorted_str(A)-> (all B (-empty_carrier(B)&net_str(B,A)-> (all C D (subset(C,D)-> (is_eventually_in(A,B,C)->is_eventually_in(A,B,D))& (is_often_in(A,B,C)->is_often_in(A,B,D)))))))).
% 1.93/2.11 end_of_list.
% 1.93/2.11
% 1.93/2.11 -------> usable clausifies to:
% 1.93/2.11
% 1.93/2.11 list(usable).
% 1.93/2.11 0 [] A=A.
% 1.93/2.11 0 [] -in(A,B)| -in(B,A).
% 1.93/2.11 0 [] -empty(A)|finite(A).
% 1.93/2.11 0 [] -element(C,powerset(cartesian_product2(A,B)))|relation(C).
% 1.93/2.11 0 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 1.93/2.11 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)).
% 1.93/2.11 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).
% 1.93/2.11 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)).
% 1.93/2.11 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)).
% 1.93/2.11 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).
% 1.93/2.11 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)).
% 1.93/2.11 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)).
% 1.93/2.11 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).
% 1.93/2.11 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)).
% 1.93/2.11 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).
% 1.93/2.11 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).
% 1.93/2.11 0 [] $T.
% 1.93/2.11 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)).
% 1.93/2.11 0 [] $T.
% 1.93/2.11 0 [] $T.
% 1.93/2.11 0 [] $T.
% 1.93/2.11 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)).
% 1.93/2.11 0 [] -rel_str(A)|one_sorted_str(A).
% 1.93/2.11 0 [] $T.
% 1.93/2.11 0 [] -one_sorted_str(A)| -net_str(B,A)|rel_str(B).
% 1.93/2.11 0 [] $T.
% 1.93/2.11 0 [] $T.
% 1.93/2.11 0 [] -relation_of2_as_subset(C,A,B)|element(C,powerset(cartesian_product2(A,B))).
% 1.93/2.11 0 [] $T.
% 1.93/2.11 0 [] -one_sorted_str(A)| -net_str(B,A)|function(the_mapping(A,B)).
% 1.93/2.11 0 [] -one_sorted_str(A)| -net_str(B,A)|quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 1.93/2.11 0 [] -one_sorted_str(A)| -net_str(B,A)|relation_of2_as_subset(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 1.93/2.11 0 [] rel_str($c1).
% 1.93/2.11 0 [] one_sorted_str($c2).
% 1.93/2.11 0 [] -one_sorted_str(A)|net_str($f5(A),A).
% 1.93/2.11 0 [] relation_of2($f6(A,B),A,B).
% 1.93/2.11 0 [] element($f7(A),A).
% 1.93/2.11 0 [] relation_of2_as_subset($f8(A,B),A,B).
% 1.93/2.11 0 [] -finite(A)| -finite(B)|finite(cartesian_product2(A,B)).
% 1.93/2.11 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 1.93/2.11 0 [] -empty(powerset(A)).
% 1.93/2.11 0 [] empty(empty_set).
% 1.93/2.11 0 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 1.93/2.11 0 [] -empty($c3).
% 1.93/2.11 0 [] finite($c3).
% 1.93/2.11 0 [] empty(A)|element($f9(A),powerset(A)).
% 1.93/2.11 0 [] empty(A)| -empty($f9(A)).
% 1.93/2.11 0 [] empty($c4).
% 1.93/2.11 0 [] element($f10(A),powerset(A)).
% 1.93/2.11 0 [] empty($f10(A)).
% 1.93/2.11 0 [] -empty($c5).
% 1.93/2.11 0 [] empty(A)|element($f11(A),powerset(A)).
% 1.93/2.11 0 [] empty(A)| -empty($f11(A)).
% 1.93/2.11 0 [] empty(A)|finite($f11(A)).
% 1.93/2.11 0 [] one_sorted_str($c6).
% 1.93/2.11 0 [] -empty_carrier($c6).
% 1.93/2.11 0 [] empty(A)|element($f12(A),powerset(A)).
% 1.93/2.11 0 [] empty(A)| -empty($f12(A)).
% 1.93/2.11 0 [] empty(A)|finite($f12(A)).
% 1.93/2.11 0 [] empty_carrier(A)| -one_sorted_str(A)|element($f13(A),powerset(the_carrier(A))).
% 1.93/2.11 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty($f13(A)).
% 1.93/2.11 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).
% 1.93/2.11 0 [] -relation_of2_as_subset(C,A,B)|relation_of2(C,A,B).
% 1.93/2.11 0 [] relation_of2_as_subset(C,A,B)| -relation_of2(C,A,B).
% 1.93/2.11 0 [] subset(A,A).
% 1.93/2.11 0 [] -in(A,B)|element(A,B).
% 1.93/2.11 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.93/2.11 0 [] -element(A,powerset(B))|subset(A,B).
% 1.93/2.11 0 [] element(A,powerset(B))| -subset(A,B).
% 1.93/2.11 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.93/2.11 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.93/2.11 0 [] -empty(A)|A=empty_set.
% 1.93/2.11 0 [] -in(A,B)| -empty(B).
% 1.93/2.11 0 [] -empty(A)|A=B| -empty(B).
% 1.93/2.11 0 [] -empty_carrier($c10).
% 1.93/2.11 0 [] one_sorted_str($c10).
% 1.93/2.11 0 [] -empty_carrier($c9).
% 1.93/2.11 0 [] net_str($c9,$c10).
% 1.93/2.11 0 [] subset($c8,$c7).
% 1.93/2.11 0 [] is_eventually_in($c10,$c9,$c8)|is_often_in($c10,$c9,$c8).
% 1.93/2.11 0 [] is_eventually_in($c10,$c9,$c8)| -is_often_in($c10,$c9,$c7).
% 1.93/2.11 0 [] -is_eventually_in($c10,$c9,$c7)|is_often_in($c10,$c9,$c8).
% 1.93/2.11 0 [] -is_eventually_in($c10,$c9,$c7)| -is_often_in($c10,$c9,$c7).
% 1.93/2.11 end_of_list.
% 1.93/2.11
% 1.93/2.11 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 1.93/2.11
% 1.93/2.11 This ia a non-Horn set with equality. The strategy will be
% 1.93/2.11 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.93/2.11 deletion, with positive clauses in sos and nonpositive
% 1.93/2.11 clauses in usable.
% 1.93/2.11
% 1.93/2.11 dependent: set(knuth_bendix).
% 1.93/2.11 dependent: set(anl_eq).
% 1.93/2.11 dependent: set(para_from).
% 1.93/2.11 dependent: set(para_into).
% 1.93/2.11 dependent: clear(para_from_right).
% 1.93/2.11 dependent: clear(para_into_right).
% 1.93/2.11 dependent: set(para_from_vars).
% 1.93/2.11 dependent: set(eq_units_both_ways).
% 1.93/2.11 dependent: set(dynamic_demod_all).
% 1.93/2.11 dependent: set(dynamic_demod).
% 1.93/2.11 dependent: set(order_eq).
% 1.93/2.11 dependent: set(back_demod).
% 1.93/2.11 dependent: set(lrpo).
% 1.93/2.11 dependent: set(hyper_res).
% 1.93/2.11 dependent: set(unit_deletion).
% 1.93/2.11 dependent: set(factor).
% 1.93/2.11
% 1.93/2.11 ------------> process usable:
% 1.93/2.11 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.93/2.11 ** KEPT (pick-wt=4): 2 [] -empty(A)|finite(A).
% 1.93/2.11 ** KEPT (pick-wt=8): 3 [] -element(A,powerset(cartesian_product2(B,C)))|relation(A).
% 1.93/2.11 ** KEPT (pick-wt=8): 4 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 1.93/2.11 ** KEPT (pick-wt=20): 5 [] 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)).
% 1.93/2.11 ** KEPT (pick-wt=30): 6 [] 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).
% 1.93/2.11 ** KEPT (pick-wt=25): 7 [] 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)).
% 1.93/2.11 ** KEPT (pick-wt=25): 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,D,$f2(A,B,C,D)).
% 1.93/2.11 ** KEPT (pick-wt=27): 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))| -in(apply_netmap(A,B,$f2(A,B,C,D)),C).
% 1.93/2.11 ** KEPT (pick-wt=25): 10 [] 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)).
% 1.93/2.11 ** KEPT (pick-wt=25): 11 [] 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)).
% 1.93/2.11 ** KEPT (pick-wt=27): 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))|in(apply_netmap(A,B,$f3(A,B,C,D)),C).
% 1.93/2.11 ** KEPT (pick-wt=20): 13 [] 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)).
% 1.93/2.11 ** KEPT (pick-wt=30): 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))| -related(B,$f4(A,B,C),D)| -in(apply_netmap(A,B,D),C).
% 1.93/2.11 ** KEPT (pick-wt=25): 15 [] 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).
% 1.93/2.11 ** KEPT (pick-wt=34): 16 [] 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)).
% 1.93/2.11 ** KEPT (pick-wt=20): 17 [] 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)).
% 1.93/2.11 ** KEPT (pick-wt=4): 18 [] -rel_str(A)|one_sorted_str(A).
% 1.93/2.11 ** KEPT (pick-wt=7): 19 [] -one_sorted_str(A)| -net_str(B,A)|rel_str(B).
% 1.93/2.11 ** KEPT (pick-wt=10): 20 [] -relation_of2_as_subset(A,B,C)|element(A,powerset(cartesian_product2(B,C))).
% 1.93/2.11 ** KEPT (pick-wt=9): 21 [] -one_sorted_str(A)| -net_str(B,A)|function(the_mapping(A,B)).
% 1.93/2.11 ** KEPT (pick-wt=13): 22 [] -one_sorted_str(A)| -net_str(B,A)|quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 1.93/2.11 ** KEPT (pick-wt=13): 23 [] -one_sorted_str(A)| -net_str(B,A)|relation_of2_as_subset(the_mapping(A,B),the_carrier(B),the_carrier(A)).
% 1.93/2.11 ** KEPT (pick-wt=6): 24 [] -one_sorted_str(A)|net_str($f5(A),A).
% 1.93/2.11 ** KEPT (pick-wt=8): 25 [] -finite(A)| -finite(B)|finite(cartesian_product2(A,B)).
% 1.93/2.11 ** KEPT (pick-wt=7): 26 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 1.93/2.11 ** KEPT (pick-wt=3): 27 [] -empty(powerset(A)).
% 1.93/2.11 ** KEPT (pick-wt=8): 28 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 1.93/2.11 ** KEPT (pick-wt=2): 29 [] -empty($c3).
% 1.93/2.11 ** KEPT (pick-wt=5): 30 [] empty(A)| -empty($f9(A)).
% 1.93/2.11 ** KEPT (pick-wt=2): 31 [] -empty($c5).
% 1.93/2.11 ** KEPT (pick-wt=5): 32 [] empty(A)| -empty($f11(A)).
% 1.93/2.11 ** KEPT (pick-wt=2): 33 [] -empty_carrier($c6).
% 1.93/2.11 ** KEPT (pick-wt=5): 34 [] empty(A)| -empty($f12(A)).
% 1.93/2.11 ** KEPT (pick-wt=10): 35 [] empty_carrier(A)| -one_sorted_str(A)|element($f13(A),powerset(the_carrier(A))).
% 1.93/2.11 ** KEPT (pick-wt=7): 36 [] empty_carrier(A)| -one_sorted_str(A)| -empty($f13(A)).
% 1.93/2.11 ** KEPT (pick-wt=35): 37 [] 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).
% 1.93/2.11 ** KEPT (pick-wt=8): 38 [] -relation_of2_as_subset(A,B,C)|relation_of2(A,B,C).
% 1.93/2.11 ** KEPT (pick-wt=8): 39 [] relation_of2_as_subset(A,B,C)| -relation_of2(A,B,C).
% 1.93/2.11 ** KEPT (pick-wt=6): 40 [] -in(A,B)|element(A,B).
% 1.93/2.11 ** KEPT (pick-wt=8): 41 [] -element(A,B)|empty(B)|in(A,B).
% 1.93/2.11 ** KEPT (pick-wt=7): 42 [] -element(A,powerset(B))|subset(A,B).
% 1.93/2.11 ** KEPT (pick-wt=7): 43 [] element(A,powerset(B))| -subset(A,B).
% 1.93/2.11 ** KEPT (pick-wt=10): 44 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.93/2.11 ** KEPT (pick-wt=9): 45 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.93/2.11 ** KEPT (pick-wt=5): 46 [] -empty(A)|A=empty_set.
% 1.93/2.11 ** KEPT (pick-wt=5): 47 [] -in(A,B)| -empty(B).
% 1.93/2.11 ** KEPT (pick-wt=7): 48 [] -empty(A)|A=B| -empty(B).
% 1.93/2.11 ** KEPT (pick-wt=2): 49 [] -empty_carrier($c10).
% 1.93/2.11 ** KEPT (pick-wt=2): 50 [] -empty_carrier($c9).
% 1.93/2.11 ** KEPT (pick-wt=8): 51 [] is_eventually_in($c10,$c9,$c8)| -is_often_in($c10,$c9,$c7).
% 1.93/2.11 ** KEPT (pick-wt=8): 52 [] -is_eventually_in($c10,$c9,$c7)|is_often_in($c10,$c9,$c8).
% 1.93/2.11 ** KEPT (pick-wt=8): 53 [] -is_eventually_in($c10,$c9,$c7)| -is_often_in($c10,$c9,$c7).
% 1.93/2.11
% 1.93/2.11 ------------> process sos:
% 1.93/2.11 ** KEPT (pick-wt=3): 72 [] A=A.
% 1.93/2.11 ** KEPT (pick-wt=2): 73 [] rel_str($c1).
% 1.93/2.11 ** KEPT (pick-wt=2): 74 [] one_sorted_str($c2).
% 1.93/2.11 ** KEPT (pick-wt=6): 75 [] relation_of2($f6(A,B),A,B).
% 1.93/2.11 ** KEPT (pick-wt=4): 76 [] element($f7(A),A).
% 1.93/2.11 ** KEPT (pick-wt=6): 77 [] relation_of2_as_subset($f8(A,B),A,B).
% 1.93/2.11 ** KEPT (pick-wt=2): 78 [] empty(empty_set).
% 1.93/2.11 ** KEPT (pick-wt=2): 79 [] finite($c3).
% 1.93/2.11 ** KEPT (pick-wt=7): 80 [] empty(A)|element($f9(A),powerset(A)).
% 1.93/2.11 ** KEPT (pick-wt=2): 81 [] empty($c4).
% 1.93/2.11 ** KEPT (pick-wt=5): 82 [] element($f10(A),powerset(A)).
% 1.93/2.11 ** KEPT (pick-wt=3): 83 [] empty($f10(A)).
% 1.93/2.11 ** KEPT (pick-wt=7): 84 [] empty(A)|element($f11(A),powerset(A)).
% 1.93/2.11 ** KEPT (pick-wt=5): 85 [] empty(A)|finite($f11(A)).
% 1.93/2.11 ** KEPT (pick-wt=2): 86 [] one_sorted_str($c6).
% 1.93/2.11 ** KEPT (pick-wt=7): 87 [] empty(A)|element($f12(A),powerset(A)).
% 6.62/6.86 ** KEPT (pick-wt=5): 88 [] empty(A)|finite($f12(A)).
% 6.62/6.86 ** KEPT (pick-wt=3): 89 [] subset(A,A).
% 6.62/6.86 ** KEPT (pick-wt=2): 90 [] one_sorted_str($c10).
% 6.62/6.86 ** KEPT (pick-wt=3): 91 [] net_str($c9,$c10).
% 6.62/6.86 ** KEPT (pick-wt=3): 92 [] subset($c8,$c7).
% 6.62/6.86 ** KEPT (pick-wt=8): 93 [] is_eventually_in($c10,$c9,$c8)|is_often_in($c10,$c9,$c8).
% 6.62/6.86 Following clause subsumed by 72 during input processing: 0 [copy,72,flip.1] A=A.
% 6.62/6.86 72 back subsumes 71.
% 6.62/6.86
% 6.62/6.86 ======= end of input processing =======
% 6.62/6.86
% 6.62/6.86 =========== start of search ===========
% 6.62/6.86
% 6.62/6.86
% 6.62/6.86 Resetting weight limit to 5.
% 6.62/6.86
% 6.62/6.86
% 6.62/6.86 Resetting weight limit to 5.
% 6.62/6.86
% 6.62/6.86 sos_size=706
% 6.62/6.86
% 6.62/6.86 Search stopped because sos empty.
% 6.62/6.86
% 6.62/6.86
% 6.62/6.86 Search stopped because sos empty.
% 6.62/6.86
% 6.62/6.86 ============ end of search ============
% 6.62/6.86
% 6.62/6.86 -------------- statistics -------------
% 6.62/6.86 clauses given 864
% 6.62/6.86 clauses generated 549462
% 6.62/6.86 clauses kept 943
% 6.62/6.86 clauses forward subsumed 1033
% 6.62/6.86 clauses back subsumed 2
% 6.62/6.86 Kbytes malloced 6835
% 6.62/6.86
% 6.62/6.86 ----------- times (seconds) -----------
% 6.62/6.86 user CPU time 4.75 (0 hr, 0 min, 4 sec)
% 6.62/6.86 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 6.62/6.86 wall-clock time 7 (0 hr, 0 min, 7 sec)
% 6.62/6.86
% 6.62/6.86 Process 27287 finished Wed Jul 27 08:03:57 2022
% 6.62/6.86 Otter interrupted
% 6.62/6.86 PROOF NOT FOUND
%------------------------------------------------------------------------------