%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWV008-1.001 : 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/HWV008-1.001+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(60,40,2,120,0,2,607,50,4,667,0,4)
%
%
% START OF PROOF
% 608 [] -value(X,Y) | -connection(X,Z) | value(Z,Y).
% 609 [] -value(X,Y) | -connection(Z,X) | value(Z,Y).
% 610 [] -value(X,Z) | -value(X,Y) | equal_value(Y,Z).
% 612 [] -equal_value(n1,n0).
% 614 [] mode(X,ok) | mode(X,abnormal) | -type(X,Y).
% 615 [] value(out(n1,X),n0) | -value(in(Y,X),n0) | -type(X,and) | -mode(X,ok).
% 621 [] -value(in(n2,X),n0) | -value(in(n1,X),n0) | value(out(n1,X),n0) | -type(X,or) | -mode(X,ok).
% 630 [] type(and2(X),and) | -type(X,halfadder).
% 635 [] connection(in(n1,X),in(n1,and2(X))) | -type(X,halfadder).
% 638 [] connection(out(c,X),out(n1,and2(X))) | -type(X,halfadder).
% 642 [] type(h1(X),halfadder) | -type(X,fulladder).
% 643 [] type(h2(X),halfadder) | -type(X,fulladder).
% 644 [] type(or1(X),or) | -type(X,fulladder).
% 646 [] connection(out(c,h1(X)),in(n2,or1(X))) | -type(X,fulladder).
% 647 [] connection(out(c,h2(X)),in(n1,or1(X))) | -type(X,fulladder).
% 648 [] connection(in(n1,X),in(n1,h2(X))) | -type(X,fulladder).
% 649 [] connection(in(n2,X),in(n1,h1(X))) | -type(X,fulladder).
% 652 [] connection(out(c,X),out(n1,or1(X))) | -type(X,fulladder).
% 653 [] type(v(n1,X),fulladder) | -type(X,nbit_adder(n1)).
% 655 [] connection(out(c,X),out(c,v(n1,X))) | -type(X,nbit_adder(n1)).
% 656 [] connection(in(a1,X),in(n1,v(n1,X))) | -type(X,nbit_adder(n1)).
% 657 [] connection(in(b1,X),in(n2,v(n1,X))) | -type(X,nbit_adder(n1)).
% 659 [] type(a,nbit_adder(n1)).
% 660 [] value(in(a1,a),n0).
% 661 [] value(in(b1,a),n0).
% 664 [] value(out(c,a),n1).
% 665 [] -mode(or1(v(n1,a)),abnormal).
% 666 [] -mode(and2(h1(v(n1,a))),abnormal).
% 667 [] -mode(and2(h2(v(n1,a))),abnormal).
% 669 [hyper:653,659] type(v(n1,a),fulladder).
% 671 [hyper:655,659] connection(out(c,a),out(c,v(n1,a))).
% 672 [hyper:656,659] connection(in(a1,a),in(n1,v(n1,a))).
% 673 [hyper:657,659] connection(in(b1,a),in(n2,v(n1,a))).
% 702 [hyper:642,669] type(h1(v(n1,a)),halfadder).
% 703 [hyper:643,669] type(h2(v(n1,a)),halfadder).
% 704 [hyper:644,669] type(or1(v(n1,a)),or).
% 706 [hyper:646,669] connection(out(c,h1(v(n1,a))),in(n2,or1(v(n1,a)))).
% 707 [hyper:647,669] connection(out(c,h2(v(n1,a))),in(n1,or1(v(n1,a)))).
% 708 [hyper:648,669] connection(in(n1,v(n1,a)),in(n1,h2(v(n1,a)))).
% 709 [hyper:649,669] connection(in(n2,v(n1,a)),in(n1,h1(v(n1,a)))).
% 712 [hyper:652,669] connection(out(c,v(n1,a)),out(n1,or1(v(n1,a)))).
% 716 [hyper:630,702] type(and2(h1(v(n1,a))),and).
% 721 [hyper:635,702] connection(in(n1,h1(v(n1,a))),in(n1,and2(h1(v(n1,a))))).
% 724 [hyper:638,702] connection(out(c,h1(v(n1,a))),out(n1,and2(h1(v(n1,a))))).
% 730 [hyper:630,703] type(and2(h2(v(n1,a))),and).
% 735 [hyper:635,703] connection(in(n1,h2(v(n1,a))),in(n1,and2(h2(v(n1,a))))).
% 738 [hyper:638,703] connection(out(c,h2(v(n1,a))),out(n1,and2(h2(v(n1,a))))).
% 742 [hyper:614,704,cut:665] mode(or1(v(n1,a)),ok).
% 799 [hyper:614,716,cut:666] mode(and2(h1(v(n1,a))),ok).
% 822 [hyper:614,730,cut:667] mode(and2(h2(v(n1,a))),ok).
% 895 [hyper:608,671,664] value(out(c,v(n1,a)),n1).
% 909 [hyper:608,672,660] value(in(n1,v(n1,a)),n0).
% 926 [hyper:608,673,661] value(in(n2,v(n1,a)),n0).
% 984 [hyper:608,708,909] value(in(n1,h2(v(n1,a))),n0).
% 1010 [hyper:608,709,926] value(in(n1,h1(v(n1,a))),n0).
% 1062 [hyper:608,712,895] value(out(n1,or1(v(n1,a))),n1).
% 1197 [hyper:608,721,1010] value(in(n1,and2(h1(v(n1,a)))),n0).
% 1214 [hyper:615,1197,cut:716,cut:799] value(out(n1,and2(h1(v(n1,a)))),n0).
% 1249 [hyper:609,724,1214] value(out(c,h1(v(n1,a))),n0).
% 1253 [hyper:608,1249,706] value(in(n2,or1(v(n1,a))),n0).
% 1330 [hyper:608,735,984] value(in(n1,and2(h2(v(n1,a)))),n0).
% 1338 [hyper:615,1330,cut:730,cut:822] value(out(n1,and2(h2(v(n1,a)))),n0).
% 1387 [hyper:609,738,1338] value(out(c,h2(v(n1,a))),n0).
% 1391 [hyper:608,1387,707] value(in(n1,or1(v(n1,a))),n0).
% 1408 [hyper:621,1391,cut:1253,cut:704,cut:742] value(out(n1,or1(v(n1,a))),n0).
% 1417 [hyper:610,1408,1062,cut:612] 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: 248
% derived clauses: 2068
% kept clauses: 139
% kept size sum: 1371
% kept mid-nuclei: 968
% kept new demods: 0
% forw unit-subs: 475
% forw double-subs: 35
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 152
% full unit cutoff: 12
% dbl unit cutoff: 0
% real runtime : 0.6
% process. runtime: 0.5
% specific non-discr-tree subsumption statistics:
% tried: 375
% length fails: 0
% strength fails: 6
% predlist fails: 351
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 18
% full subs fail: 18
%
% ; 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.001+noeq.in")
%
%------------------------------------------------------------------------------