TSTP Solution File: HWV001-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWV001-1 : TPTP v3.4.2. Released v1.1.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art03.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/HWV001-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: short
%
% strategies selected:
% (binary-posweight-order 57 #f 4 1)
% (binary-unit 28 #f 4 1)
% (binary-double 28 #f 4 1)
% (binary 45 #t 4 1)
% (hyper 11 #t 4 1)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(48,40,1,96,0,1)
%
%
% START OF PROOF
% 50 [] equal(and(X,n0),n0).
% 51 [] equal(and(X,n1),X).
% 52 [] equal(or(X,n0),X).
% 53 [] equal(or(X,n1),n1).
% 56 [] equal(and(X,Y),and(Y,X)).
% 57 [] equal(or(X,Y),or(Y,X)).
% 58 [] equal(and(X,and(Y,Z)),and(and(X,Y),Z)).
% 59 [] equal(or(X,or(Y,Z)),or(or(X,Y),Z)).
% 62 [] equal(not(and(X,Y)),or(not(X),not(Y))).
% 63 [] equal(not(or(X,Y)),and(not(X),not(Y))).
% 64 [] equal(and(or(X,Y),Z),or(and(X,Z),and(Y,Z))).
% 65 [] equal(and(X,X),X).
% 67 [] equal(and(X,and(Y,X)),and(X,Y)).
% 70 [] equal(or(X,or(Y,X)),or(X,Y)).
% 71 [] equal(and(X,not(X)),n0).
% 73 [] equal(and(X,and(Y,not(X))),n0).
% 77 [] equal(not(not(X)),X).
% 78 [] equal(or(and(X,Y),and(X,not(Y))),X).
% 79 [] equal(or(and(X,Y),and(Y,not(X))),Y).
% 80 [] equal(a1,and(b1,b3)).
% 81 [] equal(a2,and(b2,b3)).
% 82 [] equal(b1,not(d1)).
% 83 [] equal(b2,not(d2)).
% 84 [] equal(b3,or(c1,c2)).
% 85 [] equal(c1,or(d1,d3)).
% 86 [] equal(c2,or(d2,d3)).
% 87 [] equal(d3,f3).
% 88 [] equal(d1,not(e1)).
% 89 [] equal(d2,not(e2)).
% 90 [] equal(e1,or(f1,f3)).
% 91 [] equal(e2,or(f2,f3)).
% 92 [] equal(f1,not(i1)).
% 93 [] equal(f2,not(i2)).
% 94 [] equal(f3,and(i1,i2)).
% 95 [] circuit(input(i1,i2),output(a1,a2)).
% 96 [] -circuit(input(i1,i2),output(i2,i1)).
% 99 [para:88.1.2,77.1.1.1,demod:82] equal(b1,e1).
% 100 [para:89.1.2,77.1.1.1,demod:83] equal(b2,e2).
% 101 [para:92.1.2,77.1.1.1] equal(not(f1),i1).
% 102 [para:93.1.2,77.1.1.1] equal(not(f2),i2).
% 106 [para:82.1.2,71.1.1.2] equal(and(d1,b1),n0).
% 107 [para:83.1.2,71.1.1.2] equal(and(d2,b2),n0).
% 117 [para:99.1.1,106.1.1.2] equal(and(d1,e1),n0).
% 118 [para:56.1.1,80.1.2] equal(a1,and(b3,b1)).
% 119 [para:56.1.1,81.1.2] equal(a2,and(b3,b2)).
% 120 [para:56.1.1,51.1.1] equal(and(n1,X),X).
% 121 [para:56.1.1,50.1.1] equal(and(n0,X),n0).
% 122 [para:56.1.1,94.1.2] equal(f3,and(i2,i1)).
% 125 [para:57.1.1,84.1.2] equal(b3,or(c2,c1)).
% 126 [para:57.1.1,85.1.2] equal(c1,or(d3,d1)).
% 127 [para:57.1.1,52.1.1] equal(or(n0,X),X).
% 128 [para:57.1.1,53.1.1] equal(or(n1,X),n1).
% 129 [para:57.1.1,86.1.2] equal(c2,or(d3,d2)).
% 130 [para:57.1.1,90.1.2] equal(e1,or(f3,f1)).
% 131 [para:57.1.1,91.1.2] equal(e2,or(f3,f2)).
% 136 [para:65.1.1,58.1.2.1] equal(and(X,and(X,Y)),and(X,Y)).
% 137 [para:94.1.2,58.1.2.1] equal(and(i1,and(i2,X)),and(f3,X)).
% 141 [para:107.1.1,58.1.2.1,demod:121] equal(and(d2,and(b2,X)),n0).
% 153 [para:117.1.1,58.1.2.1,demod:121] equal(and(d1,and(e1,X)),n0).
% 158 [para:85.1.2,59.1.2.1] equal(or(d1,or(d3,X)),or(c1,X)).
% 159 [para:86.1.2,59.1.2.1] equal(or(d2,or(d3,X)),or(c2,X)).
% 167 [para:122.1.2,58.1.2.1] equal(and(i2,and(i1,X)),and(f3,X)).
% 212 [para:88.1.2,62.1.2.2] equal(not(and(X,e1)),or(not(X),d1)).
% 215 [para:92.1.2,62.1.2.1] equal(not(and(i1,X)),or(f1,not(X))).
% 245 [para:77.1.1,63.1.2.1] equal(not(or(not(X),Y)),and(X,not(Y))).
% 251 [para:101.1.1,63.1.2.1] equal(not(or(f1,X)),and(i1,not(X))).
% 253 [para:102.1.1,63.1.2.1] equal(not(or(f2,X)),and(i2,not(X))).
% 265 [para:65.1.1,64.1.2.1] equal(and(or(X,Y),X),or(X,and(Y,X))).
% 271 [para:71.1.1,64.1.2.1,demod:127] equal(and(or(X,Y),not(X)),and(Y,not(X))).
% 279 [para:120.1.1,64.1.2.1,demod:265,120,128] equal(X,and(or(X,Y),X)).
% 330 [para:90.1.2,279.1.2.1] equal(f1,and(e1,f1)).
% 331 [para:91.1.2,279.1.2.1] equal(f2,and(e2,f2)).
% 338 [para:130.1.2,279.1.2.1] equal(f3,and(e1,f3)).
% 339 [para:131.1.2,279.1.2.1] equal(f3,and(e2,f3)).
% 356 [para:94.1.2,67.1.1.2,demod:122] equal(and(i2,f3),f3).
% 361 [para:122.1.2,67.1.1.2,demod:94] equal(and(i1,f3),f3).
% 373 [para:100.1.2,331.1.2.1] equal(f2,and(b2,f2)).
% 387 [para:85.1.2,70.1.1.2,demod:126] equal(or(d3,c1),c1).
% 388 [para:86.1.2,70.1.1.2,demod:129] equal(or(d3,c2),c2).
% 409 [para:100.1.2,339.1.2.1] equal(f3,and(b2,f3)).
% 463 [para:87.1.2,356.1.1.2] equal(and(i2,d3),f3).
% 476 [para:87.1.2,361.1.1.2] equal(and(i1,d3),f3).
% 507 [para:279.1.2,78.1.1.1,demod:271] equal(or(X,and(Y,not(X))),or(X,Y)).
% 623 [para:136.1.1,78.1.1.1,demod:507] equal(or(and(X,Y),X),X).
% 646 [para:137.1.1,73.1.1,demod:92] equal(and(f3,f1),n0).
% 714 [para:373.1.2,141.1.1.2] equal(and(d2,f2),n0).
% 716 [para:409.1.2,141.1.1.2] equal(and(d2,f3),n0).
% 885 [para:87.1.2,646.1.1.1] equal(and(d3,f1),n0).
% 932 [para:714.1.1,78.1.1.1,demod:127,102] equal(and(d2,i2),d2).
% 935 [para:716.1.1,56.1.1] equal(n0,and(f3,d2)).
% 986 [para:330.1.2,153.1.1.2] equal(and(d1,f1),n0).
% 987 [para:338.1.2,153.1.1.2] equal(and(d1,f3),n0).
% 994 [para:885.1.1,79.1.1.1,demod:127] equal(and(f1,not(d3)),f1).
% 1004 [para:932.1.1,56.1.1] equal(d2,and(i2,d2)).
% 1038 [para:986.1.1,78.1.1.1,demod:127,101] equal(and(d1,i1),d1).
% 1042 [para:987.1.1,56.1.1] equal(n0,and(f3,d1)).
% 1065 [para:1004.1.2,137.1.1.2,demod:935] equal(and(i1,d2),n0).
% 1069 [para:1038.1.1,56.1.1] equal(d1,and(i1,d1)).
% 1116 [para:1065.1.1,78.1.1.1,demod:127,83] equal(and(i1,b2),i1).
% 1130 [para:388.1.1,158.1.1.2,demod:84] equal(or(d1,c2),b3).
% 1162 [para:387.1.1,159.1.1.2,demod:125] equal(or(d2,c1),b3).
% 1435 [para:1069.1.2,167.1.1.2,demod:1042] equal(and(i2,d1),n0).
% 1510 [para:1435.1.1,78.1.1.1,demod:127,82] equal(and(i2,b1),i2).
% 1690 [para:994.1.1,56.1.1] equal(f1,and(not(d3),f1)).
% 1904 [para:1690.1.2,623.1.1.1] equal(or(f1,not(d3)),not(d3)).
% 2121 [para:212.1.1,77.1.1.1,demod:82,245] equal(and(X,b1),and(X,e1)).
% 2190 [para:476.1.1,215.1.1.1,demod:1904] equal(not(f3),not(d3)).
% 2924 [para:90.1.2,251.1.1.1,demod:2190,88] equal(d1,and(i1,not(d3))).
% 2938 [para:2924.1.2,78.1.1.1,demod:476,77] equal(or(d1,f3),i1).
% 2944 [para:87.1.2,2938.1.1.2,demod:85] equal(c1,i1).
% 2963 [para:2944.1.2,1116.1.1.1] equal(and(c1,b2),i1).
% 2998 [para:91.1.2,253.1.1.1,demod:2190,89] equal(d2,and(i2,not(d3))).
% 3154 [para:2998.1.2,78.1.1.1,demod:463,77] equal(or(d2,f3),i2).
% 3160 [para:87.1.2,3154.1.1.2,demod:86] equal(c2,i2).
% 3180 [para:3160.1.2,1510.1.1.1,demod:2121] equal(and(c2,e1),i2).
% 3520 [para:1130.1.1,271.1.1.1,demod:3180,2121,118,82] equal(a1,i2).
% 3521 [para:1162.1.1,271.1.1.1,demod:2963,119,83] equal(a2,i1).
% 3572 [para:3520.1.1,95.1.2.1] circuit(input(i1,i2),output(i2,a2)).
% 7128 [para:3521.1.1,3572.1.2.2,cut:96] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 1
% clause depth limited to 4
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1630
% derived clauses: 206340
% kept clauses: 7031
% kept size sum: 76577
% kept mid-nuclei: 0
% kept new demods: 6566
% forw unit-subs: 191434
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 7
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 5.39
% process. runtime: 5.36
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/HWV001-1+eq_r.in")
%
%------------------------------------------------------------------------------