%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : CAT010-4 : 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 : art10.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/CAT010-4+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: short
% 
% strategies selected: 
% (binary-posweight-order 57 #f 3 5)
% (binary-unit 28 #f 3 5)
% (binary-double 28 #f 3 5)
% (binary 45 #t 3 5)
% (hyper 11 #t 3 5)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(14,40,0,28,0,0)
% 
% 
% START OF PROOF
% 15 [] equal(X,X).
% 19 [] -there_exists(domain(X)) | there_exists(X).
% 21 [] -there_exists(compose(X,Y)) | there_exists(domain(X)).
% 22 [] equal(domain(X),codomain(Y)) | -there_exists(compose(X,Y)).
% 24 [] equal(compose(X,compose(Y,Z)),compose(compose(X,Y),Z)).
% 26 [] equal(compose(codomain(X),X),X).
% 27 [] there_exists(compose(a,b)).
% 28 [] -equal(codomain(compose(a,b)),codomain(a)).
% 35 [binary:27,21,binarydemod:19] there_exists(a).
% 51 [para:26.1.1,22.2.1] equal(domain(codomain(X)),codomain(X)) | -there_exists(X).
% 67 [para:26.1.1,24.1.2.1] equal(compose(codomain(X),compose(X,Y)),compose(X,Y)).
% 80 [binary:35,51.2] equal(domain(codomain(a)),codomain(a)).
% 98 [para:67.1.1,22.2.1] equal(domain(codomain(X)),codomain(compose(X,Y))) | -there_exists(compose(X,Y)).
% 154 [binary:27,98.2,demod:80] equal(codomain(a),codomain(compose(a,b))).
% 155 [para:154.1.2,28.1.1,cut:15] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 5
% clause depth limited to 3
% seconds given: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    89
%  derived clauses:   523
%  kept clauses:      78
%  kept size sum:     624
%  kept mid-nuclei:   0
%  kept new demods:   17
%  forw unit-subs:    197
%  forw double-subs: 43
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  19
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.0
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           10
%  length fails:    7
%  strength fails:  0
%  predlist fails:  0
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 3
%  full subs fail:  3
% 
% ; 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/CAT010-4+eq_r.in")
% 
%------------------------------------------------------------------------------