%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : PUZ035-6 : 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 : 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/PUZ/PUZ035-6+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 4 5)
% (binary-unit 10 #f 4 5)
% (binary-double 16 #f 4 5)
% (binary 54 #t 4 5)
% (binary-order 27 #f 4 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)
% 
% 
% SOS clause 
% -truth(isa(asked,X)) | -truth(isa(other,Y)).
% was split for some strategies as: 
% -truth(isa(asked,X)).
% -truth(isa(other,Y)).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(11,40,1,25,0,1)
% 
% 
% START OF PROOF
% 12 [] truth(isa(X,knight)) | truth(isa(X,knave)).
% 23 [] $spltprd0($spltcnst1) | -truth(isa(asked,X)).
% 24 [] $spltprd0($spltcnst2) | -truth(isa(other,X)).
% 25 [] -$spltprd0($spltcnst2) | -$spltprd0($spltcnst1).
% 154 [hyper:23,12] truth(isa(asked,knave)) | $spltprd0($spltcnst1).
% 156 [hyper:24,12] truth(isa(other,knave)) | $spltprd0($spltcnst2).
% 187 [hyper:23,154] $spltprd0($spltcnst1).
% 199 [hyper:24,156] $spltprd0($spltcnst2).
% 208 [hyper:25,199,cut:187] 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 4
% seconds given: 9
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    18
%  derived clauses:   383
%  kept clauses:      88
%  kept size sum:     858
%  kept mid-nuclei:   78
%  kept new demods:   0
%  forw unit-subs:    23
%  forw double-subs: 131
%  forw overdouble-subs: 0
%  backward subs:     8
%  fast unit cutoff:  2
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.0
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           12
%  length fails:    0
%  strength fails:  0
%  predlist fails:  9
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 3
%  full subs fail:  3
% 
% ; 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-6+noeq.in")
% 
%------------------------------------------------------------------------------