TSTP Solution File: SEU279+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU279+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Jul 27 13:15:26 EDT 2022
% Result : Unknown 7.62s 7.80s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU279+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Jul 27 07:47:08 EDT 2022
% 0.14/0.35 % CPUTime :
% 2.15/2.32 ----- Otter 3.3f, August 2004 -----
% 2.15/2.32 The process was started by sandbox on n021.cluster.edu,
% 2.15/2.32 Wed Jul 27 07:47:08 2022
% 2.15/2.32 The command was "./otter". The process ID is 12231.
% 2.15/2.32
% 2.15/2.32 set(prolog_style_variables).
% 2.15/2.32 set(auto).
% 2.15/2.32 dependent: set(auto1).
% 2.15/2.32 dependent: set(process_input).
% 2.15/2.32 dependent: clear(print_kept).
% 2.15/2.32 dependent: clear(print_new_demod).
% 2.15/2.32 dependent: clear(print_back_demod).
% 2.15/2.32 dependent: clear(print_back_sub).
% 2.15/2.32 dependent: set(control_memory).
% 2.15/2.32 dependent: assign(max_mem, 12000).
% 2.15/2.32 dependent: assign(pick_given_ratio, 4).
% 2.15/2.32 dependent: assign(stats_level, 1).
% 2.15/2.32 dependent: assign(max_seconds, 10800).
% 2.15/2.32 clear(print_given).
% 2.15/2.32
% 2.15/2.32 formula_list(usable).
% 2.15/2.32 all A (A=A).
% 2.15/2.32 all A B (in(A,B)-> -in(B,A)).
% 2.15/2.32 all A (empty(A)->function(A)).
% 2.15/2.32 all A (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)).
% 2.15/2.32 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.15/2.32 all A (epsilon_transitive(A)&epsilon_connected(A)->ordinal(A)).
% 2.15/2.32 all A (empty(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.15/2.32 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.15/2.32 all A B (set_union2(A,B)=set_union2(B,A)).
% 2.15/2.32 all A B (A=B<->subset(A,B)&subset(B,A)).
% 2.15/2.32 all A (relation(A)-> (all B (is_reflexive_in(A,B)<-> (all C (in(C,B)->in(ordered_pair(C,C),A)))))).
% 2.15/2.32 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 2.15/2.32 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 2.15/2.32 all A (relation(A)-> (all B (B=relation_dom(A)<-> (all C (in(C,B)<-> (exists D in(ordered_pair(C,D),A))))))).
% 2.15/2.32 all A (relation(A)-> (well_ordering(A)<->reflexive(A)&transitive(A)&antisymmetric(A)&connected(A)&well_founded_relation(A))).
% 2.15/2.32 all A B (e_quipotent(A,B)<-> (exists C (relation(C)&function(C)&one_to_one(C)&relation_dom(C)=A&relation_rng(C)=B))).
% 2.15/2.32 all A (relation(A)&function(A)-> (all B (B=relation_rng(A)<-> (all C (in(C,B)<-> (exists D (in(D,relation_dom(A))&C=apply(A,D)))))))).
% 2.15/2.32 all A (relation(A)-> (all B (B=relation_rng(A)<-> (all C (in(C,B)<-> (exists D in(ordered_pair(D,C),A))))))).
% 2.15/2.32 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 2.15/2.32 all A (relation(A)->relation_field(A)=set_union2(relation_dom(A),relation_rng(A))).
% 2.15/2.32 all A (relation(A)-> (all B (relation(B)-> (all C (relation(C)&function(C)-> (relation_isomorphism(A,B,C)<->relation_dom(C)=relation_field(A)&relation_rng(C)=relation_field(B)&one_to_one(C)& (all D E (in(ordered_pair(D,E),A)<->in(D,relation_field(A))&in(E,relation_field(A))&in(ordered_pair(apply(C,D),apply(C,E)),B))))))))).
% 2.15/2.32 all A (relation(A)-> (reflexive(A)<->is_reflexive_in(A,relation_field(A)))).
% 2.15/2.32 $T.
% 2.15/2.32 $T.
% 2.15/2.32 $T.
% 2.15/2.32 $T.
% 2.15/2.32 $T.
% 2.15/2.32 all A (relation(A)&function(A)->relation(function_inverse(A))&function(function_inverse(A))).
% 2.15/2.32 $T.
% 2.15/2.32 $T.
% 2.15/2.32 $T.
% 2.15/2.32 $T.
% 2.15/2.32 $T.
% 2.15/2.32 $T.
% 2.15/2.32 all A exists B element(B,A).
% 2.15/2.32 empty(empty_set).
% 2.15/2.32 all A B (-empty(ordered_pair(A,B))).
% 2.15/2.32 relation(empty_set).
% 2.15/2.32 relation_empty_yielding(empty_set).
% 2.15/2.32 function(empty_set).
% 2.15/2.32 one_to_one(empty_set).
% 2.15/2.32 empty(empty_set).
% 2.15/2.32 epsilon_transitive(empty_set).
% 2.15/2.32 epsilon_connected(empty_set).
% 2.15/2.32 ordinal(empty_set).
% 2.15/2.32 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 2.15/2.32 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 2.15/2.32 all A B (set_union2(A,A)=A).
% 2.15/2.32 -(all A B (relation(B)-> -(well_ordering(B)&e_quipotent(A,relation_field(B))& (all C (relation(C)-> -well_orders(C,A)))))).
% 2.15/2.32 exists A (relation(A)&function(A)).
% 2.15/2.32 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.15/2.32 exists A empty(A).
% 2.15/2.32 exists A (relation(A)&empty(A)&function(A)).
% 2.15/2.32 exists A (relation(A)&function(A)&one_to_one(A)&empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.15/2.32 exists A (-empty(A)).
% 2.15/2.32 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.15/2.32 exists A (-empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.15/2.32 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 2.15/2.32 all A B (e_quipotent(A,B)<->are_e_quipotent(A,B)).
% 2.15/2.32 all A B subset(A,A).
% 2.15/2.32 all A B e_quipotent(A,A).
% 2.15/2.32 all A B C (relation(B)&relation(C)&function(C)-> (exists D (relation(D)& (all E F (in(ordered_pair(E,F),D)<->in(E,A)&in(F,A)&in(ordered_pair(apply(C,E),apply(C,F)),B)))))).
% 2.15/2.32 all A B (e_quipotent(A,B)->e_quipotent(B,A)).
% 2.15/2.32 all A (set_union2(A,empty_set)=A).
% 2.15/2.32 all A B (in(A,B)->element(A,B)).
% 2.15/2.32 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.15/2.32 all A B C (relation(C)-> (in(ordered_pair(A,B),C)->in(A,relation_field(C))&in(B,relation_field(C)))).
% 2.15/2.32 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.15/2.32 all A (relation(A)-> (all B (relation(B)-> (all C (relation(C)&function(C)-> (relation_isomorphism(A,B,C)->relation_isomorphism(B,A,function_inverse(C)))))))).
% 2.15/2.32 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.15/2.32 all A (relation(A)-> (all B (relation(B)-> (all C (relation(C)&function(C)-> (well_ordering(A)&relation_isomorphism(A,B,C)->well_ordering(B))))))).
% 2.15/2.32 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.15/2.32 all A (empty(A)->A=empty_set).
% 2.15/2.32 all A B (-(in(A,B)&empty(B))).
% 2.15/2.32 all A B (-(empty(A)&A!=B&empty(B))).
% 2.15/2.32 all A (relation(A)-> (well_orders(A,relation_field(A))<->well_ordering(A))).
% 2.15/2.32 end_of_list.
% 2.15/2.32
% 2.15/2.32 -------> usable clausifies to:
% 2.15/2.32
% 2.15/2.32 list(usable).
% 2.15/2.32 0 [] A=A.
% 2.15/2.32 0 [] -in(A,B)| -in(B,A).
% 2.15/2.32 0 [] -empty(A)|function(A).
% 2.15/2.32 0 [] -ordinal(A)|epsilon_transitive(A).
% 2.15/2.32 0 [] -ordinal(A)|epsilon_connected(A).
% 2.15/2.32 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.15/2.32 0 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 2.15/2.32 0 [] -empty(A)|epsilon_transitive(A).
% 2.15/2.32 0 [] -empty(A)|epsilon_connected(A).
% 2.15/2.32 0 [] -empty(A)|ordinal(A).
% 2.15/2.32 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.15/2.32 0 [] set_union2(A,B)=set_union2(B,A).
% 2.15/2.32 0 [] A!=B|subset(A,B).
% 2.15/2.32 0 [] A!=B|subset(B,A).
% 2.15/2.32 0 [] A=B| -subset(A,B)| -subset(B,A).
% 2.15/2.32 0 [] -relation(A)| -is_reflexive_in(A,B)| -in(C,B)|in(ordered_pair(C,C),A).
% 2.15/2.32 0 [] -relation(A)|is_reflexive_in(A,B)|in($f1(A,B),B).
% 2.15/2.32 0 [] -relation(A)|is_reflexive_in(A,B)| -in(ordered_pair($f1(A,B),$f1(A,B)),A).
% 2.15/2.32 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 2.15/2.32 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 2.15/2.32 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 2.15/2.32 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.15/2.32 0 [] C=set_union2(A,B)| -in($f2(A,B,C),C)| -in($f2(A,B,C),A).
% 2.15/2.32 0 [] C=set_union2(A,B)| -in($f2(A,B,C),C)| -in($f2(A,B,C),B).
% 2.15/2.32 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.15/2.32 0 [] subset(A,B)|in($f3(A,B),A).
% 2.15/2.32 0 [] subset(A,B)| -in($f3(A,B),B).
% 2.15/2.32 0 [] -relation(A)|B!=relation_dom(A)| -in(C,B)|in(ordered_pair(C,$f4(A,B,C)),A).
% 2.15/2.32 0 [] -relation(A)|B!=relation_dom(A)|in(C,B)| -in(ordered_pair(C,D),A).
% 2.15/2.32 0 [] -relation(A)|B=relation_dom(A)|in($f6(A,B),B)|in(ordered_pair($f6(A,B),$f5(A,B)),A).
% 2.15/2.32 0 [] -relation(A)|B=relation_dom(A)| -in($f6(A,B),B)| -in(ordered_pair($f6(A,B),X1),A).
% 2.15/2.32 0 [] -relation(A)| -well_ordering(A)|reflexive(A).
% 2.15/2.32 0 [] -relation(A)| -well_ordering(A)|transitive(A).
% 2.15/2.32 0 [] -relation(A)| -well_ordering(A)|antisymmetric(A).
% 2.15/2.32 0 [] -relation(A)| -well_ordering(A)|connected(A).
% 2.15/2.32 0 [] -relation(A)| -well_ordering(A)|well_founded_relation(A).
% 2.15/2.32 0 [] -relation(A)|well_ordering(A)| -reflexive(A)| -transitive(A)| -antisymmetric(A)| -connected(A)| -well_founded_relation(A).
% 2.15/2.32 0 [] -e_quipotent(A,B)|relation($f7(A,B)).
% 2.15/2.32 0 [] -e_quipotent(A,B)|function($f7(A,B)).
% 2.15/2.32 0 [] -e_quipotent(A,B)|one_to_one($f7(A,B)).
% 2.15/2.32 0 [] -e_quipotent(A,B)|relation_dom($f7(A,B))=A.
% 2.15/2.32 0 [] -e_quipotent(A,B)|relation_rng($f7(A,B))=B.
% 2.15/2.32 0 [] e_quipotent(A,B)| -relation(C)| -function(C)| -one_to_one(C)|relation_dom(C)!=A|relation_rng(C)!=B.
% 2.15/2.32 0 [] -relation(A)| -function(A)|B!=relation_rng(A)| -in(C,B)|in($f8(A,B,C),relation_dom(A)).
% 2.15/2.32 0 [] -relation(A)| -function(A)|B!=relation_rng(A)| -in(C,B)|C=apply(A,$f8(A,B,C)).
% 2.15/2.32 0 [] -relation(A)| -function(A)|B!=relation_rng(A)|in(C,B)| -in(D,relation_dom(A))|C!=apply(A,D).
% 2.15/2.32 0 [] -relation(A)| -function(A)|B=relation_rng(A)|in($f10(A,B),B)|in($f9(A,B),relation_dom(A)).
% 2.15/2.32 0 [] -relation(A)| -function(A)|B=relation_rng(A)|in($f10(A,B),B)|$f10(A,B)=apply(A,$f9(A,B)).
% 2.15/2.32 0 [] -relation(A)| -function(A)|B=relation_rng(A)| -in($f10(A,B),B)| -in(X2,relation_dom(A))|$f10(A,B)!=apply(A,X2).
% 2.15/2.32 0 [] -relation(A)|B!=relation_rng(A)| -in(C,B)|in(ordered_pair($f11(A,B,C),C),A).
% 2.15/2.32 0 [] -relation(A)|B!=relation_rng(A)|in(C,B)| -in(ordered_pair(D,C),A).
% 2.15/2.32 0 [] -relation(A)|B=relation_rng(A)|in($f13(A,B),B)|in(ordered_pair($f12(A,B),$f13(A,B)),A).
% 2.15/2.32 0 [] -relation(A)|B=relation_rng(A)| -in($f13(A,B),B)| -in(ordered_pair(X3,$f13(A,B)),A).
% 2.15/2.32 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.15/2.32 0 [] -relation(A)|relation_field(A)=set_union2(relation_dom(A),relation_rng(A)).
% 2.15/2.32 0 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)|relation_dom(C)=relation_field(A).
% 2.15/2.32 0 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)|relation_rng(C)=relation_field(B).
% 2.15/2.32 0 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)|one_to_one(C).
% 2.15/2.32 0 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)| -in(ordered_pair(D,E),A)|in(D,relation_field(A)).
% 2.15/2.32 0 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)| -in(ordered_pair(D,E),A)|in(E,relation_field(A)).
% 2.15/2.32 0 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)| -in(ordered_pair(D,E),A)|in(ordered_pair(apply(C,D),apply(C,E)),B).
% 2.15/2.32 0 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)|in(ordered_pair(D,E),A)| -in(D,relation_field(A))| -in(E,relation_field(A))| -in(ordered_pair(apply(C,D),apply(C,E)),B).
% 2.15/2.32 0 [] -relation(A)| -relation(B)| -relation(C)| -function(C)|relation_isomorphism(A,B,C)|relation_dom(C)!=relation_field(A)|relation_rng(C)!=relation_field(B)| -one_to_one(C)|in(ordered_pair($f15(A,B,C),$f14(A,B,C)),A)|in($f15(A,B,C),relation_field(A)).
% 2.15/2.32 0 [] -relation(A)| -relation(B)| -relation(C)| -function(C)|relation_isomorphism(A,B,C)|relation_dom(C)!=relation_field(A)|relation_rng(C)!=relation_field(B)| -one_to_one(C)|in(ordered_pair($f15(A,B,C),$f14(A,B,C)),A)|in($f14(A,B,C),relation_field(A)).
% 2.15/2.32 0 [] -relation(A)| -relation(B)| -relation(C)| -function(C)|relation_isomorphism(A,B,C)|relation_dom(C)!=relation_field(A)|relation_rng(C)!=relation_field(B)| -one_to_one(C)|in(ordered_pair($f15(A,B,C),$f14(A,B,C)),A)|in(ordered_pair(apply(C,$f15(A,B,C)),apply(C,$f14(A,B,C))),B).
% 2.15/2.32 0 [] -relation(A)| -relation(B)| -relation(C)| -function(C)|relation_isomorphism(A,B,C)|relation_dom(C)!=relation_field(A)|relation_rng(C)!=relation_field(B)| -one_to_one(C)| -in(ordered_pair($f15(A,B,C),$f14(A,B,C)),A)| -in($f15(A,B,C),relation_field(A))| -in($f14(A,B,C),relation_field(A))| -in(ordered_pair(apply(C,$f15(A,B,C)),apply(C,$f14(A,B,C))),B).
% 2.15/2.32 0 [] -relation(A)| -reflexive(A)|is_reflexive_in(A,relation_field(A)).
% 2.15/2.32 0 [] -relation(A)|reflexive(A)| -is_reflexive_in(A,relation_field(A)).
% 2.15/2.32 0 [] $T.
% 2.15/2.32 0 [] $T.
% 2.15/2.32 0 [] $T.
% 2.15/2.32 0 [] $T.
% 2.15/2.32 0 [] $T.
% 2.15/2.32 0 [] -relation(A)| -function(A)|relation(function_inverse(A)).
% 2.15/2.32 0 [] -relation(A)| -function(A)|function(function_inverse(A)).
% 2.15/2.32 0 [] $T.
% 2.15/2.32 0 [] $T.
% 2.15/2.32 0 [] $T.
% 2.15/2.32 0 [] $T.
% 2.15/2.32 0 [] $T.
% 2.15/2.32 0 [] $T.
% 2.15/2.32 0 [] element($f16(A),A).
% 2.15/2.32 0 [] empty(empty_set).
% 2.15/2.32 0 [] -empty(ordered_pair(A,B)).
% 2.15/2.32 0 [] relation(empty_set).
% 2.15/2.32 0 [] relation_empty_yielding(empty_set).
% 2.15/2.32 0 [] function(empty_set).
% 2.15/2.32 0 [] one_to_one(empty_set).
% 2.15/2.32 0 [] empty(empty_set).
% 2.15/2.32 0 [] epsilon_transitive(empty_set).
% 2.15/2.32 0 [] epsilon_connected(empty_set).
% 2.15/2.32 0 [] ordinal(empty_set).
% 2.15/2.32 0 [] empty(A)| -empty(set_union2(A,B)).
% 2.15/2.32 0 [] empty(A)| -empty(set_union2(B,A)).
% 2.15/2.32 0 [] set_union2(A,A)=A.
% 2.15/2.32 0 [] relation($c1).
% 2.15/2.32 0 [] well_ordering($c1).
% 2.15/2.32 0 [] e_quipotent($c2,relation_field($c1)).
% 2.15/2.32 0 [] -relation(C)| -well_orders(C,$c2).
% 2.15/2.32 0 [] relation($c3).
% 2.15/2.32 0 [] function($c3).
% 2.15/2.32 0 [] epsilon_transitive($c4).
% 2.15/2.32 0 [] epsilon_connected($c4).
% 2.15/2.32 0 [] ordinal($c4).
% 2.15/2.32 0 [] empty($c5).
% 2.15/2.32 0 [] relation($c6).
% 2.15/2.32 0 [] empty($c6).
% 2.15/2.32 0 [] function($c6).
% 2.15/2.32 0 [] relation($c7).
% 2.15/2.32 0 [] function($c7).
% 2.15/2.32 0 [] one_to_one($c7).
% 2.15/2.32 0 [] empty($c7).
% 2.15/2.32 0 [] epsilon_transitive($c7).
% 2.15/2.32 0 [] epsilon_connected($c7).
% 2.15/2.32 0 [] ordinal($c7).
% 2.15/2.32 0 [] -empty($c8).
% 2.15/2.32 0 [] relation($c9).
% 2.15/2.32 0 [] function($c9).
% 2.15/2.32 0 [] one_to_one($c9).
% 2.15/2.32 0 [] -empty($c10).
% 2.15/2.32 0 [] epsilon_transitive($c10).
% 2.15/2.32 0 [] epsilon_connected($c10).
% 2.15/2.32 0 [] ordinal($c10).
% 2.15/2.32 0 [] relation($c11).
% 2.15/2.32 0 [] relation_empty_yielding($c11).
% 2.15/2.32 0 [] function($c11).
% 2.15/2.32 0 [] -e_quipotent(A,B)|are_e_quipotent(A,B).
% 2.15/2.32 0 [] e_quipotent(A,B)| -are_e_quipotent(A,B).
% 2.15/2.32 0 [] subset(A,A).
% 2.15/2.32 0 [] e_quipotent(A,A).
% 2.15/2.32 0 [] -relation(B)| -relation(C)| -function(C)|relation($f17(A,B,C)).
% 2.15/2.32 0 [] -relation(B)| -relation(C)| -function(C)| -in(ordered_pair(E,F),$f17(A,B,C))|in(E,A).
% 2.15/2.32 0 [] -relation(B)| -relation(C)| -function(C)| -in(ordered_pair(E,F),$f17(A,B,C))|in(F,A).
% 2.15/2.33 0 [] -relation(B)| -relation(C)| -function(C)| -in(ordered_pair(E,F),$f17(A,B,C))|in(ordered_pair(apply(C,E),apply(C,F)),B).
% 2.15/2.33 0 [] -relation(B)| -relation(C)| -function(C)|in(ordered_pair(E,F),$f17(A,B,C))| -in(E,A)| -in(F,A)| -in(ordered_pair(apply(C,E),apply(C,F)),B).
% 2.15/2.33 0 [] -e_quipotent(A,B)|e_quipotent(B,A).
% 2.15/2.33 0 [] set_union2(A,empty_set)=A.
% 2.15/2.33 0 [] -in(A,B)|element(A,B).
% 2.15/2.33 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.15/2.33 0 [] -relation(C)| -in(ordered_pair(A,B),C)|in(A,relation_field(C)).
% 2.15/2.33 0 [] -relation(C)| -in(ordered_pair(A,B),C)|in(B,relation_field(C)).
% 2.15/2.33 0 [] -element(A,powerset(B))|subset(A,B).
% 2.15/2.33 0 [] element(A,powerset(B))| -subset(A,B).
% 2.15/2.33 0 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)|relation_isomorphism(B,A,function_inverse(C)).
% 2.15/2.33 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.15/2.33 0 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -well_ordering(A)| -relation_isomorphism(A,B,C)|well_ordering(B).
% 2.15/2.33 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.15/2.33 0 [] -empty(A)|A=empty_set.
% 2.15/2.33 0 [] -in(A,B)| -empty(B).
% 2.15/2.33 0 [] -empty(A)|A=B| -empty(B).
% 2.15/2.33 0 [] -relation(A)| -well_orders(A,relation_field(A))|well_ordering(A).
% 2.15/2.33 0 [] -relation(A)|well_orders(A,relation_field(A))| -well_ordering(A).
% 2.15/2.33 end_of_list.
% 2.15/2.33
% 2.15/2.33 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=12.
% 2.15/2.33
% 2.15/2.33 This ia a non-Horn set with equality. The strategy will be
% 2.15/2.33 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.15/2.33 deletion, with positive clauses in sos and nonpositive
% 2.15/2.33 clauses in usable.
% 2.15/2.33
% 2.15/2.33 dependent: set(knuth_bendix).
% 2.15/2.33 dependent: set(anl_eq).
% 2.15/2.33 dependent: set(para_from).
% 2.15/2.33 dependent: set(para_into).
% 2.15/2.33 dependent: clear(para_from_right).
% 2.15/2.33 dependent: clear(para_into_right).
% 2.15/2.33 dependent: set(para_from_vars).
% 2.15/2.33 dependent: set(eq_units_both_ways).
% 2.15/2.33 dependent: set(dynamic_demod_all).
% 2.15/2.33 dependent: set(dynamic_demod).
% 2.15/2.33 dependent: set(order_eq).
% 2.15/2.33 dependent: set(back_demod).
% 2.15/2.33 dependent: set(lrpo).
% 2.15/2.33 dependent: set(hyper_res).
% 2.15/2.33 dependent: set(unit_deletion).
% 2.15/2.33 dependent: set(factor).
% 2.15/2.33
% 2.15/2.33 ------------> process usable:
% 2.15/2.33 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.15/2.33 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 2.15/2.33 ** KEPT (pick-wt=4): 3 [] -ordinal(A)|epsilon_transitive(A).
% 2.15/2.33 ** KEPT (pick-wt=4): 4 [] -ordinal(A)|epsilon_connected(A).
% 2.15/2.33 ** KEPT (pick-wt=8): 5 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.15/2.33 ** KEPT (pick-wt=6): 6 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 2.15/2.33 ** KEPT (pick-wt=4): 7 [] -empty(A)|epsilon_transitive(A).
% 2.15/2.33 ** KEPT (pick-wt=4): 8 [] -empty(A)|epsilon_connected(A).
% 2.15/2.33 ** KEPT (pick-wt=4): 9 [] -empty(A)|ordinal(A).
% 2.15/2.33 ** KEPT (pick-wt=6): 10 [] A!=B|subset(A,B).
% 2.15/2.33 ** KEPT (pick-wt=6): 11 [] A!=B|subset(B,A).
% 2.15/2.33 ** KEPT (pick-wt=9): 12 [] A=B| -subset(A,B)| -subset(B,A).
% 2.15/2.33 ** KEPT (pick-wt=13): 13 [] -relation(A)| -is_reflexive_in(A,B)| -in(C,B)|in(ordered_pair(C,C),A).
% 2.15/2.33 ** KEPT (pick-wt=10): 14 [] -relation(A)|is_reflexive_in(A,B)|in($f1(A,B),B).
% 2.15/2.33 ** KEPT (pick-wt=14): 15 [] -relation(A)|is_reflexive_in(A,B)| -in(ordered_pair($f1(A,B),$f1(A,B)),A).
% 2.15/2.33 ** KEPT (pick-wt=14): 16 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 2.15/2.33 ** KEPT (pick-wt=11): 17 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 2.15/2.33 ** KEPT (pick-wt=11): 18 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 2.15/2.33 ** KEPT (pick-wt=17): 19 [] A=set_union2(B,C)| -in($f2(B,C,A),A)| -in($f2(B,C,A),B).
% 2.15/2.33 ** KEPT (pick-wt=17): 20 [] A=set_union2(B,C)| -in($f2(B,C,A),A)| -in($f2(B,C,A),C).
% 2.15/2.33 ** KEPT (pick-wt=9): 21 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.15/2.33 ** KEPT (pick-wt=8): 22 [] subset(A,B)| -in($f3(A,B),B).
% 2.15/2.33 ** KEPT (pick-wt=17): 23 [] -relation(A)|B!=relation_dom(A)| -in(C,B)|in(ordered_pair(C,$f4(A,B,C)),A).
% 2.15/2.33 ** KEPT (pick-wt=14): 24 [] -relation(A)|B!=relation_dom(A)|in(C,B)| -in(ordered_pair(C,D),A).
% 2.15/2.33 ** KEPT (pick-wt=20): 25 [] -relation(A)|B=relation_dom(A)|in($f6(A,B),B)|in(ordered_pair($f6(A,B),$f5(A,B)),A).
% 2.15/2.33 ** KEPT (pick-wt=18): 26 [] -relation(A)|B=relation_dom(A)| -in($f6(A,B),B)| -in(ordered_pair($f6(A,B),C),A).
% 2.15/2.33 ** KEPT (pick-wt=6): 27 [] -relation(A)| -well_ordering(A)|reflexive(A).
% 2.15/2.33 ** KEPT (pick-wt=6): 28 [] -relation(A)| -well_ordering(A)|transitive(A).
% 2.15/2.34 ** KEPT (pick-wt=6): 29 [] -relation(A)| -well_ordering(A)|antisymmetric(A).
% 2.15/2.34 ** KEPT (pick-wt=6): 30 [] -relation(A)| -well_ordering(A)|connected(A).
% 2.15/2.34 ** KEPT (pick-wt=6): 31 [] -relation(A)| -well_ordering(A)|well_founded_relation(A).
% 2.15/2.34 ** KEPT (pick-wt=14): 32 [] -relation(A)|well_ordering(A)| -reflexive(A)| -transitive(A)| -antisymmetric(A)| -connected(A)| -well_founded_relation(A).
% 2.15/2.34 ** KEPT (pick-wt=7): 33 [] -e_quipotent(A,B)|relation($f7(A,B)).
% 2.15/2.34 ** KEPT (pick-wt=7): 34 [] -e_quipotent(A,B)|function($f7(A,B)).
% 2.15/2.34 ** KEPT (pick-wt=7): 35 [] -e_quipotent(A,B)|one_to_one($f7(A,B)).
% 2.15/2.34 ** KEPT (pick-wt=9): 36 [] -e_quipotent(A,B)|relation_dom($f7(A,B))=A.
% 2.15/2.34 ** KEPT (pick-wt=9): 37 [] -e_quipotent(A,B)|relation_rng($f7(A,B))=B.
% 2.15/2.34 ** KEPT (pick-wt=17): 38 [] e_quipotent(A,B)| -relation(C)| -function(C)| -one_to_one(C)|relation_dom(C)!=A|relation_rng(C)!=B.
% 2.15/2.34 ** KEPT (pick-wt=18): 39 [] -relation(A)| -function(A)|B!=relation_rng(A)| -in(C,B)|in($f8(A,B,C),relation_dom(A)).
% 2.15/2.34 ** KEPT (pick-wt=19): 41 [copy,40,flip.5] -relation(A)| -function(A)|B!=relation_rng(A)| -in(C,B)|apply(A,$f8(A,B,C))=C.
% 2.15/2.34 ** KEPT (pick-wt=20): 42 [] -relation(A)| -function(A)|B!=relation_rng(A)|in(C,B)| -in(D,relation_dom(A))|C!=apply(A,D).
% 2.15/2.34 ** KEPT (pick-wt=19): 43 [] -relation(A)| -function(A)|B=relation_rng(A)|in($f10(A,B),B)|in($f9(A,B),relation_dom(A)).
% 2.15/2.34 ** KEPT (pick-wt=22): 45 [copy,44,flip.5] -relation(A)| -function(A)|B=relation_rng(A)|in($f10(A,B),B)|apply(A,$f9(A,B))=$f10(A,B).
% 2.15/2.34 ** KEPT (pick-wt=24): 46 [] -relation(A)| -function(A)|B=relation_rng(A)| -in($f10(A,B),B)| -in(C,relation_dom(A))|$f10(A,B)!=apply(A,C).
% 2.15/2.34 ** KEPT (pick-wt=17): 47 [] -relation(A)|B!=relation_rng(A)| -in(C,B)|in(ordered_pair($f11(A,B,C),C),A).
% 2.15/2.34 ** KEPT (pick-wt=14): 48 [] -relation(A)|B!=relation_rng(A)|in(C,B)| -in(ordered_pair(D,C),A).
% 2.15/2.34 ** KEPT (pick-wt=20): 49 [] -relation(A)|B=relation_rng(A)|in($f13(A,B),B)|in(ordered_pair($f12(A,B),$f13(A,B)),A).
% 2.15/2.34 ** KEPT (pick-wt=18): 50 [] -relation(A)|B=relation_rng(A)| -in($f13(A,B),B)| -in(ordered_pair(C,$f13(A,B)),A).
% 2.15/2.34 ** KEPT (pick-wt=10): 52 [copy,51,flip.2] -relation(A)|set_union2(relation_dom(A),relation_rng(A))=relation_field(A).
% 2.20/2.34 ** KEPT (pick-wt=17): 53 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)|relation_dom(C)=relation_field(A).
% 2.20/2.34 ** KEPT (pick-wt=17): 54 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)|relation_rng(C)=relation_field(B).
% 2.20/2.34 ** KEPT (pick-wt=14): 55 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)|one_to_one(C).
% 2.20/2.34 ** KEPT (pick-wt=21): 56 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)| -in(ordered_pair(D,E),A)|in(D,relation_field(A)).
% 2.20/2.34 ** KEPT (pick-wt=21): 57 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)| -in(ordered_pair(D,E),A)|in(E,relation_field(A)).
% 2.20/2.34 ** KEPT (pick-wt=26): 58 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)| -in(ordered_pair(D,E),A)|in(ordered_pair(apply(C,D),apply(C,E)),B).
% 2.20/2.34 ** KEPT (pick-wt=34): 59 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)|in(ordered_pair(D,E),A)| -in(D,relation_field(A))| -in(E,relation_field(A))| -in(ordered_pair(apply(C,D),apply(C,E)),B).
% 2.20/2.34 ** KEPT (pick-wt=42): 60 [] -relation(A)| -relation(B)| -relation(C)| -function(C)|relation_isomorphism(A,B,C)|relation_dom(C)!=relation_field(A)|relation_rng(C)!=relation_field(B)| -one_to_one(C)|in(ordered_pair($f15(A,B,C),$f14(A,B,C)),A)|in($f15(A,B,C),relation_field(A)).
% 2.20/2.34 ** KEPT (pick-wt=42): 61 [] -relation(A)| -relation(B)| -relation(C)| -function(C)|relation_isomorphism(A,B,C)|relation_dom(C)!=relation_field(A)|relation_rng(C)!=relation_field(B)| -one_to_one(C)|in(ordered_pair($f15(A,B,C),$f14(A,B,C)),A)|in($f14(A,B,C),relation_field(A)).
% 2.20/2.34 ** KEPT (pick-wt=50): 62 [] -relation(A)| -relation(B)| -relation(C)| -function(C)|relation_isomorphism(A,B,C)|relation_dom(C)!=relation_field(A)|relation_rng(C)!=relation_field(B)| -one_to_one(C)|in(ordered_pair($f15(A,B,C),$f14(A,B,C)),A)|in(ordered_pair(apply(C,$f15(A,B,C)),apply(C,$f14(A,B,C))),B).
% 2.20/2.34 ** KEPT (pick-wt=64): 63 [] -relation(A)| -relation(B)| -relation(C)| -function(C)|relation_isomorphism(A,B,C)|relation_dom(C)!=relation_field(A)|relation_rng(C)!=relation_field(B)| -one_to_one(C)| -in(ordered_pair($f15(A,B,C),$f14(A,B,C)),A)| -in($f15(A,B,C),relation_field(A))| -in($f14(A,B,C),relation_field(A))| -in(ordered_pair(apply(C,$f15(A,B,C)),apply(C,$f14(A,B,C))),B).
% 2.20/2.34 ** KEPT (pick-wt=8): 64 [] -relation(A)| -reflexive(A)|is_reflexive_in(A,relation_field(A)).
% 2.20/2.34 ** KEPT (pick-wt=8): 65 [] -relation(A)|reflexive(A)| -is_reflexive_in(A,relation_field(A)).
% 2.20/2.34 ** KEPT (pick-wt=7): 66 [] -relation(A)| -function(A)|relation(function_inverse(A)).
% 2.20/2.34 ** KEPT (pick-wt=7): 67 [] -relation(A)| -function(A)|function(function_inverse(A)).
% 2.20/2.34 ** KEPT (pick-wt=4): 68 [] -empty(ordered_pair(A,B)).
% 2.20/2.34 ** KEPT (pick-wt=6): 69 [] empty(A)| -empty(set_union2(A,B)).
% 2.20/2.34 ** KEPT (pick-wt=6): 70 [] empty(A)| -empty(set_union2(B,A)).
% 2.20/2.34 ** KEPT (pick-wt=5): 71 [] -relation(A)| -well_orders(A,$c2).
% 2.20/2.34 ** KEPT (pick-wt=2): 72 [] -empty($c8).
% 2.20/2.34 ** KEPT (pick-wt=2): 73 [] -empty($c10).
% 2.20/2.34 ** KEPT (pick-wt=6): 74 [] -e_quipotent(A,B)|are_e_quipotent(A,B).
% 2.20/2.34 ** KEPT (pick-wt=6): 75 [] e_quipotent(A,B)| -are_e_quipotent(A,B).
% 2.20/2.34 ** KEPT (pick-wt=11): 76 [] -relation(A)| -relation(B)| -function(B)|relation($f17(C,A,B)).
% 2.20/2.34 ** KEPT (pick-wt=17): 77 [] -relation(A)| -relation(B)| -function(B)| -in(ordered_pair(C,D),$f17(E,A,B))|in(C,E).
% 2.20/2.34 ** KEPT (pick-wt=17): 78 [] -relation(A)| -relation(B)| -function(B)| -in(ordered_pair(C,D),$f17(E,A,B))|in(D,E).
% 2.20/2.34 ** KEPT (pick-wt=23): 79 [] -relation(A)| -relation(B)| -function(B)| -in(ordered_pair(C,D),$f17(E,A,B))|in(ordered_pair(apply(B,C),apply(B,D)),A).
% 2.20/2.34 ** KEPT (pick-wt=29): 80 [] -relation(A)| -relation(B)| -function(B)|in(ordered_pair(C,D),$f17(E,A,B))| -in(C,E)| -in(D,E)| -in(ordered_pair(apply(B,C),apply(B,D)),A).
% 2.20/2.34 ** KEPT (pick-wt=6): 81 [] -e_quipotent(A,B)|e_quipotent(B,A).
% 2.20/2.34 ** KEPT (pick-wt=6): 82 [] -in(A,B)|element(A,B).
% 2.20/2.34 ** KEPT (pick-wt=8): 83 [] -element(A,B)|empty(B)|in(A,B).
% 2.20/2.34 ** KEPT (pick-wt=11): 84 [] -relation(A)| -in(ordered_pair(B,C),A)|in(B,relation_field(A)).
% 2.20/2.34 ** KEPT (pick-wt=11): 85 [] -relation(A)| -in(ordered_pair(B,C),A)|in(C,relation_field(A)).
% 2.20/2.34 ** KEPT (pick-wt=7): 86 [] -element(A,powerset(B))|subset(A,B).
% 2.20/2.34 ** KEPT (pick-wt=7): 87 [] element(A,powerset(B))| -subset(A,B).
% 2.20/2.34 ** KEPT (pick-wt=17): 88 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)|relation_isomorphism(B,A,function_inverse(C)).
% 2.20/2.34 ** KEPT (pick-wt=10): 89 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.20/2.34 ** KEPT (pick-wt=16): 90 [] -relation(A)| -relation(B)| -relation(C)| -function(C)| -well_ordering(A)| -relation_isomorphism(A,B,C)|well_ordering(B).
% 2.20/2.34 ** KEPT (pick-wt=9): 91 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.20/2.34 ** KEPT (pick-wt=5): 92 [] -empty(A)|A=empty_set.
% 2.20/2.34 ** KEPT (pick-wt=5): 93 [] -in(A,B)| -empty(B).
% 2.20/2.34 ** KEPT (pick-wt=7): 94 [] -empty(A)|A=B| -empty(B).
% 2.20/2.34 ** KEPT (pick-wt=8): 95 [] -relation(A)| -well_orders(A,relation_field(A))|well_ordering(A).
% 2.20/2.34 ** KEPT (pick-wt=8): 96 [] -relation(A)|well_orders(A,relation_field(A))| -well_ordering(A).
% 2.20/2.34 84 back subsumes 56.
% 2.20/2.34 85 back subsumes 57.
% 2.20/2.34
% 2.20/2.34 ------------> process sos:
% 2.20/2.34 ** KEPT (pick-wt=3): 158 [] A=A.
% 2.20/2.34 ** KEPT (pick-wt=7): 159 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.20/2.34 ** KEPT (pick-wt=7): 160 [] set_union2(A,B)=set_union2(B,A).
% 2.20/2.34 ** KEPT (pick-wt=23): 161 [] A=set_union2(B,C)|in($f2(B,C,A),A)|in($f2(B,C,A),B)|in($f2(B,C,A),C).
% 2.20/2.34 ** KEPT (pick-wt=8): 162 [] subset(A,B)|in($f3(A,B),A).
% 2.20/2.34 ** KEPT (pick-wt=10): 164 [copy,163,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.20/2.34 ---> New Demodulator: 165 [new_demod,164] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.20/2.34 ** KEPT (pick-wt=4): 166 [] element($f16(A),A).
% 2.20/2.34 ** KEPT (pick-wt=2): 167 [] empty(empty_set).
% 2.20/2.34 ** KEPT (pick-wt=2): 168 [] relation(empty_set).
% 2.20/2.34 ** KEPT (pick-wt=2): 169 [] relation_empty_yielding(empty_set).
% 2.20/2.34 ** KEPT (pick-wt=2): 170 [] function(empty_set).
% 2.20/2.34 ** KEPT (pick-wt=2): 171 [] one_to_one(empty_set).
% 7.62/7.80 Following clause subsumed by 167 during input processing: 0 [] empty(empty_set).
% 7.62/7.80 ** KEPT (pick-wt=2): 172 [] epsilon_transitive(empty_set).
% 7.62/7.80 ** KEPT (pick-wt=2): 173 [] epsilon_connected(empty_set).
% 7.62/7.80 ** KEPT (pick-wt=2): 174 [] ordinal(empty_set).
% 7.62/7.80 ** KEPT (pick-wt=5): 175 [] set_union2(A,A)=A.
% 7.62/7.80 ---> New Demodulator: 176 [new_demod,175] set_union2(A,A)=A.
% 7.62/7.80 ** KEPT (pick-wt=2): 177 [] relation($c1).
% 7.62/7.80 ** KEPT (pick-wt=2): 178 [] well_ordering($c1).
% 7.62/7.80 ** KEPT (pick-wt=4): 179 [] e_quipotent($c2,relation_field($c1)).
% 7.62/7.80 ** KEPT (pick-wt=2): 180 [] relation($c3).
% 7.62/7.80 ** KEPT (pick-wt=2): 181 [] function($c3).
% 7.62/7.80 ** KEPT (pick-wt=2): 182 [] epsilon_transitive($c4).
% 7.62/7.80 ** KEPT (pick-wt=2): 183 [] epsilon_connected($c4).
% 7.62/7.80 ** KEPT (pick-wt=2): 184 [] ordinal($c4).
% 7.62/7.80 ** KEPT (pick-wt=2): 185 [] empty($c5).
% 7.62/7.80 ** KEPT (pick-wt=2): 186 [] relation($c6).
% 7.62/7.80 ** KEPT (pick-wt=2): 187 [] empty($c6).
% 7.62/7.80 ** KEPT (pick-wt=2): 188 [] function($c6).
% 7.62/7.80 ** KEPT (pick-wt=2): 189 [] relation($c7).
% 7.62/7.80 ** KEPT (pick-wt=2): 190 [] function($c7).
% 7.62/7.80 ** KEPT (pick-wt=2): 191 [] one_to_one($c7).
% 7.62/7.80 ** KEPT (pick-wt=2): 192 [] empty($c7).
% 7.62/7.80 ** KEPT (pick-wt=2): 193 [] epsilon_transitive($c7).
% 7.62/7.80 ** KEPT (pick-wt=2): 194 [] epsilon_connected($c7).
% 7.62/7.80 ** KEPT (pick-wt=2): 195 [] ordinal($c7).
% 7.62/7.80 ** KEPT (pick-wt=2): 196 [] relation($c9).
% 7.62/7.80 ** KEPT (pick-wt=2): 197 [] function($c9).
% 7.62/7.80 ** KEPT (pick-wt=2): 198 [] one_to_one($c9).
% 7.62/7.80 ** KEPT (pick-wt=2): 199 [] epsilon_transitive($c10).
% 7.62/7.80 ** KEPT (pick-wt=2): 200 [] epsilon_connected($c10).
% 7.62/7.80 ** KEPT (pick-wt=2): 201 [] ordinal($c10).
% 7.62/7.80 ** KEPT (pick-wt=2): 202 [] relation($c11).
% 7.62/7.80 ** KEPT (pick-wt=2): 203 [] relation_empty_yielding($c11).
% 7.62/7.80 ** KEPT (pick-wt=2): 204 [] function($c11).
% 7.62/7.80 ** KEPT (pick-wt=3): 205 [] subset(A,A).
% 7.62/7.80 ** KEPT (pick-wt=3): 206 [] e_quipotent(A,A).
% 7.62/7.80 ** KEPT (pick-wt=5): 207 [] set_union2(A,empty_set)=A.
% 7.62/7.80 ---> New Demodulator: 208 [new_demod,207] set_union2(A,empty_set)=A.
% 7.62/7.80 Following clause subsumed by 158 during input processing: 0 [copy,158,flip.1] A=A.
% 7.62/7.80 158 back subsumes 142.
% 7.62/7.80 158 back subsumes 98.
% 7.62/7.80 Following clause subsumed by 159 during input processing: 0 [copy,159,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 7.62/7.80 Following clause subsumed by 160 during input processing: 0 [copy,160,flip.1] set_union2(A,B)=set_union2(B,A).
% 7.62/7.80 >>>> Starting back demodulation with 165.
% 7.62/7.80 >>>> Starting back demodulation with 176.
% 7.62/7.80 >> back demodulating 99 with 176.
% 7.62/7.80 >>>> Starting back demodulation with 208.
% 7.62/7.80
% 7.62/7.80 ======= end of input processing =======
% 7.62/7.80
% 7.62/7.80 =========== start of search ===========
% 7.62/7.80
% 7.62/7.80
% 7.62/7.80 Resetting weight limit to 14.
% 7.62/7.80
% 7.62/7.80
% 7.62/7.80 Resetting weight limit to 14.
% 7.62/7.80
% 7.62/7.80 sos_size=2370
% 7.62/7.80
% 7.62/7.80
% 7.62/7.80 Resetting weight limit to 11.
% 7.62/7.80
% 7.62/7.80
% 7.62/7.80 Resetting weight limit to 11.
% 7.62/7.80
% 7.62/7.80 sos_size=2255
% 7.62/7.80
% 7.62/7.80
% 7.62/7.80 Resetting weight limit to 8.
% 7.62/7.80
% 7.62/7.80
% 7.62/7.80 Resetting weight limit to 8.
% 7.62/7.80
% 7.62/7.80 sos_size=2288
% 7.62/7.80
% 7.62/7.80
% 7.62/7.80 Resetting weight limit to 7.
% 7.62/7.80
% 7.62/7.80
% 7.62/7.80 Resetting weight limit to 7.
% 7.62/7.80
% 7.62/7.80 sos_size=2439
% 7.62/7.80
% 7.62/7.80 Search stopped in tp_alloc by max_mem option.
% 7.62/7.80
% 7.62/7.80 Search stopped in tp_alloc by max_mem option.
% 7.62/7.80
% 7.62/7.80 ============ end of search ============
% 7.62/7.80
% 7.62/7.80 -------------- statistics -------------
% 7.62/7.80 clauses given 107
% 7.62/7.80 clauses generated 12938
% 7.62/7.80 clauses kept 2931
% 7.62/7.80 clauses forward subsumed 3775
% 7.62/7.80 clauses back subsumed 10
% 7.62/7.80 Kbytes malloced 11718
% 7.62/7.80
% 7.62/7.80 ----------- times (seconds) -----------
% 7.62/7.80 user CPU time 5.47 (0 hr, 0 min, 5 sec)
% 7.62/7.80 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 7.62/7.80 wall-clock time 7 (0 hr, 0 min, 7 sec)
% 7.62/7.80
% 7.62/7.80 Process 12231 finished Wed Jul 27 07:47:15 2022
% 7.62/7.80 Otter interrupted
% 7.62/7.80 PROOF NOT FOUND
%------------------------------------------------------------------------------