%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : ALG011-1 : TPTP v3.4.2. Released v2.7.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art01.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 0.0s
% Output   : Assurance 0.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/ALG/ALG011-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: small
% 
% strategies selected: 
% (hyper 27 #f 3 5)
% (binary-unit 10 #f 3 5)
% (binary-double 10 #f 3 5)
% (binary-double 16 #f)
% (binary-double 10 #t)
% (binary 16 #t 3 5)
% (binary-order 27 #f 3 5)
% (binary-posweight-order 125 #f)
% (binary-posweight-lex-big-order 43 #f)
% (binary-posweight-lex-small-order 16 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-weightorder 65 #f)
% (binary-order 27 #f)
% (hyper-order 37 #f)
% (binary 63 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(8,40,1,16,0,2)
% 
% 
% START OF PROOF
% 10 [] equal(f(X,f(Y,Z)),f(f(X,Y),Z)).
% 11 [] d(X) | c(X).
% 12 [] -d(X) | -c(X).
% 13 [] c(a1).
% 14 [] d(a2).
% 15 [] d(f(X,Y)) | -c(X) | -c(Y).
% 16 [] c(f(X,Y)) | -d(X) | -d(Y).
% 19 [hyper:15,13,13] d(f(a1,a1)).
% 23 [hyper:16,14,14] c(f(a2,a2)).
% 34 [hyper:15,11,13] d(f(a1,X)) | d(X).
% 36 [hyper:16,11,14] c(f(X,a2)) | c(X).
% 48 [hyper:16,19,14,demod:10] c(f(a1,f(a1,a2))).
% 59 [hyper:15,23,13] d(f(a1,f(a2,a2))).
% 266 [hyper:12,48,34] d(f(a1,a2)).
% 410 [hyper:12,266,36,demod:10] c(f(a1,f(a2,a2))).
% 450 [hyper:12,59,cut:410] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 3
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    23
%  derived clauses:   1215
%  kept clauses:      248
%  kept size sum:     2812
%  kept mid-nuclei:   140
%  kept new demods:   1
%  forw unit-subs:    102
%  forw double-subs: 169
%  forw overdouble-subs: 242
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.4
%  process. runtime:  0.3
% specific non-discr-tree subsumption statistics: 
%  tried:           1790
%  length fails:    85
%  strength fails:  340
%  predlist fails:  110
%  aux str. fails:  35
%  by-lit fails:    0
%  full subs tried: 1204
%  full subs fail:  952
% 
% ; 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/ALG/ALG011-1+eq_r.in")
% 
%------------------------------------------------------------------------------