%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN689-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 : art08.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/SYN689-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 28 7)
% (binary-unit 28 #f 28 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 28 7)
% (binary 28 #t 28 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(62,40,0,124,0,0)
% 
% 
% START OF PROOF
% 81 [] -p28(X,Y) | -p18(X,Z) | -p18(Y,U) | p28(Z,U).
% 84 [] -p28(f19(X),f19(Y)) | p26(X,Y) | -p27(Y) | -p27(X).
% 88 [] -p18(X,Y) | -p18(X,Z) | p18(Y,Z).
% 94 [] p18(f19(f17(X)),f20(f19(X))) | -p27(X).
% 107 [] p28(f20(f19(c43)),f19(c35)).
% 108 [] p27(f17(X)) | -p27(X).
% 111 [] p18(X,X).
% 117 [] p27(c35).
% 118 [] p27(c43).
% 123 [] -p26(f17(c43),c35).
% 144 [hyper:94,118] p18(f19(f17(c43)),f20(f19(c43))).
% 146 [hyper:108,118] p27(f17(c43)).
% 489 [hyper:88,144,111] p18(f20(f19(c43)),f19(f17(c43))).
% 510 [hyper:81,489,107,111] p28(f19(f17(c43)),f19(c35)).
% 550 [hyper:84,510,cut:117,cut:146] p26(f17(c43),c35).
% 551 [hyper:123,550] 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 28
% seconds given: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    50
%  derived clauses:   566
%  kept clauses:      104
%  kept size sum:     3593
%  kept mid-nuclei:   319
%  kept new demods:   0
%  forw unit-subs:    113
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  2
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.3
%  process. runtime:  0.2
% specific non-discr-tree subsumption statistics: 
%  tried:           178
%  length fails:    0
%  strength fails:  30
%  predlist fails:  148
%  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/SYN689-1+noeq.in")
% 
%------------------------------------------------------------------------------