%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : CAT011-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 : 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 20.0s
% Output   : Assurance 20.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/CAT011-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 7)
% (binary-unit 9 #f 3 7)
% (binary-double 9 #f 3 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 7)
% (binary-order 25 #f 3 7)
% (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(20,40,1,40,0,1,27614,4,1883,45951,5,2502,45952,1,2502,45952,50,2503,45952,40,2503,45972,0,2503)
% 
% 
% START OF PROOF
% 45957 [] -there_exists(domain(X)) | there_exists(X).
% 45960 [] equal(domain(X),codomain(Y)) | -there_exists(compose(X,Y)).
% 45963 [] equal(compose(X,domain(X)),X).
% 45964 [] equal(compose(codomain(X),X),X).
% 45971 [] there_exists(domain(a)).
% 45972 [] -equal(domain(domain(a)),domain(a)).
% 45976 [binary:45971,45957] there_exists(a).
% 46010 [para:45963.1.1,45960.2.1] equal(domain(X),codomain(domain(X))) | -there_exists(X).
% 46012 [para:45964.1.1,45960.2.1] equal(domain(codomain(X)),codomain(X)) | -there_exists(X).
% 46079 [binary:45976,46010.2] equal(domain(a),codomain(domain(a))).
% 46089 [binary:45971,46012.2,demod:46079,cut:45972] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit 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 7
% clause depth limited to 3
% seconds given: 9
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    403
%  derived clauses:   205100
%  kept clauses:      37976
%  kept size sum:     781
%  kept mid-nuclei:   1729
%  kept new demods:   10
%  forw unit-subs:    7462
%  forw double-subs: 3300
%  forw overdouble-subs: 35339
%  backward subs:     4
%  fast unit cutoff:  148
%  full unit cutoff:  0
%  dbl  unit cutoff:  641
%  real runtime  :  25.7
%  process. runtime:  25.3
% specific non-discr-tree subsumption statistics: 
%  tried:           15175232
%  length fails:    1495321
%  strength fails:  1986579
%  predlist fails:  2623390
%  aux str. fails:  724089
%  by-lit fails:    1496750
%  full subs tried: 5522122
%  full subs fail:  5486715
% 
% ; 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/CAT011-3+eq_r.in")
% 
%------------------------------------------------------------------------------