TSTP Solution File: SEU100+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU100+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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:46 EDT 2022
% Result : Unknown 134.98s 135.17s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU100+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 07:40:40 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.28/2.47 ----- Otter 3.3f, August 2004 -----
% 2.28/2.47 The process was started by sandbox on n011.cluster.edu,
% 2.28/2.47 Wed Jul 27 07:40:40 2022
% 2.28/2.47 The command was "./otter". The process ID is 15823.
% 2.28/2.47
% 2.28/2.47 set(prolog_style_variables).
% 2.28/2.47 set(auto).
% 2.28/2.47 dependent: set(auto1).
% 2.28/2.47 dependent: set(process_input).
% 2.28/2.47 dependent: clear(print_kept).
% 2.28/2.47 dependent: clear(print_new_demod).
% 2.28/2.47 dependent: clear(print_back_demod).
% 2.28/2.47 dependent: clear(print_back_sub).
% 2.28/2.47 dependent: set(control_memory).
% 2.28/2.47 dependent: assign(max_mem, 12000).
% 2.28/2.47 dependent: assign(pick_given_ratio, 4).
% 2.28/2.47 dependent: assign(stats_level, 1).
% 2.28/2.47 dependent: assign(max_seconds, 10800).
% 2.28/2.47 clear(print_given).
% 2.28/2.47
% 2.28/2.47 formula_list(usable).
% 2.28/2.47 all A (A=A).
% 2.28/2.47 all A B (in(A,B)-> -in(B,A)).
% 2.28/2.47 all A (ordinal(A)-> (all B (element(B,A)->epsilon_transitive(B)&epsilon_connected(B)&ordinal(B)))).
% 2.28/2.47 all A (empty(A)->finite(A)).
% 2.28/2.47 all A (empty(A)->function(A)).
% 2.28/2.47 all A (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)).
% 2.28/2.47 all A (empty(A)->relation(A)).
% 2.28/2.47 all A (empty(A)&ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&natural(A)).
% 2.28/2.47 all A (finite(A)-> (all B (element(B,powerset(A))->finite(B)))).
% 2.28/2.47 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.28/2.47 all A (epsilon_transitive(A)&epsilon_connected(A)->ordinal(A)).
% 2.28/2.47 all A (empty(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.28/2.47 all A (element(A,positive_rationals)-> (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&natural(A))).
% 2.28/2.47 all A B (set_union2(A,B)=set_union2(B,A)).
% 2.28/2.47 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 2.28/2.47 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 2.28/2.47 all A (inclusion_linear(A)<-> (all B C (in(B,A)&in(C,A)->inclusion_comparable(B,C)))).
% 2.28/2.47 all A B (inclusion_comparable(A,B)<->subset(A,B)|subset(B,A)).
% 2.28/2.47 all A exists B element(B,A).
% 2.28/2.47 empty(empty_set).
% 2.28/2.47 relation(empty_set).
% 2.28/2.47 relation_empty_yielding(empty_set).
% 2.28/2.47 all A (-empty(singleton(A))&finite(singleton(A))).
% 2.28/2.47 all A (-empty(powerset(A))).
% 2.28/2.47 empty(empty_set).
% 2.28/2.47 relation(empty_set).
% 2.28/2.47 relation_empty_yielding(empty_set).
% 2.28/2.47 function(empty_set).
% 2.28/2.47 one_to_one(empty_set).
% 2.28/2.47 empty(empty_set).
% 2.28/2.47 epsilon_transitive(empty_set).
% 2.28/2.47 epsilon_connected(empty_set).
% 2.28/2.47 ordinal(empty_set).
% 2.28/2.47 all A B (relation(A)&relation(B)->relation(set_union2(A,B))).
% 2.28/2.47 all A (-empty(singleton(A))).
% 2.28/2.47 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 2.28/2.47 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 2.28/2.47 empty(empty_set).
% 2.28/2.47 relation(empty_set).
% 2.28/2.47 -empty(positive_rationals).
% 2.28/2.47 all A B (finite(A)&finite(B)->finite(set_union2(A,B))).
% 2.28/2.47 all A B (set_union2(A,A)=A).
% 2.28/2.47 exists A (-empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&natural(A)).
% 2.28/2.47 exists A (-empty(A)&finite(A)).
% 2.28/2.47 exists A (relation(A)&function(A)&function_yielding(A)).
% 2.28/2.47 exists A (relation(A)&function(A)).
% 2.28/2.47 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.28/2.47 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&being_limit_ordinal(A)).
% 2.28/2.47 exists A (empty(A)&relation(A)).
% 2.28/2.47 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.28/2.47 exists A empty(A).
% 2.28/2.47 exists A (element(A,positive_rationals)& -empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.28/2.47 all A exists B (element(B,powerset(A))&empty(B)&relation(B)&function(B)&one_to_one(B)&epsilon_transitive(B)&epsilon_connected(B)&ordinal(B)&natural(B)&finite(B)).
% 2.28/2.47 exists A (relation(A)&empty(A)&function(A)).
% 2.28/2.47 exists A (relation(A)&function(A)&one_to_one(A)&empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.28/2.47 exists A (relation(A)&function(A)&transfinite_se_quence(A)&ordinal_yielding(A)).
% 2.28/2.47 exists A (-empty(A)&relation(A)).
% 2.28/2.47 all A exists B (element(B,powerset(A))&empty(B)).
% 2.28/2.47 exists A (-empty(A)).
% 2.28/2.47 exists A (element(A,positive_rationals)&empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&natural(A)).
% 2.28/2.47 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 2.28/2.47 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.28/2.47 exists A (-empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.28/2.47 exists A (relation(A)&relation_empty_yielding(A)).
% 2.28/2.47 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 2.28/2.47 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 2.28/2.48 exists A (relation(A)&function(A)&transfinite_se_quence(A)).
% 2.28/2.48 exists A (relation(A)&relation_non_empty(A)&function(A)).
% 2.28/2.48 all A B subset(A,A).
% 2.28/2.48 all A B inclusion_comparable(A,A).
% 2.28/2.48 all A (finite(A)& -(empty_set!=empty_set& (all B (-(in(B,empty_set)& (all C (in(C,empty_set)->subset(C,B)))))))& (all D E (in(D,A)&subset(E,A)& -(E!=empty_set& (all F (-(in(F,E)& (all G (in(G,E)->subset(G,F)))))))-> -(set_union2(E,singleton(D))!=empty_set& (all H (-(in(H,set_union2(E,singleton(D)))& (all I (in(I,set_union2(E,singleton(D)))->subset(I,H)))))))))-> -(A!=empty_set& (all J (-(in(J,A)& (all K (in(K,A)->subset(K,J)))))))).
% 2.28/2.48 all A B (inclusion_comparable(A,B)->inclusion_comparable(B,A)).
% 2.28/2.48 all A (set_union2(A,empty_set)=A).
% 2.28/2.48 all A B (in(A,B)->element(A,B)).
% 2.28/2.48 all A B C (subset(A,B)&subset(B,C)->subset(A,C)).
% 2.28/2.48 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.28/2.48 -(all A (-(finite(A)&A!=empty_set&inclusion_linear(A)& (all B (-(in(B,A)& (all C (in(C,A)->subset(C,B))))))))).
% 2.28/2.48 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.28/2.48 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.28/2.48 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.28/2.48 all A (empty(A)->A=empty_set).
% 2.28/2.48 all A B (-(in(A,B)&empty(B))).
% 2.28/2.48 all A B (-(empty(A)&A!=B&empty(B))).
% 2.28/2.48 end_of_list.
% 2.28/2.48
% 2.28/2.48 -------> usable clausifies to:
% 2.28/2.48
% 2.28/2.48 list(usable).
% 2.28/2.48 0 [] A=A.
% 2.28/2.48 0 [] -in(A,B)| -in(B,A).
% 2.28/2.48 0 [] -ordinal(A)| -element(B,A)|epsilon_transitive(B).
% 2.28/2.48 0 [] -ordinal(A)| -element(B,A)|epsilon_connected(B).
% 2.28/2.48 0 [] -ordinal(A)| -element(B,A)|ordinal(B).
% 2.28/2.48 0 [] -empty(A)|finite(A).
% 2.28/2.48 0 [] -empty(A)|function(A).
% 2.28/2.48 0 [] -ordinal(A)|epsilon_transitive(A).
% 2.28/2.48 0 [] -ordinal(A)|epsilon_connected(A).
% 2.28/2.48 0 [] -empty(A)|relation(A).
% 2.28/2.48 0 [] -empty(A)| -ordinal(A)|epsilon_transitive(A).
% 2.28/2.48 0 [] -empty(A)| -ordinal(A)|epsilon_connected(A).
% 2.28/2.48 0 [] -empty(A)| -ordinal(A)|natural(A).
% 2.28/2.48 0 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 2.28/2.48 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.28/2.48 0 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 2.28/2.48 0 [] -empty(A)|epsilon_transitive(A).
% 2.28/2.48 0 [] -empty(A)|epsilon_connected(A).
% 2.28/2.48 0 [] -empty(A)|ordinal(A).
% 2.28/2.48 0 [] -element(A,positive_rationals)| -ordinal(A)|epsilon_transitive(A).
% 2.28/2.48 0 [] -element(A,positive_rationals)| -ordinal(A)|epsilon_connected(A).
% 2.28/2.48 0 [] -element(A,positive_rationals)| -ordinal(A)|natural(A).
% 2.28/2.48 0 [] set_union2(A,B)=set_union2(B,A).
% 2.28/2.48 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 2.28/2.48 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 2.28/2.48 0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A.
% 2.28/2.48 0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A.
% 2.28/2.48 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 2.28/2.48 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 2.28/2.48 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 2.28/2.48 0 [] C=set_union2(A,B)|in($f2(A,B,C),C)|in($f2(A,B,C),A)|in($f2(A,B,C),B).
% 2.28/2.48 0 [] C=set_union2(A,B)| -in($f2(A,B,C),C)| -in($f2(A,B,C),A).
% 2.28/2.48 0 [] C=set_union2(A,B)| -in($f2(A,B,C),C)| -in($f2(A,B,C),B).
% 2.28/2.48 0 [] -inclusion_linear(A)| -in(B,A)| -in(C,A)|inclusion_comparable(B,C).
% 2.28/2.48 0 [] inclusion_linear(A)|in($f4(A),A).
% 2.28/2.48 0 [] inclusion_linear(A)|in($f3(A),A).
% 2.28/2.48 0 [] inclusion_linear(A)| -inclusion_comparable($f4(A),$f3(A)).
% 2.28/2.48 0 [] -inclusion_comparable(A,B)|subset(A,B)|subset(B,A).
% 2.28/2.48 0 [] inclusion_comparable(A,B)| -subset(A,B).
% 2.28/2.48 0 [] inclusion_comparable(A,B)| -subset(B,A).
% 2.28/2.48 0 [] element($f5(A),A).
% 2.28/2.48 0 [] empty(empty_set).
% 2.28/2.48 0 [] relation(empty_set).
% 2.28/2.48 0 [] relation_empty_yielding(empty_set).
% 2.28/2.48 0 [] -empty(singleton(A)).
% 2.28/2.48 0 [] finite(singleton(A)).
% 2.28/2.48 0 [] -empty(powerset(A)).
% 2.28/2.48 0 [] empty(empty_set).
% 2.28/2.48 0 [] relation(empty_set).
% 2.28/2.48 0 [] relation_empty_yielding(empty_set).
% 2.28/2.48 0 [] function(empty_set).
% 2.28/2.48 0 [] one_to_one(empty_set).
% 2.28/2.48 0 [] empty(empty_set).
% 2.28/2.48 0 [] epsilon_transitive(empty_set).
% 2.28/2.48 0 [] epsilon_connected(empty_set).
% 2.28/2.48 0 [] ordinal(empty_set).
% 2.28/2.48 0 [] -relation(A)| -relation(B)|relation(set_union2(A,B)).
% 2.28/2.48 0 [] -empty(singleton(A)).
% 2.28/2.48 0 [] empty(A)| -empty(set_union2(A,B)).
% 2.28/2.48 0 [] empty(A)| -empty(set_union2(B,A)).
% 2.28/2.48 0 [] empty(empty_set).
% 2.28/2.48 0 [] relation(empty_set).
% 2.28/2.48 0 [] -empty(positive_rationals).
% 2.28/2.48 0 [] -finite(A)| -finite(B)|finite(set_union2(A,B)).
% 2.28/2.48 0 [] set_union2(A,A)=A.
% 2.28/2.48 0 [] -empty($c1).
% 2.28/2.48 0 [] epsilon_transitive($c1).
% 2.28/2.48 0 [] epsilon_connected($c1).
% 2.28/2.48 0 [] ordinal($c1).
% 2.28/2.48 0 [] natural($c1).
% 2.28/2.48 0 [] -empty($c2).
% 2.28/2.48 0 [] finite($c2).
% 2.28/2.48 0 [] relation($c3).
% 2.28/2.48 0 [] function($c3).
% 2.28/2.48 0 [] function_yielding($c3).
% 2.28/2.48 0 [] relation($c4).
% 2.28/2.48 0 [] function($c4).
% 2.28/2.48 0 [] epsilon_transitive($c5).
% 2.28/2.48 0 [] epsilon_connected($c5).
% 2.28/2.48 0 [] ordinal($c5).
% 2.28/2.48 0 [] epsilon_transitive($c6).
% 2.28/2.48 0 [] epsilon_connected($c6).
% 2.28/2.48 0 [] ordinal($c6).
% 2.28/2.48 0 [] being_limit_ordinal($c6).
% 2.28/2.48 0 [] empty($c7).
% 2.28/2.48 0 [] relation($c7).
% 2.28/2.48 0 [] empty(A)|element($f6(A),powerset(A)).
% 2.28/2.48 0 [] empty(A)| -empty($f6(A)).
% 2.28/2.48 0 [] empty($c8).
% 2.28/2.48 0 [] element($c9,positive_rationals).
% 2.28/2.48 0 [] -empty($c9).
% 2.28/2.48 0 [] epsilon_transitive($c9).
% 2.28/2.48 0 [] epsilon_connected($c9).
% 2.28/2.48 0 [] ordinal($c9).
% 2.28/2.48 0 [] element($f7(A),powerset(A)).
% 2.28/2.48 0 [] empty($f7(A)).
% 2.28/2.48 0 [] relation($f7(A)).
% 2.28/2.48 0 [] function($f7(A)).
% 2.28/2.48 0 [] one_to_one($f7(A)).
% 2.28/2.48 0 [] epsilon_transitive($f7(A)).
% 2.28/2.48 0 [] epsilon_connected($f7(A)).
% 2.28/2.48 0 [] ordinal($f7(A)).
% 2.28/2.48 0 [] natural($f7(A)).
% 2.28/2.48 0 [] finite($f7(A)).
% 2.28/2.48 0 [] relation($c10).
% 2.28/2.48 0 [] empty($c10).
% 2.28/2.48 0 [] function($c10).
% 2.28/2.48 0 [] relation($c11).
% 2.28/2.48 0 [] function($c11).
% 2.28/2.48 0 [] one_to_one($c11).
% 2.28/2.48 0 [] empty($c11).
% 2.28/2.48 0 [] epsilon_transitive($c11).
% 2.28/2.48 0 [] epsilon_connected($c11).
% 2.28/2.48 0 [] ordinal($c11).
% 2.28/2.48 0 [] relation($c12).
% 2.28/2.48 0 [] function($c12).
% 2.28/2.48 0 [] transfinite_se_quence($c12).
% 2.28/2.48 0 [] ordinal_yielding($c12).
% 2.28/2.48 0 [] -empty($c13).
% 2.28/2.48 0 [] relation($c13).
% 2.28/2.48 0 [] element($f8(A),powerset(A)).
% 2.28/2.48 0 [] empty($f8(A)).
% 2.28/2.48 0 [] -empty($c14).
% 2.28/2.48 0 [] element($c15,positive_rationals).
% 2.28/2.48 0 [] empty($c15).
% 2.28/2.48 0 [] epsilon_transitive($c15).
% 2.28/2.48 0 [] epsilon_connected($c15).
% 2.28/2.48 0 [] ordinal($c15).
% 2.28/2.48 0 [] natural($c15).
% 2.28/2.48 0 [] empty(A)|element($f9(A),powerset(A)).
% 2.28/2.48 0 [] empty(A)| -empty($f9(A)).
% 2.28/2.48 0 [] empty(A)|finite($f9(A)).
% 2.28/2.48 0 [] relation($c16).
% 2.28/2.48 0 [] function($c16).
% 2.28/2.48 0 [] one_to_one($c16).
% 2.28/2.48 0 [] -empty($c17).
% 2.28/2.48 0 [] epsilon_transitive($c17).
% 2.28/2.48 0 [] epsilon_connected($c17).
% 2.28/2.48 0 [] ordinal($c17).
% 2.28/2.48 0 [] relation($c18).
% 2.28/2.48 0 [] relation_empty_yielding($c18).
% 2.28/2.48 0 [] empty(A)|element($f10(A),powerset(A)).
% 2.28/2.48 0 [] empty(A)| -empty($f10(A)).
% 2.28/2.48 0 [] empty(A)|finite($f10(A)).
% 2.28/2.48 0 [] relation($c19).
% 2.28/2.48 0 [] relation_empty_yielding($c19).
% 2.28/2.48 0 [] function($c19).
% 2.28/2.48 0 [] relation($c20).
% 2.28/2.48 0 [] function($c20).
% 2.28/2.48 0 [] transfinite_se_quence($c20).
% 2.28/2.48 0 [] relation($c21).
% 2.28/2.48 0 [] relation_non_empty($c21).
% 2.28/2.48 0 [] function($c21).
% 2.28/2.48 0 [] subset(A,A).
% 2.28/2.48 0 [] inclusion_comparable(A,A).
% 2.28/2.48 0 [] -finite(A)|empty_set!=empty_set|in($f15(A),A)|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)|empty_set!=empty_set|in($f15(A),A)|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)|empty_set!=empty_set|subset($f14(A),A)|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)|empty_set!=empty_set|subset($f14(A),A)|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)|empty_set!=empty_set|$f14(A)=empty_set|in($f12(A),$f14(A))|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)|empty_set!=empty_set|$f14(A)=empty_set|in($f12(A),$f14(A))|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)|empty_set!=empty_set|$f14(A)=empty_set| -in(G,$f14(A))|subset(G,$f12(A))|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)|empty_set!=empty_set|$f14(A)=empty_set| -in(G,$f14(A))|subset(G,$f12(A))|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)|empty_set!=empty_set|set_union2($f14(A),singleton($f15(A)))!=empty_set|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)|empty_set!=empty_set|set_union2($f14(A),singleton($f15(A)))!=empty_set|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)|empty_set!=empty_set| -in(H,set_union2($f14(A),singleton($f15(A))))|in($f13(A,H),set_union2($f14(A),singleton($f15(A))))|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)|empty_set!=empty_set| -in(H,set_union2($f14(A),singleton($f15(A))))|in($f13(A,H),set_union2($f14(A),singleton($f15(A))))|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)|empty_set!=empty_set| -in(H,set_union2($f14(A),singleton($f15(A))))| -subset($f13(A,H),H)|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)|empty_set!=empty_set| -in(H,set_union2($f14(A),singleton($f15(A))))| -subset($f13(A,H),H)|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|in($f15(A),A)|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|in($f15(A),A)|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|subset($f14(A),A)|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|subset($f14(A),A)|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|$f14(A)=empty_set|in($f12(A),$f14(A))|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|$f14(A)=empty_set|in($f12(A),$f14(A))|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|$f14(A)=empty_set| -in(G,$f14(A))|subset(G,$f12(A))|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|$f14(A)=empty_set| -in(G,$f14(A))|subset(G,$f12(A))|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|set_union2($f14(A),singleton($f15(A)))!=empty_set|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|set_union2($f14(A),singleton($f15(A)))!=empty_set|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)| -in(H,set_union2($f14(A),singleton($f15(A))))|in($f13(A,H),set_union2($f14(A),singleton($f15(A))))|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)| -in(H,set_union2($f14(A),singleton($f15(A))))|in($f13(A,H),set_union2($f14(A),singleton($f15(A))))|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)| -in(H,set_union2($f14(A),singleton($f15(A))))| -subset($f13(A,H),H)|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)| -in(H,set_union2($f14(A),singleton($f15(A))))| -subset($f13(A,H),H)|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|in($f15(A),A)|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|in($f15(A),A)|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|subset($f14(A),A)|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|subset($f14(A),A)|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|$f14(A)=empty_set|in($f12(A),$f14(A))|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|$f14(A)=empty_set|in($f12(A),$f14(A))|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|$f14(A)=empty_set| -in(G,$f14(A))|subset(G,$f12(A))|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|$f14(A)=empty_set| -in(G,$f14(A))|subset(G,$f12(A))|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|set_union2($f14(A),singleton($f15(A)))!=empty_set|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|set_union2($f14(A),singleton($f15(A)))!=empty_set|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)| -in(H,set_union2($f14(A),singleton($f15(A))))|in($f13(A,H),set_union2($f14(A),singleton($f15(A))))|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)| -in(H,set_union2($f14(A),singleton($f15(A))))|in($f13(A,H),set_union2($f14(A),singleton($f15(A))))|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)| -in(H,set_union2($f14(A),singleton($f15(A))))| -subset($f13(A,H),H)|A=empty_set|in($f16(A),A).
% 2.28/2.48 0 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)| -in(H,set_union2($f14(A),singleton($f15(A))))| -subset($f13(A,H),H)|A=empty_set| -in(K,A)|subset(K,$f16(A)).
% 2.28/2.48 0 [] -inclusion_comparable(A,B)|inclusion_comparable(B,A).
% 2.28/2.48 0 [] set_union2(A,empty_set)=A.
% 2.28/2.48 0 [] -in(A,B)|element(A,B).
% 2.28/2.48 0 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 2.28/2.48 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.28/2.48 0 [] finite($c22).
% 2.28/2.48 0 [] $c22!=empty_set.
% 2.28/2.48 0 [] inclusion_linear($c22).
% 2.28/2.48 0 [] -in(B,$c22)|in($f17(B),$c22).
% 2.28/2.48 0 [] -in(B,$c22)| -subset($f17(B),B).
% 2.28/2.48 0 [] -element(A,powerset(B))|subset(A,B).
% 2.28/2.48 0 [] element(A,powerset(B))| -subset(A,B).
% 2.28/2.48 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.28/2.48 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.28/2.48 0 [] -empty(A)|A=empty_set.
% 2.28/2.48 0 [] -in(A,B)| -empty(B).
% 2.28/2.48 0 [] -empty(A)|A=B| -empty(B).
% 2.28/2.48 end_of_list.
% 2.28/2.48
% 2.28/2.48 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 2.28/2.48
% 2.28/2.48 This ia a non-Horn set with equality. The strategy will be
% 2.28/2.48 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.28/2.48 deletion, with positive clauses in sos and nonpositive
% 2.28/2.48 clauses in usable.
% 2.28/2.48
% 2.28/2.48 dependent: set(knuth_bendix).
% 2.28/2.48 dependent: set(anl_eq).
% 2.28/2.48 dependent: set(para_from).
% 2.28/2.48 dependent: set(para_into).
% 2.28/2.48 dependent: clear(para_from_right).
% 2.28/2.48 dependent: clear(para_into_right).
% 2.28/2.48 dependent: set(para_from_vars).
% 2.28/2.48 dependent: set(eq_units_both_ways).
% 2.28/2.48 dependent: set(dynamic_demod_all).
% 2.28/2.48 dependent: set(dynamic_demod).
% 2.28/2.48 dependent: set(order_eq).
% 2.28/2.48 dependent: set(back_demod).
% 2.28/2.48 dependent: set(lrpo).
% 2.28/2.48 dependent: set(hyper_res).
% 2.28/2.48 dependent: set(unit_deletion).
% 2.28/2.48 dependent: set(factor).
% 2.28/2.48
% 2.28/2.48 ------------> process usable:
% 2.28/2.48 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.28/2.48 ** KEPT (pick-wt=7): 2 [] -ordinal(A)| -element(B,A)|epsilon_transitive(B).
% 2.28/2.48 ** KEPT (pick-wt=7): 3 [] -ordinal(A)| -element(B,A)|epsilon_connected(B).
% 2.28/2.48 ** KEPT (pick-wt=7): 4 [] -ordinal(A)| -element(B,A)|ordinal(B).
% 2.28/2.48 ** KEPT (pick-wt=4): 5 [] -empty(A)|finite(A).
% 2.28/2.48 ** KEPT (pick-wt=4): 6 [] -empty(A)|function(A).
% 2.28/2.48 ** KEPT (pick-wt=4): 7 [] -ordinal(A)|epsilon_transitive(A).
% 2.28/2.48 ** KEPT (pick-wt=4): 8 [] -ordinal(A)|epsilon_connected(A).
% 2.28/2.48 ** KEPT (pick-wt=4): 9 [] -empty(A)|relation(A).
% 2.28/2.48 Following clause subsumed by 7 during input processing: 0 [] -empty(A)| -ordinal(A)|epsilon_transitive(A).
% 2.28/2.48 Following clause subsumed by 8 during input processing: 0 [] -empty(A)| -ordinal(A)|epsilon_connected(A).
% 2.28/2.48 ** KEPT (pick-wt=6): 10 [] -empty(A)| -ordinal(A)|natural(A).
% 2.28/2.48 ** KEPT (pick-wt=8): 11 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 2.28/2.48 ** KEPT (pick-wt=8): 12 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.28/2.48 ** KEPT (pick-wt=6): 13 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 2.28/2.48 ** KEPT (pick-wt=4): 14 [] -empty(A)|epsilon_transitive(A).
% 2.28/2.48 ** KEPT (pick-wt=4): 15 [] -empty(A)|epsilon_connected(A).
% 2.28/2.48 ** KEPT (pick-wt=4): 16 [] -empty(A)|ordinal(A).
% 2.28/2.48 Following clause subsumed by 7 during input processing: 0 [] -element(A,positive_rationals)| -ordinal(A)|epsilon_transitive(A).
% 2.28/2.48 Following clause subsumed by 8 during input processing: 0 [] -element(A,positive_rationals)| -ordinal(A)|epsilon_connected(A).
% 2.28/2.48 ** KEPT (pick-wt=7): 17 [] -element(A,positive_rationals)| -ordinal(A)|natural(A).
% 2.28/2.48 ** KEPT (pick-wt=10): 18 [] A!=singleton(B)| -in(C,A)|C=B.
% 2.28/2.48 ** KEPT (pick-wt=10): 19 [] A!=singleton(B)|in(C,A)|C!=B.
% 2.28/2.48 ** KEPT (pick-wt=14): 20 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 2.28/2.48 ** KEPT (pick-wt=14): 21 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 2.28/2.48 ** KEPT (pick-wt=11): 22 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 2.28/2.48 ** KEPT (pick-wt=11): 23 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 2.28/2.48 ** KEPT (pick-wt=17): 24 [] A=set_union2(B,C)| -in($f2(B,C,A),A)| -in($f2(B,C,A),B).
% 2.28/2.48 ** KEPT (pick-wt=17): 25 [] A=set_union2(B,C)| -in($f2(B,C,A),A)| -in($f2(B,C,A),C).
% 2.28/2.48 ** KEPT (pick-wt=11): 26 [] -inclusion_linear(A)| -in(B,A)| -in(C,A)|inclusion_comparable(B,C).
% 2.28/2.48 ** KEPT (pick-wt=7): 27 [] inclusion_linear(A)| -inclusion_comparable($f4(A),$f3(A)).
% 2.28/2.48 ** KEPT (pick-wt=9): 28 [] -inclusion_comparable(A,B)|subset(A,B)|subset(B,A).
% 2.28/2.48 ** KEPT (pick-wt=6): 29 [] inclusion_comparable(A,B)| -subset(A,B).
% 2.28/2.48 ** KEPT (pick-wt=6): 30 [] inclusion_comparable(A,B)| -subset(B,A).
% 2.28/2.48 ** KEPT (pick-wt=3): 31 [] -empty(singleton(A)).
% 2.28/2.48 ** KEPT (pick-wt=3): 32 [] -empty(powerset(A)).
% 2.28/2.48 ** KEPT (pick-wt=8): 33 [] -relation(A)| -relation(B)|relation(set_union2(A,B)).
% 2.28/2.48 Following clause subsumed by 31 during input processing: 0 [] -empty(singleton(A)).
% 2.28/2.48 ** KEPT (pick-wt=6): 34 [] empty(A)| -empty(set_union2(A,B)).
% 2.28/2.48 ** KEPT (pick-wt=6): 35 [] empty(A)| -empty(set_union2(B,A)).
% 2.28/2.48 ** KEPT (pick-wt=2): 36 [] -empty(positive_rationals).
% 2.28/2.48 ** KEPT (pick-wt=8): 37 [] -finite(A)| -finite(B)|finite(set_union2(A,B)).
% 2.28/2.48 ** KEPT (pick-wt=2): 38 [] -empty($c1).
% 2.28/2.48 ** KEPT (pick-wt=2): 39 [] -empty($c2).
% 2.28/2.48 ** KEPT (pick-wt=5): 40 [] empty(A)| -empty($f6(A)).
% 2.28/2.48 ** KEPT (pick-wt=2): 41 [] -empty($c9).
% 2.28/2.48 ** KEPT (pick-wt=2): 42 [] -empty($c13).
% 2.28/2.48 ** KEPT (pick-wt=2): 43 [] -empty($c14).
% 2.28/2.48 ** KEPT (pick-wt=5): 44 [] empty(A)| -empty($f9(A)).
% 2.28/2.48 ** KEPT (pick-wt=2): 45 [] -empty($c17).
% 2.28/2.48 ** KEPT (pick-wt=5): 46 [] empty(A)| -empty($f10(A)).
% 2.28/2.48 ** KEPT (pick-wt=16): 47 [] -finite(A)|empty_set!=empty_set|in($f15(A),A)|A=empty_set|in($f16(A),A).
% 2.28/2.48 ** KEPT (pick-wt=19): 48 [] -finite(A)|empty_set!=empty_set|in($f15(A),A)|A=empty_set| -in(B,A)|subset(B,$f16(A)).
% 2.28/2.48 ** KEPT (pick-wt=16): 49 [] -finite(A)|empty_set!=empty_set|subset($f14(A),A)|A=empty_set|in($f16(A),A).
% 2.28/2.48 ** KEPT (pick-wt=19): 50 [] -finite(A)|empty_set!=empty_set|subset($f14(A),A)|A=empty_set| -in(B,A)|subset(B,$f16(A)).
% 2.28/2.48 ** KEPT (pick-wt=21): 51 [] -finite(A)|empty_set!=empty_set|$f14(A)=empty_set|in($f12(A),$f14(A))|A=empty_set|in($f16(A),A).
% 2.28/2.48 ** KEPT (pick-wt=24): 52 [] -finite(A)|empty_set!=empty_set|$f14(A)=empty_set|in($f12(A),$f14(A))|A=empty_set| -in(B,A)|subset(B,$f16(A)).
% 2.28/2.48 ** KEPT (pick-wt=24): 53 [] -finite(A)|empty_set!=empty_set|$f14(A)=empty_set| -in(B,$f14(A))|subset(B,$f12(A))|A=empty_set|in($f16(A),A).
% 2.28/2.48 ** KEPT (pick-wt=27): 54 [] -finite(A)|empty_set!=empty_set|$f14(A)=empty_set| -in(B,$f14(A))|subset(B,$f12(A))|A=empty_set| -in(C,A)|subset(C,$f16(A)).
% 2.28/2.48 ** KEPT (pick-wt=20): 55 [] -finite(A)|empty_set!=empty_set|set_union2($f14(A),singleton($f15(A)))!=empty_set|A=empty_set|in($f16(A),A).
% 2.28/2.48 ** KEPT (pick-wt=23): 56 [] -finite(A)|empty_set!=empty_set|set_union2($f14(A),singleton($f15(A)))!=empty_set|A=empty_set| -in(B,A)|subset(B,$f16(A)).
% 2.28/2.48 ** KEPT (pick-wt=30): 57 [] -finite(A)|empty_set!=empty_set| -in(B,set_union2($f14(A),singleton($f15(A))))|in($f13(A,B),set_union2($f14(A),singleton($f15(A))))|A=empty_set|in($f16(A),A).
% 2.28/2.48 ** KEPT (pick-wt=33): 58 [] -finite(A)|empty_set!=empty_set| -in(B,set_union2($f14(A),singleton($f15(A))))|in($f13(A,B),set_union2($f14(A),singleton($f15(A))))|A=empty_set| -in(C,A)|subset(C,$f16(A)).
% 2.28/2.48 ** KEPT (pick-wt=25): 59 [] -finite(A)|empty_set!=empty_set| -in(B,set_union2($f14(A),singleton($f15(A))))| -subset($f13(A,B),B)|A=empty_set|in($f16(A),A).
% 2.28/2.48 ** KEPT (pick-wt=28): 60 [] -finite(A)|empty_set!=empty_set| -in(B,set_union2($f14(A),singleton($f15(A))))| -subset($f13(A,B),B)|A=empty_set| -in(C,A)|subset(C,$f16(A)).
% 2.28/2.48 ** KEPT (pick-wt=21): 61 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|in($f15(A),A)|A=empty_set|in($f16(A),A).
% 2.28/2.48 ** KEPT (pick-wt=24): 62 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|in($f15(A),A)|A=empty_set| -in(C,A)|subset(C,$f16(A)).
% 2.28/2.48 ** KEPT (pick-wt=21): 63 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|subset($f14(A),A)|A=empty_set|in($f16(A),A).
% 2.28/2.48 ** KEPT (pick-wt=24): 64 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|subset($f14(A),A)|A=empty_set| -in(C,A)|subset(C,$f16(A)).
% 2.28/2.48 ** KEPT (pick-wt=26): 65 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|$f14(A)=empty_set|in($f12(A),$f14(A))|A=empty_set|in($f16(A),A).
% 2.28/2.48 ** KEPT (pick-wt=29): 66 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|$f14(A)=empty_set|in($f12(A),$f14(A))|A=empty_set| -in(C,A)|subset(C,$f16(A)).
% 2.28/2.48 ** KEPT (pick-wt=29): 67 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|$f14(A)=empty_set| -in(C,$f14(A))|subset(C,$f12(A))|A=empty_set|in($f16(A),A).
% 2.28/2.48 ** KEPT (pick-wt=32): 68 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|$f14(A)=empty_set| -in(C,$f14(A))|subset(C,$f12(A))|A=empty_set| -in(D,A)|subset(D,$f16(A)).
% 2.28/2.48 ** KEPT (pick-wt=25): 69 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|set_union2($f14(A),singleton($f15(A)))!=empty_set|A=empty_set|in($f16(A),A).
% 2.28/2.48 ** KEPT (pick-wt=28): 70 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)|set_union2($f14(A),singleton($f15(A)))!=empty_set|A=empty_set| -in(C,A)|subset(C,$f16(A)).
% 2.28/2.48 ** KEPT (pick-wt=35): 71 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)| -in(C,set_union2($f14(A),singleton($f15(A))))|in($f13(A,C),set_union2($f14(A),singleton($f15(A))))|A=empty_set|in($f16(A),A).
% 2.28/2.48 ** KEPT (pick-wt=38): 72 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)| -in(C,set_union2($f14(A),singleton($f15(A))))|in($f13(A,C),set_union2($f14(A),singleton($f15(A))))|A=empty_set| -in(D,A)|subset(D,$f16(A)).
% 2.28/2.49 ** KEPT (pick-wt=30): 73 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)| -in(C,set_union2($f14(A),singleton($f15(A))))| -subset($f13(A,C),C)|A=empty_set|in($f16(A),A).
% 2.28/2.49 ** KEPT (pick-wt=33): 74 [] -finite(A)| -in(B,empty_set)|in($f11(A,B),empty_set)| -in(C,set_union2($f14(A),singleton($f15(A))))| -subset($f13(A,C),C)|A=empty_set| -in(D,A)|subset(D,$f16(A)).
% 2.28/2.49 ** KEPT (pick-wt=21): 75 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|in($f15(A),A)|A=empty_set|in($f16(A),A).
% 2.28/2.49 ** KEPT (pick-wt=24): 76 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|in($f15(A),A)|A=empty_set| -in(C,A)|subset(C,$f16(A)).
% 2.28/2.49 ** KEPT (pick-wt=21): 77 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|subset($f14(A),A)|A=empty_set|in($f16(A),A).
% 2.28/2.49 ** KEPT (pick-wt=24): 78 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|subset($f14(A),A)|A=empty_set| -in(C,A)|subset(C,$f16(A)).
% 2.28/2.49 ** KEPT (pick-wt=26): 79 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|$f14(A)=empty_set|in($f12(A),$f14(A))|A=empty_set|in($f16(A),A).
% 2.28/2.49 ** KEPT (pick-wt=29): 80 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|$f14(A)=empty_set|in($f12(A),$f14(A))|A=empty_set| -in(C,A)|subset(C,$f16(A)).
% 2.28/2.49 ** KEPT (pick-wt=29): 81 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|$f14(A)=empty_set| -in(C,$f14(A))|subset(C,$f12(A))|A=empty_set|in($f16(A),A).
% 2.28/2.49 ** KEPT (pick-wt=32): 82 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|$f14(A)=empty_set| -in(C,$f14(A))|subset(C,$f12(A))|A=empty_set| -in(D,A)|subset(D,$f16(A)).
% 2.28/2.49 ** KEPT (pick-wt=25): 83 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|set_union2($f14(A),singleton($f15(A)))!=empty_set|A=empty_set|in($f16(A),A).
% 2.28/2.49 ** KEPT (pick-wt=28): 84 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)|set_union2($f14(A),singleton($f15(A)))!=empty_set|A=empty_set| -in(C,A)|subset(C,$f16(A)).
% 2.28/2.49 ** KEPT (pick-wt=35): 85 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)| -in(C,set_union2($f14(A),singleton($f15(A))))|in($f13(A,C),set_union2($f14(A),singleton($f15(A))))|A=empty_set|in($f16(A),A).
% 2.28/2.49 ** KEPT (pick-wt=38): 86 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)| -in(C,set_union2($f14(A),singleton($f15(A))))|in($f13(A,C),set_union2($f14(A),singleton($f15(A))))|A=empty_set| -in(D,A)|subset(D,$f16(A)).
% 2.28/2.49 ** KEPT (pick-wt=30): 87 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)| -in(C,set_union2($f14(A),singleton($f15(A))))| -subset($f13(A,C),C)|A=empty_set|in($f16(A),A).
% 2.28/2.49 ** KEPT (pick-wt=33): 88 [] -finite(A)| -in(B,empty_set)| -subset($f11(A,B),B)| -in(C,set_union2($f14(A),singleton($f15(A))))| -subset($f13(A,C),C)|A=empty_set| -in(D,A)|subset(D,$f16(A)).
% 2.28/2.49 ** KEPT (pick-wt=6): 89 [] -inclusion_comparable(A,B)|inclusion_comparable(B,A).
% 2.28/2.49 ** KEPT (pick-wt=6): 90 [] -in(A,B)|element(A,B).
% 2.28/2.49 ** KEPT (pick-wt=9): 91 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 2.28/2.49 ** KEPT (pick-wt=8): 92 [] -element(A,B)|empty(B)|in(A,B).
% 2.28/2.49 ** KEPT (pick-wt=3): 94 [copy,93,flip.1] empty_set!=$c22.
% 2.28/2.49 ** KEPT (pick-wt=7): 95 [] -in(A,$c22)|in($f17(A),$c22).
% 2.28/2.49 ** KEPT (pick-wt=7): 96 [] -in(A,$c22)| -subset($f17(A),A).
% 2.28/2.49 ** KEPT (pick-wt=7): 97 [] -element(A,powerset(B))|subset(A,B).
% 2.28/2.49 ** KEPT (pick-wt=7): 98 [] element(A,powerset(B))| -subset(A,B).
% 2.28/2.49 ** KEPT (pick-wt=10): 99 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.28/2.49 ** KEPT (pick-wt=9): 100 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.28/2.49 ** KEPT (pick-wt=5): 101 [] -empty(A)|A=empty_set.
% 2.28/2.49 ** KEPT (pick-wt=5): 102 [] -in(A,B)| -empty(B).
% 2.28/2.49 ** KEPT (pick-wt=7): 103 [] -empty(A)|A=B| -empty(B).
% 2.28/2.49
% 2.28/2.49 ------------> process sos:
% 2.28/2.49 ** KEPT (pick-wt=3): 127 [] A=A.
% 2.28/2.49 ** KEPT (pick-wt=7): 128 [] set_union2(A,B)=set_union2(B,A).
% 2.28/2.49 ** KEPT (pick-wt=14): 129 [] A=singleton(B)|in($f1(B,A),A)|$f1(B,A)=B.
% 2.28/2.49 ** KEPT (pick-wt=23): 130 [] A=set_union2(B,C)|in($f2(B,C,A),A)|in($f2(B,C,A),B)|in($f2(B,C,A),C).
% 2.28/2.49 ** KEPT (pick-wt=6): 131 [] inclusion_linear(A)|in($f4(A),A).
% 2.28/2.49 ** KEPT (pick-wt=6): 132 [] inclusion_linear(A)|in($f3(A),A).
% 2.28/2.49 ** KEPT (pick-wt=4): 133 [] element($f5(A),A).
% 2.28/2.49 ** KEPT (pick-wt=2): 134 [] empty(empty_set).
% 2.28/2.49 ** KEPT (pick-wt=2): 135 [] relation(empty_set).
% 2.28/2.49 ** KEPT (pick-wt=2): 136 [] relation_empty_yielding(empty_set).
% 2.28/2.49 ** KEPT (pick-wt=3): 137 [] finite(singleton(A)).
% 2.28/2.49 Following clause subsumed by 134 during input processing: 0 [] empty(empty_set).
% 2.28/2.49 Following clause subsumed by 135 during input processing: 0 [] relation(empty_set).
% 2.28/2.49 Following clause subsumed by 136 during input processing: 0 [] relation_empty_yielding(empty_set).
% 2.28/2.49 ** KEPT (pick-wt=2): 138 [] function(empty_set).
% 2.28/2.49 ** KEPT (pick-wt=2): 139 [] one_to_one(empty_set).
% 2.28/2.49 Following clause subsumed by 134 during input processing: 0 [] empty(empty_set).
% 2.28/2.49 ** KEPT (pick-wt=2): 140 [] epsilon_transitive(empty_set).
% 2.28/2.49 ** KEPT (pick-wt=2): 141 [] epsilon_connected(empty_set).
% 2.28/2.49 ** KEPT (pick-wt=2): 142 [] ordinal(empty_set).
% 2.28/2.49 Following clause subsumed by 134 during input processing: 0 [] empty(empty_set).
% 2.28/2.49 Following clause subsumed by 135 during input processing: 0 [] relation(empty_set).
% 2.28/2.49 ** KEPT (pick-wt=5): 143 [] set_union2(A,A)=A.
% 2.28/2.49 ---> New Demodulator: 144 [new_demod,143] set_union2(A,A)=A.
% 2.28/2.49 ** KEPT (pick-wt=2): 145 [] epsilon_transitive($c1).
% 2.28/2.49 ** KEPT (pick-wt=2): 146 [] epsilon_connected($c1).
% 2.28/2.49 ** KEPT (pick-wt=2): 147 [] ordinal($c1).
% 2.28/2.49 ** KEPT (pick-wt=2): 148 [] natural($c1).
% 2.28/2.49 ** KEPT (pick-wt=2): 149 [] finite($c2).
% 2.28/2.49 ** KEPT (pick-wt=2): 150 [] relation($c3).
% 2.28/2.49 ** KEPT (pick-wt=2): 151 [] function($c3).
% 2.28/2.49 ** KEPT (pick-wt=2): 152 [] function_yielding($c3).
% 2.28/2.49 ** KEPT (pick-wt=2): 153 [] relation($c4).
% 2.28/2.49 ** KEPT (pick-wt=2): 154 [] function($c4).
% 2.28/2.49 ** KEPT (pick-wt=2): 155 [] epsilon_transitive($c5).
% 2.28/2.49 ** KEPT (pick-wt=2): 156 [] epsilon_connected($c5).
% 2.28/2.49 ** KEPT (pick-wt=2): 157 [] ordinal($c5).
% 2.28/2.49 ** KEPT (pick-wt=2): 158 [] epsilon_transitive($c6).
% 2.28/2.49 ** KEPT (pick-wt=2): 159 [] epsilon_connected($c6).
% 2.28/2.49 ** KEPT (pick-wt=2): 160 [] ordinal($c6).
% 2.28/2.49 ** KEPT (pick-wt=2): 161 [] being_limit_ordinal($c6).
% 2.28/2.49 ** KEPT (pick-wt=2): 162 [] empty($c7).
% 2.28/2.49 ** KEPT (pick-wt=2): 163 [] relation($c7).
% 2.28/2.49 ** KEPT (pick-wt=7): 164 [] empty(A)|element($f6(A),powerset(A)).
% 2.28/2.49 ** KEPT (pick-wt=2): 165 [] empty($c8).
% 2.28/2.49 ** KEPT (pick-wt=3): 166 [] element($c9,positive_rationals).
% 2.28/2.49 ** KEPT (pick-wt=2): 167 [] epsilon_transitive($c9).
% 2.28/2.49 ** KEPT (pick-wt=2): 168 [] epsilon_connected($c9).
% 2.28/2.49 ** KEPT (pick-wt=2): 169 [] ordinal($c9).
% 2.28/2.49 ** KEPT (pick-wt=5): 170 [] element($f7(A),powerset(A)).
% 2.28/2.49 ** KEPT (pick-wt=3): 171 [] empty($f7(A)).
% 2.28/2.49 ** KEPT (pick-wt=3): 172 [] relation($f7(A)).
% 2.28/2.49 ** KEPT (pick-wt=3): 173 [] function($f7(A)).
% 2.28/2.49 ** KEPT (pick-wt=3): 174 [] one_to_one($f7(A)).
% 2.28/2.49 ** KEPT (pick-wt=3): 175 [] epsilon_transitive($f7(A)).
% 2.28/2.49 ** KEPT (pick-wt=3): 176 [] epsilon_connected($f7(A)).
% 2.28/2.49 ** KEPT (pick-wt=3): 177 [] ordinal($f7(A)).
% 2.28/2.49 ** KEPT (pick-wt=3): 178 [] natural($f7(A)).
% 2.28/2.49 ** KEPT (pick-wt=3): 179 [] finite($f7(A)).
% 2.28/2.49 ** KEPT (pick-wt=2): 180 [] relation($c10).
% 2.28/2.49 ** KEPT (pick-wt=2): 181 [] empty($c10).
% 2.28/2.49 ** KEPT (pick-wt=2): 182 [] function($c10).
% 2.28/2.49 ** KEPT (pick-wt=2): 183 [] relation($c11).
% 2.28/2.49 ** KEPT (pick-wt=2): 184 [] function($c11).
% 2.28/2.49 ** KEPT (pick-wt=2): 185 [] one_to_one($c11).
% 2.28/2.49 ** KEPT (pick-wt=2): 186 [] empty($c11).
% 2.28/2.49 ** KEPT (pick-wt=2): 187 [] epsilon_transitive($c11).
% 2.28/2.49 ** KEPT (pick-wt=2): 188 [] epsilon_connected($c11).
% 2.28/2.49 ** KEPT (pick-wt=2): 189 [] ordinal($c11).
% 2.28/2.49 ** KEPT (pick-wt=2): 190 [] relation($c12).
% 2.28/2.49 ** KEPT (pick-wt=2): 191 [] function($c12).
% 2.28/2.49 ** KEPT (pick-wt=2): 192 [] transfinite_se_quence($c12).
% 2.28/2.49 ** KEPT (pick-wt=2): 193 [] ordinal_yielding($c12).
% 2.28/2.49 ** KEPT (pick-wt=2): 194 [] relation($c13).
% 2.28/2.49 ** KEPT (pick-wt=5): 195 [] element($f8(A),powerset(A)).
% 2.28/2.49 ** KEPT (pick-wt=3): 196 [] empty($f8(A)).
% 2.28/2.49 ** KEPT (pick-wt=3): 197 [] element($c15,positive_rationals).
% 2.28/2.49 ** KEPT (pick-wt=2): 198 [] empty($c15).
% 2.28/2.49 ** KEPT (pick-wt=2): 199 [] epsilon_transitive($c15).
% 2.28/2.49 ** KEPT (pick-wt=2): 200 [] epsilon_connected($c15).
% 2.28/2.49 ** KEPT (pick-wt=2): 201 [] ordinal($c15).
% 2.28/2.49 ** KEPT (pick-wt=2): 202 [] natural($c15).
% 2.28/2.49 ** KEPT (pick-wt=7): 203 [] empty(A)|element($f9(A),powerset(A)).
% 2.28/2.49 ** KEPT (pick-wt=5): 204 [] empty(A)|finite($f9(A)).
% 2.28/2.49 ** KEPT (pick-wt=2): 205 [] relation($c16).
% 2.28/2.49 ** KEPT (pick-wt=2): 206 [] function($c16).
% 2.28/2.49 ** KEPT (pick-wt=2): 207 [] one_to_one($c16).
% 134.98/135.16 ** KEPT (pick-wt=2): 208 [] epsilon_transitive($c17).
% 134.98/135.16 ** KEPT (pick-wt=2): 209 [] epsilon_connected($c17).
% 134.98/135.16 ** KEPT (pick-wt=2): 210 [] ordinal($c17).
% 134.98/135.16 ** KEPT (pick-wt=2): 211 [] relation($c18).
% 134.98/135.16 ** KEPT (pick-wt=2): 212 [] relation_empty_yielding($c18).
% 134.98/135.16 ** KEPT (pick-wt=7): 213 [] empty(A)|element($f10(A),powerset(A)).
% 134.98/135.16 ** KEPT (pick-wt=5): 214 [] empty(A)|finite($f10(A)).
% 134.98/135.16 ** KEPT (pick-wt=2): 215 [] relation($c19).
% 134.98/135.16 ** KEPT (pick-wt=2): 216 [] relation_empty_yielding($c19).
% 134.98/135.16 ** KEPT (pick-wt=2): 217 [] function($c19).
% 134.98/135.16 ** KEPT (pick-wt=2): 218 [] relation($c20).
% 134.98/135.16 ** KEPT (pick-wt=2): 219 [] function($c20).
% 134.98/135.16 ** KEPT (pick-wt=2): 220 [] transfinite_se_quence($c20).
% 134.98/135.16 ** KEPT (pick-wt=2): 221 [] relation($c21).
% 134.98/135.16 ** KEPT (pick-wt=2): 222 [] relation_non_empty($c21).
% 134.98/135.16 ** KEPT (pick-wt=2): 223 [] function($c21).
% 134.98/135.16 ** KEPT (pick-wt=3): 224 [] subset(A,A).
% 134.98/135.16 ** KEPT (pick-wt=3): 225 [] inclusion_comparable(A,A).
% 134.98/135.16 ** KEPT (pick-wt=5): 226 [] set_union2(A,empty_set)=A.
% 134.98/135.16 ---> New Demodulator: 227 [new_demod,226] set_union2(A,empty_set)=A.
% 134.98/135.16 ** KEPT (pick-wt=2): 228 [] finite($c22).
% 134.98/135.16 ** KEPT (pick-wt=2): 229 [] inclusion_linear($c22).
% 134.98/135.16 Following clause subsumed by 127 during input processing: 0 [copy,127,flip.1] A=A.
% 134.98/135.16 127 back subsumes 126.
% 134.98/135.16 127 back subsumes 125.
% 134.98/135.16 127 back subsumes 124.
% 134.98/135.16 127 back subsumes 123.
% 134.98/135.16 127 back subsumes 122.
% 134.98/135.16 127 back subsumes 121.
% 134.98/135.16 127 back subsumes 120.
% 134.98/135.16 127 back subsumes 119.
% 134.98/135.16 127 back subsumes 118.
% 134.98/135.16 127 back subsumes 117.
% 134.98/135.16 127 back subsumes 116.
% 134.98/135.16 127 back subsumes 115.
% 134.98/135.16 127 back subsumes 114.
% 134.98/135.16 127 back subsumes 113.
% 134.98/135.16 127 back subsumes 112.
% 134.98/135.16 Following clause subsumed by 128 during input processing: 0 [copy,128,flip.1] set_union2(A,B)=set_union2(B,A).
% 134.98/135.16 >>>> Starting back demodulation with 144.
% 134.98/135.16 >> back demodulating 111 with 144.
% 134.98/135.16 >> back demodulating 110 with 144.
% 134.98/135.16 >> back demodulating 105 with 144.
% 134.98/135.16 224 back subsumes 109.
% 134.98/135.16 225 back subsumes 108.
% 134.98/135.16 >>>> Starting back demodulation with 227.
% 134.98/135.16
% 134.98/135.16 ======= end of input processing =======
% 134.98/135.16
% 134.98/135.16 =========== start of search ===========
% 134.98/135.16
% 134.98/135.16
% 134.98/135.16 Resetting weight limit to 4.
% 134.98/135.16
% 134.98/135.16
% 134.98/135.16 Resetting weight limit to 4.
% 134.98/135.16
% 134.98/135.16 sos_size=1511
% 134.98/135.16
% 134.98/135.16
% 134.98/135.16 Resetting weight limit to 2.
% 134.98/135.16
% 134.98/135.16
% 134.98/135.16 Resetting weight limit to 2.
% 134.98/135.16
% 134.98/135.16 sos_size=529
% 134.98/135.16
% 134.98/135.16 Search stopped because sos empty.
% 134.98/135.16
% 134.98/135.16
% 134.98/135.16 Search stopped because sos empty.
% 134.98/135.16
% 134.98/135.16 ============ end of search ============
% 134.98/135.16
% 134.98/135.16 -------------- statistics -------------
% 134.98/135.16 clauses given 582
% 134.98/135.16 clauses generated 2205316
% 134.98/135.16 clauses kept 2395
% 134.98/135.16 clauses forward subsumed 2317
% 134.98/135.16 clauses back subsumed 705
% 134.98/135.16 Kbytes malloced 6835
% 134.98/135.16
% 134.98/135.16 ----------- times (seconds) -----------
% 134.98/135.16 user CPU time 132.68 (0 hr, 2 min, 12 sec)
% 134.98/135.16 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 134.98/135.16 wall-clock time 135 (0 hr, 2 min, 15 sec)
% 134.98/135.16
% 134.98/135.16 Process 15823 finished Wed Jul 27 07:42:55 2022
% 134.98/135.16 Otter interrupted
% 134.98/135.16 PROOF NOT FOUND
%------------------------------------------------------------------------------