TSTP Solution File: SEU090+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU090+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n014.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 : Timeout 299.93s 300.08s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU090+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n014.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:42:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.97/2.13 ----- Otter 3.3f, August 2004 -----
% 1.97/2.13 The process was started by sandbox2 on n014.cluster.edu,
% 1.97/2.13 Wed Jul 27 07:42:09 2022
% 1.97/2.13 The command was "./otter". The process ID is 4317.
% 1.97/2.13
% 1.97/2.13 set(prolog_style_variables).
% 1.97/2.13 set(auto).
% 1.97/2.13 dependent: set(auto1).
% 1.97/2.13 dependent: set(process_input).
% 1.97/2.13 dependent: clear(print_kept).
% 1.97/2.13 dependent: clear(print_new_demod).
% 1.97/2.13 dependent: clear(print_back_demod).
% 1.97/2.13 dependent: clear(print_back_sub).
% 1.97/2.13 dependent: set(control_memory).
% 1.97/2.13 dependent: assign(max_mem, 12000).
% 1.97/2.13 dependent: assign(pick_given_ratio, 4).
% 1.97/2.13 dependent: assign(stats_level, 1).
% 1.97/2.13 dependent: assign(max_seconds, 10800).
% 1.97/2.13 clear(print_given).
% 1.97/2.13
% 1.97/2.13 formula_list(usable).
% 1.97/2.13 all A (A=A).
% 1.97/2.13 all A B (in(A,B)-> -in(B,A)).
% 1.97/2.13 all A (ordinal(A)-> (all B (element(B,A)->epsilon_transitive(B)&epsilon_connected(B)&ordinal(B)))).
% 1.97/2.13 all A (empty(A)->finite(A)).
% 1.97/2.13 all A (empty(A)->function(A)).
% 1.97/2.13 all A (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)).
% 1.97/2.13 all A (empty(A)->relation(A)).
% 1.97/2.13 all A B C (element(C,powerset(cartesian_product2(A,B)))->relation(C)).
% 1.97/2.13 all A (empty(A)&ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&natural(A)).
% 1.97/2.13 all A (finite(A)-> (all B (element(B,powerset(A))->finite(B)))).
% 1.97/2.13 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.97/2.13 all A (epsilon_transitive(A)&epsilon_connected(A)->ordinal(A)).
% 1.97/2.13 all A (empty(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 1.97/2.13 all A (element(A,positive_rationals)-> (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&natural(A))).
% 1.97/2.13 all A B C D (cartesian_product4(A,B,C,D)=cartesian_product2(cartesian_product3(A,B,C),D)).
% 1.97/2.13 all A exists B element(B,A).
% 1.97/2.13 empty(empty_set).
% 1.97/2.13 relation(empty_set).
% 1.97/2.13 relation_empty_yielding(empty_set).
% 1.97/2.13 all A B (finite(A)&finite(B)->finite(cartesian_product2(A,B))).
% 1.97/2.13 all A B C (finite(A)&finite(B)&finite(C)->finite(cartesian_product3(A,B,C))).
% 1.97/2.13 all A (-empty(powerset(A))).
% 1.97/2.13 empty(empty_set).
% 1.97/2.13 relation(empty_set).
% 1.97/2.13 relation_empty_yielding(empty_set).
% 1.97/2.13 function(empty_set).
% 1.97/2.13 one_to_one(empty_set).
% 1.97/2.13 empty(empty_set).
% 1.97/2.13 epsilon_transitive(empty_set).
% 1.97/2.13 epsilon_connected(empty_set).
% 1.97/2.13 ordinal(empty_set).
% 1.97/2.13 empty(empty_set).
% 1.97/2.13 relation(empty_set).
% 1.97/2.13 all A B (-empty(A)& -empty(B)-> -empty(cartesian_product2(A,B))).
% 1.97/2.13 all A B C (-empty(A)& -empty(B)& -empty(C)-> -empty(cartesian_product3(A,B,C))).
% 1.97/2.13 all A B C D (-empty(A)& -empty(B)& -empty(C)& -empty(D)-> -empty(cartesian_product4(A,B,C,D))).
% 1.97/2.13 -empty(positive_rationals).
% 1.97/2.13 exists A (-empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&natural(A)).
% 1.97/2.13 exists A (-empty(A)&finite(A)).
% 1.97/2.13 exists A (relation(A)&function(A)&function_yielding(A)).
% 1.97/2.13 exists A (relation(A)&function(A)).
% 1.97/2.13 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 1.97/2.13 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&being_limit_ordinal(A)).
% 1.97/2.13 exists A (empty(A)&relation(A)).
% 1.97/2.13 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.97/2.13 exists A empty(A).
% 1.97/2.13 exists A (element(A,positive_rationals)& -empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 1.97/2.13 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)).
% 1.97/2.13 exists A (relation(A)&empty(A)&function(A)).
% 1.97/2.13 exists A (relation(A)&function(A)&one_to_one(A)&empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 1.97/2.13 exists A (relation(A)&function(A)&transfinite_se_quence(A)&ordinal_yielding(A)).
% 1.97/2.13 exists A (-empty(A)&relation(A)).
% 1.97/2.13 all A exists B (element(B,powerset(A))&empty(B)).
% 1.97/2.13 exists A (-empty(A)).
% 1.97/2.13 exists A (element(A,positive_rationals)&empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&natural(A)).
% 1.97/2.13 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 1.97/2.13 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.97/2.13 exists A (-empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 1.97/2.13 exists A (relation(A)&relation_empty_yielding(A)).
% 1.97/2.13 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 1.97/2.13 exists A (relation(A)&function(A)&transfinite_se_quence(A)).
% 1.97/2.13 exists A (relation(A)&relation_non_empty(A)&function(A)).
% 1.97/2.13 all A B subset(A,A).
% 1.97/2.13 all A B (finite(A)&finite(B)->finite(cartesian_product2(A,B))).
% 1.97/2.13 all A B (in(A,B)->element(A,B)).
% 1.97/2.13 all A B C (finite(A)&finite(B)&finite(C)->finite(cartesian_product3(A,B,C))).
% 1.97/2.13 -(all A B C D (finite(A)&finite(B)&finite(C)&finite(D)->finite(cartesian_product4(A,B,C,D)))).
% 1.97/2.13 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.97/2.13 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.97/2.13 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.97/2.13 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.97/2.13 all A (empty(A)->A=empty_set).
% 1.97/2.13 all A B (-(in(A,B)&empty(B))).
% 1.97/2.13 all A B (-(empty(A)&A!=B&empty(B))).
% 1.97/2.13 end_of_list.
% 1.97/2.13
% 1.97/2.13 -------> usable clausifies to:
% 1.97/2.13
% 1.97/2.13 list(usable).
% 1.97/2.13 0 [] A=A.
% 1.97/2.13 0 [] -in(A,B)| -in(B,A).
% 1.97/2.13 0 [] -ordinal(A)| -element(B,A)|epsilon_transitive(B).
% 1.97/2.13 0 [] -ordinal(A)| -element(B,A)|epsilon_connected(B).
% 1.97/2.13 0 [] -ordinal(A)| -element(B,A)|ordinal(B).
% 1.97/2.13 0 [] -empty(A)|finite(A).
% 1.97/2.13 0 [] -empty(A)|function(A).
% 1.97/2.13 0 [] -ordinal(A)|epsilon_transitive(A).
% 1.97/2.13 0 [] -ordinal(A)|epsilon_connected(A).
% 1.97/2.13 0 [] -empty(A)|relation(A).
% 1.97/2.13 0 [] -element(C,powerset(cartesian_product2(A,B)))|relation(C).
% 1.97/2.13 0 [] -empty(A)| -ordinal(A)|epsilon_transitive(A).
% 1.97/2.13 0 [] -empty(A)| -ordinal(A)|epsilon_connected(A).
% 1.97/2.13 0 [] -empty(A)| -ordinal(A)|natural(A).
% 1.97/2.13 0 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 1.97/2.13 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.97/2.13 0 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 1.97/2.13 0 [] -empty(A)|epsilon_transitive(A).
% 1.97/2.13 0 [] -empty(A)|epsilon_connected(A).
% 1.97/2.13 0 [] -empty(A)|ordinal(A).
% 1.97/2.13 0 [] -element(A,positive_rationals)| -ordinal(A)|epsilon_transitive(A).
% 1.97/2.13 0 [] -element(A,positive_rationals)| -ordinal(A)|epsilon_connected(A).
% 1.97/2.13 0 [] -element(A,positive_rationals)| -ordinal(A)|natural(A).
% 1.97/2.13 0 [] cartesian_product4(A,B,C,D)=cartesian_product2(cartesian_product3(A,B,C),D).
% 1.97/2.13 0 [] element($f1(A),A).
% 1.97/2.13 0 [] empty(empty_set).
% 1.97/2.13 0 [] relation(empty_set).
% 1.97/2.13 0 [] relation_empty_yielding(empty_set).
% 1.97/2.13 0 [] -finite(A)| -finite(B)|finite(cartesian_product2(A,B)).
% 1.97/2.13 0 [] -finite(A)| -finite(B)| -finite(C)|finite(cartesian_product3(A,B,C)).
% 1.97/2.13 0 [] -empty(powerset(A)).
% 1.97/2.13 0 [] empty(empty_set).
% 1.97/2.13 0 [] relation(empty_set).
% 1.97/2.13 0 [] relation_empty_yielding(empty_set).
% 1.97/2.13 0 [] function(empty_set).
% 1.97/2.13 0 [] one_to_one(empty_set).
% 1.97/2.13 0 [] empty(empty_set).
% 1.97/2.13 0 [] epsilon_transitive(empty_set).
% 1.97/2.13 0 [] epsilon_connected(empty_set).
% 1.97/2.13 0 [] ordinal(empty_set).
% 1.97/2.13 0 [] empty(empty_set).
% 1.97/2.13 0 [] relation(empty_set).
% 1.97/2.13 0 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 1.97/2.13 0 [] empty(A)|empty(B)|empty(C)| -empty(cartesian_product3(A,B,C)).
% 1.97/2.13 0 [] empty(A)|empty(B)|empty(C)|empty(D)| -empty(cartesian_product4(A,B,C,D)).
% 1.97/2.13 0 [] -empty(positive_rationals).
% 1.97/2.13 0 [] -empty($c1).
% 1.97/2.13 0 [] epsilon_transitive($c1).
% 1.97/2.13 0 [] epsilon_connected($c1).
% 1.97/2.13 0 [] ordinal($c1).
% 1.97/2.13 0 [] natural($c1).
% 1.97/2.13 0 [] -empty($c2).
% 1.97/2.13 0 [] finite($c2).
% 1.97/2.13 0 [] relation($c3).
% 1.97/2.13 0 [] function($c3).
% 1.97/2.13 0 [] function_yielding($c3).
% 1.97/2.13 0 [] relation($c4).
% 1.97/2.13 0 [] function($c4).
% 1.97/2.13 0 [] epsilon_transitive($c5).
% 1.97/2.13 0 [] epsilon_connected($c5).
% 1.97/2.13 0 [] ordinal($c5).
% 1.97/2.13 0 [] epsilon_transitive($c6).
% 1.97/2.13 0 [] epsilon_connected($c6).
% 1.97/2.13 0 [] ordinal($c6).
% 1.97/2.13 0 [] being_limit_ordinal($c6).
% 1.97/2.13 0 [] empty($c7).
% 1.97/2.13 0 [] relation($c7).
% 1.97/2.13 0 [] empty(A)|element($f2(A),powerset(A)).
% 1.97/2.13 0 [] empty(A)| -empty($f2(A)).
% 1.97/2.13 0 [] empty($c8).
% 1.97/2.13 0 [] element($c9,positive_rationals).
% 1.97/2.13 0 [] -empty($c9).
% 1.97/2.13 0 [] epsilon_transitive($c9).
% 1.97/2.13 0 [] epsilon_connected($c9).
% 1.97/2.13 0 [] ordinal($c9).
% 1.97/2.13 0 [] element($f3(A),powerset(A)).
% 1.97/2.13 0 [] empty($f3(A)).
% 1.97/2.13 0 [] relation($f3(A)).
% 1.97/2.13 0 [] function($f3(A)).
% 1.97/2.13 0 [] one_to_one($f3(A)).
% 1.97/2.13 0 [] epsilon_transitive($f3(A)).
% 1.97/2.13 0 [] epsilon_connected($f3(A)).
% 1.97/2.13 0 [] ordinal($f3(A)).
% 1.97/2.13 0 [] natural($f3(A)).
% 1.97/2.13 0 [] finite($f3(A)).
% 1.97/2.13 0 [] relation($c10).
% 1.97/2.13 0 [] empty($c10).
% 1.97/2.13 0 [] function($c10).
% 1.97/2.13 0 [] relation($c11).
% 1.97/2.13 0 [] function($c11).
% 1.97/2.13 0 [] one_to_one($c11).
% 1.97/2.13 0 [] empty($c11).
% 1.97/2.13 0 [] epsilon_transitive($c11).
% 1.97/2.13 0 [] epsilon_connected($c11).
% 1.97/2.13 0 [] ordinal($c11).
% 1.97/2.13 0 [] relation($c12).
% 1.97/2.13 0 [] function($c12).
% 1.97/2.13 0 [] transfinite_se_quence($c12).
% 1.97/2.13 0 [] ordinal_yielding($c12).
% 1.97/2.13 0 [] -empty($c13).
% 1.97/2.13 0 [] relation($c13).
% 1.97/2.13 0 [] element($f4(A),powerset(A)).
% 1.97/2.13 0 [] empty($f4(A)).
% 1.97/2.13 0 [] -empty($c14).
% 1.97/2.13 0 [] element($c15,positive_rationals).
% 1.97/2.13 0 [] empty($c15).
% 1.97/2.13 0 [] epsilon_transitive($c15).
% 1.97/2.13 0 [] epsilon_connected($c15).
% 1.97/2.13 0 [] ordinal($c15).
% 1.97/2.13 0 [] natural($c15).
% 1.97/2.13 0 [] empty(A)|element($f5(A),powerset(A)).
% 1.97/2.13 0 [] empty(A)| -empty($f5(A)).
% 1.97/2.13 0 [] empty(A)|finite($f5(A)).
% 1.97/2.13 0 [] relation($c16).
% 1.97/2.13 0 [] function($c16).
% 1.97/2.13 0 [] one_to_one($c16).
% 1.97/2.13 0 [] -empty($c17).
% 1.97/2.13 0 [] epsilon_transitive($c17).
% 1.97/2.13 0 [] epsilon_connected($c17).
% 1.97/2.13 0 [] ordinal($c17).
% 1.97/2.13 0 [] relation($c18).
% 1.97/2.13 0 [] relation_empty_yielding($c18).
% 1.97/2.13 0 [] relation($c19).
% 1.97/2.13 0 [] relation_empty_yielding($c19).
% 1.97/2.13 0 [] function($c19).
% 1.97/2.13 0 [] relation($c20).
% 1.97/2.13 0 [] function($c20).
% 1.97/2.13 0 [] transfinite_se_quence($c20).
% 1.97/2.13 0 [] relation($c21).
% 1.97/2.13 0 [] relation_non_empty($c21).
% 1.97/2.13 0 [] function($c21).
% 1.97/2.13 0 [] subset(A,A).
% 1.97/2.13 0 [] -finite(A)| -finite(B)|finite(cartesian_product2(A,B)).
% 1.97/2.13 0 [] -in(A,B)|element(A,B).
% 1.97/2.13 0 [] -finite(A)| -finite(B)| -finite(C)|finite(cartesian_product3(A,B,C)).
% 1.97/2.13 0 [] finite($c25).
% 1.97/2.13 0 [] finite($c24).
% 1.97/2.13 0 [] finite($c23).
% 1.97/2.13 0 [] finite($c22).
% 1.97/2.13 0 [] -finite(cartesian_product4($c25,$c24,$c23,$c22)).
% 1.97/2.13 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.97/2.13 0 [] -element(A,powerset(B))|subset(A,B).
% 1.97/2.13 0 [] element(A,powerset(B))| -subset(A,B).
% 1.97/2.13 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.97/2.13 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.97/2.13 0 [] -empty(A)|A=empty_set.
% 1.97/2.13 0 [] -in(A,B)| -empty(B).
% 1.97/2.13 0 [] -empty(A)|A=B| -empty(B).
% 1.97/2.13 end_of_list.
% 1.97/2.13
% 1.97/2.13 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.97/2.13
% 1.97/2.13 This ia a non-Horn set with equality. The strategy will be
% 1.97/2.13 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.97/2.13 deletion, with positive clauses in sos and nonpositive
% 1.97/2.13 clauses in usable.
% 1.97/2.13
% 1.97/2.13 dependent: set(knuth_bendix).
% 1.97/2.13 dependent: set(anl_eq).
% 1.97/2.13 dependent: set(para_from).
% 1.97/2.13 dependent: set(para_into).
% 1.97/2.13 dependent: clear(para_from_right).
% 1.97/2.13 dependent: clear(para_into_right).
% 1.97/2.13 dependent: set(para_from_vars).
% 1.97/2.13 dependent: set(eq_units_both_ways).
% 1.97/2.13 dependent: set(dynamic_demod_all).
% 1.97/2.13 dependent: set(dynamic_demod).
% 1.97/2.13 dependent: set(order_eq).
% 1.97/2.13 dependent: set(back_demod).
% 1.97/2.13 dependent: set(lrpo).
% 1.97/2.13 dependent: set(hyper_res).
% 1.97/2.13 dependent: set(unit_deletion).
% 1.97/2.13 dependent: set(factor).
% 1.97/2.13
% 1.97/2.13 ------------> process usable:
% 1.97/2.13 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.97/2.13 ** KEPT (pick-wt=7): 2 [] -ordinal(A)| -element(B,A)|epsilon_transitive(B).
% 1.97/2.13 ** KEPT (pick-wt=7): 3 [] -ordinal(A)| -element(B,A)|epsilon_connected(B).
% 1.97/2.13 ** KEPT (pick-wt=7): 4 [] -ordinal(A)| -element(B,A)|ordinal(B).
% 1.97/2.13 ** KEPT (pick-wt=4): 5 [] -empty(A)|finite(A).
% 1.97/2.13 ** KEPT (pick-wt=4): 6 [] -empty(A)|function(A).
% 1.97/2.13 ** KEPT (pick-wt=4): 7 [] -ordinal(A)|epsilon_transitive(A).
% 1.97/2.13 ** KEPT (pick-wt=4): 8 [] -ordinal(A)|epsilon_connected(A).
% 1.97/2.13 ** KEPT (pick-wt=4): 9 [] -empty(A)|relation(A).
% 1.97/2.13 ** KEPT (pick-wt=8): 10 [] -element(A,powerset(cartesian_product2(B,C)))|relation(A).
% 1.97/2.13 Following clause subsumed by 7 during input processing: 0 [] -empty(A)| -ordinal(A)|epsilon_transitive(A).
% 1.97/2.13 Following clause subsumed by 8 during input processing: 0 [] -empty(A)| -ordinal(A)|epsilon_connected(A).
% 1.97/2.13 ** KEPT (pick-wt=6): 11 [] -empty(A)| -ordinal(A)|natural(A).
% 1.97/2.13 ** KEPT (pick-wt=8): 12 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 1.97/2.13 ** KEPT (pick-wt=8): 13 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.97/2.13 ** KEPT (pick-wt=6): 14 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 1.97/2.13 ** KEPT (pick-wt=4): 15 [] -empty(A)|epsilon_transitive(A).
% 1.97/2.13 ** KEPT (pick-wt=4): 16 [] -empty(A)|epsilon_connected(A).
% 1.97/2.13 ** KEPT (pick-wt=4): 17 [] -empty(A)|ordinal(A).
% 1.97/2.13 Following clause subsumed by 7 during input processing: 0 [] -element(A,positive_rationals)| -ordinal(A)|epsilon_transitive(A).
% 1.97/2.13 Following clause subsumed by 8 during input processing: 0 [] -element(A,positive_rationals)| -ordinal(A)|epsilon_connected(A).
% 1.97/2.13 ** KEPT (pick-wt=7): 18 [] -element(A,positive_rationals)| -ordinal(A)|natural(A).
% 1.97/2.13 ** KEPT (pick-wt=8): 19 [] -finite(A)| -finite(B)|finite(cartesian_product2(A,B)).
% 1.97/2.13 ** KEPT (pick-wt=11): 20 [] -finite(A)| -finite(B)| -finite(C)|finite(cartesian_product3(A,B,C)).
% 1.97/2.13 ** KEPT (pick-wt=3): 21 [] -empty(powerset(A)).
% 1.97/2.13 ** KEPT (pick-wt=8): 22 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 1.97/2.13 ** KEPT (pick-wt=11): 23 [] empty(A)|empty(B)|empty(C)| -empty(cartesian_product3(A,B,C)).
% 1.97/2.13 ** KEPT (pick-wt=14): 24 [] empty(A)|empty(B)|empty(C)|empty(D)| -empty(cartesian_product4(A,B,C,D)).
% 1.97/2.13 ** KEPT (pick-wt=2): 25 [] -empty(positive_rationals).
% 1.97/2.13 ** KEPT (pick-wt=2): 26 [] -empty($c1).
% 1.97/2.13 ** KEPT (pick-wt=2): 27 [] -empty($c2).
% 1.97/2.13 ** KEPT (pick-wt=5): 28 [] empty(A)| -empty($f2(A)).
% 1.97/2.13 ** KEPT (pick-wt=2): 29 [] -empty($c9).
% 1.97/2.13 ** KEPT (pick-wt=2): 30 [] -empty($c13).
% 1.97/2.13 ** KEPT (pick-wt=2): 31 [] -empty($c14).
% 1.97/2.13 ** KEPT (pick-wt=5): 32 [] empty(A)| -empty($f5(A)).
% 1.97/2.13 ** KEPT (pick-wt=2): 33 [] -empty($c17).
% 1.97/2.13 Following clause subsumed by 19 during input processing: 0 [] -finite(A)| -finite(B)|finite(cartesian_product2(A,B)).
% 1.97/2.13 ** KEPT (pick-wt=6): 34 [] -in(A,B)|element(A,B).
% 1.97/2.13 Following clause subsumed by 20 during input processing: 0 [] -finite(A)| -finite(B)| -finite(C)|finite(cartesian_product3(A,B,C)).
% 1.97/2.13 ** KEPT (pick-wt=6): 35 [] -finite(cartesian_product4($c25,$c24,$c23,$c22)).
% 1.97/2.13 ** KEPT (pick-wt=8): 36 [] -element(A,B)|empty(B)|in(A,B).
% 1.97/2.13 ** KEPT (pick-wt=7): 37 [] -element(A,powerset(B))|subset(A,B).
% 1.97/2.13 ** KEPT (pick-wt=7): 38 [] element(A,powerset(B))| -subset(A,B).
% 1.97/2.13 ** KEPT (pick-wt=10): 39 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.97/2.13 ** KEPT (pick-wt=9): 40 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.97/2.13 ** KEPT (pick-wt=5): 41 [] -empty(A)|A=empty_set.
% 1.97/2.13 ** KEPT (pick-wt=5): 42 [] -in(A,B)| -empty(B).
% 1.97/2.13 ** KEPT (pick-wt=7): 43 [] -empty(A)|A=B| -empty(B).
% 1.97/2.13
% 1.97/2.13 ------------> process sos:
% 1.97/2.13 ** KEPT (pick-wt=3): 70 [] A=A.
% 1.97/2.13 ** KEPT (pick-wt=12): 72 [copy,71,flip.1] cartesian_product2(cartesian_product3(A,B,C),D)=cartesian_product4(A,B,C,D).
% 1.97/2.13 ---> New Demodulator: 73 [new_demod,72] cartesian_product2(cartesian_product3(A,B,C),D)=cartesian_product4(A,B,C,D).
% 1.97/2.13 ** KEPT (pick-wt=4): 74 [] element($f1(A),A).
% 1.97/2.13 ** KEPT (pick-wt=2): 75 [] empty(empty_set).
% 1.97/2.13 ** KEPT (pick-wt=2): 76 [] relation(empty_set).
% 1.97/2.13 ** KEPT (pick-wt=2): 77 [] relation_empty_yielding(empty_set).
% 1.97/2.13 Following clause subsumed by 75 during input processing: 0 [] empty(empty_set).
% 1.97/2.13 Following clause subsumed by 76 during input processing: 0 [] relation(empty_set).
% 1.97/2.13 Following clause subsumed by 77 during input processing: 0 [] relation_empty_yielding(empty_set).
% 1.97/2.14 ** KEPT (pick-wt=2): 78 [] function(empty_set).
% 1.97/2.14 ** KEPT (pick-wt=2): 79 [] one_to_one(empty_set).
% 1.97/2.14 Following clause subsumed by 75 during input processing: 0 [] empty(empty_set).
% 1.97/2.14 ** KEPT (pick-wt=2): 80 [] epsilon_transitive(empty_set).
% 1.97/2.14 ** KEPT (pick-wt=2): 81 [] epsilon_connected(empty_set).
% 1.97/2.14 ** KEPT (pick-wt=2): 82 [] ordinal(empty_set).
% 1.97/2.14 Following clause subsumed by 75 during input processing: 0 [] empty(empty_set).
% 1.97/2.14 Following clause subsumed by 76 during input processing: 0 [] relation(empty_set).
% 1.97/2.14 ** KEPT (pick-wt=2): 83 [] epsilon_transitive($c1).
% 1.97/2.14 ** KEPT (pick-wt=2): 84 [] epsilon_connected($c1).
% 1.97/2.14 ** KEPT (pick-wt=2): 85 [] ordinal($c1).
% 1.97/2.14 ** KEPT (pick-wt=2): 86 [] natural($c1).
% 1.97/2.14 ** KEPT (pick-wt=2): 87 [] finite($c2).
% 1.97/2.14 ** KEPT (pick-wt=2): 88 [] relation($c3).
% 1.97/2.14 ** KEPT (pick-wt=2): 89 [] function($c3).
% 1.97/2.14 ** KEPT (pick-wt=2): 90 [] function_yielding($c3).
% 1.97/2.14 ** KEPT (pick-wt=2): 91 [] relation($c4).
% 1.97/2.14 ** KEPT (pick-wt=2): 92 [] function($c4).
% 1.97/2.14 ** KEPT (pick-wt=2): 93 [] epsilon_transitive($c5).
% 1.97/2.14 ** KEPT (pick-wt=2): 94 [] epsilon_connected($c5).
% 1.97/2.14 ** KEPT (pick-wt=2): 95 [] ordinal($c5).
% 1.97/2.14 ** KEPT (pick-wt=2): 96 [] epsilon_transitive($c6).
% 1.97/2.14 ** KEPT (pick-wt=2): 97 [] epsilon_connected($c6).
% 1.97/2.14 ** KEPT (pick-wt=2): 98 [] ordinal($c6).
% 1.97/2.14 ** KEPT (pick-wt=2): 99 [] being_limit_ordinal($c6).
% 1.97/2.14 ** KEPT (pick-wt=2): 100 [] empty($c7).
% 1.97/2.14 ** KEPT (pick-wt=2): 101 [] relation($c7).
% 1.97/2.14 ** KEPT (pick-wt=7): 102 [] empty(A)|element($f2(A),powerset(A)).
% 1.97/2.14 ** KEPT (pick-wt=2): 103 [] empty($c8).
% 1.97/2.14 ** KEPT (pick-wt=3): 104 [] element($c9,positive_rationals).
% 1.97/2.14 ** KEPT (pick-wt=2): 105 [] epsilon_transitive($c9).
% 1.97/2.14 ** KEPT (pick-wt=2): 106 [] epsilon_connected($c9).
% 1.97/2.14 ** KEPT (pick-wt=2): 107 [] ordinal($c9).
% 1.97/2.14 ** KEPT (pick-wt=5): 108 [] element($f3(A),powerset(A)).
% 1.97/2.14 ** KEPT (pick-wt=3): 109 [] empty($f3(A)).
% 1.97/2.14 ** KEPT (pick-wt=3): 110 [] relation($f3(A)).
% 1.97/2.14 ** KEPT (pick-wt=3): 111 [] function($f3(A)).
% 1.97/2.14 ** KEPT (pick-wt=3): 112 [] one_to_one($f3(A)).
% 1.97/2.14 ** KEPT (pick-wt=3): 113 [] epsilon_transitive($Alarm clock
% 299.93/300.08 Otter interrupted
% 299.93/300.08 PROOF NOT FOUND
%------------------------------------------------------------------------------