TSTP Solution File: HWV006-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : HWV006-1 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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 2.13s 2.30s
% Output : Refutation 2.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 48
% Syntax : Number of clauses : 117 ( 78 unt; 5 nHn; 117 RR)
% Number of literals : 175 ( 0 equ; 62 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 : 42 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ connection(A,B)
| ~ value(A,C)
| value(B,C) ),
file('HWV006-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ connection(A,B)
| ~ value(B,C)
| value(A,C) ),
file('HWV006-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ value(A,B)
| ~ value(A,C)
| e_qual_value(B,C) ),
file('HWV006-1.p',unknown),
[] ).
cnf(4,axiom,
~ e_qual_value(n0,n1),
file('HWV006-1.p',unknown),
[] ).
cnf(5,axiom,
~ e_qual_value(n1,n0),
file('HWV006-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ type(A,B)
| mode(A,ok)
| mode(A,abnormal) ),
file('HWV006-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ mode(A,ok)
| ~ type(A,and)
| ~ value(in(B,A),n0)
| value(out(n1,A),n0) ),
file('HWV006-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('HWV006-1.p',unknown),
[] ).
cnf(12,axiom,
( ~ mode(A,ok)
| ~ type(A,and)
| ~ value(out(n1,A),n1)
| value(in(n2,A),n1) ),
file('HWV006-1.p',unknown),
[] ).
cnf(13,axiom,
( ~ mode(A,ok)
| ~ type(A,or)
| ~ value(in(B,A),n1)
| value(out(n1,A),n1) ),
file('HWV006-1.p',unknown),
[] ).
cnf(16,axiom,
( ~ mode(A,ok)
| ~ type(A,or)
| ~ value(out(n1,A),n0)
| value(in(n1,A),n0) ),
file('HWV006-1.p',unknown),
[] ).
cnf(18,axiom,
( ~ mode(A,ok)
| ~ type(A,not)
| ~ value(in(n1,A),n0)
| value(out(n1,A),n1) ),
file('HWV006-1.p',unknown),
[] ).
cnf(19,axiom,
( ~ mode(A,ok)
| ~ type(A,not)
| ~ value(in(n1,A),n1)
| value(out(n1,A),n0) ),
file('HWV006-1.p',unknown),
[] ).
cnf(22,axiom,
( ~ type(A,halfadder)
| type(and1(A),and) ),
file('HWV006-1.p',unknown),
[] ).
cnf(23,axiom,
( ~ type(A,halfadder)
| type(and2(A),and) ),
file('HWV006-1.p',unknown),
[] ).
cnf(24,axiom,
( ~ type(A,halfadder)
| type(not1(A),not) ),
file('HWV006-1.p',unknown),
[] ).
cnf(25,axiom,
( ~ type(A,halfadder)
| type(or1(A),or) ),
file('HWV006-1.p',unknown),
[] ).
cnf(27,axiom,
( ~ type(A,halfadder)
| connection(in(n2,A),in(n2,or1(A))) ),
file('HWV006-1.p',unknown),
[] ).
cnf(28,axiom,
( ~ type(A,halfadder)
| connection(in(n1,A),in(n1,and2(A))) ),
file('HWV006-1.p',unknown),
[] ).
cnf(29,axiom,
( ~ type(A,halfadder)
| connection(in(n2,A),in(n2,and2(A))) ),
file('HWV006-1.p',unknown),
[] ).
cnf(30,axiom,
( ~ type(A,halfadder)
| connection(out(s,A),out(n1,and1(A))) ),
file('HWV006-1.p',unknown),
[] ).
cnf(31,axiom,
( ~ type(A,halfadder)
| connection(out(c,A),out(n1,and2(A))) ),
file('HWV006-1.p',unknown),
[] ).
cnf(32,axiom,
( ~ type(A,halfadder)
| connection(out(n1,or1(A)),in(n1,and1(A))) ),
file('HWV006-1.p',unknown),
[] ).
cnf(33,axiom,
( ~ type(A,halfadder)
| connection(out(n1,and2(A)),in(n1,not1(A))) ),
file('HWV006-1.p',unknown),
[] ).
cnf(34,axiom,
( ~ type(A,halfadder)
| connection(out(n1,not1(A)),in(n2,and1(A))) ),
file('HWV006-1.p',unknown),
[] ).
cnf(35,axiom,
( ~ type(A,fulladder)
| type(h1(A),halfadder) ),
file('HWV006-1.p',unknown),
[] ).
cnf(36,axiom,
( ~ type(A,fulladder)
| type(h2(A),halfadder) ),
file('HWV006-1.p',unknown),
[] ).
cnf(37,axiom,
( ~ type(A,fulladder)
| type(or1(A),or) ),
file('HWV006-1.p',unknown),
[] ).
cnf(38,axiom,
( ~ type(A,fulladder)
| connection(out(s,h1(A)),in(n2,h2(A))) ),
file('HWV006-1.p',unknown),
[] ).
cnf(40,axiom,
( ~ type(A,fulladder)
| connection(out(c,h2(A)),in(n1,or1(A))) ),
file('HWV006-1.p',unknown),
[] ).
cnf(41,axiom,
( ~ type(A,fulladder)
| connection(in(n1,A),in(n1,h2(A))) ),
file('HWV006-1.p',unknown),
[] ).
cnf(42,axiom,
( ~ type(A,fulladder)
| connection(in(n2,A),in(n1,h1(A))) ),
file('HWV006-1.p',unknown),
[] ).
cnf(43,axiom,
( ~ type(A,fulladder)
| connection(in(c,A),in(n2,h1(A))) ),
file('HWV006-1.p',unknown),
[] ).
cnf(44,axiom,
( ~ type(A,fulladder)
| connection(out(s,A),out(s,h2(A))) ),
file('HWV006-1.p',unknown),
[] ).
cnf(45,axiom,
( ~ type(A,fulladder)
| connection(out(c,A),out(n1,or1(A))) ),
file('HWV006-1.p',unknown),
[] ).
cnf(46,axiom,
( ~ mode(or1(f),abnormal)
| ~ mode(not1(h2(f)),abnormal) ),
file('HWV006-1.p',unknown),
[] ).
cnf(47,axiom,
~ mode(and2(h2(f)),abnormal),
file('HWV006-1.p',unknown),
[] ).
cnf(48,axiom,
( ~ mode(or1(f),abnormal)
| ~ mode(and1(h2(f)),abnormal) ),
file('HWV006-1.p',unknown),
[] ).
cnf(49,axiom,
~ mode(or1(h1(f)),abnormal),
file('HWV006-1.p',unknown),
[] ).
cnf(50,axiom,
~ mode(not1(h1(f)),abnormal),
file('HWV006-1.p',unknown),
[] ).
cnf(51,axiom,
~ mode(and2(h1(f)),abnormal),
file('HWV006-1.p',unknown),
[] ).
cnf(52,axiom,
~ mode(and1(h1(f)),abnormal),
file('HWV006-1.p',unknown),
[] ).
cnf(54,axiom,
type(f,fulladder),
file('HWV006-1.p',unknown),
[] ).
cnf(55,axiom,
value(in(n1,f),n1),
file('HWV006-1.p',unknown),
[] ).
cnf(56,axiom,
value(in(n2,f),n0),
file('HWV006-1.p',unknown),
[] ).
cnf(57,axiom,
value(in(c,f),n1),
file('HWV006-1.p',unknown),
[] ).
cnf(58,axiom,
value(out(s,f),n1),
file('HWV006-1.p',unknown),
[] ).
cnf(59,axiom,
value(out(c,f),n0),
file('HWV006-1.p',unknown),
[] ).
cnf(60,plain,
connection(out(c,f),out(n1,or1(f))),
inference(hyper,[status(thm)],[54,45]),
[iquote('hyper,54,45')] ).
cnf(61,plain,
connection(out(s,f),out(s,h2(f))),
inference(hyper,[status(thm)],[54,44]),
[iquote('hyper,54,44')] ).
cnf(62,plain,
connection(in(c,f),in(n2,h1(f))),
inference(hyper,[status(thm)],[54,43]),
[iquote('hyper,54,43')] ).
cnf(63,plain,
connection(in(n2,f),in(n1,h1(f))),
inference(hyper,[status(thm)],[54,42]),
[iquote('hyper,54,42')] ).
cnf(64,plain,
connection(in(n1,f),in(n1,h2(f))),
inference(hyper,[status(thm)],[54,41]),
[iquote('hyper,54,41')] ).
cnf(65,plain,
connection(out(c,h2(f)),in(n1,or1(f))),
inference(hyper,[status(thm)],[54,40]),
[iquote('hyper,54,40')] ).
cnf(67,plain,
connection(out(s,h1(f)),in(n2,h2(f))),
inference(hyper,[status(thm)],[54,38]),
[iquote('hyper,54,38')] ).
cnf(68,plain,
type(or1(f),or),
inference(hyper,[status(thm)],[54,37]),
[iquote('hyper,54,37')] ).
cnf(69,plain,
type(h2(f),halfadder),
inference(hyper,[status(thm)],[54,36]),
[iquote('hyper,54,36')] ).
cnf(70,plain,
type(h1(f),halfadder),
inference(hyper,[status(thm)],[54,35]),
[iquote('hyper,54,35')] ).
cnf(72,plain,
( mode(or1(f),ok)
| mode(or1(f),abnormal) ),
inference(hyper,[status(thm)],[68,7]),
[iquote('hyper,68,7')] ).
cnf(73,plain,
connection(out(n1,not1(h2(f))),in(n2,and1(h2(f)))),
inference(hyper,[status(thm)],[69,34]),
[iquote('hyper,69,34')] ).
cnf(74,plain,
connection(out(n1,and2(h2(f))),in(n1,not1(h2(f)))),
inference(hyper,[status(thm)],[69,33]),
[iquote('hyper,69,33')] ).
cnf(76,plain,
connection(out(c,h2(f)),out(n1,and2(h2(f)))),
inference(hyper,[status(thm)],[69,31]),
[iquote('hyper,69,31')] ).
cnf(77,plain,
connection(out(s,h2(f)),out(n1,and1(h2(f)))),
inference(hyper,[status(thm)],[69,30]),
[iquote('hyper,69,30')] ).
cnf(78,plain,
connection(in(n2,h2(f)),in(n2,and2(h2(f)))),
inference(hyper,[status(thm)],[69,29]),
[iquote('hyper,69,29')] ).
cnf(79,plain,
connection(in(n1,h2(f)),in(n1,and2(h2(f)))),
inference(hyper,[status(thm)],[69,28]),
[iquote('hyper,69,28')] ).
cnf(83,plain,
type(not1(h2(f)),not),
inference(hyper,[status(thm)],[69,24]),
[iquote('hyper,69,24')] ).
cnf(84,plain,
type(and2(h2(f)),and),
inference(hyper,[status(thm)],[69,23]),
[iquote('hyper,69,23')] ).
cnf(85,plain,
type(and1(h2(f)),and),
inference(hyper,[status(thm)],[69,22]),
[iquote('hyper,69,22')] ).
cnf(87,plain,
connection(out(n1,not1(h1(f))),in(n2,and1(h1(f)))),
inference(hyper,[status(thm)],[70,34]),
[iquote('hyper,70,34')] ).
cnf(88,plain,
connection(out(n1,and2(h1(f))),in(n1,not1(h1(f)))),
inference(hyper,[status(thm)],[70,33]),
[iquote('hyper,70,33')] ).
cnf(89,plain,
connection(out(n1,or1(h1(f))),in(n1,and1(h1(f)))),
inference(hyper,[status(thm)],[70,32]),
[iquote('hyper,70,32')] ).
cnf(91,plain,
connection(out(s,h1(f)),out(n1,and1(h1(f)))),
inference(hyper,[status(thm)],[70,30]),
[iquote('hyper,70,30')] ).
cnf(93,plain,
connection(in(n1,h1(f)),in(n1,and2(h1(f)))),
inference(hyper,[status(thm)],[70,28]),
[iquote('hyper,70,28')] ).
cnf(94,plain,
connection(in(n2,h1(f)),in(n2,or1(h1(f)))),
inference(hyper,[status(thm)],[70,27]),
[iquote('hyper,70,27')] ).
cnf(96,plain,
type(or1(h1(f)),or),
inference(hyper,[status(thm)],[70,25]),
[iquote('hyper,70,25')] ).
cnf(97,plain,
type(not1(h1(f)),not),
inference(hyper,[status(thm)],[70,24]),
[iquote('hyper,70,24')] ).
cnf(98,plain,
type(and2(h1(f)),and),
inference(hyper,[status(thm)],[70,23]),
[iquote('hyper,70,23')] ).
cnf(99,plain,
type(and1(h1(f)),and),
inference(hyper,[status(thm)],[70,22]),
[iquote('hyper,70,22')] ).
cnf(104,plain,
( mode(not1(h2(f)),ok)
| mode(not1(h2(f)),abnormal) ),
inference(hyper,[status(thm)],[83,7]),
[iquote('hyper,83,7')] ).
cnf(105,plain,
mode(and2(h2(f)),ok),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[84,7]),47]),
[iquote('hyper,84,7,unit_del,47')] ).
cnf(106,plain,
( mode(and1(h2(f)),ok)
| mode(and1(h2(f)),abnormal) ),
inference(hyper,[status(thm)],[85,7]),
[iquote('hyper,85,7')] ).
cnf(107,plain,
value(out(n1,or1(f)),n0),
inference(hyper,[status(thm)],[60,1,59]),
[iquote('hyper,60,1,59')] ).
cnf(108,plain,
mode(or1(h1(f)),ok),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[96,7]),49]),
[iquote('hyper,96,7,unit_del,49')] ).
cnf(109,plain,
mode(not1(h1(f)),ok),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[97,7]),50]),
[iquote('hyper,97,7,unit_del,50')] ).
cnf(110,plain,
mode(and2(h1(f)),ok),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[98,7]),51]),
[iquote('hyper,98,7,unit_del,51')] ).
cnf(111,plain,
mode(and1(h1(f)),ok),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[99,7]),52]),
[iquote('hyper,99,7,unit_del,52')] ).
cnf(112,plain,
value(out(s,h2(f)),n1),
inference(hyper,[status(thm)],[61,1,58]),
[iquote('hyper,61,1,58')] ).
cnf(113,plain,
value(in(n2,h1(f)),n1),
inference(hyper,[status(thm)],[62,1,57]),
[iquote('hyper,62,1,57')] ).
cnf(114,plain,
value(in(n1,h1(f)),n0),
inference(hyper,[status(thm)],[63,1,56]),
[iquote('hyper,63,1,56')] ).
cnf(115,plain,
value(in(n1,h2(f)),n1),
inference(hyper,[status(thm)],[64,1,55]),
[iquote('hyper,64,1,55')] ).
cnf(117,plain,
( mode(or1(f),abnormal)
| value(in(n1,or1(f)),n0) ),
inference(hyper,[status(thm)],[72,16,68,107]),
[iquote('hyper,72,16,68,107')] ).
cnf(118,plain,
value(out(n1,and1(h2(f))),n1),
inference(hyper,[status(thm)],[77,1,112]),
[iquote('hyper,77,1,112')] ).
cnf(119,plain,
value(in(n1,and2(h2(f))),n1),
inference(hyper,[status(thm)],[79,1,115]),
[iquote('hyper,79,1,115')] ).
cnf(122,plain,
value(in(n1,and2(h1(f))),n0),
inference(hyper,[status(thm)],[93,1,114]),
[iquote('hyper,93,1,114')] ).
cnf(123,plain,
value(out(n1,and2(h1(f))),n0),
inference(hyper,[status(thm)],[122,8,110,98]),
[iquote('hyper,122,8,110,98')] ).
cnf(126,plain,
value(in(n2,or1(h1(f))),n1),
inference(hyper,[status(thm)],[94,1,113]),
[iquote('hyper,94,1,113')] ).
cnf(127,plain,
value(out(n1,or1(h1(f))),n1),
inference(hyper,[status(thm)],[126,13,108,96]),
[iquote('hyper,126,13,108,96')] ).
cnf(128,plain,
value(in(n1,not1(h1(f))),n0),
inference(hyper,[status(thm)],[88,1,123]),
[iquote('hyper,88,1,123')] ).
cnf(129,plain,
value(out(n1,not1(h1(f))),n1),
inference(hyper,[status(thm)],[128,18,109,97]),
[iquote('hyper,128,18,109,97')] ).
cnf(130,plain,
value(in(n2,and1(h1(f))),n1),
inference(hyper,[status(thm)],[129,1,87]),
[iquote('hyper,129,1,87')] ).
cnf(131,plain,
value(in(n1,and1(h1(f))),n1),
inference(hyper,[status(thm)],[89,1,127]),
[iquote('hyper,89,1,127')] ).
cnf(132,plain,
value(out(n1,and1(h1(f))),n1),
inference(hyper,[status(thm)],[131,9,111,99,130]),
[iquote('hyper,131,9,111,99,130')] ).
cnf(133,plain,
value(out(s,h1(f)),n1),
inference(hyper,[status(thm)],[132,2,91]),
[iquote('hyper,132,2,91')] ).
cnf(134,plain,
value(in(n2,h2(f)),n1),
inference(hyper,[status(thm)],[133,1,67]),
[iquote('hyper,133,1,67')] ).
cnf(136,plain,
value(in(n2,and2(h2(f))),n1),
inference(hyper,[status(thm)],[134,1,78]),
[iquote('hyper,134,1,78')] ).
cnf(138,plain,
value(out(n1,and2(h2(f))),n1),
inference(hyper,[status(thm)],[136,9,105,84,119]),
[iquote('hyper,136,9,105,84,119')] ).
cnf(139,plain,
value(out(c,h2(f)),n1),
inference(hyper,[status(thm)],[138,2,76]),
[iquote('hyper,138,2,76')] ).
cnf(140,plain,
value(in(n1,not1(h2(f))),n1),
inference(hyper,[status(thm)],[138,1,74]),
[iquote('hyper,138,1,74')] ).
cnf(142,plain,
value(in(n1,or1(f)),n1),
inference(hyper,[status(thm)],[139,1,65]),
[iquote('hyper,139,1,65')] ).
cnf(156,plain,
mode(or1(f),abnormal),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[117,3,142]),5]),
[iquote('hyper,117,3,142,unit_del,5')] ).
cnf(157,plain,
mode(and1(h2(f)),ok),
inference(hyper,[status(thm)],[156,48,106]),
[iquote('hyper,156,48,106')] ).
cnf(158,plain,
mode(not1(h2(f)),ok),
inference(hyper,[status(thm)],[156,46,104]),
[iquote('hyper,156,46,104')] ).
cnf(160,plain,
value(in(n2,and1(h2(f))),n1),
inference(hyper,[status(thm)],[157,12,85,118]),
[iquote('hyper,157,12,85,118')] ).
cnf(162,plain,
value(out(n1,not1(h2(f))),n0),
inference(hyper,[status(thm)],[158,19,83,140]),
[iquote('hyper,158,19,83,140')] ).
cnf(163,plain,
value(out(n1,not1(h2(f))),n1),
inference(hyper,[status(thm)],[160,2,73]),
[iquote('hyper,160,2,73')] ).
cnf(167,plain,
e_qual_value(n0,n1),
inference(hyper,[status(thm)],[163,3,162]),
[iquote('hyper,163,3,162')] ).
cnf(168,plain,
$false,
inference(binary,[status(thm)],[167,4]),
[iquote('binary,167.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HWV006-1 : TPTP v8.1.0. Released v2.1.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n025.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:50:30 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.13/2.30 ----- Otter 3.3f, August 2004 -----
% 2.13/2.30 The process was started by sandbox on n025.cluster.edu,
% 2.13/2.30 Wed Jul 27 06:50:30 2022
% 2.13/2.30 The command was "./otter". The process ID is 13866.
% 2.13/2.30
% 2.13/2.30 set(prolog_style_variables).
% 2.13/2.30 set(auto).
% 2.13/2.30 dependent: set(auto1).
% 2.13/2.30 dependent: set(process_input).
% 2.13/2.30 dependent: clear(print_kept).
% 2.13/2.30 dependent: clear(print_new_demod).
% 2.13/2.30 dependent: clear(print_back_demod).
% 2.13/2.30 dependent: clear(print_back_sub).
% 2.13/2.30 dependent: set(control_memory).
% 2.13/2.30 dependent: assign(max_mem, 12000).
% 2.13/2.30 dependent: assign(pick_given_ratio, 4).
% 2.13/2.30 dependent: assign(stats_level, 1).
% 2.13/2.30 dependent: assign(max_seconds, 10800).
% 2.13/2.30 clear(print_given).
% 2.13/2.30
% 2.13/2.30 list(usable).
% 2.13/2.30 0 [] -connection(P1,P2)| -value(P1,V)|value(P2,V).
% 2.13/2.30 0 [] -connection(P1,P2)| -value(P2,V)|value(P1,V).
% 2.13/2.30 0 [] -value(P,V1)| -value(P,V2)|e_qual_value(V1,V2).
% 2.13/2.30 0 [] -e_qual_value(n0,n1).
% 2.13/2.30 0 [] -e_qual_value(n1,n0).
% 2.13/2.30 0 [] -mode(K,ok)| -mode(K,abnormal).
% 2.13/2.30 0 [] -type(K,Any)|mode(K,ok)|mode(K,abnormal).
% 2.13/2.30 0 [] -mode(K,ok)| -type(K,and)| -value(in(Any,K),n0)|value(out(n1,K),n0).
% 2.13/2.30 0 [] -mode(K,ok)| -type(K,and)| -value(in(n1,K),n1)| -value(in(n2,K),n1)|value(out(n1,K),n1).
% 2.13/2.30 0 [] -mode(K,ok)| -type(K,and)| -value(out(n1,K),n0)|value(in(n1,K),n0)|value(in(n2,K),n0).
% 2.13/2.30 0 [] -mode(K,ok)| -type(K,and)| -value(out(n1,K),n1)|value(in(n1,K),n1).
% 2.13/2.30 0 [] -mode(K,ok)| -type(K,and)| -value(out(n1,K),n1)|value(in(n2,K),n1).
% 2.13/2.30 0 [] -mode(K,ok)| -type(K,or)| -value(in(Any,K),n1)|value(out(n1,K),n1).
% 2.13/2.30 0 [] -mode(K,ok)| -type(K,or)| -value(in(n1,K),n0)| -value(in(n2,K),n0)|value(out(n1,K),n0).
% 2.13/2.30 0 [] -mode(K,ok)| -type(K,or)| -value(out(n1,K),n1)|value(in(n1,K),n1)|value(in(n2,K),n1).
% 2.13/2.30 0 [] -mode(K,ok)| -type(K,or)| -value(out(n1,K),n0)|value(in(n1,K),n0).
% 2.13/2.30 0 [] -mode(K,ok)| -type(K,or)| -value(out(n1,K),n0)|value(in(n2,K),n0).
% 2.13/2.30 0 [] -mode(K,ok)| -type(K,not)| -value(in(n1,K),n0)|value(out(n1,K),n1).
% 2.13/2.30 0 [] -mode(K,ok)| -type(K,not)| -value(in(n1,K),n1)|value(out(n1,K),n0).
% 2.13/2.30 0 [] -mode(K,ok)| -type(K,not)| -value(out(n1,K),n0)|value(in(n1,K),n1).
% 2.13/2.30 0 [] -mode(K,ok)| -type(K,not)| -value(out(n1,K),n1)|value(in(n1,K),n0).
% 2.13/2.30 0 [] -type(X,halfadder)|type(and1(X),and).
% 2.13/2.30 0 [] -type(X,halfadder)|type(and2(X),and).
% 2.13/2.30 0 [] -type(X,halfadder)|type(not1(X),not).
% 2.13/2.30 0 [] -type(X,halfadder)|type(or1(X),or).
% 2.13/2.30 0 [] -type(X,halfadder)|connection(in(n1,X),in(n1,or1(X))).
% 2.13/2.30 0 [] -type(X,halfadder)|connection(in(n2,X),in(n2,or1(X))).
% 2.13/2.30 0 [] -type(X,halfadder)|connection(in(n1,X),in(n1,and2(X))).
% 2.13/2.30 0 [] -type(X,halfadder)|connection(in(n2,X),in(n2,and2(X))).
% 2.13/2.30 0 [] -type(X,halfadder)|connection(out(s,X),out(n1,and1(X))).
% 2.13/2.30 0 [] -type(X,halfadder)|connection(out(c,X),out(n1,and2(X))).
% 2.13/2.30 0 [] -type(X,halfadder)|connection(out(n1,or1(X)),in(n1,and1(X))).
% 2.13/2.30 0 [] -type(X,halfadder)|connection(out(n1,and2(X)),in(n1,not1(X))).
% 2.13/2.30 0 [] -type(X,halfadder)|connection(out(n1,not1(X)),in(n2,and1(X))).
% 2.13/2.30 0 [] -type(X,fulladder)|type(h1(X),halfadder).
% 2.13/2.30 0 [] -type(X,fulladder)|type(h2(X),halfadder).
% 2.13/2.30 0 [] -type(X,fulladder)|type(or1(X),or).
% 2.13/2.30 0 [] -type(X,fulladder)|connection(out(s,h1(X)),in(n2,h2(X))).
% 2.13/2.30 0 [] -type(X,fulladder)|connection(out(c,h1(X)),in(n2,or1(X))).
% 2.13/2.30 0 [] -type(X,fulladder)|connection(out(c,h2(X)),in(n1,or1(X))).
% 2.13/2.30 0 [] -type(X,fulladder)|connection(in(n1,X),in(n1,h2(X))).
% 2.13/2.30 0 [] -type(X,fulladder)|connection(in(n2,X),in(n1,h1(X))).
% 2.13/2.30 0 [] -type(X,fulladder)|connection(in(c,X),in(n2,h1(X))).
% 2.13/2.30 0 [] -type(X,fulladder)|connection(out(s,X),out(s,h2(X))).
% 2.13/2.30 0 [] -type(X,fulladder)|connection(out(c,X),out(n1,or1(X))).
% 2.13/2.30 0 [] type(f,fulladder).
% 2.13/2.30 0 [] value(in(n1,f),n1).
% 2.13/2.30 0 [] value(in(n2,f),n0).
% 2.13/2.30 0 [] value(in(c,f),n1).
% 2.13/2.30 0 [] value(out(s,f),n1).
% 2.13/2.30 0 [] value(out(c,f),n0).
% 2.13/2.30 0 [] -mode(or1(f),abnormal)| -mode(not1(h2(f)),abnormal).
% 2.13/2.30 0 [] -mode(and2(h2(f)),abnormal).
% 2.13/2.30 0 [] -mode(or1(f),abnormal)| -mode(and1(h2(f)),abnormal).
% 2.13/2.30 0 [] -mode(or1(h1(f)),abnormal).
% 2.13/2.30 0 [] -mode(not1(h1(f)),abnormal).
% 2.13/2.30 0 [] -mode(and2(h1(f)),abnormal).
% 2.13/2.30 0 [] -mode(and1(h1(f)),abnormal).
% 2.13/2.30 end_of_list.
% 2.13/2.30
% 2.13/2.30 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 2.13/2.30
% 2.13/2.30 This is a non-Horn set without equality. The strategy will
% 2.13/2.30 be ordered hyper_res, unit deletion, and factoring, with
% 2.13/2.30 satellites in sos and with nuclei in usable.
% 2.13/2.30
% 2.13/2.30 dependent: set(hyper_res).
% 2.13/2.30 dependent: set(factor).
% 2.13/2.30 dependent: set(unit_deletion).
% 2.13/2.30
% 2.13/2.30 ------------> process usable:
% 2.13/2.30 ** KEPT (pick-wt=9): 1 [] -connection(A,B)| -value(A,C)|value(B,C).
% 2.13/2.30 ** KEPT (pick-wt=9): 2 [] -connection(A,B)| -value(B,C)|value(A,C).
% 2.13/2.30 ** KEPT (pick-wt=9): 3 [] -value(A,B)| -value(A,C)|e_qual_value(B,C).
% 2.13/2.30 ** KEPT (pick-wt=3): 4 [] -e_qual_value(n0,n1).
% 2.13/2.30 ** KEPT (pick-wt=3): 5 [] -e_qual_value(n1,n0).
% 2.13/2.30 ** KEPT (pick-wt=6): 6 [] -mode(A,ok)| -mode(A,abnormal).
% 2.13/2.30 ** KEPT (pick-wt=9): 7 [] -type(A,B)|mode(A,ok)|mode(A,abnormal).
% 2.13/2.30 ** KEPT (pick-wt=16): 8 [] -mode(A,ok)| -type(A,and)| -value(in(B,A),n0)|value(out(n1,A),n0).
% 2.13/2.30 ** 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).
% 2.13/2.30 ** 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).
% 2.13/2.30 ** KEPT (pick-wt=16): 11 [] -mode(A,ok)| -type(A,and)| -value(out(n1,A),n1)|value(in(n1,A),n1).
% 2.13/2.30 ** KEPT (pick-wt=16): 12 [] -mode(A,ok)| -type(A,and)| -value(out(n1,A),n1)|value(in(n2,A),n1).
% 2.13/2.30 ** KEPT (pick-wt=16): 13 [] -mode(A,ok)| -type(A,or)| -value(in(B,A),n1)|value(out(n1,A),n1).
% 2.13/2.30 ** 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).
% 2.13/2.30 ** 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).
% 2.13/2.30 ** KEPT (pick-wt=16): 16 [] -mode(A,ok)| -type(A,or)| -value(out(n1,A),n0)|value(in(n1,A),n0).
% 2.13/2.30 ** KEPT (pick-wt=16): 17 [] -mode(A,ok)| -type(A,or)| -value(out(n1,A),n0)|value(in(n2,A),n0).
% 2.13/2.30 ** KEPT (pick-wt=16): 18 [] -mode(A,ok)| -type(A,not)| -value(in(n1,A),n0)|value(out(n1,A),n1).
% 2.13/2.30 ** KEPT (pick-wt=16): 19 [] -mode(A,ok)| -type(A,not)| -value(in(n1,A),n1)|value(out(n1,A),n0).
% 2.13/2.30 ** KEPT (pick-wt=16): 20 [] -mode(A,ok)| -type(A,not)| -value(out(n1,A),n0)|value(in(n1,A),n1).
% 2.13/2.30 ** KEPT (pick-wt=16): 21 [] -mode(A,ok)| -type(A,not)| -value(out(n1,A),n1)|value(in(n1,A),n0).
% 2.13/2.30 ** KEPT (pick-wt=7): 22 [] -type(A,halfadder)|type(and1(A),and).
% 2.13/2.30 ** KEPT (pick-wt=7): 23 [] -type(A,halfadder)|type(and2(A),and).
% 2.13/2.30 ** KEPT (pick-wt=7): 24 [] -type(A,halfadder)|type(not1(A),not).
% 2.13/2.30 ** KEPT (pick-wt=7): 25 [] -type(A,halfadder)|type(or1(A),or).
% 2.13/2.30 ** KEPT (pick-wt=11): 26 [] -type(A,halfadder)|connection(in(n1,A),in(n1,or1(A))).
% 2.13/2.30 ** KEPT (pick-wt=11): 27 [] -type(A,halfadder)|connection(in(n2,A),in(n2,or1(A))).
% 2.13/2.30 ** KEPT (pick-wt=11): 28 [] -type(A,halfadder)|connection(in(n1,A),in(n1,and2(A))).
% 2.13/2.30 ** KEPT (pick-wt=11): 29 [] -type(A,halfadder)|connection(in(n2,A),in(n2,and2(A))).
% 2.13/2.30 ** KEPT (pick-wt=11): 30 [] -type(A,halfadder)|connection(out(s,A),out(n1,and1(A))).
% 2.13/2.30 ** KEPT (pick-wt=11): 31 [] -type(A,halfadder)|connection(out(c,A),out(n1,and2(A))).
% 2.13/2.30 ** KEPT (pick-wt=12): 32 [] -type(A,halfadder)|connection(out(n1,or1(A)),in(n1,and1(A))).
% 2.13/2.30 ** KEPT (pick-wt=12): 33 [] -type(A,halfadder)|connection(out(n1,and2(A)),in(n1,not1(A))).
% 2.13/2.30 ** KEPT (pick-wt=12): 34 [] -type(A,halfadder)|connection(out(n1,not1(A)),in(n2,and1(A))).
% 2.13/2.30 ** KEPT (pick-wt=7): 35 [] -type(A,fulladder)|type(h1(A),halfadder).
% 2.13/2.30 ** KEPT (pick-wt=7): 36 [] -type(A,fulladder)|type(h2(A),halfadder).
% 2.13/2.30 ** KEPT (pick-wt=7): 37 [] -type(A,fulladder)|type(or1(A),or).
% 2.13/2.30 ** KEPT (pick-wt=12): 38 [] -type(A,fulladder)|connection(out(s,h1(A)),in(n2,h2(A))).
% 2.13/2.30 ** KEPT (pick-wt=12): 39 [] -type(A,fulladder)|connection(out(c,h1(A)),in(n2,or1(A))).
% 2.13/2.30 ** KEPT (pick-wt=12): 40 [] -type(A,fulladder)|connection(out(c,h2(A)),in(n1,or1(A))).
% 2.13/2.30 ** KEPT (pick-wt=11): 41 [] -type(A,fulladder)|connection(in(n1,A),in(n1,h2(A))).
% 2.13/2.30 ** KEPT (pick-wt=11): 42 [] -type(A,fulladder)|connection(in(n2,A),in(n1,h1(A))).
% 2.13/2.30 ** KEPT (pick-wt=11): 43 [] -type(A,fulladder)|connection(in(c,A),in(n2,h1(A))).
% 2.13/2.30 ** KEPT (pick-wt=11): 44 [] -type(A,fulladder)|connection(out(s,A),out(s,h2(A))).
% 2.13/2.30 ** KEPT (pick-wt=11): 45 [] -type(A,fulladder)|connection(out(c,A),out(n1,or1(A))).
% 2.13/2.30 ** KEPT (pick-wt=9): 46 [] -mode(or1(f),abnormal)| -mode(not1(h2(f)),abnormal).
% 2.13/2.30 ** KEPT (pick-wt=5): 47 [] -mode(and2(h2(f)),abnormal).
% 2.13/2.30 ** KEPT (pick-wt=9): 48 [] -mode(or1(f),abnormal)| -mode(and1(h2(f)),abnormal).
% 2.13/2.30 ** KEPT (pick-wt=5): 49 [] -mode(or1(h1(f)),abnormal).
% 2.13/2.30 ** KEPT (pick-wt=5): 50 [] -mode(not1(h1(f)),abnormal).
% 2.13/2.30 ** KEPT (pick-wt=5): 51 [] -mode(and2(h1(f)),abnormal).
% 2.13/2.30 ** KEPT (pick-wt=5): 52 [] -mode(and1(h1(f)),abnormal).
% 2.13/2.30
% 2.13/2.30 ------------> process sos:
% 2.13/2.30 ** KEPT (pick-wt=3): 54 [] type(f,fulladder).
% 2.13/2.30 ** KEPT (pick-wt=5): 55 [] value(in(n1,f),n1).
% 2.13/2.30 ** KEPT (pick-wt=5): 56 [] value(in(n2,f),n0).
% 2.13/2.30 ** KEPT (pick-wt=5): 57 [] value(in(c,f),n1).
% 2.13/2.30 ** KEPT (pick-wt=5): 58 [] value(out(s,f),n1).
% 2.13/2.30 ** KEPT (pick-wt=5): 59 [] value(out(c,f),n0).
% 2.13/2.30
% 2.13/2.30 ======= end of input processing =======
% 2.13/2.30
% 2.13/2.30 =========== start of search ===========
% 2.13/2.30
% 2.13/2.30 -------- PROOF --------
% 2.13/2.30
% 2.13/2.30 ----> UNIT CONFLICT at 0.01 sec ----> 168 [binary,167.1,4.1] $F.
% 2.13/2.30
% 2.13/2.30 Length of proof is 68. Level of proof is 19.
% 2.13/2.30
% 2.13/2.30 ---------------- PROOF ----------------
% 2.13/2.30 % SZS status Unsatisfiable
% 2.13/2.30 % SZS output start Refutation
% See solution above
% 2.13/2.30 ------------ end of proof -------------
% 2.13/2.30
% 2.13/2.30
% 2.13/2.30 Search stopped by max_proofs option.
% 2.13/2.30
% 2.13/2.30
% 2.13/2.30 Search stopped by max_proofs option.
% 2.13/2.30
% 2.13/2.30 ============ end of search ============
% 2.13/2.30
% 2.13/2.30 -------------- statistics -------------
% 2.13/2.30 clauses given 97
% 2.13/2.30 clauses generated 288
% 2.13/2.30 clauses kept 167
% 2.13/2.30 clauses forward subsumed 179
% 2.13/2.30 clauses back subsumed 20
% 2.13/2.30 Kbytes malloced 1953
% 2.13/2.30
% 2.13/2.30 ----------- times (seconds) -----------
% 2.13/2.30 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.13/2.30 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.13/2.30 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.13/2.30
% 2.13/2.30 That finishes the proof of the theorem.
% 2.13/2.30
% 2.13/2.30 Process 13866 finished Wed Jul 27 06:50:32 2022
% 2.13/2.30 Otter interrupted
% 2.13/2.30 PROOF FOUND
%------------------------------------------------------------------------------