%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN618-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 : art07.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/SYN618-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 3 9)
% (binary-unit 28 #f 3 9)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 3 9)
% (binary 28 #t 3 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(33,40,0,66,0,0)
% 
% 
% START OF PROOF
% 36 [] -p5(f8(c17,X),f6(f7(c22))) | -p13(c19,X) | -p13(X,c21) | p5(X,c20).
% 37 [] p5(f8(X,Y),f8(Z,U)) | -p2(X,Z) | -p5(Y,U).
% 43 [] -p2(X,Y) | -p2(X,Z) | p2(Y,Z).
% 45 [] -p5(X,Y) | -p5(X,Z) | p5(Y,Z).
% 50 [] p5(f8(f3(c16),c23),f6(f7(c22))).
% 54 [] p2(c17,f3(c16)).
% 57 [] p13(c19,c23).
% 58 [] p13(c23,c21).
% 61 [] p2(X,X).
% 63 [] p5(X,X).
% 66 [] -p5(f8(f3(c16),c20),f6(f7(c22))).
% 117 [hyper:43,54,61] p2(f3(c16),c17).
% 126 [hyper:37,117,63] p5(f8(f3(c16),X),f8(c17,X)).
% 245 [hyper:45,50,126] p5(f8(c17,c23),f6(f7(c22))).
% 254 [hyper:36,245,cut:57,cut:58] p5(c23,c20).
% 262 [hyper:37,254,61] p5(f8(X,c23),f8(X,c20)).
% 352 [hyper:45,262,50,cut:66] 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 3
% seconds given: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    43
%  derived clauses:   484
%  kept clauses:      27
%  kept size sum:     179
%  kept mid-nuclei:   247
%  kept new demods:   0
%  forw unit-subs:    145
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  8
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.1
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           50
%  length fails:    0
%  strength fails:  14
%  predlist fails:  36
%  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/SYN618-1+noeq.in")
% 
%------------------------------------------------------------------------------