%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : COL020-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 : art06.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 59.4s
% Output   : Assurance 59.4s
% 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/COL020-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,0,10,0,0,10,50,0,15,0,0,1172,3,3001,1432,4,4521,1528,5,6001,1528,1,6001,1528,50,6001,1528,40,6001,1533,0,6001,1535,50,6001,1540,0,6002)
% 
% 
% START OF PROOF
% 1537 [] equal(apply(apply(apply(s,X),Y),Z),apply(apply(X,Z),apply(Y,Z))).
% 1538 [] equal(apply(apply(apply(b,X),Y),Z),apply(X,apply(Y,Z))).
% 1539 [] equal(apply(apply(apply(c,X),Y),Z),apply(apply(X,Z),Y)).
% 1540 [] -equal(X,apply(combinator,X)).
% 1541 [para:1539.1.2,1538.1.1] equal(apply(apply(apply(c,apply(b,X)),Y),Z),apply(X,apply(Z,Y))).
% 1551 [para:1537.1.1,1539.1.2] equal(apply(apply(apply(c,apply(s,X)),Y),Z),apply(apply(X,Y),apply(Z,Y))).
% 1564 [para:1541.1.2,1540.1.2,slowcut:1551] 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 lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 1
% clause depth limited to 5
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    599
%  derived clauses:   1738684
%  kept clauses:      1537
%  kept size sum:     48427
%  kept mid-nuclei:   0
%  kept new demods:   183
%  forw unit-subs:    53710
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     95
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  60.69
%  process. runtime:  60.2
% 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/COL020-1+eq_r.in")
% 
%------------------------------------------------------------------------------