TSTP Solution File: GRP002-2 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP002-2 : TPTP v3.4.2. Bugfixed v1.2.1.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art01.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/GRP002-2+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 3 1)
% (binary-posweight-lex-big-order 30 #f 3 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(13,40,0,26,0,0,302,50,7,315,0,7)
% 
% 
% START OF PROOF
% 303 [] equal(X,X).
% 304 [] equal(multiply(identity,X),X).
% 305 [] equal(multiply(inverse(X),X),identity).
% 306 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 307 [] equal(multiply(X,identity),X).
% 308 [] equal(multiply(X,inverse(X)),identity).
% 309 [] equal(multiply(X,multiply(X,X)),identity).
% 310 [] equal(multiply(a,b),c).
% 311 [] equal(multiply(c,inverse(a)),d).
% 312 [] equal(multiply(d,inverse(b)),h).
% 313 [] equal(multiply(h,b),j).
% 314 [] equal(multiply(j,inverse(h)),k).
% 315 [] -equal(multiply(k,inverse(b)),identity).
% 317 [para:310.1.1,306.1.1.1] equal(multiply(c,X),multiply(a,multiply(b,X))).
% 318 [para:313.1.1,306.1.1.1] equal(multiply(j,X),multiply(h,multiply(b,X))).
% 320 [para:305.1.1,306.1.1.1,demod:304] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 322 [para:311.1.1,306.1.1.1] equal(multiply(d,X),multiply(c,multiply(inverse(a),X))).
% 323 [para:312.1.1,306.1.1.1] equal(multiply(h,X),multiply(d,multiply(inverse(b),X))).
% 325 [para:310.1.1,320.1.2.2] equal(b,multiply(inverse(a),c)).
% 326 [para:313.1.1,320.1.2.2] equal(b,multiply(inverse(h),j)).
% 327 [para:309.1.1,320.1.2.2,demod:307] equal(multiply(X,X),inverse(X)).
% 328 [para:305.1.1,320.1.2.2,demod:307] equal(X,inverse(inverse(X))).
% 332 [para:306.1.1,320.1.2.2] equal(X,multiply(inverse(multiply(Y,Z)),multiply(Y,multiply(Z,X)))).
% 335 [para:327.1.2,314.1.1.2] equal(multiply(j,multiply(h,h)),k).
% 337 [para:327.1.1,306.1.1] equal(inverse(multiply(X,Y)),multiply(X,multiply(Y,multiply(X,Y)))).
% 338 [para:327.1.1,306.1.1.1] equal(multiply(inverse(X),Y),multiply(X,multiply(X,Y))).
% 339 [para:327.1.1,320.1.2.2] equal(X,multiply(inverse(X),inverse(X))).
% 342 [para:308.1.1,317.1.2.2,demod:307] equal(multiply(c,inverse(b)),a).
% 343 [para:317.1.2,320.1.2.2] equal(multiply(b,X),multiply(inverse(a),multiply(c,X))).
% 349 [para:342.1.1,320.1.2.2] equal(inverse(b),multiply(inverse(c),a)).
% 379 [para:325.1.2,322.1.2.2] equal(multiply(d,c),multiply(c,b)).
% 383 [para:309.1.1,323.1.2.2,demod:307,313,339] equal(j,d).
% 384 [para:320.1.2,323.1.2.2,demod:318] equal(multiply(j,X),multiply(d,X)).
% 387 [para:383.1.1,326.1.2.2] equal(b,multiply(inverse(h),d)).
% 389 [para:383.1.1,335.1.1.1] equal(multiply(d,multiply(h,h)),k).
% 395 [para:327.1.2,387.1.2.1,demod:306] equal(b,multiply(h,multiply(h,d))).
% 441 [para:379.1.1,306.1.1.1,demod:306] equal(multiply(c,multiply(b,X)),multiply(d,multiply(c,X))).
% 446 [para:311.1.1,338.1.2.2] equal(multiply(inverse(c),inverse(a)),multiply(c,d)).
% 466 [para:309.1.1,343.1.2.2,demod:307] equal(multiply(b,multiply(c,c)),inverse(a)).
% 467 [para:308.1.1,343.1.2.2,demod:307] equal(multiply(b,inverse(c)),inverse(a)).
% 478 [para:467.1.1,318.1.2.2,demod:384] equal(multiply(d,inverse(c)),multiply(h,inverse(a))).
% 480 [para:467.1.1,337.1.2.2.2,demod:446,328,467] equal(a,multiply(b,multiply(c,d))).
% 485 [para:480.1.2,332.1.2.2] equal(d,multiply(inverse(multiply(b,c)),a)).
% 576 [para:466.1.1,318.1.2.2,demod:478,441,384] equal(multiply(c,multiply(b,c)),multiply(d,inverse(c))).
% 580 [para:327.1.2,485.1.2.1,demod:312,349,576,306] equal(d,multiply(b,h)).
% 588 [para:580.1.2,318.1.2.2,demod:384] equal(multiply(d,h),multiply(h,d)).
% 595 [para:588.1.2,306.1.1.1,demod:306] equal(multiply(d,multiply(h,X)),multiply(h,multiply(d,X))).
% 598 [para:588.1.2,395.1.2.2,demod:389,595] equal(b,k).
% 601 [para:598.1.1,315.1.1.2.1,demod:308,cut:303] 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 4
% seconds given: 60
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    408
%  derived clauses:   6160
%  kept clauses:      561
%  kept size sum:     5223
%  kept mid-nuclei:   0
%  kept new demods:   566
%  forw unit-subs:    4437
%  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.13
%  process. runtime:  0.10
% 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/GRP/GRP002-2+eq_r.in")
% 
%------------------------------------------------------------------------------