TSTP Solution File: HWV005-1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : HWV005-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n007.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:58:02 EDT 2022

% Result   : Unsatisfiable 1.79s 2.07s
% Output   : Refutation 1.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   23
% Syntax   : Number of clauses     :   46 (  31 unt;   1 nHn;  46 RR)
%            Number of literals    :   71 (   0 equ;  28 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;  12 con; 0-2 aty)
%            Number of variables   :   21 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ connection(A,B)
    | ~ value(A,C)
    | value(B,C) ),
    file('HWV005-1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ value(A,B)
    | ~ value(A,C)
    | e_qual_value(B,C) ),
    file('HWV005-1.p',unknown),
    [] ).

cnf(4,axiom,
    ~ e_qual_value(n0,n1),
    file('HWV005-1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ type(A,B)
    | mode(A,ok)
    | mode(A,abnormal) ),
    file('HWV005-1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ mode(A,ok)
    | ~ type(A,and)
    | ~ value(in(n1,A),n1)
    | ~ value(in(n2,A),n1)
    | value(out(n1,A),n1) ),
    file('HWV005-1.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ mode(A,ok)
    | ~ type(A,or)
    | ~ value(in(B,A),n1)
    | value(out(n1,A),n1) ),
    file('HWV005-1.p',unknown),
    [] ).

cnf(18,axiom,
    ( ~ mode(A,ok)
    | ~ type(A,not)
    | ~ value(in(n1,A),n0)
    | value(out(n1,A),n1) ),
    file('HWV005-1.p',unknown),
    [] ).

cnf(22,axiom,
    ( ~ type(A,halfadder)
    | type(and1(A),and) ),
    file('HWV005-1.p',unknown),
    [] ).

cnf(24,axiom,
    ( ~ type(A,halfadder)
    | type(not1(A),not) ),
    file('HWV005-1.p',unknown),
    [] ).

cnf(25,axiom,
    ( ~ type(A,halfadder)
    | type(or1(A),or) ),
    file('HWV005-1.p',unknown),
    [] ).

cnf(26,axiom,
    ( ~ type(A,halfadder)
    | connection(in(n1,A),in(n1,or1(A))) ),
    file('HWV005-1.p',unknown),
    [] ).

cnf(30,axiom,
    ( ~ type(A,halfadder)
    | connection(out(s,A),out(n1,and1(A))) ),
    file('HWV005-1.p',unknown),
    [] ).

cnf(31,axiom,
    ( ~ type(A,halfadder)
    | connection(out(c,A),out(n1,and2(A))) ),
    file('HWV005-1.p',unknown),
    [] ).

cnf(32,axiom,
    ( ~ type(A,halfadder)
    | connection(out(n1,or1(A)),in(n1,and1(A))) ),
    file('HWV005-1.p',unknown),
    [] ).

cnf(33,axiom,
    ( ~ type(A,halfadder)
    | connection(out(n1,and2(A)),in(n1,not1(A))) ),
    file('HWV005-1.p',unknown),
    [] ).

cnf(34,axiom,
    ( ~ type(A,halfadder)
    | connection(out(n1,not1(A)),in(n2,and1(A))) ),
    file('HWV005-1.p',unknown),
    [] ).

cnf(35,axiom,
    ~ mode(and1(h),abnormal),
    file('HWV005-1.p',unknown),
    [] ).

cnf(36,axiom,
    ~ mode(not1(h),abnormal),
    file('HWV005-1.p',unknown),
    [] ).

cnf(37,axiom,
    ~ mode(or1(h),abnormal),
    file('HWV005-1.p',unknown),
    [] ).

cnf(39,axiom,
    type(h,halfadder),
    file('HWV005-1.p',unknown),
    [] ).

cnf(40,axiom,
    value(in(n1,h),n1),
    file('HWV005-1.p',unknown),
    [] ).

cnf(42,axiom,
    value(out(s,h),n0),
    file('HWV005-1.p',unknown),
    [] ).

cnf(43,axiom,
    value(out(c,h),n0),
    file('HWV005-1.p',unknown),
    [] ).

cnf(44,plain,
    connection(out(n1,not1(h)),in(n2,and1(h))),
    inference(hyper,[status(thm)],[39,34]),
    [iquote('hyper,39,34')] ).

cnf(45,plain,
    connection(out(n1,and2(h)),in(n1,not1(h))),
    inference(hyper,[status(thm)],[39,33]),
    [iquote('hyper,39,33')] ).

cnf(46,plain,
    connection(out(n1,or1(h)),in(n1,and1(h))),
    inference(hyper,[status(thm)],[39,32]),
    [iquote('hyper,39,32')] ).

cnf(47,plain,
    connection(out(c,h),out(n1,and2(h))),
    inference(hyper,[status(thm)],[39,31]),
    [iquote('hyper,39,31')] ).

cnf(48,plain,
    connection(out(s,h),out(n1,and1(h))),
    inference(hyper,[status(thm)],[39,30]),
    [iquote('hyper,39,30')] ).

cnf(52,plain,
    connection(in(n1,h),in(n1,or1(h))),
    inference(hyper,[status(thm)],[39,26]),
    [iquote('hyper,39,26')] ).

cnf(53,plain,
    type(or1(h),or),
    inference(hyper,[status(thm)],[39,25]),
    [iquote('hyper,39,25')] ).

cnf(54,plain,
    type(not1(h),not),
    inference(hyper,[status(thm)],[39,24]),
    [iquote('hyper,39,24')] ).

cnf(56,plain,
    type(and1(h),and),
    inference(hyper,[status(thm)],[39,22]),
    [iquote('hyper,39,22')] ).

cnf(58,plain,
    mode(or1(h),ok),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[53,7]),37]),
    [iquote('hyper,53,7,unit_del,37')] ).

cnf(59,plain,
    mode(not1(h),ok),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[54,7]),36]),
    [iquote('hyper,54,7,unit_del,36')] ).

cnf(61,plain,
    mode(and1(h),ok),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[56,7]),35]),
    [iquote('hyper,56,7,unit_del,35')] ).

cnf(64,plain,
    value(out(n1,and2(h)),n0),
    inference(hyper,[status(thm)],[47,1,43]),
    [iquote('hyper,47,1,43')] ).

cnf(65,plain,
    value(out(n1,and1(h)),n0),
    inference(hyper,[status(thm)],[48,1,42]),
    [iquote('hyper,48,1,42')] ).

cnf(67,plain,
    value(in(n1,not1(h)),n0),
    inference(hyper,[status(thm)],[45,1,64]),
    [iquote('hyper,45,1,64')] ).

cnf(68,plain,
    value(out(n1,not1(h)),n1),
    inference(hyper,[status(thm)],[67,18,59,54]),
    [iquote('hyper,67,18,59,54')] ).

cnf(69,plain,
    value(in(n2,and1(h)),n1),
    inference(hyper,[status(thm)],[68,1,44]),
    [iquote('hyper,68,1,44')] ).

cnf(73,plain,
    value(in(n1,or1(h)),n1),
    inference(hyper,[status(thm)],[52,1,40]),
    [iquote('hyper,52,1,40')] ).

cnf(74,plain,
    value(out(n1,or1(h)),n1),
    inference(hyper,[status(thm)],[73,13,58,53]),
    [iquote('hyper,73,13,58,53')] ).

cnf(75,plain,
    value(in(n1,and1(h)),n1),
    inference(hyper,[status(thm)],[74,1,46]),
    [iquote('hyper,74,1,46')] ).

cnf(76,plain,
    value(out(n1,and1(h)),n1),
    inference(hyper,[status(thm)],[75,9,61,56,69]),
    [iquote('hyper,75,9,61,56,69')] ).

cnf(77,plain,
    e_qual_value(n0,n1),
    inference(hyper,[status(thm)],[76,3,65]),
    [iquote('hyper,76,3,65')] ).

cnf(78,plain,
    $false,
    inference(binary,[status(thm)],[77,4]),
    [iquote('binary,77.1,4.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.19  % Problem  : HWV005-1 : TPTP v8.1.0. Released v2.1.0.
% 0.11/0.19  % Command  : otter-tptp-script %s
% 0.12/0.40  % Computer : n007.cluster.edu
% 0.12/0.40  % Model    : x86_64 x86_64
% 0.12/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40  % Memory   : 8042.1875MB
% 0.12/0.40  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.40  % CPULimit : 300
% 0.12/0.40  % WCLimit  : 300
% 0.12/0.40  % DateTime : Wed Jul 27 06:23:46 EDT 2022
% 0.12/0.41  % CPUTime  : 
% 1.79/2.06  ----- Otter 3.3f, August 2004 -----
% 1.79/2.06  The process was started by sandbox2 on n007.cluster.edu,
% 1.79/2.06  Wed Jul 27 06:23:46 2022
% 1.79/2.06  The command was "./otter".  The process ID is 16525.
% 1.79/2.06  
% 1.79/2.06  set(prolog_style_variables).
% 1.79/2.06  set(auto).
% 1.79/2.06     dependent: set(auto1).
% 1.79/2.06     dependent: set(process_input).
% 1.79/2.06     dependent: clear(print_kept).
% 1.79/2.06     dependent: clear(print_new_demod).
% 1.79/2.06     dependent: clear(print_back_demod).
% 1.79/2.06     dependent: clear(print_back_sub).
% 1.79/2.06     dependent: set(control_memory).
% 1.79/2.06     dependent: assign(max_mem, 12000).
% 1.79/2.06     dependent: assign(pick_given_ratio, 4).
% 1.79/2.06     dependent: assign(stats_level, 1).
% 1.79/2.06     dependent: assign(max_seconds, 10800).
% 1.79/2.06  clear(print_given).
% 1.79/2.06  
% 1.79/2.06  list(usable).
% 1.79/2.06  0 [] -connection(P1,P2)| -value(P1,V)|value(P2,V).
% 1.79/2.06  0 [] -connection(P1,P2)| -value(P2,V)|value(P1,V).
% 1.79/2.06  0 [] -value(P,V1)| -value(P,V2)|e_qual_value(V1,V2).
% 1.79/2.06  0 [] -e_qual_value(n0,n1).
% 1.79/2.06  0 [] -e_qual_value(n1,n0).
% 1.79/2.06  0 [] -mode(K,ok)| -mode(K,abnormal).
% 1.79/2.06  0 [] -type(K,Any)|mode(K,ok)|mode(K,abnormal).
% 1.79/2.06  0 [] -mode(K,ok)| -type(K,and)| -value(in(Any,K),n0)|value(out(n1,K),n0).
% 1.79/2.06  0 [] -mode(K,ok)| -type(K,and)| -value(in(n1,K),n1)| -value(in(n2,K),n1)|value(out(n1,K),n1).
% 1.79/2.06  0 [] -mode(K,ok)| -type(K,and)| -value(out(n1,K),n0)|value(in(n1,K),n0)|value(in(n2,K),n0).
% 1.79/2.06  0 [] -mode(K,ok)| -type(K,and)| -value(out(n1,K),n1)|value(in(n1,K),n1).
% 1.79/2.06  0 [] -mode(K,ok)| -type(K,and)| -value(out(n1,K),n1)|value(in(n2,K),n1).
% 1.79/2.06  0 [] -mode(K,ok)| -type(K,or)| -value(in(Any,K),n1)|value(out(n1,K),n1).
% 1.79/2.06  0 [] -mode(K,ok)| -type(K,or)| -value(in(n1,K),n0)| -value(in(n2,K),n0)|value(out(n1,K),n0).
% 1.79/2.06  0 [] -mode(K,ok)| -type(K,or)| -value(out(n1,K),n1)|value(in(n1,K),n1)|value(in(n2,K),n1).
% 1.79/2.06  0 [] -mode(K,ok)| -type(K,or)| -value(out(n1,K),n0)|value(in(n1,K),n0).
% 1.79/2.06  0 [] -mode(K,ok)| -type(K,or)| -value(out(n1,K),n0)|value(in(n2,K),n0).
% 1.79/2.06  0 [] -mode(K,ok)| -type(K,not)| -value(in(n1,K),n0)|value(out(n1,K),n1).
% 1.79/2.06  0 [] -mode(K,ok)| -type(K,not)| -value(in(n1,K),n1)|value(out(n1,K),n0).
% 1.79/2.06  0 [] -mode(K,ok)| -type(K,not)| -value(out(n1,K),n0)|value(in(n1,K),n1).
% 1.79/2.06  0 [] -mode(K,ok)| -type(K,not)| -value(out(n1,K),n1)|value(in(n1,K),n0).
% 1.79/2.06  0 [] -type(X,halfadder)|type(and1(X),and).
% 1.79/2.06  0 [] -type(X,halfadder)|type(and2(X),and).
% 1.79/2.06  0 [] -type(X,halfadder)|type(not1(X),not).
% 1.79/2.06  0 [] -type(X,halfadder)|type(or1(X),or).
% 1.79/2.06  0 [] -type(X,halfadder)|connection(in(n1,X),in(n1,or1(X))).
% 1.79/2.06  0 [] -type(X,halfadder)|connection(in(n2,X),in(n2,or1(X))).
% 1.79/2.06  0 [] -type(X,halfadder)|connection(in(n1,X),in(n1,and2(X))).
% 1.79/2.06  0 [] -type(X,halfadder)|connection(in(n2,X),in(n2,and2(X))).
% 1.79/2.06  0 [] -type(X,halfadder)|connection(out(s,X),out(n1,and1(X))).
% 1.79/2.06  0 [] -type(X,halfadder)|connection(out(c,X),out(n1,and2(X))).
% 1.79/2.06  0 [] -type(X,halfadder)|connection(out(n1,or1(X)),in(n1,and1(X))).
% 1.79/2.06  0 [] -type(X,halfadder)|connection(out(n1,and2(X)),in(n1,not1(X))).
% 1.79/2.06  0 [] -type(X,halfadder)|connection(out(n1,not1(X)),in(n2,and1(X))).
% 1.79/2.06  0 [] type(h,halfadder).
% 1.79/2.06  0 [] value(in(n1,h),n1).
% 1.79/2.06  0 [] value(in(n2,h),n0).
% 1.79/2.06  0 [] value(out(s,h),n0).
% 1.79/2.06  0 [] value(out(c,h),n0).
% 1.79/2.06  0 [] -mode(and1(h),abnormal).
% 1.79/2.06  0 [] -mode(not1(h),abnormal).
% 1.79/2.06  0 [] -mode(or1(h),abnormal).
% 1.79/2.06  end_of_list.
% 1.79/2.06  
% 1.79/2.06  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.79/2.06  
% 1.79/2.06  This is a non-Horn set without equality.  The strategy will
% 1.79/2.06  be ordered hyper_res, unit deletion, and factoring, with
% 1.79/2.06  satellites in sos and with nuclei in usable.
% 1.79/2.06  
% 1.79/2.06     dependent: set(hyper_res).
% 1.79/2.06     dependent: set(factor).
% 1.79/2.06     dependent: set(unit_deletion).
% 1.79/2.06  
% 1.79/2.06  ------------> process usable:
% 1.79/2.06  ** KEPT (pick-wt=9): 1 [] -connection(A,B)| -value(A,C)|value(B,C).
% 1.79/2.06  ** KEPT (pick-wt=9): 2 [] -connection(A,B)| -value(B,C)|value(A,C).
% 1.79/2.06  ** KEPT (pick-wt=9): 3 [] -value(A,B)| -value(A,C)|e_qual_value(B,C).
% 1.79/2.06  ** KEPT (pick-wt=3): 4 [] -e_qual_value(n0,n1).
% 1.79/2.06  ** KEPT (pick-wt=3): 5 [] -e_qual_value(n1,n0).
% 1.79/2.06  ** KEPT (pick-wt=6): 6 [] -mode(A,ok)| -mode(A,abnormal).
% 1.79/2.06  ** KEPT (pick-wt=9): 7 [] -type(A,B)|mode(A,ok)|mode(A,abnormal).
% 1.79/2.06  ** KEPT (pick-wt=16): 8 [] -mode(A,ok)| -type(A,and)| -value(in(B,A),n0)|value(out(n1,A),n0).
% 1.79/2.06  ** KEPT (pick-wt=21): 9 [] -mode(A,ok)| -type(A,and)| -value(in(n1,A),n1)| -value(in(n2,A),n1)|value(out(n1,A),n1).
% 1.79/2.06  ** KEPT (pick-wt=21): 10 [] -mode(A,ok)| -type(A,and)| -value(out(n1,A),n0)|value(in(n1,A),n0)|value(in(n2,A),n0).
% 1.79/2.07  ** KEPT (pick-wt=16): 11 [] -mode(A,ok)| -type(A,and)| -value(out(n1,A),n1)|value(in(n1,A),n1).
% 1.79/2.07  ** KEPT (pick-wt=16): 12 [] -mode(A,ok)| -type(A,and)| -value(out(n1,A),n1)|value(in(n2,A),n1).
% 1.79/2.07  ** KEPT (pick-wt=16): 13 [] -mode(A,ok)| -type(A,or)| -value(in(B,A),n1)|value(out(n1,A),n1).
% 1.79/2.07  ** KEPT (pick-wt=21): 14 [] -mode(A,ok)| -type(A,or)| -value(in(n1,A),n0)| -value(in(n2,A),n0)|value(out(n1,A),n0).
% 1.79/2.07  ** KEPT (pick-wt=21): 15 [] -mode(A,ok)| -type(A,or)| -value(out(n1,A),n1)|value(in(n1,A),n1)|value(in(n2,A),n1).
% 1.79/2.07  ** KEPT (pick-wt=16): 16 [] -mode(A,ok)| -type(A,or)| -value(out(n1,A),n0)|value(in(n1,A),n0).
% 1.79/2.07  ** KEPT (pick-wt=16): 17 [] -mode(A,ok)| -type(A,or)| -value(out(n1,A),n0)|value(in(n2,A),n0).
% 1.79/2.07  ** KEPT (pick-wt=16): 18 [] -mode(A,ok)| -type(A,not)| -value(in(n1,A),n0)|value(out(n1,A),n1).
% 1.79/2.07  ** KEPT (pick-wt=16): 19 [] -mode(A,ok)| -type(A,not)| -value(in(n1,A),n1)|value(out(n1,A),n0).
% 1.79/2.07  ** KEPT (pick-wt=16): 20 [] -mode(A,ok)| -type(A,not)| -value(out(n1,A),n0)|value(in(n1,A),n1).
% 1.79/2.07  ** KEPT (pick-wt=16): 21 [] -mode(A,ok)| -type(A,not)| -value(out(n1,A),n1)|value(in(n1,A),n0).
% 1.79/2.07  ** KEPT (pick-wt=7): 22 [] -type(A,halfadder)|type(and1(A),and).
% 1.79/2.07  ** KEPT (pick-wt=7): 23 [] -type(A,halfadder)|type(and2(A),and).
% 1.79/2.07  ** KEPT (pick-wt=7): 24 [] -type(A,halfadder)|type(not1(A),not).
% 1.79/2.07  ** KEPT (pick-wt=7): 25 [] -type(A,halfadder)|type(or1(A),or).
% 1.79/2.07  ** KEPT (pick-wt=11): 26 [] -type(A,halfadder)|connection(in(n1,A),in(n1,or1(A))).
% 1.79/2.07  ** KEPT (pick-wt=11): 27 [] -type(A,halfadder)|connection(in(n2,A),in(n2,or1(A))).
% 1.79/2.07  ** KEPT (pick-wt=11): 28 [] -type(A,halfadder)|connection(in(n1,A),in(n1,and2(A))).
% 1.79/2.07  ** KEPT (pick-wt=11): 29 [] -type(A,halfadder)|connection(in(n2,A),in(n2,and2(A))).
% 1.79/2.07  ** KEPT (pick-wt=11): 30 [] -type(A,halfadder)|connection(out(s,A),out(n1,and1(A))).
% 1.79/2.07  ** KEPT (pick-wt=11): 31 [] -type(A,halfadder)|connection(out(c,A),out(n1,and2(A))).
% 1.79/2.07  ** KEPT (pick-wt=12): 32 [] -type(A,halfadder)|connection(out(n1,or1(A)),in(n1,and1(A))).
% 1.79/2.07  ** KEPT (pick-wt=12): 33 [] -type(A,halfadder)|connection(out(n1,and2(A)),in(n1,not1(A))).
% 1.79/2.07  ** KEPT (pick-wt=12): 34 [] -type(A,halfadder)|connection(out(n1,not1(A)),in(n2,and1(A))).
% 1.79/2.07  ** KEPT (pick-wt=4): 35 [] -mode(and1(h),abnormal).
% 1.79/2.07  ** KEPT (pick-wt=4): 36 [] -mode(not1(h),abnormal).
% 1.79/2.07  ** KEPT (pick-wt=4): 37 [] -mode(or1(h),abnormal).
% 1.79/2.07  
% 1.79/2.07  ------------> process sos:
% 1.79/2.07  ** KEPT (pick-wt=3): 39 [] type(h,halfadder).
% 1.79/2.07  ** KEPT (pick-wt=5): 40 [] value(in(n1,h),n1).
% 1.79/2.07  ** KEPT (pick-wt=5): 41 [] value(in(n2,h),n0).
% 1.79/2.07  ** KEPT (pick-wt=5): 42 [] value(out(s,h),n0).
% 1.79/2.07  ** KEPT (pick-wt=5): 43 [] value(out(c,h),n0).
% 1.79/2.07  
% 1.79/2.07  ======= end of input processing =======
% 1.79/2.07  
% 1.79/2.07  =========== start of search ===========
% 1.79/2.07  
% 1.79/2.07  -------- PROOF -------- 
% 1.79/2.07  
% 1.79/2.07  ----> UNIT CONFLICT at   0.00 sec ----> 78 [binary,77.1,4.1] $F.
% 1.79/2.07  
% 1.79/2.07  Length of proof is 22.  Level of proof is 7.
% 1.79/2.07  
% 1.79/2.07  ---------------- PROOF ----------------
% 1.79/2.07  % SZS status Unsatisfiable
% 1.79/2.07  % SZS output start Refutation
% See solution above
% 1.79/2.07  ------------ end of proof -------------
% 1.79/2.07  
% 1.79/2.07  
% 1.79/2.07  Search stopped by max_proofs option.
% 1.79/2.07  
% 1.79/2.07  
% 1.79/2.07  Search stopped by max_proofs option.
% 1.79/2.07  
% 1.79/2.07  ============ end of search ============
% 1.79/2.07  
% 1.79/2.07  -------------- statistics -------------
% 1.79/2.07  clauses given                 37
% 1.79/2.07  clauses generated             99
% 1.79/2.07  clauses kept                  77
% 1.79/2.07  clauses forward subsumed      64
% 1.79/2.07  clauses back subsumed          0
% 1.79/2.07  Kbytes malloced              976
% 1.79/2.07  
% 1.79/2.07  ----------- times (seconds) -----------
% 1.79/2.07  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.79/2.07  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.79/2.07  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.79/2.07  
% 1.79/2.07  That finishes the proof of the theorem.
% 1.79/2.07  
% 1.79/2.07  Process 16525 finished Wed Jul 27 06:23:48 2022
% 1.79/2.07  Otter interrupted
% 1.79/2.07  PROOF FOUND
%------------------------------------------------------------------------------