%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : COL099-1 : TPTP v3.4.2. Released v2.7.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/COL/COL099-1+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 3 7)
% (binary-posweight-order 29 #f 3 7)
% (binary-unit 29 #f 3 7)
% (binary-double 29 #f 3 7)
% (binary 29 #t 3 7)
% (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(16,40,0,32,0,0)
% 
% 
% START OF PROOF
% 24 [] member(pair(X,Y),trancl(Z)) | -member(pair(X,Y),Z).
% 27 [] member(pair(X,diamond_strip_lemma^d_sk1(Y,Z,X,U)),trancl(U)) | -member(pair(Y,Z),trancl(U)) | -member(pair(Y,X),U) | -diamond(U).
% 28 [] member(pair(X,diamond_strip_lemma^d_sk1(Y,X,Z,U)),U) | -member(pair(Y,X),trancl(U)) | -member(pair(Y,Z),U) | -diamond(U).
% 29 [] diamond(r).
% 30 [] member(pair(y,ya),r).
% 31 [] member(pair(y,yp),trancl(r)).
% 32 [] -member(pair(ya,X),trancl(r)) | -member(pair(yp,X),trancl(r)).
% 47 [hyper:27,31,30,cut:29] member(pair(ya,diamond_strip_lemma^d_sk1(y,yp,ya,r)),trancl(r)).
% 49 [hyper:28,31,30,cut:29] member(pair(yp,diamond_strip_lemma^d_sk1(y,yp,ya,r)),r).
% 62 [hyper:24,49] member(pair(yp,diamond_strip_lemma^d_sk1(y,yp,ya,r)),trancl(r)).
% 69 [hyper:32,47,cut:62] 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 7
% clause depth limited to 3
% seconds given: 58
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    17
%  derived clauses:   62
%  kept clauses:      8
%  kept size sum:     68
%  kept mid-nuclei:   25
%  kept new demods:   0
%  forw unit-subs:    7
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  15
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.0
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           3
%  length fails:    0
%  strength fails:  2
%  predlist fails:  1
%  aux str. fails:  0
%  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/COL/COL099-1+eq_r.in")
% 
%------------------------------------------------------------------------------