%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN009-2 : 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 : art02.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/SYN009-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: small
% 
% strategies selected: 
% (hyper 27 #f 1 11)
% (binary-unit 10 #f 1 11)
% (binary-double 16 #f)
% (binary 16 #t 1 11)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 1 11)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(8,40,1,16,0,1)
% 
% 
% START OF PROOF
% 9 [] r(X,Y,Z) | q(Z,X,Y) | p(Y,Z,X) | -s(Z) | -s(X) | -s(Y).
% 10 [] t(c,c,c).
% 11 [] s(c).
% 14 [] -t(X,Y,Z) | -p(X,Y,Z).
% 15 [] -q(X,Y,Z) | -t(Y,Z,X).
% 16 [] -r(X,Y,Z) | -t(Z,X,Y).
% 20 [hyper:9,11,11,11] r(c,c,c) | q(c,c,c) | p(c,c,c).
% 97 [hyper:14,20,cut:10] r(c,c,c) | q(c,c,c).
% 101 [hyper:15,97,cut:10] r(c,c,c).
% 103 [hyper:16,101,cut:10] 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 11
% clause depth limited to 1
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    10
%  derived clauses:   107
%  kept clauses:      32
%  kept size sum:     356
%  kept mid-nuclei:   49
%  kept new demods:   0
%  forw unit-subs:    2
%  forw double-subs: 3
%  forw overdouble-subs: 15
%  backward subs:     2
%  fast unit cutoff:  9
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.2
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           103
%  length fails:    0
%  strength fails:  88
%  predlist fails:  0
%  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/SYN009-2+noeq.in")
% 
%------------------------------------------------------------------------------