TSTP Solution File: HWV005-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWV005-2 : TPTP v3.4.2. Bugfixed v2.7.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art06.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 0.0s
% Output : Assurance 0.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/HWV/HWV005-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 3 7)
% (binary-unit 10 #f 3 7)
% (binary-double 16 #f 3 7)
% (binary 54 #t 3 7)
% (binary-order 27 #f 3 7)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(48,40,0,96,0,1)
%
%
% START OF PROOF
% 49 [] -connection(X,Y) | -zero(X) | zero(Y).
% 50 [] -connection(X,Y) | -one(X) | one(Y).
% 53 [] -one(X) | -zero(X).
% 56 [] -one(in2(X)) | -one(in1(X)) | one(out1(X)) | -and_ok(X).
% 61 [] -logic_and(X) | abnormal(X) | and_ok(X).
% 62 [] -one(in1(X)) | one(out1(X)) | -or_ok(X).
% 69 [] -logic_or(X) | or_ok(X) | abnormal(X).
% 70 [] -zero(in1(X)) | one(out1(X)) | -not_ok(X).
% 75 [] -logic_not(X) | not_ok(X) | abnormal(X).
% 76 [] logic_and(and1(X)) | -halfadder(X).
% 78 [] logic_not(not1(X)) | -halfadder(X).
% 79 [] logic_or(or1(X)) | -halfadder(X).
% 80 [] connection(in1(X),in1(or1(X))) | -halfadder(X).
% 84 [] connection(outs(X),out1(and1(X))) | -halfadder(X).
% 85 [] connection(outc(X),out1(and2(X))) | -halfadder(X).
% 86 [] connection(out1(or1(X)),in1(and1(X))) | -halfadder(X).
% 87 [] connection(out1(and2(X)),in1(not1(X))) | -halfadder(X).
% 88 [] connection(out1(not1(X)),in2(and1(X))) | -halfadder(X).
% 89 [] halfadder(h).
% 90 [] one(in1(h)).
% 92 [] zero(outs(h)).
% 93 [] zero(outc(h)).
% 94 [] -abnormal(and1(h)).
% 95 [] -abnormal(not1(h)).
% 96 [] -abnormal(or1(h)).
% 97 [hyper:76,89] logic_and(and1(h)).
% 99 [hyper:78,89] logic_not(not1(h)).
% 100 [hyper:79,89] logic_or(or1(h)).
% 101 [hyper:80,89] connection(in1(h),in1(or1(h))).
% 105 [hyper:84,89] connection(outs(h),out1(and1(h))).
% 106 [hyper:85,89] connection(outc(h),out1(and2(h))).
% 107 [hyper:86,89] connection(out1(or1(h)),in1(and1(h))).
% 108 [hyper:87,89] connection(out1(and2(h)),in1(not1(h))).
% 109 [hyper:88,89] connection(out1(not1(h)),in2(and1(h))).
% 127 [hyper:61,97,cut:94] and_ok(and1(h)).
% 129 [hyper:75,99,cut:95] not_ok(not1(h)).
% 131 [hyper:69,100,cut:96] or_ok(or1(h)).
% 156 [hyper:50,101,cut:90] one(in1(or1(h))).
% 163 [hyper:62,156,cut:131] one(out1(or1(h))).
% 232 [hyper:49,105,cut:92] zero(out1(and1(h))).
% 247 [hyper:49,106,cut:93] zero(out1(and2(h))).
% 269 [hyper:50,107,cut:163] one(in1(and1(h))).
% 282 [hyper:49,108,cut:247] zero(in1(not1(h))).
% 292 [hyper:70,282,cut:129] one(out1(not1(h))).
% 309 [hyper:50,109,cut:292] one(in2(and1(h))).
% 316 [hyper:56,309,cut:269,cut:127] one(out1(and1(h))).
% 323 [hyper:53,316,cut:232] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 3
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 57
% derived clauses: 308
% kept clauses: 31
% kept size sum: 143
% kept mid-nuclei: 174
% kept new demods: 0
% forw unit-subs: 75
% forw double-subs: 2
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 23
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 26
% length fails: 0
% strength fails: 1
% predlist fails: 25
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/HWV/HWV005-2+noeq.in")
%
%------------------------------------------------------------------------------