%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN640-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 10.0s
% Output   : Assurance 10.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/SYN640-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(42,40,1,84,0,1)
% 
% 
% START OF PROOF
% 50 [] -p19(f13(f11(X)),f13(f11(Y))) | -p2(f12(f11(X)),f7(c24)) | -p2(f12(f11(Y)),f7(c24)) | p20(f17(X),f17(Y)).
% 51 [] p2(f13(f11(c25)),f7(f8(f9(f8(f9(f9(f9(f9(f8(c24)))))))))).
% 52 [] p2(f13(f11(c23)),f7(f8(f9(f8(f9(f9(f9(f9(f8(c24)))))))))).
% 57 [] -p19(X,Y) | -p2(Y,U) | -p2(X,Z) | p19(Z,U).
% 59 [] -p2(X,Z) | -p2(X,Y) | p2(Z,Y).
% 73 [] p19(f13(f11(c23)),f13(f11(c22))).
% 75 [] p2(f12(f11(c22)),f7(c24)).
% 76 [] p2(f12(f11(c25)),f7(c24)).
% 78 [] p2(X,X).
% 83 [] -p20(f17(c25),f17(c22)).
% 1369 [hyper:59,51,78] p2(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),f13(f11(c25))).
% 1833 [hyper:57,52,73,78] p19(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),f13(f11(c22))).
% 731898 [hyper:57,1833,78,1369] p19(f13(f11(c25)),f13(f11(c22))).
% 731903 [hyper:50,731898,cut:76,cut:75] p20(f17(c25),f17(c22)).
% 732963 [hyper:83,731903] 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:    865
%  derived clauses:   836866
%  kept clauses:      77007
%  kept size sum:     0
%  kept mid-nuclei:   11035
%  kept new demods:   0
%  forw unit-subs:    101519
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  3
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  17.68
%  process. runtime:  17.66
% specific non-discr-tree subsumption statistics: 
%  tried:           2018
%  length fails:    0
%  strength fails:  14
%  predlist fails:  2004
%  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/SYN640-1+noeq.in")
% 
%------------------------------------------------------------------------------