TSTP Solution File: GEO001-3 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : GEO001-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n004.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 12:54:03 EDT 2022

% Result   : Unsatisfiable 4.40s 4.62s
% Output   : Refutation 4.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   21 (  12 unt;   0 nHn;  13 RR)
%            Number of literals    :   32 (  17 equ;  13 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-5 aty)
%            Number of variables   :   39 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(4,axiom,
    ( ~ between(A,B,A)
    | A = B ),
    file('GEO001-3.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ between(A,B,C)
    | ~ between(D,E,C)
    | between(B,inner_pasch(A,B,C,E,D),D) ),
    file('GEO001-3.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ between(A,B,C)
    | ~ between(D,E,C)
    | between(E,inner_pasch(A,B,C,E,D),A) ),
    file('GEO001-3.p',unknown),
    [] ).

cnf(25,axiom,
    ( A != B
    | B = reflection(A,B) ),
    file('GEO001-3.p',unknown),
    [] ).

cnf(26,plain,
    ( A != B
    | reflection(A,B) = B ),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[25])]),
    [iquote('copy,25,flip.2')] ).

cnf(35,axiom,
    ~ between(c,b,a),
    file('GEO001-3.p',unknown),
    [] ).

cnf(59,axiom,
    reflection(A,B) = extension(A,B,A,B),
    file('GEO001-3.p',unknown),
    [] ).

cnf(61,axiom,
    A = extension(B,A,C,C),
    file('GEO001-3.p',unknown),
    [] ).

cnf(63,plain,
    extension(A,B,C,C) = B,
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[61])]),
    [iquote('copy,61,flip.1')] ).

cnf(68,axiom,
    A = reflection(reflection(A,B),B),
    file('GEO001-3.p',unknown),
    [] ).

cnf(69,plain,
    extension(extension(A,B,A,B),B,extension(A,B,A,B),B) = A,
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[68]),59,59])]),
    [iquote('copy,68,demod,59,59,flip.1')] ).

cnf(71,axiom,
    between(A,B,B),
    file('GEO001-3.p',unknown),
    [] ).

cnf(72,axiom,
    between(a,b,c),
    file('GEO001-3.p',unknown),
    [] ).

cnf(74,plain,
    ( A != B
    | extension(A,B,A,B) = B ),
    inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[26]),59]),
    [iquote('back_demod,26,demod,59')] ).

cnf(95,plain,
    between(b,inner_pasch(A,c,c,b,a),A),
    inference(hyper,[status(thm)],[72,6,71]),
    [iquote('hyper,72,6,71')] ).

cnf(97,plain,
    between(c,inner_pasch(A,c,c,b,a),a),
    inference(hyper,[status(thm)],[72,5,71]),
    [iquote('hyper,72,5,71')] ).

cnf(211,plain,
    ( A = B
    | ~ between(B,A,B) ),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[63,4]),63,63]),
    [iquote('para_into,62.1.1,4.2.1,demod,63,63')] ).

cnf(1918,plain,
    ( A = B
    | B != A ),
    inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[74,69]),63]),
    [iquote('para_from,74.2.1,69.1.1.3,demod,63')] ).

cnf(1963,plain,
    ( ~ between(c,A,a)
    | A != b ),
    inference(para_from,[status(thm),theory(equality)],[1918,35]),
    [iquote('para_from,1918.1.1,35.1.2')] ).

cnf(2282,plain,
    inner_pasch(b,c,c,b,a) = b,
    inference(hyper,[status(thm)],[95,211]),
    [iquote('hyper,95,211')] ).

cnf(2303,plain,
    $false,
    inference(hyper,[status(thm)],[2282,1963,97]),
    [iquote('hyper,2282,1963,97')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : GEO001-3 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.13  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n004.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 07:10:06 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.86/2.06  ----- Otter 3.3f, August 2004 -----
% 1.86/2.06  The process was started by sandbox2 on n004.cluster.edu,
% 1.86/2.06  Wed Jul 27 07:10:06 2022
% 1.86/2.06  The command was "./otter".  The process ID is 31849.
% 1.86/2.06  
% 1.86/2.06  set(prolog_style_variables).
% 1.86/2.06  set(auto).
% 1.86/2.06     dependent: set(auto1).
% 1.86/2.06     dependent: set(process_input).
% 1.86/2.06     dependent: clear(print_kept).
% 1.86/2.06     dependent: clear(print_new_demod).
% 1.86/2.06     dependent: clear(print_back_demod).
% 1.86/2.06     dependent: clear(print_back_sub).
% 1.86/2.06     dependent: set(control_memory).
% 1.86/2.06     dependent: assign(max_mem, 12000).
% 1.86/2.06     dependent: assign(pick_given_ratio, 4).
% 1.86/2.06     dependent: assign(stats_level, 1).
% 1.86/2.06     dependent: assign(max_seconds, 10800).
% 1.86/2.06  clear(print_given).
% 1.86/2.06  
% 1.86/2.06  list(usable).
% 1.86/2.06  0 [] A=A.
% 1.86/2.06  0 [] e_quidistant(X,Y,Y,X).
% 1.86/2.06  0 [] -e_quidistant(X,Y,Z,V)| -e_quidistant(X,Y,V2,W)|e_quidistant(Z,V,V2,W).
% 1.86/2.06  0 [] -e_quidistant(X,Y,Z,Z)|X=Y.
% 1.86/2.06  0 [] between(X,Y,extension(X,Y,W,V)).
% 1.86/2.06  0 [] e_quidistant(Y,extension(X,Y,W,V),W,V).
% 1.86/2.06  0 [] -e_quidistant(X,Y,X1,Y1)| -e_quidistant(Y,Z,Y1,Z1)| -e_quidistant(X,V,X1,V1)| -e_quidistant(Y,V,Y1,V1)| -between(X,Y,Z)| -between(X1,Y1,Z1)|X=Y|e_quidistant(Z,V,Z1,V1).
% 1.86/2.06  0 [] -between(X,Y,X)|X=Y.
% 1.86/2.06  0 [] -between(U,V,W)| -between(Y,X,W)|between(V,inner_pasch(U,V,W,X,Y),Y).
% 1.86/2.06  0 [] -between(U,V,W)| -between(Y,X,W)|between(X,inner_pasch(U,V,W,X,Y),U).
% 1.86/2.06  0 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.86/2.06  0 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.86/2.06  0 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.86/2.06  0 [] -e_quidistant(X,W,X,V)| -e_quidistant(Y,W,Y,V)| -e_quidistant(Z,W,Z,V)|between(X,Y,Z)|between(Y,Z,X)|between(Z,X,Y)|W=V.
% 1.86/2.06  0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(U,V,euclid1(U,V,W,X,Y)).
% 1.86/2.06  0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(U,X,euclid2(U,V,W,X,Y)).
% 1.86/2.06  0 [] -between(U,W,Y)| -between(V,W,X)|U=W|between(euclid1(U,V,W,X,Y),Y,euclid2(U,V,W,X,Y)).
% 1.86/2.06  0 [] -e_quidistant(U,V,U,V1)| -e_quidistant(U,X,U,X1)| -between(U,V,X)| -between(V,W,X)|between(V1,continuous(U,V,V1,W,X,X1),X1).
% 1.86/2.06  0 [] -e_quidistant(U,V,U,V1)| -e_quidistant(U,X,U,X1)| -between(U,V,X)| -between(V,W,X)|e_quidistant(U,W,U,continuous(U,V,V1,W,X,X1)).
% 1.86/2.06  0 [] reflection(U,V)=extension(U,V,U,V).
% 1.86/2.06  0 [] e_quidistant(U,V,U,V).
% 1.86/2.06  0 [] -e_quidistant(U,V,W,X)|e_quidistant(W,X,U,V).
% 1.86/2.06  0 [] -e_quidistant(U,V,W,X)|e_quidistant(V,U,W,X).
% 1.86/2.06  0 [] -e_quidistant(U,V,W,X)|e_quidistant(U,V,X,W).
% 1.86/2.06  0 [] -e_quidistant(U,V,W,X)|e_quidistant(V,U,X,W).
% 1.86/2.06  0 [] -e_quidistant(U,V,W,X)|e_quidistant(W,X,V,U).
% 1.86/2.06  0 [] -e_quidistant(U,V,W,X)|e_quidistant(X,W,U,V).
% 1.86/2.06  0 [] -e_quidistant(U,V,W,X)|e_quidistant(X,W,V,U).
% 1.86/2.06  0 [] -e_quidistant(U,V,W,X)| -e_quidistant(W,X,Y,Z)|e_quidistant(U,V,Y,Z).
% 1.86/2.06  0 [] V=extension(U,V,W,W).
% 1.86/2.06  0 [] Y!=extension(U,V,W,X)|between(U,V,Y).
% 1.86/2.06  0 [] between(U,V,reflection(U,V)).
% 1.86/2.06  0 [] e_quidistant(V,reflection(U,V),U,V).
% 1.86/2.06  0 [] U!=V|V=reflection(U,V).
% 1.86/2.06  0 [] U=reflection(U,U).
% 1.86/2.06  0 [] V!=reflection(U,V)|U=V.
% 1.86/2.06  0 [] e_quidistant(U,U,V,V).
% 1.86/2.06  0 [] -e_quidistant(U,V,U1,V1)| -e_quidistant(V,W,V1,W1)| -between(U,V,W)| -between(U1,V1,W1)|e_quidistant(U,W,U1,W1).
% 1.86/2.06  0 [] -between(U,V,W)| -between(U,V,X)| -e_quidistant(V,W,V,X)|U=V|W=X.
% 1.86/2.06  0 [] -between(U,V,W)|U=V|W=extension(U,V,V,W).
% 1.86/2.06  0 [] -e_quidistant(W,X,Y,Z)|extension(U,V,W,X)=extension(U,V,Y,Z)|U=V.
% 1.86/2.06  0 [] extension(U,V,U,V)=extension(U,V,V,U)|U=V.
% 1.86/2.06  0 [] e_quidistant(V,U,V,reflection(reflection(U,V),V)).
% 1.86/2.06  0 [] U=reflection(reflection(U,V),V).
% 1.86/2.06  0 [] between(U,V,V).
% 1.86/2.06  0 [] -between(U,W,X)|U!=X|between(V,W,X).
% 1.86/2.06  0 [] between(a,b,c).
% 1.86/2.06  0 [] -between(c,b,a).
% 1.86/2.06  end_of_list.
% 1.86/2.06  
% 1.86/2.06  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 1.86/2.06  
% 1.86/2.06  This ia a non-Horn set with equality.  The strategy will be
% 1.86/2.06  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.86/2.06  deletion, with positive clauses in sos and nonpositive
% 1.86/2.06  clauses in usable.
% 1.86/2.06  
% 1.86/2.06     dependent: set(knuth_bendix).
% 1.86/2.06     dependent: set(anl_eq).
% 1.86/2.06     dependent: set(para_from).
% 1.86/2.06     dependent: set(para_into).
% 1.86/2.06     dependent: clear(para_from_right).
% 1.86/2.06     dependent: clear(para_into_right).
% 1.86/2.06     dependent: set(para_from_vars).
% 1.86/2.06     dependent: set(eq_units_both_ways).
% 1.86/2.06     dependent: set(dynamic_demod_all).
% 1.86/2.06     dependent: set(dynamic_demod).
% 1.86/2.06     dependent: set(order_eq).
% 1.86/2.06     dependent: set(back_demod).
% 1.86/2.06     dependent: set(lrpo).
% 1.86/2.06     dependent: set(hyper_res).
% 1.86/2.06     dependent: set(unit_deletion).
% 1.86/2.06     dependent: set(factor).
% 1.86/2.06  
% 1.86/2.06  ------------> process usable:
% 1.86/2.06  ** KEPT (pick-wt=15): 1 [] -e_quidistant(A,B,C,D)| -e_quidistant(A,B,E,F)|e_quidistant(C,D,E,F).
% 1.86/2.06  ** KEPT (pick-wt=8): 2 [] -e_quidistant(A,B,C,C)|A=B.
% 1.86/2.06  ** KEPT (pick-wt=36): 3 [] -e_quidistant(A,B,C,D)| -e_quidistant(B,E,D,F)| -e_quidistant(A,G,C,H)| -e_quidistant(B,G,D,H)| -between(A,B,E)| -between(C,D,F)|A=B|e_quidistant(E,G,F,H).
% 1.86/2.06  ** KEPT (pick-wt=7): 4 [] -between(A,B,A)|A=B.
% 1.86/2.06  ** KEPT (pick-wt=17): 5 [] -between(A,B,C)| -between(D,E,C)|between(B,inner_pasch(A,B,C,E,D),D).
% 1.86/2.06  ** KEPT (pick-wt=17): 6 [] -between(A,B,C)| -between(D,E,C)|between(E,inner_pasch(A,B,C,E,D),A).
% 1.86/2.06  ** KEPT (pick-wt=4): 7 [] -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 1.86/2.06  ** KEPT (pick-wt=4): 8 [] -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 1.86/2.06  ** KEPT (pick-wt=4): 9 [] -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 1.86/2.06  ** KEPT (pick-wt=30): 10 [] -e_quidistant(A,B,A,C)| -e_quidistant(D,B,D,C)| -e_quidistant(E,B,E,C)|between(A,D,E)|between(D,E,A)|between(E,A,D)|B=C.
% 1.86/2.06  ** KEPT (pick-wt=20): 11 [] -between(A,B,C)| -between(D,B,E)|A=B|between(A,D,euclid1(A,D,B,E,C)).
% 1.86/2.06  ** KEPT (pick-wt=20): 12 [] -between(A,B,C)| -between(D,B,E)|A=B|between(A,E,euclid2(A,D,B,E,C)).
% 1.86/2.06  ** KEPT (pick-wt=25): 13 [] -between(A,B,C)| -between(D,B,E)|A=B|between(euclid1(A,D,B,E,C),C,euclid2(A,D,B,E,C)).
% 1.86/2.06  ** KEPT (pick-wt=28): 14 [] -e_quidistant(A,B,A,C)| -e_quidistant(A,D,A,E)| -between(A,B,D)| -between(B,F,D)|between(C,continuous(A,B,C,F,D,E),E).
% 1.86/2.06  ** KEPT (pick-wt=29): 15 [] -e_quidistant(A,B,A,C)| -e_quidistant(A,D,A,E)| -between(A,B,D)| -between(B,F,D)|e_quidistant(A,F,A,continuous(A,B,C,F,D,E)).
% 1.86/2.06  ** KEPT (pick-wt=10): 16 [] -e_quidistant(A,B,C,D)|e_quidistant(C,D,A,B).
% 1.86/2.06  ** KEPT (pick-wt=10): 17 [] -e_quidistant(A,B,C,D)|e_quidistant(B,A,C,D).
% 1.86/2.06  ** KEPT (pick-wt=10): 18 [] -e_quidistant(A,B,C,D)|e_quidistant(A,B,D,C).
% 1.86/2.06  ** KEPT (pick-wt=10): 19 [] -e_quidistant(A,B,C,D)|e_quidistant(B,A,D,C).
% 1.86/2.06  ** KEPT (pick-wt=10): 20 [] -e_quidistant(A,B,C,D)|e_quidistant(C,D,B,A).
% 1.86/2.06  ** KEPT (pick-wt=10): 21 [] -e_quidistant(A,B,C,D)|e_quidistant(D,C,A,B).
% 1.86/2.06  ** KEPT (pick-wt=10): 22 [] -e_quidistant(A,B,C,D)|e_quidistant(D,C,B,A).
% 1.86/2.06  ** KEPT (pick-wt=15): 23 [] -e_quidistant(A,B,C,D)| -e_quidistant(C,D,E,F)|e_quidistant(A,B,E,F).
% 1.86/2.06  ** KEPT (pick-wt=11): 24 [] A!=extension(B,C,D,E)|between(B,C,A).
% 1.86/2.06  ** KEPT (pick-wt=8): 26 [copy,25,flip.2] A!=B|reflection(A,B)=B.
% 1.86/2.06  ** KEPT (pick-wt=8): 28 [copy,27,flip.1] reflection(A,B)!=B|A=B.
% 1.86/2.06  ** KEPT (pick-wt=23): 29 [] -e_quidistant(A,B,C,D)| -e_quidistant(B,E,D,F)| -between(A,B,E)| -between(C,D,F)|e_quidistant(A,E,C,F).
% 1.86/2.06  ** KEPT (pick-wt=19): 30 [] -between(A,B,C)| -between(A,B,D)| -e_quidistant(B,C,B,D)|A=B|C=D.
% 1.86/2.06  ** KEPT (pick-wt=14): 32 [copy,31,flip.3] -between(A,B,C)|A=B|extension(A,B,B,C)=C.
% 1.86/2.06  ** KEPT (pick-wt=19): 33 [] -e_quidistant(A,B,C,D)|extension(E,F,A,B)=extension(E,F,C,D)|E=F.
% 1.86/2.06  ** KEPT (pick-wt=11): 34 [] -between(A,B,C)|A!=C|between(D,B,C).
% 1.86/2.06  ** KEPT (pick-wt=4): 35 [] -between(c,b,a).
% 1.86/2.06  
% 1.86/2.06  ------------> process sos:
% 1.86/2.06  ** KEPT (pick-wt=3): 54 [] A=A.
% 1.86/2.06  ** KEPT (pick-wt=5): 55 [] e_quidistant(A,B,B,A).
% 1.86/2.06  ** KEPT (pick-wt=8): 56 [] between(A,B,extension(A,B,C,D)).
% 1.86/2.06  ** KEPT (pick-wt=9): 57 [] e_quidistant(A,extension(B,A,C,D),C,D).
% 1.86/2.06  ** KEPT (pick-wt=9): 58 [] reflection(A,B)=extension(A,B,A,B).
% 1.86/2.06  ---> New Demodulator: 59 [new_demod,58] reflection(A,B)=extension(A,B,A,B).
% 1.86/2.06  ** KEPT (pick-wt=5): 60 [] e_quidistant(A,B,A,B).
% 1.86/2.06  ** KEPT (pick-wt=7): 62 [copy,61,flip.1] extension(A,B,C,C)=B.
% 1.86/2.06  ---> New Demodulator: 63 [new_demod,62] extension(A,B,C,C)=B.
% 1.86/2.06    Following clause subsumed by 56 during input processing: 0 [demod,59] between(A,B,extension(A,B,A,B)).
% 1.86/2.06    Following clause subsumed by 57 during input processing: 0 [demod,59] e_quidistant(A,extension(B,A,B,A),B,A).
% 1.86/2.06    Following clause subsumed by 54 during input processing: 0 [demod,59,63] A=A.
% 1.86/2.06  ** KEPT (pick-wt=5): 64 [] e_quidistant(A,A,B,B).
% 1.86/2.06  ** KEPT (pick-wt=14): 65 [] extension(A,B,A,B)=extension(A,B,B,A)|A=B.
% 4.40/4.62  ** KEPT (pick-wt=17): 67 [copy,66,demod,59,59] e_quidistant(A,B,A,extension(extension(B,A,B,A),A,extension(B,A,B,A),A)).
% 4.40/4.62  ** KEPT (pick-wt=15): 69 [copy,68,demod,59,59,flip.1] extension(extension(A,B,A,B),B,extension(A,B,A,B),B)=A.
% 4.40/4.62  ---> New Demodulator: 70 [new_demod,69] extension(extension(A,B,A,B),B,extension(A,B,A,B),B)=A.
% 4.40/4.62  ** KEPT (pick-wt=4): 71 [] between(A,B,B).
% 4.40/4.62  ** KEPT (pick-wt=4): 72 [] between(a,b,c).
% 4.40/4.62    Following clause subsumed by 54 during input processing: 0 [copy,54,flip.1] A=A.
% 4.40/4.62  54 back subsumes 50.
% 4.40/4.62  55 back subsumes 51.
% 4.40/4.62  >>>> Starting back demodulation with 59.
% 4.40/4.62      >> back demodulating 28 with 59.
% 4.40/4.62      >> back demodulating 26 with 59.
% 4.40/4.62  60 back subsumes 49.
% 4.40/4.62  60 back subsumes 36.
% 4.40/4.62  >>>> Starting back demodulation with 63.
% 4.40/4.62  64 back subsumes 37.
% 4.40/4.62  >>>> Starting back demodulation with 70.
% 4.40/4.62      >> back demodulating 67 with 70.
% 4.40/4.62  71 back subsumes 41.
% 4.40/4.62  71 back subsumes 40.
% 4.40/4.62  
% 4.40/4.62  ======= end of input processing =======
% 4.40/4.62  
% 4.40/4.62  =========== start of search ===========
% 4.40/4.62  
% 4.40/4.62  
% 4.40/4.62  Resetting weight limit to 9.
% 4.40/4.62  
% 4.40/4.62  
% 4.40/4.62  Resetting weight limit to 9.
% 4.40/4.62  
% 4.40/4.62  sos_size=2113
% 4.40/4.62  
% 4.40/4.62  -------- PROOF -------- 
% 4.40/4.62  
% 4.40/4.62  -----> EMPTY CLAUSE at   2.56 sec ----> 2303 [hyper,2282,1963,97] $F.
% 4.40/4.62  
% 4.40/4.62  Length of proof is 10.  Level of proof is 4.
% 4.40/4.62  
% 4.40/4.62  ---------------- PROOF ----------------
% 4.40/4.62  % SZS status Unsatisfiable
% 4.40/4.62  % SZS output start Refutation
% See solution above
% 4.40/4.62  ------------ end of proof -------------
% 4.40/4.62  
% 4.40/4.62  
% 4.40/4.62  Search stopped by max_proofs option.
% 4.40/4.62  
% 4.40/4.62  
% 4.40/4.62  Search stopped by max_proofs option.
% 4.40/4.62  
% 4.40/4.62  ============ end of search ============
% 4.40/4.62  
% 4.40/4.62  -------------- statistics -------------
% 4.40/4.62  clauses given                135
% 4.40/4.62  clauses generated          19420
% 4.40/4.62  clauses kept                2288
% 4.40/4.62  clauses forward subsumed    4750
% 4.40/4.62  clauses back subsumed        160
% 4.40/4.62  Kbytes malloced             4882
% 4.40/4.62  
% 4.40/4.62  ----------- times (seconds) -----------
% 4.40/4.62  user CPU time          2.56          (0 hr, 0 min, 2 sec)
% 4.40/4.62  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 4.40/4.62  wall-clock time        4             (0 hr, 0 min, 4 sec)
% 4.40/4.62  
% 4.40/4.62  That finishes the proof of the theorem.
% 4.40/4.62  
% 4.40/4.62  Process 31849 finished Wed Jul 27 07:10:10 2022
% 4.40/4.62  Otter interrupted
% 4.40/4.62  PROOF FOUND
%------------------------------------------------------------------------------