TSTP Solution File: SEU270+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU270+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:24 EDT 2022
% Result : Unknown 282.54s 282.70s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU270+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14 % Command : otter-tptp-script %s
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Jul 27 07:59:05 EDT 2022
% 0.13/0.35 % CPUTime :
% 2.08/2.24 ----- Otter 3.3f, August 2004 -----
% 2.08/2.24 The process was started by sandbox on n022.cluster.edu,
% 2.08/2.24 Wed Jul 27 07:59:05 2022
% 2.08/2.24 The command was "./otter". The process ID is 23060.
% 2.08/2.24
% 2.08/2.24 set(prolog_style_variables).
% 2.08/2.24 set(auto).
% 2.08/2.24 dependent: set(auto1).
% 2.08/2.24 dependent: set(process_input).
% 2.08/2.24 dependent: clear(print_kept).
% 2.08/2.24 dependent: clear(print_new_demod).
% 2.08/2.24 dependent: clear(print_back_demod).
% 2.08/2.24 dependent: clear(print_back_sub).
% 2.08/2.24 dependent: set(control_memory).
% 2.08/2.24 dependent: assign(max_mem, 12000).
% 2.08/2.24 dependent: assign(pick_given_ratio, 4).
% 2.08/2.24 dependent: assign(stats_level, 1).
% 2.08/2.24 dependent: assign(max_seconds, 10800).
% 2.08/2.24 clear(print_given).
% 2.08/2.24
% 2.08/2.24 formula_list(usable).
% 2.08/2.24 all A (A=A).
% 2.08/2.24 all A B (in(A,B)-> -in(B,A)).
% 2.08/2.24 all A (empty(A)->function(A)).
% 2.08/2.24 all A (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)).
% 2.08/2.24 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.08/2.24 all A (epsilon_transitive(A)&epsilon_connected(A)->ordinal(A)).
% 2.08/2.24 all A (empty(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.08/2.24 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.08/2.24 all A B (set_union2(A,B)=set_union2(B,A)).
% 2.08/2.24 all A B (ordinal(A)&ordinal(B)->ordinal_subset(A,B)|ordinal_subset(B,A)).
% 2.08/2.24 all A (relation(A)-> (connected(A)<->is_connected_in(A,relation_field(A)))).
% 2.08/2.24 all A B (relation(B)-> (B=inclusion_relation(A)<->relation_field(B)=A& (all C D (in(C,A)&in(D,A)-> (in(ordered_pair(C,D),B)<->subset(C,D)))))).
% 2.08/2.24 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 2.08/2.24 all A (relation(A)->relation_field(A)=set_union2(relation_dom(A),relation_rng(A))).
% 2.08/2.24 all A (relation(A)-> (all B (is_connected_in(A,B)<-> (all C D (-(in(C,B)&in(D,B)&C!=D& -in(ordered_pair(C,D),A)& -in(ordered_pair(D,C),A))))))).
% 2.08/2.24 $T.
% 2.08/2.24 $T.
% 2.08/2.24 all A relation(inclusion_relation(A)).
% 2.08/2.24 $T.
% 2.08/2.24 $T.
% 2.08/2.24 $T.
% 2.08/2.24 $T.
% 2.08/2.24 $T.
% 2.08/2.24 $T.
% 2.08/2.24 $T.
% 2.08/2.24 $T.
% 2.08/2.24 all A exists B element(B,A).
% 2.08/2.24 empty(empty_set).
% 2.08/2.24 all A B (-empty(ordered_pair(A,B))).
% 2.08/2.24 relation(empty_set).
% 2.08/2.24 relation_empty_yielding(empty_set).
% 2.08/2.24 function(empty_set).
% 2.08/2.24 one_to_one(empty_set).
% 2.08/2.24 empty(empty_set).
% 2.08/2.24 epsilon_transitive(empty_set).
% 2.08/2.24 epsilon_connected(empty_set).
% 2.08/2.24 ordinal(empty_set).
% 2.08/2.24 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 2.08/2.24 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 2.08/2.24 all A B (set_union2(A,A)=A).
% 2.08/2.24 exists A (relation(A)&function(A)).
% 2.08/2.24 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.08/2.24 exists A empty(A).
% 2.08/2.24 exists A (relation(A)&empty(A)&function(A)).
% 2.08/2.24 exists A (relation(A)&function(A)&one_to_one(A)&empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.08/2.24 exists A (-empty(A)).
% 2.08/2.24 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.08/2.24 exists A (-empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 2.08/2.24 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 2.08/2.24 all A B (ordinal(A)&ordinal(B)-> (ordinal_subset(A,B)<->subset(A,B))).
% 2.08/2.24 all A B (ordinal(A)&ordinal(B)->ordinal_subset(A,A)).
% 2.08/2.24 all A B subset(A,A).
% 2.08/2.24 all A (set_union2(A,empty_set)=A).
% 2.08/2.24 all A B (in(A,B)->element(A,B)).
% 2.08/2.24 all A B (ordinal(B)-> (in(A,B)->ordinal(A))).
% 2.08/2.24 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.08/2.24 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.08/2.24 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.08/2.24 -(all A (ordinal(A)->connected(inclusion_relation(A)))).
% 2.08/2.24 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.08/2.24 all A (empty(A)->A=empty_set).
% 2.08/2.24 all A B (-(in(A,B)&empty(B))).
% 2.08/2.24 all A B (-(empty(A)&A!=B&empty(B))).
% 2.08/2.24 end_of_list.
% 2.08/2.24
% 2.08/2.24 -------> usable clausifies to:
% 2.08/2.24
% 2.08/2.24 list(usable).
% 2.08/2.24 0 [] A=A.
% 2.08/2.24 0 [] -in(A,B)| -in(B,A).
% 2.08/2.24 0 [] -empty(A)|function(A).
% 2.08/2.24 0 [] -ordinal(A)|epsilon_transitive(A).
% 2.08/2.24 0 [] -ordinal(A)|epsilon_connected(A).
% 2.08/2.24 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.08/2.24 0 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 2.08/2.24 0 [] -empty(A)|epsilon_transitive(A).
% 2.08/2.24 0 [] -empty(A)|epsilon_connected(A).
% 2.08/2.24 0 [] -empty(A)|ordinal(A).
% 2.08/2.24 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.08/2.24 0 [] set_union2(A,B)=set_union2(B,A).
% 2.08/2.24 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)|ordinal_subset(B,A).
% 2.08/2.24 0 [] -relation(A)| -connected(A)|is_connected_in(A,relation_field(A)).
% 2.08/2.24 0 [] -relation(A)|connected(A)| -is_connected_in(A,relation_field(A)).
% 2.08/2.24 0 [] -relation(B)|B!=inclusion_relation(A)|relation_field(B)=A.
% 2.08/2.24 0 [] -relation(B)|B!=inclusion_relation(A)| -in(C,A)| -in(D,A)| -in(ordered_pair(C,D),B)|subset(C,D).
% 2.08/2.25 0 [] -relation(B)|B!=inclusion_relation(A)| -in(C,A)| -in(D,A)|in(ordered_pair(C,D),B)| -subset(C,D).
% 2.08/2.25 0 [] -relation(B)|B=inclusion_relation(A)|relation_field(B)!=A|in($f2(A,B),A).
% 2.08/2.25 0 [] -relation(B)|B=inclusion_relation(A)|relation_field(B)!=A|in($f1(A,B),A).
% 2.08/2.25 0 [] -relation(B)|B=inclusion_relation(A)|relation_field(B)!=A|in(ordered_pair($f2(A,B),$f1(A,B)),B)|subset($f2(A,B),$f1(A,B)).
% 2.08/2.25 0 [] -relation(B)|B=inclusion_relation(A)|relation_field(B)!=A| -in(ordered_pair($f2(A,B),$f1(A,B)),B)| -subset($f2(A,B),$f1(A,B)).
% 2.08/2.25 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.08/2.25 0 [] -relation(A)|relation_field(A)=set_union2(relation_dom(A),relation_rng(A)).
% 2.08/2.25 0 [] -relation(A)| -is_connected_in(A,B)| -in(C,B)| -in(D,B)|C=D|in(ordered_pair(C,D),A)|in(ordered_pair(D,C),A).
% 2.08/2.25 0 [] -relation(A)|is_connected_in(A,B)|in($f4(A,B),B).
% 2.08/2.25 0 [] -relation(A)|is_connected_in(A,B)|in($f3(A,B),B).
% 2.08/2.25 0 [] -relation(A)|is_connected_in(A,B)|$f4(A,B)!=$f3(A,B).
% 2.08/2.25 0 [] -relation(A)|is_connected_in(A,B)| -in(ordered_pair($f4(A,B),$f3(A,B)),A).
% 2.08/2.25 0 [] -relation(A)|is_connected_in(A,B)| -in(ordered_pair($f3(A,B),$f4(A,B)),A).
% 2.08/2.25 0 [] $T.
% 2.08/2.25 0 [] $T.
% 2.08/2.25 0 [] relation(inclusion_relation(A)).
% 2.08/2.25 0 [] $T.
% 2.08/2.25 0 [] $T.
% 2.08/2.25 0 [] $T.
% 2.08/2.25 0 [] $T.
% 2.08/2.25 0 [] $T.
% 2.08/2.25 0 [] $T.
% 2.08/2.25 0 [] $T.
% 2.08/2.25 0 [] $T.
% 2.08/2.25 0 [] element($f5(A),A).
% 2.08/2.25 0 [] empty(empty_set).
% 2.08/2.25 0 [] -empty(ordered_pair(A,B)).
% 2.08/2.25 0 [] relation(empty_set).
% 2.08/2.25 0 [] relation_empty_yielding(empty_set).
% 2.08/2.25 0 [] function(empty_set).
% 2.08/2.25 0 [] one_to_one(empty_set).
% 2.08/2.25 0 [] empty(empty_set).
% 2.08/2.25 0 [] epsilon_transitive(empty_set).
% 2.08/2.25 0 [] epsilon_connected(empty_set).
% 2.08/2.25 0 [] ordinal(empty_set).
% 2.08/2.25 0 [] empty(A)| -empty(set_union2(A,B)).
% 2.08/2.25 0 [] empty(A)| -empty(set_union2(B,A)).
% 2.08/2.25 0 [] set_union2(A,A)=A.
% 2.08/2.25 0 [] relation($c1).
% 2.08/2.25 0 [] function($c1).
% 2.08/2.25 0 [] epsilon_transitive($c2).
% 2.08/2.25 0 [] epsilon_connected($c2).
% 2.08/2.25 0 [] ordinal($c2).
% 2.08/2.25 0 [] empty($c3).
% 2.08/2.25 0 [] relation($c4).
% 2.08/2.25 0 [] empty($c4).
% 2.08/2.25 0 [] function($c4).
% 2.08/2.25 0 [] relation($c5).
% 2.08/2.25 0 [] function($c5).
% 2.08/2.25 0 [] one_to_one($c5).
% 2.08/2.25 0 [] empty($c5).
% 2.08/2.25 0 [] epsilon_transitive($c5).
% 2.08/2.25 0 [] epsilon_connected($c5).
% 2.08/2.25 0 [] ordinal($c5).
% 2.08/2.25 0 [] -empty($c6).
% 2.08/2.25 0 [] relation($c7).
% 2.08/2.25 0 [] function($c7).
% 2.08/2.25 0 [] one_to_one($c7).
% 2.08/2.25 0 [] -empty($c8).
% 2.08/2.25 0 [] epsilon_transitive($c8).
% 2.08/2.25 0 [] epsilon_connected($c8).
% 2.08/2.25 0 [] ordinal($c8).
% 2.08/2.25 0 [] relation($c9).
% 2.08/2.25 0 [] relation_empty_yielding($c9).
% 2.08/2.25 0 [] function($c9).
% 2.08/2.25 0 [] -ordinal(A)| -ordinal(B)| -ordinal_subset(A,B)|subset(A,B).
% 2.08/2.25 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)| -subset(A,B).
% 2.08/2.25 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,A).
% 2.08/2.25 0 [] subset(A,A).
% 2.08/2.25 0 [] set_union2(A,empty_set)=A.
% 2.08/2.25 0 [] -in(A,B)|element(A,B).
% 2.08/2.25 0 [] -ordinal(B)| -in(A,B)|ordinal(A).
% 2.08/2.25 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.08/2.25 0 [] -element(A,powerset(B))|subset(A,B).
% 2.08/2.25 0 [] element(A,powerset(B))| -subset(A,B).
% 2.08/2.25 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.08/2.25 0 [] ordinal($c10).
% 2.08/2.25 0 [] -connected(inclusion_relation($c10)).
% 2.08/2.25 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.08/2.25 0 [] -empty(A)|A=empty_set.
% 2.08/2.25 0 [] -in(A,B)| -empty(B).
% 2.08/2.25 0 [] -empty(A)|A=B| -empty(B).
% 2.08/2.25 end_of_list.
% 2.08/2.25
% 2.08/2.25 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 2.08/2.25
% 2.08/2.25 This ia a non-Horn set with equality. The strategy will be
% 2.08/2.25 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.08/2.25 deletion, with positive clauses in sos and nonpositive
% 2.08/2.25 clauses in usable.
% 2.08/2.25
% 2.08/2.25 dependent: set(knuth_bendix).
% 2.08/2.25 dependent: set(anl_eq).
% 2.08/2.25 dependent: set(para_from).
% 2.08/2.25 dependent: set(para_into).
% 2.08/2.25 dependent: clear(para_from_right).
% 2.08/2.25 dependent: clear(para_into_right).
% 2.08/2.25 dependent: set(para_from_vars).
% 2.08/2.25 dependent: set(eq_units_both_ways).
% 2.08/2.25 dependent: set(dynamic_demod_all).
% 2.08/2.25 dependent: set(dynamic_demod).
% 2.08/2.25 dependent: set(order_eq).
% 2.08/2.25 dependent: set(back_demod).
% 2.08/2.25 dependent: set(lrpo).
% 2.08/2.25 dependent: set(hyper_res).
% 2.08/2.25 dependent: set(unit_deletion).
% 2.08/2.25 dependent: set(factor).
% 2.08/2.25
% 2.08/2.25 ------------> process usable:
% 2.08/2.25 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.08/2.25 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 2.08/2.25 ** KEPT (pick-wt=4): 3 [] -ordinal(A)|epsilon_transitive(A).
% 2.08/2.25 ** KEPT (pick-wt=4): 4 [] -ordinal(A)|epsilon_connected(A).
% 2.08/2.25 ** KEPT (pick-wt=8): 5 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.08/2.25 ** KEPT (pick-wt=6): 6 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 2.08/2.25 ** KEPT (pick-wt=4): 7 [] -empty(A)|epsilon_transitive(A).
% 2.08/2.25 ** KEPT (pick-wt=4): 8 [] -empty(A)|epsilon_connected(A).
% 2.08/2.25 ** KEPT (pick-wt=4): 9 [] -empty(A)|ordinal(A).
% 2.08/2.25 ** KEPT (pick-wt=10): 10 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)|ordinal_subset(B,A).
% 2.08/2.25 ** KEPT (pick-wt=8): 11 [] -relation(A)| -connected(A)|is_connected_in(A,relation_field(A)).
% 2.08/2.25 ** KEPT (pick-wt=8): 12 [] -relation(A)|connected(A)| -is_connected_in(A,relation_field(A)).
% 2.08/2.25 ** KEPT (pick-wt=10): 13 [] -relation(A)|A!=inclusion_relation(B)|relation_field(A)=B.
% 2.08/2.25 ** KEPT (pick-wt=20): 14 [] -relation(A)|A!=inclusion_relation(B)| -in(C,B)| -in(D,B)| -in(ordered_pair(C,D),A)|subset(C,D).
% 2.08/2.25 ** KEPT (pick-wt=20): 15 [] -relation(A)|A!=inclusion_relation(B)| -in(C,B)| -in(D,B)|in(ordered_pair(C,D),A)| -subset(C,D).
% 2.08/2.25 ** KEPT (pick-wt=15): 16 [] -relation(A)|A=inclusion_relation(B)|relation_field(A)!=B|in($f2(B,A),B).
% 2.08/2.25 ** KEPT (pick-wt=15): 17 [] -relation(A)|A=inclusion_relation(B)|relation_field(A)!=B|in($f1(B,A),B).
% 2.08/2.25 ** KEPT (pick-wt=26): 18 [] -relation(A)|A=inclusion_relation(B)|relation_field(A)!=B|in(ordered_pair($f2(B,A),$f1(B,A)),A)|subset($f2(B,A),$f1(B,A)).
% 2.08/2.25 ** KEPT (pick-wt=26): 19 [] -relation(A)|A=inclusion_relation(B)|relation_field(A)!=B| -in(ordered_pair($f2(B,A),$f1(B,A)),A)| -subset($f2(B,A),$f1(B,A)).
% 2.08/2.25 ** KEPT (pick-wt=10): 21 [copy,20,flip.2] -relation(A)|set_union2(relation_dom(A),relation_rng(A))=relation_field(A).
% 2.08/2.25 ** KEPT (pick-wt=24): 22 [] -relation(A)| -is_connected_in(A,B)| -in(C,B)| -in(D,B)|C=D|in(ordered_pair(C,D),A)|in(ordered_pair(D,C),A).
% 2.08/2.25 ** KEPT (pick-wt=10): 23 [] -relation(A)|is_connected_in(A,B)|in($f4(A,B),B).
% 2.08/2.25 ** KEPT (pick-wt=10): 24 [] -relation(A)|is_connected_in(A,B)|in($f3(A,B),B).
% 2.08/2.25 ** KEPT (pick-wt=12): 25 [] -relation(A)|is_connected_in(A,B)|$f4(A,B)!=$f3(A,B).
% 2.08/2.25 ** KEPT (pick-wt=14): 26 [] -relation(A)|is_connected_in(A,B)| -in(ordered_pair($f4(A,B),$f3(A,B)),A).
% 2.08/2.25 ** KEPT (pick-wt=14): 27 [] -relation(A)|is_connected_in(A,B)| -in(ordered_pair($f3(A,B),$f4(A,B)),A).
% 2.08/2.25 ** KEPT (pick-wt=4): 28 [] -empty(ordered_pair(A,B)).
% 2.08/2.25 ** KEPT (pick-wt=6): 29 [] empty(A)| -empty(set_union2(A,B)).
% 2.08/2.25 ** KEPT (pick-wt=6): 30 [] empty(A)| -empty(set_union2(B,A)).
% 2.08/2.25 ** KEPT (pick-wt=2): 31 [] -empty($c6).
% 2.08/2.25 ** KEPT (pick-wt=2): 32 [] -empty($c8).
% 2.08/2.25 ** KEPT (pick-wt=10): 33 [] -ordinal(A)| -ordinal(B)| -ordinal_subset(A,B)|subset(A,B).
% 2.08/2.25 ** KEPT (pick-wt=10): 34 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)| -subset(A,B).
% 2.08/2.25 ** KEPT (pick-wt=5): 36 [copy,35,factor_simp] -ordinal(A)|ordinal_subset(A,A).
% 2.08/2.25 ** KEPT (pick-wt=6): 37 [] -in(A,B)|element(A,B).
% 2.08/2.25 ** KEPT (pick-wt=7): 38 [] -ordinal(A)| -in(B,A)|ordinal(B).
% 2.08/2.25 ** KEPT (pick-wt=8): 39 [] -element(A,B)|empty(B)|in(A,B).
% 2.08/2.25 ** KEPT (pick-wt=7): 40 [] -element(A,powerset(B))|subset(A,B).
% 2.08/2.25 ** KEPT (pick-wt=7): 41 [] element(A,powerset(B))| -subset(A,B).
% 2.08/2.25 ** KEPT (pick-wt=10): 42 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.08/2.25 ** KEPT (pick-wt=3): 43 [] -connected(inclusion_relation($c10)).
% 2.08/2.25 ** KEPT (pick-wt=9): 44 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.08/2.25 ** KEPT (pick-wt=5): 45 [] -empty(A)|A=empty_set.
% 2.08/2.25 ** KEPT (pick-wt=5): 46 [] -in(A,B)| -empty(B).
% 2.08/2.25 ** KEPT (pick-wt=7): 47 [] -empty(A)|A=B| -empty(B).
% 2.08/2.25
% 2.08/2.25 ------------> process sos:
% 2.08/2.25 ** KEPT (pick-wt=3): 54 [] A=A.
% 2.08/2.25 ** KEPT (pick-wt=7): 55 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.08/2.25 ** KEPT (pick-wt=7): 56 [] set_union2(A,B)=set_union2(B,A).
% 2.08/2.25 ** KEPT (pick-wt=10): 58 [copy,57,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.08/2.25 ---> New Demodulator: 59 [new_demod,58] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.08/2.25 ** KEPT (pick-wt=3): 60 [] relation(inclusion_relation(A)).
% 2.08/2.25 ** KEPT (pick-wt=4): 61 [] element($f5(A),A).
% 2.08/2.25 ** KEPT (pick-wt=2): 62 [] empty(empty_set).
% 2.08/2.25 ** KEPT (pick-wt=2): 63 [] relation(empty_set).
% 2.08/2.25 ** KEPT (pick-wt=2): 64 [] relation_empty_yielding(empty_set).
% 2.08/2.25 ** KEPT (pick-wt=2): 65 [] function(empty_set).
% 2.08/2.25 ** KEPT (pick-wt=2): 66 [] one_to_one(empty_set).
% 2.08/2.25 Following clause subsumed by 62 during input processing: 0 [] empty(empty_set).
% 282.54/282.70 ** KEPT (pick-wt=2): 67 [] epsilon_transitive(empty_set).
% 282.54/282.70 ** KEPT (pick-wt=2): 68 [] epsilon_connected(empty_set).
% 282.54/282.70 ** KEPT (pick-wt=2): 69 [] ordinal(empty_set).
% 282.54/282.70 ** KEPT (pick-wt=5): 70 [] set_union2(A,A)=A.
% 282.54/282.70 ---> New Demodulator: 71 [new_demod,70] set_union2(A,A)=A.
% 282.54/282.70 ** KEPT (pick-wt=2): 72 [] relation($c1).
% 282.54/282.70 ** KEPT (pick-wt=2): 73 [] function($c1).
% 282.54/282.70 ** KEPT (pick-wt=2): 74 [] epsilon_transitive($c2).
% 282.54/282.70 ** KEPT (pick-wt=2): 75 [] epsilon_connected($c2).
% 282.54/282.70 ** KEPT (pick-wt=2): 76 [] ordinal($c2).
% 282.54/282.70 ** KEPT (pick-wt=2): 77 [] empty($c3).
% 282.54/282.70 ** KEPT (pick-wt=2): 78 [] relation($c4).
% 282.54/282.70 ** KEPT (pick-wt=2): 79 [] empty($c4).
% 282.54/282.70 ** KEPT (pick-wt=2): 80 [] function($c4).
% 282.54/282.70 ** KEPT (pick-wt=2): 81 [] relation($c5).
% 282.54/282.70 ** KEPT (pick-wt=2): 82 [] function($c5).
% 282.54/282.70 ** KEPT (pick-wt=2): 83 [] one_to_one($c5).
% 282.54/282.70 ** KEPT (pick-wt=2): 84 [] empty($c5).
% 282.54/282.70 ** KEPT (pick-wt=2): 85 [] epsilon_transitive($c5).
% 282.54/282.70 ** KEPT (pick-wt=2): 86 [] epsilon_connected($c5).
% 282.54/282.70 ** KEPT (pick-wt=2): 87 [] ordinal($c5).
% 282.54/282.70 ** KEPT (pick-wt=2): 88 [] relation($c7).
% 282.54/282.70 ** KEPT (pick-wt=2): 89 [] function($c7).
% 282.54/282.70 ** KEPT (pick-wt=2): 90 [] one_to_one($c7).
% 282.54/282.70 ** KEPT (pick-wt=2): 91 [] epsilon_transitive($c8).
% 282.54/282.70 ** KEPT (pick-wt=2): 92 [] epsilon_connected($c8).
% 282.54/282.70 ** KEPT (pick-wt=2): 93 [] ordinal($c8).
% 282.54/282.70 ** KEPT (pick-wt=2): 94 [] relation($c9).
% 282.54/282.70 ** KEPT (pick-wt=2): 95 [] relation_empty_yielding($c9).
% 282.54/282.70 ** KEPT (pick-wt=2): 96 [] function($c9).
% 282.54/282.70 ** KEPT (pick-wt=3): 97 [] subset(A,A).
% 282.54/282.70 ** KEPT (pick-wt=5): 98 [] set_union2(A,empty_set)=A.
% 282.54/282.70 ---> New Demodulator: 99 [new_demod,98] set_union2(A,empty_set)=A.
% 282.54/282.70 ** KEPT (pick-wt=2): 100 [] ordinal($c10).
% 282.54/282.70 Following clause subsumed by 54 during input processing: 0 [copy,54,flip.1] A=A.
% 282.54/282.70 54 back subsumes 53.
% 282.54/282.70 54 back subsumes 51.
% 282.54/282.70 Following clause subsumed by 55 during input processing: 0 [copy,55,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 282.54/282.70 Following clause subsumed by 56 during input processing: 0 [copy,56,flip.1] set_union2(A,B)=set_union2(B,A).
% 282.54/282.70 >>>> Starting back demodulation with 59.
% 282.54/282.70 >>>> Starting back demodulation with 71.
% 282.54/282.70 97 back subsumes 52.
% 282.54/282.70 97 back subsumes 49.
% 282.54/282.70 >>>> Starting back demodulation with 99.
% 282.54/282.70
% 282.54/282.70 ======= end of input processing =======
% 282.54/282.70
% 282.54/282.70 =========== start of search ===========
% 282.54/282.70
% 282.54/282.70
% 282.54/282.70 Resetting weight limit to 8.
% 282.54/282.70
% 282.54/282.70
% 282.54/282.70 Resetting weight limit to 8.
% 282.54/282.70
% 282.54/282.70 sos_size=616
% 282.54/282.70
% 282.54/282.70
% 282.54/282.70 Resetting weight limit to 7.
% 282.54/282.70
% 282.54/282.70
% 282.54/282.70 Resetting weight limit to 7.
% 282.54/282.70
% 282.54/282.70 sos_size=639
% 282.54/282.70
% 282.54/282.70 Search stopped because sos empty.
% 282.54/282.70
% 282.54/282.70
% 282.54/282.70 Search stopped because sos empty.
% 282.54/282.70
% 282.54/282.70 ============ end of search ============
% 282.54/282.70
% 282.54/282.70 -------------- statistics -------------
% 282.54/282.70 clauses given 908
% 282.54/282.70 clauses generated 1418506
% 282.54/282.70 clauses kept 1067
% 282.54/282.70 clauses forward subsumed 2034
% 282.54/282.70 clauses back subsumed 22
% 282.54/282.70 Kbytes malloced 6835
% 282.54/282.70
% 282.54/282.70 ----------- times (seconds) -----------
% 282.54/282.70 user CPU time 280.44 (0 hr, 4 min, 40 sec)
% 282.54/282.70 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 282.54/282.70 wall-clock time 282 (0 hr, 4 min, 42 sec)
% 282.54/282.70
% 282.54/282.70 Process 23060 finished Wed Jul 27 08:03:47 2022
% 282.54/282.70 Otter interrupted
% 282.54/282.70 PROOF NOT FOUND
%------------------------------------------------------------------------------