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