%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN569-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 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/SYN569-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 3 9)
% (binary-unit 28 #f 3 9)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 3 9)
% (binary 28 #t 3 9)
% (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(20,40,0,40,0,0)
% 
% 
% START OF PROOF
% 24 [] p2(f4(X,Y),f4(Z,U)) | -p2(X,Z) | -p2(Y,U).
% 25 [] p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),c15)).
% 28 [] p9(c13,f3(X),X) | -p10(X,c12) | -p10(c11,X).
% 29 [] -p9(X,U,Z) | -p9(X,Y,Z) | p2(U,Y).
% 30 [] -p2(X,Z) | -p2(X,Y) | p2(Z,Y).
% 33 [] -p8(X,Y) | p10(X,Y).
% 34 [] p9(c13,c15,c14).
% 35 [] p8(c11,c14).
% 37 [] p8(c14,c12).
% 39 [] p2(X,X).
% 40 [] -p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X))) | -p8(c11,X) | -p8(X,c12).
% 60 [hyper:33,35] p10(c11,c14).
% 71 [hyper:33,37] p10(c14,c12).
% 76 [hyper:28,60,cut:71] p9(c13,f3(c14),c14).
% 102 [hyper:29,76,34] p2(c15,f3(c14)).
% 183 [hyper:24,102,39] p2(f4(X,c15),f4(X,f3(c14))).
% 399 [hyper:30,25,39] p2(f4(f5(c12,c11),c15),f5(f7(c13,c12),f7(c13,c11))).
% 534 [hyper:30,399,183] p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(c14))).
% 545 [hyper:40,534,cut:35,cut:37] 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 9
% clause depth limited to 3
% seconds given: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    48
%  derived clauses:   1135
%  kept clauses:      29
%  kept size sum:     227
%  kept mid-nuclei:   462
%  kept new demods:   0
%  forw unit-subs:    335
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  4
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.2
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           175
%  length fails:    0
%  strength fails:  12
%  predlist fails:  163
%  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/SYN569-1+noeq.in")
% 
%------------------------------------------------------------------------------