%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : COL030-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 49.6s
% Output   : Assurance 49.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/COL030-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(4,40,0,8,0,0,34,50,6,38,0,6,1808,3,2975,2286,4,4436,2444,5,5907,2444,1,5907,2444,50,5907,2444,40,5907,2448,0,5907,2502,50,5923,2506,0,5923)
% 
% 
% START OF PROOF
% 2504 [] equal(apply(apply(apply(s,X),Y),Z),apply(apply(X,Z),apply(Y,Z))).
% 2505 [] equal(apply(apply(l,X),Y),apply(X,apply(Y,Y))).
% 2506 [] -equal(apply(X,f(X)),apply(f(X),apply(X,f(X)))).
% 2512 [para:2504.1.2,2505.1.1] equal(apply(apply(apply(s,l),X),Y),apply(Y,apply(apply(X,Y),apply(X,Y)))).
% 2662 [para:2504.1.2,2512.1.2.2,slowcut:2506] 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:    565
%  derived clauses:   1055601
%  kept clauses:      2640
%  kept size sum:     81144
%  kept mid-nuclei:   0
%  kept new demods:   412
%  forw unit-subs:    134139
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     101
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  59.79
%  process. runtime:  59.24
% 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/COL030-1+eq_r.in")
% 
%------------------------------------------------------------------------------