TSTP Solution File: NUM394+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM394+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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:08:14 EDT 2022
% Result : Theorem 1.92s 2.11s
% Output : Refutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 24 ( 13 unt; 4 nHn; 24 RR)
% Number of literals : 46 ( 2 equ; 22 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 22 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ in(A,B)
| ~ in(B,A) ),
file('NUM394+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ ordinal(A)
| ~ ordinal(B)
| ordinal_subset(A,B)
| ordinal_subset(B,A) ),
file('NUM394+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ ordinal(A)
| ~ ordinal(B)
| ~ ordinal_subset(A,B)
| subset(A,B) ),
file('NUM394+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ ordinal(A)
| ~ ordinal(B)
| ordinal_subset(A,A) ),
file('NUM394+1.p',unknown),
[] ).
cnf(16,plain,
( ~ ordinal(A)
| ordinal_subset(A,A) ),
inference(factor_simp,[status(thm)],[inference(copy,[status(thm)],[15])]),
[iquote('copy,15,factor_simp')] ).
cnf(18,axiom,
( ~ ordinal(A)
| ~ ordinal(B)
| in(A,B)
| A = B
| in(B,A) ),
file('NUM394+1.p',unknown),
[] ).
cnf(19,axiom,
~ ordinal_subset(dollar_c13,dollar_c12),
file('NUM394+1.p',unknown),
[] ).
cnf(20,axiom,
~ in(dollar_c12,dollar_c13),
file('NUM394+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ element(A,B)
| empty(B)
| in(A,B) ),
file('NUM394+1.p',unknown),
[] ).
cnf(23,axiom,
( element(A,powerset(B))
| ~ subset(A,B) ),
file('NUM394+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ in(A,B)
| ~ element(B,powerset(C))
| element(A,C) ),
file('NUM394+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ in(A,B)
| ~ element(B,powerset(C))
| ~ empty(C) ),
file('NUM394+1.p',unknown),
[] ).
cnf(29,plain,
~ in(A,A),
inference(factor,[status(thm)],[1]),
[iquote('factor,1.1.2')] ).
cnf(63,axiom,
ordinal(dollar_c13),
file('NUM394+1.p',unknown),
[] ).
cnf(64,axiom,
ordinal(dollar_c12),
file('NUM394+1.p',unknown),
[] ).
cnf(120,plain,
ordinal_subset(dollar_c13,dollar_c13),
inference(hyper,[status(thm)],[63,16]),
[iquote('hyper,63,16')] ).
cnf(125,plain,
( in(dollar_c13,dollar_c12)
| dollar_c13 = dollar_c12 ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[64,18,63]),20]),
[iquote('hyper,64,18,63,unit_del,20')] ).
cnf(128,plain,
ordinal_subset(dollar_c12,dollar_c13),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[64,8,63]),19]),
[iquote('hyper,64,8,63,unit_del,19')] ).
cnf(160,plain,
subset(dollar_c12,dollar_c13),
inference(hyper,[status(thm)],[128,13,64,63]),
[iquote('hyper,128,13,64,63')] ).
cnf(165,plain,
element(dollar_c12,powerset(dollar_c13)),
inference(hyper,[status(thm)],[160,23]),
[iquote('hyper,160,23')] ).
cnf(435,plain,
in(dollar_c13,dollar_c12),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[125,120]),19]),
[iquote('para_from,125.2.1,120.1.2,unit_del,19')] ).
cnf(438,plain,
element(dollar_c13,dollar_c13),
inference(hyper,[status(thm)],[435,24,165]),
[iquote('hyper,435,24,165')] ).
cnf(447,plain,
empty(dollar_c13),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[438,21]),29]),
[iquote('hyper,438,21,unit_del,29')] ).
cnf(472,plain,
$false,
inference(hyper,[status(thm)],[447,25,435,165]),
[iquote('hyper,447,25,435,165')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NUM394+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n027.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 10:11:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.86/2.08 ----- Otter 3.3f, August 2004 -----
% 1.86/2.08 The process was started by sandbox2 on n027.cluster.edu,
% 1.86/2.08 Wed Jul 27 10:11:07 2022
% 1.86/2.08 The command was "./otter". The process ID is 19526.
% 1.86/2.08
% 1.86/2.08 set(prolog_style_variables).
% 1.86/2.08 set(auto).
% 1.86/2.08 dependent: set(auto1).
% 1.86/2.08 dependent: set(process_input).
% 1.86/2.08 dependent: clear(print_kept).
% 1.86/2.08 dependent: clear(print_new_demod).
% 1.86/2.08 dependent: clear(print_back_demod).
% 1.86/2.08 dependent: clear(print_back_sub).
% 1.86/2.08 dependent: set(control_memory).
% 1.86/2.08 dependent: assign(max_mem, 12000).
% 1.86/2.08 dependent: assign(pick_given_ratio, 4).
% 1.86/2.08 dependent: assign(stats_level, 1).
% 1.86/2.08 dependent: assign(max_seconds, 10800).
% 1.86/2.08 clear(print_given).
% 1.86/2.08
% 1.86/2.08 formula_list(usable).
% 1.86/2.08 all A (A=A).
% 1.86/2.08 all A B (in(A,B)-> -in(B,A)).
% 1.86/2.08 all A (empty(A)->function(A)).
% 1.86/2.08 all A (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)).
% 1.86/2.08 all A (empty(A)->relation(A)).
% 1.86/2.08 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 1.86/2.08 all A (epsilon_transitive(A)&epsilon_connected(A)->ordinal(A)).
% 1.86/2.08 all A B (ordinal(A)&ordinal(B)->ordinal_subset(A,B)|ordinal_subset(B,A)).
% 1.86/2.08 all A (epsilon_transitive(A)<-> (all B (in(B,A)->subset(B,A)))).
% 1.86/2.08 all A exists B element(B,A).
% 1.86/2.08 empty(empty_set).
% 1.86/2.08 relation(empty_set).
% 1.86/2.08 relation_empty_yielding(empty_set).
% 1.86/2.08 empty(empty_set).
% 1.86/2.08 empty(empty_set).
% 1.86/2.08 relation(empty_set).
% 1.86/2.08 exists A (relation(A)&function(A)).
% 1.86/2.08 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)).
% 1.86/2.08 exists A (empty(A)&relation(A)).
% 1.86/2.08 exists A empty(A).
% 1.86/2.08 exists A (relation(A)&empty(A)&function(A)).
% 1.86/2.08 exists A (-empty(A)&relation(A)).
% 1.86/2.08 exists A (-empty(A)).
% 1.86/2.08 exists A (relation(A)&function(A)&one_to_one(A)).
% 1.86/2.08 exists A (relation(A)&relation_empty_yielding(A)).
% 1.86/2.08 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 1.86/2.08 exists A (relation(A)&relation_non_empty(A)&function(A)).
% 1.86/2.08 all A B (ordinal(A)&ordinal(B)-> (ordinal_subset(A,B)<->subset(A,B))).
% 1.86/2.08 all A B (ordinal(A)&ordinal(B)->ordinal_subset(A,A)).
% 1.86/2.08 all A B subset(A,A).
% 1.86/2.08 all A B (in(A,B)->element(A,B)).
% 1.86/2.08 all A (ordinal(A)-> (all B (ordinal(B)-> -(-in(A,B)&A!=B& -in(B,A))))).
% 1.86/2.08 -(all A (ordinal(A)-> (all B (ordinal(B)->ordinal_subset(A,B)|in(B,A))))).
% 1.86/2.08 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.86/2.08 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.86/2.08 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.86/2.08 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.86/2.08 all A (empty(A)->A=empty_set).
% 1.86/2.08 all A B (-(in(A,B)&empty(B))).
% 1.86/2.08 all A B (-(empty(A)&A!=B&empty(B))).
% 1.86/2.08 end_of_list.
% 1.86/2.08
% 1.86/2.08 -------> usable clausifies to:
% 1.86/2.08
% 1.86/2.08 list(usable).
% 1.86/2.08 0 [] A=A.
% 1.86/2.08 0 [] -in(A,B)| -in(B,A).
% 1.86/2.08 0 [] -empty(A)|function(A).
% 1.86/2.08 0 [] -ordinal(A)|epsilon_transitive(A).
% 1.86/2.08 0 [] -ordinal(A)|epsilon_connected(A).
% 1.86/2.08 0 [] -empty(A)|relation(A).
% 1.86/2.08 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.86/2.08 0 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 1.86/2.08 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)|ordinal_subset(B,A).
% 1.86/2.08 0 [] -epsilon_transitive(A)| -in(B,A)|subset(B,A).
% 1.86/2.08 0 [] epsilon_transitive(A)|in($f1(A),A).
% 1.86/2.08 0 [] epsilon_transitive(A)| -subset($f1(A),A).
% 1.86/2.08 0 [] element($f2(A),A).
% 1.86/2.08 0 [] empty(empty_set).
% 1.86/2.08 0 [] relation(empty_set).
% 1.86/2.08 0 [] relation_empty_yielding(empty_set).
% 1.86/2.08 0 [] empty(empty_set).
% 1.86/2.08 0 [] empty(empty_set).
% 1.86/2.08 0 [] relation(empty_set).
% 1.86/2.08 0 [] relation($c1).
% 1.86/2.08 0 [] function($c1).
% 1.86/2.08 0 [] epsilon_transitive($c2).
% 1.86/2.08 0 [] epsilon_connected($c2).
% 1.86/2.08 0 [] ordinal($c2).
% 1.86/2.08 0 [] empty($c3).
% 1.86/2.08 0 [] relation($c3).
% 1.86/2.08 0 [] empty($c4).
% 1.86/2.08 0 [] relation($c5).
% 1.86/2.08 0 [] empty($c5).
% 1.86/2.08 0 [] function($c5).
% 1.86/2.08 0 [] -empty($c6).
% 1.86/2.08 0 [] relation($c6).
% 1.86/2.08 0 [] -empty($c7).
% 1.86/2.08 0 [] relation($c8).
% 1.86/2.08 0 [] function($c8).
% 1.86/2.08 0 [] one_to_one($c8).
% 1.86/2.08 0 [] relation($c9).
% 1.86/2.08 0 [] relation_empty_yielding($c9).
% 1.86/2.08 0 [] relation($c10).
% 1.86/2.08 0 [] relation_empty_yielding($c10).
% 1.86/2.08 0 [] function($c10).
% 1.86/2.08 0 [] relation($c11).
% 1.86/2.08 0 [] relation_non_empty($c11).
% 1.86/2.08 0 [] function($c11).
% 1.86/2.08 0 [] -ordinal(A)| -ordinal(B)| -ordinal_subset(A,B)|subset(A,B).
% 1.86/2.08 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)| -subset(A,B).
% 1.86/2.08 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,A).
% 1.86/2.08 0 [] subset(A,A).
% 1.86/2.08 0 [] -in(A,B)|element(A,B).
% 1.86/2.08 0 [] -ordinal(A)| -ordinal(B)|in(A,B)|A=B|in(B,A).
% 1.86/2.08 0 [] ordinal($c13).
% 1.86/2.08 0 [] ordinal($c12).
% 1.86/2.08 0 [] -ordinal_subset($c13,$c12).
% 1.86/2.08 0 [] -in($c12,$c13).
% 1.86/2.08 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.86/2.08 0 [] -element(A,powerset(B))|subset(A,B).
% 1.86/2.08 0 [] element(A,powerset(B))| -subset(A,B).
% 1.86/2.08 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.86/2.08 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.86/2.08 0 [] -empty(A)|A=empty_set.
% 1.86/2.08 0 [] -in(A,B)| -empty(B).
% 1.86/2.08 0 [] -empty(A)|A=B| -empty(B).
% 1.86/2.08 end_of_list.
% 1.86/2.08
% 1.86/2.08 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.86/2.08
% 1.86/2.08 This ia a non-Horn set with equality. The strategy will be
% 1.86/2.08 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.86/2.08 deletion, with positive clauses in sos and nonpositive
% 1.86/2.08 clauses in usable.
% 1.86/2.08
% 1.86/2.08 dependent: set(knuth_bendix).
% 1.86/2.08 dependent: set(anl_eq).
% 1.86/2.08 dependent: set(para_from).
% 1.86/2.08 dependent: set(para_into).
% 1.86/2.08 dependent: clear(para_from_right).
% 1.86/2.08 dependent: clear(para_into_right).
% 1.86/2.08 dependent: set(para_from_vars).
% 1.86/2.08 dependent: set(eq_units_both_ways).
% 1.86/2.08 dependent: set(dynamic_demod_all).
% 1.86/2.08 dependent: set(dynamic_demod).
% 1.86/2.08 dependent: set(order_eq).
% 1.86/2.08 dependent: set(back_demod).
% 1.86/2.08 dependent: set(lrpo).
% 1.86/2.08 dependent: set(hyper_res).
% 1.86/2.08 dependent: set(unit_deletion).
% 1.86/2.08 dependent: set(factor).
% 1.86/2.08
% 1.86/2.08 ------------> process usable:
% 1.86/2.08 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.86/2.08 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 1.86/2.08 ** KEPT (pick-wt=4): 3 [] -ordinal(A)|epsilon_transitive(A).
% 1.86/2.08 ** KEPT (pick-wt=4): 4 [] -ordinal(A)|epsilon_connected(A).
% 1.86/2.08 ** KEPT (pick-wt=4): 5 [] -empty(A)|relation(A).
% 1.86/2.08 ** KEPT (pick-wt=8): 6 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 1.86/2.08 ** KEPT (pick-wt=6): 7 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A).
% 1.86/2.08 ** KEPT (pick-wt=10): 8 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)|ordinal_subset(B,A).
% 1.86/2.08 ** KEPT (pick-wt=8): 9 [] -epsilon_transitive(A)| -in(B,A)|subset(B,A).
% 1.86/2.08 ** KEPT (pick-wt=6): 10 [] epsilon_transitive(A)| -subset($f1(A),A).
% 1.86/2.08 ** KEPT (pick-wt=2): 11 [] -empty($c6).
% 1.86/2.08 ** KEPT (pick-wt=2): 12 [] -empty($c7).
% 1.86/2.08 ** KEPT (pick-wt=10): 13 [] -ordinal(A)| -ordinal(B)| -ordinal_subset(A,B)|subset(A,B).
% 1.86/2.08 ** KEPT (pick-wt=10): 14 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)| -subset(A,B).
% 1.86/2.08 ** KEPT (pick-wt=5): 16 [copy,15,factor_simp] -ordinal(A)|ordinal_subset(A,A).
% 1.86/2.08 ** KEPT (pick-wt=6): 17 [] -in(A,B)|element(A,B).
% 1.86/2.08 ** KEPT (pick-wt=13): 18 [] -ordinal(A)| -ordinal(B)|in(A,B)|A=B|in(B,A).
% 1.86/2.08 ** KEPT (pick-wt=3): 19 [] -ordinal_subset($c13,$c12).
% 1.86/2.08 ** KEPT (pick-wt=3): 20 [] -in($c12,$c13).
% 1.86/2.08 ** KEPT (pick-wt=8): 21 [] -element(A,B)|empty(B)|in(A,B).
% 1.86/2.08 ** KEPT (pick-wt=7): 22 [] -element(A,powerset(B))|subset(A,B).
% 1.86/2.08 ** KEPT (pick-wt=7): 23 [] element(A,powerset(B))| -subset(A,B).
% 1.86/2.08 ** KEPT (pick-wt=10): 24 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.86/2.08 ** KEPT (pick-wt=9): 25 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.86/2.08 ** KEPT (pick-wt=5): 26 [] -empty(A)|A=empty_set.
% 1.86/2.08 ** KEPT (pick-wt=5): 27 [] -in(A,B)| -empty(B).
% 1.86/2.08 ** KEPT (pick-wt=7): 28 [] -empty(A)|A=B| -empty(B).
% 1.86/2.08
% 1.86/2.08 ------------> process sos:
% 1.86/2.08 ** KEPT (pick-wt=3): 33 [] A=A.
% 1.86/2.08 ** KEPT (pick-wt=6): 34 [] epsilon_transitive(A)|in($f1(A),A).
% 1.86/2.08 ** KEPT (pick-wt=4): 35 [] element($f2(A),A).
% 1.86/2.08 ** KEPT (pick-wt=2): 36 [] empty(empty_set).
% 1.86/2.08 ** KEPT (pick-wt=2): 37 [] relation(empty_set).
% 1.86/2.08 ** KEPT (pick-wt=2): 38 [] relation_empty_yielding(empty_set).
% 1.86/2.08 Following clause subsumed by 36 during input processing: 0 [] empty(empty_set).
% 1.86/2.08 Following clause subsumed by 36 during input processing: 0 [] empty(empty_set).
% 1.86/2.08 Following clause subsumed by 37 during input processing: 0 [] relation(empty_set).
% 1.86/2.08 ** KEPT (pick-wt=2): 39 [] relation($c1).
% 1.86/2.08 ** KEPT (pick-wt=2): 40 [] function($c1).
% 1.86/2.08 ** KEPT (pick-wt=2): 41 [] epsilon_transitive($c2).
% 1.86/2.08 ** KEPT (pick-wt=2): 42 [] epsilon_connected($c2).
% 1.86/2.08 ** KEPT (pick-wt=2): 43 [] ordinal($c2).
% 1.86/2.08 ** KEPT (pick-wt=2): 44 [] empty($c3).
% 1.86/2.08 ** KEPT (pick-wt=2): 45 [] relation($c3).
% 1.86/2.08 ** KEPT (pick-wt=2): 46 [] empty($c4).
% 1.86/2.08 ** KEPT (pick-wt=2): 47 [] relation($c5).
% 1.86/2.08 ** KEPT (pick-wt=2): 48 [] empty($c5).
% 1.86/2.08 ** KEPT (pick-wt=2): 49 [] function($c5).
% 1.86/2.08 ** KEPT (pick-wt=2): 50 [] relation($c6).
% 1.86/2.08 ** KEPT (pick-wt=2): 51 [] relation($c8).
% 1.86/2.08 ** KEPT (pick-wt=2): 52 [] function($c8).
% 1.86/2.08 ** KEPT (pick-wt=2): 53 [] one_to_one($c8).
% 1.86/2.08 ** KEPT (pick-wt=2): 54 [] relation($c9).
% 1.86/2.08 ** KEPT (pick-wt=2): 55 [] relation_empty_yielding($c9).
% 1.92/2.11 ** KEPT (pick-wt=2): 56 [] relation($c10).
% 1.92/2.11 ** KEPT (pick-wt=2): 57 [] relation_empty_yielding($c10).
% 1.92/2.11 ** KEPT (pick-wt=2): 58 [] function($c10).
% 1.92/2.11 ** KEPT (pick-wt=2): 59 [] relation($c11).
% 1.92/2.11 ** KEPT (pick-wt=2): 60 [] relation_non_empty($c11).
% 1.92/2.11 ** KEPT (pick-wt=2): 61 [] function($c11).
% 1.92/2.11 ** KEPT (pick-wt=3): 62 [] subset(A,A).
% 1.92/2.11 ** KEPT (pick-wt=2): 63 [] ordinal($c13).
% 1.92/2.11 ** KEPT (pick-wt=2): 64 [] ordinal($c12).
% 1.92/2.11 Following clause subsumed by 33 during input processing: 0 [copy,33,flip.1] A=A.
% 1.92/2.11 33 back subsumes 32.
% 1.92/2.11 33 back subsumes 31.
% 1.92/2.11 62 back subsumes 30.
% 1.92/2.11
% 1.92/2.11 ======= end of input processing =======
% 1.92/2.11
% 1.92/2.11 =========== start of search ===========
% 1.92/2.11
% 1.92/2.11 -------- PROOF --------
% 1.92/2.11
% 1.92/2.11 -----> EMPTY CLAUSE at 0.03 sec ----> 472 [hyper,447,25,435,165] $F.
% 1.92/2.11
% 1.92/2.11 Length of proof is 10. Level of proof is 5.
% 1.92/2.11
% 1.92/2.11 ---------------- PROOF ----------------
% 1.92/2.11 % SZS status Theorem
% 1.92/2.11 % SZS output start Refutation
% See solution above
% 1.92/2.11 ------------ end of proof -------------
% 1.92/2.11
% 1.92/2.11
% 1.92/2.11 Search stopped by max_proofs option.
% 1.92/2.11
% 1.92/2.11
% 1.92/2.11 Search stopped by max_proofs option.
% 1.92/2.11
% 1.92/2.11 ============ end of search ============
% 1.92/2.11
% 1.92/2.11 -------------- statistics -------------
% 1.92/2.11 clauses given 100
% 1.92/2.11 clauses generated 1167
% 1.92/2.11 clauses kept 466
% 1.92/2.11 clauses forward subsumed 771
% 1.92/2.11 clauses back subsumed 48
% 1.92/2.11 Kbytes malloced 1953
% 1.92/2.11
% 1.92/2.11 ----------- times (seconds) -----------
% 1.92/2.11 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 1.92/2.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.11 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.92/2.11
% 1.92/2.11 That finishes the proof of the theorem.
% 1.92/2.11
% 1.92/2.11 Process 19526 finished Wed Jul 27 10:11:08 2022
% 1.92/2.11 Otter interrupted
% 1.92/2.11 PROOF FOUND
%------------------------------------------------------------------------------