%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : CAT011-2 : 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 : art02.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/CAT011-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: peq
% 
% strategies selected: 
% (hyper 30 #f 3 5)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 5)
% (binary-posweight-lex-big-order 30 #f 3 5)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(9,40,0,18,0,0,26,50,0,35,0,0,47,50,0,56,0,0,68,50,0,77,0,0,89,50,0,98,0,1,110,50,1,119,0,1,131,50,1,140,0,1,152,50,1,161,0,1,173,50,1,182,0,1,194,50,1,203,0,1,215,50,1,224,0,1,236,50,1,245,0,1,257,50,2,266,0,2,278,50,2,287,0,2,299,50,2,308,0,2,320,50,2,329,0,2,341,50,2,350,0,2,362,50,2,371,0,2,383,50,2,392,0,2,404,50,2,404,40,2,413,0,3)
% 
% 
% START OF PROOF
% 406 [] equal(codomain(domain(X)),domain(X)).
% 407 [] equal(domain(codomain(X)),codomain(X)).
% 413 [] -equal(domain(domain(a)),domain(a)).
% 417 [para:406.1.1,407.1.1.1,demod:406,slowcut:413] 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
% seconds given: 12
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    268
%  derived clauses:   1116
%  kept clauses:      96
%  kept size sum:     716
%  kept mid-nuclei:   73
%  kept new demods:   175
%  forw unit-subs:    887
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.3
%  process. runtime:  0.3
% specific non-discr-tree subsumption statistics: 
%  tried:           1
%  length fails:    0
%  strength fails:  0
%  predlist fails:  0
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 1
%  full subs fail:  1
% 
% ; 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-2+eq_r.in")
% 
%------------------------------------------------------------------------------