%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN628-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 : art08.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/SYN628-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: medium
% detected subclass: long
% 
% strategies selected: 
% (hyper 57 #f 6 7)
% (binary-unit 28 #f 6 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 6 7)
% (binary 28 #t 6 7)
% (hyper 28 #t)
% (hyper 159 #f)
% (binary-posweight-order 85 #f)
% (binary-weightorder 39 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 47 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(36,40,1,72,0,1)
% 
% 
% START OF PROOF
% 38 [] p20(f16(f17(c28,c27)),f10(f15(f7(c23,f8(c24,c25)),c28),f11(f12(f13(f14(c29)))))).
% 40 [] p9(f10(X,Y),f10(Z,U)) | -p9(X,Z) | -p9(Y,U).
% 41 [] p9(f15(X,Y),f15(Z,U)) | -p9(Y,U) | -p2(X,Z).
% 42 [] p9(f17(X,Y),f17(Z,U)) | -p9(X,Z) | -p9(Y,U).
% 45 [] -p20(X,Y) | -p9(Y,U) | -p9(X,Z) | p20(Z,U).
% 58 [] p9(f16(X),f16(Y)) | -p9(X,Y).
% 65 [] p9(c28,c22).
% 69 [] p9(X,X).
% 70 [] p2(X,X).
% 72 [] -p20(f16(f17(c22,c27)),f10(f15(f7(c23,f8(c24,c25)),c22),f11(f12(f13(f14(c29)))))).
% 112 [hyper:41,65,70] p9(f15(X,c28),f15(X,c22)).
% 114 [hyper:42,65,69] p9(f17(c28,X),f17(c22,X)).
% 393 [hyper:40,112,69] p9(f10(f15(X,c28),Y),f10(f15(X,c22),Y)).
% 522 [hyper:58,114] p9(f16(f17(c28,X)),f16(f17(c22,X))).
% 50706 [hyper:45,393,38,522,cut:72] 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 6
% seconds given: 57
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    165
%  derived clauses:   99728
%  kept clauses:      47129
%  kept size sum:     0
%  kept mid-nuclei:   3483
%  kept new demods:   0
%  forw unit-subs:    49083
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  2
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  1.68
%  process. runtime:  1.68
% specific non-discr-tree subsumption statistics: 
%  tried:           662
%  length fails:    0
%  strength fails:  15
%  predlist fails:  647
%  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/SYN628-1+noeq.in")
% 
%------------------------------------------------------------------------------