%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GEO056-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 : art01.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/GEO056-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(35,40,1,70,0,1,121502,4,1930)
% 
% 
% START OF PROOF
% 36 [] equal(X,X).
% 39 [] -equidistant(X,Y,Z,Z) | equal(X,Y).
% 68 [] equidistant(X,reflection(Y,X),Y,X).
% 69 [] equal(u,v).
% 70 [] -equal(v,reflection(u,v)).
% 288 [hyper:39,68] equal(X,reflection(X,X)).
% 121624 [para:69.1.1,70.1.2.1,demod:288,cut:36] 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:    257
%  derived clauses:   1260383
%  kept clauses:      593
%  kept size sum:     10333
%  kept mid-nuclei:   114529
%  kept new demods:   10
%  forw unit-subs:    318849
%  forw double-subs: 92567
%  forw overdouble-subs: 8423
%  backward subs:     35
%  fast unit cutoff:  73918
%  full unit cutoff:  8
%  dbl  unit cutoff:  6271
%  real runtime  :  19.32
%  process. runtime:  19.30
% specific non-discr-tree subsumption statistics: 
%  tried:           15926
%  length fails:    6
%  strength fails:  791
%  predlist fails:  1118
%  aux str. fails:  297
%  by-lit fails:    0
%  full subs tried: 13714
%  full subs fail:  5291
% 
% ; 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/GEO056-3+eq_r.in")
% 
%------------------------------------------------------------------------------