TSTP Solution File: SEU107+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU107+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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:14:47 EDT 2022
% Result : Theorem 1.80s 2.02s
% Output : Refutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 23 ( 15 unt; 5 nHn; 20 RR)
% Number of literals : 43 ( 9 equ; 18 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
( empty(A)
| ~ preboolean(A)
| ~ element(B,A)
| ~ element(C,A)
| element(prebool_difference(A,B,C),A) ),
file('SEU107+1.p',unknown),
[] ).
cnf(16,axiom,
( empty(A)
| ~ preboolean(A)
| ~ element(B,A)
| ~ element(C,A)
| prebool_difference(A,B,C) = set_difference(B,C) ),
file('SEU107+1.p',unknown),
[] ).
cnf(17,axiom,
~ empty(dollar_c5),
file('SEU107+1.p',unknown),
[] ).
cnf(18,axiom,
~ in(empty_set,dollar_c5),
file('SEU107+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ element(A,B)
| empty(B)
| in(A,B) ),
file('SEU107+1.p',unknown),
[] ).
cnf(22,axiom,
( set_difference(A,B) = empty_set
| ~ subset(A,B) ),
file('SEU107+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ empty(A)
| A = B
| ~ empty(B) ),
file('SEU107+1.p',unknown),
[] ).
cnf(31,plain,
( empty(A)
| ~ preboolean(A)
| ~ element(B,A)
| element(prebool_difference(A,B,B),A) ),
inference(factor,[status(thm)],[7]),
[iquote('factor,7.3.4')] ).
cnf(32,plain,
( empty(A)
| ~ preboolean(A)
| ~ element(B,A)
| prebool_difference(A,B,B) = set_difference(B,B) ),
inference(factor,[status(thm)],[16]),
[iquote('factor,16.3.4')] ).
cnf(35,axiom,
element(dollar_f1(A),A),
file('SEU107+1.p',unknown),
[] ).
cnf(36,axiom,
empty(empty_set),
file('SEU107+1.p',unknown),
[] ).
cnf(43,axiom,
empty(dollar_c3),
file('SEU107+1.p',unknown),
[] ).
cnf(60,axiom,
subset(A,A),
file('SEU107+1.p',unknown),
[] ).
cnf(61,axiom,
preboolean(dollar_c5),
file('SEU107+1.p',unknown),
[] ).
cnf(77,plain,
empty_set = dollar_c3,
inference(hyper,[status(thm)],[43,29,36]),
[iquote('hyper,43,29,36')] ).
cnf(85,plain,
( set_difference(A,B) = dollar_c3
| ~ subset(A,B) ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[22]),77]),
[iquote('back_demod,22,demod,77')] ).
cnf(87,plain,
~ in(dollar_c3,dollar_c5),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[18]),77]),
[iquote('back_demod,18,demod,77')] ).
cnf(88,plain,
set_difference(dollar_f1(dollar_c5),dollar_f1(dollar_c5)) = prebool_difference(dollar_c5,dollar_f1(dollar_c5),dollar_f1(dollar_c5)),
inference(flip,[status(thm),theory(equality)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[61,32,35]),17])]),
[iquote('hyper,61,32,35,unit_del,17,flip.1')] ).
cnf(90,plain,
element(prebool_difference(dollar_c5,dollar_f1(dollar_c5),dollar_f1(dollar_c5)),dollar_c5),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[61,31,35]),17]),
[iquote('hyper,61,31,35,unit_del,17')] ).
cnf(318,plain,
set_difference(A,A) = dollar_c3,
inference(hyper,[status(thm)],[85,60]),
[iquote('hyper,85,60')] ).
cnf(322,plain,
prebool_difference(dollar_c5,dollar_f1(dollar_c5),dollar_f1(dollar_c5)) = dollar_c3,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[88]),318])]),
[iquote('back_demod,88,demod,318,flip.1')] ).
cnf(327,plain,
element(dollar_c3,dollar_c5),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[90]),322]),
[iquote('back_demod,90,demod,322')] ).
cnf(342,plain,
$false,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[327,20]),17,87]),
[iquote('hyper,327,20,unit_del,17,87')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SEU107+1 : TPTP v8.1.0. Released v3.2.0.
% 0.02/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 07:48:35 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.80/2.01 ----- Otter 3.3f, August 2004 -----
% 1.80/2.01 The process was started by sandbox on n012.cluster.edu,
% 1.80/2.01 Wed Jul 27 07:48:35 2022
% 1.80/2.01 The command was "./otter". The process ID is 11151.
% 1.80/2.01
% 1.80/2.01 set(prolog_style_variables).
% 1.80/2.01 set(auto).
% 1.80/2.01 dependent: set(auto1).
% 1.80/2.01 dependent: set(process_input).
% 1.80/2.01 dependent: clear(print_kept).
% 1.80/2.01 dependent: clear(print_new_demod).
% 1.80/2.01 dependent: clear(print_back_demod).
% 1.80/2.01 dependent: clear(print_back_sub).
% 1.80/2.01 dependent: set(control_memory).
% 1.80/2.01 dependent: assign(max_mem, 12000).
% 1.80/2.01 dependent: assign(pick_given_ratio, 4).
% 1.80/2.01 dependent: assign(stats_level, 1).
% 1.80/2.01 dependent: assign(max_seconds, 10800).
% 1.80/2.01 clear(print_given).
% 1.80/2.01
% 1.80/2.01 formula_list(usable).
% 1.80/2.01 all A (A=A).
% 1.80/2.01 all A B (in(A,B)-> -in(B,A)).
% 1.80/2.01 all A (empty(A)->finite(A)).
% 1.80/2.01 all A (preboolean(A)->cup_closed(A)&diff_closed(A)).
% 1.80/2.01 all A (finite(A)-> (all B (element(B,powerset(A))->finite(B)))).
% 1.80/2.01 all A (cup_closed(A)&diff_closed(A)->preboolean(A)).
% 1.80/2.01 all A B C (-empty(A)&preboolean(A)&element(B,A)&element(C,A)->element(prebool_difference(A,B,C),A)).
% 1.80/2.01 all A exists B element(B,A).
% 1.80/2.01 all A B (finite(A)->finite(set_difference(A,B))).
% 1.80/2.01 all A (-empty(powerset(A))).
% 1.80/2.01 empty(empty_set).
% 1.80/2.01 exists A (-empty(A)&finite(A)).
% 1.80/2.01 exists A (-empty(A)&cup_closed(A)&cap_closed(A)&diff_closed(A)&preboolean(A)).
% 1.80/2.01 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.80/2.01 exists A empty(A).
% 1.80/2.01 all A exists B (element(B,powerset(A))&empty(B)&relation(B)&function(B)&one_to_one(B)&epsilon_transitive(B)&epsilon_connected(B)&ordinal(B)&natural(B)&finite(B)).
% 1.80/2.01 all A exists B (element(B,powerset(A))&empty(B)).
% 1.80/2.01 exists A (-empty(A)).
% 1.80/2.01 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 1.80/2.01 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 1.80/2.01 all A B C (-empty(A)&preboolean(A)&element(B,A)&element(C,A)->prebool_difference(A,B,C)=set_difference(B,C)).
% 1.80/2.01 all A B subset(A,A).
% 1.80/2.01 -(all A (-empty(A)&preboolean(A)->in(empty_set,A))).
% 1.80/2.01 all A B (in(A,B)->element(A,B)).
% 1.80/2.01 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.80/2.01 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 1.80/2.01 all A (set_difference(A,empty_set)=A).
% 1.80/2.01 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.80/2.01 all A (set_difference(empty_set,A)=empty_set).
% 1.80/2.01 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.80/2.01 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.80/2.01 all A (empty(A)->A=empty_set).
% 1.80/2.01 all A B (-(in(A,B)&empty(B))).
% 1.80/2.01 all A B (-(empty(A)&A!=B&empty(B))).
% 1.80/2.01 end_of_list.
% 1.80/2.01
% 1.80/2.01 -------> usable clausifies to:
% 1.80/2.01
% 1.80/2.01 list(usable).
% 1.80/2.01 0 [] A=A.
% 1.80/2.01 0 [] -in(A,B)| -in(B,A).
% 1.80/2.01 0 [] -empty(A)|finite(A).
% 1.80/2.01 0 [] -preboolean(A)|cup_closed(A).
% 1.80/2.01 0 [] -preboolean(A)|diff_closed(A).
% 1.80/2.01 0 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 1.80/2.01 0 [] -cup_closed(A)| -diff_closed(A)|preboolean(A).
% 1.80/2.01 0 [] empty(A)| -preboolean(A)| -element(B,A)| -element(C,A)|element(prebool_difference(A,B,C),A).
% 1.80/2.01 0 [] element($f1(A),A).
% 1.80/2.01 0 [] -finite(A)|finite(set_difference(A,B)).
% 1.80/2.01 0 [] -empty(powerset(A)).
% 1.80/2.01 0 [] empty(empty_set).
% 1.80/2.01 0 [] -empty($c1).
% 1.80/2.01 0 [] finite($c1).
% 1.80/2.01 0 [] -empty($c2).
% 1.80/2.01 0 [] cup_closed($c2).
% 1.80/2.01 0 [] cap_closed($c2).
% 1.80/2.01 0 [] diff_closed($c2).
% 1.80/2.01 0 [] preboolean($c2).
% 1.80/2.01 0 [] empty(A)|element($f2(A),powerset(A)).
% 1.80/2.01 0 [] empty(A)| -empty($f2(A)).
% 1.80/2.01 0 [] empty($c3).
% 1.80/2.01 0 [] element($f3(A),powerset(A)).
% 1.80/2.01 0 [] empty($f3(A)).
% 1.80/2.01 0 [] relation($f3(A)).
% 1.80/2.01 0 [] function($f3(A)).
% 1.80/2.01 0 [] one_to_one($f3(A)).
% 1.80/2.01 0 [] epsilon_transitive($f3(A)).
% 1.80/2.01 0 [] epsilon_connected($f3(A)).
% 1.80/2.01 0 [] ordinal($f3(A)).
% 1.80/2.01 0 [] natural($f3(A)).
% 1.80/2.01 0 [] finite($f3(A)).
% 1.80/2.01 0 [] element($f4(A),powerset(A)).
% 1.80/2.01 0 [] empty($f4(A)).
% 1.80/2.01 0 [] -empty($c4).
% 1.80/2.01 0 [] empty(A)|element($f5(A),powerset(A)).
% 1.80/2.01 0 [] empty(A)| -empty($f5(A)).
% 1.80/2.01 0 [] empty(A)|finite($f5(A)).
% 1.80/2.01 0 [] empty(A)|element($f6(A),powerset(A)).
% 1.80/2.01 0 [] empty(A)| -empty($f6(A)).
% 1.80/2.01 0 [] empty(A)|finite($f6(A)).
% 1.80/2.01 0 [] empty(A)| -preboolean(A)| -element(B,A)| -element(C,A)|prebool_difference(A,B,C)=set_difference(B,C).
% 1.80/2.01 0 [] subset(A,A).
% 1.80/2.01 0 [] -empty($c5).
% 1.80/2.01 0 [] preboolean($c5).
% 1.80/2.01 0 [] -in(empty_set,$c5).
% 1.80/2.01 0 [] -in(A,B)|element(A,B).
% 1.80/2.01 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.80/2.01 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.80/2.01 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.80/2.01 0 [] set_difference(A,empty_set)=A.
% 1.80/2.01 0 [] -element(A,powerset(B))|subset(A,B).
% 1.80/2.01 0 [] element(A,powerset(B))| -subset(A,B).
% 1.80/2.01 0 [] set_difference(empty_set,A)=empty_set.
% 1.80/2.01 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.80/2.01 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.80/2.01 0 [] -empty(A)|A=empty_set.
% 1.80/2.01 0 [] -in(A,B)| -empty(B).
% 1.80/2.01 0 [] -empty(A)|A=B| -empty(B).
% 1.80/2.01 end_of_list.
% 1.80/2.01
% 1.80/2.01 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.80/2.01
% 1.80/2.01 This ia a non-Horn set with equality. The strategy will be
% 1.80/2.01 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.80/2.01 deletion, with positive clauses in sos and nonpositive
% 1.80/2.01 clauses in usable.
% 1.80/2.01
% 1.80/2.01 dependent: set(knuth_bendix).
% 1.80/2.01 dependent: set(anl_eq).
% 1.80/2.01 dependent: set(para_from).
% 1.80/2.01 dependent: set(para_into).
% 1.80/2.01 dependent: clear(para_from_right).
% 1.80/2.01 dependent: clear(para_into_right).
% 1.80/2.01 dependent: set(para_from_vars).
% 1.80/2.01 dependent: set(eq_units_both_ways).
% 1.80/2.01 dependent: set(dynamic_demod_all).
% 1.80/2.01 dependent: set(dynamic_demod).
% 1.80/2.01 dependent: set(order_eq).
% 1.80/2.01 dependent: set(back_demod).
% 1.80/2.01 dependent: set(lrpo).
% 1.80/2.01 dependent: set(hyper_res).
% 1.80/2.01 dependent: set(unit_deletion).
% 1.80/2.01 dependent: set(factor).
% 1.80/2.01
% 1.80/2.01 ------------> process usable:
% 1.80/2.01 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.80/2.01 ** KEPT (pick-wt=4): 2 [] -empty(A)|finite(A).
% 1.80/2.01 ** KEPT (pick-wt=4): 3 [] -preboolean(A)|cup_closed(A).
% 1.80/2.01 ** KEPT (pick-wt=4): 4 [] -preboolean(A)|diff_closed(A).
% 1.80/2.01 ** KEPT (pick-wt=8): 5 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 1.80/2.01 ** KEPT (pick-wt=6): 6 [] -cup_closed(A)| -diff_closed(A)|preboolean(A).
% 1.80/2.01 ** KEPT (pick-wt=16): 7 [] empty(A)| -preboolean(A)| -element(B,A)| -element(C,A)|element(prebool_difference(A,B,C),A).
% 1.80/2.01 ** KEPT (pick-wt=6): 8 [] -finite(A)|finite(set_difference(A,B)).
% 1.80/2.01 ** KEPT (pick-wt=3): 9 [] -empty(powerset(A)).
% 1.80/2.01 ** KEPT (pick-wt=2): 10 [] -empty($c1).
% 1.80/2.01 ** KEPT (pick-wt=2): 11 [] -empty($c2).
% 1.80/2.01 ** KEPT (pick-wt=5): 12 [] empty(A)| -empty($f2(A)).
% 1.80/2.01 ** KEPT (pick-wt=2): 13 [] -empty($c4).
% 1.80/2.01 ** KEPT (pick-wt=5): 14 [] empty(A)| -empty($f5(A)).
% 1.80/2.01 ** KEPT (pick-wt=5): 15 [] empty(A)| -empty($f6(A)).
% 1.80/2.01 ** KEPT (pick-wt=18): 16 [] empty(A)| -preboolean(A)| -element(B,A)| -element(C,A)|prebool_difference(A,B,C)=set_difference(B,C).
% 1.80/2.01 ** KEPT (pick-wt=2): 17 [] -empty($c5).
% 1.80/2.01 ** KEPT (pick-wt=3): 18 [] -in(empty_set,$c5).
% 1.80/2.01 ** KEPT (pick-wt=6): 19 [] -in(A,B)|element(A,B).
% 1.80/2.01 ** KEPT (pick-wt=8): 20 [] -element(A,B)|empty(B)|in(A,B).
% 1.80/2.01 ** KEPT (pick-wt=8): 21 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.80/2.01 ** KEPT (pick-wt=8): 22 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.80/2.01 ** KEPT (pick-wt=7): 23 [] -element(A,powerset(B))|subset(A,B).
% 1.80/2.01 ** KEPT (pick-wt=7): 24 [] element(A,powerset(B))| -subset(A,B).
% 1.80/2.01 ** KEPT (pick-wt=10): 25 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.80/2.01 ** KEPT (pick-wt=9): 26 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.80/2.01 ** KEPT (pick-wt=5): 27 [] -empty(A)|A=empty_set.
% 1.80/2.01 ** KEPT (pick-wt=5): 28 [] -in(A,B)| -empty(B).
% 1.80/2.01 ** KEPT (pick-wt=7): 29 [] -empty(A)|A=B| -empty(B).
% 1.80/2.01
% 1.80/2.01 ------------> process sos:
% 1.80/2.01 ** KEPT (pick-wt=3): 34 [] A=A.
% 1.80/2.01 ** KEPT (pick-wt=4): 35 [] element($f1(A),A).
% 1.80/2.01 ** KEPT (pick-wt=2): 36 [] empty(empty_set).
% 1.80/2.01 ** KEPT (pick-wt=2): 37 [] finite($c1).
% 1.80/2.01 ** KEPT (pick-wt=2): 38 [] cup_closed($c2).
% 1.80/2.01 ** KEPT (pick-wt=2): 39 [] cap_closed($c2).
% 1.80/2.01 ** KEPT (pick-wt=2): 40 [] diff_closed($c2).
% 1.80/2.01 ** KEPT (pick-wt=2): 41 [] preboolean($c2).
% 1.80/2.01 ** KEPT (pick-wt=7): 42 [] empty(A)|element($f2(A),powerset(A)).
% 1.80/2.01 ** KEPT (pick-wt=2): 43 [] empty($c3).
% 1.80/2.01 ** KEPT (pick-wt=5): 44 [] element($f3(A),powerset(A)).
% 1.80/2.01 ** KEPT (pick-wt=3): 45 [] empty($f3(A)).
% 1.80/2.01 ** KEPT (pick-wt=3): 46 [] relation($f3(A)).
% 1.80/2.01 ** KEPT (pick-wt=3): 47 [] function($f3(A)).
% 1.80/2.01 ** KEPT (pick-wt=3): 48 [] one_to_one($f3(A)).
% 1.80/2.01 ** KEPT (pick-wt=3): 49 [] epsilon_transitive($f3(A)).
% 1.80/2.01 ** KEPT (pick-wt=3): 50 [] epsilon_connected($f3(A)).
% 1.80/2.01 ** KEPT (pick-wt=3): 51 [] ordinal($f3(A)).
% 1.80/2.01 ** KEPT (pick-wt=3): 52 [] natural($f3(A)).
% 1.80/2.01 ** KEPT (pick-wt=3): 53 [] finite($f3(A)).
% 1.80/2.01 ** KEPT (pick-wt=5): 54 [] element($f4(A),powerset(A)).
% 1.80/2.01 ** KEPT (pick-wt=3): 55 [] empty($f4(A)).
% 1.80/2.01 ** KEPT (pick-wt=7): 56 [] empty(A)|element($f5(A),powerset(A)).
% 1.80/2.01 ** KEPT (pick-wt=5): 57 [] empty(A)|finite($f5(A)).
% 1.80/2.01 ** KEPT (pick-wt=7): 58 [] empty(A)|element($f6(A),powerset(A)).
% 1.80/2.01 ** KEPT (pick-wt=5): 59 [] empty(A)|finite($f6(A)).
% 1.80/2.02 ** KEPT (pick-wt=3): 60 [] subset(A,A).
% 1.80/2.02 ** KEPT (pick-wt=2): 61 [] preboolean($c5).
% 1.80/2.02 ** KEPT (pick-wt=5): 62 [] set_difference(A,empty_set)=A.
% 1.80/2.02 ---> New Demodulator: 63 [new_demod,62] set_difference(A,empty_set)=A.
% 1.80/2.02 ** KEPT (pick-wt=5): 64 [] set_difference(empty_set,A)=empty_set.
% 1.80/2.02 ---> New Demodulator: 65 [new_demod,64] set_difference(empty_set,A)=empty_set.
% 1.80/2.02 Following clause subsumed by 34 during input processing: 0 [copy,34,flip.1] A=A.
% 1.80/2.02 34 back subsumes 33.
% 1.80/2.02 >>>> Starting back demodulation with 63.
% 1.80/2.02 >>>> Starting back demodulation with 65.
% 1.80/2.02
% 1.80/2.02 ======= end of input processing =======
% 1.80/2.02
% 1.80/2.02 =========== start of search ===========
% 1.80/2.02
% 1.80/2.02 -------- PROOF --------
% 1.80/2.02
% 1.80/2.02 -----> EMPTY CLAUSE at 0.01 sec ----> 342 [hyper,327,20,unit_del,17,87] $F.
% 1.80/2.02
% 1.80/2.02 Length of proof is 10. Level of proof is 5.
% 1.80/2.02
% 1.80/2.02 ---------------- PROOF ----------------
% 1.80/2.02 % SZS status Theorem
% 1.80/2.02 % SZS output start Refutation
% See solution above
% 1.80/2.02 ------------ end of proof -------------
% 1.80/2.02
% 1.80/2.02
% 1.80/2.02 Search stopped by max_proofs option.
% 1.80/2.02
% 1.80/2.02
% 1.80/2.02 Search stopped by max_proofs option.
% 1.80/2.02
% 1.80/2.02 ============ end of search ============
% 1.80/2.02
% 1.80/2.02 -------------- statistics -------------
% 1.80/2.02 clauses given 77
% 1.80/2.02 clauses generated 651
% 1.80/2.02 clauses kept 315
% 1.80/2.02 clauses forward subsumed 445
% 1.80/2.02 clauses back subsumed 5
% 1.80/2.02 Kbytes malloced 1953
% 1.80/2.02
% 1.80/2.02 ----------- times (seconds) -----------
% 1.80/2.02 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.80/2.02 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.80/2.02 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.80/2.02
% 1.80/2.02 That finishes the proof of the theorem.
% 1.80/2.02
% 1.80/2.02 Process 11151 finished Wed Jul 27 07:48:37 2022
% 1.80/2.02 Otter interrupted
% 1.80/2.02 PROOF FOUND
%------------------------------------------------------------------------------