TSTP Solution File: SEU231+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU231+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n008.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:16 EDT 2022
% Result : Timeout 299.89s 300.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU231+3 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n008.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:55:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.95/2.15 ----- Otter 3.3f, August 2004 -----
% 1.95/2.15 The process was started by sandbox on n008.cluster.edu,
% 1.95/2.15 Wed Jul 27 07:55:08 2022
% 1.95/2.15 The command was "./otter". The process ID is 29792.
% 1.95/2.15
% 1.95/2.15 set(prolog_style_variables).
% 1.95/2.15 set(auto).
% 1.95/2.15 dependent: set(auto1).
% 1.95/2.15 dependent: set(process_input).
% 1.95/2.15 dependent: clear(print_kept).
% 1.95/2.15 dependent: clear(print_new_demod).
% 1.95/2.15 dependent: clear(print_back_demod).
% 1.95/2.15 dependent: clear(print_back_sub).
% 1.95/2.15 dependent: set(control_memory).
% 1.95/2.15 dependent: assign(max_mem, 12000).
% 1.95/2.15 dependent: assign(pick_given_ratio, 4).
% 1.95/2.15 dependent: assign(stats_level, 1).
% 1.95/2.15 dependent: assign(max_seconds, 10800).
% 1.95/2.15 clear(print_given).
% 1.95/2.15
% 1.95/2.15 formula_list(usable).
% 1.95/2.15 all A (A=A).
% 1.95/2.15 all A B (in(A,B)-> -in(B,A)).
% 1.95/2.15 all A B (proper_subset(A,B)-> -proper_subset(B,A)).
% 1.95/2.15 all A (empty(A)->function(A)).
% 1.95/2.15 all A (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)).
% 1.95/2.15 all A (empty(A)->relation(A)).
% 1.95/2.15 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.95/2.15 all A (epsilon_transitive(A)&epsilon_connected(A)->ordinal(A)).
% 1.95/2.15 all A B (A=B<->subset(A,B)&subset(B,A)).
% 1.95/2.15 all A (epsilon_transitive(A)<-> (all B (in(B,A)->subset(B,A)))).
% 1.95/2.15 all A (epsilon_connected(A)<-> (all B C (-(in(B,A)&in(C,A)& -in(B,C)&B!=C& -in(C,B))))).
% 1.95/2.15 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.95/2.15 all A B C (C=set_difference(A,B)<-> (all D (in(D,C)<->in(D,A)& -in(D,B)))).
% 1.95/2.15 all A B (proper_subset(A,B)<->subset(A,B)&A!=B).
% 1.95/2.15 all A exists B element(B,A).
% 1.95/2.15 empty(empty_set).
% 1.95/2.15 relation(empty_set).
% 1.95/2.15 relation_empty_yielding(empty_set).
% 1.95/2.15 empty(empty_set).
% 1.95/2.15 all A B (relation(A)&relation(B)->relation(set_difference(A,B))).
% 1.95/2.15 empty(empty_set).
% 1.95/2.15 relation(empty_set).
% 1.95/2.15 all A B (-proper_subset(A,A)).
% 1.95/2.15 exists A (relation(A)&function(A)).
% 1.95/2.15 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 1.95/2.15 exists A (empty(A)&relation(A)).
% 1.95/2.15 exists A empty(A).
% 1.95/2.15 exists A (relation(A)&empty(A)&function(A)).
% 1.95/2.15 exists A (-empty(A)&relation(A)).
% 1.95/2.15 exists A (-empty(A)).
% 1.95/2.15 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.95/2.15 exists A (relation(A)&relation_empty_yielding(A)).
% 1.95/2.15 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 1.95/2.15 exists A (relation(A)&relation_non_empty(A)&function(A)).
% 1.95/2.15 all A B subset(A,A).
% 1.95/2.15 all A B (in(A,B)->element(A,B)).
% 1.95/2.15 -(all A (epsilon_transitive(A)-> (all B (ordinal(B)-> (proper_subset(A,B)->in(A,B)))))).
% 1.95/2.15 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.95/2.15 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 1.95/2.15 all A (set_difference(A,empty_set)=A).
% 1.95/2.15 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.95/2.15 all A (set_difference(empty_set,A)=empty_set).
% 1.95/2.15 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.95/2.15 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.95/2.15 all A B (-(subset(A,B)&proper_subset(B,A))).
% 1.95/2.15 all A (empty(A)->A=empty_set).
% 1.95/2.15 all A B (-(in(A,B)&empty(B))).
% 1.95/2.15 all A B (-(in(A,B)& (all C (-(in(C,B)& (all D (-(in(D,B)&in(D,C))))))))).
% 1.95/2.15 all A B (-(empty(A)&A!=B&empty(B))).
% 1.95/2.15 end_of_list.
% 1.95/2.15
% 1.95/2.15 -------> usable clausifies to:
% 1.95/2.15
% 1.95/2.15 list(usable).
% 1.95/2.15 0 [] A=A.
% 1.95/2.15 0 [] -in(A,B)| -in(B,A).
% 1.95/2.15 0 [] -proper_subset(A,B)| -proper_subset(B,A).
% 1.95/2.15 0 [] -empty(A)|function(A).
% 1.95/2.15 0 [] -ordinal(A)|epsilon_transitive(A).
% 1.95/2.15 0 [] -ordinal(A)|epsilon_connected(A).
% 1.95/2.15 0 [] -empty(A)|relation(A).
% 1.95/2.15 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.95/2.15 0 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 1.95/2.15 0 [] A!=B|subset(A,B).
% 1.95/2.15 0 [] A!=B|subset(B,A).
% 1.95/2.15 0 [] A=B| -subset(A,B)| -subset(B,A).
% 1.95/2.15 0 [] -epsilon_transitive(A)| -in(B,A)|subset(B,A).
% 1.95/2.15 0 [] epsilon_transitive(A)|in($f1(A),A).
% 1.95/2.15 0 [] epsilon_transitive(A)| -subset($f1(A),A).
% 1.95/2.15 0 [] -epsilon_connected(A)| -in(B,A)| -in(C,A)|in(B,C)|B=C|in(C,B).
% 1.95/2.15 0 [] epsilon_connected(A)|in($f3(A),A).
% 1.95/2.15 0 [] epsilon_connected(A)|in($f2(A),A).
% 1.95/2.15 0 [] epsilon_connected(A)| -in($f3(A),$f2(A)).
% 1.95/2.15 0 [] epsilon_connected(A)|$f3(A)!=$f2(A).
% 1.95/2.15 0 [] epsilon_connected(A)| -in($f2(A),$f3(A)).
% 1.95/2.15 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.95/2.15 0 [] subset(A,B)|in($f4(A,B),A).
% 1.95/2.15 0 [] subset(A,B)| -in($f4(A,B),B).
% 1.95/2.15 0 [] C!=set_difference(A,B)| -in(D,C)|in(D,A).
% 1.95/2.15 0 [] C!=set_difference(A,B)| -in(D,C)| -in(D,B).
% 1.95/2.15 0 [] C!=set_difference(A,B)|in(D,C)| -in(D,A)|in(D,B).
% 1.95/2.15 0 [] C=set_difference(A,B)|in($f5(A,B,C),C)|in($f5(A,B,C),A).
% 1.95/2.15 0 [] C=set_difference(A,B)|in($f5(A,B,C),C)| -in($f5(A,B,C),B).
% 1.95/2.15 0 [] C=set_difference(A,B)| -in($f5(A,B,C),C)| -in($f5(A,B,C),A)|in($f5(A,B,C),B).
% 1.95/2.15 0 [] -proper_subset(A,B)|subset(A,B).
% 1.95/2.15 0 [] -proper_subset(A,B)|A!=B.
% 1.95/2.15 0 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 1.95/2.15 0 [] element($f6(A),A).
% 1.95/2.15 0 [] empty(empty_set).
% 1.95/2.15 0 [] relation(empty_set).
% 1.95/2.15 0 [] relation_empty_yielding(empty_set).
% 1.95/2.15 0 [] empty(empty_set).
% 1.95/2.15 0 [] -relation(A)| -relation(B)|relation(set_difference(A,B)).
% 1.95/2.15 0 [] empty(empty_set).
% 1.95/2.15 0 [] relation(empty_set).
% 1.95/2.15 0 [] -proper_subset(A,A).
% 1.95/2.15 0 [] relation($c1).
% 1.95/2.15 0 [] function($c1).
% 1.95/2.15 0 [] epsilon_transitive($c2).
% 1.95/2.15 0 [] epsilon_connected($c2).
% 1.95/2.15 0 [] ordinal($c2).
% 1.95/2.15 0 [] empty($c3).
% 1.95/2.15 0 [] relation($c3).
% 1.95/2.15 0 [] empty($c4).
% 1.95/2.15 0 [] relation($c5).
% 1.95/2.15 0 [] empty($c5).
% 1.95/2.15 0 [] function($c5).
% 1.95/2.15 0 [] -empty($c6).
% 1.95/2.15 0 [] relation($c6).
% 1.95/2.15 0 [] -empty($c7).
% 1.95/2.15 0 [] relation($c8).
% 1.95/2.15 0 [] function($c8).
% 1.95/2.15 0 [] one_to_one($c8).
% 1.95/2.15 0 [] relation($c9).
% 1.95/2.15 0 [] relation_empty_yielding($c9).
% 1.95/2.15 0 [] relation($c10).
% 1.95/2.15 0 [] relation_empty_yielding($c10).
% 1.95/2.15 0 [] function($c10).
% 1.95/2.15 0 [] relation($c11).
% 1.95/2.15 0 [] relation_non_empty($c11).
% 1.95/2.15 0 [] function($c11).
% 1.95/2.15 0 [] subset(A,A).
% 1.95/2.15 0 [] -in(A,B)|element(A,B).
% 1.95/2.15 0 [] epsilon_transitive($c13).
% 1.95/2.15 0 [] ordinal($c12).
% 1.95/2.15 0 [] proper_subset($c13,$c12).
% 1.95/2.15 0 [] -in($c13,$c12).
% 1.95/2.15 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.95/2.15 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.95/2.15 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.95/2.15 0 [] set_difference(A,empty_set)=A.
% 1.95/2.15 0 [] -element(A,powerset(B))|subset(A,B).
% 1.95/2.15 0 [] element(A,powerset(B))| -subset(A,B).
% 1.95/2.15 0 [] set_difference(empty_set,A)=empty_set.
% 1.95/2.15 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.95/2.15 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.95/2.15 0 [] -subset(A,B)| -proper_subset(B,A).
% 1.95/2.15 0 [] -empty(A)|A=empty_set.
% 1.95/2.15 0 [] -in(A,B)| -empty(B).
% 1.95/2.15 0 [] -in(A,B)|in($f7(A,B),B).
% 1.95/2.15 0 [] -in(A,B)| -in(D,B)| -in(D,$f7(A,B)).
% 1.95/2.15 0 [] -empty(A)|A=B| -empty(B).
% 1.95/2.15 end_of_list.
% 1.95/2.15
% 1.95/2.15 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.95/2.15
% 1.95/2.15 This ia a non-Horn set with equality. The strategy will be
% 1.95/2.15 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.95/2.15 deletion, with positive clauses in sos and nonpositive
% 1.95/2.15 clauses in usable.
% 1.95/2.15
% 1.95/2.15 dependent: set(knuth_bendix).
% 1.95/2.15 dependent: set(anl_eq).
% 1.95/2.15 dependent: set(para_from).
% 1.95/2.15 dependent: set(para_into).
% 1.95/2.15 dependent: clear(para_from_right).
% 1.95/2.15 dependent: clear(para_into_right).
% 1.95/2.15 dependent: set(para_from_vars).
% 1.95/2.15 dependent: set(eq_units_both_ways).
% 1.95/2.15 dependent: set(dynamic_demod_all).
% 1.95/2.15 dependent: set(dynamic_demod).
% 1.95/2.15 dependent: set(order_eq).
% 1.95/2.15 dependent: set(back_demod).
% 1.95/2.15 dependent: set(lrpo).
% 1.95/2.15 dependent: set(hyper_res).
% 1.95/2.15 dependent: set(unit_deletion).
% 1.95/2.15 dependent: set(factor).
% 1.95/2.15
% 1.95/2.15 ------------> process usable:
% 1.95/2.15 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.95/2.15 ** KEPT (pick-wt=6): 2 [] -proper_subset(A,B)| -proper_subset(B,A).
% 1.95/2.15 ** KEPT (pick-wt=4): 3 [] -empty(A)|function(A).
% 1.95/2.15 ** KEPT (pick-wt=4): 4 [] -ordinal(A)|epsilon_transitive(A).
% 1.95/2.15 ** KEPT (pick-wt=4): 5 [] -ordinal(A)|epsilon_connected(A).
% 1.95/2.15 ** KEPT (pick-wt=4): 6 [] -empty(A)|relation(A).
% 1.95/2.15 ** KEPT (pick-wt=8): 7 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.95/2.15 ** KEPT (pick-wt=6): 8 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 1.95/2.15 ** KEPT (pick-wt=6): 9 [] A!=B|subset(A,B).
% 1.95/2.15 ** KEPT (pick-wt=6): 10 [] A!=B|subset(B,A).
% 1.95/2.15 ** KEPT (pick-wt=9): 11 [] A=B| -subset(A,B)| -subset(B,A).
% 1.95/2.15 ** KEPT (pick-wt=8): 12 [] -epsilon_transitive(A)| -in(B,A)|subset(B,A).
% 1.95/2.15 ** KEPT (pick-wt=6): 13 [] epsilon_transitive(A)| -subset($f1(A),A).
% 1.95/2.15 ** KEPT (pick-wt=17): 14 [] -epsilon_connected(A)| -in(B,A)| -in(C,A)|in(B,C)|B=C|in(C,B).
% 1.95/2.15 ** KEPT (pick-wt=7): 15 [] epsilon_connected(A)| -in($f3(A),$f2(A)).
% 1.95/2.15 ** KEPT (pick-wt=7): 16 [] epsilon_connected(A)|$f3(A)!=$f2(A).
% 1.95/2.15 ** KEPT (pick-wt=7): 17 [] epsilon_connected(A)| -in($f2(A),$f3(A)).
% 1.95/2.15 ** KEPT (pick-wt=9): 18 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.95/2.15 ** KEPT (pick-wt=8): 19 [] subset(A,B)| -in($f4(A,B),B).
% 1.95/2.15 ** KEPT (pick-wt=11): 20 [] A!=set_difference(B,C)| -in(D,A)|in(D,B).
% 1.95/2.15 ** KEPT (pick-wt=11): 21 [] A!=set_difference(B,C)| -in(D,A)| -in(D,C).
% 1.95/2.15 ** KEPT (pick-wt=14): 22 [] A!=set_difference(B,C)|in(D,A)| -in(D,B)|in(D,C).
% 1.95/2.15 ** KEPT (pick-wt=17): 23 [] A=set_difference(B,C)|in($f5(B,C,A),A)| -in($f5(B,C,A),C).
% 2.45/2.64 ** KEPT (pick-wt=23): 24 [] A=set_difference(B,C)| -in($f5(B,C,A),A)| -in($f5(B,C,A),B)|in($f5(B,C,A),C).
% 2.45/2.64 ** KEPT (pick-wt=6): 25 [] -proper_subset(A,B)|subset(A,B).
% 2.45/2.64 ** KEPT (pick-wt=6): 26 [] -proper_subset(A,B)|A!=B.
% 2.45/2.64 ** KEPT (pick-wt=9): 27 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 2.45/2.64 ** KEPT (pick-wt=8): 28 [] -relation(A)| -relation(B)|relation(set_difference(A,B)).
% 2.45/2.64 ** KEPT (pick-wt=3): 29 [] -proper_subset(A,A).
% 2.45/2.64 ** KEPT (pick-wt=2): 30 [] -empty($c6).
% 2.45/2.64 ** KEPT (pick-wt=2): 31 [] -empty($c7).
% 2.45/2.64 ** KEPT (pick-wt=6): 32 [] -in(A,B)|element(A,B).
% 2.45/2.64 ** KEPT (pick-wt=3): 33 [] -in($c13,$c12).
% 2.45/2.64 ** KEPT (pick-wt=8): 34 [] -element(A,B)|empty(B)|in(A,B).
% 2.45/2.64 ** KEPT (pick-wt=8): 35 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.45/2.64 ** KEPT (pick-wt=8): 36 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.45/2.64 ** KEPT (pick-wt=7): 37 [] -element(A,powerset(B))|subset(A,B).
% 2.45/2.64 ** KEPT (pick-wt=7): 38 [] element(A,powerset(B))| -subset(A,B).
% 2.45/2.64 ** KEPT (pick-wt=10): 39 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.45/2.64 ** KEPT (pick-wt=9): 40 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.45/2.64 ** KEPT (pick-wt=6): 41 [] -subset(A,B)| -proper_subset(B,A).
% 2.45/2.64 ** KEPT (pick-wt=5): 42 [] -empty(A)|A=empty_set.
% 2.45/2.64 ** KEPT (pick-wt=5): 43 [] -in(A,B)| -empty(B).
% 2.45/2.64 ** KEPT (pick-wt=8): 44 [] -in(A,B)|in($f7(A,B),B).
% 2.45/2.64 ** KEPT (pick-wt=11): 45 [] -in(A,B)| -in(C,B)| -in(C,$f7(A,B)).
% 2.45/2.64 ** KEPT (pick-wt=7): 46 [] -empty(A)|A=B| -empty(B).
% 2.45/2.64
% 2.45/2.64 ------------> process sos:
% 2.45/2.64 ** KEPT (pick-wt=3): 56 [] A=A.
% 2.45/2.64 ** KEPT (pick-wt=6): 57 [] epsilon_transitive(A)|in($f1(A),A).
% 2.45/2.64 ** KEPT (pick-wt=6): 58 [] epsilon_connected(A)|in($f3(A),A).
% 2.45/2.64 ** KEPT (pick-wt=6): 59 [] epsilon_connected(A)|in($f2(A),A).
% 2.45/2.64 ** KEPT (pick-wt=8): 60 [] subset(A,B)|in($f4(A,B),A).
% 2.45/2.64 ** KEPT (pick-wt=17): 61 [] A=set_difference(B,C)|in($f5(B,C,A),A)|in($f5(B,C,A),B).
% 2.45/2.64 ** KEPT (pick-wt=4): 62 [] element($f6(A),A).
% 2.45/2.64 ** KEPT (pick-wt=2): 63 [] empty(empty_set).
% 2.45/2.64 ** KEPT (pick-wt=2): 64 [] relation(empty_set).
% 2.45/2.64 ** KEPT (pick-wt=2): 65 [] relation_empty_yielding(empty_set).
% 2.45/2.64 Following clause subsumed by 63 during input processing: 0 [] empty(empty_set).
% 2.45/2.64 Following clause subsumed by 63 during input processing: 0 [] empty(empty_set).
% 2.45/2.64 Following clause subsumed by 64 during input processing: 0 [] relation(empty_set).
% 2.45/2.64 ** KEPT (pick-wt=2): 66 [] relation($c1).
% 2.45/2.64 ** KEPT (pick-wt=2): 67 [] function($c1).
% 2.45/2.64 ** KEPT (pick-wt=2): 68 [] epsilon_transitive($c2).
% 2.45/2.64 ** KEPT (pick-wt=2): 69 [] epsilon_connected($c2).
% 2.45/2.64 ** KEPT (pick-wt=2): 70 [] ordinal($c2).
% 2.45/2.64 ** KEPT (pick-wt=2): 71 [] empty($c3).
% 2.45/2.64 ** KEPT (pick-wt=2): 72 [] relation($c3).
% 2.45/2.64 ** KEPT (pick-wt=2): 73 [] empty($c4).
% 2.45/2.64 ** KEPT (pick-wt=2): 74 [] relation($c5).
% 2.45/2.64 ** KEPT (pick-wt=2): 75 [] empty($c5).
% 2.45/2.64 ** KEPT (pick-wt=2): 76 [] function($c5).
% 2.45/2.64 ** KEPT (pick-wt=2): 77 [] relation($c6).
% 2.45/2.64 ** KEPT (pick-wt=2): 78 [] relation($c8).
% 2.45/2.64 ** KEPT (pick-wt=2): 79 [] function($c8).
% 2.45/2.64 ** KEPT (pick-wt=2): 80 [] one_to_one($c8).
% 2.45/2.64 ** KEPT (pick-wt=2): 81 [] relation($c9).
% 2.45/2.64 ** KEPT (pick-wt=2): 82 [] relation_empty_yielding($c9).
% 2.45/2.64 ** KEPT (pick-wt=2): 83 [] relation($c10).
% 2.45/2.64 ** KEPT (pick-wt=2): 84 [] relation_empty_yielding($c10).
% 2.45/2.64 ** KEPT (pick-wt=2): 85 [] function($c10).
% 2.45/2.64 ** KEPT (pick-wt=2): 86 [] relation($c11).
% 2.45/2.64 ** KEPT (pick-wt=2): 87 [] relation_non_empty($c11).
% 2.45/2.64 ** KEPT (pick-wt=2): 88 [] function($c11).
% 2.45/2.64 ** KEPT (pick-wt=3): 89 [] subset(A,A).
% 2.45/2.64 ** KEPT (pick-wt=2): 90 [] epsilon_transitive($c13).
% 2.45/2.64 ** KEPT (pick-wt=2): 91 [] ordinal($c12).
% 2.45/2.64 ** KEPT (pick-wt=3): 92 [] proper_subset($c13,$c12).
% 2.45/2.64 ** KEPT (pick-wt=5): 93 [] set_difference(A,empty_set)=A.
% 2.45/2.64 ---> New Demodulator: 94 [new_demod,93] set_difference(A,empty_set)=A.
% 2.45/2.64 ** KEPT (pick-wt=5): 95 [] set_difference(empty_set,A)=empty_set.
% 2.45/2.64 ---> New Demodulator: 96 [new_demod,95] set_difference(empty_set,A)=empty_set.
% 2.45/2.64 Following clause subsumed by 56 during input processing: 0 [copy,56,flip.1] A=A.
% 2.45/2.64 56 back subsumes 55.
% 2.45/2.64 56 back subsumes 49.
% 2.45/2.64 56 back subsumes 48.
% 2.45/2.64 >>>> Starting back demodulation with 94.
% 2.45/2.64 >>>> Starting back demodulation with 96.
% 2.45/2.64
% 2.45/2.64 ======= end of input processing =======
% 2.45/2.64
% 2.45/2.64 =========== start of search ===========
% 2.45/2.64
% 2.45/2.64
% 2.45/2.64 Resetting weight limit to 6.
% 2.45/2.64
% 2.45/2.64
% 2.45/2.64 ReseAlarm clock
% 299.89/300.03 Otter interrupted
% 299.89/300.03 PROOF NOT FOUND
%------------------------------------------------------------------------------