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

% Computer : art07.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 20.0s
% Output   : Assurance 20.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/HEN/HEN003-5+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 4 5)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 4 5)
% (binary-posweight-lex-big-order 30 #f 4 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)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(7,40,1,14,0,1,42,50,1,49,0,1,126,50,5,133,0,5,773,50,959,780,0,959,4085,4,2460)
% 
% 
% START OF PROOF
% 774 [] equal(X,X).
% 775 [] equal(divide(divide(X,Y),X),zero).
% 776 [] equal(divide(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Z),Y)),zero).
% 777 [] equal(divide(zero,X),zero).
% 778 [] -equal(divide(Y,X),zero) | -equal(divide(X,Y),zero) | equal(X,Y).
% 780 [] -equal(divide(a,a),zero).
% 792 [para:775.1.1,776.1.1.2] equal(divide(divide(divide(X,X),divide(Y,X)),zero),zero).
% 797 [hyper:778,792,demod:777,cut:774] equal(zero,divide(divide(X,X),divide(Y,X))).
% 800 [para:777.1.1,797.1.2.2] equal(zero,divide(divide(X,X),zero)).
% 4092 [binary:778.3,780,demod:777,800,cut:774] 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 5
% clause depth limited to 7
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1169
%  derived clauses:   1511142
%  kept clauses:      3652
%  kept size sum:     77738
%  kept mid-nuclei:   400
%  kept new demods:   3662
%  forw unit-subs:    1276456
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     97
%  fast unit cutoff:  189
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  24.71
%  process. runtime:  24.68
% 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/HEN/HEN003-5+eq_r.in")
% 
%------------------------------------------------------------------------------