%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN599-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 30.0s
% Output   : Assurance 30.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/SYN599-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 11 7)
% (binary-unit 28 #f 11 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 11 7)
% (binary 28 #t 11 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(29,40,1,58,0,1)
% 
% 
% START OF PROOF
% 30 [] p19(f15(f16(X)),f8(f9(f12(f10(f13(f11(c23)))),f14(f4(f6(X)))),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))) | -p18(X).
% 32 [] p7(f8(X,Y),f8(Z,U)) | -p7(X,Z) | -p7(Y,U).
% 33 [] p7(f9(X,Y),f9(Z,U)) | -p3(Y,U) | -p7(X,Z).
% 35 [] -p19(X,Y) | -p7(Y,U) | -p7(X,Z) | p19(Z,U).
% 43 [] p3(f14(X),f14(Y)) | -p3(X,Y).
% 51 [] p3(f4(f6(c21)),c22).
% 55 [] p7(X,X).
% 56 [] p18(c21).
% 58 [] -p19(f15(f16(c21)),f8(f9(f12(f10(f13(f11(c23)))),f14(c22)),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))).
% 59 [hyper:30,56] p19(f15(f16(c21)),f8(f9(f12(f10(f13(f11(c23)))),f14(f4(f6(c21)))),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))).
% 81 [hyper:43,51] p3(f14(f4(f6(c21))),f14(c22)).
% 114 [hyper:33,81,55] p7(f9(X,f14(f4(f6(c21)))),f9(X,f14(c22))).
% 1939 [hyper:32,114,55] p7(f8(f9(X,f14(f4(f6(c21)))),Y),f8(f9(X,f14(c22)),Y)).
% 1332731 [hyper:35,1939,59,55,cut:58] 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 11
% seconds given: 57
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1270
%  derived clauses:   1426291
%  kept clauses:      77002
%  kept size sum:     0
%  kept mid-nuclei:   14152
%  kept new demods:   0
%  forw unit-subs:    93606
%  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:  36.23
%  process. runtime:  36.22
% specific non-discr-tree subsumption statistics: 
%  tried:           2227
%  length fails:    0
%  strength fails:  2
%  predlist fails:  2225
%  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/SYN599-1+noeq.in")
% 
%------------------------------------------------------------------------------