%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : HEN012-3 : 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 : 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/HEN/HEN012-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: heq
% detected subclass: small
% detected subclass: short
% 
% strategies selected: 
% (binary-unit-uniteq 30 #f)
% (binary-posweight-order 120 #f 3 5)
% (binary-posweight-order 240 #f)
% (binary-posweight-lex-big-order 60 #f)
% (binary-posweight-lex-small-order 12 #f)
% (binary-weightorder 24 #f)
% (hyper 30 #f)
% (binary 24 #t)
% (binary-order 30 #f)
% (binary-unit 30 #f)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(9,40,0,18,0,0)
% 
% 
% START OF PROOF
% 11 [] equal(divide(X,Y),zero) | -less_equal(X,Y).
% 12 [] -equal(divide(X,Y),zero) | less_equal(X,Y).
% 13 [] less_equal(divide(X,Y),X).
% 14 [] less_equal(divide(divide(X,Y),divide(Z,Y)),divide(divide(X,Z),Y)).
% 15 [] less_equal(zero,X).
% 16 [] -less_equal(Y,X) | -less_equal(X,Y) | equal(X,Y).
% 18 [] -less_equal(a,a).
% 20 [binary:15,11.2] equal(divide(zero,X),zero).
% 22 [binary:13,11.2] equal(divide(divide(X,Y),X),zero).
% 24 [binary:18,12.2] -equal(divide(a,a),zero).
% 29 [para:22.1.1,14.1.2] less_equal(divide(divide(X,X),divide(Y,X)),zero).
% 38 [binary:24,16.3,cut:15] -less_equal(divide(a,a),zero).
% 41 [binary:12.2,38] -equal(divide(divide(a,a),zero),zero).
% 57 [binary:16.3,41,cut:15] -less_equal(divide(divide(a,a),zero),zero).
% 61 [para:20.1.1,29.1.1.2,slowcut:57] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    23
%  derived clauses:   117
%  kept clauses:      34
%  kept size sum:     422
%  kept mid-nuclei:   0
%  kept new demods:   12
%  forw unit-subs:    75
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  3
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.0
% 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/HEN012-3+eq_r.in")
% 
%------------------------------------------------------------------------------