%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : HEN007-2 : 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 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-2+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: long
% 
% strategies selected: 
% (hyper 58 #f 2 11)
% (binary-posweight-order 29 #f 2 11)
% (binary-unit 29 #f 2 11)
% (binary-double 29 #f 2 11)
% (binary 29 #t 2 11)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(20,40,1,40,0,1)
% 
% 
% START OF PROOF
% 22 [] quotient(X,Y,zero) | -less_equal(X,Y).
% 24 [] -quotient(X,Y,Z) | less_equal(Z,X).
% 25 [] -quotient(Z,U,X2) | -quotient(V,W,X1) | -quotient(Y,U,W) | -quotient(X,U,V) | -quotient(X,Y,Z) | less_equal(X1,X2).
% 29 [] quotient(X,Y,divide(X,Y)).
% 34 [] quotient(X,zero,X).
% 35 [] -less_equal(X,Y) | -less_equal(Z,X) | less_equal(Z,Y).
% 37 [] less_equal(x,y).
% 38 [] quotient(z,y,z^qy).
% 39 [] quotient(z,x,z^qx).
% 40 [] -less_equal(z^qy,z^qx).
% 50 [hyper:22,37] quotient(x,y,zero).
% 754 [hyper:24,29] less_equal(divide(X,Y),X).
% 961 [hyper:25,29,34,38,39,cut:50] less_equal(z^qy,divide(z^qx,y)).
% 4248 [hyper:35,961,754,cut:40] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 11
% clause depth limited to 2
% seconds given: 58
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    40
%  derived clauses:   11678
%  kept clauses:      83
%  kept size sum:     489
%  kept mid-nuclei:   4075
%  kept new demods:   11
%  forw unit-subs:    5963
%  forw double-subs: 782
%  forw overdouble-subs: 0
%  backward subs:     1
%  fast unit cutoff:  43
%  full unit cutoff:  43
%  dbl  unit cutoff:  0
%  real runtime  :  0.16
%  process. runtime:  0.15
% specific non-discr-tree subsumption statistics: 
%  tried:           2576
%  length fails:    0
%  strength fails:  1202
%  predlist fails:  566
%  aux str. fails:  808
%  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-2+eq_r.in")
% 
%------------------------------------------------------------------------------