%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN624-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 10.0s
% Output   : Assurance 10.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/SYN624-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(35,40,1,70,0,1,13973,50,1061,14008,0,1061)
% 
% 
% START OF PROOF
% 13977 [] p10(f13(X,Y),f13(Z,U)) | -p5(X,Z) | -p10(Y,U).
% 13982 [] p10(f13(f6(c22),X),f13(f6(c24),f16(c26,X))).
% 13987 [] -p10(X,Z) | -p10(X,Y) | p10(Z,Y).
% 13996 [] p10(f16(X,f14(f15(f7(c25)))),X).
% 14003 [] p5(X,X).
% 14004 [] p10(X,X).
% 14008 [] -p10(f13(f6(c24),c26),f13(f6(c22),f14(f15(f7(c25))))).
% 14166 [hyper:13977,13996,14003] p10(f13(X,f16(Y,f14(f15(f7(c25))))),f13(X,Y)).
% 14526 [hyper:13987,13982,14004] p10(f13(f6(c24),f16(c26,X)),f13(f6(c22),X)).
% 16902 [hyper:13987,14526,14166,cut:14008] 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 6
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    2742
%  derived clauses:   225293
%  kept clauses:      3727
%  kept size sum:     89993
%  kept mid-nuclei:   13027
%  kept new demods:   0
%  forw unit-subs:    132764
%  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:  10.72
%  process. runtime:  10.71
% specific non-discr-tree subsumption statistics: 
%  tried:           806
%  length fails:    0
%  strength fails:  8
%  predlist fails:  798
%  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/SYN624-1+noeq.in")
% 
%------------------------------------------------------------------------------