%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : PUZ035-2 : TPTP v3.4.2. Released v2.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/PUZ035-2+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 7)
% (binary-unit 10 #f 1 7)
% (binary-double 16 #f 1 7)
% (binary 54 #t 1 7)
% (binary-order 27 #f 1 7)
% (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)
% 
% 
% SOS clause 
% -response(X) | -isa(asked,Y) | -isa(other,Z).
% was split for some strategies as: 
% -response(X).
% -isa(asked,Y).
% -isa(other,Z).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(16,40,0,36,0,0)
% 
% 
% START OF PROOF
% 17 [] isa(X,knight) | isa(X,knave) | -person(X).
% 29 [] response(yes) | response(no).
% 30 [] person(asked).
% 31 [] person(other).
% 33 [] $spltprd0($spltcnst1) | -response(X).
% 34 [] $spltprd0($spltcnst2) | -isa(asked,X).
% 35 [] $spltprd0($spltcnst3) | -isa(other,X).
% 36 [] -$spltprd0($spltcnst2) | -$spltprd0($spltcnst1) | -$spltprd0($spltcnst3).
% 37 [hyper:17,30] isa(asked,knave) | isa(asked,knight).
% 39 [hyper:17,31] isa(other,knave) | isa(other,knight).
% 46 [hyper:33,29] $spltprd0($spltcnst1) | response(no).
% 65 [hyper:33,46] $spltprd0($spltcnst1).
% 78 [hyper:34,37] isa(asked,knight) | $spltprd0($spltcnst2).
% 101 [hyper:34,78] $spltprd0($spltcnst2).
% 164 [hyper:35,39] isa(other,knight) | $spltprd0($spltcnst3).
% 220 [hyper:35,164] $spltprd0($spltcnst3).
% 222 [hyper:36,220,cut:65,cut:101] 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 7
% clause depth limited to 1
% seconds given: 9
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    32
%  derived clauses:   434
%  kept clauses:      42
%  kept size sum:     215
%  kept mid-nuclei:   115
%  kept new demods:   0
%  forw unit-subs:    35
%  forw double-subs: 174
%  forw overdouble-subs: 21
%  backward subs:     23
%  fast unit cutoff:  5
%  full unit cutoff:  1
%  dbl  unit cutoff:  2
%  real runtime  :  0.1
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           131
%  length fails:    10
%  strength fails:  34
%  predlist fails:  64
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 1
%  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/PUZ035-2+noeq.in")
% 
%------------------------------------------------------------------------------