TSTP Solution File: HWV007-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWV007-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 : art08.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/HWV007-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(56,40,0,112,0,0,775,50,3,831,0,3)
%
%
% START OF PROOF
% 776 [] -value(X,Y) | -connection(X,Z) | value(Z,Y).
% 777 [] -value(X,Y) | -connection(Z,X) | value(Z,Y).
% 778 [] -value(X,Z) | -value(X,Y) | equal_value(Y,Z).
% 780 [] -equal_value(n1,n0).
% 782 [] mode(X,ok) | mode(X,abnormal) | -type(X,Y).
% 783 [] value(out(n1,X),n0) | -value(in(Y,X),n0) | -type(X,and) | -mode(X,ok).
% 784 [] -value(in(n2,X),n1) | -value(in(n1,X),n1) | value(out(n1,X),n1) | -type(X,and) | -mode(X,ok).
% 786 [] -value(out(n1,X),n1) | value(in(n1,X),n1) | -type(X,and) | -mode(X,ok).
% 789 [] -value(in(n2,X),n0) | -value(in(n1,X),n0) | value(out(n1,X),n0) | -type(X,or) | -mode(X,ok).
% 792 [] -value(out(n1,X),n0) | value(in(n2,X),n0) | -type(X,or) | -mode(X,ok).
% 794 [] -value(in(n1,X),n1) | value(out(n1,X),n0) | -type(X,not) | -mode(X,ok).
% 797 [] type(and1(X),and) | -type(X,halfadder).
% 798 [] type(and2(X),and) | -type(X,halfadder).
% 799 [] type(not1(X),not) | -type(X,halfadder).
% 800 [] type(or1(X),or) | -type(X,halfadder).
% 801 [] connection(in(n1,X),in(n1,or1(X))) | -type(X,halfadder).
% 802 [] connection(in(n2,X),in(n2,or1(X))) | -type(X,halfadder).
% 803 [] connection(in(n1,X),in(n1,and2(X))) | -type(X,halfadder).
% 804 [] connection(in(n2,X),in(n2,and2(X))) | -type(X,halfadder).
% 805 [] connection(out(s,X),out(n1,and1(X))) | -type(X,halfadder).
% 806 [] connection(out(c,X),out(n1,and2(X))) | -type(X,halfadder).
% 807 [] connection(out(n1,or1(X)),in(n1,and1(X))) | -type(X,halfadder).
% 808 [] connection(out(n1,and2(X)),in(n1,not1(X))) | -type(X,halfadder).
% 809 [] connection(out(n1,not1(X)),in(n2,and1(X))) | -type(X,halfadder).
% 810 [] type(h1(X),halfadder) | -type(X,fulladder).
% 811 [] type(h2(X),halfadder) | -type(X,fulladder).
% 812 [] type(or1(X),or) | -type(X,fulladder).
% 813 [] connection(out(s,h1(X)),in(n2,h2(X))) | -type(X,fulladder).
% 814 [] connection(out(c,h1(X)),in(n2,or1(X))) | -type(X,fulladder).
% 816 [] connection(in(n1,X),in(n1,h2(X))) | -type(X,fulladder).
% 817 [] connection(in(n2,X),in(n1,h1(X))) | -type(X,fulladder).
% 818 [] connection(in(c,X),in(n2,h1(X))) | -type(X,fulladder).
% 819 [] connection(out(s,X),out(s,h2(X))) | -type(X,fulladder).
% 820 [] connection(out(c,X),out(n1,or1(X))) | -type(X,fulladder).
% 821 [] type(f,fulladder).
% 822 [] value(in(n1,f),n0).
% 823 [] value(in(n2,f),n1).
% 824 [] value(in(c,f),n1).
% 825 [] value(out(s,f),n1).
% 826 [] value(out(c,f),n0).
% 827 [] -mode(and2(h1(f)),abnormal).
% 828 [] -mode(and1(h1(f)),abnormal) | -mode(or1(f),abnormal).
% 829 [] -mode(not1(h1(f)),abnormal) | -mode(or1(f),abnormal).
% 830 [] -mode(and1(h2(f)),abnormal) | -mode(or1(f),abnormal).
% 831 [] -mode(or1(h2(f)),abnormal) | -mode(or1(f),abnormal).
% 833 [hyper:810,821] type(h1(f),halfadder).
% 834 [hyper:811,821] type(h2(f),halfadder).
% 835 [hyper:812,821] type(or1(f),or).
% 836 [hyper:813,821] connection(out(s,h1(f)),in(n2,h2(f))).
% 837 [hyper:814,821] connection(out(c,h1(f)),in(n2,or1(f))).
% 839 [hyper:816,821] connection(in(n1,f),in(n1,h2(f))).
% 840 [hyper:817,821] connection(in(n2,f),in(n1,h1(f))).
% 841 [hyper:818,821] connection(in(c,f),in(n2,h1(f))).
% 842 [hyper:819,821] connection(out(s,f),out(s,h2(f))).
% 843 [hyper:820,821] connection(out(c,f),out(n1,or1(f))).
% 845 [hyper:797,833] type(and1(h1(f)),and).
% 846 [hyper:798,833] type(and2(h1(f)),and).
% 847 [hyper:799,833] type(not1(h1(f)),not).
% 851 [hyper:803,833] connection(in(n1,h1(f)),in(n1,and2(h1(f)))).
% 852 [hyper:804,833] connection(in(n2,h1(f)),in(n2,and2(h1(f)))).
% 853 [hyper:805,833] connection(out(s,h1(f)),out(n1,and1(h1(f)))).
% 854 [hyper:806,833] connection(out(c,h1(f)),out(n1,and2(h1(f)))).
% 856 [hyper:808,833] connection(out(n1,and2(h1(f))),in(n1,not1(h1(f)))).
% 857 [hyper:809,833] connection(out(n1,not1(h1(f))),in(n2,and1(h1(f)))).
% 859 [hyper:797,834] type(and1(h2(f)),and).
% 862 [hyper:800,834] type(or1(h2(f)),or).
% 863 [hyper:801,834] connection(in(n1,h2(f)),in(n1,or1(h2(f)))).
% 864 [hyper:802,834] connection(in(n2,h2(f)),in(n2,or1(h2(f)))).
% 867 [hyper:805,834] connection(out(s,h2(f)),out(n1,and1(h2(f)))).
% 869 [hyper:807,834] connection(out(n1,or1(h2(f))),in(n1,and1(h2(f)))).
% 880 [hyper:782,835] mode(or1(f),abnormal) | mode(or1(f),ok).
% 886 [hyper:782,845] mode(and1(h1(f)),abnormal) | mode(and1(h1(f)),ok).
% 892 [hyper:782,846,cut:827] mode(and2(h1(f)),ok).
% 905 [hyper:782,847] mode(not1(h1(f)),abnormal) | mode(not1(h1(f)),ok).
% 916 [hyper:782,859] mode(and1(h2(f)),abnormal) | mode(and1(h2(f)),ok).
% 938 [hyper:782,862] mode(or1(h2(f)),abnormal) | mode(or1(h2(f)),ok).
% 987 [hyper:776,839,822] value(in(n1,h2(f)),n0).
% 1000 [hyper:776,840,823] value(in(n1,h1(f)),n1).
% 1011 [hyper:776,841,824] value(in(n2,h1(f)),n1).
% 1032 [hyper:776,842,825] value(out(s,h2(f)),n1).
% 1041 [hyper:776,843,826] value(out(n1,or1(f)),n0).
% 1106 [hyper:792,880,cut:835,cut:1041] value(in(n2,or1(f)),n0) | mode(or1(f),abnormal).
% 1198 [hyper:776,851,1000] value(in(n1,and2(h1(f))),n1).
% 1215 [hyper:776,852,1011] value(in(n2,and2(h1(f))),n1).
% 1227 [hyper:784,1215,cut:1198,cut:846,cut:892] value(out(n1,and2(h1(f))),n1).
% 1247 [hyper:777,854,1227] value(out(c,h1(f)),n1).
% 1251 [hyper:776,1247,837] value(in(n2,or1(f)),n1).
% 1273 [hyper:776,863,987] value(in(n1,or1(h2(f))),n0).
% 1334 [hyper:776,867,1032] value(out(n1,and1(h2(f))),n1).
% 1675 [hyper:778,1106,1251,cut:780] mode(or1(f),abnormal).
% 1683 [hyper:828,1675,886] mode(and1(h1(f)),ok).
% 1685 [hyper:829,1675,905] mode(not1(h1(f)),ok).
% 1687 [hyper:830,1675,916] mode(and1(h2(f)),ok).
% 1689 [hyper:831,1675,938] mode(or1(h2(f)),ok).
% 1755 [hyper:786,1687,cut:859,cut:1334] value(in(n1,and1(h2(f))),n1).
% 1835 [hyper:776,856,1227] value(in(n1,not1(h1(f))),n1).
% 1849 [hyper:794,1835,cut:847,cut:1685] value(out(n1,not1(h1(f))),n0).
% 1884 [hyper:776,857,1849] value(in(n2,and1(h1(f))),n0).
% 1892 [hyper:783,1884,cut:845,cut:1683] value(out(n1,and1(h1(f))),n0).
% 1900 [hyper:777,1892,853] value(out(s,h1(f)),n0).
% 1912 [hyper:776,1900,836] value(in(n2,h2(f)),n0).
% 1921 [hyper:776,1912,864] value(in(n2,or1(h2(f))),n0).
% 1939 [hyper:789,1921,cut:1273,cut:862,cut:1689] value(out(n1,or1(h2(f))),n0).
% 1969 [hyper:776,869,1939] value(in(n1,and1(h2(f))),n0).
% 1977 [hyper:778,1969,1755,cut:780] 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: 257
% derived clauses: 3596
% kept clauses: 173
% kept size sum: 1427
% kept mid-nuclei: 1452
% kept new demods: 0
% forw unit-subs: 784
% forw double-subs: 297
% forw overdouble-subs: 0
% backward subs: 6
% fast unit cutoff: 308
% full unit cutoff: 26
% dbl unit cutoff: 15
% real runtime : 0.7
% process. runtime: 0.7
% specific non-discr-tree subsumption statistics:
% tried: 732
% length fails: 0
% strength fails: 6
% predlist fails: 700
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 26
% full subs fail: 26
%
% ; 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/HWV007-1+noeq.in")
%
%------------------------------------------------------------------------------