TSTP Solution File: HWV007-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : HWV007-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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.68s 2.20s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 45
% Syntax : Number of clauses : 106 ( 63 unt; 7 nHn; 106 RR)
% Number of literals : 167 ( 0 equ; 60 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 13 con; 0-2 aty)
% Number of variables : 41 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ connection(A,B)
| ~ value(A,C)
| value(B,C) ),
file('HWV007-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ connection(A,B)
| ~ value(B,C)
| value(A,C) ),
file('HWV007-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ value(A,B)
| ~ value(A,C)
| e_qual_value(B,C) ),
file('HWV007-1.p',unknown),
[] ).
cnf(5,axiom,
~ e_qual_value(n1,n0),
file('HWV007-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ type(A,B)
| mode(A,ok)
| mode(A,abnormal) ),
file('HWV007-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ mode(A,ok)
| ~ type(A,and)
| ~ value(in(B,A),n0)
| value(out(n1,A),n0) ),
file('HWV007-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('HWV007-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ mode(A,ok)
| ~ type(A,and)
| ~ value(out(n1,A),n1)
| value(in(n1,A),n1) ),
file('HWV007-1.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('HWV007-1.p',unknown),
[] ).
cnf(17,axiom,
( ~ mode(A,ok)
| ~ type(A,or)
| ~ value(out(n1,A),n0)
| value(in(n2,A),n0) ),
file('HWV007-1.p',unknown),
[] ).
cnf(19,axiom,
( ~ mode(A,ok)
| ~ type(A,not)
| ~ value(in(n1,A),n1)
| value(out(n1,A),n0) ),
file('HWV007-1.p',unknown),
[] ).
cnf(22,axiom,
( ~ type(A,halfadder)
| type(and1(A),and) ),
file('HWV007-1.p',unknown),
[] ).
cnf(23,axiom,
( ~ type(A,halfadder)
| type(and2(A),and) ),
file('HWV007-1.p',unknown),
[] ).
cnf(24,axiom,
( ~ type(A,halfadder)
| type(not1(A),not) ),
file('HWV007-1.p',unknown),
[] ).
cnf(25,axiom,
( ~ type(A,halfadder)
| type(or1(A),or) ),
file('HWV007-1.p',unknown),
[] ).
cnf(26,axiom,
( ~ type(A,halfadder)
| connection(in(n1,A),in(n1,or1(A))) ),
file('HWV007-1.p',unknown),
[] ).
cnf(27,axiom,
( ~ type(A,halfadder)
| connection(in(n2,A),in(n2,or1(A))) ),
file('HWV007-1.p',unknown),
[] ).
cnf(28,axiom,
( ~ type(A,halfadder)
| connection(in(n1,A),in(n1,and2(A))) ),
file('HWV007-1.p',unknown),
[] ).
cnf(29,axiom,
( ~ type(A,halfadder)
| connection(in(n2,A),in(n2,and2(A))) ),
file('HWV007-1.p',unknown),
[] ).
cnf(30,axiom,
( ~ type(A,halfadder)
| connection(out(s,A),out(n1,and1(A))) ),
file('HWV007-1.p',unknown),
[] ).
cnf(31,axiom,
( ~ type(A,halfadder)
| connection(out(c,A),out(n1,and2(A))) ),
file('HWV007-1.p',unknown),
[] ).
cnf(32,axiom,
( ~ type(A,halfadder)
| connection(out(n1,or1(A)),in(n1,and1(A))) ),
file('HWV007-1.p',unknown),
[] ).
cnf(33,axiom,
( ~ type(A,halfadder)
| connection(out(n1,and2(A)),in(n1,not1(A))) ),
file('HWV007-1.p',unknown),
[] ).
cnf(34,axiom,
( ~ type(A,halfadder)
| connection(out(n1,not1(A)),in(n2,and1(A))) ),
file('HWV007-1.p',unknown),
[] ).
cnf(35,axiom,
( ~ type(A,fulladder)
| type(h1(A),halfadder) ),
file('HWV007-1.p',unknown),
[] ).
cnf(36,axiom,
( ~ type(A,fulladder)
| type(h2(A),halfadder) ),
file('HWV007-1.p',unknown),
[] ).
cnf(37,axiom,
( ~ type(A,fulladder)
| type(or1(A),or) ),
file('HWV007-1.p',unknown),
[] ).
cnf(38,axiom,
( ~ type(A,fulladder)
| connection(out(s,h1(A)),in(n2,h2(A))) ),
file('HWV007-1.p',unknown),
[] ).
cnf(39,axiom,
( ~ type(A,fulladder)
| connection(out(c,h1(A)),in(n2,or1(A))) ),
file('HWV007-1.p',unknown),
[] ).
cnf(41,axiom,
( ~ type(A,fulladder)
| connection(in(n1,A),in(n1,h2(A))) ),
file('HWV007-1.p',unknown),
[] ).
cnf(42,axiom,
( ~ type(A,fulladder)
| connection(in(n2,A),in(n1,h1(A))) ),
file('HWV007-1.p',unknown),
[] ).
cnf(43,axiom,
( ~ type(A,fulladder)
| connection(in(c,A),in(n2,h1(A))) ),
file('HWV007-1.p',unknown),
[] ).
cnf(44,axiom,
( ~ type(A,fulladder)
| connection(out(s,A),out(s,h2(A))) ),
file('HWV007-1.p',unknown),
[] ).
cnf(45,axiom,
( ~ type(A,fulladder)
| connection(out(c,A),out(n1,or1(A))) ),
file('HWV007-1.p',unknown),
[] ).
cnf(46,axiom,
~ mode(and2(h1(f)),abnormal),
file('HWV007-1.p',unknown),
[] ).
cnf(47,axiom,
( ~ mode(or1(f),abnormal)
| ~ mode(and1(h1(f)),abnormal) ),
file('HWV007-1.p',unknown),
[] ).
cnf(48,axiom,
( ~ mode(or1(f),abnormal)
| ~ mode(not1(h1(f)),abnormal) ),
file('HWV007-1.p',unknown),
[] ).
cnf(49,axiom,
( ~ mode(or1(f),abnormal)
| ~ mode(and1(h2(f)),abnormal) ),
file('HWV007-1.p',unknown),
[] ).
cnf(50,axiom,
( ~ mode(or1(f),abnormal)
| ~ mode(or1(h2(f)),abnormal) ),
file('HWV007-1.p',unknown),
[] ).
cnf(52,axiom,
type(f,fulladder),
file('HWV007-1.p',unknown),
[] ).
cnf(53,axiom,
value(in(n1,f),n0),
file('HWV007-1.p',unknown),
[] ).
cnf(54,axiom,
value(in(n2,f),n1),
file('HWV007-1.p',unknown),
[] ).
cnf(55,axiom,
value(in(c,f),n1),
file('HWV007-1.p',unknown),
[] ).
cnf(56,axiom,
value(out(s,f),n1),
file('HWV007-1.p',unknown),
[] ).
cnf(57,axiom,
value(out(c,f),n0),
file('HWV007-1.p',unknown),
[] ).
cnf(58,plain,
connection(out(c,f),out(n1,or1(f))),
inference(hyper,[status(thm)],[52,45]),
[iquote('hyper,52,45')] ).
cnf(59,plain,
connection(out(s,f),out(s,h2(f))),
inference(hyper,[status(thm)],[52,44]),
[iquote('hyper,52,44')] ).
cnf(60,plain,
connection(in(c,f),in(n2,h1(f))),
inference(hyper,[status(thm)],[52,43]),
[iquote('hyper,52,43')] ).
cnf(61,plain,
connection(in(n2,f),in(n1,h1(f))),
inference(hyper,[status(thm)],[52,42]),
[iquote('hyper,52,42')] ).
cnf(62,plain,
connection(in(n1,f),in(n1,h2(f))),
inference(hyper,[status(thm)],[52,41]),
[iquote('hyper,52,41')] ).
cnf(64,plain,
connection(out(c,h1(f)),in(n2,or1(f))),
inference(hyper,[status(thm)],[52,39]),
[iquote('hyper,52,39')] ).
cnf(65,plain,
connection(out(s,h1(f)),in(n2,h2(f))),
inference(hyper,[status(thm)],[52,38]),
[iquote('hyper,52,38')] ).
cnf(66,plain,
type(or1(f),or),
inference(hyper,[status(thm)],[52,37]),
[iquote('hyper,52,37')] ).
cnf(67,plain,
type(h2(f),halfadder),
inference(hyper,[status(thm)],[52,36]),
[iquote('hyper,52,36')] ).
cnf(68,plain,
type(h1(f),halfadder),
inference(hyper,[status(thm)],[52,35]),
[iquote('hyper,52,35')] ).
cnf(70,plain,
( mode(or1(f),ok)
| mode(or1(f),abnormal) ),
inference(hyper,[status(thm)],[66,7]),
[iquote('hyper,66,7')] ).
cnf(73,plain,
connection(out(n1,or1(h2(f))),in(n1,and1(h2(f)))),
inference(hyper,[status(thm)],[67,32]),
[iquote('hyper,67,32')] ).
cnf(75,plain,
connection(out(s,h2(f)),out(n1,and1(h2(f)))),
inference(hyper,[status(thm)],[67,30]),
[iquote('hyper,67,30')] ).
cnf(78,plain,
connection(in(n2,h2(f)),in(n2,or1(h2(f)))),
inference(hyper,[status(thm)],[67,27]),
[iquote('hyper,67,27')] ).
cnf(79,plain,
connection(in(n1,h2(f)),in(n1,or1(h2(f)))),
inference(hyper,[status(thm)],[67,26]),
[iquote('hyper,67,26')] ).
cnf(80,plain,
type(or1(h2(f)),or),
inference(hyper,[status(thm)],[67,25]),
[iquote('hyper,67,25')] ).
cnf(83,plain,
type(and1(h2(f)),and),
inference(hyper,[status(thm)],[67,22]),
[iquote('hyper,67,22')] ).
cnf(85,plain,
connection(out(n1,not1(h1(f))),in(n2,and1(h1(f)))),
inference(hyper,[status(thm)],[68,34]),
[iquote('hyper,68,34')] ).
cnf(86,plain,
connection(out(n1,and2(h1(f))),in(n1,not1(h1(f)))),
inference(hyper,[status(thm)],[68,33]),
[iquote('hyper,68,33')] ).
cnf(88,plain,
connection(out(c,h1(f)),out(n1,and2(h1(f)))),
inference(hyper,[status(thm)],[68,31]),
[iquote('hyper,68,31')] ).
cnf(89,plain,
connection(out(s,h1(f)),out(n1,and1(h1(f)))),
inference(hyper,[status(thm)],[68,30]),
[iquote('hyper,68,30')] ).
cnf(90,plain,
connection(in(n2,h1(f)),in(n2,and2(h1(f)))),
inference(hyper,[status(thm)],[68,29]),
[iquote('hyper,68,29')] ).
cnf(91,plain,
connection(in(n1,h1(f)),in(n1,and2(h1(f)))),
inference(hyper,[status(thm)],[68,28]),
[iquote('hyper,68,28')] ).
cnf(95,plain,
type(not1(h1(f)),not),
inference(hyper,[status(thm)],[68,24]),
[iquote('hyper,68,24')] ).
cnf(96,plain,
type(and2(h1(f)),and),
inference(hyper,[status(thm)],[68,23]),
[iquote('hyper,68,23')] ).
cnf(97,plain,
type(and1(h1(f)),and),
inference(hyper,[status(thm)],[68,22]),
[iquote('hyper,68,22')] ).
cnf(101,plain,
( mode(or1(h2(f)),ok)
| mode(or1(h2(f)),abnormal) ),
inference(hyper,[status(thm)],[80,7]),
[iquote('hyper,80,7')] ).
cnf(104,plain,
( mode(and1(h2(f)),ok)
| mode(and1(h2(f)),abnormal) ),
inference(hyper,[status(thm)],[83,7]),
[iquote('hyper,83,7')] ).
cnf(105,plain,
value(out(n1,or1(f)),n0),
inference(hyper,[status(thm)],[58,1,57]),
[iquote('hyper,58,1,57')] ).
cnf(107,plain,
( mode(not1(h1(f)),ok)
| mode(not1(h1(f)),abnormal) ),
inference(hyper,[status(thm)],[95,7]),
[iquote('hyper,95,7')] ).
cnf(108,plain,
mode(and2(h1(f)),ok),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[96,7]),46]),
[iquote('hyper,96,7,unit_del,46')] ).
cnf(109,plain,
( mode(and1(h1(f)),ok)
| mode(and1(h1(f)),abnormal) ),
inference(hyper,[status(thm)],[97,7]),
[iquote('hyper,97,7')] ).
cnf(110,plain,
value(out(s,h2(f)),n1),
inference(hyper,[status(thm)],[59,1,56]),
[iquote('hyper,59,1,56')] ).
cnf(111,plain,
value(in(n2,h1(f)),n1),
inference(hyper,[status(thm)],[60,1,55]),
[iquote('hyper,60,1,55')] ).
cnf(112,plain,
value(in(n1,h1(f)),n1),
inference(hyper,[status(thm)],[61,1,54]),
[iquote('hyper,61,1,54')] ).
cnf(113,plain,
value(in(n1,h2(f)),n0),
inference(hyper,[status(thm)],[62,1,53]),
[iquote('hyper,62,1,53')] ).
cnf(114,plain,
( mode(or1(f),abnormal)
| value(in(n2,or1(f)),n0) ),
inference(hyper,[status(thm)],[70,17,66,105]),
[iquote('hyper,70,17,66,105')] ).
cnf(116,plain,
value(out(n1,and1(h2(f))),n1),
inference(hyper,[status(thm)],[75,1,110]),
[iquote('hyper,75,1,110')] ).
cnf(118,plain,
value(in(n1,or1(h2(f))),n0),
inference(hyper,[status(thm)],[79,1,113]),
[iquote('hyper,79,1,113')] ).
cnf(119,plain,
value(in(n2,and2(h1(f))),n1),
inference(hyper,[status(thm)],[90,1,111]),
[iquote('hyper,90,1,111')] ).
cnf(120,plain,
value(in(n1,and2(h1(f))),n1),
inference(hyper,[status(thm)],[91,1,112]),
[iquote('hyper,91,1,112')] ).
cnf(121,plain,
value(out(n1,and2(h1(f))),n1),
inference(hyper,[status(thm)],[120,9,108,96,119]),
[iquote('hyper,120,9,108,96,119')] ).
cnf(122,plain,
value(out(c,h1(f)),n1),
inference(hyper,[status(thm)],[121,2,88]),
[iquote('hyper,121,2,88')] ).
cnf(123,plain,
value(in(n2,or1(f)),n1),
inference(hyper,[status(thm)],[122,1,64]),
[iquote('hyper,122,1,64')] ).
cnf(126,plain,
value(in(n1,not1(h1(f))),n1),
inference(hyper,[status(thm)],[86,1,121]),
[iquote('hyper,86,1,121')] ).
cnf(152,plain,
mode(or1(f),abnormal),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[114,3,123]),5]),
[iquote('hyper,114,3,123,unit_del,5')] ).
cnf(153,plain,
mode(or1(h2(f)),ok),
inference(hyper,[status(thm)],[152,50,101]),
[iquote('hyper,152,50,101')] ).
cnf(154,plain,
mode(and1(h2(f)),ok),
inference(hyper,[status(thm)],[152,49,104]),
[iquote('hyper,152,49,104')] ).
cnf(155,plain,
mode(not1(h1(f)),ok),
inference(hyper,[status(thm)],[152,48,107]),
[iquote('hyper,152,48,107')] ).
cnf(156,plain,
mode(and1(h1(f)),ok),
inference(hyper,[status(thm)],[152,47,109]),
[iquote('hyper,152,47,109')] ).
cnf(160,plain,
value(in(n1,and1(h2(f))),n1),
inference(hyper,[status(thm)],[154,11,83,116]),
[iquote('hyper,154,11,83,116')] ).
cnf(161,plain,
value(out(n1,not1(h1(f))),n0),
inference(hyper,[status(thm)],[155,19,95,126]),
[iquote('hyper,155,19,95,126')] ).
cnf(164,plain,
value(out(n1,or1(h2(f))),n1),
inference(hyper,[status(thm)],[160,2,73]),
[iquote('hyper,160,2,73')] ).
cnf(165,plain,
value(in(n2,and1(h1(f))),n0),
inference(hyper,[status(thm)],[161,1,85]),
[iquote('hyper,161,1,85')] ).
cnf(169,plain,
value(out(n1,and1(h1(f))),n0),
inference(hyper,[status(thm)],[165,8,156,97]),
[iquote('hyper,165,8,156,97')] ).
cnf(170,plain,
value(out(s,h1(f)),n0),
inference(hyper,[status(thm)],[169,2,89]),
[iquote('hyper,169,2,89')] ).
cnf(171,plain,
value(in(n2,h2(f)),n0),
inference(hyper,[status(thm)],[170,1,65]),
[iquote('hyper,170,1,65')] ).
cnf(172,plain,
value(in(n2,or1(h2(f))),n0),
inference(hyper,[status(thm)],[171,1,78]),
[iquote('hyper,171,1,78')] ).
cnf(174,plain,
value(out(n1,or1(h2(f))),n0),
inference(hyper,[status(thm)],[172,14,153,80,118]),
[iquote('hyper,172,14,153,80,118')] ).
cnf(175,plain,
e_qual_value(n1,n0),
inference(hyper,[status(thm)],[174,3,164]),
[iquote('hyper,174,3,164')] ).
cnf(176,plain,
$false,
inference(binary,[status(thm)],[175,5]),
[iquote('binary,175.1,5.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.25 % Problem : HWV007-1 : TPTP v8.1.0. Released v2.1.0.
% 0.12/0.26 % Command : otter-tptp-script %s
% 0.12/0.47 % Computer : n019.cluster.edu
% 0.12/0.47 % Model : x86_64 x86_64
% 0.12/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.47 % Memory : 8042.1875MB
% 0.12/0.47 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.47 % CPULimit : 300
% 0.12/0.47 % WCLimit : 300
% 0.12/0.47 % DateTime : Wed Jul 27 06:42:37 EDT 2022
% 0.12/0.47 % CPUTime :
% 1.68/2.20 ----- Otter 3.3f, August 2004 -----
% 1.68/2.20 The process was started by sandbox2 on n019.cluster.edu,
% 1.68/2.20 Wed Jul 27 06:42:37 2022
% 1.68/2.20 The command was "./otter". The process ID is 23442.
% 1.68/2.20
% 1.68/2.20 set(prolog_style_variables).
% 1.68/2.20 set(auto).
% 1.68/2.20 dependent: set(auto1).
% 1.68/2.20 dependent: set(process_input).
% 1.68/2.20 dependent: clear(print_kept).
% 1.68/2.20 dependent: clear(print_new_demod).
% 1.68/2.20 dependent: clear(print_back_demod).
% 1.68/2.20 dependent: clear(print_back_sub).
% 1.68/2.20 dependent: set(control_memory).
% 1.68/2.20 dependent: assign(max_mem, 12000).
% 1.68/2.20 dependent: assign(pick_given_ratio, 4).
% 1.68/2.20 dependent: assign(stats_level, 1).
% 1.68/2.20 dependent: assign(max_seconds, 10800).
% 1.68/2.20 clear(print_given).
% 1.68/2.20
% 1.68/2.20 list(usable).
% 1.68/2.20 0 [] -connection(P1,P2)| -value(P1,V)|value(P2,V).
% 1.68/2.20 0 [] -connection(P1,P2)| -value(P2,V)|value(P1,V).
% 1.68/2.20 0 [] -value(P,V1)| -value(P,V2)|e_qual_value(V1,V2).
% 1.68/2.20 0 [] -e_qual_value(n0,n1).
% 1.68/2.20 0 [] -e_qual_value(n1,n0).
% 1.68/2.20 0 [] -mode(K,ok)| -mode(K,abnormal).
% 1.68/2.20 0 [] -type(K,Any)|mode(K,ok)|mode(K,abnormal).
% 1.68/2.20 0 [] -mode(K,ok)| -type(K,and)| -value(in(Any,K),n0)|value(out(n1,K),n0).
% 1.68/2.20 0 [] -mode(K,ok)| -type(K,and)| -value(in(n1,K),n1)| -value(in(n2,K),n1)|value(out(n1,K),n1).
% 1.68/2.20 0 [] -mode(K,ok)| -type(K,and)| -value(out(n1,K),n0)|value(in(n1,K),n0)|value(in(n2,K),n0).
% 1.68/2.20 0 [] -mode(K,ok)| -type(K,and)| -value(out(n1,K),n1)|value(in(n1,K),n1).
% 1.68/2.20 0 [] -mode(K,ok)| -type(K,and)| -value(out(n1,K),n1)|value(in(n2,K),n1).
% 1.68/2.20 0 [] -mode(K,ok)| -type(K,or)| -value(in(Any,K),n1)|value(out(n1,K),n1).
% 1.68/2.20 0 [] -mode(K,ok)| -type(K,or)| -value(in(n1,K),n0)| -value(in(n2,K),n0)|value(out(n1,K),n0).
% 1.68/2.20 0 [] -mode(K,ok)| -type(K,or)| -value(out(n1,K),n1)|value(in(n1,K),n1)|value(in(n2,K),n1).
% 1.68/2.20 0 [] -mode(K,ok)| -type(K,or)| -value(out(n1,K),n0)|value(in(n1,K),n0).
% 1.68/2.20 0 [] -mode(K,ok)| -type(K,or)| -value(out(n1,K),n0)|value(in(n2,K),n0).
% 1.68/2.20 0 [] -mode(K,ok)| -type(K,not)| -value(in(n1,K),n0)|value(out(n1,K),n1).
% 1.68/2.20 0 [] -mode(K,ok)| -type(K,not)| -value(in(n1,K),n1)|value(out(n1,K),n0).
% 1.68/2.20 0 [] -mode(K,ok)| -type(K,not)| -value(out(n1,K),n0)|value(in(n1,K),n1).
% 1.68/2.20 0 [] -mode(K,ok)| -type(K,not)| -value(out(n1,K),n1)|value(in(n1,K),n0).
% 1.68/2.20 0 [] -type(X,halfadder)|type(and1(X),and).
% 1.68/2.20 0 [] -type(X,halfadder)|type(and2(X),and).
% 1.68/2.20 0 [] -type(X,halfadder)|type(not1(X),not).
% 1.68/2.20 0 [] -type(X,halfadder)|type(or1(X),or).
% 1.68/2.20 0 [] -type(X,halfadder)|connection(in(n1,X),in(n1,or1(X))).
% 1.68/2.20 0 [] -type(X,halfadder)|connection(in(n2,X),in(n2,or1(X))).
% 1.68/2.20 0 [] -type(X,halfadder)|connection(in(n1,X),in(n1,and2(X))).
% 1.68/2.20 0 [] -type(X,halfadder)|connection(in(n2,X),in(n2,and2(X))).
% 1.68/2.20 0 [] -type(X,halfadder)|connection(out(s,X),out(n1,and1(X))).
% 1.68/2.20 0 [] -type(X,halfadder)|connection(out(c,X),out(n1,and2(X))).
% 1.68/2.20 0 [] -type(X,halfadder)|connection(out(n1,or1(X)),in(n1,and1(X))).
% 1.68/2.20 0 [] -type(X,halfadder)|connection(out(n1,and2(X)),in(n1,not1(X))).
% 1.68/2.20 0 [] -type(X,halfadder)|connection(out(n1,not1(X)),in(n2,and1(X))).
% 1.68/2.20 0 [] -type(X,fulladder)|type(h1(X),halfadder).
% 1.68/2.20 0 [] -type(X,fulladder)|type(h2(X),halfadder).
% 1.68/2.20 0 [] -type(X,fulladder)|type(or1(X),or).
% 1.68/2.20 0 [] -type(X,fulladder)|connection(out(s,h1(X)),in(n2,h2(X))).
% 1.68/2.20 0 [] -type(X,fulladder)|connection(out(c,h1(X)),in(n2,or1(X))).
% 1.68/2.20 0 [] -type(X,fulladder)|connection(out(c,h2(X)),in(n1,or1(X))).
% 1.68/2.20 0 [] -type(X,fulladder)|connection(in(n1,X),in(n1,h2(X))).
% 1.68/2.20 0 [] -type(X,fulladder)|connection(in(n2,X),in(n1,h1(X))).
% 1.68/2.20 0 [] -type(X,fulladder)|connection(in(c,X),in(n2,h1(X))).
% 1.68/2.20 0 [] -type(X,fulladder)|connection(out(s,X),out(s,h2(X))).
% 1.68/2.20 0 [] -type(X,fulladder)|connection(out(c,X),out(n1,or1(X))).
% 1.68/2.20 0 [] type(f,fulladder).
% 1.68/2.20 0 [] value(in(n1,f),n0).
% 1.68/2.20 0 [] value(in(n2,f),n1).
% 1.68/2.20 0 [] value(in(c,f),n1).
% 1.68/2.20 0 [] value(out(s,f),n1).
% 1.68/2.20 0 [] value(out(c,f),n0).
% 1.68/2.20 0 [] -mode(and2(h1(f)),abnormal).
% 1.68/2.20 0 [] -mode(or1(f),abnormal)| -mode(and1(h1(f)),abnormal).
% 1.68/2.20 0 [] -mode(or1(f),abnormal)| -mode(not1(h1(f)),abnormal).
% 1.68/2.20 0 [] -mode(or1(f),abnormal)| -mode(and1(h2(f)),abnormal).
% 1.68/2.20 0 [] -mode(or1(f),abnormal)| -mode(or1(h2(f)),abnormal).
% 1.68/2.20 end_of_list.
% 1.68/2.20
% 1.68/2.20 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.68/2.20
% 1.68/2.20 This is a non-Horn set without equality. The strategy will
% 1.68/2.20 be ordered hyper_res, unit deletion, and factoring, with
% 1.68/2.20 satellites in sos and with nuclei in usable.
% 1.68/2.20
% 1.68/2.20 dependent: set(hyper_res).
% 1.68/2.20 dependent: set(factor).
% 1.68/2.20 dependent: set(unit_deletion).
% 1.68/2.20
% 1.68/2.20 ------------> process usable:
% 1.68/2.20 ** KEPT (pick-wt=9): 1 [] -connection(A,B)| -value(A,C)|value(B,C).
% 1.68/2.20 ** KEPT (pick-wt=9): 2 [] -connection(A,B)| -value(B,C)|value(A,C).
% 1.68/2.20 ** KEPT (pick-wt=9): 3 [] -value(A,B)| -value(A,C)|e_qual_value(B,C).
% 1.68/2.20 ** KEPT (pick-wt=3): 4 [] -e_qual_value(n0,n1).
% 1.68/2.20 ** KEPT (pick-wt=3): 5 [] -e_qual_value(n1,n0).
% 1.68/2.20 ** KEPT (pick-wt=6): 6 [] -mode(A,ok)| -mode(A,abnormal).
% 1.68/2.20 ** KEPT (pick-wt=9): 7 [] -type(A,B)|mode(A,ok)|mode(A,abnormal).
% 1.68/2.20 ** KEPT (pick-wt=16): 8 [] -mode(A,ok)| -type(A,and)| -value(in(B,A),n0)|value(out(n1,A),n0).
% 1.68/2.20 ** 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.68/2.20 ** 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.68/2.20 ** KEPT (pick-wt=16): 11 [] -mode(A,ok)| -type(A,and)| -value(out(n1,A),n1)|value(in(n1,A),n1).
% 1.68/2.20 ** KEPT (pick-wt=16): 12 [] -mode(A,ok)| -type(A,and)| -value(out(n1,A),n1)|value(in(n2,A),n1).
% 1.68/2.20 ** KEPT (pick-wt=16): 13 [] -mode(A,ok)| -type(A,or)| -value(in(B,A),n1)|value(out(n1,A),n1).
% 1.68/2.20 ** 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.68/2.20 ** 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.68/2.20 ** KEPT (pick-wt=16): 16 [] -mode(A,ok)| -type(A,or)| -value(out(n1,A),n0)|value(in(n1,A),n0).
% 1.68/2.20 ** KEPT (pick-wt=16): 17 [] -mode(A,ok)| -type(A,or)| -value(out(n1,A),n0)|value(in(n2,A),n0).
% 1.68/2.20 ** KEPT (pick-wt=16): 18 [] -mode(A,ok)| -type(A,not)| -value(in(n1,A),n0)|value(out(n1,A),n1).
% 1.68/2.20 ** KEPT (pick-wt=16): 19 [] -mode(A,ok)| -type(A,not)| -value(in(n1,A),n1)|value(out(n1,A),n0).
% 1.68/2.20 ** KEPT (pick-wt=16): 20 [] -mode(A,ok)| -type(A,not)| -value(out(n1,A),n0)|value(in(n1,A),n1).
% 1.68/2.20 ** KEPT (pick-wt=16): 21 [] -mode(A,ok)| -type(A,not)| -value(out(n1,A),n1)|value(in(n1,A),n0).
% 1.68/2.20 ** KEPT (pick-wt=7): 22 [] -type(A,halfadder)|type(and1(A),and).
% 1.68/2.20 ** KEPT (pick-wt=7): 23 [] -type(A,halfadder)|type(and2(A),and).
% 1.68/2.20 ** KEPT (pick-wt=7): 24 [] -type(A,halfadder)|type(not1(A),not).
% 1.68/2.20 ** KEPT (pick-wt=7): 25 [] -type(A,halfadder)|type(or1(A),or).
% 1.68/2.20 ** KEPT (pick-wt=11): 26 [] -type(A,halfadder)|connection(in(n1,A),in(n1,or1(A))).
% 1.68/2.20 ** KEPT (pick-wt=11): 27 [] -type(A,halfadder)|connection(in(n2,A),in(n2,or1(A))).
% 1.68/2.20 ** KEPT (pick-wt=11): 28 [] -type(A,halfadder)|connection(in(n1,A),in(n1,and2(A))).
% 1.68/2.20 ** KEPT (pick-wt=11): 29 [] -type(A,halfadder)|connection(in(n2,A),in(n2,and2(A))).
% 1.68/2.20 ** KEPT (pick-wt=11): 30 [] -type(A,halfadder)|connection(out(s,A),out(n1,and1(A))).
% 1.68/2.20 ** KEPT (pick-wt=11): 31 [] -type(A,halfadder)|connection(out(c,A),out(n1,and2(A))).
% 1.68/2.20 ** KEPT (pick-wt=12): 32 [] -type(A,halfadder)|connection(out(n1,or1(A)),in(n1,and1(A))).
% 1.68/2.20 ** KEPT (pick-wt=12): 33 [] -type(A,halfadder)|connection(out(n1,and2(A)),in(n1,not1(A))).
% 1.68/2.20 ** KEPT (pick-wt=12): 34 [] -type(A,halfadder)|connection(out(n1,not1(A)),in(n2,and1(A))).
% 1.68/2.20 ** KEPT (pick-wt=7): 35 [] -type(A,fulladder)|type(h1(A),halfadder).
% 1.68/2.20 ** KEPT (pick-wt=7): 36 [] -type(A,fulladder)|type(h2(A),halfadder).
% 1.68/2.20 ** KEPT (pick-wt=7): 37 [] -type(A,fulladder)|type(or1(A),or).
% 1.68/2.20 ** KEPT (pick-wt=12): 38 [] -type(A,fulladder)|connection(out(s,h1(A)),in(n2,h2(A))).
% 1.68/2.20 ** KEPT (pick-wt=12): 39 [] -type(A,fulladder)|connection(out(c,h1(A)),in(n2,or1(A))).
% 1.68/2.20 ** KEPT (pick-wt=12): 40 [] -type(A,fulladder)|connection(out(c,h2(A)),in(n1,or1(A))).
% 1.68/2.20 ** KEPT (pick-wt=11): 41 [] -type(A,fulladder)|connection(in(n1,A),in(n1,h2(A))).
% 1.68/2.20 ** KEPT (pick-wt=11): 42 [] -type(A,fulladder)|connection(in(n2,A),in(n1,h1(A))).
% 1.68/2.20 ** KEPT (pick-wt=11): 43 [] -type(A,fulladder)|connection(in(c,A),in(n2,h1(A))).
% 1.68/2.20 ** KEPT (pick-wt=11): 44 [] -type(A,fulladder)|connection(out(s,A),out(s,h2(A))).
% 1.68/2.20 ** KEPT (pick-wt=11): 45 [] -type(A,fulladder)|connection(out(c,A),out(n1,or1(A))).
% 1.68/2.20 ** KEPT (pick-wt=5): 46 [] -mode(and2(h1(f)),abnormal).
% 1.68/2.20 ** KEPT (pick-wt=9): 47 [] -mode(or1(f),abnormal)| -mode(and1(h1(f)),abnormal).
% 1.68/2.20 ** KEPT (pick-wt=9): 48 [] -mode(or1(f),abnormal)| -mode(not1(h1(f)),abnormal).
% 1.68/2.20 ** KEPT (pick-wt=9): 49 [] -mode(or1(f),abnormal)| -mode(and1(h2(f)),abnormal).
% 1.68/2.20 ** KEPT (pick-wt=9): 50 [] -mode(or1(f),abnormal)| -mode(or1(h2(f)),abnormal).
% 1.68/2.20
% 1.68/2.20 ------------> process sos:
% 1.68/2.20 ** KEPT (pick-wt=3): 52 [] type(f,fulladder).
% 1.68/2.20 ** KEPT (pick-wt=5): 53 [] value(in(n1,f),n0).
% 1.68/2.20 ** KEPT (pick-wt=5): 54 [] value(in(n2,f),n1).
% 1.68/2.20 ** KEPT (pick-wt=5): 55 [] value(in(c,f),n1).
% 1.68/2.20 ** KEPT (pick-wt=5): 56 [] value(out(s,f),n1).
% 1.68/2.20 ** KEPT (pick-wt=5): 57 [] value(out(c,f),n0).
% 1.68/2.20
% 1.68/2.20 ======= end of input processing =======
% 1.68/2.20
% 1.68/2.20 =========== start of search ===========
% 1.68/2.20
% 1.68/2.20 -------- PROOF --------
% 1.68/2.20
% 1.68/2.20 ----> UNIT CONFLICT at 0.01 sec ----> 176 [binary,175.1,5.1] $F.
% 1.68/2.20
% 1.68/2.20 Length of proof is 60. Level of proof is 16.
% 1.68/2.20
% 1.68/2.20 ---------------- PROOF ----------------
% 1.68/2.20 % SZS status Unsatisfiable
% 1.68/2.20 % SZS output start Refutation
% See solution above
% 1.68/2.20 ------------ end of proof -------------
% 1.68/2.20
% 1.68/2.20
% 1.68/2.20 Search stopped by max_proofs option.
% 1.68/2.20
% 1.68/2.20
% 1.68/2.20 Search stopped by max_proofs option.
% 1.68/2.20
% 1.68/2.20 ============ end of search ============
% 1.68/2.20
% 1.68/2.20 -------------- statistics -------------
% 1.68/2.20 clauses given 99
% 1.68/2.20 clauses generated 302
% 1.68/2.20 clauses kept 175
% 1.68/2.20 clauses forward subsumed 183
% 1.68/2.20 clauses back subsumed 30
% 1.68/2.20 Kbytes malloced 1953
% 1.68/2.20
% 1.68/2.20 ----------- times (seconds) -----------
% 1.68/2.20 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.68/2.20 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/2.20 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.68/2.20
% 1.68/2.20 That finishes the proof of the theorem.
% 1.68/2.20
% 1.68/2.20 Process 23442 finished Wed Jul 27 06:42:38 2022
% 1.68/2.20 Otter interrupted
% 1.68/2.20 PROOF FOUND
%------------------------------------------------------------------------------