%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN630-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 : art10.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/SYN630-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 9 11)
% (binary-unit 10 #f 9 11)
% (binary-double 16 #f 9 11)
% (binary 54 #t 9 11)
% (binary-order 27 #f 9 11)
% (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(36,40,0,72,0,0)
% 
% 
% START OF PROOF
% 39 [] -p3(X,f13(f15(f17(f16(f9(f11(c29)))),Y),f13(f15(f16(f9(f10(f11(c29)))),Z),f14(f16(U),f15(f16(f9(f10(f11(c29)))),V))))) | -p22(f12(f9(f10(f11(c29))),f18(W,f9(f11(c29)))),U) | -p21(U,f12(f9(f10(f11(c29))),W)) | p4(f5(f7(X1,f8(W,V)),X),U) | -p21(Y,f9(f10(f11(c29)))).
% 43 [] p3(c26,f13(f15(f17(f16(f9(f11(c29)))),c28),f13(f15(f16(f9(f10(f11(c29)))),c30),f14(f16(c27),f15(f16(f9(f10(f11(c29)))),c25))))).
% 56 [] p22(f12(f9(f10(f11(c29))),f18(c24,f9(f11(c29)))),c27).
% 66 [] p21(c27,f12(f9(f10(f11(c29))),c24)).
% 67 [] p21(c28,f9(f10(f11(c29)))).
% 72 [] -p4(f5(f7(c23,f8(c24,c25)),c26),c27).
% 195 [hyper:39,43,56,cut:67,cut:66,slowcut:72] 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 11
% clause depth limited to 9
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    34
%  derived clauses:   209
%  kept clauses:      2
%  kept size sum:     23
%  kept mid-nuclei:   94
%  kept new demods:   0
%  forw unit-subs:    47
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  15
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.1
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           56
%  length fails:    4
%  strength fails:  28
%  predlist fails:  18
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 6
%  full subs fail:  6
% 
% ; 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/SYN630-1+noeq.in")
% 
%------------------------------------------------------------------------------