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

% Computer : art09.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/SYN011-1+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 5)
% (binary-unit 10 #f 1 5)
% (binary-double 16 #f)
% (binary 16 #t 1 5)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 1 5)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
% 
% 
% SOS clause 
% -n(0) | -t(0).
% was split for some strategies as: 
% -n(0).
% -t(0).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(8,40,0,16,0,0)
% 
% 
% START OF PROOF
% 9 [] t(0).
% 10 [] r(0) | p(0) | n(0).
% 11 [] -q(0) | l(0).
% 12 [] -m(0) | l(0).
% 13 [] q(0) | m(0) | n(0).
% 14 [] -t(0) | -n(0).
% 15 [] -p(0) | -l(0).
% 16 [] -r(0) | -l(0).
% 23 [hyper:14,10,cut:9] r(0) | p(0).
% 35 [hyper:14,13,cut:9] q(0) | m(0).
% 40 [hyper:11,35,binarycut:12] l(0).
% 42 [hyper:15,40,23] r(0).
% 43 [hyper:16,40,cut:42] 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 5
% clause depth limited to 1
% seconds given: 13
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    11
%  derived clauses:   30
%  kept clauses:      5
%  kept size sum:     16
%  kept mid-nuclei:   10
%  kept new demods:   0
%  forw unit-subs:    0
%  forw double-subs: 5
%  forw overdouble-subs: 0
%  backward subs:     9
%  fast unit cutoff:  4
%  full unit cutoff:  0
%  dbl  unit cutoff:  2
%  real runtime:  0.0
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  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/SYN011-1+noeq.in")
% 
%------------------------------------------------------------------------------