TSTP Solution File: HWV008-1.002 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWV008-1.002 : TPTP v3.4.2. Bugfixed v2.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art09.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/HWV008-1.002+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 4 9)
% (binary-unit 10 #f 4 9)
% (binary-double 16 #f 4 9)
% (binary 54 #t 4 9)
% (binary-order 27 #f 4 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(68,40,1,136,0,1,895,50,4,963,0,4)
%
%
% START OF PROOF
% 896 [] -value(X,Y) | -connection(X,Z) | value(Z,Y).
% 897 [] -value(X,Y) | -connection(Z,X) | value(Z,Y).
% 898 [] -value(X,Z) | -value(X,Y) | equal_value(Y,Z).
% 900 [] -equal_value(n1,n0).
% 902 [] mode(X,ok) | mode(X,abnormal) | -type(X,Y).
% 903 [] value(out(n1,X),n0) | -value(in(Y,X),n0) | -type(X,and) | -mode(X,ok).
% 909 [] -value(in(n2,X),n0) | -value(in(n1,X),n0) | value(out(n1,X),n0) | -type(X,or) | -mode(X,ok).
% 918 [] type(and2(X),and) | -type(X,halfadder).
% 923 [] connection(in(n1,X),in(n1,and2(X))) | -type(X,halfadder).
% 926 [] connection(out(c,X),out(n1,and2(X))) | -type(X,halfadder).
% 930 [] type(h1(X),halfadder) | -type(X,fulladder).
% 931 [] type(h2(X),halfadder) | -type(X,fulladder).
% 932 [] type(or1(X),or) | -type(X,fulladder).
% 934 [] connection(out(c,h1(X)),in(n2,or1(X))) | -type(X,fulladder).
% 935 [] connection(out(c,h2(X)),in(n1,or1(X))) | -type(X,fulladder).
% 936 [] connection(in(n1,X),in(n1,h2(X))) | -type(X,fulladder).
% 937 [] connection(in(n2,X),in(n1,h1(X))) | -type(X,fulladder).
% 940 [] connection(out(c,X),out(n1,or1(X))) | -type(X,fulladder).
% 942 [] type(f(n2,X),fulladder) | -type(X,nbit_adder(n2)).
% 945 [] connection(out(c,X),out(c,f(n2,X))) | -type(X,nbit_adder(n2)).
% 948 [] connection(in(a2,X),in(n1,f(n2,X))) | -type(X,nbit_adder(n2)).
% 949 [] connection(in(b2,X),in(n2,f(n2,X))) | -type(X,nbit_adder(n2)).
% 952 [] type(a,nbit_adder(n2)).
% 954 [] value(in(a2,a),n0).
% 956 [] value(in(b2,a),n0).
% 960 [] value(out(c,a),n1).
% 961 [] -mode(or1(f(n2,a)),abnormal).
% 962 [] -mode(and2(h1(f(n2,a))),abnormal).
% 963 [] -mode(and2(h2(f(n2,a))),abnormal).
% 966 [hyper:942,952] type(f(n2,a),fulladder).
% 969 [hyper:945,952] connection(out(c,a),out(c,f(n2,a))).
% 972 [hyper:948,952] connection(in(a2,a),in(n1,f(n2,a))).
% 973 [hyper:949,952] connection(in(b2,a),in(n2,f(n2,a))).
% 1027 [hyper:930,966] type(h1(f(n2,a)),halfadder).
% 1028 [hyper:931,966] type(h2(f(n2,a)),halfadder).
% 1029 [hyper:932,966] type(or1(f(n2,a)),or).
% 1031 [hyper:934,966] connection(out(c,h1(f(n2,a))),in(n2,or1(f(n2,a)))).
% 1032 [hyper:935,966] connection(out(c,h2(f(n2,a))),in(n1,or1(f(n2,a)))).
% 1033 [hyper:936,966] connection(in(n1,f(n2,a)),in(n1,h2(f(n2,a)))).
% 1034 [hyper:937,966] connection(in(n2,f(n2,a)),in(n1,h1(f(n2,a)))).
% 1037 [hyper:940,966] connection(out(c,f(n2,a)),out(n1,or1(f(n2,a)))).
% 1075 [hyper:918,1027] type(and2(h1(f(n2,a))),and).
% 1080 [hyper:923,1027] connection(in(n1,h1(f(n2,a))),in(n1,and2(h1(f(n2,a))))).
% 1083 [hyper:926,1027] connection(out(c,h1(f(n2,a))),out(n1,and2(h1(f(n2,a))))).
% 1089 [hyper:918,1028] type(and2(h2(f(n2,a))),and).
% 1094 [hyper:923,1028] connection(in(n1,h2(f(n2,a))),in(n1,and2(h2(f(n2,a))))).
% 1097 [hyper:926,1028] connection(out(c,h2(f(n2,a))),out(n1,and2(h2(f(n2,a))))).
% 1101 [hyper:902,1029,cut:961] mode(or1(f(n2,a)),ok).
% 1229 [hyper:902,1075,cut:962] mode(and2(h1(f(n2,a))),ok).
% 1254 [hyper:902,1089,cut:963] mode(and2(h2(f(n2,a))),ok).
% 1335 [hyper:896,969,960] value(out(c,f(n2,a)),n1).
% 1390 [hyper:896,972,954] value(in(n1,f(n2,a)),n0).
% 1404 [hyper:896,973,956] value(in(n2,f(n2,a)),n0).
% 1569 [hyper:896,1033,1390] value(in(n1,h2(f(n2,a))),n0).
% 1588 [hyper:896,1034,1404] value(in(n1,h1(f(n2,a))),n0).
% 1639 [hyper:896,1037,1335] value(out(n1,or1(f(n2,a))),n1).
% 1969 [hyper:896,1080,1588] value(in(n1,and2(h1(f(n2,a)))),n0).
% 1977 [hyper:903,1969,cut:1075,cut:1229] value(out(n1,and2(h1(f(n2,a)))),n0).
% 2010 [hyper:897,1083,1977] value(out(c,h1(f(n2,a))),n0).
% 2014 [hyper:896,2010,1031] value(in(n2,or1(f(n2,a))),n0).
% 2062 [hyper:896,1094,1569] value(in(n1,and2(h2(f(n2,a)))),n0).
% 2074 [hyper:903,2062,cut:1089,cut:1254] value(out(n1,and2(h2(f(n2,a)))),n0).
% 2103 [hyper:897,1097,2074] value(out(c,h2(f(n2,a))),n0).
% 2107 [hyper:896,2103,1032] value(in(n1,or1(f(n2,a))),n0).
% 2120 [hyper:909,2107,cut:2014,cut:1029,cut:1101] value(out(n1,or1(f(n2,a))),n0).
% 2134 [hyper:898,2120,1639,cut:900] 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 5
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 355
% derived clauses: 3421
% kept clauses: 240
% kept size sum: 2462
% kept mid-nuclei: 1531
% kept new demods: 0
% forw unit-subs: 733
% forw double-subs: 59
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 192
% full unit cutoff: 16
% dbl unit cutoff: 0
% real runtime : 0.7
% process. runtime: 0.7
% specific non-discr-tree subsumption statistics:
% tried: 670
% length fails: 0
% strength fails: 6
% predlist fails: 636
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 28
% full subs fail: 28
%
% ; 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/HWV008-1.002+noeq.in")
%
%------------------------------------------------------------------------------