%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : HEN007-4 : 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 : art04.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/HEN007-4+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: heq
% detected subclass: medium
% detected subclass: short
% 
% strategies selected: 
% (binary-posweight-order 57 #f 3 5)
% (binary-unit 28 #f 3 5)
% (binary-double 28 #f 3 5)
% (binary 45 #t 3 5)
% (hyper 11 #t 3 5)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(16,40,1,32,0,1)
% 
% 
% START OF PROOF
% 17 [] equal(X,X).
% 19 [] -equal(divide(X,Y),zero) | less_equal(X,Y).
% 27 [] equal(divide(X,X),zero).
% 29 [] -less_equal(Y,Z) | -less_equal(X,Y) | less_equal(X,Z).
% 30 [] -less_equal(divide(X,Y),Z) | less_equal(divide(X,Z),Y).
% 31 [] less_equal(a,b).
% 32 [] -less_equal(divide(c,b),divide(c,a)).
% 38 [para:27.1.1,19.1.1,cut:17] less_equal(X,X).
% 59 [binary:31,29] -less_equal(X,a) | less_equal(X,b).
% 66 [binary:38,30] less_equal(divide(X,divide(X,Y)),Y).
% 79 [binary:59,66] less_equal(divide(X,divide(X,a)),b).
% 100 [binary:30,79,slowcut:32] 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 5
% clause depth limited to 3
% seconds given: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    39
%  derived clauses:   322
%  kept clauses:      54
%  kept size sum:     503
%  kept mid-nuclei:   0
%  kept new demods:   10
%  forw unit-subs:    237
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     3
%  fast unit cutoff:  4
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.0
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           1
%  length fails:    0
%  strength fails:  0
%  predlist fails:  1
%  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/HEN007-4+eq_r.in")
% 
%------------------------------------------------------------------------------