%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN620-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 : 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 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/SYN/SYN620-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: medium
% 
% strategies selected: 
% (hyper 27 #f 6 7)
% (binary-unit 10 #f 6 7)
% (binary-double 16 #f 6 7)
% (binary 54 #t 6 7)
% (binary-order 27 #f 6 7)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(34,40,0,68,0,0)
% 
% 
% START OF PROOF
% 36 [] p20(f12(f13(f6(c22),f14(f15(f7(c25))))),f12(f13(f6(c24),X))).
% 40 [] -p20(X,Y) | -p11(X,U) | -p11(Y,Z) | p20(U,Z).
% 43 [] p10(f13(f6(c22),X),f13(f6(c24),f16(c26,X))).
% 48 [] -p10(X,Z) | -p10(X,Y) | p10(Z,Y).
% 49 [] p11(f12(X),f12(Y)) | -p10(X,Y).
% 60 [] p11(X,X).
% 64 [] p10(X,X).
% 68 [] -p20(f12(f13(f6(c22),f14(f15(f7(c25))))),f12(f13(f6(c22),c27))).
% 528 [hyper:48,43,64] p10(f13(f6(c24),f16(c26,X)),f13(f6(c22),X)).
% 3831 [hyper:49,528] p11(f12(f13(f6(c24),f16(c26,X))),f12(f13(f6(c22),X))).
% 20521 [hyper:40,3831,36,60,slowcut:68] 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 7
% clause depth limited to 6
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    513
%  derived clauses:   44894
%  kept clauses:      15334
%  kept size sum:     471559
%  kept mid-nuclei:   5096
%  kept new demods:   0
%  forw unit-subs:    20088
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  1.36
%  process. runtime:  1.36
% specific non-discr-tree subsumption statistics: 
%  tried:           1135
%  length fails:    0
%  strength fails:  5
%  predlist fails:  1130
%  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/SYN620-1+noeq.in")
% 
%------------------------------------------------------------------------------