%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN610-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 20.0s
% Output   : Assurance 20.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/SYN610-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 8 7)
% (binary-unit 10 #f 8 7)
% (binary-double 16 #f 8 7)
% (binary 54 #t 8 7)
% (binary-order 27 #f 8 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(30,40,1,60,0,1,964952,4,2027,964976,50,2060,964976,40,2060,965006,0,2060)
% 
% 
% START OF PROOF
% 964978 [] p17(f9(f10(f14(f4(f9(c19)),c19),f15(f4(f6(f7(f8(c20))))))),f6(f7(f8(c20)))).
% 964979 [] p3(f12(f15(f4(f6(f7(f8(c20))))),c21),f15(f4(f6(f7(f8(c20)))))).
% 964982 [] p3(f10(X,Y),f10(Z,U)) | -p3(X,Z) | -p3(Y,U).
% 964986 [] -p17(X,Y) | -p2(Y,U) | -p2(X,Z) | p17(Z,U).
% 964987 [] -p3(X,Z) | -p3(X,Y) | p3(Z,Y).
% 964994 [] p2(f9(X),f9(Y)) | -p3(X,Y).
% 965000 [] p3(X,X).
% 965002 [] p2(X,X).
% 965006 [] -p17(f9(f10(f14(f4(f9(c19)),c19),f12(X,c21))),f6(f7(f8(c20)))).
% 965038 [binary:965000,964987.2] -p3(X,Y) | p3(Y,X).
% 965056 [binary:964979,965038] p3(f15(f4(f6(f7(f8(c20))))),f12(f15(f4(f6(f7(f8(c20))))),c21)).
% 965111 [binary:965000,964982.2] p3(f10(X,Y),f10(X,Z)) | -p3(Y,Z).
% 965198 [binary:965002,964986.2] -p17(X,Y) | -p2(X,Z) | p17(Z,Y).
% 965211 [binary:965006,965198.3] -p2(X,f9(f10(f14(f4(f9(c19)),c19),f12(Y,c21)))) | -p17(X,f6(f7(f8(c20)))).
% 965240 [binary:964978,965211.2,binarydemod:965111,964994,slowcut:965056] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 7
% clause depth limited to 8
% seconds given: 10
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    610
%  derived clauses:   1067345
%  kept clauses:      77203
%  kept size sum:     2503
%  kept mid-nuclei:   8177
%  kept new demods:   0
%  forw unit-subs:    95276
%  forw double-subs: 2
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  5
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  20.60
%  process. runtime:  20.59
% specific non-discr-tree subsumption statistics: 
%  tried:           191
%  length fails:    0
%  strength fails:  11
%  predlist fails:  167
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 13
%  full subs fail:  13
% 
% ; 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/SYN610-1+noeq.in")
% 
%------------------------------------------------------------------------------