TSTP Solution File: HWC003-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWC003-2 : 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 : art02.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 40.0s
% Output : Assurance 40.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/HWC003-2+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 14 5)
% (binary-unit 28 #f 14 5)
% (binary-double 28 #f 14 5)
% (binary 45 #t 14 5)
% (hyper 11 #t 14 5)
% (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(26,40,1,52,0,1,106213,3,2856,211288,4,4278)
%
%
% START OF PROOF
% 32 [] equal(not(n0),n1).
% 33 [] equal(not(n1),n0).
% 34 [] equal(add_inverter(list(X,Y),Z),list(X,add_inverter(Y,Z))).
% 35 [] equal(add_inverter(X,Y),list(Y,X)).
% 46 [] test(not(X),not(Y),not(Z),not(U),not(V),not(W),not(X1),not(X2),add_inverter(X3,inverter_table(not(X),not(Y),not(Z),not(U),not(V),not(W),not(X1),not(X2))),end) | -output(X,Y,Z,U,V,W,X1,X2,X3).
% 47 [] -basic_output(X,Y,Z,U,V,W,X1,X2,X3) | output(X,Y,Z,U,V,W,X1,X2,X3).
% 48 [] -test(X,Y,Z,U,V,W,X1,X2,X3,X4) | basic_output(X,Y,Z,U,V,W,X1,X2,X3).
% 49 [] output(n0,n0,n0,n0,n1,n1,n1,n1,X).
% 50 [] output(n0,n0,n1,n1,n0,n0,n1,n1,X).
% 51 [] output(n0,n1,n0,n1,n0,n1,n0,n1,X).
% 52 [] -output(n1,n1,n0,n0,n1,n1,n0,n0,X) | -output(n1,n0,n1,n0,n1,n0,n1,n0,X) | -output(n1,n1,n1,n1,n0,n0,n0,n0,X).
% 55 [para:34.1.2,35.1.2,demod:35] equal(add_inverter(add_inverter(X,Y),Z),add_inverter(add_inverter(X,Z),Y)).
% 59 [para:55.1.1,34.1.2.2,demod:35] equal(add_inverter(add_inverter(add_inverter(X,Y),Z),U),add_inverter(add_inverter(add_inverter(X,U),Y),Z)).
% 174 [para:59.1.1,34.1.2.2,demod:35] equal(add_inverter(add_inverter(add_inverter(add_inverter(X,Y),Z),U),V),add_inverter(add_inverter(add_inverter(add_inverter(X,V),Y),Z),U)).
% 186 [para:59.1.1,59.1.2.1.1] equal(add_inverter(add_inverter(add_inverter(add_inverter(add_inverter(X,Y),Z),U),V),W),add_inverter(add_inverter(add_inverter(add_inverter(add_inverter(X,W),Y),Z),U),V)).
% 195 [binary:49,46.2,demod:33,32] test(n1,n1,n1,n1,n0,n0,n0,n0,add_inverter(X,inverter_table(n1,n1,n1,n1,n0,n0,n0,n0)),end).
% 196 [binary:50,46.2,demod:33,32] test(n1,n1,n0,n0,n1,n1,n0,n0,add_inverter(X,inverter_table(n1,n1,n0,n0,n1,n1,n0,n0)),end).
% 197 [binary:51,46.2,demod:33,32] test(n1,n0,n1,n0,n1,n0,n1,n0,add_inverter(X,inverter_table(n1,n0,n1,n0,n1,n0,n1,n0)),end).
% 841 [binary:48,195] basic_output(n1,n1,n1,n1,n0,n0,n0,n0,add_inverter(X,inverter_table(n1,n1,n1,n1,n0,n0,n0,n0))).
% 1469 [binary:47,841] output(n1,n1,n1,n1,n0,n0,n0,n0,add_inverter(X,inverter_table(n1,n1,n1,n1,n0,n0,n0,n0))).
% 1988 [para:55.1.1,1469.1.9] output(n1,n1,n1,n1,n0,n0,n0,n0,add_inverter(add_inverter(X,inverter_table(n1,n1,n1,n1,n0,n0,n0,n0)),Y)).
% 3851 [binary:48,196] basic_output(n1,n1,n0,n0,n1,n1,n0,n0,add_inverter(X,inverter_table(n1,n1,n0,n0,n1,n1,n0,n0))).
% 3886 [binary:47,3851] output(n1,n1,n0,n0,n1,n1,n0,n0,add_inverter(X,inverter_table(n1,n1,n0,n0,n1,n1,n0,n0))).
% 3922 [binary:52,3886] -output(n1,n0,n1,n0,n1,n0,n1,n0,add_inverter(X,inverter_table(n1,n1,n0,n0,n1,n1,n0,n0))) | -output(n1,n1,n1,n1,n0,n0,n0,n0,add_inverter(X,inverter_table(n1,n1,n0,n0,n1,n1,n0,n0))).
% 3974 [binary:48,197] basic_output(n1,n0,n1,n0,n1,n0,n1,n0,add_inverter(X,inverter_table(n1,n0,n1,n0,n1,n0,n1,n0))).
% 3987 [binary:47,3974] output(n1,n0,n1,n0,n1,n0,n1,n0,add_inverter(X,inverter_table(n1,n0,n1,n0,n1,n0,n1,n0))).
% 3997 [para:174.1.1,3987.1.9] output(n1,n0,n1,n0,n1,n0,n1,n0,add_inverter(add_inverter(add_inverter(add_inverter(X,inverter_table(n1,n0,n1,n0,n1,n0,n1,n0)),Y),Z),U)).
% 4038 [para:174.1.1,1988.1.9.1] output(n1,n1,n1,n1,n0,n0,n0,n0,add_inverter(add_inverter(add_inverter(add_inverter(add_inverter(X,inverter_table(n1,n1,n1,n1,n0,n0,n0,n0)),Y),Z),U),V)).
% 102058 [para:186.1.1,3997.1.9.1.1.1] output(n1,n0,n1,n0,n1,n0,n1,n0,add_inverter(add_inverter(add_inverter(add_inverter(add_inverter(add_inverter(add_inverter(add_inverter(X,inverter_table(n1,n0,n1,n0,n1,n0,n1,n0)),Y),Z),U),V),W),X1),X2)).
% 155576 [para:186.1.1,4038.1.9.1.1.1.1] output(n1,n1,n1,n1,n0,n0,n0,n0,add_inverter(add_inverter(add_inverter(add_inverter(add_inverter(add_inverter(add_inverter(add_inverter(add_inverter(X,inverter_table(n1,n1,n1,n1,n0,n0,n0,n0)),Y),Z),U),V),W),X1),X2),X3)).
% 211350 [binary:102058,3922,slowcut:155576] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% 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
% clause length limited to 5
% clause depth limited to 14
% seconds given: 57
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 663
% derived clauses: 1609262
% kept clauses: 48020
% kept size sum: 0
% kept mid-nuclei: 60
% kept new demods: 1076
% forw unit-subs: 1397259
% forw double-subs: 361
% forw overdouble-subs: 0
% backward subs: 7
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 43.0
% process. runtime: 43.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/HWC003-2+eq_r.in")
%
%------------------------------------------------------------------------------