TSTP Solution File: HWV006-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWV006-2 : TPTP v3.4.2. Bugfixed v2.7.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art05.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-2+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 7)
% (binary-unit 10 #f 3 7)
% (binary-double 16 #f 3 7)
% (binary 54 #t 3 7)
% (binary-order 27 #f 3 7)
% (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(64,40,1,128,0,1,554,50,2,618,0,2)
%
%
% START OF PROOF
% 555 [] -connection(X,Y) | -zero(X) | zero(Y).
% 556 [] -connection(X,Y) | -one(X) | one(Y).
% 557 [] -connection(X,Y) | -zero(Y) | zero(X).
% 558 [] -connection(X,Y) | -one(Y) | one(X).
% 559 [] -one(X) | -zero(X).
% 560 [] -zero(in1(X)) | zero(out1(X)) | -and_ok(X).
% 562 [] -one(in2(X)) | -one(in1(X)) | one(out1(X)) | -and_ok(X).
% 565 [] -one(out1(X)) | one(in2(X)) | -and_ok(X).
% 567 [] -logic_and(X) | abnormal(X) | and_ok(X).
% 569 [] -one(in2(X)) | one(out1(X)) | -or_ok(X).
% 572 [] -zero(out1(X)) | zero(in1(X)) | -or_ok(X).
% 574 [] -or_ok(X) | -abnormal(X).
% 575 [] -logic_or(X) | or_ok(X) | abnormal(X).
% 576 [] -zero(in1(X)) | one(out1(X)) | -not_ok(X).
% 577 [] -one(in1(X)) | zero(out1(X)) | -not_ok(X).
% 581 [] -logic_not(X) | not_ok(X) | abnormal(X).
% 582 [] logic_and(and1(X)) | -halfadder(X).
% 583 [] logic_and(and2(X)) | -halfadder(X).
% 584 [] logic_not(not1(X)) | -halfadder(X).
% 585 [] logic_or(or1(X)) | -halfadder(X).
% 587 [] connection(in2(X),in2(or1(X))) | -halfadder(X).
% 588 [] connection(in1(X),in1(and2(X))) | -halfadder(X).
% 589 [] connection(in2(X),in2(and2(X))) | -halfadder(X).
% 590 [] connection(outs(X),out1(and1(X))) | -halfadder(X).
% 591 [] connection(outc(X),out1(and2(X))) | -halfadder(X).
% 592 [] connection(out1(or1(X)),in1(and1(X))) | -halfadder(X).
% 593 [] connection(out1(and2(X)),in1(not1(X))) | -halfadder(X).
% 594 [] connection(out1(not1(X)),in2(and1(X))) | -halfadder(X).
% 595 [] halfadder(h1(X)) | -fulladder(X).
% 596 [] halfadder(h2(X)) | -fulladder(X).
% 597 [] logic_or(or1(X)) | -fulladder(X).
% 598 [] connection(outs(h1(X)),in2(h2(X))) | -fulladder(X).
% 600 [] connection(outc(h2(X)),in1(or1(X))) | -fulladder(X).
% 601 [] connection(in1(X),in1(h2(X))) | -fulladder(X).
% 602 [] connection(in2(X),in1(h1(X))) | -fulladder(X).
% 603 [] connection(inc(X),in2(h1(X))) | -fulladder(X).
% 604 [] connection(outs(X),outs(h2(X))) | -fulladder(X).
% 605 [] connection(outc(X),out1(or1(X))) | -fulladder(X).
% 606 [] fulladder(f).
% 607 [] one(in1(f)).
% 608 [] zero(in2(f)).
% 609 [] one(inc(f)).
% 610 [] one(outs(f)).
% 611 [] zero(outc(f)).
% 612 [] -abnormal(not1(h2(f))) | -abnormal(or1(f)).
% 613 [] -abnormal(and2(h2(f))).
% 614 [] -abnormal(and1(h2(f))) | -abnormal(or1(f)).
% 615 [] -abnormal(or1(h1(f))).
% 616 [] -abnormal(not1(h1(f))).
% 617 [] -abnormal(and2(h1(f))).
% 618 [] -abnormal(and1(h1(f))).
% 619 [hyper:595,606] halfadder(h1(f)).
% 620 [hyper:596,606] halfadder(h2(f)).
% 621 [hyper:597,606] logic_or(or1(f)).
% 622 [hyper:598,606] connection(outs(h1(f)),in2(h2(f))).
% 624 [hyper:600,606] connection(outc(h2(f)),in1(or1(f))).
% 625 [hyper:601,606] connection(in1(f),in1(h2(f))).
% 626 [hyper:602,606] connection(in2(f),in1(h1(f))).
% 627 [hyper:603,606] connection(inc(f),in2(h1(f))).
% 628 [hyper:604,606] connection(outs(f),outs(h2(f))).
% 629 [hyper:605,606] connection(outc(f),out1(or1(f))).
% 650 [hyper:582,619] logic_and(and1(h1(f))).
% 651 [hyper:583,619] logic_and(and2(h1(f))).
% 652 [hyper:584,619] logic_not(not1(h1(f))).
% 653 [hyper:585,619] logic_or(or1(h1(f))).
% 655 [hyper:587,619] connection(in2(h1(f)),in2(or1(h1(f)))).
% 656 [hyper:588,619] connection(in1(h1(f)),in1(and2(h1(f)))).
% 658 [hyper:590,619] connection(outs(h1(f)),out1(and1(h1(f)))).
% 660 [hyper:592,619] connection(out1(or1(h1(f))),in1(and1(h1(f)))).
% 661 [hyper:593,619] connection(out1(and2(h1(f))),in1(not1(h1(f)))).
% 662 [hyper:594,619] connection(out1(not1(h1(f))),in2(and1(h1(f)))).
% 663 [hyper:582,620] logic_and(and1(h2(f))).
% 664 [hyper:583,620] logic_and(and2(h2(f))).
% 665 [hyper:584,620] logic_not(not1(h2(f))).
% 669 [hyper:588,620] connection(in1(h2(f)),in1(and2(h2(f)))).
% 670 [hyper:589,620] connection(in2(h2(f)),in2(and2(h2(f)))).
% 671 [hyper:590,620] connection(outs(h2(f)),out1(and1(h2(f)))).
% 672 [hyper:591,620] connection(outc(h2(f)),out1(and2(h2(f)))).
% 674 [hyper:593,620] connection(out1(and2(h2(f))),in1(not1(h2(f)))).
% 675 [hyper:594,620] connection(out1(not1(h2(f))),in2(and1(h2(f)))).
% 676 [hyper:575,621] or_ok(or1(f)) | abnormal(or1(f)).
% 688 [hyper:567,650,cut:618] and_ok(and1(h1(f))).
% 689 [hyper:567,651,cut:617] and_ok(and2(h1(f))).
% 690 [hyper:581,652,cut:616] not_ok(not1(h1(f))).
% 692 [hyper:575,653,cut:615] or_ok(or1(h1(f))).
% 693 [hyper:567,663] abnormal(and1(h2(f))) | and_ok(and1(h2(f))).
% 694 [hyper:567,664,cut:613] and_ok(and2(h2(f))).
% 695 [hyper:581,665] not_ok(not1(h2(f))) | abnormal(not1(h2(f))).
% 735 [hyper:556,625,cut:607] one(in1(h2(f))).
% 756 [hyper:555,626,cut:608] zero(in1(h1(f))).
% 773 [hyper:556,627,cut:609] one(in2(h1(f))).
% 787 [hyper:556,628,cut:610] one(outs(h2(f))).
% 797 [hyper:555,629,cut:611] zero(out1(or1(f))).
% 821 [hyper:572,676,cut:797] zero(in1(or1(f))) | abnormal(or1(f)).
% 858 [hyper:557,821,624] zero(outc(h2(f))) | abnormal(or1(f)).
% 976 [hyper:556,655,cut:773] one(in2(or1(h1(f)))).
% 984 [hyper:569,976,cut:692] one(out1(or1(h1(f)))).
% 1004 [hyper:555,656,cut:756] zero(in1(and2(h1(f)))).
% 1012 [hyper:560,1004,cut:689] zero(out1(and2(h1(f)))).
% 1098 [hyper:556,669,cut:735] one(in1(and2(h2(f)))).
% 1124 [hyper:556,671,cut:787] one(out1(and1(h2(f)))).
% 1144 [hyper:614,693,676] and_ok(and1(h2(f))) | or_ok(or1(f)).
% 1166 [hyper:565,1144,cut:1124] one(in2(and1(h2(f)))) | or_ok(or1(f)).
% 1181 [hyper:555,672,858] zero(out1(and2(h2(f)))) | abnormal(or1(f)).
% 1294 [hyper:556,660,cut:984] one(in1(and1(h1(f)))).
% 1310 [hyper:555,661,cut:1012] zero(in1(not1(h1(f)))).
% 1320 [hyper:576,1310,cut:690] one(out1(not1(h1(f)))).
% 1398 [hyper:556,662,cut:1320] one(in2(and1(h1(f)))).
% 1405 [hyper:562,1398,cut:1294,cut:688] one(out1(and1(h1(f)))).
% 1411 [hyper:558,1405,658] one(outs(h1(f))).
% 1428 [hyper:556,1411,622] one(in2(h2(f))).
% 1436 [hyper:556,1428,670] one(in2(and2(h2(f)))).
% 1468 [hyper:562,1436,cut:1098,cut:694] one(out1(and2(h2(f)))).
% 1473 [hyper:556,1468,674] one(in1(not1(h2(f)))).
% 1477 [hyper:559,1468,1181] abnormal(or1(f)).
% 1484 [hyper:612,1477,695] not_ok(not1(h2(f))).
% 1490 [hyper:574,1477,1166] one(in2(and1(h2(f)))).
% 1506 [hyper:558,675,cut:1490] one(out1(not1(h2(f)))).
% 1509 [hyper:577,1484,cut:1473] zero(out1(not1(h2(f)))).
% 1515 [hyper:559,1506,cut:1509] 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 7
% clause depth limited to 4
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 263
% derived clauses: 2131
% kept clauses: 157
% kept size sum: 958
% kept mid-nuclei: 1025
% kept new demods: 0
% forw unit-subs: 368
% forw double-subs: 200
% forw overdouble-subs: 1
% backward subs: 13
% fast unit cutoff: 94
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.7
% process. runtime: 0.4
% specific non-discr-tree subsumption statistics:
% tried: 212
% length fails: 0
% strength fails: 4
% predlist fails: 207
% 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/HWV006-2+noeq.in")
%
%------------------------------------------------------------------------------