TSTP Solution File: HWV006-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWV006-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 : 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/HWV006-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(58,40,0,116,0,1,617,50,3,675,0,3)
%
%
% START OF PROOF
% 618 [] -value(X,Y) | -connection(X,Z) | value(Z,Y).
% 619 [] -value(X,Y) | -connection(Z,X) | value(Z,Y).
% 620 [] -value(X,Z) | -value(X,Y) | equal_value(Y,Z).
% 621 [] -equal_value(n0,n1).
% 622 [] -equal_value(n1,n0).
% 624 [] mode(X,ok) | mode(X,abnormal) | -type(X,Y).
% 625 [] value(out(n1,X),n0) | -value(in(Y,X),n0) | -type(X,and) | -mode(X,ok).
% 626 [] -value(in(n2,X),n1) | -value(in(n1,X),n1) | value(out(n1,X),n1) | -type(X,and) | -mode(X,ok).
% 629 [] -value(out(n1,X),n1) | value(in(n2,X),n1) | -type(X,and) | -mode(X,ok).
% 630 [] value(out(n1,X),n1) | -value(in(Y,X),n1) | -type(X,or) | -mode(X,ok).
% 633 [] -value(out(n1,X),n0) | value(in(n1,X),n0) | -type(X,or) | -mode(X,ok).
% 635 [] -value(in(n1,X),n0) | value(out(n1,X),n1) | -type(X,not) | -mode(X,ok).
% 636 [] -value(in(n1,X),n1) | value(out(n1,X),n0) | -type(X,not) | -mode(X,ok).
% 639 [] type(and1(X),and) | -type(X,halfadder).
% 640 [] type(and2(X),and) | -type(X,halfadder).
% 641 [] type(not1(X),not) | -type(X,halfadder).
% 642 [] type(or1(X),or) | -type(X,halfadder).
% 644 [] connection(in(n2,X),in(n2,or1(X))) | -type(X,halfadder).
% 645 [] connection(in(n1,X),in(n1,and2(X))) | -type(X,halfadder).
% 646 [] connection(in(n2,X),in(n2,and2(X))) | -type(X,halfadder).
% 647 [] connection(out(s,X),out(n1,and1(X))) | -type(X,halfadder).
% 648 [] connection(out(c,X),out(n1,and2(X))) | -type(X,halfadder).
% 649 [] connection(out(n1,or1(X)),in(n1,and1(X))) | -type(X,halfadder).
% 650 [] connection(out(n1,and2(X)),in(n1,not1(X))) | -type(X,halfadder).
% 651 [] connection(out(n1,not1(X)),in(n2,and1(X))) | -type(X,halfadder).
% 652 [] type(h1(X),halfadder) | -type(X,fulladder).
% 653 [] type(h2(X),halfadder) | -type(X,fulladder).
% 654 [] type(or1(X),or) | -type(X,fulladder).
% 655 [] connection(out(s,h1(X)),in(n2,h2(X))) | -type(X,fulladder).
% 657 [] connection(out(c,h2(X)),in(n1,or1(X))) | -type(X,fulladder).
% 658 [] connection(in(n1,X),in(n1,h2(X))) | -type(X,fulladder).
% 659 [] connection(in(n2,X),in(n1,h1(X))) | -type(X,fulladder).
% 660 [] connection(in(c,X),in(n2,h1(X))) | -type(X,fulladder).
% 661 [] connection(out(s,X),out(s,h2(X))) | -type(X,fulladder).
% 662 [] connection(out(c,X),out(n1,or1(X))) | -type(X,fulladder).
% 663 [] type(f,fulladder).
% 664 [] value(in(n1,f),n1).
% 665 [] value(in(n2,f),n0).
% 666 [] value(in(c,f),n1).
% 667 [] value(out(s,f),n1).
% 668 [] value(out(c,f),n0).
% 669 [] -mode(not1(h2(f)),abnormal) | -mode(or1(f),abnormal).
% 670 [] -mode(and2(h2(f)),abnormal).
% 671 [] -mode(and1(h2(f)),abnormal) | -mode(or1(f),abnormal).
% 672 [] -mode(or1(h1(f)),abnormal).
% 673 [] -mode(not1(h1(f)),abnormal).
% 674 [] -mode(and2(h1(f)),abnormal).
% 675 [] -mode(and1(h1(f)),abnormal).
% 677 [hyper:652,663] type(h1(f),halfadder).
% 678 [hyper:653,663] type(h2(f),halfadder).
% 679 [hyper:654,663] type(or1(f),or).
% 680 [hyper:655,663] connection(out(s,h1(f)),in(n2,h2(f))).
% 682 [hyper:657,663] connection(out(c,h2(f)),in(n1,or1(f))).
% 683 [hyper:658,663] connection(in(n1,f),in(n1,h2(f))).
% 684 [hyper:659,663] connection(in(n2,f),in(n1,h1(f))).
% 685 [hyper:660,663] connection(in(c,f),in(n2,h1(f))).
% 686 [hyper:661,663] connection(out(s,f),out(s,h2(f))).
% 687 [hyper:662,663] connection(out(c,f),out(n1,or1(f))).
% 689 [hyper:639,677] type(and1(h1(f)),and).
% 690 [hyper:640,677] type(and2(h1(f)),and).
% 691 [hyper:641,677] type(not1(h1(f)),not).
% 692 [hyper:642,677] type(or1(h1(f)),or).
% 694 [hyper:644,677] connection(in(n2,h1(f)),in(n2,or1(h1(f)))).
% 695 [hyper:645,677] connection(in(n1,h1(f)),in(n1,and2(h1(f)))).
% 697 [hyper:647,677] connection(out(s,h1(f)),out(n1,and1(h1(f)))).
% 699 [hyper:649,677] connection(out(n1,or1(h1(f))),in(n1,and1(h1(f)))).
% 700 [hyper:650,677] connection(out(n1,and2(h1(f))),in(n1,not1(h1(f)))).
% 701 [hyper:651,677] connection(out(n1,not1(h1(f))),in(n2,and1(h1(f)))).
% 703 [hyper:639,678] type(and1(h2(f)),and).
% 704 [hyper:640,678] type(and2(h2(f)),and).
% 705 [hyper:641,678] type(not1(h2(f)),not).
% 709 [hyper:645,678] connection(in(n1,h2(f)),in(n1,and2(h2(f)))).
% 710 [hyper:646,678] connection(in(n2,h2(f)),in(n2,and2(h2(f)))).
% 711 [hyper:647,678] connection(out(s,h2(f)),out(n1,and1(h2(f)))).
% 712 [hyper:648,678] connection(out(c,h2(f)),out(n1,and2(h2(f)))).
% 714 [hyper:650,678] connection(out(n1,and2(h2(f))),in(n1,not1(h2(f)))).
% 715 [hyper:651,678] connection(out(n1,not1(h2(f))),in(n2,and1(h2(f)))).
% 724 [hyper:624,679] mode(or1(f),abnormal) | mode(or1(f),ok).
% 737 [hyper:624,689,cut:675] mode(and1(h1(f)),ok).
% 743 [hyper:624,690,cut:674] mode(and2(h1(f)),ok).
% 754 [hyper:624,691,cut:673] mode(not1(h1(f)),ok).
% 759 [hyper:624,692,cut:672] mode(or1(h1(f)),ok).
% 765 [hyper:624,703] mode(and1(h2(f)),abnormal) | mode(and1(h2(f)),ok).
% 771 [hyper:624,704,cut:670] mode(and2(h2(f)),ok).
% 777 [hyper:624,705] mode(not1(h2(f)),abnormal) | mode(not1(h2(f)),ok).
% 895 [hyper:618,683,664] value(in(n1,h2(f)),n1).
% 907 [hyper:618,684,665] value(in(n1,h1(f)),n0).
% 929 [hyper:618,685,666] value(in(n2,h1(f)),n1).
% 942 [hyper:618,686,667] value(out(s,h2(f)),n1).
% 953 [hyper:618,687,668] value(out(n1,or1(f)),n0).
% 1022 [hyper:633,724,cut:679,cut:953] value(in(n1,or1(f)),n0) | mode(or1(f),abnormal).
% 1055 [hyper:618,694,929] value(in(n2,or1(h1(f))),n1).
% 1081 [hyper:630,1055,cut:692,cut:759] value(out(n1,or1(h1(f))),n1).
% 1096 [hyper:618,695,907] value(in(n1,and2(h1(f))),n0).
% 1104 [hyper:625,1096,cut:690,cut:743] value(out(n1,and2(h1(f))),n0).
% 1207 [hyper:618,709,895] value(in(n1,and2(h2(f))),n1).
% 1229 [hyper:618,711,942] value(out(n1,and1(h2(f))),n1).
% 1397 [hyper:619,1022,682] value(out(c,h2(f)),n0) | mode(or1(f),abnormal).
% 1441 [hyper:618,699,1081] value(in(n1,and1(h1(f))),n1).
% 1473 [hyper:618,700,1104] value(in(n1,not1(h1(f))),n0).
% 1497 [hyper:635,1473,cut:691,cut:754] value(out(n1,not1(h1(f))),n1).
% 1505 [hyper:618,1497,701] value(in(n2,and1(h1(f))),n1).
% 1523 [hyper:626,1505,cut:1441,cut:689,cut:737] value(out(n1,and1(h1(f))),n1).
% 1530 [hyper:619,1523,697] value(out(s,h1(f)),n1).
% 1539 [hyper:618,1530,680] value(in(n2,h2(f)),n1).
% 1556 [hyper:618,1539,710] value(in(n2,and2(h2(f))),n1).
% 1584 [hyper:626,1556,cut:1207,cut:704,cut:771] value(out(n1,and2(h2(f))),n1).
% 1595 [hyper:619,1584,712] value(out(c,h2(f)),n1).
% 1613 [hyper:620,1595,1397,cut:621] mode(or1(f),abnormal).
% 1620 [hyper:669,1613,777] mode(not1(h2(f)),ok).
% 1622 [hyper:671,1613,765] mode(and1(h2(f)),ok).
% 1661 [hyper:629,1622,cut:703,cut:1229] value(in(n2,and1(h2(f))),n1).
% 1708 [hyper:618,714,1584] value(in(n1,not1(h2(f))),n1).
% 1728 [hyper:636,1708,cut:705,cut:1620] value(out(n1,not1(h2(f))),n0).
% 1751 [hyper:618,715,1728] value(in(n2,and1(h2(f))),n0).
% 1759 [hyper:620,1751,1661,cut:622] 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 4
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 256
% derived clauses: 2846
% kept clauses: 156
% kept size sum: 1191
% kept mid-nuclei: 1286
% kept new demods: 0
% forw unit-subs: 643
% forw double-subs: 158
% forw overdouble-subs: 0
% backward subs: 4
% fast unit cutoff: 272
% full unit cutoff: 14
% dbl unit cutoff: 10
% real runtime : 0.6
% process. runtime: 0.6
% specific non-discr-tree subsumption statistics:
% tried: 550
% length fails: 0
% strength fails: 7
% predlist fails: 509
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 34
% full subs fail: 34
%
% ; 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/HWV006-1+noeq.in")
%
%------------------------------------------------------------------------------