%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWC001-1 : TPTP v3.4.2. Bugfixed v1.1.1.
% 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/HWC/HWC001-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (binary-unit-uniteq 30 #f)
% (binary-posweight-order 120 #f 3 5)
% (binary-posweight-order 240 #f)
% (binary-posweight-lex-big-order 60 #f)
% (binary-posweight-lex-small-order 12 #f)
% (binary-weightorder 24 #f)
% (hyper 30 #f)
% (binary 24 #t)
% (binary-order 30 #f)
% (binary-unit 30 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(10,40,0,20,0,0)
%
%
% START OF PROOF
% 12 [] equal(nand(X,Y),not(and(X,Y))).
% 13 [] equal(and(X,n0),n0).
% 14 [] equal(and(X,n1),X).
% 15 [] equal(not(n0),n1).
% 16 [] equal(not(n1),n0).
% 17 [] output(nand(X,Y),nand(Z,U),nand(V,W),nand(X1,X2)) | -output(Y,U,W,X2) | -output(X,Z,V,X1).
% 18 [] output(n0,n0,n1,n1).
% 19 [] output(n0,n1,n0,n1).
% 20 [] -output(n0,n1,n1,n1).
% 21 [input:17,factor] output(nand(X,X),nand(Y,Y),nand(Z,Z),nand(U,U)) | -output(X,Y,Z,U).
% 23 [binary:17.2,18] output(nand(X,n0),nand(Y,n0),nand(Z,n1),nand(U,n1)) | -output(X,Y,Z,U).
% 27 [para:14.1.1,12.1.2.1] equal(nand(X,n1),not(X)).
% 28 [para:13.1.1,12.1.2.1,demod:15] equal(nand(X,n0),n1).
% 30 [binary:18,23.2,demod:16,27,28] output(n1,n1,n0,n0).
% 33 [binary:19,21.2,demod:16,27,28] output(n1,n0,n1,n0).
% 34 [binary:17.2,30,demod:28,27] output(not(X),not(Y),n1,n1) | -output(X,Y,Z,U).
% 67 [binary:33,34.2,demod:15,16,cut:20] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 31
% derived clauses: 152
% kept clauses: 36
% kept size sum: 441
% kept mid-nuclei: 0
% kept new demods: 7
% forw unit-subs: 105
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 1
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 1
% full subs fail: 1
%
% ; 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/HWC/HWC001-1+eq_r.in")
%
%------------------------------------------------------------------------------