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