%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN576-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 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/SYN576-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 7)
% (binary-unit 10 #f 4 7)
% (binary-double 16 #f 4 7)
% (binary 54 #t 4 7)
% (binary-order 27 #f 4 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(22,40,0,44,0,0)
% 
% 
% START OF PROOF
% 23 [] p12(f7(f9(X,c14,f3(Y,Z)),f3(Y,Z)),f6(X)) | -p11(f10(Y),f10(Z)) | -p12(Y,f6(X)) | -p12(Z,f6(X)).
% 25 [] p2(f9(X,Y,Z),f9(U,V,W)) | -p4(X,U) | -p2(Z,W) | -p8(Y,V).
% 26 [] p2(f7(X,Y),f7(Z,U)) | -p2(X,Z) | -p2(Y,U).
% 28 [] -p12(X,Y) | -p5(Y,Z) | -p2(X,U) | p12(U,Z).
% 36 [] p2(f3(X,Y),f3(Y,X)).
% 37 [] p11(X,Y) | p11(Y,X).
% 38 [] p12(c16,f6(c13)).
% 39 [] p12(c15,f6(c13)).
% 40 [] p5(X,X).
% 41 [] p4(X,X).
% 42 [] p2(X,X).
% 43 [] p8(X,X).
% 44 [] -p12(f7(f9(c13,c14,f3(c15,c16)),f3(c15,c16)),f6(c13)).
% 93 [hyper:23,37,39,38,cut:44] p11(f10(c16),f10(c15)).
% 118 [hyper:23,93,38,cut:39] p12(f7(f9(c13,c14,f3(c16,c15)),f3(c16,c15)),f6(c13)).
% 127 [hyper:25,36,41,43] p2(f9(X,Y,f3(Z,U)),f9(X,Y,f3(U,Z))).
% 132 [hyper:26,36,42] p2(f7(X,f3(Y,Z)),f7(X,f3(Z,Y))).
% 1306 [hyper:26,127,42] p2(f7(f9(X,Y,f3(Z,U)),V),f7(f9(X,Y,f3(U,Z)),V)).
% 2735 [hyper:28,118,40,132] p12(f7(f9(c13,c14,f3(c16,c15)),f3(c15,c16)),f6(c13)).
% 32146 [hyper:28,1306,40,2735,cut:44] 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 4
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    208
%  derived clauses:   260662
%  kept clauses:      11592
%  kept size sum:     371131
%  kept mid-nuclei:   20467
%  kept new demods:   0
%  forw unit-subs:    63460
%  forw double-subs: 163470
%  forw overdouble-subs: 0
%  backward subs:     5
%  fast unit cutoff:  8
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  5.29
%  process. runtime:  5.20
% specific non-discr-tree subsumption statistics: 
%  tried:           384
%  length fails:    0
%  strength fails:  24
%  predlist fails:  360
%  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/SYN576-1+noeq.in")
% 
%------------------------------------------------------------------------------