%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWV331-2 : TPTP v3.4.2. Released v3.2.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art10.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% 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: /tmp/SystemOnTPTP12159/SWV/SWV331-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: small
% detected subclass: long
% 
% strategies selected: 
% (hyper 57 #f 4 7)
% (binary-unit 28 #f 4 7)
% (binary-double 28 #f 4 7)
% (binary-posweight-order 28 #f 4 7)
% (binary-unit 62 #f)
% (hyper 159 #f)
% (binary-posweight-order 154 #f)
% (binary-weightorder 28 #f)
% (binary-order 28 #f)
% (binary 28 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(6,40,0,12,0,0)
% 
% 
% START OF PROOF
% 7 [] -c_in(c_^message_^omsg_^o^crypt(X,Y),Z,tc_^message_^omsg) | c_in(X,c_^message_^okeys^for(Z),tc_nat) | -c_in(X,c_^message_^osym^keys,tc_nat).
% 8 [] -c_in(X,c_^message_^okeys^for(c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,Y))),tc_nat) | c_in(c_^message_^omsg_^o^key(X),c_^event_^oused(Y),tc_^message_^omsg) | -c_in(Y,c_^yahalom_^oyahalom,tc_^list_^olist(tc_^event_^oevent)) | -c_in(X,c_^message_^osym^keys,tc_nat).
% 9 [] c_in(v_evs3,c_^yahalom_^oyahalom,tc_^list_^olist(tc_^event_^oevent)).
% 10 [] -c_in(c_^message_^omsg_^o^key(v_^k),c_^event_^oused(v_evs3),tc_^message_^omsg).
% 11 [] c_in(v_^k,c_^message_^osym^keys,tc_nat).
% 12 [] c_in(c_^message_^omsg_^o^crypt(v_^k,c_^message_^omsg_^o^nonce(v_^n^b)),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs3)),tc_^message_^omsg).
% 16 [hyper:7,12,cut:11] c_in(v_^k,c_^message_^okeys^for(c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs3))),tc_nat).
% 17 [hyper:8,16,cut:9,cut:11] c_in(c_^message_^omsg_^o^key(v_^k),c_^event_^oused(v_evs3),tc_^message_^omsg).
% 19 [hyper:10,17] 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 4
% seconds given: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    7
%  derived clauses:   8
%  kept clauses:      2
%  kept size sum:     14
%  kept mid-nuclei:   3
%  kept new demods:   0
%  forw unit-subs:    1
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  2
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           2
%  length fails:    0
%  strength fails:  2
%  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" "/tmp/SystemOnTPTP12159/SWV/SWV331-2+noeq.in")
% 
%------------------------------------------------------------------------------