TSTP Solution File: SEU225+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU225+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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:14 EDT 2022
% Result : Unknown 24.84s 25.04s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU225+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.11 % Command : otter-tptp-script %s
% 0.11/0.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Wed Jul 27 07:48:39 EDT 2022
% 0.11/0.32 % CPUTime :
% 1.89/2.09 ----- Otter 3.3f, August 2004 -----
% 1.89/2.09 The process was started by sandbox on n010.cluster.edu,
% 1.89/2.09 Wed Jul 27 07:48:40 2022
% 1.89/2.09 The command was "./otter". The process ID is 27277.
% 1.89/2.09
% 1.89/2.09 set(prolog_style_variables).
% 1.89/2.09 set(auto).
% 1.89/2.09 dependent: set(auto1).
% 1.89/2.09 dependent: set(process_input).
% 1.89/2.09 dependent: clear(print_kept).
% 1.89/2.09 dependent: clear(print_new_demod).
% 1.89/2.09 dependent: clear(print_back_demod).
% 1.89/2.09 dependent: clear(print_back_sub).
% 1.89/2.09 dependent: set(control_memory).
% 1.89/2.09 dependent: assign(max_mem, 12000).
% 1.89/2.09 dependent: assign(pick_given_ratio, 4).
% 1.89/2.09 dependent: assign(stats_level, 1).
% 1.89/2.09 dependent: assign(max_seconds, 10800).
% 1.89/2.09 clear(print_given).
% 1.89/2.09
% 1.89/2.09 formula_list(usable).
% 1.89/2.09 all A (A=A).
% 1.89/2.09 all A B (in(A,B)-> -in(B,A)).
% 1.89/2.09 all A (empty(A)->function(A)).
% 1.89/2.09 all A (empty(A)->relation(A)).
% 1.89/2.09 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.89/2.09 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.89/2.09 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.89/2.09 all A (relation(A)&function(A)-> (all B C ((in(B,relation_dom(A))-> (C=apply(A,B)<->in(ordered_pair(B,C),A)))& (-in(B,relation_dom(A))-> (C=apply(A,B)<->C=empty_set))))).
% 1.89/2.09 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.89/2.09 $T.
% 1.89/2.09 $T.
% 1.89/2.09 $T.
% 1.89/2.09 $T.
% 1.89/2.09 $T.
% 1.89/2.09 $T.
% 1.89/2.09 $T.
% 1.89/2.09 all A B (relation(A)->relation(relation_dom_restriction(A,B))).
% 1.89/2.09 $T.
% 1.89/2.09 all A exists B element(B,A).
% 1.89/2.09 empty(empty_set).
% 1.89/2.09 relation(empty_set).
% 1.89/2.09 relation_empty_yielding(empty_set).
% 1.89/2.09 all A B (relation(A)&relation_empty_yielding(A)->relation(relation_dom_restriction(A,B))&relation_empty_yielding(relation_dom_restriction(A,B))).
% 1.89/2.09 all A B (relation(A)&relation(B)->relation(set_intersection2(A,B))).
% 1.89/2.09 empty(empty_set).
% 1.89/2.09 all A B (-empty(ordered_pair(A,B))).
% 1.89/2.09 all A (-empty(singleton(A))).
% 1.89/2.09 all A B (-empty(unordered_pair(A,B))).
% 1.89/2.09 all A B (relation(A)&function(A)->relation(relation_dom_restriction(A,B))&function(relation_dom_restriction(A,B))).
% 1.89/2.09 empty(empty_set).
% 1.89/2.09 relation(empty_set).
% 1.89/2.09 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 1.89/2.09 all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 1.89/2.09 all A B (set_intersection2(A,A)=A).
% 1.89/2.09 all A B C (relation(C)&function(C)-> (in(B,relation_dom(relation_dom_restriction(C,A)))<->in(B,relation_dom(C))&in(B,A))).
% 1.89/2.09 exists A (relation(A)&function(A)).
% 1.89/2.09 exists A (empty(A)&relation(A)).
% 1.89/2.09 exists A empty(A).
% 1.89/2.09 exists A (relation(A)&empty(A)&function(A)).
% 1.89/2.09 exists A (-empty(A)&relation(A)).
% 1.89/2.09 exists A (-empty(A)).
% 1.89/2.09 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.89/2.09 exists A (relation(A)&relation_empty_yielding(A)).
% 1.89/2.09 all A B (in(A,B)->element(A,B)).
% 1.89/2.09 all A (set_intersection2(A,empty_set)=empty_set).
% 1.89/2.09 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.89/2.09 all A B (relation(B)&function(B)-> (all C (relation(C)&function(C)-> (B=relation_dom_restriction(C,A)<->relation_dom(B)=set_intersection2(relation_dom(C),A)& (all D (in(D,relation_dom(B))->apply(B,D)=apply(C,D))))))).
% 1.89/2.09 all A (empty(A)->A=empty_set).
% 1.89/2.09 -(all A B C (relation(C)&function(C)-> (in(B,A)->apply(relation_dom_restriction(C,A),B)=apply(C,B)))).
% 1.89/2.09 all A B (-(in(A,B)&empty(B))).
% 1.89/2.09 all A B (-(empty(A)&A!=B&empty(B))).
% 1.89/2.09 end_of_list.
% 1.89/2.09
% 1.89/2.09 -------> usable clausifies to:
% 1.89/2.09
% 1.89/2.09 list(usable).
% 1.89/2.09 0 [] A=A.
% 1.89/2.09 0 [] -in(A,B)| -in(B,A).
% 1.89/2.09 0 [] -empty(A)|function(A).
% 1.89/2.09 0 [] -empty(A)|relation(A).
% 1.89/2.09 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.89/2.09 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.89/2.09 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.89/2.09 0 [] -relation(A)| -function(A)| -in(B,relation_dom(A))|C!=apply(A,B)|in(ordered_pair(B,C),A).
% 1.89/2.09 0 [] -relation(A)| -function(A)| -in(B,relation_dom(A))|C=apply(A,B)| -in(ordered_pair(B,C),A).
% 1.89/2.09 0 [] -relation(A)| -function(A)|in(B,relation_dom(A))|C!=apply(A,B)|C=empty_set.
% 1.89/2.09 0 [] -relation(A)| -function(A)|in(B,relation_dom(A))|C=apply(A,B)|C!=empty_set.
% 1.89/2.09 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.89/2.09 0 [] $T.
% 1.89/2.09 0 [] $T.
% 1.89/2.09 0 [] $T.
% 1.89/2.09 0 [] $T.
% 1.89/2.09 0 [] $T.
% 1.89/2.09 0 [] $T.
% 1.89/2.09 0 [] $T.
% 1.89/2.09 0 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 1.89/2.09 0 [] $T.
% 1.89/2.09 0 [] element($f1(A),A).
% 1.89/2.09 0 [] empty(empty_set).
% 1.89/2.09 0 [] relation(empty_set).
% 1.89/2.09 0 [] relation_empty_yielding(empty_set).
% 1.89/2.09 0 [] -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 1.89/2.09 0 [] -relation(A)| -relation_empty_yielding(A)|relation_empty_yielding(relation_dom_restriction(A,B)).
% 1.89/2.09 0 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 1.89/2.09 0 [] empty(empty_set).
% 1.89/2.09 0 [] -empty(ordered_pair(A,B)).
% 1.89/2.09 0 [] -empty(singleton(A)).
% 1.89/2.09 0 [] -empty(unordered_pair(A,B)).
% 1.89/2.09 0 [] -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 1.89/2.09 0 [] -relation(A)| -function(A)|function(relation_dom_restriction(A,B)).
% 1.89/2.09 0 [] empty(empty_set).
% 1.89/2.09 0 [] relation(empty_set).
% 1.89/2.09 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 1.89/2.09 0 [] -empty(A)|empty(relation_dom(A)).
% 1.89/2.09 0 [] -empty(A)|relation(relation_dom(A)).
% 1.89/2.09 0 [] set_intersection2(A,A)=A.
% 1.89/2.09 0 [] -relation(C)| -function(C)| -in(B,relation_dom(relation_dom_restriction(C,A)))|in(B,relation_dom(C)).
% 1.89/2.09 0 [] -relation(C)| -function(C)| -in(B,relation_dom(relation_dom_restriction(C,A)))|in(B,A).
% 1.89/2.09 0 [] -relation(C)| -function(C)|in(B,relation_dom(relation_dom_restriction(C,A)))| -in(B,relation_dom(C))| -in(B,A).
% 1.89/2.09 0 [] relation($c1).
% 1.89/2.09 0 [] function($c1).
% 1.89/2.09 0 [] empty($c2).
% 1.89/2.09 0 [] relation($c2).
% 1.89/2.09 0 [] empty($c3).
% 1.89/2.09 0 [] relation($c4).
% 1.89/2.09 0 [] empty($c4).
% 1.89/2.09 0 [] function($c4).
% 1.89/2.09 0 [] -empty($c5).
% 1.89/2.09 0 [] relation($c5).
% 1.89/2.09 0 [] -empty($c6).
% 1.89/2.09 0 [] relation($c7).
% 1.89/2.09 0 [] function($c7).
% 1.89/2.09 0 [] one_to_one($c7).
% 1.89/2.09 0 [] relation($c8).
% 1.89/2.09 0 [] relation_empty_yielding($c8).
% 1.89/2.09 0 [] -in(A,B)|element(A,B).
% 1.89/2.09 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.89/2.09 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.89/2.09 0 [] -relation(B)| -function(B)| -relation(C)| -function(C)|B!=relation_dom_restriction(C,A)|relation_dom(B)=set_intersection2(relation_dom(C),A).
% 1.89/2.09 0 [] -relation(B)| -function(B)| -relation(C)| -function(C)|B!=relation_dom_restriction(C,A)| -in(D,relation_dom(B))|apply(B,D)=apply(C,D).
% 1.89/2.09 0 [] -relation(B)| -function(B)| -relation(C)| -function(C)|B=relation_dom_restriction(C,A)|relation_dom(B)!=set_intersection2(relation_dom(C),A)|in($f2(A,B,C),relation_dom(B)).
% 1.89/2.09 0 [] -relation(B)| -function(B)| -relation(C)| -function(C)|B=relation_dom_restriction(C,A)|relation_dom(B)!=set_intersection2(relation_dom(C),A)|apply(B,$f2(A,B,C))!=apply(C,$f2(A,B,C)).
% 1.89/2.09 0 [] -empty(A)|A=empty_set.
% 1.89/2.09 0 [] relation($c9).
% 1.89/2.09 0 [] function($c9).
% 1.89/2.09 0 [] in($c10,$c11).
% 1.89/2.09 0 [] apply(relation_dom_restriction($c9,$c11),$c10)!=apply($c9,$c10).
% 1.89/2.09 0 [] -in(A,B)| -empty(B).
% 1.89/2.09 0 [] -empty(A)|A=B| -empty(B).
% 1.89/2.09 end_of_list.
% 1.89/2.09
% 1.89/2.09 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.89/2.09
% 1.89/2.09 This ia a non-Horn set with equality. The strategy will be
% 1.89/2.09 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.89/2.09 deletion, with positive clauses in sos and nonpositive
% 1.89/2.09 clauses in usable.
% 1.89/2.09
% 1.89/2.09 dependent: set(knuth_bendix).
% 1.89/2.09 dependent: set(anl_eq).
% 1.89/2.09 dependent: set(para_from).
% 1.89/2.09 dependent: set(para_into).
% 1.89/2.09 dependent: clear(para_from_right).
% 1.89/2.09 dependent: clear(para_into_right).
% 1.89/2.09 dependent: set(para_from_vars).
% 1.89/2.09 dependent: set(eq_units_both_ways).
% 1.89/2.09 dependent: set(dynamic_demod_all).
% 1.89/2.09 dependent: set(dynamic_demod).
% 1.89/2.09 dependent: set(order_eq).
% 1.89/2.09 dependent: set(back_demod).
% 1.89/2.09 dependent: set(lrpo).
% 1.89/2.09 dependent: set(hyper_res).
% 1.89/2.09 dependent: set(unit_deletion).
% 1.89/2.09 dependent: set(factor).
% 1.89/2.09
% 1.89/2.09 ------------> process usable:
% 1.89/2.09 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.89/2.09 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.89/2.09 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 1.89/2.09 ** KEPT (pick-wt=8): 4 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.89/2.09 ** KEPT (pick-wt=18): 5 [] -relation(A)| -function(A)| -in(B,relation_dom(A))|C!=apply(A,B)|in(ordered_pair(B,C),A).
% 1.89/2.09 ** KEPT (pick-wt=18): 6 [] -relation(A)| -function(A)| -in(B,relation_dom(A))|C=apply(A,B)| -in(ordered_pair(B,C),A).
% 1.89/2.09 ** KEPT (pick-wt=16): 7 [] -relation(A)| -function(A)|in(B,relation_dom(A))|C!=apply(A,B)|C=empty_set.
% 1.89/2.09 ** KEPT (pick-wt=16): 8 [] -relation(A)| -function(A)|in(B,relation_dom(A))|C=apply(A,B)|C!=empty_set.
% 1.89/2.09 ** KEPT (pick-wt=6): 9 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 1.89/2.09 Following clause subsumed by 9 during input processing: 0 [] -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 1.89/2.09 ** KEPT (pick-wt=8): 10 [] -relation(A)| -relation_empty_yielding(A)|relation_empty_yielding(relation_dom_restriction(A,B)).
% 1.89/2.09 ** KEPT (pick-wt=8): 11 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 1.89/2.09 ** KEPT (pick-wt=4): 12 [] -empty(ordered_pair(A,B)).
% 1.89/2.09 ** KEPT (pick-wt=3): 13 [] -empty(singleton(A)).
% 1.89/2.09 ** KEPT (pick-wt=4): 14 [] -empty(unordered_pair(A,B)).
% 1.89/2.09 Following clause subsumed by 9 during input processing: 0 [] -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 1.89/2.09 ** KEPT (pick-wt=8): 15 [] -relation(A)| -function(A)|function(relation_dom_restriction(A,B)).
% 1.89/2.09 ** KEPT (pick-wt=7): 16 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 1.89/2.09 ** KEPT (pick-wt=5): 17 [] -empty(A)|empty(relation_dom(A)).
% 1.89/2.09 ** KEPT (pick-wt=5): 18 [] -empty(A)|relation(relation_dom(A)).
% 1.89/2.09 ** KEPT (pick-wt=14): 19 [] -relation(A)| -function(A)| -in(B,relation_dom(relation_dom_restriction(A,C)))|in(B,relation_dom(A)).
% 1.89/2.09 ** KEPT (pick-wt=13): 20 [] -relation(A)| -function(A)| -in(B,relation_dom(relation_dom_restriction(A,C)))|in(B,C).
% 1.89/2.09 ** KEPT (pick-wt=17): 21 [] -relation(A)| -function(A)|in(B,relation_dom(relation_dom_restriction(A,C)))| -in(B,relation_dom(A))| -in(B,C).
% 1.89/2.09 ** KEPT (pick-wt=2): 22 [] -empty($c5).
% 1.89/2.09 ** KEPT (pick-wt=2): 23 [] -empty($c6).
% 1.89/2.09 ** KEPT (pick-wt=6): 24 [] -in(A,B)|element(A,B).
% 1.89/2.09 ** KEPT (pick-wt=8): 25 [] -element(A,B)|empty(B)|in(A,B).
% 1.89/2.09 ** KEPT (pick-wt=20): 26 [] -relation(A)| -function(A)| -relation(B)| -function(B)|A!=relation_dom_restriction(B,C)|relation_dom(A)=set_intersection2(relation_dom(B),C).
% 1.89/2.09 ** KEPT (pick-wt=24): 27 [] -relation(A)| -function(A)| -relation(B)| -function(B)|A!=relation_dom_restriction(B,C)| -in(D,relation_dom(A))|apply(A,D)=apply(B,D).
% 1.89/2.09 ** KEPT (pick-wt=27): 28 [] -relation(A)| -function(A)| -relation(B)| -function(B)|A=relation_dom_restriction(B,C)|relation_dom(A)!=set_intersection2(relation_dom(B),C)|in($f2(C,A,B),relation_dom(A)).
% 1.89/2.09 ** KEPT (pick-wt=33): 29 [] -relation(A)| -function(A)| -relation(B)| -function(B)|A=relation_dom_restriction(B,C)|relation_dom(A)!=set_intersection2(relation_dom(B),C)|apply(A,$f2(C,A,B))!=apply(B,$f2(C,A,B)).
% 1.89/2.09 ** KEPT (pick-wt=5): 30 [] -empty(A)|A=empty_set.
% 1.89/2.09 ** KEPT (pick-wt=9): 31 [] apply(relation_dom_restriction($c9,$c11),$c10)!=apply($c9,$c10).
% 1.89/2.09 ** KEPT (pick-wt=5): 32 [] -in(A,B)| -empty(B).
% 1.89/2.09 ** KEPT (pick-wt=7): 33 [] -empty(A)|A=B| -empty(B).
% 1.89/2.09
% 1.89/2.09 ------------> process sos:
% 1.89/2.09 ** KEPT (pick-wt=3): 42 [] A=A.
% 1.89/2.09 ** KEPT (pick-wt=7): 43 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.89/2.09 ** KEPT (pick-wt=7): 44 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.89/2.09 ** KEPT (pick-wt=10): 46 [copy,45,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 1.89/2.09 ---> New Demodulator: 47 [new_demod,46] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 1.89/2.09 ** KEPT (pick-wt=4): 48 [] element($f1(A),A).
% 1.89/2.09 ** KEPT (pick-wt=2): 49 [] empty(empty_set).
% 1.89/2.09 ** KEPT (pick-wt=2): 50 [] relation(empty_set).
% 1.89/2.09 ** KEPT (pick-wt=2): 51 [] relation_empty_yielding(empty_set).
% 1.89/2.09 Following clause subsumed by 49 during input processing: 0 [] empty(empty_set).
% 1.89/2.09 Following clause subsumed by 49 during input processing: 0 [] empty(empty_set).
% 1.89/2.09 Following clause subsumed by 50 during input processing: 0 [] relation(empty_set).
% 1.89/2.09 ** KEPT (pick-wt=5): 52 [] set_intersection2(A,A)=A.
% 1.89/2.09 ---> New Demodulator: 53 [new_demod,52] set_intersection2(A,A)=A.
% 1.89/2.09 ** KEPT (pick-wt=2): 54 [] relation($c1).
% 1.89/2.09 ** KEPT (pick-wt=2): 55 [] function($c1).
% 1.89/2.09 ** KEPT (pick-wt=2): 56 [] empty($c2).
% 1.89/2.09 ** KEPT (pick-wt=2): 57 [] relation($c2).
% 1.89/2.09 ** KEPT (pick-wt=2): 58 [] empty($c3).
% 1.89/2.09 ** KEPT (pick-wt=2): 59 [] relation($c4).
% 1.89/2.09 ** KEPT (pick-wt=2): 60 [] empty($c4).
% 1.89/2.09 ** KEPT (pick-wt=2): 61 [] function($c4).
% 1.89/2.09 ** KEPT (pick-wt=2): 62 [] relation($c5).
% 1.89/2.09 ** KEPT (pick-wt=2): 63 [] relation($c7).
% 1.89/2.09 ** KEPT (pick-wt=2): 64 [] function($c7).
% 1.89/2.09 ** KEPT (pick-wt=2): 65 [] one_to_one($c7).
% 1.89/2.09 ** KEPT (pick-wt=2): 66 [] relation($c8).
% 1.89/2.09 ** KEPT (pick-wt=2): 67 [] relation_empty_yielding($c8).
% 1.89/2.09 ** KEPT (pick-wt=5): 68 [] set_intersection2(A,empty_set)=empty_set.
% 1.89/2.09 ---> New Demodulator: 69 [new_demod,68] set_intersection2(A,empty_set)=empty_set.
% 1.89/2.09 ** KEPT (pick-wt=2): 70 [] relation($c9).
% 1.89/2.09 ** KEPT (pick-wt=2): 71 [] function($c9).
% 1.89/2.09 ** KEPT (pick-wt=3): 72 [] in($c10,$c11).
% 1.89/2.09 Following clause subsumed by 42 during input processing: 0 [copy,42,flip.1] A=A.
% 24.84/25.04 42 back subsumes 41.
% 24.84/25.04 42 back subsumes 38.
% 24.84/25.04 Following clause subsumed by 43 during input processing: 0 [copy,43,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 24.84/25.04 Following clause subsumed by 44 during input processing: 0 [copy,44,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 24.84/25.04 >>>> Starting back demodulation with 47.
% 24.84/25.04 >>>> Starting back demodulation with 53.
% 24.84/25.04 >> back demodulating 35 with 53.
% 24.84/25.04 >>>> Starting back demodulation with 69.
% 24.84/25.04
% 24.84/25.04 ======= end of input processing =======
% 24.84/25.04
% 24.84/25.04 =========== start of search ===========
% 24.84/25.04
% 24.84/25.04
% 24.84/25.04 Resetting weight limit to 6.
% 24.84/25.04
% 24.84/25.04
% 24.84/25.04 Resetting weight limit to 6.
% 24.84/25.04
% 24.84/25.04 sos_size=606
% 24.84/25.04
% 24.84/25.04 Search stopped because sos empty.
% 24.84/25.04
% 24.84/25.04
% 24.84/25.04 Search stopped because sos empty.
% 24.84/25.04
% 24.84/25.04 ============ end of search ============
% 24.84/25.04
% 24.84/25.04 -------------- statistics -------------
% 24.84/25.04 clauses given 803
% 24.84/25.04 clauses generated 270350
% 24.84/25.04 clauses kept 1071
% 24.84/25.04 clauses forward subsumed 4170
% 24.84/25.04 clauses back subsumed 21
% 24.84/25.04 Kbytes malloced 6835
% 24.84/25.04
% 24.84/25.04 ----------- times (seconds) -----------
% 24.84/25.04 user CPU time 22.94 (0 hr, 0 min, 22 sec)
% 24.84/25.04 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 24.84/25.04 wall-clock time 24 (0 hr, 0 min, 24 sec)
% 24.84/25.04
% 24.84/25.04 Process 27277 finished Wed Jul 27 07:49:04 2022
% 24.84/25.04 Otter interrupted
% 24.84/25.04 PROOF NOT FOUND
%------------------------------------------------------------------------------