TSTP Solution File: HWV005-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWV005-1 : TPTP v3.4.2. Released v2.1.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-1+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 9)
% (binary-unit 10 #f 3 9)
% (binary-double 16 #f 3 9)
% (binary 54 #t 3 9)
% (binary-order 27 #f 3 9)
% (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(42,40,0,84,0,0)
%
%
% START OF PROOF
% 43 [] -value(X,Y) | -connection(X,Z) | value(Z,Y).
% 45 [] -value(X,Z) | -value(X,Y) | equal_value(Y,Z).
% 46 [] -equal_value(n0,n1).
% 49 [] mode(X,ok) | mode(X,abnormal) | -type(X,Y).
% 51 [] -value(in(n2,X),n1) | -value(in(n1,X),n1) | value(out(n1,X),n1) | -type(X,and) | -mode(X,ok).
% 55 [] value(out(n1,X),n1) | -value(in(Y,X),n1) | -type(X,or) | -mode(X,ok).
% 60 [] -value(in(n1,X),n0) | value(out(n1,X),n1) | -type(X,not) | -mode(X,ok).
% 64 [] type(and1(X),and) | -type(X,halfadder).
% 66 [] type(not1(X),not) | -type(X,halfadder).
% 67 [] type(or1(X),or) | -type(X,halfadder).
% 68 [] connection(in(n1,X),in(n1,or1(X))) | -type(X,halfadder).
% 72 [] connection(out(s,X),out(n1,and1(X))) | -type(X,halfadder).
% 73 [] connection(out(c,X),out(n1,and2(X))) | -type(X,halfadder).
% 74 [] connection(out(n1,or1(X)),in(n1,and1(X))) | -type(X,halfadder).
% 75 [] connection(out(n1,and2(X)),in(n1,not1(X))) | -type(X,halfadder).
% 76 [] connection(out(n1,not1(X)),in(n2,and1(X))) | -type(X,halfadder).
% 77 [] type(h,halfadder).
% 78 [] value(in(n1,h),n1).
% 80 [] value(out(s,h),n0).
% 81 [] value(out(c,h),n0).
% 82 [] -mode(and1(h),abnormal).
% 83 [] -mode(not1(h),abnormal).
% 84 [] -mode(or1(h),abnormal).
% 86 [hyper:64,77] type(and1(h),and).
% 88 [hyper:66,77] type(not1(h),not).
% 89 [hyper:67,77] type(or1(h),or).
% 90 [hyper:68,77] connection(in(n1,h),in(n1,or1(h))).
% 94 [hyper:72,77] connection(out(s,h),out(n1,and1(h))).
% 95 [hyper:73,77] connection(out(c,h),out(n1,and2(h))).
% 96 [hyper:74,77] connection(out(n1,or1(h)),in(n1,and1(h))).
% 97 [hyper:75,77] connection(out(n1,and2(h)),in(n1,not1(h))).
% 98 [hyper:76,77] connection(out(n1,not1(h)),in(n2,and1(h))).
% 107 [hyper:49,86,cut:82] mode(and1(h),ok).
% 119 [hyper:49,88,cut:83] mode(not1(h),ok).
% 131 [hyper:49,89,cut:84] mode(or1(h),ok).
% 201 [hyper:43,90,78] value(in(n1,or1(h)),n1).
% 208 [hyper:55,201,cut:89,cut:131] value(out(n1,or1(h)),n1).
% 296 [hyper:43,94,80] value(out(n1,and1(h)),n0).
% 314 [hyper:43,95,81] value(out(n1,and2(h)),n0).
% 339 [hyper:43,96,208] value(in(n1,and1(h)),n1).
% 354 [hyper:43,97,314] value(in(n1,not1(h)),n0).
% 365 [hyper:60,354,cut:88,cut:119] value(out(n1,not1(h)),n1).
% 383 [hyper:43,98,365] value(in(n2,and1(h)),n1).
% 391 [hyper:51,383,cut:339,cut:86,cut:107] value(out(n1,and1(h)),n1).
% 400 [hyper:45,391,296,cut:46] 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 9
% clause depth limited to 3
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 53
% derived clauses: 441
% kept clauses: 34
% kept size sum: 212
% kept mid-nuclei: 265
% kept new demods: 0
% forw unit-subs: 118
% forw double-subs: 2
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 62
% full unit cutoff: 3
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 94
% length fails: 0
% strength fails: 1
% predlist fails: 89
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 4
% full subs fail: 4
%
% ; 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-1+noeq.in")
%
%------------------------------------------------------------------------------