%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : COL022-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 119.6s
% Output   : Assurance 119.6s
% 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/COL022-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 ****
% 
% 
% timer checkpoints: c(5,40,1,10,0,1,1146,3,3017,1146,4,4512,1146,5,6002,1146,1,6002,1146,50,6002,1146,40,6002,1151,0,6002,2356,3,7509,2368,4,8255,2384,5,9003,2384,1,9003,2384,50,9003,2384,40,9003,2389,0,9003,26261,3,10504,27146,4,11254,27897,5,12004,27897,1,12004,27897,50,12006,27897,40,12006,27902,0,12006)
% 
% 
% START OF PROOF
% 27899 [] equal(apply(apply(apply(b,X),Y),Z),apply(X,apply(Y,Z))).
% 27900 [] equal(apply(m,X),apply(X,X)).
% 27902 [] -equal(X,apply(combinator,X)).
% 27915 [para:27899.1.1,27900.1.2,slowcut:27902] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using first neg lit preferred strategy
% not 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: 180
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    7534
%  derived clauses:   3769157
%  kept clauses:      27888
%  kept size sum:     797877
%  kept mid-nuclei:   0
%  kept new demods:   344
%  forw unit-subs:    841068
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     672
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  120.57
%  process. runtime:  120.6
% 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/COL022-1+eq_r.in")
% 
%------------------------------------------------------------------------------