TSTP Solution File: SEU235+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU235+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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:17 EDT 2022
% Result : Unknown 256.37s 256.53s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU235+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n007.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 07:21:01 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.95/2.13 ----- Otter 3.3f, August 2004 -----
% 1.95/2.13 The process was started by sandbox2 on n007.cluster.edu,
% 1.95/2.13 Wed Jul 27 07:21:01 2022
% 1.95/2.13 The command was "./otter". The process ID is 3304.
% 1.95/2.13
% 1.95/2.13 set(prolog_style_variables).
% 1.95/2.13 set(auto).
% 1.95/2.13 dependent: set(auto1).
% 1.95/2.13 dependent: set(process_input).
% 1.95/2.13 dependent: clear(print_kept).
% 1.95/2.13 dependent: clear(print_new_demod).
% 1.95/2.13 dependent: clear(print_back_demod).
% 1.95/2.13 dependent: clear(print_back_sub).
% 1.95/2.13 dependent: set(control_memory).
% 1.95/2.13 dependent: assign(max_mem, 12000).
% 1.95/2.13 dependent: assign(pick_given_ratio, 4).
% 1.95/2.13 dependent: assign(stats_level, 1).
% 1.95/2.13 dependent: assign(max_seconds, 10800).
% 1.95/2.13 clear(print_given).
% 1.95/2.13
% 1.95/2.13 formula_list(usable).
% 1.95/2.13 all A (A=A).
% 1.95/2.13 all A B (in(A,B)-> -in(B,A)).
% 1.95/2.13 all A (empty(A)->function(A)).
% 1.95/2.13 all A (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)).
% 1.95/2.13 all A (empty(A)->relation(A)).
% 1.95/2.13 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.95/2.13 all A (epsilon_transitive(A)&epsilon_connected(A)->ordinal(A)).
% 1.95/2.13 all A (empty(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 1.95/2.13 all A B (ordinal(A)&ordinal(B)->ordinal_subset(A,B)|ordinal_subset(B,A)).
% 1.95/2.13 all A (epsilon_transitive(A)<-> (all B (in(B,A)->subset(B,A)))).
% 1.95/2.13 $T.
% 1.95/2.13 $T.
% 1.95/2.13 $T.
% 1.95/2.13 all A exists B element(B,A).
% 1.95/2.13 empty(empty_set).
% 1.95/2.13 relation(empty_set).
% 1.95/2.13 relation_empty_yielding(empty_set).
% 1.95/2.13 empty(empty_set).
% 1.95/2.13 relation(empty_set).
% 1.95/2.13 relation_empty_yielding(empty_set).
% 1.95/2.13 function(empty_set).
% 1.95/2.13 one_to_one(empty_set).
% 1.95/2.13 empty(empty_set).
% 1.95/2.13 epsilon_transitive(empty_set).
% 1.95/2.13 epsilon_connected(empty_set).
% 1.95/2.13 ordinal(empty_set).
% 1.95/2.13 empty(empty_set).
% 1.95/2.13 relation(empty_set).
% 1.95/2.13 exists A (relation(A)&function(A)).
% 1.95/2.13 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 1.95/2.13 exists A (empty(A)&relation(A)).
% 1.95/2.13 exists A empty(A).
% 1.95/2.13 exists A (relation(A)&empty(A)&function(A)).
% 1.95/2.13 exists A (relation(A)&function(A)&one_to_one(A)&empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 1.95/2.13 exists A (-empty(A)&relation(A)).
% 1.95/2.13 exists A (-empty(A)).
% 1.95/2.13 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.95/2.13 exists A (-empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 1.95/2.13 exists A (relation(A)&relation_empty_yielding(A)).
% 1.95/2.13 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 1.95/2.13 all A B (ordinal(A)&ordinal(B)-> (ordinal_subset(A,B)<->subset(A,B))).
% 1.95/2.13 all A B (ordinal(A)&ordinal(B)->ordinal_subset(A,A)).
% 1.95/2.13 all A B subset(A,A).
% 1.95/2.13 all A B (in(A,B)->element(A,B)).
% 1.95/2.13 all A B (ordinal(B)-> (in(A,B)->ordinal(A))).
% 1.95/2.13 all A (ordinal(A)-> (all B (ordinal(B)-> -(-in(A,B)&A!=B& -in(B,A))))).
% 1.95/2.13 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.95/2.13 -(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)))))))))).
% 1.95/2.13 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.95/2.13 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.95/2.13 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.95/2.13 all A (empty(A)->A=empty_set).
% 1.95/2.13 all A B (-(in(A,B)&empty(B))).
% 1.95/2.13 all A B (-(in(A,B)& (all C (-(in(C,B)& (all D (-(in(D,B)&in(D,C))))))))).
% 1.95/2.13 all A B (-(empty(A)&A!=B&empty(B))).
% 1.95/2.13 end_of_list.
% 1.95/2.13
% 1.95/2.13 -------> usable clausifies to:
% 1.95/2.13
% 1.95/2.13 list(usable).
% 1.95/2.13 0 [] A=A.
% 1.95/2.13 0 [] -in(A,B)| -in(B,A).
% 1.95/2.13 0 [] -empty(A)|function(A).
% 1.95/2.13 0 [] -ordinal(A)|epsilon_transitive(A).
% 1.95/2.13 0 [] -ordinal(A)|epsilon_connected(A).
% 1.95/2.13 0 [] -empty(A)|relation(A).
% 1.95/2.13 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.95/2.13 0 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 1.95/2.13 0 [] -empty(A)|epsilon_transitive(A).
% 1.95/2.13 0 [] -empty(A)|epsilon_connected(A).
% 1.95/2.13 0 [] -empty(A)|ordinal(A).
% 1.95/2.13 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)|ordinal_subset(B,A).
% 1.95/2.13 0 [] -epsilon_transitive(A)| -in(B,A)|subset(B,A).
% 1.95/2.13 0 [] epsilon_transitive(A)|in($f1(A),A).
% 1.95/2.13 0 [] epsilon_transitive(A)| -subset($f1(A),A).
% 1.95/2.13 0 [] $T.
% 1.95/2.13 0 [] $T.
% 1.95/2.13 0 [] $T.
% 1.95/2.13 0 [] element($f2(A),A).
% 1.95/2.13 0 [] empty(empty_set).
% 1.95/2.13 0 [] relation(empty_set).
% 1.95/2.13 0 [] relation_empty_yielding(empty_set).
% 1.95/2.13 0 [] empty(empty_set).
% 1.95/2.13 0 [] relation(empty_set).
% 1.95/2.13 0 [] relation_empty_yielding(empty_set).
% 1.95/2.13 0 [] function(empty_set).
% 1.95/2.13 0 [] one_to_one(empty_set).
% 1.95/2.13 0 [] empty(empty_set).
% 1.95/2.13 0 [] epsilon_transitive(empty_set).
% 1.95/2.13 0 [] epsilon_connected(empty_set).
% 1.95/2.13 0 [] ordinal(empty_set).
% 1.95/2.13 0 [] empty(empty_set).
% 1.95/2.13 0 [] relation(empty_set).
% 1.95/2.13 0 [] relation($c1).
% 1.95/2.13 0 [] function($c1).
% 1.95/2.13 0 [] epsilon_transitive($c2).
% 1.95/2.13 0 [] epsilon_connected($c2).
% 1.95/2.13 0 [] ordinal($c2).
% 1.95/2.13 0 [] empty($c3).
% 1.95/2.13 0 [] relation($c3).
% 1.95/2.13 0 [] empty($c4).
% 1.95/2.13 0 [] relation($c5).
% 1.95/2.13 0 [] empty($c5).
% 1.95/2.13 0 [] function($c5).
% 1.95/2.13 0 [] relation($c6).
% 1.95/2.13 0 [] function($c6).
% 1.95/2.13 0 [] one_to_one($c6).
% 1.95/2.13 0 [] empty($c6).
% 1.95/2.13 0 [] epsilon_transitive($c6).
% 1.95/2.13 0 [] epsilon_connected($c6).
% 1.95/2.13 0 [] ordinal($c6).
% 1.95/2.13 0 [] -empty($c7).
% 1.95/2.13 0 [] relation($c7).
% 1.95/2.13 0 [] -empty($c8).
% 1.95/2.13 0 [] relation($c9).
% 1.95/2.13 0 [] function($c9).
% 1.95/2.13 0 [] one_to_one($c9).
% 1.95/2.13 0 [] -empty($c10).
% 1.95/2.13 0 [] epsilon_transitive($c10).
% 1.95/2.13 0 [] epsilon_connected($c10).
% 1.95/2.13 0 [] ordinal($c10).
% 1.95/2.13 0 [] relation($c11).
% 1.95/2.13 0 [] relation_empty_yielding($c11).
% 1.95/2.13 0 [] relation($c12).
% 1.95/2.13 0 [] relation_empty_yielding($c12).
% 1.95/2.13 0 [] function($c12).
% 1.95/2.13 0 [] -ordinal(A)| -ordinal(B)| -ordinal_subset(A,B)|subset(A,B).
% 1.95/2.13 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)| -subset(A,B).
% 1.95/2.13 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,A).
% 1.95/2.13 0 [] subset(A,A).
% 1.95/2.13 0 [] -in(A,B)|element(A,B).
% 1.95/2.13 0 [] -ordinal(B)| -in(A,B)|ordinal(A).
% 1.95/2.13 0 [] -ordinal(A)| -ordinal(B)|in(A,B)|A=B|in(B,A).
% 1.95/2.13 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.95/2.13 0 [] ordinal($c13).
% 1.95/2.13 0 [] subset($c14,$c13).
% 1.95/2.13 0 [] $c14!=empty_set.
% 1.95/2.13 0 [] -ordinal(C)| -in(C,$c14)|ordinal($f3(C)).
% 1.95/2.13 0 [] -ordinal(C)| -in(C,$c14)|in($f3(C),$c14).
% 1.95/2.13 0 [] -ordinal(C)| -in(C,$c14)| -ordinal_subset(C,$f3(C)).
% 1.95/2.13 0 [] -element(A,powerset(B))|subset(A,B).
% 1.95/2.13 0 [] element(A,powerset(B))| -subset(A,B).
% 1.95/2.13 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.95/2.13 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.95/2.13 0 [] -empty(A)|A=empty_set.
% 1.95/2.13 0 [] -in(A,B)| -empty(B).
% 1.95/2.13 0 [] -in(A,B)|in($f4(A,B),B).
% 1.95/2.13 0 [] -in(A,B)| -in(D,B)| -in(D,$f4(A,B)).
% 1.95/2.13 0 [] -empty(A)|A=B| -empty(B).
% 1.95/2.13 end_of_list.
% 1.95/2.13
% 1.95/2.13 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.95/2.13
% 1.95/2.13 This ia a non-Horn set with equality. The strategy will be
% 1.95/2.13 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.95/2.13 deletion, with positive clauses in sos and nonpositive
% 1.95/2.13 clauses in usable.
% 1.95/2.13
% 1.95/2.13 dependent: set(knuth_bendix).
% 1.95/2.13 dependent: set(anl_eq).
% 1.95/2.13 dependent: set(para_from).
% 1.95/2.13 dependent: set(para_into).
% 1.95/2.13 dependent: clear(para_from_right).
% 1.95/2.13 dependent: clear(para_into_right).
% 1.95/2.13 dependent: set(para_from_vars).
% 1.95/2.13 dependent: set(eq_units_both_ways).
% 1.95/2.13 dependent: set(dynamic_demod_all).
% 1.95/2.13 dependent: set(dynamic_demod).
% 1.95/2.13 dependent: set(order_eq).
% 1.95/2.13 dependent: set(back_demod).
% 1.95/2.13 dependent: set(lrpo).
% 1.95/2.13 dependent: set(hyper_res).
% 1.95/2.13 dependent: set(unit_deletion).
% 1.95/2.13 dependent: set(factor).
% 1.95/2.13
% 1.95/2.13 ------------> process usable:
% 1.95/2.13 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.95/2.13 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.95/2.13 ** KEPT (pick-wt=4): 3 [] -ordinal(A)|epsilon_transitive(A).
% 1.95/2.13 ** KEPT (pick-wt=4): 4 [] -ordinal(A)|epsilon_connected(A).
% 1.95/2.13 ** KEPT (pick-wt=4): 5 [] -empty(A)|relation(A).
% 1.95/2.13 ** KEPT (pick-wt=8): 6 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.95/2.13 ** KEPT (pick-wt=6): 7 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 1.95/2.13 ** KEPT (pick-wt=4): 8 [] -empty(A)|epsilon_transitive(A).
% 1.95/2.13 ** KEPT (pick-wt=4): 9 [] -empty(A)|epsilon_connected(A).
% 1.95/2.13 ** KEPT (pick-wt=4): 10 [] -empty(A)|ordinal(A).
% 1.95/2.13 ** KEPT (pick-wt=10): 11 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)|ordinal_subset(B,A).
% 1.95/2.13 ** KEPT (pick-wt=8): 12 [] -epsilon_transitive(A)| -in(B,A)|subset(B,A).
% 1.95/2.13 ** KEPT (pick-wt=6): 13 [] epsilon_transitive(A)| -subset($f1(A),A).
% 1.95/2.13 ** KEPT (pick-wt=2): 14 [] -empty($c7).
% 1.95/2.13 ** KEPT (pick-wt=2): 15 [] -empty($c8).
% 1.95/2.13 ** KEPT (pick-wt=2): 16 [] -empty($c10).
% 1.95/2.13 ** KEPT (pick-wt=10): 17 [] -ordinal(A)| -ordinal(B)| -ordinal_subset(A,B)|subset(A,B).
% 1.95/2.13 ** KEPT (pick-wt=10): 18 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)| -subset(A,B).
% 1.95/2.13 ** KEPT (pick-wt=5): 20 [copy,19,factor_simp] -ordinal(A)|ordinal_subset(A,A).
% 1.95/2.13 ** KEPT (pick-wt=6): 21 [] -in(A,B)|element(A,B).
% 1.95/2.13 ** KEPT (pick-wt=7): 22 [] -ordinal(A)| -in(B,A)|ordinal(B).
% 1.95/2.13 ** KEPT (pick-wt=13): 23 [] -ordinal(A)| -ordinal(B)|in(A,B)|A=B|in(B,A).
% 1.95/2.13 ** KEPT (pick-wt=8): 24 [] -element(A,B)|empty(B)|in(A,B).
% 1.95/2.13 ** KEPT (pick-wt=3): 26 [copy,25,flip.1] empty_set!=$c14.
% 1.95/2.13 ** KEPT (pick-wt=8): 27 [] -ordinal(A)| -in(A,$c14)|ordinal($f3(A)).
% 1.95/2.13 ** KEPT (pick-wt=9): 28 [] -ordinal(A)| -in(A,$c14)|in($f3(A),$c14).
% 256.33/256.52 ** KEPT (pick-wt=9): 29 [] -ordinal(A)| -in(A,$c14)| -ordinal_subset(A,$f3(A)).
% 256.33/256.52 ** KEPT (pick-wt=7): 30 [] -element(A,powerset(B))|subset(A,B).
% 256.33/256.52 ** KEPT (pick-wt=7): 31 [] element(A,powerset(B))| -subset(A,B).
% 256.33/256.52 ** KEPT (pick-wt=10): 32 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 256.33/256.52 ** KEPT (pick-wt=9): 33 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 256.33/256.52 ** KEPT (pick-wt=5): 34 [] -empty(A)|A=empty_set.
% 256.33/256.52 ** KEPT (pick-wt=5): 35 [] -in(A,B)| -empty(B).
% 256.33/256.52 ** KEPT (pick-wt=8): 36 [] -in(A,B)|in($f4(A,B),B).
% 256.33/256.52 ** KEPT (pick-wt=11): 37 [] -in(A,B)| -in(C,B)| -in(C,$f4(A,B)).
% 256.33/256.52 ** KEPT (pick-wt=7): 38 [] -empty(A)|A=B| -empty(B).
% 256.33/256.52
% 256.33/256.52 ------------> process sos:
% 256.33/256.52 ** KEPT (pick-wt=3): 44 [] A=A.
% 256.33/256.52 ** KEPT (pick-wt=6): 45 [] epsilon_transitive(A)|in($f1(A),A).
% 256.33/256.52 ** KEPT (pick-wt=4): 46 [] element($f2(A),A).
% 256.33/256.52 ** KEPT (pick-wt=2): 47 [] empty(empty_set).
% 256.33/256.52 ** KEPT (pick-wt=2): 48 [] relation(empty_set).
% 256.33/256.52 ** KEPT (pick-wt=2): 49 [] relation_empty_yielding(empty_set).
% 256.33/256.52 Following clause subsumed by 47 during input processing: 0 [] empty(empty_set).
% 256.33/256.52 Following clause subsumed by 48 during input processing: 0 [] relation(empty_set).
% 256.33/256.52 Following clause subsumed by 49 during input processing: 0 [] relation_empty_yielding(empty_set).
% 256.33/256.52 ** KEPT (pick-wt=2): 50 [] function(empty_set).
% 256.33/256.52 ** KEPT (pick-wt=2): 51 [] one_to_one(empty_set).
% 256.33/256.52 Following clause subsumed by 47 during input processing: 0 [] empty(empty_set).
% 256.33/256.52 ** KEPT (pick-wt=2): 52 [] epsilon_transitive(empty_set).
% 256.33/256.52 ** KEPT (pick-wt=2): 53 [] epsilon_connected(empty_set).
% 256.33/256.52 ** KEPT (pick-wt=2): 54 [] ordinal(empty_set).
% 256.33/256.52 Following clause subsumed by 47 during input processing: 0 [] empty(empty_set).
% 256.33/256.52 Following clause subsumed by 48 during input processing: 0 [] relation(empty_set).
% 256.33/256.52 ** KEPT (pick-wt=2): 55 [] relation($c1).
% 256.33/256.52 ** KEPT (pick-wt=2): 56 [] function($c1).
% 256.33/256.52 ** KEPT (pick-wt=2): 57 [] epsilon_transitive($c2).
% 256.33/256.52 ** KEPT (pick-wt=2): 58 [] epsilon_connected($c2).
% 256.33/256.52 ** KEPT (pick-wt=2): 59 [] ordinal($c2).
% 256.33/256.52 ** KEPT (pick-wt=2): 60 [] empty($c3).
% 256.33/256.52 ** KEPT (pick-wt=2): 61 [] relation($c3).
% 256.33/256.52 ** KEPT (pick-wt=2): 62 [] empty($c4).
% 256.33/256.52 ** KEPT (pick-wt=2): 63 [] relation($c5).
% 256.33/256.52 ** KEPT (pick-wt=2): 64 [] empty($c5).
% 256.33/256.52 ** KEPT (pick-wt=2): 65 [] function($c5).
% 256.33/256.52 ** KEPT (pick-wt=2): 66 [] relation($c6).
% 256.33/256.52 ** KEPT (pick-wt=2): 67 [] function($c6).
% 256.33/256.52 ** KEPT (pick-wt=2): 68 [] one_to_one($c6).
% 256.33/256.52 ** KEPT (pick-wt=2): 69 [] empty($c6).
% 256.33/256.52 ** KEPT (pick-wt=2): 70 [] epsilon_transitive($c6).
% 256.33/256.52 ** KEPT (pick-wt=2): 71 [] epsilon_connected($c6).
% 256.33/256.52 ** KEPT (pick-wt=2): 72 [] ordinal($c6).
% 256.33/256.52 ** KEPT (pick-wt=2): 73 [] relation($c7).
% 256.33/256.52 ** KEPT (pick-wt=2): 74 [] relation($c9).
% 256.33/256.52 ** KEPT (pick-wt=2): 75 [] function($c9).
% 256.33/256.52 ** KEPT (pick-wt=2): 76 [] one_to_one($c9).
% 256.33/256.52 ** KEPT (pick-wt=2): 77 [] epsilon_transitive($c10).
% 256.33/256.52 ** KEPT (pick-wt=2): 78 [] epsilon_connected($c10).
% 256.33/256.52 ** KEPT (pick-wt=2): 79 [] ordinal($c10).
% 256.33/256.52 ** KEPT (pick-wt=2): 80 [] relation($c11).
% 256.33/256.52 ** KEPT (pick-wt=2): 81 [] relation_empty_yielding($c11).
% 256.33/256.52 ** KEPT (pick-wt=2): 82 [] relation($c12).
% 256.33/256.52 ** KEPT (pick-wt=2): 83 [] relation_empty_yielding($c12).
% 256.33/256.52 ** KEPT (pick-wt=2): 84 [] function($c12).
% 256.33/256.52 ** KEPT (pick-wt=3): 85 [] subset(A,A).
% 256.33/256.52 ** KEPT (pick-wt=2): 86 [] ordinal($c13).
% 256.33/256.52 ** KEPT (pick-wt=3): 87 [] subset($c14,$c13).
% 256.33/256.52 Following clause subsumed by 44 during input processing: 0 [copy,44,flip.1] A=A.
% 256.33/256.52 44 back subsumes 43.
% 256.33/256.52 44 back subsumes 41.
% 256.33/256.52 85 back subsumes 40.
% 256.33/256.52
% 256.33/256.52 ======= end of input processing =======
% 256.33/256.52
% 256.33/256.52 =========== start of search ===========
% 256.33/256.52
% 256.33/256.52
% 256.33/256.52 Resetting weight limit to 7.
% 256.33/256.52
% 256.33/256.52
% 256.33/256.52 Resetting weight limit to 7.
% 256.33/256.52
% 256.33/256.52 sos_size=2664
% 256.33/256.52
% 256.33/256.52 Search stopped because sos empty.
% 256.33/256.52
% 256.33/256.52
% 256.33/256.52 Search stopped because sos empty.
% 256.33/256.52
% 256.33/256.52 ============ end of search ============
% 256.33/256.52
% 256.33/256.52 -------------- statistics -------------
% 256.33/256.52 clauses given 2732
% 256.33/256.52 clauses generated 10598728
% 256.33/256.52 clauses kept 3907
% 256.33/256.52 clauses forward subsumed 10760
% 256.33/256.52 clauses back subsumed 1200
% 256.33/256.52 Kbytes malloced 5859
% 256.33/256.52
% 256.33/256.52 ----------- times (seconds) -----------
% 256.33/256.52 user CPU time 254.37 (0 hr, 4 min, 14 sec)
% 256.33/256.52 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 256.33/256.52 wall-clock time 256 (0 hr, 4 min, 16 sec)
% 256.33/256.52
% 256.33/256.52 Process 3304 finished Wed Jul 27 07:25:17 2022
% 256.37/256.52 Otter interrupted
% 256.37/256.52 PROOF NOT FOUND
%------------------------------------------------------------------------------