%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : PUZ001-1 : 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 : 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/PUZ/PUZ001-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: medium
% 
% strategies selected: 
% (hyper 27 #f 1 5)
% (binary-unit 10 #f 1 5)
% (binary-double 16 #f 1 5)
% (binary 54 #t 1 5)
% (binary-order 27 #f 1 5)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(12,40,1,24,0,1)
% 
% 
% START OF PROOF
% 13 [] killed(butler,agatha) | killed(charles,agatha).
% 14 [] hates(butler,X) | richer(X,agatha) | -lives(X).
% 15 [] -hates(agatha,X) | hates(butler,X).
% 16 [] -killed(X,Y) | hates(X,Y).
% 17 [] hates(agatha,charles).
% 18 [] hates(agatha,agatha).
% 20 [] lives(butler).
% 22 [] -richer(X,Y) | -killed(X,Y).
% 23 [] -hates(agatha,X) | -hates(charles,X).
% 24 [] -hates(X,butler) | -hates(X,charles) | -hates(X,agatha).
% 26 [hyper:14,20] hates(butler,butler) | richer(butler,agatha).
% 30 [hyper:15,17] hates(butler,charles).
% 33 [hyper:15,18] hates(butler,agatha).
% 52 [hyper:24,26,cut:30,cut:33] richer(butler,agatha).
% 55 [hyper:22,52,13] killed(charles,agatha).
% 58 [hyper:16,55] hates(charles,agatha).
% 61 [hyper:23,58,cut:18] 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: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    18
%  derived clauses:   48
%  kept clauses:      10
%  kept size sum:     45
%  kept mid-nuclei:   18
%  kept new demods:   0
%  forw unit-subs:    9
%  forw double-subs: 2
%  forw overdouble-subs: 0
%  backward subs:     4
%  fast unit cutoff:  6
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  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/PUZ/PUZ001-1+noeq.in")
% 
%------------------------------------------------------------------------------