%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN623-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 : art03.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/SYN623-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 4 9)
% (binary-unit 10 #f 4 9)
% (binary-double 16 #f 4 9)
% (binary 54 #t 4 9)
% (binary-order 27 #f 4 9)
% (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(35,40,0,70,0,0)
% 
% 
% START OF PROOF
% 36 [] p16(f4(f6(c27,X),f13(f15(c28,Y),X)),f9(f11(c29,Y),X)) | -p16(f4(c19,Z),U) | p16(f4(Y,Z),U) | -p18(c26,X) | -p2(Y,X).
% 37 [] -p16(f4(X,f13(f15(c28,Y),X)),f9(f11(c29,Y),X)) | -p16(f4(c19,Z),U) | p16(f4(Y,Z),U) | -p18(c26,X) | -p2(Y,X).
% 45 [] -p16(X,Y) | -p3(X,Z) | -p8(Y,U) | p16(Z,U).
% 46 [] -p16(f4(f6(c27,c25),X),Y) | p16(f4(c25,X),Y).
% 51 [] -p3(X,Z) | -p3(X,Y) | p3(Z,Y).
% 56 [] p16(f4(c19,c20),c21).
% 57 [] p3(c23,f4(c24,c20)).
% 58 [] p2(c24,c25).
% 59 [] p3(c22,c23).
% 60 [] p18(c26,c25).
% 65 [] p3(X,X).
% 68 [] p8(X,X).
% 70 [] -p16(c22,c21).
% 122 [hyper:51,59,65] p3(c23,c22).
% 170 [hyper:36,56,58,cut:60] p16(f4(f6(c27,c25),f13(f15(c28,c24),c25)),f9(f11(c29,c24),c25)) | p16(f4(c24,c20),c21).
% 190 [hyper:51,57,122] p3(f4(c24,c20),c22).
% 682 [hyper:45,170,68,190,cut:70] p16(f4(f6(c27,c25),f13(f15(c28,c24),c25)),f9(f11(c29,c24),c25)).
% 3782 [hyper:46,682] p16(f4(c25,f13(f15(c28,c24),c25)),f9(f11(c29,c24),c25)).
% 3795 [hyper:37,3782,56,cut:60,cut:58] p16(f4(c24,c20),c21).
% 3861 [hyper:45,3795,68,190,cut:70] 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 4
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    403
%  derived clauses:   23068
%  kept clauses:      1092
%  kept size sum:     19187
%  kept mid-nuclei:   2673
%  kept new demods:   0
%  forw unit-subs:    18703
%  forw double-subs: 91
%  forw overdouble-subs: 0
%  backward subs:     6
%  fast unit cutoff:  15
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.25
%  process. runtime:  0.25
% specific non-discr-tree subsumption statistics: 
%  tried:           71
%  length fails:    0
%  strength fails:  19
%  predlist fails:  52
%  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/SYN623-1+noeq.in")
% 
%------------------------------------------------------------------------------