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