%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN611-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 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/SYN611-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 7 7)
% (binary-unit 10 #f 7 7)
% (binary-double 16 #f 7 7)
% (binary 54 #t 7 7)
% (binary-order 27 #f 7 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,0,60,0,0,1041111,4,2026,1041135,50,2058,1041135,40,2058,1041165,0,2058)
% 
% 
% START OF PROOF
% 1041137 [] p17(f9(f10(f14(f4(f9(c19)),c19),f4(f6(f7(f8(c20)))))),f6(f7(f8(c20)))).
% 1041141 [] p3(f10(X,Y),f10(Z,U)) | -p3(X,Z) | -p3(Y,U).
% 1041143 [] p3(f12(f4(f6(f7(f8(c20)))),c21),f4(f6(f7(f8(c20))))).
% 1041145 [] -p17(X,Y) | -p2(Y,U) | -p2(X,Z) | p17(Z,U).
% 1041146 [] -p3(X,Z) | -p3(X,Y) | p3(Z,Y).
% 1041153 [] p2(f9(X),f9(Y)) | -p3(X,Y).
% 1041159 [] p3(X,X).
% 1041161 [] p2(X,X).
% 1041165 [] -p17(f9(f10(f14(f4(f9(c19)),c19),f12(X,c21))),f6(f7(f8(c20)))).
% 1041192 [binary:1041159,1041146.2] -p3(X,Y) | p3(Y,X).
% 1041253 [binary:1041159,1041141.2] p3(f10(X,Y),f10(X,Z)) | -p3(Y,Z).
% 1041297 [binary:1041192,1041143] p3(f4(f6(f7(f8(c20)))),f12(f4(f6(f7(f8(c20)))),c21)).
% 1041370 [binary:1041161,1041145.2] -p17(X,Y) | -p2(X,Z) | p17(Z,Y).
% 1041385 [binary:1041165,1041370.3] -p2(X,f9(f10(f14(f4(f9(c19)),c19),f12(Y,c21)))) | -p17(X,f6(f7(f8(c20)))).
% 1041422 [binary:1041137,1041385.2,binarydemod:1041253,1041153,slowcut:1041297] 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 7
% seconds given: 10
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    617
%  derived clauses:   1140247
%  kept clauses:      77221
%  kept size sum:     2823
%  kept mid-nuclei:   8441
%  kept new demods:   0
%  forw unit-subs:    93805
%  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.58
%  process. runtime:  20.58
% specific non-discr-tree subsumption statistics: 
%  tried:           210
%  length fails:    0
%  strength fails:  11
%  predlist fails:  182
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 17
%  full subs fail:  17
% 
% ; 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/SYN611-1+noeq.in")
% 
%------------------------------------------------------------------------------