%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN652-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/SYN652-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 5 7)
% (binary-unit 28 #f 5 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 5 7)
% (binary 28 #t 5 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(47,40,0,94,0,1)
% 
% 
% START OF PROOF
% 49 [] -p27(f8(f10(c28,f13(c29,c30)),X),Y) | p4(f5(c31,X),f5(c31,Y)).
% 54 [] p4(f15(X,Y),f15(Z,U)) | -p14(X,Z) | -p4(Y,U).
% 61 [] p4(f15(f17(c36,X),f5(c35,Y)),f5(X,Y)).
% 72 [] -p4(X,Z) | -p4(X,Y) | p4(Z,Y).
% 77 [] p27(f8(f10(c28,f13(c29,c30)),c32),c33).
% 78 [] p4(c34,f5(c35,c32)).
% 80 [] p14(X,X).
% 89 [] p4(X,X).
% 94 [] -p4(f5(c31,c33),f15(f17(c36,c31),c34)).
% 139 [hyper:72,78,89] p4(f5(c35,c32),c34).
% 142 [hyper:54,139,80] p4(f15(X,f5(c35,c32)),f15(X,c34)).
% 193 [hyper:49,77] p4(f5(c31,c32),f5(c31,c33)).
% 216 [hyper:72,61,142] p4(f5(X,c32),f15(f17(c36,X),c34)).
% 229 [hyper:72,216,193,cut:94] 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: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    47
%  derived clauses:   265
%  kept clauses:      18
%  kept size sum:     186
%  kept mid-nuclei:   95
%  kept new demods:   0
%  forw unit-subs:    97
%  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.1
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           1
%  length fails:    0
%  strength fails:  1
%  predlist fails:  0
%  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/SYN652-1+noeq.in")
% 
%------------------------------------------------------------------------------