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

% Computer : art05.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 20.0s
% Output   : Assurance 20.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/SYN/SYN647-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: medium
% detected subclass: long
% 
% strategies selected: 
% (hyper 57 #f 27 9)
% (binary-unit 28 #f 27 9)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 27 9)
% (binary 28 #t 27 9)
% (hyper 28 #t)
% (hyper 159 #f)
% (binary-posweight-order 85 #f)
% (binary-weightorder 39 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 47 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(44,40,0,88,0,0)
% 
% 
% START OF PROOF
% 49 [] -p20(f14(f11(X)),f14(f11(Y))) | -p2(f13(f11(X)),f13(f11(Y))) | -p2(f12(f11(Y)),f7(c24)) | -p2(f12(f11(X)),f7(c24)) | p21(f17(X),f17(Y)).
% 53 [] p2(f13(f11(c25)),f7(f8(f9(f8(f9(f9(f9(f9(f8(c24)))))))))).
% 54 [] p2(f13(f11(c23)),f7(f8(f9(f8(f9(f9(f9(f9(f8(c24)))))))))).
% 61 [] -p2(X,Z) | -p2(X,Y) | p2(Z,Y).
% 75 [] p2(f13(f11(c23)),f13(f11(c22))).
% 77 [] p20(f14(f11(c25)),f14(f11(c22))).
% 79 [] p2(f12(f11(c25)),f7(c24)).
% 80 [] p2(f12(f11(c22)),f7(c24)).
% 82 [] p2(X,X).
% 87 [] -p21(f17(c25),f17(c22)).
% 1386 [hyper:61,53,82] p2(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),f13(f11(c25))).
% 1849 [hyper:61,54,82] p2(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),f13(f11(c23))).
% 1022395 [hyper:61,1849,1386] p2(f13(f11(c23)),f13(f11(c25))).
% 1025420 [hyper:61,1022395,75] p2(f13(f11(c25)),f13(f11(c22))).
% 1031201 [hyper:49,1025420,cut:77,cut:80,cut:79] p21(f17(c25),f17(c22)).
% 1034237 [hyper:87,1031201] 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 9
% clause depth limited to 27
% seconds given: 57
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1005
%  derived clauses:   1144263
%  kept clauses:      77010
%  kept size sum:     0
%  kept mid-nuclei:   12950
%  kept new demods:   0
%  forw unit-subs:    106526
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  10
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  23.66
%  process. runtime:  23.65
% specific non-discr-tree subsumption statistics: 
%  tried:           2382
%  length fails:    0
%  strength fails:  16
%  predlist fails:  2366
%  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/SYN/SYN647-1+noeq.in")
% 
%------------------------------------------------------------------------------