%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : CAT011-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 : art08.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 49.3s
% Output   : Assurance 49.3s
% 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-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 3 7)
% (binary-posweight-order 29 #f 3 7)
% (binary-unit 29 #f 3 7)
% (binary-double 29 #f 3 7)
% (binary 29 #t 3 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(20,40,0,40,0,0,10842,50,79,10862,0,79,78312,50,701,78332,0,701,239472,50,2465,239492,0,2465,444741,4,4943)
% 
% 
% START OF PROOF
% 239473 [] equal(X,X).
% 239474 [] product(X,Y,compose(X,Y)) | -defined(X,Y).
% 239483 [] identity_map(domain(X)).
% 239485 [] defined(X,domain(X)).
% 239487 [] product(X,domain(X),X).
% 239489 [] product(X,Y,Y) | -defined(X,Y) | -identity_map(X).
% 239491 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 239492 [] -equal(domain(domain(a)),domain(a)).
% 239499 [hyper:239474,239485] product(X,domain(X),compose(X,domain(X))).
% 239508 [hyper:239489,239485,239483] product(domain(X),domain(domain(X)),domain(domain(X))).
% 244486 [hyper:239491,239508,239487] equal(domain(X),domain(domain(X))).
% 244487 [hyper:239491,239508,239499,demod:244486] equal(compose(domain(X),domain(X)),domain(X)).
% 444742 [para:244487.1.2,239492.1.1,demod:244487,244486,cut:239473] 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 6
% seconds given: 58
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1693
%  derived clauses:   4330066
%  kept clauses:      1999
%  kept size sum:     19997
%  kept mid-nuclei:   442594
%  kept new demods:   32
%  forw unit-subs:    2933294
%  forw double-subs: 172442
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  1013
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  50.20
%  process. runtime:  49.43
% specific non-discr-tree subsumption statistics: 
%  tried:           28012
%  length fails:    16
%  strength fails:  0
%  predlist fails:  21418
%  aux str. fails:  5736
%  by-lit fails:    0
%  full subs tried: 842
%  full subs fail:  842
% 
% ; 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-1+eq_r.in")
% 
%------------------------------------------------------------------------------