TSTP Solution File: BOO075-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO075-1 : TPTP v3.4.2. Released v2.6.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/BOO/BOO075-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: ueq
%
% strategies selected:
% (binary-posweight-kb-big-order 60 #f 5 1)
% (binary-posweight-lex-big-order 30 #f 5 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,0,6,0,0,6,50,0,9,0,0,11,50,0,14,0,0)
%
%
% START OF PROOF
% 13 [] equal(nand(nand(X,nand(nand(Y,X),X)),nand(Y,nand(Z,X))),Y).
% 14 [] -equal(nand(nand(a,a),nand(b,a)),a).
% 15 [para:13.1.1,13.1.1.1.2.1] equal(nand(nand(nand(X,nand(Y,Z)),nand(X,nand(X,nand(Y,Z)))),nand(nand(Z,nand(nand(X,Z),Z)),nand(U,nand(X,nand(Y,Z))))),nand(Z,nand(nand(X,Z),Z))).
% 16 [para:13.1.1,13.1.1.2.2] equal(nand(nand(nand(X,nand(Y,Z)),nand(nand(U,nand(X,nand(Y,Z))),nand(X,nand(Y,Z)))),nand(U,X)),U).
% 17 [para:16.1.1,13.1.1.2.2] equal(nand(nand(nand(X,Y),nand(nand(Z,nand(X,Y)),nand(X,Y))),nand(Z,X)),Z).
% 18 [para:13.1.1,16.1.1.1.1,demod:13] equal(nand(nand(X,nand(nand(Y,X),X)),nand(Y,nand(Z,nand(nand(X,Z),Z)))),Y).
% 19 [para:13.1.1,16.1.1.1.2.1] equal(nand(nand(nand(X,nand(Y,Z)),nand(X,nand(X,nand(Y,Z)))),nand(nand(Z,nand(nand(X,Z),Z)),X)),nand(Z,nand(nand(X,Z),Z))).
% 20 [para:17.1.1,13.1.1.1.2.1] equal(nand(nand(nand(X,Y),nand(X,nand(X,Y))),nand(nand(nand(Y,Z),nand(nand(X,nand(Y,Z)),nand(Y,Z))),nand(U,nand(X,Y)))),nand(nand(Y,Z),nand(nand(X,nand(Y,Z)),nand(Y,Z)))).
% 21 [para:17.1.1,17.1.1.1.2.1] equal(nand(nand(nand(X,Y),nand(X,nand(X,Y))),nand(nand(nand(Y,Z),nand(nand(X,nand(Y,Z)),nand(Y,Z))),X)),nand(nand(Y,Z),nand(nand(X,nand(Y,Z)),nand(Y,Z)))).
% 24 [para:18.1.1,15.1.1.2,demod:18] equal(nand(X,X),nand(X,nand(nand(X,X),X))).
% 25 [para:24.1.2,13.1.1.1] equal(nand(nand(X,X),nand(X,nand(Y,X))),X).
% 27 [para:24.1.2,13.1.1.2,demod:24] equal(nand(nand(X,X),nand(X,X)),X).
% 32 [para:24.1.2,15.1.1.1.1,demod:25,24] equal(nand(X,nand(nand(X,X),nand(Y,nand(X,X)))),nand(X,X)).
% 42 [para:27.1.1,18.1.1.1.2.1,demod:25] equal(nand(X,nand(nand(X,X),nand(Y,nand(nand(nand(X,X),Y),Y)))),nand(X,X)).
% 47 [para:25.1.1,18.1.1.2] equal(nand(nand(X,nand(nand(nand(Y,Y),X),X)),Y),nand(Y,Y)).
% 51 [para:32.1.1,18.1.1.2] equal(nand(nand(X,nand(nand(Y,X),X)),nand(Y,Y)),Y).
% 55 [para:51.1.1,17.1.1.1.2.1,demod:25] equal(nand(X,nand(nand(Y,nand(nand(X,Y),Y)),X)),nand(Y,nand(nand(X,Y),Y))).
% 79 [para:55.1.1,13.1.1.2,demod:24] equal(nand(nand(X,X),nand(Y,nand(nand(X,Y),Y))),X).
% 87 [para:51.1.1,55.1.1.2.1.2.1,demod:51,25] equal(nand(nand(X,nand(nand(Y,X),X)),nand(Y,nand(X,nand(nand(Y,X),X)))),Y).
% 91 [para:79.1.1,16.1.1.1.2.1,demod:87] equal(nand(X,nand(nand(X,X),Y)),nand(X,X)).
% 100 [para:13.1.1,91.1.1.2.1,demod:27,91] equal(nand(nand(X,X),nand(X,Y)),X).
% 105 [para:91.1.1,47.1.1.1.2.1,demod:100] equal(nand(nand(nand(X,Y),nand(X,nand(X,Y))),X),nand(X,X)).
% 121 [para:21.1.1,13.1.1.2,demod:79,91,105] equal(X,nand(nand(X,Y),nand(X,nand(X,Y)))).
% 125 [para:121.1.2,16.1.1.1.2.1,demod:121] equal(nand(X,nand(nand(X,Y),X)),nand(X,Y)).
% 130 [para:121.1.2,20.1.1.2.1.2.1,demod:121] equal(nand(nand(X,Y),nand(X,nand(Z,nand(nand(X,Y),X)))),X).
% 134 [para:125.1.1,51.1.1.1.2.1,demod:121] equal(nand(nand(X,Y),nand(X,X)),X).
% 135 [para:125.1.1,47.1.1.1.2.1,demod:121] equal(nand(nand(nand(X,X),Y),X),nand(X,X)).
% 147 [para:134.1.1,19.1.1.2,demod:135,121] equal(nand(nand(X,X),X),nand(X,nand(X,X))).
% 149 [para:134.1.1,42.1.1.2.2.2.1,demod:147,121] equal(nand(X,nand(X,nand(X,X))),nand(X,X)).
% 190 [para:130.1.1,15.1.1.2,demod:121] equal(nand(X,Y),nand(Y,nand(nand(X,Y),Y))).
% 205 [para:190.1.2,13.1.1.2,demod:149,147,slowcut:14] 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 7
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 48
% derived clauses: 3501
% kept clauses: 191
% kept size sum: 5135
% kept mid-nuclei: 0
% kept new demods: 194
% forw unit-subs: 2394
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 8
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.10
% process. runtime: 0.9
% 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/BOO/BOO075-1+eq_r.in")
%
%------------------------------------------------------------------------------