%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN672-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 : art09.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/SYN672-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 5 7)
% (binary-unit 10 #f 5 7)
% (binary-double 16 #f 5 7)
% (binary 54 #t 5 7)
% (binary-order 27 #f 5 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(54,40,0,108,0,0)
% 
% 
% START OF PROOF
% 55 [] p30(f10(f12(c32,c33),f4(f7(c34,c35),X)),f4(f7(c34,c35),Y)) | -p30(f10(f12(c32,c33),X),Y).
% 56 [] p30(f10(f12(c32,c33),f14(c38,X)),Y) | -p31(f20(c36,X),f17(c37,Y)) | p3(Y,f14(c38,X)).
% 67 [] p9(f10(X,Y),f10(Z,U)) | -p3(Y,U) | -p8(X,Z).
% 69 [] -p30(X,Y) | -p3(Y,Z) | -p9(X,U) | p30(U,Z).
% 71 [] p3(f4(f7(c34,X),f14(c38,Y)),f14(X,Y)).
% 89 [] p31(f20(c36,c39),f17(c37,c40)).
% 101 [] p3(X,X).
% 104 [] p8(X,X).
% 107 [] -p3(c40,f14(c38,c39)).
% 108 [] -p30(f10(f12(c32,c33),f14(c35,c39)),f4(f7(c34,c35),c40)).
% 154 [hyper:56,89,cut:107] p30(f10(f12(c32,c33),f14(c38,c39)),c40).
% 193 [hyper:55,154] p30(f10(f12(c32,c33),f4(f7(c34,c35),f14(c38,c39))),f4(f7(c34,c35),c40)).
% 200 [hyper:67,71,104] p9(f10(X,f4(f7(c34,Y),f14(c38,Z))),f10(X,f14(Y,Z))).
% 351 [hyper:69,193,101,200,cut:108] 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 5
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    66
%  derived clauses:   454
%  kept clauses:      24
%  kept size sum:     408
%  kept mid-nuclei:   186
%  kept new demods:   0
%  forw unit-subs:    164
%  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.1
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           8
%  length fails:    0
%  strength fails:  4
%  predlist fails:  4
%  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/SYN672-1+noeq.in")
% 
%------------------------------------------------------------------------------