%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GEO006-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 : art03.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/GEO006-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 3 15)
% (binary-unit 9 #f 3 15)
% (binary-double 9 #f 3 15)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 15)
% (binary-order 25 #f 3 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)
% 
% 
% SOS clause 
% between(c,a,d) | between(a,d,c).
% was split for some strategies as: 
% between(c,a,d).
% between(a,d,c).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(55,40,1,110,0,1)
% 
% 
% START OF PROOF
% 104 [] -between(X,Y,Z) | -between(Y,X,Z) | equal(Y,X).
% 105 [] -between(X,Y,Z) | -between(X,Z,Y) | equal(Z,Y).
% 106 [] -equal(a,c).
% 108 [] -equal(c,d).
% 109 [] between(a,c,d).
% 110 [] between(c,a,d) | between(a,d,c).
% 2908 [hyper:104,110,cut:109,cut:106] between(a,d,c).
% 3307 [hyper:105,2908,cut:109] equal(c,d).
% 3309 [hyper:108,3307] 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 3
% seconds given: 12
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    34
%  derived clauses:   7209
%  kept clauses:      542
%  kept size sum:     8269
%  kept mid-nuclei:   2651
%  kept new demods:   7
%  forw unit-subs:    2988
%  forw double-subs: 450
%  forw overdouble-subs: 6
%  backward subs:     0
%  fast unit cutoff:  460
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.15
%  process. runtime:  0.14
% specific non-discr-tree subsumption statistics: 
%  tried:           1179
%  length fails:    4
%  strength fails:  211
%  predlist fails:  439
%  aux str. fails:  112
%  by-lit fails:    1
%  full subs tried: 410
%  full subs fail:  406
% 
% ; 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/GEO006-3+eq_r.in")
% 
%------------------------------------------------------------------------------