%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN713-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/SYN713-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: big
% 
% strategies selected: 
% (hyper 30 #f 4 7)
% (binary-unit 30 #f 4 7)
% (binary-double 18 #f 4 7)
% (binary 90 #t 4 7)
% (binary-order 30 #f 4 7)
% (binary-posweight-order 54 #f)
% (binary-order-sos 30 #t)
% (binary-unit-uniteq 30 #f)
% (binary-weightorder 30 #f)
% (binary-weightorder-sos 30 #f)
% (binary-order 30 #f)
% (hyper-order 30 #f)
% (binary 168 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(105,40,0,210,0,0)
% 
% 
% START OF PROOF
% 106 [] p58(f31(f33(c75,c76),f23(c69,X)),f19(f22(c70,c69),Y)) | -p59(f38(c72,X),f35(c73,Y)) | p13(Y,f23(c74,X)).
% 110 [] -p56(f11(c65,f14(f17(c66,X),f23(c74,Y))),Z) | p57(f26(f41(c78,Z),X),Y).
% 124 [] p4(f11(X,Y),f11(Z,U)) | -p9(X,Z) | -p10(Y,U).
% 130 [] p10(f14(X,Y),f14(Z,U)) | -p12(X,Z) | -p13(Y,U).
% 134 [] -p56(X,Y) | -p4(X,Z) | -p40(Y,U) | p56(Z,U).
% 136 [] p57(f26(f28(c71,X),Y),Z) | -p57(f26(X,Y),Z).
% 171 [] p56(f11(c65,f14(f17(c66,c67),c68)),c64).
% 174 [] p59(f38(c72,c77),f35(c73,c68)).
% 175 [] p12(X,X).
% 195 [] p40(X,X).
% 207 [] p9(X,X).
% 209 [] -p57(f26(f28(c71,f41(c78,c64)),c67),c77).
% 210 [] -p58(f31(f33(c75,c76),f23(c69,c77)),f19(f22(c70,c69),c68)).
% 309 [hyper:106,174,cut:210] p13(c68,f23(c74,c77)).
% 322 [hyper:130,309,175] p10(f14(X,c68),f14(X,f23(c74,c77))).
% 447 [hyper:124,322,207] p4(f11(X,f14(Y,c68)),f11(X,f14(Y,f23(c74,c77)))).
% 685 [hyper:134,447,171,195] p56(f11(c65,f14(f17(c66,c67),f23(c74,c77))),c64).
% 693 [hyper:110,685] p57(f26(f41(c78,c64),c67),c77).
% 703 [hyper:136,693,cut:209] 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: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    130
%  derived clauses:   935
%  kept clauses:      52
%  kept size sum:     620
%  kept mid-nuclei:   375
%  kept new demods:   0
%  forw unit-subs:    357
%  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:  0.2
%  process. runtime:  0.2
% specific non-discr-tree subsumption statistics: 
%  tried:           15
%  length fails:    0
%  strength fails:  7
%  predlist fails:  8
%  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/SYN713-1+noeq.in")
% 
%------------------------------------------------------------------------------