↑ Up

Otter---3.3.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : HWV008-1.001 : TPTP v8.1.0. Released v2.1.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 12:58:03 EDT 2022

% Result   : Unsatisfiable 1.87s 2.05s
% Output   : Refutation 1.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   30
% Syntax   : Number of clauses     :   68 (  46 unt;   1 nHn;  68 RR)
%            Number of literals    :   99 (   0 equ;  34 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;  12 con; 0-2 aty)
%            Number of variables   :   30 (   2 sgn)

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

cnf(2,axiom,
    ( ~ connection(A,B)
    | ~ value(B,C)
    | value(A,C) ),
    file('HWV008-1.001.p',unknown),
    [] ).

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

cnf(5,axiom,
    ~ e_qual_value(n1,n0),
    file('HWV008-1.001.p',unknown),
    [] ).

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

cnf(8,axiom,
    ( ~ mode(A,ok)
    | ~ type(A,and)
    | ~ value(in(B,A),n0)
    | value(out(n1,A),n0) ),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ mode(A,ok)
    | ~ type(A,or)
    | ~ value(in(n1,A),n0)
    | ~ value(in(n2,A),n0)
    | value(out(n1,A),n0) ),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(23,axiom,
    ( ~ type(A,halfadder)
    | type(and2(A),and) ),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(28,axiom,
    ( ~ type(A,halfadder)
    | connection(in(n1,A),in(n1,and2(A))) ),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(29,axiom,
    ( ~ type(A,halfadder)
    | connection(in(n2,A),in(n2,and2(A))) ),
    file('HWV008-1.001.p',unknown),
    [] ).

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

cnf(35,axiom,
    ( ~ type(A,fulladder)
    | type(h1(A),halfadder) ),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(36,axiom,
    ( ~ type(A,fulladder)
    | type(h2(A),halfadder) ),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(37,axiom,
    ( ~ type(A,fulladder)
    | type(or1(A),or) ),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(39,axiom,
    ( ~ type(A,fulladder)
    | connection(out(c,h1(A)),in(n2,or1(A))) ),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(40,axiom,
    ( ~ type(A,fulladder)
    | connection(out(c,h2(A)),in(n1,or1(A))) ),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(41,axiom,
    ( ~ type(A,fulladder)
    | connection(in(n1,A),in(n1,h2(A))) ),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(43,axiom,
    ( ~ type(A,fulladder)
    | connection(in(c,A),in(n2,h1(A))) ),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(45,axiom,
    ( ~ type(A,fulladder)
    | connection(out(c,A),out(n1,or1(A))) ),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(46,axiom,
    ( ~ type(A,nbit_adder(n1))
    | type(v(n1,A),fulladder) ),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(48,axiom,
    ( ~ type(A,nbit_adder(n1))
    | connection(out(c,A),out(c,v(n1,A))) ),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(49,axiom,
    ( ~ type(A,nbit_adder(n1))
    | connection(in(a1,A),in(n1,v(n1,A))) ),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(51,axiom,
    ( ~ type(A,nbit_adder(n1))
    | connection(in(c,A),in(c,v(n1,A))) ),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(52,axiom,
    ~ mode(or1(v(n1,a)),abnormal),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(53,axiom,
    ~ mode(and2(h1(v(n1,a))),abnormal),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(54,axiom,
    ~ mode(and2(h2(v(n1,a))),abnormal),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(56,axiom,
    type(a,nbit_adder(n1)),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(57,axiom,
    value(in(a1,a),n0),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(59,axiom,
    value(in(c,a),n0),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(61,axiom,
    value(out(c,a),n1),
    file('HWV008-1.001.p',unknown),
    [] ).

cnf(62,plain,
    connection(in(c,a),in(c,v(n1,a))),
    inference(hyper,[status(thm)],[56,51]),
    [iquote('hyper,56,51')] ).

cnf(64,plain,
    connection(in(a1,a),in(n1,v(n1,a))),
    inference(hyper,[status(thm)],[56,49]),
    [iquote('hyper,56,49')] ).

cnf(65,plain,
    connection(out(c,a),out(c,v(n1,a))),
    inference(hyper,[status(thm)],[56,48]),
    [iquote('hyper,56,48')] ).

cnf(67,plain,
    type(v(n1,a),fulladder),
    inference(hyper,[status(thm)],[56,46]),
    [iquote('hyper,56,46')] ).

cnf(71,plain,
    connection(out(c,v(n1,a)),out(n1,or1(v(n1,a)))),
    inference(hyper,[status(thm)],[67,45]),
    [iquote('hyper,67,45')] ).

cnf(73,plain,
    connection(in(c,v(n1,a)),in(n2,h1(v(n1,a)))),
    inference(hyper,[status(thm)],[67,43]),
    [iquote('hyper,67,43')] ).

cnf(75,plain,
    connection(in(n1,v(n1,a)),in(n1,h2(v(n1,a)))),
    inference(hyper,[status(thm)],[67,41]),
    [iquote('hyper,67,41')] ).

cnf(76,plain,
    connection(out(c,h2(v(n1,a))),in(n1,or1(v(n1,a)))),
    inference(hyper,[status(thm)],[67,40]),
    [iquote('hyper,67,40')] ).

cnf(77,plain,
    connection(out(c,h1(v(n1,a))),in(n2,or1(v(n1,a)))),
    inference(hyper,[status(thm)],[67,39]),
    [iquote('hyper,67,39')] ).

cnf(79,plain,
    type(or1(v(n1,a)),or),
    inference(hyper,[status(thm)],[67,37]),
    [iquote('hyper,67,37')] ).

cnf(80,plain,
    type(h2(v(n1,a)),halfadder),
    inference(hyper,[status(thm)],[67,36]),
    [iquote('hyper,67,36')] ).

cnf(81,plain,
    type(h1(v(n1,a)),halfadder),
    inference(hyper,[status(thm)],[67,35]),
    [iquote('hyper,67,35')] ).

cnf(83,plain,
    value(in(c,v(n1,a)),n0),
    inference(hyper,[status(thm)],[62,1,59]),
    [iquote('hyper,62,1,59')] ).

cnf(84,plain,
    mode(or1(v(n1,a)),ok),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[79,7]),52]),
    [iquote('hyper,79,7,unit_del,52')] ).

cnf(88,plain,
    connection(out(c,h2(v(n1,a))),out(n1,and2(h2(v(n1,a))))),
    inference(hyper,[status(thm)],[80,31]),
    [iquote('hyper,80,31')] ).

cnf(91,plain,
    connection(in(n1,h2(v(n1,a))),in(n1,and2(h2(v(n1,a))))),
    inference(hyper,[status(thm)],[80,28]),
    [iquote('hyper,80,28')] ).

cnf(96,plain,
    type(and2(h2(v(n1,a))),and),
    inference(hyper,[status(thm)],[80,23]),
    [iquote('hyper,80,23')] ).

cnf(102,plain,
    connection(out(c,h1(v(n1,a))),out(n1,and2(h1(v(n1,a))))),
    inference(hyper,[status(thm)],[81,31]),
    [iquote('hyper,81,31')] ).

cnf(104,plain,
    connection(in(n2,h1(v(n1,a))),in(n2,and2(h1(v(n1,a))))),
    inference(hyper,[status(thm)],[81,29]),
    [iquote('hyper,81,29')] ).

cnf(110,plain,
    type(and2(h1(v(n1,a))),and),
    inference(hyper,[status(thm)],[81,23]),
    [iquote('hyper,81,23')] ).

cnf(116,plain,
    mode(and2(h2(v(n1,a))),ok),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[96,7]),54]),
    [iquote('hyper,96,7,unit_del,54')] ).

cnf(117,plain,
    value(in(n1,v(n1,a)),n0),
    inference(hyper,[status(thm)],[64,1,57]),
    [iquote('hyper,64,1,57')] ).

cnf(121,plain,
    mode(and2(h1(v(n1,a))),ok),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[110,7]),53]),
    [iquote('hyper,110,7,unit_del,53')] ).

cnf(122,plain,
    value(out(c,v(n1,a)),n1),
    inference(hyper,[status(thm)],[65,1,61]),
    [iquote('hyper,65,1,61')] ).

cnf(125,plain,
    value(out(n1,or1(v(n1,a))),n1),
    inference(hyper,[status(thm)],[71,1,122]),
    [iquote('hyper,71,1,122')] ).

cnf(128,plain,
    value(in(n2,h1(v(n1,a))),n0),
    inference(hyper,[status(thm)],[73,1,83]),
    [iquote('hyper,73,1,83')] ).

cnf(130,plain,
    value(in(n1,h2(v(n1,a))),n0),
    inference(hyper,[status(thm)],[75,1,117]),
    [iquote('hyper,75,1,117')] ).

cnf(132,plain,
    value(in(n1,and2(h2(v(n1,a)))),n0),
    inference(hyper,[status(thm)],[91,1,130]),
    [iquote('hyper,91,1,130')] ).

cnf(133,plain,
    value(out(n1,and2(h2(v(n1,a)))),n0),
    inference(hyper,[status(thm)],[132,8,116,96]),
    [iquote('hyper,132,8,116,96')] ).

cnf(134,plain,
    value(out(c,h2(v(n1,a))),n0),
    inference(hyper,[status(thm)],[133,2,88]),
    [iquote('hyper,133,2,88')] ).

cnf(136,plain,
    value(in(n1,or1(v(n1,a))),n0),
    inference(hyper,[status(thm)],[134,1,76]),
    [iquote('hyper,134,1,76')] ).

cnf(138,plain,
    value(in(n2,and2(h1(v(n1,a)))),n0),
    inference(hyper,[status(thm)],[104,1,128]),
    [iquote('hyper,104,1,128')] ).

cnf(139,plain,
    value(out(n1,and2(h1(v(n1,a)))),n0),
    inference(hyper,[status(thm)],[138,8,121,110]),
    [iquote('hyper,138,8,121,110')] ).

cnf(140,plain,
    value(out(c,h1(v(n1,a))),n0),
    inference(hyper,[status(thm)],[139,2,102]),
    [iquote('hyper,139,2,102')] ).

cnf(142,plain,
    value(in(n2,or1(v(n1,a))),n0),
    inference(hyper,[status(thm)],[140,1,77]),
    [iquote('hyper,140,1,77')] ).

cnf(143,plain,
    value(out(n1,or1(v(n1,a))),n0),
    inference(hyper,[status(thm)],[142,14,84,79,136]),
    [iquote('hyper,142,14,84,79,136')] ).

cnf(144,plain,
    e_qual_value(n1,n0),
    inference(hyper,[status(thm)],[143,3,125]),
    [iquote('hyper,143,3,125')] ).

cnf(145,plain,
    $false,
    inference(binary,[status(thm)],[144,5]),
    [iquote('binary,144.1,5.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : HWV008-1.001 : TPTP v8.1.0. Released v2.1.0.
% 0.11/0.13  % Command  : otter-tptp-script %s
% 0.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed Jul 27 06:40:06 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.87/2.04  ----- Otter 3.3f, August 2004 -----
% 1.87/2.04  The process was started by sandbox on n009.cluster.edu,
% 1.87/2.04  Wed Jul 27 06:40:06 2022
% 1.87/2.04  The command was "./otter".  The process ID is 30789.
% 1.87/2.04  
% 1.87/2.04  set(prolog_style_variables).
% 1.87/2.04  set(auto).
% 1.87/2.04     dependent: set(auto1).
% 1.87/2.04     dependent: set(process_input).
% 1.87/2.04     dependent: clear(print_kept).
% 1.87/2.04     dependent: clear(print_new_demod).
% 1.87/2.04     dependent: clear(print_back_demod).
% 1.87/2.04     dependent: clear(print_back_sub).
% 1.87/2.04     dependent: set(control_memory).
% 1.87/2.04     dependent: assign(max_mem, 12000).
% 1.87/2.04     dependent: assign(pick_given_ratio, 4).
% 1.87/2.04     dependent: assign(stats_level, 1).
% 1.87/2.04     dependent: assign(max_seconds, 10800).
% 1.87/2.04  clear(print_given).
% 1.87/2.04  
% 1.87/2.04  list(usable).
% 1.87/2.04  0 [] -connection(P1,P2)| -value(P1,V)|value(P2,V).
% 1.87/2.04  0 [] -connection(P1,P2)| -value(P2,V)|value(P1,V).
% 1.87/2.04  0 [] -value(P,V1)| -value(P,V2)|e_qual_value(V1,V2).
% 1.87/2.04  0 [] -e_qual_value(n0,n1).
% 1.87/2.04  0 [] -e_qual_value(n1,n0).
% 1.87/2.04  0 [] -mode(K,ok)| -mode(K,abnormal).
% 1.87/2.04  0 [] -type(K,Any)|mode(K,ok)|mode(K,abnormal).
% 1.87/2.04  0 [] -mode(K,ok)| -type(K,and)| -value(in(Any,K),n0)|value(out(n1,K),n0).
% 1.87/2.04  0 [] -mode(K,ok)| -type(K,and)| -value(in(n1,K),n1)| -value(in(n2,K),n1)|value(out(n1,K),n1).
% 1.87/2.04  0 [] -mode(K,ok)| -type(K,and)| -value(out(n1,K),n0)|value(in(n1,K),n0)|value(in(n2,K),n0).
% 1.87/2.04  0 [] -mode(K,ok)| -type(K,and)| -value(out(n1,K),n1)|value(in(n1,K),n1).
% 1.87/2.04  0 [] -mode(K,ok)| -type(K,and)| -value(out(n1,K),n1)|value(in(n2,K),n1).
% 1.87/2.04  0 [] -mode(K,ok)| -type(K,or)| -value(in(Any,K),n1)|value(out(n1,K),n1).
% 1.87/2.04  0 [] -mode(K,ok)| -type(K,or)| -value(in(n1,K),n0)| -value(in(n2,K),n0)|value(out(n1,K),n0).
% 1.87/2.04  0 [] -mode(K,ok)| -type(K,or)| -value(out(n1,K),n1)|value(in(n1,K),n1)|value(in(n2,K),n1).
% 1.87/2.04  0 [] -mode(K,ok)| -type(K,or)| -value(out(n1,K),n0)|value(in(n1,K),n0).
% 1.87/2.04  0 [] -mode(K,ok)| -type(K,or)| -value(out(n1,K),n0)|value(in(n2,K),n0).
% 1.87/2.04  0 [] -mode(K,ok)| -type(K,not)| -value(in(n1,K),n0)|value(out(n1,K),n1).
% 1.87/2.04  0 [] -mode(K,ok)| -type(K,not)| -value(in(n1,K),n1)|value(out(n1,K),n0).
% 1.87/2.04  0 [] -mode(K,ok)| -type(K,not)| -value(out(n1,K),n0)|value(in(n1,K),n1).
% 1.87/2.04  0 [] -mode(K,ok)| -type(K,not)| -value(out(n1,K),n1)|value(in(n1,K),n0).
% 1.87/2.04  0 [] -type(X,halfadder)|type(and1(X),and).
% 1.87/2.04  0 [] -type(X,halfadder)|type(and2(X),and).
% 1.87/2.04  0 [] -type(X,halfadder)|type(not1(X),not).
% 1.87/2.04  0 [] -type(X,halfadder)|type(or1(X),or).
% 1.87/2.04  0 [] -type(X,halfadder)|connection(in(n1,X),in(n1,or1(X))).
% 1.87/2.04  0 [] -type(X,halfadder)|connection(in(n2,X),in(n2,or1(X))).
% 1.87/2.04  0 [] -type(X,halfadder)|connection(in(n1,X),in(n1,and2(X))).
% 1.87/2.04  0 [] -type(X,halfadder)|connection(in(n2,X),in(n2,and2(X))).
% 1.87/2.04  0 [] -type(X,halfadder)|connection(out(s,X),out(n1,and1(X))).
% 1.87/2.04  0 [] -type(X,halfadder)|connection(out(c,X),out(n1,and2(X))).
% 1.87/2.04  0 [] -type(X,halfadder)|connection(out(n1,or1(X)),in(n1,and1(X))).
% 1.87/2.04  0 [] -type(X,halfadder)|connection(out(n1,and2(X)),in(n1,not1(X))).
% 1.87/2.04  0 [] -type(X,halfadder)|connection(out(n1,not1(X)),in(n2,and1(X))).
% 1.87/2.04  0 [] -type(X,fulladder)|type(h1(X),halfadder).
% 1.87/2.04  0 [] -type(X,fulladder)|type(h2(X),halfadder).
% 1.87/2.04  0 [] -type(X,fulladder)|type(or1(X),or).
% 1.87/2.04  0 [] -type(X,fulladder)|connection(out(s,h1(X)),in(n2,h2(X))).
% 1.87/2.04  0 [] -type(X,fulladder)|connection(out(c,h1(X)),in(n2,or1(X))).
% 1.87/2.04  0 [] -type(X,fulladder)|connection(out(c,h2(X)),in(n1,or1(X))).
% 1.87/2.04  0 [] -type(X,fulladder)|connection(in(n1,X),in(n1,h2(X))).
% 1.87/2.04  0 [] -type(X,fulladder)|connection(in(n2,X),in(n1,h1(X))).
% 1.87/2.04  0 [] -type(X,fulladder)|connection(in(c,X),in(n2,h1(X))).
% 1.87/2.04  0 [] -type(X,fulladder)|connection(out(s,X),out(s,h2(X))).
% 1.87/2.04  0 [] -type(X,fulladder)|connection(out(c,X),out(n1,or1(X))).
% 1.87/2.04  0 [] -type(X,nbit_adder(n1))|type(v(n1,X),fulladder).
% 1.87/2.04  0 [] -type(X,nbit_adder(n1))|connection(out(n1,X),out(s,v(n1,X))).
% 1.87/2.04  0 [] -type(X,nbit_adder(n1))|connection(out(c,X),out(c,v(n1,X))).
% 1.87/2.04  0 [] -type(X,nbit_adder(n1))|connection(in(a1,X),in(n1,v(n1,X))).
% 1.87/2.04  0 [] -type(X,nbit_adder(n1))|connection(in(b1,X),in(n2,v(n1,X))).
% 1.87/2.04  0 [] -type(X,nbit_adder(n1))|connection(in(c,X),in(c,v(n1,X))).
% 1.87/2.04  0 [] type(a,nbit_adder(n1)).
% 1.87/2.04  0 [] value(in(a1,a),n0).
% 1.87/2.04  0 [] value(in(b1,a),n0).
% 1.87/2.04  0 [] value(in(c,a),n0).
% 1.87/2.04  0 [] value(out(n1,a),n0).
% 1.87/2.04  0 [] value(out(c,a),n1).
% 1.87/2.04  0 [] -mode(or1(v(n1,a)),abnormal).
% 1.87/2.04  0 [] -mode(and2(h1(v(n1,a))),abnormal).
% 1.87/2.04  0 [] -mode(and2(h2(v(n1,a))),abnormal).
% 1.87/2.04  end_of_list.
% 1.87/2.04  
% 1.87/2.04  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.87/2.04  
% 1.87/2.04  This is a non-Horn set without equality.  The strategy will
% 1.87/2.04  be ordered hyper_res, unit deletion, and factoring, with
% 1.87/2.04  satellites in sos and with nuclei in usable.
% 1.87/2.04  
% 1.87/2.04     dependent: set(hyper_res).
% 1.87/2.04     dependent: set(factor).
% 1.87/2.04     dependent: set(unit_deletion).
% 1.87/2.04  
% 1.87/2.04  ------------> process usable:
% 1.87/2.04  ** KEPT (pick-wt=9): 1 [] -connection(A,B)| -value(A,C)|value(B,C).
% 1.87/2.04  ** KEPT (pick-wt=9): 2 [] -connection(A,B)| -value(B,C)|value(A,C).
% 1.87/2.04  ** KEPT (pick-wt=9): 3 [] -value(A,B)| -value(A,C)|e_qual_value(B,C).
% 1.87/2.04  ** KEPT (pick-wt=3): 4 [] -e_qual_value(n0,n1).
% 1.87/2.04  ** KEPT (pick-wt=3): 5 [] -e_qual_value(n1,n0).
% 1.87/2.04  ** KEPT (pick-wt=6): 6 [] -mode(A,ok)| -mode(A,abnormal).
% 1.87/2.04  ** KEPT (pick-wt=9): 7 [] -type(A,B)|mode(A,ok)|mode(A,abnormal).
% 1.87/2.04  ** KEPT (pick-wt=16): 8 [] -mode(A,ok)| -type(A,and)| -value(in(B,A),n0)|value(out(n1,A),n0).
% 1.87/2.04  ** 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.87/2.04  ** 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.87/2.04  ** KEPT (pick-wt=16): 11 [] -mode(A,ok)| -type(A,and)| -value(out(n1,A),n1)|value(in(n1,A),n1).
% 1.87/2.04  ** KEPT (pick-wt=16): 12 [] -mode(A,ok)| -type(A,and)| -value(out(n1,A),n1)|value(in(n2,A),n1).
% 1.87/2.04  ** KEPT (pick-wt=16): 13 [] -mode(A,ok)| -type(A,or)| -value(in(B,A),n1)|value(out(n1,A),n1).
% 1.87/2.04  ** 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.87/2.04  ** 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.87/2.04  ** KEPT (pick-wt=16): 16 [] -mode(A,ok)| -type(A,or)| -value(out(n1,A),n0)|value(in(n1,A),n0).
% 1.87/2.04  ** KEPT (pick-wt=16): 17 [] -mode(A,ok)| -type(A,or)| -value(out(n1,A),n0)|value(in(n2,A),n0).
% 1.87/2.04  ** KEPT (pick-wt=16): 18 [] -mode(A,ok)| -type(A,not)| -value(in(n1,A),n0)|value(out(n1,A),n1).
% 1.87/2.04  ** KEPT (pick-wt=16): 19 [] -mode(A,ok)| -type(A,not)| -value(in(n1,A),n1)|value(out(n1,A),n0).
% 1.87/2.04  ** KEPT (pick-wt=16): 20 [] -mode(A,ok)| -type(A,not)| -value(out(n1,A),n0)|value(in(n1,A),n1).
% 1.87/2.04  ** KEPT (pick-wt=16): 21 [] -mode(A,ok)| -type(A,not)| -value(out(n1,A),n1)|value(in(n1,A),n0).
% 1.87/2.04  ** KEPT (pick-wt=7): 22 [] -type(A,halfadder)|type(and1(A),and).
% 1.87/2.04  ** KEPT (pick-wt=7): 23 [] -type(A,halfadder)|type(and2(A),and).
% 1.87/2.04  ** KEPT (pick-wt=7): 24 [] -type(A,halfadder)|type(not1(A),not).
% 1.87/2.04  ** KEPT (pick-wt=7): 25 [] -type(A,halfadder)|type(or1(A),or).
% 1.87/2.04  ** KEPT (pick-wt=11): 26 [] -type(A,halfadder)|connection(in(n1,A),in(n1,or1(A))).
% 1.87/2.04  ** KEPT (pick-wt=11): 27 [] -type(A,halfadder)|connection(in(n2,A),in(n2,or1(A))).
% 1.87/2.04  ** KEPT (pick-wt=11): 28 [] -type(A,halfadder)|connection(in(n1,A),in(n1,and2(A))).
% 1.87/2.04  ** KEPT (pick-wt=11): 29 [] -type(A,halfadder)|connection(in(n2,A),in(n2,and2(A))).
% 1.87/2.04  ** KEPT (pick-wt=11): 30 [] -type(A,halfadder)|connection(out(s,A),out(n1,and1(A))).
% 1.87/2.04  ** KEPT (pick-wt=11): 31 [] -type(A,halfadder)|connection(out(c,A),out(n1,and2(A))).
% 1.87/2.04  ** KEPT (pick-wt=12): 32 [] -type(A,halfadder)|connection(out(n1,or1(A)),in(n1,and1(A))).
% 1.87/2.04  ** KEPT (pick-wt=12): 33 [] -type(A,halfadder)|connection(out(n1,and2(A)),in(n1,not1(A))).
% 1.87/2.04  ** KEPT (pick-wt=12): 34 [] -type(A,halfadder)|connection(out(n1,not1(A)),in(n2,and1(A))).
% 1.87/2.04  ** KEPT (pick-wt=7): 35 [] -type(A,fulladder)|type(h1(A),halfadder).
% 1.87/2.04  ** KEPT (pick-wt=7): 36 [] -type(A,fulladder)|type(h2(A),halfadder).
% 1.87/2.04  ** KEPT (pick-wt=7): 37 [] -type(A,fulladder)|type(or1(A),or).
% 1.87/2.04  ** KEPT (pick-wt=12): 38 [] -type(A,fulladder)|connection(out(s,h1(A)),in(n2,h2(A))).
% 1.87/2.04  ** KEPT (pick-wt=12): 39 [] -type(A,fulladder)|connection(out(c,h1(A)),in(n2,or1(A))).
% 1.87/2.04  ** KEPT (pick-wt=12): 40 [] -type(A,fulladder)|connection(out(c,h2(A)),in(n1,or1(A))).
% 1.87/2.04  ** KEPT (pick-wt=11): 41 [] -type(A,fulladder)|connection(in(n1,A),in(n1,h2(A))).
% 1.87/2.04  ** KEPT (pick-wt=11): 42 [] -type(A,fulladder)|connection(in(n2,A),in(n1,h1(A))).
% 1.87/2.04  ** KEPT (pick-wt=11): 43 [] -type(A,fulladder)|connection(in(c,A),in(n2,h1(A))).
% 1.87/2.04  ** KEPT (pick-wt=11): 44 [] -type(A,fulladder)|connection(out(s,A),out(s,h2(A))).
% 1.87/2.04  ** KEPT (pick-wt=11): 45 [] -type(A,fulladder)|connection(out(c,A),out(n1,or1(A))).
% 1.87/2.04  ** KEPT (pick-wt=9): 46 [] -type(A,nbit_adder(n1))|type(v(n1,A),fulladder).
% 1.87/2.05  ** KEPT (pick-wt=13): 47 [] -type(A,nbit_adder(n1))|connection(out(n1,A),out(s,v(n1,A))).
% 1.87/2.05  ** KEPT (pick-wt=13): 48 [] -type(A,nbit_adder(n1))|connection(out(c,A),out(c,v(n1,A))).
% 1.87/2.05  ** KEPT (pick-wt=13): 49 [] -type(A,nbit_adder(n1))|connection(in(a1,A),in(n1,v(n1,A))).
% 1.87/2.05  ** KEPT (pick-wt=13): 50 [] -type(A,nbit_adder(n1))|connection(in(b1,A),in(n2,v(n1,A))).
% 1.87/2.05  ** KEPT (pick-wt=13): 51 [] -type(A,nbit_adder(n1))|connection(in(c,A),in(c,v(n1,A))).
% 1.87/2.05  ** KEPT (pick-wt=6): 52 [] -mode(or1(v(n1,a)),abnormal).
% 1.87/2.05  ** KEPT (pick-wt=7): 53 [] -mode(and2(h1(v(n1,a))),abnormal).
% 1.87/2.05  ** KEPT (pick-wt=7): 54 [] -mode(and2(h2(v(n1,a))),abnormal).
% 1.87/2.05  
% 1.87/2.05  ------------> process sos:
% 1.87/2.05  ** KEPT (pick-wt=4): 56 [] type(a,nbit_adder(n1)).
% 1.87/2.05  ** KEPT (pick-wt=5): 57 [] value(in(a1,a),n0).
% 1.87/2.05  ** KEPT (pick-wt=5): 58 [] value(in(b1,a),n0).
% 1.87/2.05  ** KEPT (pick-wt=5): 59 [] value(in(c,a),n0).
% 1.87/2.05  ** KEPT (pick-wt=5): 60 [] value(out(n1,a),n0).
% 1.87/2.05  ** KEPT (pick-wt=5): 61 [] value(out(c,a),n1).
% 1.87/2.05  
% 1.87/2.05  ======= end of input processing =======
% 1.87/2.05  
% 1.87/2.05  =========== start of search ===========
% 1.87/2.05  
% 1.87/2.05  -------- PROOF -------- 
% 1.87/2.05  
% 1.87/2.05  ----> UNIT CONFLICT at   0.01 sec ----> 145 [binary,144.1,5.1] $F.
% 1.87/2.05  
% 1.87/2.05  Length of proof is 37.  Level of proof is 9.
% 1.87/2.05  
% 1.87/2.05  ---------------- PROOF ----------------
% 1.87/2.05  % SZS status Unsatisfiable
% 1.87/2.05  % SZS output start Refutation
% See solution above
% 1.87/2.05  ------------ end of proof -------------
% 1.87/2.05  
% 1.87/2.05  
% 1.87/2.05  Search stopped by max_proofs option.
% 1.87/2.05  
% 1.87/2.05  
% 1.87/2.05  Search stopped by max_proofs option.
% 1.87/2.05  
% 1.87/2.05  ============ end of search ============
% 1.87/2.05  
% 1.87/2.05  -------------- statistics -------------
% 1.87/2.05  clauses given                 77
% 1.87/2.05  clauses generated            193
% 1.87/2.05  clauses kept                 144
% 1.87/2.05  clauses forward subsumed     109
% 1.87/2.05  clauses back subsumed          0
% 1.87/2.05  Kbytes malloced             1953
% 1.87/2.05  
% 1.87/2.05  ----------- times (seconds) -----------
% 1.87/2.05  user CPU time          0.01          (0 hr, 0 min, 0 sec)
% 1.87/2.05  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.87/2.05  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.87/2.05  
% 1.87/2.05  That finishes the proof of the theorem.
% 1.87/2.05  
% 1.87/2.05  Process 30789 finished Wed Jul 27 06:40:08 2022
% 1.87/2.05  Otter interrupted
% 1.87/2.05  PROOF FOUND
%------------------------------------------------------------------------------