TSTP Solution File: SEU237+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU237+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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:18 EDT 2022
% Result : Timeout 299.88s 300.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU237+3 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.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:50:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.22/2.43 ----- Otter 3.3f, August 2004 -----
% 2.22/2.43 The process was started by sandbox on n023.cluster.edu,
% 2.22/2.43 Wed Jul 27 07:50:48 2022
% 2.22/2.43 The command was "./otter". The process ID is 17379.
% 2.22/2.43
% 2.22/2.43 set(prolog_style_variables).
% 2.22/2.43 set(auto).
% 2.22/2.43 dependent: set(auto1).
% 2.22/2.43 dependent: set(process_input).
% 2.22/2.43 dependent: clear(print_kept).
% 2.22/2.43 dependent: clear(print_new_demod).
% 2.22/2.43 dependent: clear(print_back_demod).
% 2.22/2.43 dependent: clear(print_back_sub).
% 2.22/2.43 dependent: set(control_memory).
% 2.22/2.43 dependent: assign(max_mem, 12000).
% 2.22/2.43 dependent: assign(pick_given_ratio, 4).
% 2.22/2.43 dependent: assign(stats_level, 1).
% 2.22/2.43 dependent: assign(max_seconds, 10800).
% 2.22/2.43 clear(print_given).
% 2.22/2.43
% 2.22/2.43 formula_list(usable).
% 2.22/2.43 all A (A=A).
% 2.22/2.43 all A B (in(A,B)-> -in(B,A)).
% 2.22/2.43 all A B (proper_subset(A,B)-> -proper_subset(B,A)).
% 2.22/2.43 all A (empty(A)->function(A)).
% 2.22/2.43 all A (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)).
% 2.22/2.43 all A (empty(A)->relation(A)).
% 2.22/2.43 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.22/2.43 all A (epsilon_transitive(A)&epsilon_connected(A)->ordinal(A)).
% 2.22/2.43 all A (empty(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.22/2.43 all A B (set_union2(A,B)=set_union2(B,A)).
% 2.22/2.43 all A B (ordinal(A)&ordinal(B)->ordinal_subset(A,B)|ordinal_subset(B,A)).
% 2.22/2.43 all A B (A=B<->subset(A,B)&subset(B,A)).
% 2.22/2.43 all A (succ(A)=set_union2(A,singleton(A))).
% 2.22/2.43 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 2.22/2.43 all A (epsilon_transitive(A)<-> (all B (in(B,A)->subset(B,A)))).
% 2.22/2.43 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 2.22/2.43 all A B (B=union(A)<-> (all C (in(C,B)<-> (exists D (in(C,D)&in(D,A)))))).
% 2.22/2.43 all A (being_limit_ordinal(A)<->A=union(A)).
% 2.22/2.43 all A B (proper_subset(A,B)<->subset(A,B)&A!=B).
% 2.22/2.43 all A exists B element(B,A).
% 2.22/2.43 empty(empty_set).
% 2.22/2.43 relation(empty_set).
% 2.22/2.43 relation_empty_yielding(empty_set).
% 2.22/2.43 all A (-empty(succ(A))).
% 2.22/2.43 empty(empty_set).
% 2.22/2.43 relation(empty_set).
% 2.22/2.43 relation_empty_yielding(empty_set).
% 2.22/2.43 function(empty_set).
% 2.22/2.43 one_to_one(empty_set).
% 2.22/2.43 empty(empty_set).
% 2.22/2.43 epsilon_transitive(empty_set).
% 2.22/2.43 epsilon_connected(empty_set).
% 2.22/2.43 ordinal(empty_set).
% 2.22/2.43 all A B (relation(A)&relation(B)->relation(set_union2(A,B))).
% 2.22/2.43 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 2.22/2.43 all A (ordinal(A)-> -empty(succ(A))&epsilon_transitive(succ(A))&epsilon_connected(succ(A))&ordinal(succ(A))).
% 2.22/2.43 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 2.22/2.43 all A (ordinal(A)->epsilon_transitive(union(A))&epsilon_connected(union(A))&ordinal(union(A))).
% 2.22/2.43 empty(empty_set).
% 2.22/2.43 relation(empty_set).
% 2.22/2.43 all A B (set_union2(A,A)=A).
% 2.22/2.43 all A B (-proper_subset(A,A)).
% 2.22/2.43 exists A (relation(A)&function(A)).
% 2.22/2.43 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.22/2.43 exists A (empty(A)&relation(A)).
% 2.22/2.43 exists A empty(A).
% 2.22/2.43 exists A (relation(A)&empty(A)&function(A)).
% 2.22/2.43 exists A (relation(A)&function(A)&one_to_one(A)&empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.22/2.43 exists A (-empty(A)&relation(A)).
% 2.22/2.43 exists A (-empty(A)).
% 2.22/2.43 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.22/2.43 exists A (-empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.22/2.43 exists A (relation(A)&relation_empty_yielding(A)).
% 2.22/2.43 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 2.22/2.43 exists A (relation(A)&relation_non_empty(A)&function(A)).
% 2.22/2.43 all A B (ordinal(A)&ordinal(B)-> (ordinal_subset(A,B)<->subset(A,B))).
% 2.22/2.43 all A B (ordinal(A)&ordinal(B)->ordinal_subset(A,A)).
% 2.22/2.43 all A B subset(A,A).
% 2.22/2.43 all A in(A,succ(A)).
% 2.22/2.43 all A (set_union2(A,empty_set)=A).
% 2.22/2.43 all A B (in(A,B)->element(A,B)).
% 2.22/2.43 all A (epsilon_transitive(A)-> (all B (ordinal(B)-> (proper_subset(A,B)->in(A,B))))).
% 2.22/2.43 all A B (ordinal(B)-> (in(A,B)->ordinal(A))).
% 2.22/2.43 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.22/2.43 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.22/2.43 -(all A (ordinal(A)-> (being_limit_ordinal(A)<-> (all B (ordinal(B)-> (in(B,A)->in(succ(B),A))))))).
% 2.22/2.43 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.22/2.43 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.22/2.43 all A (empty(A)->A=empty_set).
% 2.22/2.43 all A B (-(in(A,B)&empty(B))).
% 2.22/2.43 all A B (-(empty(A)&A!=B&empty(B))).
% 2.22/2.43 all A B C (subset(A,B)&subset(C,B)->subset(set_union2(A,C),B)).
% 2.22/2.43 end_of_list.
% 2.22/2.43
% 2.22/2.43 -------> usable clausifies to:
% 2.22/2.43
% 2.22/2.43 list(usable).
% 2.22/2.43 0 [] A=A.
% 2.22/2.43 0 [] -in(A,B)| -in(B,A).
% 2.22/2.43 0 [] -proper_subset(A,B)| -proper_subset(B,A).
% 2.22/2.43 0 [] -empty(A)|function(A).
% 2.22/2.43 0 [] -ordinal(A)|epsilon_transitive(A).
% 2.22/2.43 0 [] -ordinal(A)|epsilon_connected(A).
% 2.22/2.43 0 [] -empty(A)|relation(A).
% 2.22/2.43 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.22/2.43 0 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 2.22/2.43 0 [] -empty(A)|epsilon_transitive(A).
% 2.22/2.43 0 [] -empty(A)|epsilon_connected(A).
% 2.22/2.43 0 [] -empty(A)|ordinal(A).
% 2.22/2.43 0 [] set_union2(A,B)=set_union2(B,A).
% 2.22/2.43 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)|ordinal_subset(B,A).
% 2.22/2.43 0 [] A!=B|subset(A,B).
% 2.22/2.43 0 [] A!=B|subset(B,A).
% 2.22/2.43 0 [] A=B| -subset(A,B)| -subset(B,A).
% 2.22/2.43 0 [] succ(A)=set_union2(A,singleton(A)).
% 2.22/2.43 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 2.22/2.43 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 2.22/2.43 0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A.
% 2.22/2.43 0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A.
% 2.22/2.43 0 [] -epsilon_transitive(A)| -in(B,A)|subset(B,A).
% 2.22/2.43 0 [] epsilon_transitive(A)|in($f2(A),A).
% 2.22/2.43 0 [] epsilon_transitive(A)| -subset($f2(A),A).
% 2.22/2.43 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.22/2.43 0 [] subset(A,B)|in($f3(A,B),A).
% 2.22/2.43 0 [] subset(A,B)| -in($f3(A,B),B).
% 2.22/2.43 0 [] B!=union(A)| -in(C,B)|in(C,$f4(A,B,C)).
% 2.22/2.43 0 [] B!=union(A)| -in(C,B)|in($f4(A,B,C),A).
% 2.22/2.43 0 [] B!=union(A)|in(C,B)| -in(C,D)| -in(D,A).
% 2.22/2.43 0 [] B=union(A)|in($f6(A,B),B)|in($f6(A,B),$f5(A,B)).
% 2.22/2.43 0 [] B=union(A)|in($f6(A,B),B)|in($f5(A,B),A).
% 2.22/2.43 0 [] B=union(A)| -in($f6(A,B),B)| -in($f6(A,B),X1)| -in(X1,A).
% 2.22/2.43 0 [] -being_limit_ordinal(A)|A=union(A).
% 2.22/2.43 0 [] being_limit_ordinal(A)|A!=union(A).
% 2.22/2.43 0 [] -proper_subset(A,B)|subset(A,B).
% 2.22/2.43 0 [] -proper_subset(A,B)|A!=B.
% 2.22/2.43 0 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 2.22/2.43 0 [] element($f7(A),A).
% 2.22/2.43 0 [] empty(empty_set).
% 2.22/2.43 0 [] relation(empty_set).
% 2.22/2.43 0 [] relation_empty_yielding(empty_set).
% 2.22/2.43 0 [] -empty(succ(A)).
% 2.22/2.43 0 [] empty(empty_set).
% 2.22/2.43 0 [] relation(empty_set).
% 2.22/2.43 0 [] relation_empty_yielding(empty_set).
% 2.22/2.43 0 [] function(empty_set).
% 2.22/2.43 0 [] one_to_one(empty_set).
% 2.22/2.43 0 [] empty(empty_set).
% 2.22/2.43 0 [] epsilon_transitive(empty_set).
% 2.22/2.43 0 [] epsilon_connected(empty_set).
% 2.22/2.43 0 [] ordinal(empty_set).
% 2.22/2.43 0 [] -relation(A)| -relation(B)|relation(set_union2(A,B)).
% 2.22/2.43 0 [] empty(A)| -empty(set_union2(A,B)).
% 2.22/2.43 0 [] -ordinal(A)| -empty(succ(A)).
% 2.22/2.43 0 [] -ordinal(A)|epsilon_transitive(succ(A)).
% 2.22/2.43 0 [] -ordinal(A)|epsilon_connected(succ(A)).
% 2.22/2.43 0 [] -ordinal(A)|ordinal(succ(A)).
% 2.22/2.43 0 [] empty(A)| -empty(set_union2(B,A)).
% 2.22/2.43 0 [] -ordinal(A)|epsilon_transitive(union(A)).
% 2.22/2.43 0 [] -ordinal(A)|epsilon_connected(union(A)).
% 2.22/2.43 0 [] -ordinal(A)|ordinal(union(A)).
% 2.22/2.43 0 [] empty(empty_set).
% 2.22/2.43 0 [] relation(empty_set).
% 2.22/2.43 0 [] set_union2(A,A)=A.
% 2.22/2.43 0 [] -proper_subset(A,A).
% 2.22/2.43 0 [] relation($c1).
% 2.22/2.43 0 [] function($c1).
% 2.22/2.43 0 [] epsilon_transitive($c2).
% 2.22/2.43 0 [] epsilon_connected($c2).
% 2.22/2.43 0 [] ordinal($c2).
% 2.22/2.43 0 [] empty($c3).
% 2.22/2.43 0 [] relation($c3).
% 2.22/2.43 0 [] empty($c4).
% 2.22/2.43 0 [] relation($c5).
% 2.22/2.43 0 [] empty($c5).
% 2.22/2.43 0 [] function($c5).
% 2.22/2.43 0 [] relation($c6).
% 2.22/2.43 0 [] function($c6).
% 2.22/2.43 0 [] one_to_one($c6).
% 2.22/2.43 0 [] empty($c6).
% 2.22/2.43 0 [] epsilon_transitive($c6).
% 2.22/2.43 0 [] epsilon_connected($c6).
% 2.22/2.43 0 [] ordinal($c6).
% 2.22/2.43 0 [] -empty($c7).
% 2.22/2.43 0 [] relation($c7).
% 2.22/2.43 0 [] -empty($c8).
% 2.22/2.43 0 [] relation($c9).
% 2.22/2.43 0 [] function($c9).
% 2.22/2.43 0 [] one_to_one($c9).
% 2.22/2.43 0 [] -empty($c10).
% 2.22/2.43 0 [] epsilon_transitive($c10).
% 2.22/2.43 0 [] epsilon_connected($c10).
% 2.22/2.43 0 [] ordinal($c10).
% 2.22/2.43 0 [] relation($c11).
% 2.22/2.43 0 [] relation_empty_yielding($c11).
% 2.22/2.43 0 [] relation($c12).
% 2.22/2.43 0 [] relation_empty_yielding($c12).
% 2.22/2.43 0 [] function($c12).
% 2.22/2.43 0 [] relation($c13).
% 2.22/2.43 0 [] relation_non_empty($c13).
% 2.22/2.43 0 [] function($c13).
% 2.22/2.43 0 [] -ordinal(A)| -ordinal(B)| -ordinal_subset(A,B)|subset(A,B).
% 2.22/2.43 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)| -subset(A,B).
% 2.22/2.43 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,A).
% 2.22/2.43 0 [] subset(A,A).
% 2.22/2.43 0 [] in(A,succ(A)).
% 2.22/2.43 0 [] set_union2(A,empty_set)=A.
% 2.22/2.43 0 [] -in(A,B)|element(A,B).
% 2.22/2.43 0 [] -epsilon_transitive(A)| -ordinal(B)| -proper_subset(A,B)|in(A,B).
% 2.22/2.43 0 [] -ordinal(B)| -in(A,B)|ordinal(A).
% 2.22/2.43 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.22/2.43 0 [] -element(A,powerset(B))|subset(A,B).
% 2.22/2.43 0 [] element(A,powerset(B))| -subset(A,B).
% 2.22/2.43 0 [] ordinal($c15).
% 2.22/2.43 0 [] being_limit_ordinal($c15)| -ordinal(B)| -in(B,$c15)|in(succ(B),$c15).
% 2.22/2.43 0 [] -being_limit_ordinal($c15)|ordinal($c14).
% 2.22/2.43 0 [] -being_limit_ordinal($c15)|in($c14,$c15).
% 2.22/2.43 0 [] -being_limit_ordinal($c15)| -in(succ($c14),$c15).
% 2.22/2.43 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.22/2.43 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.22/2.43 0 [] -empty(A)|A=empty_set.
% 2.22/2.43 0 [] -in(A,B)| -empty(B).
% 2.22/2.43 0 [] -empty(A)|A=B| -empty(B).
% 2.22/2.43 0 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 2.22/2.43 end_of_list.
% 2.22/2.43
% 2.22/2.43 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 2.22/2.43
% 2.22/2.43 This ia a non-Horn set with equality. The strategy will be
% 2.22/2.43 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.22/2.43 deletion, with positive clauses in sos and nonpositive
% 2.22/2.43 clauses in usable.
% 2.22/2.43
% 2.22/2.43 dependent: set(knuth_bendix).
% 2.22/2.43 dependent: set(anl_eq).
% 2.22/2.43 dependent: set(para_from).
% 2.22/2.43 dependent: set(para_into).
% 2.22/2.43 dependent: clear(para_from_right).
% 2.22/2.43 dependent: clear(para_into_right).
% 2.22/2.43 dependent: set(para_from_vars).
% 2.22/2.43 dependent: set(eq_units_both_ways).
% 2.22/2.43 dependent: set(dynamic_demod_all).
% 2.22/2.43 dependent: set(dynamic_demod).
% 2.22/2.43 dependent: set(order_eq).
% 2.22/2.43 dependent: set(back_demod).
% 2.22/2.43 dependent: set(lrpo).
% 2.22/2.43 dependent: set(hyper_res).
% 2.22/2.43 dependent: set(unit_deletion).
% 2.22/2.43 dependent: set(factor).
% 2.22/2.43
% 2.22/2.43 ------------> process usable:
% 2.22/2.43 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.22/2.43 ** KEPT (pick-wt=6): 2 [] -proper_subset(A,B)| -proper_subset(B,A).
% 2.22/2.43 ** KEPT (pick-wt=4): 3 [] -empty(A)|function(A).
% 2.22/2.43 ** KEPT (pick-wt=4): 4 [] -ordinal(A)|epsilon_transitive(A).
% 2.22/2.43 ** KEPT (pick-wt=4): 5 [] -ordinal(A)|epsilon_connected(A).
% 2.22/2.43 ** KEPT (pick-wt=4): 6 [] -empty(A)|relation(A).
% 2.22/2.43 ** KEPT (pick-wt=8): 7 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.22/2.43 ** KEPT (pick-wt=6): 8 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 2.22/2.43 ** KEPT (pick-wt=4): 9 [] -empty(A)|epsilon_transitive(A).
% 2.22/2.43 ** KEPT (pick-wt=4): 10 [] -empty(A)|epsilon_connected(A).
% 2.22/2.43 ** KEPT (pick-wt=4): 11 [] -empty(A)|ordinal(A).
% 2.22/2.43 ** KEPT (pick-wt=10): 12 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)|ordinal_subset(B,A).
% 2.22/2.43 ** KEPT (pick-wt=6): 13 [] A!=B|subset(A,B).
% 2.22/2.43 ** KEPT (pick-wt=6): 14 [] A!=B|subset(B,A).
% 2.22/2.43 ** KEPT (pick-wt=9): 15 [] A=B| -subset(A,B)| -subset(B,A).
% 2.22/2.43 ** KEPT (pick-wt=10): 16 [] A!=singleton(B)| -in(C,A)|C=B.
% 2.22/2.43 ** KEPT (pick-wt=10): 17 [] A!=singleton(B)|in(C,A)|C!=B.
% 2.22/2.43 ** KEPT (pick-wt=14): 18 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 2.22/2.43 ** KEPT (pick-wt=8): 19 [] -epsilon_transitive(A)| -in(B,A)|subset(B,A).
% 2.22/2.43 ** KEPT (pick-wt=6): 20 [] epsilon_transitive(A)| -subset($f2(A),A).
% 2.22/2.43 ** KEPT (pick-wt=9): 21 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.22/2.43 ** KEPT (pick-wt=8): 22 [] subset(A,B)| -in($f3(A,B),B).
% 2.22/2.43 ** KEPT (pick-wt=13): 23 [] A!=union(B)| -in(C,A)|in(C,$f4(B,A,C)).
% 2.22/2.43 ** KEPT (pick-wt=13): 24 [] A!=union(B)| -in(C,A)|in($f4(B,A,C),B).
% 2.22/2.43 ** KEPT (pick-wt=13): 25 [] A!=union(B)|in(C,A)| -in(C,D)| -in(D,B).
% 2.22/2.43 ** KEPT (pick-wt=17): 26 [] A=union(B)| -in($f6(B,A),A)| -in($f6(B,A),C)| -in(C,B).
% 2.22/2.43 ** KEPT (pick-wt=6): 28 [copy,27,flip.2] -being_limit_ordinal(A)|union(A)=A.
% 2.22/2.43 ** KEPT (pick-wt=6): 30 [copy,29,flip.2] being_limit_ordinal(A)|union(A)!=A.
% 2.22/2.43 ** KEPT (pick-wt=6): 31 [] -proper_subset(A,B)|subset(A,B).
% 2.22/2.43 ** KEPT (pick-wt=6): 32 [] -proper_subset(A,B)|A!=B.
% 2.22/2.43 ** KEPT (pick-wt=9): 33 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 2.22/2.43 ** KEPT (pick-wt=3): 34 [] -empty(succ(A)).
% 2.22/2.43 ** KEPT (pick-wt=8): 35 [] -relation(A)| -relation(B)|relation(set_union2(A,B)).
% 2.22/2.43 ** KEPT (pick-wt=6): 36 [] empty(A)| -empty(set_union2(A,B)).
% 2.22/2.43 Following clause subsumed by 34 during input processing: 0 [] -ordinal(A)| -empty(succ(A)).
% 2.22/2.43 ** KEPT (pick-wt=5): 37 [] -ordinal(A)|epsilon_transitive(succ(A)).
% 2.22/2.43 ** KEPT (pick-wt=5): 38 [] -ordinal(A)|epsilon_connected(succ(A)).
% 2.22/2.43 ** KEPT (pick-wt=5): 39 [] -ordinal(A)|ordinal(succ(A)).
% 2.22/2.43 ** KEPT (pick-wt=6): 40 [] empty(A)| -empty(set_union2(B,A)).
% 2.22/2.43 ** KEPT (pick-wt=5): 41 [] -ordinal(A)|epsilon_transitive(union(A)).
% 2.22/2.43 ** KEPT (pick-wt=5): 42 [] -ordinal(A)|epsilon_connected(union(A)).
% 2.22/2.43 ** KEPT (pick-wt=5): 43 [] -ordinal(A)|ordinal(union(A)).
% 2.22/2.43 ** KEPT (pick-wt=3): 44 [] -proper_subset(A,A).
% 2.22/2.43 ** KEPT (pick-wt=2): 45 [] -empty($c7).
% 2.22/2.43 ** KEPT (pick-wt=2): 46 [] -empty($c8).
% 2.22/2.43 ** KEPT (pick-wt=2): 47 [] -empty($c10).
% 2.22/2.43 ** KEPT (pick-wt=10): 48 [] -ordinal(A)| -ordinal(B)| -ordinal_subset(A,B)|subset(A,B).
% 2.22/2.43 ** KEPT (pick-wt=10): 49 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)| -subset(A,B).
% 2.22/2.43 ** KEPT (pick-wt=5): 51 [copy,50,factor_simp] -ordinal(A)|ordinal_subset(A,A).
% 2.22/2.43 ** KEPT (pick-wt=6): 52 [] -in(A,B)|element(A,B).
% 2.22/2.43 ** KEPT (pick-wt=10): 53 [] -epsilon_transitive(A)| -ordinal(B)| -proper_subset(A,B)|in(A,B).
% 2.22/2.43 ** KEPT (pick-wt=7): 54 [] -ordinal(A)| -in(B,A)|ordinal(B).
% 2.22/2.43 ** KEPT (pick-wt=8): 55 [] -element(A,B)|empty(B)|in(A,B).
% 2.22/2.43 ** KEPT (pick-wt=7): 56 [] -element(A,powerset(B))|subset(A,B).
% 2.22/2.43 ** KEPT (pick-wt=7): 57 [] element(A,powerset(B))| -subset(A,B).
% 2.22/2.43 ** KEPT (pick-wt=11): 58 [] being_limit_ordinal($c15)| -ordinal(A)| -in(A,$c15)|in(succ(A),$c15).
% 2.22/2.43 ** KEPT (pick-wt=4): 59 [] -being_limit_ordinal($c15)|ordinal($c14).
% 2.22/2.43 ** KEPT (pick-wt=5): 60 [] -being_limit_ordinal($c15)|in($c14,$c15).
% 2.22/2.43 ** KEPT (pick-wt=6): 61 [] -being_limit_ordinal($c15)| -in(succ($c14),$c15).
% 2.22/2.43 ** KEPT (pick-wt=10): 62 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.22/2.43 ** KEPT (pick-wt=9): 63 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.22/2.43 ** KEPT (pick-wt=5): 64 [] -empty(A)|A=empty_set.
% 2.22/2.43 ** KEPT (pick-wt=5): 65 [] -in(A,B)| -empty(B).
% 2.22/2.43 ** KEPT (pick-wt=7): 66 [] -empty(A)|A=B| -empty(B).
% 2.22/2.43 ** KEPT (pick-wt=11): 67 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 2.22/2.43
% 2.22/2.43 ------------> process sos:
% 2.22/2.43 ** KEPT (pick-wt=3): 75 [] A=A.
% 2.22/2.43 ** KEPT (pick-wt=7): 76 [] set_union2(A,B)=set_union2(B,A).
% 2.22/2.43 ** KEPT (pick-wt=7): 77 [] succ(A)=set_union2(A,singleton(A)).
% 2.22/2.43 ---> New Demodulator: 78 [new_demod,77] succ(A)=set_union2(A,singleton(A)).
% 2.22/2.43 ** KEPT (pick-wt=14): 79 [] A=singleton(B)|in($f1(B,A),A)|$f1(B,A)=B.
% 2.22/2.43 ** KEPT (pick-wt=6): 80 [] epsilon_transitive(A)|in($f2(A),A).
% 2.22/2.43 ** KEPT (pick-wt=8): 81 [] subset(A,B)|in($f3(A,B),A).
% 2.22/2.43 ** KEPT (pick-wt=16): 82 [] A=union(B)|in($f6(B,A),A)|in($f6(B,A),$f5(B,A)).
% 2.22/2.43 ** KEPT (pick-wt=14): 83 [] A=union(B)|in($f6(B,A),A)|in($f5(B,A),B).
% 2.22/2.43 ** KEPT (pick-wt=4): 84 [] element($f7(A),A).
% 2.22/2.43 ** KEPT (pick-wt=2): 85 [] empty(empty_set).
% 2.22/2.43 ** KEPT (pick-wt=2): 86 [] relation(empty_set).
% 2.22/2.43 ** KEPT (pick-wt=2): 87 [] relation_empty_yielding(empty_set).
% 2.22/2.43 Following clause subsumed by 85 during input processing: 0 [] empty(empty_set).
% 2.22/2.43 Following clause subsumed by 86 during input processing: 0 [] relation(empty_set).
% 2.22/2.43 Following clause subsumed by 87 during input processing: 0 [] relation_empty_yielding(empty_set).
% 2.22/2.43 ** KEPT (pick-wt=2): 88 [] function(empty_set).
% 2.22/2.43 ** KEPT (pick-wt=2): 89 [] one_to_one(empty_set).
% 2.22/2.43 Following clause subsumed by 85 during input processing: 0 [] empty(empty_set).
% 2.22/2.43 ** KEPT (pick-wt=2): 90 [] epsilon_transitive(empty_set).
% 2.22/2.43 ** KEPT (pick-wt=2): 91 [] epsilon_connected(empty_set).
% 2.22/2.43 ** KEPT (pick-wt=2): 92 [] ordinal(empty_set).
% 2.22/2.43 Following clause subsumed by 85 during input processing: 0 [] empty(empty_set).
% 2.22/2.43 Following clause subsumed by 86 during input processing: 0 [] relation(empty_set).
% 2.22/2.43 ** KEPT (pick-wt=5): 93 [] set_union2(A,A)=A.
% 2.22/2.43 ---> New Demodulator: 94 [new_demod,93] set_union2(A,A)=A.
% 2.22/2.43 ** KEPT (pick-wt=2): 95 [] relation($c1).
% 2.22/2.43 ** KEPT (pick-wt=2): 96 [] function($c1).
% 2.22/2.43 ** KEPT (pick-wt=2): 97 [] epsilon_transitive($c2).
% 2.22/2.43 ** KEPT (pick-wt=2): 98 [] epsilon_connected($c2).
% 2.22/2.43 ** KEPT (pick-wt=2): 99 [] ordinal($c2).
% 2.22/2.43 ** KEPT (pick-wt=2): 100 [] empty($c3).
% 2.22/2.43 ** KEPT (pick-wt=2): 101 [] relation($c3).
% 2.22/2.43 ** KEPT (pick-wt=2): 102 [] empty($c4).
% 2.22/2.43 ** KEPT (pick-wt=2): 103 [] relation($c5).
% 2.22/2.43 ** KEPT (pick-wt=2): 104 [] empty($c5).
% 2.22/2.43 ** KEPT (pick-wt=2): 105 [] function($c5).
% 2.22/2.43 ** KEPT (pick-wt=2): 106 [] relation($c6).
% 2.22/2.43 ** KEPT (pick-wt=2): 107 [] function($c6).
% 2.22/2.43 ** KEPT (pick-wt=2): 108 [] one_to_one($c6).
% 2.22/2.43 ** KEPT (pick-wt=2): 109 [] empty($c6).
% 2.22/2.43 ** KEPT (pick-wt=2): 110 [] epsilon_transitive($c6).
% 2.22/2.43 ** KEPT (pick-wt=2): 111 [] epsilon_connected($c6).
% 2.22/2.43 ** KEPT (pick-wt=2): 112 [] ordinal($c6).
% 2.22/2.43 ** KEPT (pick-wt=2): 113 [] relation($c7).
% 2.22/2.43 ** KEPT (pick-wt=2): 114 [] relation($c9).
% 2.22/2.43 ** KEPT (pick-wt=2): 115 [] function($c9).
% 2.22/2.43 ** KEPT (pick-wt=2): 116 [] one_to_one($c9).
% 2.22/2.43 ** KEPT (pick-wt=2): 117 [] epsilon_transitive($c10).
% 2.22/2.43 ** KEPT (pick-wt=2): 118 [] epsilon_connected($c10).
% 2.22/2.43 ** KEPT (pick-wt=2): 119 [] ordinal($c10).
% 2.22/2.43 ** KEPT (pick-wt=2): 120 [] relation($c11).
% 2.22/2.43 ** KEPT (pick-wt=2): 121 [] relation_empty_yielding($c11).
% 2.22/2.43 ** KEPT (pick-wt=2): 122 [] relation($c12).
% 2.22/2.43 ** KEPT (pick-wt=2): 123 [] relation_empty_yielding($c12).
% 2.22/2.43 ** KEPT (pick-wt=2)Alarm clock
% 299.88/300.03 Otter interrupted
% 299.88/300.03 PROOF NOT FOUND
%------------------------------------------------------------------------------