%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : PUZ027-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 : 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/PUZ/PUZ027-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 3 7)
% (binary-unit 10 #f 3 7)
% (binary-double 16 #f 3 7)
% (binary 54 #t 3 7)
% (binary-order 27 #f 3 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)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(32,40,0,64,0,0)
% 
% 
% START OF PROOF
% 33 [] a_truth(liar(X)) | a_truth(normal(X)) | a_truth(truthteller(X)).
% 34 [] -a_truth(truthteller(X)) | -a_truth(normal(X)).
% 38 [] -a_truth(says(X,Y)) | -a_truth(liar(X)) | -a_truth(Y).
% 40 [] -a_truth(says(X,Y)) | a_truth(liar(X)) | a_truth(normal(X)) | a_truth(Y).
% 43 [] a_truth(not_lower(X,Y)) | a_truth(lower(X,Y)).
% 45 [] -a_truth(lower(X,Y)) | -a_truth(normal(X)) | a_truth(truthteller(Y)).
% 46 [] -a_truth(lower(X,Y)) | -a_truth(truthteller(X)).
% 53 [] a_truth(says(a,lower(a,b))).
% 54 [] a_truth(says(b,not_lower(a,b))).
% 58 [] -a_truth(truthteller(b)) | -a_truth(normal(a)) | answer(a_normal_b_truthteller).
% 59 [] -a_truth(normal(b)) | -a_truth(normal(a)) | answer(a_and_b_normal).
% 61 [] -a_truth(truthteller(b)) | -a_truth(liar(a)) | answer(a_liar_b_truthteller).
% 62 [] -a_truth(normal(b)) | -a_truth(liar(a)) | answer(a_liar_b_normal).
% 64 [] -answer(X).
% 74 [hyper:40,53] a_truth(lower(a,b)) | a_truth(normal(a)) | a_truth(liar(a)).
% 211 [hyper:46,74,33] a_truth(normal(a)) | a_truth(liar(a)).
% 252 [hyper:38,211,53,43] a_truth(not_lower(a,b)) | a_truth(normal(a)).
% 377 [hyper:45,252,43,factor] a_truth(not_lower(a,b)) | a_truth(truthteller(b)).
% 403 [hyper:38,54,33,binarycut:377] a_truth(normal(b)) | a_truth(truthteller(b)).
% 411 [hyper:58,403,211,cut:64] a_truth(normal(b)) | a_truth(liar(a)).
% 416 [hyper:59,403,211,cut:64] a_truth(truthteller(b)) | a_truth(liar(a)).
% 463 [hyper:61,411,403,cut:64] a_truth(normal(b)).
% 465 [hyper:34,411,binarycut:416] a_truth(liar(a)).
% 470 [hyper:62,463,cut:465] answer(a_liar_b_normal).
% 486 [hyper:64,470] 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 3
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    34
%  derived clauses:   727
%  kept clauses:      94
%  kept size sum:     965
%  kept mid-nuclei:   283
%  kept new demods:   0
%  forw unit-subs:    82
%  forw double-subs: 111
%  forw overdouble-subs: 82
%  backward subs:     12
%  fast unit cutoff:  113
%  full unit cutoff:  0
%  dbl  unit cutoff:  4
%  real runtime  :  0.2
%  process. runtime:  0.2
% specific non-discr-tree subsumption statistics: 
%  tried:           626
%  length fails:    57
%  strength fails:  131
%  predlist fails:  39
%  aux str. fails:  24
%  by-lit fails:    32
%  full subs tried: 208
%  full subs fail:  178
% 
% ; 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/PUZ027-1+noeq.in")
% 
%------------------------------------------------------------------------------