%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN619-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 : art05.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/SYN619-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(34,40,0,68,0,0)
% 
% 
% START OF PROOF
% 35 [] p8(X,f9(f13(c20,c21),f11(f12(f7(c22,c23))))) | p18(X,f6(f7(c22,c23))) | -p18(X,f6(c19)).
% 36 [] p8(X,f9(f13(f14(X),f15(X)),f16(X))) | -p18(X,f6(c25)) | p18(X,f6(c19)).
% 41 [] p17(f3(c21),f15(X)) | -p18(X,f6(c25)) | p18(X,f6(c19)).
% 44 [] -p18(X,f6(c25)) | p18(X,f6(c19)) | p2(f14(X),c20).
% 59 [] -p17(f3(X),Y) | p17(X,Y).
% 60 [] p18(c24,f6(c25)).
% 61 [] p17(X,X).
% 62 [] p2(X,X).
% 67 [] -p18(c24,f6(f7(c22,c23))).
% 68 [] -p8(c24,f9(f13(X,Y),Z)) | -p17(c21,Y) | -p2(X,c20).
% 97 [hyper:36,60] p8(c24,f9(f13(f14(c24),f15(c24)),f16(c24))) | p18(c24,f6(c19)).
% 98 [hyper:41,60] p17(f3(c21),f15(c24)) | p18(c24,f6(c19)).
% 102 [hyper:44,60] p18(c24,f6(c19)) | p2(f14(c24),c20).
% 247 [hyper:59,98] p18(c24,f6(c19)) | p17(c21,f15(c24)).
% 784 [hyper:68,97,247,102] p18(c24,f6(c19)).
% 792 [hyper:35,784,cut:67] p8(c24,f9(f13(c20,c21),f11(f12(f7(c22,c23))))).
% 799 [hyper:68,792,cut:61,cut:62] 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: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    60
%  derived clauses:   1387
%  kept clauses:      136
%  kept size sum:     1948
%  kept mid-nuclei:   548
%  kept new demods:   0
%  forw unit-subs:    224
%  forw double-subs: 386
%  forw overdouble-subs: 2
%  backward subs:     24
%  fast unit cutoff:  46
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.3
%  process. runtime:  0.4
% specific non-discr-tree subsumption statistics: 
%  tried:           46
%  length fails:    0
%  strength fails:  4
%  predlist fails:  40
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 2
%  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/SYN619-1+noeq.in")
% 
%------------------------------------------------------------------------------