TSTP Solution File: GRP107-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP107-1 : 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 : art06.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/GRP/GRP107-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 7 7)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 7 7)
% (binary-posweight-lex-big-order 30 #f 7 7)
% (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(multiply(inverse(a1),a1),multiply(inverse(b1),b1)) | -equal(multiply(multiply(inverse(b2),b2),a2),a2) | -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))) | -equal(multiply(a4,b4),multiply(b4,a4)).
% was split for some strategies as: 
% -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% -equal(multiply(multiply(inverse(b2),b2),a2),a2).
% -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% -equal(multiply(a4,b4),multiply(b4,a4)).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(4,40,0,8,0,0,1774,4,752)
% 
% 
% START OF PROOF
% 5 [] equal(X,X).
% 6 [] equal(double_divide(double_divide(X,Y),inverse(double_divide(X,inverse(double_divide(inverse(Z),Y))))),Z).
% 7 [] equal(multiply(X,Y),inverse(double_divide(Y,X))).
% 8 [] -equal(multiply(multiply(inverse(b2),b2),a2),a2) | -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))) | -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)) | -equal(multiply(a4,b4),multiply(b4,a4)).
% 9 [para:6.1.1,7.1.2.1,demod:7] equal(multiply(multiply(multiply(X,inverse(Y)),Z),double_divide(Z,X)),inverse(Y)).
% 10 [para:7.1.2,6.1.1.2,demod:7] equal(double_divide(double_divide(X,Y),multiply(multiply(Y,inverse(Z)),X)),Z).
% 11 [para:7.1.2,6.1.1.2.1.2.1.1,demod:7] equal(double_divide(double_divide(X,Y),multiply(multiply(Y,multiply(Z,U)),X)),double_divide(U,Z)).
% 12 [para:6.1.1,6.1.1.1,demod:7] equal(double_divide(X,multiply(multiply(multiply(multiply(Y,inverse(X)),Z),inverse(U)),double_divide(Z,Y))),U).
% 13 [para:6.1.1,6.1.1.2.1,demod:7] equal(double_divide(double_divide(double_divide(inverse(X),Y),multiply(Y,inverse(Z))),inverse(Z)),X).
% 14 [para:7.1.2,9.1.1.1.1.2,demod:7] equal(multiply(multiply(multiply(X,multiply(Y,Z)),U),double_divide(U,X)),multiply(Y,Z)).
% 15 [para:6.1.1,9.1.1.2,demod:7] equal(multiply(multiply(multiply(multiply(multiply(X,inverse(Y)),Z),inverse(U)),double_divide(Z,X)),Y),inverse(U)).
% 19 [para:7.1.2,13.1.1.1.2.2,demod:7] equal(double_divide(double_divide(double_divide(inverse(X),Y),multiply(Y,multiply(Z,U))),multiply(Z,U)),X).
% 33 [para:11.1.1,14.1.1.2] equal(multiply(multiply(multiply(multiply(multiply(X,multiply(Y,Z)),U),multiply(V,W)),double_divide(U,X)),double_divide(Z,Y)),multiply(V,W)).
% 37 [para:19.1.1,11.1.1.1] equal(double_divide(X,multiply(multiply(multiply(Y,Z),multiply(U,V)),double_divide(double_divide(inverse(X),W),multiply(W,multiply(Y,Z))))),double_divide(V,U)).
% 38 [para:19.1.1,14.1.1.2] equal(multiply(multiply(multiply(multiply(X,Y),multiply(Z,U)),double_divide(double_divide(inverse(V),W),multiply(W,multiply(X,Y)))),V),multiply(Z,U)).
% 47 [para:15.1.1,12.1.1.2.1,demod:10] equal(double_divide(X,multiply(inverse(X),inverse(Y))),Y).
% 48 [para:15.1.1,15.1.1.1.1,demod:10] equal(multiply(multiply(inverse(X),inverse(Y)),X),inverse(Y)).
% 49 [para:7.1.2,47.1.1.2.1] equal(double_divide(double_divide(X,Y),multiply(multiply(Y,X),inverse(Z))),Z).
% 50 [para:7.1.2,47.1.1.2.2] equal(double_divide(X,multiply(inverse(X),multiply(Y,Z))),double_divide(Z,Y)).
% 64 [para:48.1.1,10.1.1.2] equal(double_divide(double_divide(X,inverse(X)),inverse(Y)),Y).
% 65 [para:48.1.1,9.1.1.1] equal(multiply(inverse(X),double_divide(Y,inverse(Y))),inverse(X)).
% 80 [para:7.1.2,64.1.1.2] equal(double_divide(double_divide(X,inverse(X)),multiply(Y,Z)),double_divide(Z,Y)).
% 93 [para:48.1.1,49.1.1.2] equal(double_divide(double_divide(inverse(X),inverse(inverse(Y))),inverse(X)),Y).
% 138 [para:80.1.1,47.1.1,demod:7] equal(double_divide(inverse(X),multiply(inverse(Y),Y)),X).
% 143 [para:138.1.1,6.1.1.1,demod:7,138] equal(double_divide(X,multiply(inverse(Y),inverse(X))),Y).
% 169 [para:143.1.1,80.1.1,demod:7] equal(X,double_divide(multiply(inverse(Y),Y),inverse(X))).
% 170 [para:143.1.1,138.1.1] equal(inverse(inverse(X)),X).
% 172 [para:7.1.2,170.1.1.1] equal(inverse(multiply(X,Y)),double_divide(Y,X)).
% 174 [para:170.1.1,9.1.1.1.1.2,demod:170] equal(multiply(multiply(multiply(X,Y),Z),double_divide(Z,X)),Y).
% 184 [para:170.1.1,47.1.1.2.1] equal(double_divide(inverse(X),multiply(X,inverse(Y))),Y).
% 190 [para:170.1.1,48.1.1.1.2,demod:170] equal(multiply(multiply(inverse(X),Y),X),Y).
% 193 [para:170.1.1,65.1.1.1,demod:170] equal(multiply(X,double_divide(Y,inverse(Y))),X).
% 196 [para:170.1.1,93.1.1.1.1,demod:170] equal(double_divide(double_divide(X,Y),X),Y).
% 207 [para:170.1.1,143.1.1.2.1] equal(double_divide(X,multiply(Y,inverse(X))),inverse(Y)).
% 209 [para:196.1.1,7.1.2.1] equal(multiply(X,double_divide(X,Y)),inverse(Y)).
% 212 [para:6.1.1,196.1.1.1,demod:7] equal(double_divide(X,double_divide(Y,Z)),multiply(multiply(Z,inverse(X)),Y)).
% 213 [para:196.1.1,10.1.1.1,demod:196,212] equal(double_divide(X,double_divide(Y,X)),Y).
% 215 [para:11.1.1,196.1.1.1] equal(double_divide(double_divide(X,Y),double_divide(Z,U)),multiply(multiply(U,multiply(Y,X)),Z)).
% 216 [para:47.1.1,196.1.1.1] equal(double_divide(X,Y),multiply(inverse(Y),inverse(X))).
% 222 [para:143.1.1,196.1.1.1,demod:216] equal(double_divide(X,Y),double_divide(Y,X)).
% 223 [para:213.1.1,7.1.2.1] equal(multiply(double_divide(X,Y),Y),inverse(X)).
% 229 [para:143.1.1,213.1.1.2,demod:216] equal(double_divide(double_divide(X,Y),Y),X).
% 230 [para:222.1.1,7.1.2.1,demod:7] equal(multiply(X,Y),multiply(Y,X)).
% 237 [para:222.1.1,196.1.1] equal(double_divide(X,double_divide(X,Y)),Y).
% 241 [para:229.1.1,7.1.2.1] equal(multiply(X,double_divide(Y,X)),inverse(Y)).
% 256 [para:237.1.1,7.1.2.1] equal(multiply(double_divide(X,Y),X),inverse(Y)).
% 279 [para:7.1.2,190.1.1.1.1] equal(multiply(multiply(multiply(X,Y),Z),double_divide(Y,X)),Z).
% 280 [para:190.1.1,10.1.1.2.1,demod:170] equal(double_divide(double_divide(X,multiply(Y,Z)),multiply(Z,X)),Y).
% 283 [para:190.1.1,230.1.1] equal(X,multiply(Y,multiply(inverse(Y),X))).
% 285 [para:172.1.1,190.1.1.1.1] equal(multiply(multiply(double_divide(X,Y),Z),multiply(Y,X)),Z).
% 290 [para:170.1.1,193.1.1.2.2] equal(multiply(X,double_divide(inverse(Y),Y)),X).
% 294 [para:193.1.1,190.1.1,demod:7] equal(multiply(multiply(inverse(X),X),Y),Y).
% 301 [para:209.1.1,190.1.1.1] equal(multiply(inverse(X),Y),double_divide(inverse(Y),X)).
% 309 [para:64.1.1,241.1.1.2,demod:7,301] equal(double_divide(inverse(X),X),double_divide(inverse(Y),Y)).
% 310 [para:93.1.1,241.1.1.2,demod:7,170,301] equal(double_divide(inverse(X),Y),multiply(X,inverse(Y))).
% 341 [para:6.1.1,256.1.1.1,demod:172,310,7] equal(multiply(X,double_divide(Y,Z)),double_divide(Y,double_divide(inverse(Z),X))).
% 342 [para:256.1.1,10.1.1.2.1,demod:301,341] equal(multiply(X,double_divide(multiply(X,double_divide(Y,Z)),Y)),Z).
% 385 [para:169.1.2,12.1.1.2.2,demod:7,310,290,301,216] equal(double_divide(X,multiply(double_divide(multiply(Y,X),Z),Y)),Z).
% 389 [para:170.1.1,184.1.1.2.2] equal(double_divide(inverse(X),multiply(X,Y)),inverse(Y)).
% 401 [para:170.1.1,207.1.1.2.2] equal(double_divide(inverse(X),multiply(Y,X)),inverse(Y)).
% 423 [para:7.1.2,301.1.1.1] equal(multiply(multiply(X,Y),Z),double_divide(inverse(Z),double_divide(Y,X))).
% 425 [para:172.1.1,301.1.1.1] equal(multiply(double_divide(X,Y),Z),double_divide(inverse(Z),multiply(Y,X))).
% 458 [para:389.1.1,213.1.1.2] equal(double_divide(multiply(X,Y),inverse(Y)),inverse(X)).
% 459 [para:389.1.1,222.1.1] equal(inverse(X),double_divide(multiply(Y,X),inverse(Y))).
% 467 [para:33.1.1,401.1.1.2,demod:213,215,7] equal(double_divide(multiply(X,Y),multiply(Z,U)),multiply(double_divide(Y,X),double_divide(U,Z))).
% 483 [para:172.1.1,458.1.1.2] equal(double_divide(multiply(X,multiply(Y,Z)),double_divide(Z,Y)),inverse(X)).
% 528 [para:174.1.1,230.1.1] equal(X,multiply(double_divide(Y,Z),multiply(multiply(Z,X),Y))).
% 537 [para:283.1.2,174.1.1.1.1,demod:301] equal(multiply(multiply(X,Y),double_divide(Y,Z)),double_divide(inverse(X),Z)).
% 542 [para:174.1.1,389.1.1.2,demod:7,172] equal(double_divide(double_divide(X,multiply(Y,Z)),Z),multiply(Y,X)).
% 544 [para:174.1.1,401.1.1.2,demod:172,7] equal(double_divide(multiply(X,Y),Z),double_divide(Y,multiply(X,Z))).
% 548 [para:174.1.1,459.1.2.1,demod:172,7] equal(multiply(X,Y),double_divide(Z,double_divide(Y,multiply(X,Z)))).
% 550 [para:174.1.1,174.1.1.1.1,demod:425,537] equal(multiply(double_divide(X,multiply(Y,Z)),Z),double_divide(X,Y)).
% 571 [para:174.1.1,279.1.1.1] equal(multiply(X,double_divide(Y,multiply(Z,X))),double_divide(Y,Z)).
% 588 [para:38.1.1,174.1.1.1,demod:571] equal(double_divide(X,multiply(Y,Z)),double_divide(double_divide(inverse(X),U),multiply(U,multiply(Y,Z)))).
% 601 [para:280.1.1,223.1.1.1,demod:7] equal(multiply(X,multiply(Y,Z)),multiply(multiply(X,Y),Z)).
% 602 [para:280.1.1,241.1.1.2,demod:7,601] equal(multiply(X,multiply(Y,Z)),multiply(Z,multiply(X,Y))).
% 607 [para:37.1.1,280.1.1.1,demod:601,172,256,588] equal(double_divide(double_divide(X,Y),double_divide(Z,U)),multiply(U,multiply(Z,multiply(Y,X)))).
% 658 [para:342.1.1,285.1.1.1,demod:544,467] equal(multiply(X,multiply(Y,Z)),double_divide(double_divide(Z,multiply(Y,multiply(X,U))),U)).
% 674 [para:50.1.1,385.1.1.2.1,demod:172] equal(double_divide(X,multiply(double_divide(Y,Z),U)),multiply(double_divide(X,U),multiply(Z,Y))).
% 938 [para:223.1.1,548.1.2.2.2] equal(multiply(double_divide(X,Y),Z),double_divide(Y,double_divide(Z,inverse(X)))).
% 973 [para:550.1.1,542.1.1.1.2] equal(double_divide(double_divide(X,double_divide(Y,Z)),U),multiply(double_divide(Y,multiply(Z,U)),X)).
% 1124 [para:37.1.1,571.1.1.2,demod:607,601,973,588] equal(double_divide(double_divide(double_divide(X,Y),double_divide(Z,U)),V),double_divide(Z,double_divide(double_divide(X,Y),double_divide(V,U)))).
% 1278 [para:602.1.1,483.1.1.1.2,demod:1124,544,607] equal(double_divide(X,double_divide(double_divide(Y,Z),double_divide(double_divide(X,multiply(Y,Z)),U))),inverse(U)).
% 1423 [para:423.1.2,467.1.2.1,demod:215,601,544,7,310] equal(double_divide(double_divide(X,multiply(Y,Z)),multiply(U,V)),double_divide(double_divide(Z,X),double_divide(double_divide(V,U),Y))).
% 1571 [para:528.1.2,658.1.2.1.2.2,demod:544,1423,601,674] equal(double_divide(X,multiply(double_divide(Y,Z),U)),double_divide(double_divide(V,Y),double_divide(double_divide(X,multiply(V,U)),Z))).
% 1775 [input:8,cut:294,cut:230] -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))) | -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% 1776 [para:1278.1.2,1775.2.1.1,demod:601,301,223,938,256,1571,cut:309,cut:5] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos 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 7
% seconds given: 10
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    461
%  derived clauses:   231027
%  kept clauses:      1761
%  kept size sum:     30380
%  kept mid-nuclei:   4
%  kept new demods:   1153
%  forw unit-subs:    228956
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     42
%  fast unit cutoff:  4
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  7.55
%  process. runtime:  7.53
% specific non-discr-tree subsumption statistics: 
%  tried:           2
%  length fails:    0
%  strength fails:  2
%  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/GRP/GRP107-1+eq_r.in")
% 
%------------------------------------------------------------------------------