%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU129+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n008.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:50 EDT 2022
% Result : Theorem 2.00s 2.17s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 10 ( 8 unt; 0 nHn; 5 RR)
% Number of literals : 14 ( 1 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(24,axiom,
( ~ subset(A,B)
| ~ subset(A,C)
| subset(A,set_intersection2(B,C)) ),
file('SEU129+2.p',unknown),
[] ).
cnf(25,axiom,
( ~ subset(A,B)
| ~ subset(B,C)
| subset(A,C) ),
file('SEU129+2.p',unknown),
[] ).
cnf(26,axiom,
~ subset(set_intersection2(dollar_c5,dollar_c3),set_intersection2(dollar_c4,dollar_c3)),
file('SEU129+2.p',unknown),
[] ).
cnf(50,axiom,
set_intersection2(A,B) = set_intersection2(B,A),
file('SEU129+2.p',unknown),
[] ).
cnf(63,axiom,
subset(set_intersection2(A,B),A),
file('SEU129+2.p',unknown),
[] ).
cnf(66,axiom,
subset(dollar_c5,dollar_c4),
file('SEU129+2.p',unknown),
[] ).
cnf(197,plain,
subset(set_intersection2(dollar_c5,A),dollar_c4),
inference(hyper,[status(thm)],[63,25,66]),
[iquote('hyper,63,25,66')] ).
cnf(204,plain,
subset(set_intersection2(A,B),B),
inference(para_into,[status(thm),theory(equality)],[63,50]),
[iquote('para_into,63.1.1,50.1.1')] ).
cnf(1573,plain,
subset(set_intersection2(dollar_c5,A),set_intersection2(dollar_c4,A)),
inference(hyper,[status(thm)],[204,24,197]),
[iquote('hyper,204,24,197')] ).
cnf(1574,plain,
$false,
inference(binary,[status(thm)],[1573,26]),
[iquote('binary,1573.1,26.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU129+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14 % Command : otter-tptp-script %s
% 0.15/0.35 % Computer : n008.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Wed Jul 27 07:53:38 EDT 2022
% 0.15/0.35 % CPUTime :
% 1.79/1.96 ----- Otter 3.3f, August 2004 -----
% 1.79/1.96 The process was started by sandbox on n008.cluster.edu,
% 1.79/1.96 Wed Jul 27 07:53:38 2022
% 1.79/1.96 The command was "./otter". The process ID is 26336.
% 1.79/1.96
% 1.79/1.96 set(prolog_style_variables).
% 1.79/1.96 set(auto).
% 1.79/1.96 dependent: set(auto1).
% 1.79/1.96 dependent: set(process_input).
% 1.79/1.96 dependent: clear(print_kept).
% 1.79/1.96 dependent: clear(print_new_demod).
% 1.79/1.96 dependent: clear(print_back_demod).
% 1.79/1.96 dependent: clear(print_back_sub).
% 1.79/1.96 dependent: set(control_memory).
% 1.79/1.96 dependent: assign(max_mem, 12000).
% 1.79/1.96 dependent: assign(pick_given_ratio, 4).
% 1.79/1.96 dependent: assign(stats_level, 1).
% 1.79/1.96 dependent: assign(max_seconds, 10800).
% 1.79/1.96 clear(print_given).
% 1.79/1.96
% 1.79/1.96 formula_list(usable).
% 1.79/1.96 all A (A=A).
% 1.79/1.96 all A B (in(A,B)-> -in(B,A)).
% 1.79/1.96 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.79/1.96 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.79/1.96 all A B (A=B<->subset(A,B)&subset(B,A)).
% 1.79/1.96 all A (A=empty_set<-> (all B (-in(B,A)))).
% 1.79/1.96 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 1.79/1.96 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.79/1.96 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 1.79/1.96 all A B (disjoint(A,B)<->set_intersection2(A,B)=empty_set).
% 1.79/1.96 $T.
% 1.79/1.96 $T.
% 1.79/1.96 $T.
% 1.79/1.96 empty(empty_set).
% 1.79/1.96 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 1.79/1.96 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 1.79/1.96 all A B (set_union2(A,A)=A).
% 1.79/1.96 all A B (set_intersection2(A,A)=A).
% 1.79/1.96 exists A empty(A).
% 1.79/1.96 exists A (-empty(A)).
% 1.79/1.96 all A B subset(A,A).
% 1.79/1.96 all A B (disjoint(A,B)->disjoint(B,A)).
% 1.79/1.96 all A B (subset(A,B)->set_union2(A,B)=B).
% 1.79/1.96 all A B subset(set_intersection2(A,B),A).
% 1.79/1.96 all A B C (subset(A,B)&subset(A,C)->subset(A,set_intersection2(B,C))).
% 1.79/1.96 all A (set_union2(A,empty_set)=A).
% 1.79/1.96 all A B C (subset(A,B)&subset(B,C)->subset(A,C)).
% 1.79/1.96 -(all A B C (subset(A,B)->subset(set_intersection2(A,C),set_intersection2(B,C)))).
% 1.79/1.96 all A (set_intersection2(A,empty_set)=empty_set).
% 1.79/1.96 all A subset(empty_set,A).
% 1.79/1.96 all A B (-(-disjoint(A,B)& (all C (-(in(C,A)&in(C,B)))))& -((exists C (in(C,A)&in(C,B)))&disjoint(A,B))).
% 1.79/1.96 all A (subset(A,empty_set)->A=empty_set).
% 1.79/1.96 all A B (-(-disjoint(A,B)& (all C (-in(C,set_intersection2(A,B)))))& -((exists C in(C,set_intersection2(A,B)))&disjoint(A,B))).
% 1.79/1.96 all A (empty(A)->A=empty_set).
% 1.79/1.96 all A B (-(in(A,B)&empty(B))).
% 1.79/1.96 all A B subset(A,set_union2(A,B)).
% 1.79/1.96 all A B (-(empty(A)&A!=B&empty(B))).
% 1.79/1.96 all A B C (subset(A,B)&subset(C,B)->subset(set_union2(A,C),B)).
% 1.79/1.96 end_of_list.
% 1.79/1.96
% 1.79/1.96 -------> usable clausifies to:
% 1.79/1.96
% 1.79/1.96 list(usable).
% 1.79/1.96 0 [] A=A.
% 1.79/1.96 0 [] -in(A,B)| -in(B,A).
% 1.79/1.96 0 [] set_union2(A,B)=set_union2(B,A).
% 1.79/1.96 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.79/1.96 0 [] A!=B|subset(A,B).
% 1.79/1.96 0 [] A!=B|subset(B,A).
% 1.79/1.96 0 [] A=B| -subset(A,B)| -subset(B,A).
% 1.79/1.96 0 [] A!=empty_set| -in(B,A).
% 1.79/1.96 0 [] A=empty_set|in($f1(A),A).
% 1.79/1.96 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 1.79/1.96 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 1.79/1.96 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 1.79/1.96 0 [] C=set_union2(A,B)|in($f2(A,B,C),C)|in($f2(A,B,C),A)|in($f2(A,B,C),B).
% 1.79/1.96 0 [] C=set_union2(A,B)| -in($f2(A,B,C),C)| -in($f2(A,B,C),A).
% 1.79/1.96 0 [] C=set_union2(A,B)| -in($f2(A,B,C),C)| -in($f2(A,B,C),B).
% 1.79/1.96 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.79/1.96 0 [] subset(A,B)|in($f3(A,B),A).
% 1.79/1.96 0 [] subset(A,B)| -in($f3(A,B),B).
% 1.79/1.96 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 1.79/1.96 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 1.79/1.96 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 1.79/1.96 0 [] C=set_intersection2(A,B)|in($f4(A,B,C),C)|in($f4(A,B,C),A).
% 1.79/1.96 0 [] C=set_intersection2(A,B)|in($f4(A,B,C),C)|in($f4(A,B,C),B).
% 1.79/1.96 0 [] C=set_intersection2(A,B)| -in($f4(A,B,C),C)| -in($f4(A,B,C),A)| -in($f4(A,B,C),B).
% 1.79/1.96 0 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 1.79/1.96 0 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 1.79/1.96 0 [] $T.
% 1.79/1.96 0 [] $T.
% 1.79/1.96 0 [] $T.
% 1.79/1.96 0 [] empty(empty_set).
% 1.79/1.96 0 [] empty(A)| -empty(set_union2(A,B)).
% 1.79/1.96 0 [] empty(A)| -empty(set_union2(B,A)).
% 1.79/1.96 0 [] set_union2(A,A)=A.
% 1.79/1.96 0 [] set_intersection2(A,A)=A.
% 1.79/1.96 0 [] empty($c1).
% 1.79/1.96 0 [] -empty($c2).
% 1.79/1.96 0 [] subset(A,A).
% 1.79/1.96 0 [] -disjoint(A,B)|disjoint(B,A).
% 1.79/1.96 0 [] -subset(A,B)|set_union2(A,B)=B.
% 1.79/1.96 0 [] subset(set_intersection2(A,B),A).
% 1.79/1.96 0 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 1.79/1.96 0 [] set_union2(A,empty_set)=A.
% 1.79/1.96 0 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 1.79/1.96 0 [] subset($c5,$c4).
% 1.79/1.96 0 [] -subset(set_intersection2($c5,$c3),set_intersection2($c4,$c3)).
% 1.79/1.96 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.79/1.96 0 [] subset(empty_set,A).
% 1.79/1.96 0 [] disjoint(A,B)|in($f5(A,B),A).
% 1.79/1.96 0 [] disjoint(A,B)|in($f5(A,B),B).
% 1.79/1.96 0 [] -in(C,A)| -in(C,B)| -disjoint(A,B).
% 1.79/1.96 0 [] -subset(A,empty_set)|A=empty_set.
% 1.79/1.96 0 [] disjoint(A,B)|in($f6(A,B),set_intersection2(A,B)).
% 1.79/1.96 0 [] -in(C,set_intersection2(A,B))| -disjoint(A,B).
% 1.79/1.96 0 [] -empty(A)|A=empty_set.
% 1.79/1.96 0 [] -in(A,B)| -empty(B).
% 1.79/1.96 0 [] subset(A,set_union2(A,B)).
% 1.79/1.96 0 [] -empty(A)|A=B| -empty(B).
% 1.79/1.96 0 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 1.79/1.96 end_of_list.
% 1.79/1.96
% 1.79/1.96 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.79/1.96
% 1.79/1.96 This ia a non-Horn set with equality. The strategy will be
% 1.79/1.96 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.79/1.96 deletion, with positive clauses in sos and nonpositive
% 1.79/1.96 clauses in usable.
% 1.79/1.96
% 1.79/1.96 dependent: set(knuth_bendix).
% 1.79/1.96 dependent: set(anl_eq).
% 1.79/1.96 dependent: set(para_from).
% 1.79/1.96 dependent: set(para_into).
% 1.79/1.96 dependent: clear(para_from_right).
% 1.79/1.96 dependent: clear(para_into_right).
% 1.79/1.96 dependent: set(para_from_vars).
% 1.79/1.96 dependent: set(eq_units_both_ways).
% 1.79/1.96 dependent: set(dynamic_demod_all).
% 1.79/1.96 dependent: set(dynamic_demod).
% 1.79/1.96 dependent: set(order_eq).
% 1.79/1.96 dependent: set(back_demod).
% 1.79/1.96 dependent: set(lrpo).
% 1.79/1.96 dependent: set(hyper_res).
% 1.79/1.96 dependent: set(unit_deletion).
% 1.79/1.96 dependent: set(factor).
% 1.79/1.96
% 1.79/1.96 ------------> process usable:
% 1.79/1.96 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.79/1.96 ** KEPT (pick-wt=6): 2 [] A!=B|subset(A,B).
% 1.79/1.96 ** KEPT (pick-wt=6): 3 [] A!=B|subset(B,A).
% 1.79/1.96 ** KEPT (pick-wt=9): 4 [] A=B| -subset(A,B)| -subset(B,A).
% 1.79/1.96 ** KEPT (pick-wt=6): 5 [] A!=empty_set| -in(B,A).
% 1.79/1.96 ** KEPT (pick-wt=14): 6 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 1.79/1.96 ** KEPT (pick-wt=11): 7 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 1.79/1.96 ** KEPT (pick-wt=11): 8 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 1.79/1.96 ** KEPT (pick-wt=17): 9 [] A=set_union2(B,C)| -in($f2(B,C,A),A)| -in($f2(B,C,A),B).
% 1.79/1.96 ** KEPT (pick-wt=17): 10 [] A=set_union2(B,C)| -in($f2(B,C,A),A)| -in($f2(B,C,A),C).
% 1.79/1.96 ** KEPT (pick-wt=9): 11 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.79/1.96 ** KEPT (pick-wt=8): 12 [] subset(A,B)| -in($f3(A,B),B).
% 1.79/1.96 ** KEPT (pick-wt=11): 13 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 1.79/1.96 ** KEPT (pick-wt=11): 14 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 1.79/1.96 ** KEPT (pick-wt=14): 15 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 1.79/1.96 ** KEPT (pick-wt=23): 16 [] A=set_intersection2(B,C)| -in($f4(B,C,A),A)| -in($f4(B,C,A),B)| -in($f4(B,C,A),C).
% 1.79/1.96 ** KEPT (pick-wt=8): 17 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 1.79/1.96 ** KEPT (pick-wt=8): 18 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 1.79/1.96 ** KEPT (pick-wt=6): 19 [] empty(A)| -empty(set_union2(A,B)).
% 1.79/1.96 ** KEPT (pick-wt=6): 20 [] empty(A)| -empty(set_union2(B,A)).
% 1.79/1.96 ** KEPT (pick-wt=2): 21 [] -empty($c2).
% 1.79/1.96 ** KEPT (pick-wt=6): 22 [] -disjoint(A,B)|disjoint(B,A).
% 1.79/1.96 ** KEPT (pick-wt=8): 23 [] -subset(A,B)|set_union2(A,B)=B.
% 1.79/1.96 ** KEPT (pick-wt=11): 24 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 1.79/1.96 ** KEPT (pick-wt=9): 25 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 1.79/1.96 ** KEPT (pick-wt=7): 26 [] -subset(set_intersection2($c5,$c3),set_intersection2($c4,$c3)).
% 1.79/1.96 ** KEPT (pick-wt=9): 27 [] -in(A,B)| -in(A,C)| -disjoint(B,C).
% 1.79/1.96 ** KEPT (pick-wt=6): 28 [] -subset(A,empty_set)|A=empty_set.
% 1.79/1.96 ** KEPT (pick-wt=8): 29 [] -in(A,set_intersection2(B,C))| -disjoint(B,C).
% 1.79/1.96 ** KEPT (pick-wt=5): 30 [] -empty(A)|A=empty_set.
% 1.79/1.96 ** KEPT (pick-wt=5): 31 [] -in(A,B)| -empty(B).
% 1.79/1.96 ** KEPT (pick-wt=7): 32 [] -empty(A)|A=B| -empty(B).
% 1.79/1.96 ** KEPT (pick-wt=11): 33 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 1.79/1.96
% 1.79/1.96 ------------> process sos:
% 1.79/1.96 ** KEPT (pick-wt=3): 48 [] A=A.
% 1.79/1.96 ** KEPT (pick-wt=7): 49 [] set_union2(A,B)=set_union2(B,A).
% 1.79/1.96 ** KEPT (pick-wt=7): 50 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.79/1.96 ** KEPT (pick-wt=7): 51 [] A=empty_set|in($f1(A),A).
% 1.79/1.96 ** KEPT (pick-wt=23): 52 [] A=set_union2(B,C)|in($f2(B,C,A),A)|in($f2(B,C,A),B)|in($f2(B,C,A),C).
% 1.79/1.96 ** KEPT (pick-wt=8): 53 [] subset(A,B)|in($f3(A,B),A).
% 1.79/1.96 ** KEPT (pick-wt=17): 54 [] A=set_intersection2(B,C)|in($f4(B,C,A),A)|in($f4(B,C,A),B).
% 1.79/1.96 ** KEPT (pick-wt=17): 55 [] A=set_intersection2(B,C)|in($f4(B,C,A),A)|in($f4(B,C,A),C).
% 2.00/2.17 ** KEPT (pick-wt=2): 56 [] empty(empty_set).
% 2.00/2.17 ** KEPT (pick-wt=5): 57 [] set_union2(A,A)=A.
% 2.00/2.17 ---> New Demodulator: 58 [new_demod,57] set_union2(A,A)=A.
% 2.00/2.17 ** KEPT (pick-wt=5): 59 [] set_intersection2(A,A)=A.
% 2.00/2.17 ---> New Demodulator: 60 [new_demod,59] set_intersection2(A,A)=A.
% 2.00/2.17 ** KEPT (pick-wt=2): 61 [] empty($c1).
% 2.00/2.17 ** KEPT (pick-wt=3): 62 [] subset(A,A).
% 2.00/2.17 ** KEPT (pick-wt=5): 63 [] subset(set_intersection2(A,B),A).
% 2.00/2.17 ** KEPT (pick-wt=5): 64 [] set_union2(A,empty_set)=A.
% 2.00/2.17 ---> New Demodulator: 65 [new_demod,64] set_union2(A,empty_set)=A.
% 2.00/2.17 ** KEPT (pick-wt=3): 66 [] subset($c5,$c4).
% 2.00/2.17 ** KEPT (pick-wt=5): 67 [] set_intersection2(A,empty_set)=empty_set.
% 2.00/2.17 ---> New Demodulator: 68 [new_demod,67] set_intersection2(A,empty_set)=empty_set.
% 2.00/2.17 ** KEPT (pick-wt=3): 69 [] subset(empty_set,A).
% 2.00/2.17 ** KEPT (pick-wt=8): 70 [] disjoint(A,B)|in($f5(A,B),A).
% 2.00/2.17 ** KEPT (pick-wt=8): 71 [] disjoint(A,B)|in($f5(A,B),B).
% 2.00/2.17 ** KEPT (pick-wt=10): 72 [] disjoint(A,B)|in($f6(A,B),set_intersection2(A,B)).
% 2.00/2.17 ** KEPT (pick-wt=5): 73 [] subset(A,set_union2(A,B)).
% 2.00/2.17 Following clause subsumed by 48 during input processing: 0 [copy,48,flip.1] A=A.
% 2.00/2.17 48 back subsumes 45.
% 2.00/2.17 48 back subsumes 35.
% 2.00/2.17 Following clause subsumed by 49 during input processing: 0 [copy,49,flip.1] set_union2(A,B)=set_union2(B,A).
% 2.00/2.17 Following clause subsumed by 50 during input processing: 0 [copy,50,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 2.00/2.17 >>>> Starting back demodulation with 58.
% 2.00/2.17 >> back demodulating 46 with 58.
% 2.00/2.17 >> back demodulating 36 with 58.
% 2.00/2.17 >>>> Starting back demodulation with 60.
% 2.00/2.17 >> back demodulating 47 with 60.
% 2.00/2.17 >> back demodulating 43 with 60.
% 2.00/2.17 >> back demodulating 42 with 60.
% 2.00/2.17 >> back demodulating 39 with 60.
% 2.00/2.17 >>>> Starting back demodulation with 65.
% 2.00/2.17 >>>> Starting back demodulation with 68.
% 2.00/2.17
% 2.00/2.17 ======= end of input processing =======
% 2.00/2.17
% 2.00/2.17 =========== start of search ===========
% 2.00/2.17
% 2.00/2.17 -------- PROOF --------
% 2.00/2.17
% 2.00/2.17 ----> UNIT CONFLICT at 0.21 sec ----> 1574 [binary,1573.1,26.1] $F.
% 2.00/2.17
% 2.00/2.17 Length of proof is 3. Level of proof is 2.
% 2.00/2.17
% 2.00/2.17 ---------------- PROOF ----------------
% 2.00/2.17 % SZS status Theorem
% 2.00/2.17 % SZS output start Refutation
% See solution above
% 2.00/2.17 ------------ end of proof -------------
% 2.00/2.17
% 2.00/2.17
% 2.00/2.17 Search stopped by max_proofs option.
% 2.00/2.17
% 2.00/2.17
% 2.00/2.17 Search stopped by max_proofs option.
% 2.00/2.17
% 2.00/2.17 ============ end of search ============
% 2.00/2.17
% 2.00/2.17 -------------- statistics -------------
% 2.00/2.17 clauses given 35
% 2.00/2.17 clauses generated 3280
% 2.00/2.17 clauses kept 1555
% 2.00/2.17 clauses forward subsumed 1841
% 2.00/2.17 clauses back subsumed 19
% 2.00/2.17 Kbytes malloced 3906
% 2.00/2.17
% 2.00/2.17 ----------- times (seconds) -----------
% 2.00/2.17 user CPU time 0.21 (0 hr, 0 min, 0 sec)
% 2.00/2.17 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.00/2.17 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.00/2.17
% 2.00/2.17 That finishes the proof of the theorem.
% 2.00/2.17
% 2.00/2.17 Process 26336 finished Wed Jul 27 07:53:40 2022
% 2.00/2.17 Otter interrupted
% 2.00/2.17 PROOF FOUND
%------------------------------------------------------------------------------