TSTP Solution File: HWV005-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : HWV005-2 : TPTP v8.1.0. Bugfixed v2.7.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:02 EDT 2022
% Result : Unsatisfiable 1.97s 2.15s
% Output : Refutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 25
% Syntax : Number of clauses : 47 ( 29 unt; 3 nHn; 47 RR)
% Number of literals : 74 ( 0 equ; 28 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-1 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ connection(A,B)
| ~ zero(A)
| zero(B) ),
file('HWV005-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ connection(A,B)
| ~ one(A)
| one(B) ),
file('HWV005-2.p',unknown),
[] ).
cnf(5,axiom,
( ~ zero(A)
| ~ one(A) ),
file('HWV005-2.p',unknown),
[] ).
cnf(8,axiom,
( ~ and_ok(A)
| ~ one(in1(A))
| ~ one(in2(A))
| one(out1(A)) ),
file('HWV005-2.p',unknown),
[] ).
cnf(13,axiom,
( ~ logic_and(A)
| and_ok(A)
| abnormal(A) ),
file('HWV005-2.p',unknown),
[] ).
cnf(14,axiom,
( ~ or_ok(A)
| ~ one(in1(A))
| one(out1(A)) ),
file('HWV005-2.p',unknown),
[] ).
cnf(21,axiom,
( ~ logic_or(A)
| or_ok(A)
| abnormal(A) ),
file('HWV005-2.p',unknown),
[] ).
cnf(22,axiom,
( ~ not_ok(A)
| ~ zero(in1(A))
| one(out1(A)) ),
file('HWV005-2.p',unknown),
[] ).
cnf(27,axiom,
( ~ logic_not(A)
| not_ok(A)
| abnormal(A) ),
file('HWV005-2.p',unknown),
[] ).
cnf(28,axiom,
( ~ halfadder(A)
| logic_and(and1(A)) ),
file('HWV005-2.p',unknown),
[] ).
cnf(30,axiom,
( ~ halfadder(A)
| logic_not(not1(A)) ),
file('HWV005-2.p',unknown),
[] ).
cnf(31,axiom,
( ~ halfadder(A)
| logic_or(or1(A)) ),
file('HWV005-2.p',unknown),
[] ).
cnf(32,axiom,
( ~ halfadder(A)
| connection(in1(A),in1(or1(A))) ),
file('HWV005-2.p',unknown),
[] ).
cnf(36,axiom,
( ~ halfadder(A)
| connection(outs(A),out1(and1(A))) ),
file('HWV005-2.p',unknown),
[] ).
cnf(37,axiom,
( ~ halfadder(A)
| connection(outc(A),out1(and2(A))) ),
file('HWV005-2.p',unknown),
[] ).
cnf(38,axiom,
( ~ halfadder(A)
| connection(out1(or1(A)),in1(and1(A))) ),
file('HWV005-2.p',unknown),
[] ).
cnf(39,axiom,
( ~ halfadder(A)
| connection(out1(and2(A)),in1(not1(A))) ),
file('HWV005-2.p',unknown),
[] ).
cnf(40,axiom,
( ~ halfadder(A)
| connection(out1(not1(A)),in2(and1(A))) ),
file('HWV005-2.p',unknown),
[] ).
cnf(41,axiom,
~ abnormal(and1(h)),
file('HWV005-2.p',unknown),
[] ).
cnf(42,axiom,
~ abnormal(not1(h)),
file('HWV005-2.p',unknown),
[] ).
cnf(43,axiom,
~ abnormal(or1(h)),
file('HWV005-2.p',unknown),
[] ).
cnf(44,axiom,
halfadder(h),
file('HWV005-2.p',unknown),
[] ).
cnf(45,axiom,
one(in1(h)),
file('HWV005-2.p',unknown),
[] ).
cnf(47,axiom,
zero(outs(h)),
file('HWV005-2.p',unknown),
[] ).
cnf(48,axiom,
zero(outc(h)),
file('HWV005-2.p',unknown),
[] ).
cnf(49,plain,
connection(out1(not1(h)),in2(and1(h))),
inference(hyper,[status(thm)],[44,40]),
[iquote('hyper,44,40')] ).
cnf(50,plain,
connection(out1(and2(h)),in1(not1(h))),
inference(hyper,[status(thm)],[44,39]),
[iquote('hyper,44,39')] ).
cnf(51,plain,
connection(out1(or1(h)),in1(and1(h))),
inference(hyper,[status(thm)],[44,38]),
[iquote('hyper,44,38')] ).
cnf(52,plain,
connection(outc(h),out1(and2(h))),
inference(hyper,[status(thm)],[44,37]),
[iquote('hyper,44,37')] ).
cnf(53,plain,
connection(outs(h),out1(and1(h))),
inference(hyper,[status(thm)],[44,36]),
[iquote('hyper,44,36')] ).
cnf(57,plain,
connection(in1(h),in1(or1(h))),
inference(hyper,[status(thm)],[44,32]),
[iquote('hyper,44,32')] ).
cnf(58,plain,
logic_or(or1(h)),
inference(hyper,[status(thm)],[44,31]),
[iquote('hyper,44,31')] ).
cnf(59,plain,
logic_not(not1(h)),
inference(hyper,[status(thm)],[44,30]),
[iquote('hyper,44,30')] ).
cnf(61,plain,
logic_and(and1(h)),
inference(hyper,[status(thm)],[44,28]),
[iquote('hyper,44,28')] ).
cnf(62,plain,
or_ok(or1(h)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[58,21]),43]),
[iquote('hyper,58,21,unit_del,43')] ).
cnf(63,plain,
not_ok(not1(h)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[59,27]),42]),
[iquote('hyper,59,27,unit_del,42')] ).
cnf(65,plain,
and_ok(and1(h)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[61,13]),41]),
[iquote('hyper,61,13,unit_del,41')] ).
cnf(66,plain,
zero(out1(and2(h))),
inference(hyper,[status(thm)],[52,1,48]),
[iquote('hyper,52,1,48')] ).
cnf(67,plain,
zero(in1(not1(h))),
inference(hyper,[status(thm)],[66,1,50]),
[iquote('hyper,66,1,50')] ).
cnf(68,plain,
one(out1(not1(h))),
inference(hyper,[status(thm)],[67,22,63]),
[iquote('hyper,67,22,63')] ).
cnf(69,plain,
one(in2(and1(h))),
inference(hyper,[status(thm)],[68,2,49]),
[iquote('hyper,68,2,49')] ).
cnf(70,plain,
zero(out1(and1(h))),
inference(hyper,[status(thm)],[53,1,47]),
[iquote('hyper,53,1,47')] ).
cnf(75,plain,
one(in1(or1(h))),
inference(hyper,[status(thm)],[57,2,45]),
[iquote('hyper,57,2,45')] ).
cnf(76,plain,
one(out1(or1(h))),
inference(hyper,[status(thm)],[75,14,62]),
[iquote('hyper,75,14,62')] ).
cnf(77,plain,
one(in1(and1(h))),
inference(hyper,[status(thm)],[76,2,51]),
[iquote('hyper,76,2,51')] ).
cnf(78,plain,
one(out1(and1(h))),
inference(hyper,[status(thm)],[77,8,65,69]),
[iquote('hyper,77,8,65,69')] ).
cnf(79,plain,
$false,
inference(hyper,[status(thm)],[78,5,70]),
[iquote('hyper,78,5,70')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : HWV005-2 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 06:54:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.97/2.15 ----- Otter 3.3f, August 2004 -----
% 1.97/2.15 The process was started by sandbox2 on n025.cluster.edu,
% 1.97/2.15 Wed Jul 27 06:54:45 2022
% 1.97/2.15 The command was "./otter". The process ID is 28374.
% 1.97/2.15
% 1.97/2.15 set(prolog_style_variables).
% 1.97/2.15 set(auto).
% 1.97/2.15 dependent: set(auto1).
% 1.97/2.15 dependent: set(process_input).
% 1.97/2.15 dependent: clear(print_kept).
% 1.97/2.15 dependent: clear(print_new_demod).
% 1.97/2.15 dependent: clear(print_back_demod).
% 1.97/2.15 dependent: clear(print_back_sub).
% 1.97/2.15 dependent: set(control_memory).
% 1.97/2.15 dependent: assign(max_mem, 12000).
% 1.97/2.15 dependent: assign(pick_given_ratio, 4).
% 1.97/2.15 dependent: assign(stats_level, 1).
% 1.97/2.15 dependent: assign(max_seconds, 10800).
% 1.97/2.15 clear(print_given).
% 1.97/2.15
% 1.97/2.15 list(usable).
% 1.97/2.15 0 [] -connection(P1,P2)| -zero(P1)|zero(P2).
% 1.97/2.15 0 [] -connection(P1,P2)| -one(P1)|one(P2).
% 1.97/2.15 0 [] -connection(P1,P2)| -zero(P2)|zero(P1).
% 1.97/2.15 0 [] -connection(P1,P2)| -one(P2)|one(P1).
% 1.97/2.15 0 [] -zero(P)| -one(P).
% 1.97/2.15 0 [] -and_ok(K)| -zero(in1(K))|zero(out1(K)).
% 1.97/2.15 0 [] -and_ok(K)| -zero(in2(K))|zero(out1(K)).
% 1.97/2.15 0 [] -and_ok(K)| -one(in1(K))| -one(in2(K))|one(out1(K)).
% 1.97/2.15 0 [] -and_ok(K)| -zero(out1(K))|zero(in1(K))|zero(in2(K)).
% 1.97/2.15 0 [] -and_ok(K)| -one(out1(K))|one(in1(K)).
% 1.97/2.15 0 [] -and_ok(K)| -one(out1(K))|one(in2(K)).
% 1.97/2.15 0 [] -and_ok(K)| -abnormal(K).
% 1.97/2.15 0 [] -logic_and(K)|and_ok(K)|abnormal(K).
% 1.97/2.15 0 [] -or_ok(K)| -one(in1(K))|one(out1(K)).
% 1.97/2.15 0 [] -or_ok(K)| -one(in2(K))|one(out1(K)).
% 1.97/2.15 0 [] -or_ok(K)| -zero(in1(K))| -zero(in2(K))|zero(out1(K)).
% 1.97/2.15 0 [] -or_ok(K)| -one(out1(K))|one(in1(K))|one(in2(K)).
% 1.97/2.15 0 [] -or_ok(K)| -zero(out1(K))|zero(in1(K)).
% 1.97/2.15 0 [] -or_ok(K)| -zero(out1(K))|zero(in2(K)).
% 1.97/2.15 0 [] -or_ok(K)| -abnormal(K).
% 1.97/2.15 0 [] -logic_or(K)|or_ok(K)|abnormal(K).
% 1.97/2.15 0 [] -not_ok(K)| -zero(in1(K))|one(out1(K)).
% 1.97/2.15 0 [] -not_ok(K)| -one(in1(K))|zero(out1(K)).
% 1.97/2.15 0 [] -not_ok(K)| -zero(out1(K))|one(in1(K)).
% 1.97/2.15 0 [] -not_ok(K)| -one(out1(K))|zero(in1(K)).
% 1.97/2.15 0 [] -not_ok(K)| -abnormal(K).
% 1.97/2.15 0 [] -logic_not(K)|not_ok(K)|abnormal(K).
% 1.97/2.15 0 [] -halfadder(X)|logic_and(and1(X)).
% 1.97/2.15 0 [] -halfadder(X)|logic_and(and2(X)).
% 1.97/2.15 0 [] -halfadder(X)|logic_not(not1(X)).
% 1.97/2.15 0 [] -halfadder(X)|logic_or(or1(X)).
% 1.97/2.15 0 [] -halfadder(X)|connection(in1(X),in1(or1(X))).
% 1.97/2.15 0 [] -halfadder(X)|connection(in2(X),in2(or1(X))).
% 1.97/2.15 0 [] -halfadder(X)|connection(in1(X),in1(and2(X))).
% 1.97/2.15 0 [] -halfadder(X)|connection(in2(X),in2(and2(X))).
% 1.97/2.15 0 [] -halfadder(X)|connection(outs(X),out1(and1(X))).
% 1.97/2.15 0 [] -halfadder(X)|connection(outc(X),out1(and2(X))).
% 1.97/2.15 0 [] -halfadder(X)|connection(out1(or1(X)),in1(and1(X))).
% 1.97/2.15 0 [] -halfadder(X)|connection(out1(and2(X)),in1(not1(X))).
% 1.97/2.15 0 [] -halfadder(X)|connection(out1(not1(X)),in2(and1(X))).
% 1.97/2.15 0 [] halfadder(h).
% 1.97/2.15 0 [] one(in1(h)).
% 1.97/2.15 0 [] zero(in2(h)).
% 1.97/2.15 0 [] zero(outs(h)).
% 1.97/2.15 0 [] zero(outc(h)).
% 1.97/2.15 0 [] -abnormal(and1(h)).
% 1.97/2.15 0 [] -abnormal(not1(h)).
% 1.97/2.15 0 [] -abnormal(or1(h)).
% 1.97/2.15 end_of_list.
% 1.97/2.15
% 1.97/2.15 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.97/2.15
% 1.97/2.15 This is a non-Horn set without equality. The strategy will
% 1.97/2.15 be ordered hyper_res, unit deletion, and factoring, with
% 1.97/2.15 satellites in sos and with nuclei in usable.
% 1.97/2.15
% 1.97/2.15 dependent: set(hyper_res).
% 1.97/2.15 dependent: set(factor).
% 1.97/2.15 dependent: set(unit_deletion).
% 1.97/2.15
% 1.97/2.15 ------------> process usable:
% 1.97/2.15 ** KEPT (pick-wt=7): 1 [] -connection(A,B)| -zero(A)|zero(B).
% 1.97/2.15 ** KEPT (pick-wt=7): 2 [] -connection(A,B)| -one(A)|one(B).
% 1.97/2.15 ** KEPT (pick-wt=7): 3 [] -connection(A,B)| -zero(B)|zero(A).
% 1.97/2.15 ** KEPT (pick-wt=7): 4 [] -connection(A,B)| -one(B)|one(A).
% 1.97/2.15 ** KEPT (pick-wt=4): 5 [] -zero(A)| -one(A).
% 1.97/2.15 ** KEPT (pick-wt=8): 6 [] -and_ok(A)| -zero(in1(A))|zero(out1(A)).
% 1.97/2.15 ** KEPT (pick-wt=8): 7 [] -and_ok(A)| -zero(in2(A))|zero(out1(A)).
% 1.97/2.15 ** KEPT (pick-wt=11): 8 [] -and_ok(A)| -one(in1(A))| -one(in2(A))|one(out1(A)).
% 1.97/2.15 ** KEPT (pick-wt=11): 9 [] -and_ok(A)| -zero(out1(A))|zero(in1(A))|zero(in2(A)).
% 1.97/2.15 ** KEPT (pick-wt=8): 10 [] -and_ok(A)| -one(out1(A))|one(in1(A)).
% 1.97/2.15 ** KEPT (pick-wt=8): 11 [] -and_ok(A)| -one(out1(A))|one(in2(A)).
% 1.97/2.15 ** KEPT (pick-wt=4): 12 [] -and_ok(A)| -abnormal(A).
% 1.97/2.15 ** KEPT (pick-wt=6): 13 [] -logic_and(A)|and_ok(A)|abnormal(A).
% 1.97/2.15 ** KEPT (pick-wt=8): 14 [] -or_ok(A)| -one(in1(A))|one(out1(A)).
% 1.97/2.15 ** KEPT (pick-wt=8): 15 [] -or_ok(A)| -one(in2(A))|one(out1(A)).
% 1.97/2.15 ** KEPT (pick-wt=11): 16 [] -or_ok(A)| -zero(in1(A))| -zero(in2(A))|zero(out1(A)).
% 1.97/2.15 ** KEPT (pick-wt=11): 17 [] -or_ok(A)| -one(out1(A))|one(in1(A))|one(in2(A)).
% 1.97/2.15 ** KEPT (pick-wt=8): 18 [] -or_ok(A)| -zero(out1(A))|zero(in1(A)).
% 1.97/2.15 ** KEPT (pick-wt=8): 19 [] -or_ok(A)| -zero(out1(A))|zero(in2(A)).
% 1.97/2.15 ** KEPT (pick-wt=4): 20 [] -or_ok(A)| -abnormal(A).
% 1.97/2.15 ** KEPT (pick-wt=6): 21 [] -logic_or(A)|or_ok(A)|abnormal(A).
% 1.97/2.15 ** KEPT (pick-wt=8): 22 [] -not_ok(A)| -zero(in1(A))|one(out1(A)).
% 1.97/2.15 ** KEPT (pick-wt=8): 23 [] -not_ok(A)| -one(in1(A))|zero(out1(A)).
% 1.97/2.15 ** KEPT (pick-wt=8): 24 [] -not_ok(A)| -zero(out1(A))|one(in1(A)).
% 1.97/2.15 ** KEPT (pick-wt=8): 25 [] -not_ok(A)| -one(out1(A))|zero(in1(A)).
% 1.97/2.15 ** KEPT (pick-wt=4): 26 [] -not_ok(A)| -abnormal(A).
% 1.97/2.15 ** KEPT (pick-wt=6): 27 [] -logic_not(A)|not_ok(A)|abnormal(A).
% 1.97/2.15 ** KEPT (pick-wt=5): 28 [] -halfadder(A)|logic_and(and1(A)).
% 1.97/2.15 ** KEPT (pick-wt=5): 29 [] -halfadder(A)|logic_and(and2(A)).
% 1.97/2.15 ** KEPT (pick-wt=5): 30 [] -halfadder(A)|logic_not(not1(A)).
% 1.97/2.15 ** KEPT (pick-wt=5): 31 [] -halfadder(A)|logic_or(or1(A)).
% 1.97/2.15 ** KEPT (pick-wt=8): 32 [] -halfadder(A)|connection(in1(A),in1(or1(A))).
% 1.97/2.15 ** KEPT (pick-wt=8): 33 [] -halfadder(A)|connection(in2(A),in2(or1(A))).
% 1.97/2.15 ** KEPT (pick-wt=8): 34 [] -halfadder(A)|connection(in1(A),in1(and2(A))).
% 1.97/2.15 ** KEPT (pick-wt=8): 35 [] -halfadder(A)|connection(in2(A),in2(and2(A))).
% 1.97/2.15 ** KEPT (pick-wt=8): 36 [] -halfadder(A)|connection(outs(A),out1(and1(A))).
% 1.97/2.15 ** KEPT (pick-wt=8): 37 [] -halfadder(A)|connection(outc(A),out1(and2(A))).
% 1.97/2.15 ** KEPT (pick-wt=9): 38 [] -halfadder(A)|connection(out1(or1(A)),in1(and1(A))).
% 1.97/2.15 ** KEPT (pick-wt=9): 39 [] -halfadder(A)|connection(out1(and2(A)),in1(not1(A))).
% 1.97/2.15 ** KEPT (pick-wt=9): 40 [] -halfadder(A)|connection(out1(not1(A)),in2(and1(A))).
% 1.97/2.15 ** KEPT (pick-wt=3): 41 [] -abnormal(and1(h)).
% 1.97/2.15 ** KEPT (pick-wt=3): 42 [] -abnormal(not1(h)).
% 1.97/2.15 ** KEPT (pick-wt=3): 43 [] -abnormal(or1(h)).
% 1.97/2.15
% 1.97/2.15 ------------> process sos:
% 1.97/2.15 ** KEPT (pick-wt=2): 44 [] halfadder(h).
% 1.97/2.15 ** KEPT (pick-wt=3): 45 [] one(in1(h)).
% 1.97/2.15 ** KEPT (pick-wt=3): 46 [] zero(in2(h)).
% 1.97/2.15 ** KEPT (pick-wt=3): 47 [] zero(outs(h)).
% 1.97/2.15 ** KEPT (pick-wt=3): 48 [] zero(outc(h)).
% 1.97/2.15
% 1.97/2.15 ======= end of input processing =======
% 1.97/2.15
% 1.97/2.15 =========== start of search ===========
% 1.97/2.15
% 1.97/2.15 -------- PROOF --------
% 1.97/2.15
% 1.97/2.15 -----> EMPTY CLAUSE at 0.00 sec ----> 79 [hyper,78,5,70] $F.
% 1.97/2.15
% 1.97/2.15 Length of proof is 21. Level of proof is 6.
% 1.97/2.15
% 1.97/2.15 ---------------- PROOF ----------------
% 1.97/2.15 % SZS status Unsatisfiable
% 1.97/2.15 % SZS output start Refutation
% See solution above
% 1.97/2.15 ------------ end of proof -------------
% 1.97/2.15
% 1.97/2.15
% 1.97/2.15 Search stopped by max_proofs option.
% 1.97/2.15
% 1.97/2.15
% 1.97/2.15 Search stopped by max_proofs option.
% 1.97/2.15
% 1.97/2.15 ============ end of search ============
% 1.97/2.15
% 1.97/2.15 -------------- statistics -------------
% 1.97/2.15 clauses given 34
% 1.97/2.15 clauses generated 46
% 1.97/2.15 clauses kept 78
% 1.97/2.15 clauses forward subsumed 15
% 1.97/2.15 clauses back subsumed 0
% 1.97/2.15 Kbytes malloced 976
% 1.97/2.15
% 1.97/2.15 ----------- times (seconds) -----------
% 1.97/2.15 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.97/2.15 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.97/2.15 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.97/2.15
% 1.97/2.15 That finishes the proof of the theorem.
% 1.97/2.15
% 1.97/2.15 Process 28374 finished Wed Jul 27 06:54:47 2022
% 1.97/2.15 Otter interrupted
% 1.97/2.15 PROOF FOUND
%------------------------------------------------------------------------------