TSTP Solution File: SEU296+1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SEU296+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n015.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:31 EDT 2022

% Result   : Timeout 299.85s 300.03s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU296+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n015.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:51:11 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 2.36/2.57  ----- Otter 3.3f, August 2004 -----
% 2.36/2.57  The process was started by sandbox on n015.cluster.edu,
% 2.36/2.57  Wed Jul 27 07:51:11 2022
% 2.36/2.57  The command was "./otter".  The process ID is 31378.
% 2.36/2.57  
% 2.36/2.57  set(prolog_style_variables).
% 2.36/2.57  set(auto).
% 2.36/2.57     dependent: set(auto1).
% 2.36/2.57     dependent: set(process_input).
% 2.36/2.57     dependent: clear(print_kept).
% 2.36/2.57     dependent: clear(print_new_demod).
% 2.36/2.57     dependent: clear(print_back_demod).
% 2.36/2.57     dependent: clear(print_back_sub).
% 2.36/2.57     dependent: set(control_memory).
% 2.36/2.57     dependent: assign(max_mem, 12000).
% 2.36/2.57     dependent: assign(pick_given_ratio, 4).
% 2.36/2.57     dependent: assign(stats_level, 1).
% 2.36/2.57     dependent: assign(max_seconds, 10800).
% 2.36/2.57  clear(print_given).
% 2.36/2.57  
% 2.36/2.57  formula_list(usable).
% 2.36/2.57  all A (A=A).
% 2.36/2.57  all A B (in(A,B)-> -in(B,A)).
% 2.36/2.57  all A (ordinal(A)-> (all B (element(B,A)->epsilon_transitive(B)&epsilon_connected(B)&ordinal(B)))).
% 2.36/2.57  all A (empty(A)->finite(A)).
% 2.36/2.57  all A (empty(A)->function(A)).
% 2.36/2.57  all A (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)).
% 2.36/2.57  all A (empty(A)->relation(A)).
% 2.36/2.57  all A (empty(A)&ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&natural(A)).
% 2.36/2.57  all A (finite(A)-> (all B (element(B,powerset(A))->finite(B)))).
% 2.36/2.57  all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.36/2.57  all A (epsilon_transitive(A)&epsilon_connected(A)->ordinal(A)).
% 2.36/2.57  all A (element(A,omega)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&natural(A)).
% 2.36/2.57  all A (empty(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.36/2.57  all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 2.36/2.57  all A (finite(A)<-> (exists B (relation(B)&function(B)&relation_rng(B)=A&in(relation_dom(B),omega)))).
% 2.36/2.57  $T.
% 2.36/2.57  $T.
% 2.36/2.57  $T.
% 2.36/2.57  $T.
% 2.36/2.57  $T.
% 2.36/2.57  $T.
% 2.36/2.57  all A B (relation(A)&relation(B)->relation(relation_composition(A,B))).
% 2.36/2.57  $T.
% 2.36/2.57  $T.
% 2.36/2.57  all A exists B element(B,A).
% 2.36/2.57  all A B (finite(B)->finite(set_intersection2(A,B))).
% 2.36/2.57  all A B (empty(A)&relation(B)->empty(relation_composition(B,A))&relation(relation_composition(B,A))).
% 2.36/2.57  all A B (finite(A)->finite(set_intersection2(A,B))).
% 2.36/2.57  empty(empty_set).
% 2.36/2.57  relation(empty_set).
% 2.36/2.57  relation_empty_yielding(empty_set).
% 2.36/2.57  all A B (relation(A)&function(A)&relation(B)&function(B)->relation(relation_composition(A,B))&function(relation_composition(A,B))).
% 2.36/2.57  epsilon_transitive(omega).
% 2.36/2.57  epsilon_connected(omega).
% 2.36/2.57  ordinal(omega).
% 2.36/2.57  -empty(omega).
% 2.36/2.57  all A B (relation(A)&relation(B)->relation(set_intersection2(A,B))).
% 2.36/2.57  all A (-empty(powerset(A))).
% 2.36/2.57  empty(empty_set).
% 2.36/2.57  relation(empty_set).
% 2.36/2.57  relation_empty_yielding(empty_set).
% 2.36/2.57  function(empty_set).
% 2.36/2.57  one_to_one(empty_set).
% 2.36/2.57  empty(empty_set).
% 2.36/2.57  epsilon_transitive(empty_set).
% 2.36/2.57  epsilon_connected(empty_set).
% 2.36/2.57  ordinal(empty_set).
% 2.36/2.57  empty(empty_set).
% 2.36/2.57  relation(empty_set).
% 2.36/2.57  all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 2.36/2.57  all A (-empty(A)&relation(A)-> -empty(relation_rng(A))).
% 2.36/2.57  all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 2.36/2.57  all A (empty(A)->empty(relation_rng(A))&relation(relation_rng(A))).
% 2.36/2.57  all A B (empty(A)&relation(B)->empty(relation_composition(A,B))&relation(relation_composition(A,B))).
% 2.36/2.57  all A B (set_intersection2(A,A)=A).
% 2.36/2.57  exists A (-empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)&natural(A)).
% 2.36/2.57  exists A (-empty(A)&finite(A)).
% 2.36/2.57  exists A (relation(A)&function(A)).
% 2.36/2.57  exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.36/2.57  exists A (empty(A)&relation(A)).
% 2.36/2.57  all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.36/2.57  exists A empty(A).
% 2.36/2.57  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.36/2.57  exists A (relation(A)&empty(A)&function(A)).
% 2.36/2.57  exists A (relation(A)&function(A)&one_to_one(A)&empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.36/2.57  exists A (-empty(A)&relation(A)).
% 2.36/2.57  all A exists B (element(B,powerset(A))&empty(B)).
% 2.36/2.57  exists A (-empty(A)).
% 2.36/2.57  all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 2.36/2.57  exists A (relation(A)&function(A)&one_to_one(A)).
% 2.36/2.57  exists A (-empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.36/2.57  exists A (relation(A)&relation_empty_yielding(A)).
% 2.36/2.57  exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 2.36/2.57  all A B subset(A,A).
% 2.36/2.57  all A B (relation(B)->relation_image(B,A)=relation_image(B,set_intersection2(relation_dom(B),A))).
% 2.36/2.57  all A B (finite(A)->finite(set_intersection2(A,B))).
% 2.36/2.57  all A (relation(A)-> (all B (relation(B)->relation_rng(relation_composition(A,B))=relation_image(B,relation_rng(A))))).
% 2.36/2.57  -(all A B (relation(B)&function(B)-> (finite(A)->finite(relation_image(B,A))))).
% 2.36/2.57  all A B subset(set_intersection2(A,B),A).
% 2.36/2.57  all A B (in(A,B)->element(A,B)).
% 2.36/2.57  all A (set_intersection2(A,empty_set)=empty_set).
% 2.36/2.57  all A B (element(A,B)->empty(B)|in(A,B)).
% 2.36/2.57  all A B (element(A,powerset(B))<->subset(A,B)).
% 2.36/2.57  all A (relation(A)-> (all B (relation(B)-> (subset(relation_rng(A),relation_dom(B))->relation_dom(relation_composition(A,B))=relation_dom(A))))).
% 2.36/2.57  all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.36/2.57  all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.36/2.57  all A (empty(A)->A=empty_set).
% 2.36/2.57  all A B (-(in(A,B)&empty(B))).
% 2.36/2.57  all A B (-(empty(A)&A!=B&empty(B))).
% 2.36/2.57  end_of_list.
% 2.36/2.57  
% 2.36/2.57  -------> usable clausifies to:
% 2.36/2.57  
% 2.36/2.57  list(usable).
% 2.36/2.57  0 [] A=A.
% 2.36/2.57  0 [] -in(A,B)| -in(B,A).
% 2.36/2.57  0 [] -ordinal(A)| -element(B,A)|epsilon_transitive(B).
% 2.36/2.57  0 [] -ordinal(A)| -element(B,A)|epsilon_connected(B).
% 2.36/2.57  0 [] -ordinal(A)| -element(B,A)|ordinal(B).
% 2.36/2.57  0 [] -empty(A)|finite(A).
% 2.36/2.57  0 [] -empty(A)|function(A).
% 2.36/2.57  0 [] -ordinal(A)|epsilon_transitive(A).
% 2.36/2.57  0 [] -ordinal(A)|epsilon_connected(A).
% 2.36/2.57  0 [] -empty(A)|relation(A).
% 2.36/2.57  0 [] -empty(A)| -ordinal(A)|epsilon_transitive(A).
% 2.36/2.57  0 [] -empty(A)| -ordinal(A)|epsilon_connected(A).
% 2.36/2.57  0 [] -empty(A)| -ordinal(A)|natural(A).
% 2.36/2.57  0 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 2.36/2.57  0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.36/2.57  0 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 2.36/2.57  0 [] -element(A,omega)|epsilon_transitive(A).
% 2.36/2.57  0 [] -element(A,omega)|epsilon_connected(A).
% 2.36/2.57  0 [] -element(A,omega)|ordinal(A).
% 2.36/2.57  0 [] -element(A,omega)|natural(A).
% 2.36/2.57  0 [] -empty(A)|epsilon_transitive(A).
% 2.36/2.57  0 [] -empty(A)|epsilon_connected(A).
% 2.36/2.57  0 [] -empty(A)|ordinal(A).
% 2.36/2.57  0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.36/2.57  0 [] -finite(A)|relation($f1(A)).
% 2.36/2.57  0 [] -finite(A)|function($f1(A)).
% 2.36/2.57  0 [] -finite(A)|relation_rng($f1(A))=A.
% 2.36/2.57  0 [] -finite(A)|in(relation_dom($f1(A)),omega).
% 2.36/2.57  0 [] finite(A)| -relation(B)| -function(B)|relation_rng(B)!=A| -in(relation_dom(B),omega).
% 2.36/2.57  0 [] $T.
% 2.36/2.57  0 [] $T.
% 2.36/2.57  0 [] $T.
% 2.36/2.57  0 [] $T.
% 2.36/2.57  0 [] $T.
% 2.36/2.57  0 [] $T.
% 2.36/2.57  0 [] -relation(A)| -relation(B)|relation(relation_composition(A,B)).
% 2.36/2.57  0 [] $T.
% 2.36/2.57  0 [] $T.
% 2.36/2.57  0 [] element($f2(A),A).
% 2.36/2.57  0 [] -finite(B)|finite(set_intersection2(A,B)).
% 2.36/2.57  0 [] -empty(A)| -relation(B)|empty(relation_composition(B,A)).
% 2.36/2.57  0 [] -empty(A)| -relation(B)|relation(relation_composition(B,A)).
% 2.36/2.57  0 [] -finite(A)|finite(set_intersection2(A,B)).
% 2.36/2.57  0 [] empty(empty_set).
% 2.36/2.57  0 [] relation(empty_set).
% 2.36/2.57  0 [] relation_empty_yielding(empty_set).
% 2.36/2.57  0 [] -relation(A)| -function(A)| -relation(B)| -function(B)|relation(relation_composition(A,B)).
% 2.36/2.57  0 [] -relation(A)| -function(A)| -relation(B)| -function(B)|function(relation_composition(A,B)).
% 2.36/2.57  0 [] epsilon_transitive(omega).
% 2.36/2.57  0 [] epsilon_connected(omega).
% 2.36/2.57  0 [] ordinal(omega).
% 2.36/2.57  0 [] -empty(omega).
% 2.36/2.57  0 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 2.36/2.57  0 [] -empty(powerset(A)).
% 2.36/2.57  0 [] empty(empty_set).
% 2.36/2.57  0 [] relation(empty_set).
% 2.36/2.57  0 [] relation_empty_yielding(empty_set).
% 2.36/2.57  0 [] function(empty_set).
% 2.36/2.57  0 [] one_to_one(empty_set).
% 2.36/2.57  0 [] empty(empty_set).
% 2.36/2.57  0 [] epsilon_transitive(empty_set).
% 2.36/2.57  0 [] epsilon_connected(empty_set).
% 2.36/2.57  0 [] ordinal(empty_set).
% 2.36/2.57  0 [] empty(empty_set).
% 2.36/2.57  0 [] relation(empty_set).
% 2.36/2.57  0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.36/2.57  0 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 2.36/2.57  0 [] -empty(A)|empty(relation_dom(A)).
% 2.36/2.57  0 [] -empty(A)|relation(relation_dom(A)).
% 2.36/2.57  0 [] -empty(A)|empty(relation_rng(A)).
% 2.36/2.57  0 [] -empty(A)|relation(relation_rng(A)).
% 2.36/2.57  0 [] -empty(A)| -relation(B)|empty(relation_composition(A,B)).
% 2.36/2.57  0 [] -empty(A)| -relation(B)|relation(relation_composition(A,B)).
% 2.36/2.57  0 [] set_intersection2(A,A)=A.
% 2.36/2.57  0 [] -empty($c1).
% 2.36/2.57  0 [] epsilon_transitive($c1).
% 2.36/2.57  0 [] epsilon_connected($c1).
% 2.36/2.57  0 [] ordinal($c1).
% 2.36/2.57  0 [] natural($c1).
% 2.36/2.57  0 [] -empty($c2).
% 2.36/2.57  0 [] finite($c2).
% 2.36/2.57  0 [] relation($c3).
% 2.36/2.57  0 [] function($c3).
% 2.36/2.57  0 [] epsilon_transitive($c4).
% 2.36/2.57  0 [] epsilon_connected($c4).
% 2.36/2.57  0 [] ordinal($c4).
% 2.36/2.57  0 [] empty($c5).
% 2.36/2.57  0 [] relation($c5).
% 2.36/2.57  0 [] empty(A)|element($f3(A),powerset(A)).
% 2.36/2.57  0 [] empty(A)| -empty($f3(A)).
% 2.36/2.57  0 [] empty($c6).
% 2.36/2.57  0 [] element($f4(A),powerset(A)).
% 2.36/2.57  0 [] empty($f4(A)).
% 2.36/2.57  0 [] relation($f4(A)).
% 2.36/2.57  0 [] function($f4(A)).
% 2.36/2.57  0 [] one_to_one($f4(A)).
% 2.36/2.57  0 [] epsilon_transitive($f4(A)).
% 2.36/2.57  0 [] epsilon_connected($f4(A)).
% 2.36/2.57  0 [] ordinal($f4(A)).
% 2.36/2.57  0 [] natural($f4(A)).
% 2.36/2.57  0 [] finite($f4(A)).
% 2.36/2.57  0 [] relation($c7).
% 2.36/2.57  0 [] empty($c7).
% 2.36/2.57  0 [] function($c7).
% 2.36/2.57  0 [] relation($c8).
% 2.36/2.57  0 [] function($c8).
% 2.36/2.57  0 [] one_to_one($c8).
% 2.36/2.57  0 [] empty($c8).
% 2.36/2.57  0 [] epsilon_transitive($c8).
% 2.36/2.57  0 [] epsilon_connected($c8).
% 2.36/2.57  0 [] ordinal($c8).
% 2.36/2.57  0 [] -empty($c9).
% 2.36/2.57  0 [] relation($c9).
% 2.36/2.57  0 [] element($f5(A),powerset(A)).
% 2.36/2.57  0 [] empty($f5(A)).
% 2.36/2.57  0 [] -empty($c10).
% 2.36/2.57  0 [] empty(A)|element($f6(A),powerset(A)).
% 2.36/2.57  0 [] empty(A)| -empty($f6(A)).
% 2.36/2.57  0 [] empty(A)|finite($f6(A)).
% 2.36/2.57  0 [] relation($c11).
% 2.36/2.57  0 [] function($c11).
% 2.36/2.57  0 [] one_to_one($c11).
% 2.36/2.57  0 [] -empty($c12).
% 2.36/2.57  0 [] epsilon_transitive($c12).
% 2.36/2.57  0 [] epsilon_connected($c12).
% 2.36/2.57  0 [] ordinal($c12).
% 2.36/2.57  0 [] relation($c13).
% 2.36/2.57  0 [] relation_empty_yielding($c13).
% 2.36/2.57  0 [] relation($c14).
% 2.36/2.57  0 [] relation_empty_yielding($c14).
% 2.36/2.57  0 [] function($c14).
% 2.36/2.57  0 [] subset(A,A).
% 2.36/2.57  0 [] -relation(B)|relation_image(B,A)=relation_image(B,set_intersection2(relation_dom(B),A)).
% 2.36/2.57  0 [] -finite(A)|finite(set_intersection2(A,B)).
% 2.36/2.57  0 [] -relation(A)| -relation(B)|relation_rng(relation_composition(A,B))=relation_image(B,relation_rng(A)).
% 2.36/2.57  0 [] relation($c15).
% 2.36/2.57  0 [] function($c15).
% 2.36/2.57  0 [] finite($c16).
% 2.36/2.57  0 [] -finite(relation_image($c15,$c16)).
% 2.36/2.57  0 [] subset(set_intersection2(A,B),A).
% 2.36/2.57  0 [] -in(A,B)|element(A,B).
% 2.36/2.57  0 [] set_intersection2(A,empty_set)=empty_set.
% 2.36/2.57  0 [] -element(A,B)|empty(B)|in(A,B).
% 2.36/2.57  0 [] -element(A,powerset(B))|subset(A,B).
% 2.36/2.57  0 [] element(A,powerset(B))| -subset(A,B).
% 2.36/2.57  0 [] -relation(A)| -relation(B)| -subset(relation_rng(A),relation_dom(B))|relation_dom(relation_composition(A,B))=relation_dom(A).
% 2.36/2.57  0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.36/2.57  0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.36/2.57  0 [] -empty(A)|A=empty_set.
% 2.36/2.57  0 [] -in(A,B)| -empty(B).
% 2.36/2.57  0 [] -empty(A)|A=B| -empty(B).
% 2.36/2.57  end_of_list.
% 2.36/2.57  
% 2.36/2.57  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 2.36/2.57  
% 2.36/2.57  This ia a non-Horn set with equality.  The strategy will be
% 2.36/2.57  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.36/2.57  deletion, with positive clauses in sos and nonpositive
% 2.36/2.57  clauses in usable.
% 2.36/2.57  
% 2.36/2.57     dependent: set(knuth_bendix).
% 2.36/2.57     dependent: set(anl_eq).
% 2.36/2.57     dependent: set(para_from).
% 2.36/2.57     dependent: set(para_into).
% 2.36/2.57     dependent: clear(para_from_right).
% 2.36/2.57     dependent: clear(para_into_right).
% 2.36/2.57     dependent: set(para_from_vars).
% 2.36/2.57     dependent: set(eq_units_both_ways).
% 2.36/2.57     dependent: set(dynamic_demod_all).
% 2.36/2.57     dependent: set(dynamic_demod).
% 2.36/2.57     dependent: set(order_eq).
% 2.36/2.57     dependent: set(back_demod).
% 2.36/2.57     dependent: set(lrpo).
% 2.36/2.57     dependent: set(hyper_res).
% 2.36/2.57     dependent: set(unit_deletion).
% 2.36/2.57     dependent: set(factor).
% 2.36/2.57  
% 2.36/2.57  ------------> process usable:
% 2.36/2.57  ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.36/2.57  ** KEPT (pick-wt=7): 2 [] -ordinal(A)| -element(B,A)|epsilon_transitive(B).
% 2.36/2.57  ** KEPT (pick-wt=7): 3 [] -ordinal(A)| -element(B,A)|epsilon_connected(B).
% 2.36/2.57  ** KEPT (pick-wt=7): 4 [] -ordinal(A)| -element(B,A)|ordinal(B).
% 2.36/2.57  ** KEPT (pick-wt=4): 5 [] -empty(A)|finite(A).
% 2.36/2.57  ** KEPT (pick-wt=4): 6 [] -empty(A)|function(A).
% 2.36/2.57  ** KEPT (pick-wt=4): 7 [] -ordinal(A)|epsilon_transitive(A).
% 2.36/2.57  ** KEPT (pick-wt=4): 8 [] -ordinal(A)|epsilon_connected(A).
% 2.36/2.57  ** KEPT (pick-wt=4): 9 [] -empty(A)|relation(A).
% 2.36/2.57    Following clause subsumed by 7 during input processing: 0 [] -empty(A)| -ordinal(A)|epsilon_transitive(A).
% 2.36/2.57    Following clause subsumed by 8 during input processing: 0 [] -empty(A)| -ordinal(A)|epsilon_connected(A).
% 2.36/2.57  ** KEPT (pick-wt=6): 10 [] -empty(A)| -ordinal(A)|natural(A).
% 2.36/2.57  ** KEPT (pick-wt=8): 11 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 2.36/2.57  ** KEPT (pick-wt=8): 12 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.36/2.57  ** KEPT (pick-wt=6): 13 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 2.36/2.57  ** KEPT (pick-wt=5): 14 [] -element(A,omega)|epsilon_transitive(A).
% 2.36/2.57  ** KEPT (pick-wt=5): 15 [] -element(A,omega)|epsilon_connected(A).
% 2.36/2.57  ** KEPT (pick-wt=5): 16 [] -element(A,omega)|ordinal(A).
% 2.36/2.57  ** KEPT (pick-wt=5): 17 [] -element(A,omega)|natural(A).
% 2.36/2.57  ** KEPT (pick-wt=4): 18 [] -empty(A)|epsilon_transitive(A).
% 2.36/2.57  ** KEPT (pick-wt=4): 19 [] -empty(A)|epsilon_connected(A).
% 2.36/2.57  ** KEPT (pick-wt=4): 20 [] -empty(A)|ordinal(A).
% 2.36/2.57  ** KEPT (pick-wt=5): 21 [] -finite(A)|relation($f1(A)).
% 2.36/2.57  ** KEPT (pick-wt=5): 22 [] -finite(A)|function($f1(A)).
% 2.36/2.57  ** KEPT (pick-wt=7): 23 [] -finite(A)|relation_rng($f1(A))=A.
% 2.36/2.57  ** KEPT (pick-wt=7): 24 [] -finite(A)|in(relation_dom($f1(A)),omega).
% 2.36/2.57  ** KEPT (pick-wt=14): 25 [] finite(A)| -relation(B)| -function(B)|relation_rng(B)!=A| -in(relation_dom(B),omega).
% 2.36/2.57  ** KEPT (pick-wt=8): 26 [] -relation(A)| -relation(B)|relation(relation_composition(A,B)).
% 2.36/2.57  ** KEPT (pick-wt=6): 27 [] -finite(A)|finite(set_intersection2(B,A)).
% 2.36/2.57  ** KEPT (pick-wt=8): 28 [] -empty(A)| -relation(B)|empty(relation_composition(B,A)).
% 2.36/2.57  ** KEPT (pick-wt=8): 29 [] -empty(A)| -relation(B)|relation(relation_composition(B,A)).
% 2.36/2.57  ** KEPT (pick-wt=6): 30 [] -finite(A)|finite(set_intersection2(A,B)).
% 2.36/2.57    Following clause subsumed by 26 during input processing: 0 [] -relation(A)| -function(A)| -relation(B)| -function(B)|relation(relation_composition(A,B)).
% 2.36/2.57  ** KEPT (pick-wt=12): 31 [] -relation(A)| -function(A)| -relation(B)| -function(B)|function(relation_composition(A,B)).
% 2.36/2.57  ** KEPT (pick-wt=2): 32 [] -empty(omega).
% 2.36/2.57  ** KEPT (pick-wt=8): 33 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 2.36/2.57  ** KEPT (pick-wt=3): 34 [] -empty(powerset(A)).
% 2.36/2.57  ** KEPT (pick-wt=7): 35 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.36/2.57  ** KEPT (pick-wt=7): 36 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 2.36/2.57  ** KEPT (pick-wt=5): 37 [] -empty(A)|empty(relation_dom(A)).
% 2.36/2.57  ** KEPT (pick-wt=5): 38 [] -empty(A)|relation(relation_dom(A)).
% 2.36/2.57  ** KEPT (pick-wt=5): 39 [] -empty(A)|empty(relation_rng(A)).
% 2.36/2.57  ** KEPT (pick-wt=5): 40 [] -empty(A)|relation(relation_rng(A)).
% 2.36/2.57  ** KEPT (pick-wt=8): 41 [] -empty(A)| -relation(B)|empty(relation_composition(A,B)).
% 2.36/2.57  ** KEPT (pick-wt=8): 42 [] -empty(A)| -relation(B)|relation(relation_composition(A,B)).
% 2.36/2.57  ** KEPT (pick-wt=2): 43 [] -empty($c1).
% 2.36/2.57  ** KEPT (pick-wt=2): 44 [] -empty($c2).
% 2.36/2.57  ** KEPT (pick-wt=5): 45 [] empty(A)| -empty($f3(A)).
% 2.36/2.57  ** KEPT (pick-wt=2): 46 [] -empty($c9).
% 2.36/2.57  ** KEPT (pick-wt=2): 47 [] -empty($c10).
% 2.36/2.57  ** KEPT (pick-wt=5): 48 [] empty(A)| -empty($f6(A)).
% 2.36/2.57  ** KEPT (pick-wt=2): 49 [] -empty($c12).
% 2.36/2.57  ** KEPT (pick-wt=12): 51 [copy,50,flip.2] -relation(A)|relation_image(A,set_intersection2(relation_dom(A),B))=relation_image(A,B).
% 2.36/2.57    Following clause subsumed by 30 during input processing: 0 [] -finite(A)|finite(set_intersection2(A,B)).
% 2.36/2.57  ** KEPT (pick-wt=13): 52 [] -relation(A)| -relation(B)|relation_rng(relation_composition(A,B))=relation_image(B,relation_rng(A)).
% 2.36/2.57  ** KEPT (pick-wt=4): 53 [] -finite(relation_image($c15,$c16)).
% 2.36/2.57  ** KEPT (pick-wt=6): 54 [] -in(A,B)|element(A,B).
% 2.36/2.57  ** KEPT (pick-wt=8): 55 [] -element(A,B)|empty(B)|in(A,B).
% 2.36/2.57  ** KEPT (pick-wt=7): 56 [] -element(A,powerset(B))|subset(A,B).
% 2.36/2.57  ** KEPT (pick-wt=7): 57 [] element(A,powerset(B))| -subset(A,B).
% 2.36/2.57  ** KEPT (pick-wt=16): 58 [] -relation(A)| -relation(B)| -subset(relation_rng(A),relation_dom(B))|relation_dom(relation_composition(A,B))=relation_dom(A).
% 2.36/2.57  ** KEPT (pick-wt=10): 59 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.36/2.57  ** KEPT (pick-wt=9): 60 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.36/2.57  ** KEPT (pick-wt=5): 61 [] -empty(A)|A=empty_set.
% 2.36/2.57  ** KEPT (pick-wt=5): 62 [] -in(A,B)| -empty(B).
% 2.36/2.57  ** KEPT (pick-wt=7): 63 [] -empty(A)|A=B| -empty(B).
% 2.36/2.57  
% 2.36/2.57  ------------> process sos:
% 2.36/2.57  ** KEPT (pick-wt=3): 71 [] A=A.
% 2.36/2.57  ** KEPT (pick-wt=7): 72 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.36/2.57  ** KEPT (pick-wt=4): 73 [] element($f2(A),A).
% 2.36/2.57  ** KEPT (pick-wt=2): 74 [] empty(empty_set).
% 2.36/2.57  ** KEPT (pick-wt=2): 75 [] relation(empty_set).
% 2.36/2.57  ** KEPT (pick-wt=2): 76 [] relation_empty_yielding(empty_set).
% 2.36/2.57  ** KEPT (pick-wt=2): 77 [] epsilon_transitive(omega).
% 2.36/2.57  ** KEPT (pick-wt=2): 78 [] epsilon_connected(omega).
% 2.36/2.57  ** KEPT (pick-wt=2): 79 [] ordinal(omega).
% 2.36/2.57    Following clause subsumed by 74 during input processing: 0 [] empty(empty_set).
% 2.36/2.57    Following clause subsumed by 75 during input processing: 0 [] relation(empty_set).
% 2.36/2.57    Following clause subsumed by 76Alarm clock 
% 299.85/300.03  Otter interrupted
% 299.85/300.03  PROOF NOT FOUND
%------------------------------------------------------------------------------