%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP455-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 : 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 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/GRP455-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 8 1)
% (binary-posweight-lex-big-order 30 #f 8 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(6,40,1,12,0,1)
% 
% 
% START OF PROOF
% 8 [] equal(divide(divide(identity,divide(X,divide(Y,divide(divide(divide(X,X),X),Z)))),Z),Y).
% 9 [] equal(multiply(X,Y),divide(X,divide(identity,Y))).
% 10 [] equal(inverse(X),divide(identity,X)).
% 11 [] equal(identity,divide(X,X)).
% 12 [] -equal(multiply(identity,a2),a2).
% 13 [para:10.1.2,11.1.2] equal(identity,inverse(identity)).
% 14 [para:11.1.2,8.1.1.1.2.2,demod:11,10] equal(divide(inverse(divide(X,identity)),Y),divide(inverse(X),Y)).
% 15 [para:11.1.2,8.1.1.1.2.2.2,demod:11,10] equal(divide(inverse(divide(X,divide(Y,identity))),inverse(X)),Y).
% 16 [para:11.1.2,8.1.1.1.2.2.2.1.1,demod:10] equal(divide(inverse(divide(X,divide(Y,divide(inverse(X),Z)))),Z),Y).
% 22 [para:9.1.2,10.1.2,demod:10] equal(inverse(inverse(X)),multiply(identity,X)).
% 33 [para:14.1.1,8.1.1.1.2.2,demod:16,10,11] equal(inverse(X),inverse(divide(X,identity))).
% 47 [para:11.1.2,15.1.1.1.1,demod:22,10,33,13,slowcut:12] 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 8
% seconds given: 60
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    18
%  derived clauses:   126
%  kept clauses:      33
%  kept size sum:     340
%  kept mid-nuclei:   0
%  kept new demods:   37
%  forw unit-subs:    92
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.1
% 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/GRP455-1+eq_r.in")
% 
%------------------------------------------------------------------------------