%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN718-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 : art10.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/SYN718-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 7 7)
% (binary-unit 30 #f 7 7)
% (binary-double 18 #f 7 7)
% (binary 90 #t 7 7)
% (binary-order 30 #f 7 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(118,40,1,236,0,1)
% 
% 
% START OF PROOF
% 128 [] -p57(f26(f30(c85,X),U),Y) | -p57(f26(f30(c85,X),Y),Z) | p57(f26(f30(c85,X),U),Z).
% 133 [] p21(f22(X,Y),f22(Z,U)) | -p20(X,Z) | -p3(Y,U).
% 153 [] p57(f26(c70,f22(f24(c71,c79),c80)),f22(f24(c71,c81),c82)).
% 154 [] p57(f26(c70,f22(f24(c71,c81),c82)),f22(f24(c71,c83),c84)).
% 158 [] -p57(X,Y) | -p21(Y,Z) | -p25(X,U) | p57(U,Z).
% 162 [] p57(f26(f30(c85,X),Y),Z) | -p57(f26(X,Y),Z).
% 197 [] p3(c84,f10(c72,c73)).
% 207 [] p20(X,X).
% 210 [] p25(X,X).
% 234 [] -p57(f26(f30(c85,c70),f22(f24(c71,c79),c80)),f22(f24(c71,c83),f10(c72,c73))).
% 352 [hyper:133,197,207] p21(f22(X,c84),f22(X,f10(c72,c73))).
% 1053 [hyper:162,153] p57(f26(f30(c85,c70),f22(f24(c71,c79),c80)),f22(f24(c71,c81),c82)).
% 1272 [hyper:162,154] p57(f26(f30(c85,c70),f22(f24(c71,c81),c82)),f22(f24(c71,c83),c84)).
% 5289 [hyper:128,1272,1053] p57(f26(f30(c85,c70),f22(f24(c71,c79),c80)),f22(f24(c71,c83),c84)).
% 5344 [hyper:158,5289,210,352,cut:234] 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 7
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    271
%  derived clauses:   11358
%  kept clauses:      2059
%  kept size sum:     60026
%  kept mid-nuclei:   2918
%  kept new demods:   0
%  forw unit-subs:    2572
%  forw double-subs: 1701
%  forw overdouble-subs: 1544
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.36
%  process. runtime:  0.35
% specific non-discr-tree subsumption statistics: 
%  tried:           135951
%  length fails:    17693
%  strength fails:  39504
%  predlist fails:  29153
%  aux str. fails:  3296
%  by-lit fails:    6788
%  full subs tried: 15794
%  full subs fail:  14616
% 
% ; 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/SYN718-1+noeq.in")
% 
%------------------------------------------------------------------------------