%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN088-1.010 : TPTP v3.4.2. Released v1.0.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art05.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/SYN088-1.010+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 1 21)
% (binary-unit 28 #f 1 21)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 1 21)
% (binary 28 #t 1 21)
% (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(22,40,0,44,0,0)
% 
% 
% START OF PROOF
% 23 [] p(X,Y,Z,U,V,W,X1,X2,X3,X4) | -q_10(X4) | -q_9(X3) | -q_8(X2) | -q_7(X1) | -q_6(W) | -q_5(V) | -q_4(U) | -q_3(Z) | -q_2(Y) | -q_1(X).
% 24 [] q_1(a).
% 26 [] q_2(a).
% 28 [] q_3(a).
% 30 [] q_4(a).
% 32 [] q_5(a).
% 34 [] q_6(a).
% 36 [] q_7(a).
% 38 [] q_8(a).
% 40 [] q_9(a).
% 42 [] q_10(a).
% 44 [] -p(a,a,a,a,a,a,a,a,a,a).
% 2097 [hyper:23,42,40,38,36,34,32,30,28,26,24,cut:44] 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 21
% clause depth limited to 1
% seconds given: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    21
%  derived clauses:   2053
%  kept clauses:      510
%  kept size sum:     5610
%  kept mid-nuclei:   1541
%  kept new demods:   0
%  forw unit-subs:    0
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.5
%  process. runtime:  0.3
% specific non-discr-tree subsumption statistics: 
%  tried:           26
%  length fails:    0
%  strength fails:  26
%  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/SYN088-1.010+noeq.in")
% 
%------------------------------------------------------------------------------