%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GEO030-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 : 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/GEO/GEO030-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 2 15)
% (binary-unit 9 #f 2 15)
% (binary-double 9 #f 2 15)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 15)
% (binary-order 25 #f 2 15)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(24,40,0,48,0,0)
% 
% 
% START OF PROOF
% 26 [] equidistant(X,Y,Y,X).
% 27 [] -equidistant(X,Y,V,W) | -equidistant(X,Y,Z,U) | equidistant(Z,U,V,W).
% 28 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 30 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 31 [] -equidistant(X,X1,Z,X2) | -equidistant(Y,X1,U,X2) | -equidistant(X,Y,Z,U) | -equidistant(Y,V,U,W) | equidistant(V,X1,W,X2) | -between(X,Y,V) | -between(Z,U,W) | equal(X,Y).
% 44 [] between(u,v,w).
% 45 [] equidistant(u,w,u,w1).
% 46 [] equidistant(v,w,v,w1).
% 47 [] -equal(u,v).
% 48 [] -equal(w,w1).
% 115 [hyper:27,26,26] equidistant(X,Y,X,Y).
% 1112 [hyper:28,30] equal(X,extension(Y,X,Z,Z)).
% 1678 [para:1112.1.2,30.1.2] equidistant(X,X,Y,Y).
% 8915 [hyper:31,115,44,115,46,cut:44,cut:45,cut:47] equidistant(w,w,w,w1).
% 8921 [hyper:27,8915,1678] equidistant(w,w1,X,X).
% 10094 [hyper:28,8921,cut:48] 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 15
% clause depth limited to 2
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    40
%  derived clauses:   23885
%  kept clauses:      129
%  kept size sum:     1263
%  kept mid-nuclei:   9910
%  kept new demods:   1
%  forw unit-subs:    9678
%  forw double-subs: 589
%  forw overdouble-subs: 21
%  backward subs:     1
%  fast unit cutoff:  2577
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.38
%  process. runtime:  0.38
% specific non-discr-tree subsumption statistics: 
%  tried:           940
%  length fails:    0
%  strength fails:  512
%  predlist fails:  104
%  aux str. fails:  193
%  by-lit fails:    0
%  full subs tried: 110
%  full subs fail:  110
% 
% ; 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/GEO/GEO030-2+eq_r.in")
% 
%------------------------------------------------------------------------------