TSTP Solution File: BOO020-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO020-1 : TPTP v3.4.2. Released v2.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art09.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 10.0s
% Output : Assurance 10.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/BOO020-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 5 5)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 5 5)
% (binary-posweight-lex-big-order 30 #f 5 5)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% SOS clause
% -equal(add(inverse(add(a,inverse(b))),inverse(add(inverse(a),inverse(b)))),b) | -equal(add(add(a,b),c),add(a,add(b,c))) | -equal(add(b,a),add(a,b)).
% was split for some strategies as:
% -equal(add(inverse(add(a,inverse(b))),inverse(add(inverse(a),inverse(b)))),b).
% -equal(add(add(a,b),c),add(a,add(b,c))).
% -equal(add(b,a),add(a,b)).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(5,40,1,10,0,1,262,4,765,271,50,765,271,40,765,276,0,765,5381,3,966,6148,4,1066,7786,5,1167,7788,5,1167,7788,1,1167,7788,50,1167,7788,40,1167,7793,0,1168,12553,3,1376,13747,4,1470,15024,5,1569,15024,1,1569,15024,50,1569,15024,40,1569,15029,0,1569)
%
%
% START OF PROOF
% 317 [?] ?
% 15025 [] equal(X,X).
% 15026 [] equal(add(X,X),X).
% 15027 [] -equal(add(add(add(X,Y),Z),U),add(add(Y,Z),X)) | equal(add(add(add(X,Y),Z),inverse(U)),n0).
% 15028 [] equal(add(add(add(X,Y),Z),U),add(add(Y,Z),X)) | -equal(add(add(add(X,Y),Z),inverse(U)),n0).
% 15029 [] -equal(add(inverse(add(a,inverse(b))),inverse(add(inverse(a),inverse(b)))),b) | -equal(add(add(a,b),c),add(a,add(b,c))) | -equal(add(b,a),add(a,b)).
% 15033 [para:15026.1.1,15027.1.1.1.1,demod:15026] -equal(add(add(X,Y),Z),add(add(X,Y),X)) | equal(add(add(X,Y),inverse(Z)),n0).
% 15036 [binary:15026,15027,demod:15026] equal(add(X,inverse(X)),n0).
% 15037 [para:15036.1.1,15027.1.1.1,demod:15036,cut:317] equal(add(n0,inverse(X)),n0).
% 15044 [binary:15025,15033] equal(add(add(X,Y),inverse(X)),n0).
% 15057 [para:15026.1.1,15028.2.1.1,demod:15026] equal(add(add(X,Y),Z),add(add(Y,add(X,Y)),X)) | -equal(add(add(X,Y),inverse(Z)),n0).
% 15059 [para:15036.1.1,15028.2.1,demod:15026,cut:15025] equal(add(add(X,Y),Z),add(add(Y,Z),X)).
% 15064 [para:15044.1.1,15028.2.1.1,demod:15044,15037,cut:15025] equal(add(n0,X),add(add(Y,inverse(Z)),Z)).
% 15066 [para:15064.1.1,15026.1.1] equal(add(add(X,inverse(Y)),Y),n0).
% 15076 [para:15064.1.2,15044.1.1] equal(add(n0,X),n0).
% 15081 [para:15064.1.2,15028.2.1.1.1,demod:15066,15037,15076,cut:15025] equal(n0,add(add(X,Y),add(Z,inverse(X)))).
% 15093 [para:15026.1.1,15066.1.1.1] equal(add(inverse(X),X),n0).
% 15101 [para:15026.1.1,15081.1.2.1] equal(n0,add(X,add(Y,inverse(X)))).
% 15110 [para:15101.1.2,15028.2.1.1.1,demod:15101,15037,15076,cut:15025] equal(n0,add(add(add(X,inverse(Y)),Z),Y)).
% 15115 [para:15026.1.1,15110.1.2.1.1] equal(n0,add(add(inverse(X),Y),X)).
% 15127 [para:15115.1.2,15028.2.1.1,demod:15076,15115,15037,cut:15025] equal(n0,add(add(X,Y),inverse(Y))).
% 15135 [para:15127.1.2,15028.2.1.1.1,demod:15127,15037,15076,cut:15025] equal(n0,add(add(inverse(X),Y),add(Z,X))).
% 15159 [para:15026.1.1,15135.1.2.1] equal(n0,add(inverse(X),add(Y,X))).
% 15162 [para:15135.1.2,15028.2.1.1,demod:15076,15135,15037,cut:15025] equal(n0,add(add(X,add(Y,Z)),inverse(Z))).
% 15167 [para:15159.1.2,15028.2.1.1.1,demod:15159,15037,15076,cut:15025] equal(n0,add(add(add(X,Y),Z),inverse(Y))).
% 15188 [para:15167.1.2,15028.2.1,cut:15025] equal(add(add(add(X,Y),Z),Y),add(add(Y,Z),X)).
% 15208 [para:15059.1.2,15026.1.1,demod:15188] equal(add(add(X,Y),Y),add(Y,X)).
% 15209 [para:15026.1.1,15059.1.1.1] equal(add(X,Y),add(add(X,Y),X)).
% 15210 [para:15026.1.1,15059.1.2,demod:15208,15209] equal(add(X,Y),add(Y,X)).
% 15220 [para:15059.1.1,15036.1.1] equal(add(add(X,inverse(add(Y,X))),Y),n0).
% 15286 [para:15210.1.1,15029.1.1,cut:15210] -equal(add(inverse(add(inverse(a),inverse(b))),inverse(add(a,inverse(b)))),b) | -equal(add(add(a,b),c),add(a,add(b,c))).
% 15306 [para:15210.1.1,15162.1.2] equal(n0,add(inverse(X),add(Y,add(Z,X)))).
% 15307 [para:15210.1.1,15059.1.1] equal(add(X,add(Y,Z)),add(add(Z,X),Y)).
% 15309 [para:15210.1.1,15059.1.2,demod:15307] equal(add(X,add(Y,Z)),add(Z,add(X,Y))).
% 15320 [para:15208.1.1,15044.1.1.1,demod:15307] equal(add(X,add(inverse(add(X,Y)),Y)),n0).
% 15332 [para:15208.1.1,15059.1.2.1,demod:15307] equal(add(X,add(Y,add(Z,X))),add(Z,add(Y,X))).
% 15333 [para:15059.1.2,15208.1.1.1,demod:15332,15307] equal(add(X,add(Y,Z)),add(Z,add(Y,X))).
% 15359 [para:15210.1.1,15286.1.1,demod:15307,cut:15309] -equal(add(inverse(add(a,inverse(b))),inverse(add(inverse(a),inverse(b)))),b).
% 15371 [para:15220.1.1,15210.1.1] equal(n0,add(X,add(Y,inverse(add(X,Y))))).
% 15385 [para:15210.1.1,15359.1.1.1.1] -equal(add(inverse(add(inverse(b),a)),inverse(add(inverse(a),inverse(b)))),b).
% 15508 [para:15026.1.1,15057.2.1.1,demod:15026] -equal(add(X,inverse(Y)),n0) | equal(add(X,Y),X).
% 15567 [para:15093.1.1,15508.1.1,cut:15025] equal(add(inverse(inverse(X)),X),inverse(inverse(X))).
% 15568 [para:15210.1.1,15508.1.1] -equal(add(inverse(X),Y),n0) | equal(add(Y,X),Y).
% 15582 [para:15567.1.1,15101.1.2.2] equal(n0,add(X,inverse(inverse(inverse(X))))).
% 15587 [para:15567.1.1,15210.1.1] equal(inverse(inverse(X)),add(X,inverse(inverse(X)))).
% 15590 [para:15567.1.1,15306.1.2.2] equal(n0,add(inverse(X),inverse(inverse(add(Y,X))))).
% 15613 [para:15582.1.2,15508.1.1,demod:15587,cut:15025] equal(inverse(inverse(X)),X).
% 15640 [para:15590.1.2,15508.1.1,cut:15025] equal(add(inverse(X),inverse(add(Y,X))),inverse(X)).
% 15645 [para:15640.1.1,15210.1.1] equal(inverse(X),add(inverse(add(Y,X)),inverse(X))).
% 15658 [para:15613.1.1,15640.1.1.1,demod:15613] equal(add(X,inverse(add(Y,inverse(X)))),X).
% 15662 [para:15210.1.1,15658.1.1.2.1] equal(add(X,inverse(add(inverse(X),Y))),X).
% 15671 [para:15662.1.1,15333.1.1.2] equal(add(X,Y),add(inverse(add(inverse(Y),Z)),add(Y,X))).
% 15722 [para:15320.1.1,15568.1.1,demod:15662,15307,cut:15025] equal(add(X,Y),add(inverse(add(inverse(Y),X)),X)).
% 15724 [para:15371.1.2,15568.1.1,demod:15671,15307,cut:15025] equal(add(X,Y),add(X,inverse(add(inverse(Y),X)))).
% 15736 [para:15613.1.1,15722.1.2.1.1.1] equal(add(X,inverse(Y)),add(inverse(add(Y,X)),X)).
% 15773 [para:15724.1.2,15736.1.2.1.1,demod:15645] equal(inverse(X),add(inverse(add(X,Y)),inverse(add(inverse(Y),X)))).
% 16040 [para:15773.1.2,15385.1.1,demod:15613,cut:15025] 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 5
% clause depth limited to 5
% seconds given: 20
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1493
% derived clauses: 659484
% kept clauses: 13671
% kept size sum: 266604
% kept mid-nuclei: 1640
% kept new demods: 6832
% forw unit-subs: 373002
% forw double-subs: 27499
% forw overdouble-subs: 0
% backward subs: 178
% fast unit cutoff: 212
% full unit cutoff: 11
% dbl unit cutoff: 1
% real runtime : 16.82
% process. runtime: 16.79
% 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/BOO020-1+eq_r.in")
%
%------------------------------------------------------------------------------