%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GEO028-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 : art08.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 10.0s
% Output   : Assurance 10.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/GEO028-3+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(42,40,0,84,0,0,221861,4,1962)
% 
% 
% START OF PROOF
% 45 [] -equidistant(X,Y,V,W) | -equidistant(X,Y,Z,U) | equidistant(Z,U,V,W).
% 47 [] between(X,Y,extension(X,Y,Z,U)).
% 48 [] equidistant(X,extension(Y,X,Z,U),Z,U).
% 63 [] equidistant(X,Y,X,Y).
% 71 [] -equidistant(Z,U,V,W) | -equidistant(X,Y,Z,U) | equidistant(X,Y,V,W).
% 81 [] -equidistant(X,Y,X,Z) | -between(U,X,Y) | -between(U,X,Z) | equal(U,X) | equal(Y,Z).
% 82 [] equidistant(w,x,y,z).
% 83 [] -equal(u,v).
% 84 [] -equal(extension(u,v,w,x),extension(u,v,y,z)).
% 1595 [hyper:45,48,63] equidistant(X,Y,Z,extension(U,Z,X,Y)).
% 2040 [hyper:71,48,82] equidistant(X,extension(Y,X,w,x),y,z).
% 18670 [hyper:71,2040,1595] equidistant(X,extension(Y,X,w,x),Z,extension(U,Z,y,z)).
% 222007 [binary:81.4,83] -equidistant(v,X,v,Y) | -between(u,v,Y) | -between(u,v,X) | equal(X,Y).
% 222055 [binary:84,222007.4,cut:47,cut:47,cut:18670] 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 15
% clause depth limited to 2
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    317
%  derived clauses:   1208199
%  kept clauses:      1438
%  kept size sum:     21044
%  kept mid-nuclei:   220395
%  kept new demods:   11
%  forw unit-subs:    299951
%  forw double-subs: 27749
%  forw overdouble-subs: 104
%  backward subs:     48
%  fast unit cutoff:  62803
%  full unit cutoff:  0
%  dbl  unit cutoff:  102
%  real runtime  :  19.63
%  process. runtime:  19.63
% specific non-discr-tree subsumption statistics: 
%  tried:           34407
%  length fails:    87
%  strength fails:  1171
%  predlist fails:  14599
%  aux str. fails:  1884
%  by-lit fails:    0
%  full subs tried: 16666
%  full subs fail:  16562
% 
% ; 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/GEO028-3+eq_r.in")
% 
%------------------------------------------------------------------------------