%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : PUZ025-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 : art04.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/PUZ025-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(24,40,0,48,0,0)
% 
% 
% START OF PROOF
% 25 [] a_truth(truthteller(X)) | a_truth(liar(X)).
% 38 [] answer(yes) | -a_truth(truthteller(X)) | -ask_1_if_2(X,Y) | -a_truth(Y).
% 39 [] answer(no) | -a_truth(truthteller(X)) | -ask_1_if_2(X,Y) | a_truth(Y).
% 40 [] answer(no) | -a_truth(liar(X)) | -ask_1_if_2(X,Y) | -a_truth(Y).
% 41 [] answer(yes) | -a_truth(liar(X)) | -ask_1_if_2(X,Y) | a_truth(Y).
% 47 [] ask_1_if_2(c,equal_type(a,b)).
% 48 [] -answer(X).
% 98 [hyper:39,25,47,cut:48] a_truth(equal_type(a,b)) | a_truth(liar(c)).
% 233 [hyper:41,98,47,cut:48] a_truth(equal_type(a,b)).
% 245 [hyper:38,233,47,25,cut:48] a_truth(liar(c)).
% 247 [hyper:40,233,47,cut:245] answer(no).
% 248 [hyper:48,247] 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:    17
%  derived clauses:   262
%  kept clauses:      53
%  kept size sum:     484
%  kept mid-nuclei:   136
%  kept new demods:   0
%  forw unit-subs:    19
%  forw double-subs: 13
%  forw overdouble-subs: 17
%  backward subs:     5
%  fast unit cutoff:  6
%  full unit cutoff:  1
%  dbl  unit cutoff:  1
%  real runtime  :  0.0
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           163
%  length fails:    6
%  strength fails:  21
%  predlist fails:  35
%  aux str. fails:  0
%  by-lit fails:    3
%  full subs tried: 60
%  full subs fail:  54
% 
% ; 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/PUZ025-1+noeq.in")
% 
%------------------------------------------------------------------------------