%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP467-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/GRP/GRP467-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 6 1)
% (binary-posweight-lex-big-order 30 #f 6 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(4,40,1,8,0,1)
% 
% 
% START OF PROOF
% 6 [] equal(divide(divide(X,X),divide(Y,divide(divide(Z,divide(U,Y)),inverse(U)))),Z).
% 7 [] equal(multiply(X,Y),divide(X,inverse(Y))).
% 8 [] -equal(multiply(multiply(inverse(b2),b2),a2),a2).
% 11 [para:7.1.2,6.1.1.2.2.1.2,demod:7] equal(divide(divide(X,X),divide(inverse(Y),multiply(divide(Z,multiply(U,Y)),U))),Z).
% 12 [para:6.1.1,6.1.1.2.2.1,demod:7] equal(divide(divide(X,X),divide(multiply(divide(Y,divide(Z,U)),Z),multiply(Y,U))),divide(V,V)).
% 22 [para:12.1.1,12.1.1] equal(divide(X,X),divide(Y,Y)).
% 24 [para:22.1.1,7.1.2] equal(multiply(inverse(X),X),divide(Y,Y)).
% 26 [para:22.1.1,6.1.1.2.2.1,demod:7] equal(divide(divide(X,X),divide(Y,multiply(divide(Z,Z),U))),divide(U,Y)).
% 34 [para:24.1.1,8.1.1.1] -equal(multiply(divide(X,X),a2),a2).
% 62 [para:26.1.1,22.1.1] equal(divide(X,multiply(divide(Y,Y),X)),divide(Z,Z)).
% 93 [para:62.1.1,11.1.1.2.2.1,demod:7,26,slowcut:34] 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 6
% seconds given: 60
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    19
%  derived clauses:   485
%  kept clauses:      83
%  kept size sum:     1495
%  kept mid-nuclei:   0
%  kept new demods:   19
%  forw unit-subs:    248
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     2
%  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/GRP467-1+eq_r.in")
% 
%------------------------------------------------------------------------------