%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN595-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 19.5s
% Output   : Assurance 19.5s
% 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/SYN595-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 9 7)
% (binary-unit 10 #f 9 7)
% (binary-double 16 #f 9 7)
% (binary 54 #t 9 7)
% (binary-order 27 #f 9 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(27,40,0,54,0,0,989520,4,2026)
% 
% 
% START OF PROOF
% 47 [?] ?
% 49 [?] ?
% 50 [?] ?
% 53 [] -p7(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),f3(c17)),f9(f11(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17))))),f10(f11(f3(f4(f5(c17)))),c22)))),f8(f10(f12(f11(f3(f5(c17)))),X),f8(f10(f11(f3(f4(f5(c17)))),Y),f9(f11(Z),f10(f11(f3(f4(f5(c17)))),c22))))) | -p15(Z,f6(f3(f4(f5(c17))),c16)) | -p14(X,f3(f4(f5(c17)))) | -p2(Y,f3(c17)).
% 4608 [?] ?
% 989527 [binary:49,53,cut:4608,cut:47,cut:50] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos 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 9
% seconds given: 27
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    649
%  derived clauses:   1089030
%  kept clauses:      77002
%  kept size sum:     0
%  kept mid-nuclei:   12925
%  kept new demods:   0
%  forw unit-subs:    96751
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  7
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  20.79
%  process. runtime:  20.28
% specific non-discr-tree subsumption statistics: 
%  tried:           1664
%  length fails:    0
%  strength fails:  4
%  predlist fails:  1660
%  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/SYN595-1+noeq.in")
% 
%------------------------------------------------------------------------------