%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN637-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 : art04.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/SYN637-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 7 7)
% (binary-unit 28 #f 7 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 7 7)
% (binary 28 #t 7 7)
% (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(41,40,0,82,0,0)
% 
% 
% START OF PROOF
% 42 [] p22(f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27))),f16(f17(c27,f5(c25,c26,c27)))).
% 43 [] p4(f5(f8(f11(c25),f9(f10(c25),c28)),X,c27),f5(f8(f11(c25),f9(f10(c25),c28)),X,c29)).
% 49 [] p4(f17(X,Y),f17(Z,U)) | -p4(X,Z) | -p4(Y,U).
% 53 [] -p22(X,Y) | -p4(Y,U) | -p4(X,Z) | p22(Z,U).
% 69 [] p4(f16(X),f16(Y)) | -p4(X,Y).
% 76 [] p4(X,X).
% 82 [] -p22(f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c29))),f16(f17(c27,f5(c25,c26,c27)))).
% 139 [hyper:49,43,76] p4(f17(X,f5(f8(f11(c25),f9(f10(c25),c28)),Y,c27)),f17(X,f5(f8(f11(c25),f9(f10(c25),c28)),Y,c29))).
% 406 [hyper:69,139] p4(f16(f17(X,f5(f8(f11(c25),f9(f10(c25),c28)),Y,c27))),f16(f17(X,f5(f8(f11(c25),f9(f10(c25),c28)),Y,c29)))).
% 735 [hyper:53,406,42,76,cut:82] 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 7
% seconds given: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    61
%  derived clauses:   1221
%  kept clauses:      166
%  kept size sum:     7749
%  kept mid-nuclei:   459
%  kept new demods:   0
%  forw unit-subs:    473
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  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:           114
%  length fails:    0
%  strength fails:  12
%  predlist fails:  102
%  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/SYN637-1+noeq.in")
% 
%------------------------------------------------------------------------------