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