%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWV319-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 : art07.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/SystemOnTPTP3873/SWV/SWV319-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: small
% 
% strategies selected: 
% (hyper 27 #f 7 3)
% (binary-unit 10 #f 7 3)
% (binary-double 10 #f 7 3)
% (binary-double 16 #f)
% (binary-double 10 #t)
% (binary 16 #t 7 3)
% (binary-order 27 #f 7 3)
% (binary-posweight-order 125 #f)
% (binary-posweight-lex-big-order 43 #f)
% (binary-posweight-lex-small-order 16 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-weightorder 65 #f)
% (binary-order 27 #f)
% (hyper-order 37 #f)
% (binary 63 #t)
% 
% 
% SOS clause 
% c_in(v_^a,c_^event_^obad,tc_^message_^oagent) | -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evso)),tc_^message_^omsg).
% was split for some strategies as: 
% c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evso)),tc_^message_^omsg).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(10,40,0,20,0,0,35,50,0,45,0,0,60,50,0,70,0,0,85,50,0,95,0,0,110,50,0,120,0,0,135,50,0,145,0,0,160,50,0,170,0,0,185,50,0,195,0,0,210,50,0,220,0,0,235,50,0,245,0,0,260,50,1,270,0,1,285,50,1,295,0,1,310,50,1,320,0,1,335,50,1,345,0,1,360,50,1,370,0,1,385,50,1,385,40,1,395,0,1)
% 
% 
% START OF PROOF
% 385 [?] ?
% 393 [] -c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 394 [?] ?
% 395 [?] ?
% 396 [input:395,cut:393] equal(c_^public_^oshr^k(v_^a),v_^k).
% 401 [input:394,cut:393] -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evso)),tc_^message_^omsg).
% 402 [para:396.1.1,401.1.1.1,cut:385] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 3
% clause depth limited to 7
% seconds given: 4
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    279
%  derived clauses:   444
%  kept clauses:      120
%  kept size sum:     1755
%  kept mid-nuclei:   0
%  kept new demods:   0
%  forw unit-subs:    212
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  18
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.3
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  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/SystemOnTPTP3873/SWV/SWV319-2+eq_r.in")
% 
%------------------------------------------------------------------------------