%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : COL009-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 : art10.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 79.5s
% Output   : Assurance 79.5s
% 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/COL009-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: ueq
% 
% strategies selected: 
% (binary-posweight-kb-big-order 60 #f 4 1)
% (binary-posweight-lex-big-order 30 #f 4 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(4,40,1,8,0,2,277,50,375,281,0,375,4204,3,3177,4908,4,4578,5417,5,5976,5417,1,5976,5417,50,5976,5417,40,5976,5421,0,5976,5808,50,6740,5812,0,6740,9344,3,7854,10259,4,8406,10987,5,8942,10987,1,8942,10987,50,8943,10987,40,8943,10991,0,8943)
% 
% 
% START OF PROOF
% 10989 [] equal(apply(apply(apply(b,X),Y),Z),apply(X,apply(Y,Z))).
% 10990 [] equal(apply(apply(l2,X),Y),apply(Y,apply(X,X))).
% 10991 [] -equal(X,apply(combinator,X)).
% 10992 [para:10990.1.2,10991.1.2] -equal(apply(X,X),apply(apply(l2,X),combinator)).
% 10994 [para:10990.1.1,10992.1.1] -equal(apply(apply(l2,X),apply(X,X)),apply(apply(l2,apply(l2,X)),combinator)).
% 11014 [para:10990.1.1,10994.1.1] -equal(apply(apply(X,X),apply(X,X)),apply(apply(l2,apply(l2,X)),combinator)).
% 11035 [para:10990.1.1,11014.1.2] -equal(apply(apply(X,X),apply(X,X)),apply(combinator,apply(apply(l2,X),apply(l2,X)))).
% 11082 [para:10990.1.1,11035.1.2.2] -equal(apply(apply(X,X),apply(X,X)),apply(combinator,apply(apply(l2,X),apply(X,X)))).
% 11088 [para:10989.1.1,11082.1.1.2,demod:10989,slowcut:10989] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1652
%  derived clauses:   2731480
%  kept clauses:      11061
%  kept size sum:     329411
%  kept mid-nuclei:   0
%  kept new demods:   449
%  forw unit-subs:    544354
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     329
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  89.97
%  process. runtime:  89.42
% 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/COL009-1+eq_r.in")
% 
%------------------------------------------------------------------------------