%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : COL054-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 : 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/COL/COL054-1+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 3)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 3)
% (binary-posweight-lex-big-order 30 #f 3 3)
% (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(4,40,1,8,0,1,13,50,1,17,0,1,24,50,1,28,0,1,35,50,1,39,0,1,58,50,1,62,0,1,123,50,5,127,0,5,356,50,37,360,0,37,4608,4,2213)
% 
% 
% START OF PROOF
% 357 [] equal(X,X).
% 358 [] equal(response(mocking_bird,X),response(X,X)).
% 359 [] equal(response(compose(X,Y),Z),response(X,response(Y,Z))).
% 360 [] -equal(response(a,X),Y) | -equal(response(b,Y),X).
% 366 [para:359.1.1,358.1.2] equal(response(mocking_bird,compose(X,Y)),response(X,response(Y,compose(X,Y)))).
% 369 [para:359.1.1,366.1.2.2] equal(response(mocking_bird,compose(X,compose(Y,Z))),response(X,response(Y,response(Z,compose(X,compose(Y,Z)))))).
% 5366 [para:369.1.2,360.1.1] -equal(response(b,X),response(Y,response(Z,compose(a,compose(Y,Z))))) | -equal(response(mocking_bird,compose(a,compose(Y,Z))),X).
% 5368 [binary:357,5366,slowcut:357] 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 3
% clause depth limited to 9
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1975
%  derived clauses:   43249
%  kept clauses:      5110
%  kept size sum:     523540
%  kept mid-nuclei:   216
%  kept new demods:   4548
%  forw unit-subs:    24920
%  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  :  24.70
%  process. runtime:  24.70
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  predlist fails:  0
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 0
%  full subs fail:  0
% 
% ; 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/COL/COL054-1+eq_r.in")
% 
%------------------------------------------------------------------------------