%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : CAT013-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 : 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 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/CAT013-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,27732,4,1947)
% 
% 
% START OF PROOF
% 21 [] equal(X,X).
% 26 [] -there_exists(codomain(X)) | there_exists(X).
% 28 [] equal(domain(X),codomain(Y)) | -there_exists(compose(X,Y)).
% 32 [] equal(compose(codomain(X),X),X).
% 39 [] there_exists(codomain(a)).
% 40 [] -equal(domain(codomain(a)),codomain(a)).
% 45 [hyper:26,39] there_exists(a).
% 32696 [para:28.1.2,40.1.2] -equal(domain(codomain(a)),domain(X)) | -there_exists(compose(X,a)).
% 32697 [binary:21,32696,demod:32,cut:45] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos 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: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    372
%  derived clauses:   161580
%  kept clauses:      25383
%  kept size sum:     789812
%  kept mid-nuclei:   1708
%  kept new demods:   5
%  forw unit-subs:    7943
%  forw double-subs: 3263
%  forw overdouble-subs: 30206
%  backward subs:     1
%  fast unit cutoff:  13
%  full unit cutoff:  0
%  dbl  unit cutoff:  613
%  real runtime  :  20.48
%  process. runtime:  20.46
% specific non-discr-tree subsumption statistics: 
%  tried:           10252079
%  length fails:    936190
%  strength fails:  1317023
%  predlist fails:  594807
%  aux str. fails:  587797
%  by-lit fails:    931196
%  full subs tried: 4570131
%  full subs fail:  4539872
% 
% ; 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/CAT013-3+eq_r.in")
% 
%------------------------------------------------------------------------------