%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : CAT018-1 : 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 : art09.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/CAT/CAT018-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 2 7)
% (binary-posweight-order 29 #f 2 7)
% (binary-unit 29 #f 2 7)
% (binary-double 29 #f 2 7)
% (binary 29 #t 2 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(22,40,0,44,0,0)
% 
% 
% START OF PROOF
% 24 [] product(X,Y,compose(X,Y)) | -defined(X,Y).
% 26 [] -product(X,Y,Z) | -defined(Z,U) | defined(Y,U).
% 27 [] -product(X,Y,Z) | -product(Y,U,V) | -defined(Z,U) | defined(X,V).
% 30 [] -product(X,Y,Z) | -product(U,X,V) | -defined(U,Z) | defined(V,Y).
% 32 [] -defined(X,Y) | -defined(Y,Z) | defined(X,Z) | -identity_map(Y).
% 33 [] identity_map(domain(X)).
% 37 [] product(X,domain(X),X).
% 42 [] defined(a,b).
% 43 [] defined(b,c).
% 44 [] -defined(a,compose(b,c)).
% 51 [hyper:24,42] product(a,b,compose(a,b)).
% 60 [hyper:24,43] product(b,c,compose(b,c)).
% 90 [hyper:26,37,43] defined(domain(b),c).
% 123 [hyper:30,51,37,cut:42] defined(compose(a,b),domain(b)).
% 368 [hyper:32,123,90,cut:33] defined(compose(a,b),c).
% 378 [hyper:27,368,51,60,cut:44] 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 2
% seconds given: 58
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    32
%  derived clauses:   742
%  kept clauses:      39
%  kept size sum:     243
%  kept mid-nuclei:   290
%  kept new demods:   0
%  forw unit-subs:    147
%  forw double-subs: 11
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  36
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           239
%  length fails:    2
%  strength fails:  24
%  predlist fails:  164
%  aux str. fails:  32
%  by-lit fails:    0
%  full subs tried: 17
%  full subs fail:  17
% 
% ; 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/CAT/CAT018-1+eq_r.in")
% 
%------------------------------------------------------------------------------