TSTP Solution File: SWV314-2 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWV314-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 : art05.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2795MHz
% 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/SystemOnTPTP22270/SWV/SWV314-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: small
% 
% strategies selected: 
% (hyper 27 #f 7 11)
% (binary-unit 10 #f 7 11)
% (binary-double 16 #f)
% (binary 16 #t 7 11)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 7 11)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% **** EMPTY CLAUSE DERIVED ****
% By given clause simplification.
% 
% 
% timer checkpoints: c(7,40,0,14,0,0)
% 
% 
% START OF PROOF
% 8 [] -c_in(c_^event_^oevent_^o^says(c_^message_^oagent_^o^server,X,c_^message_^omsg_^o^m^pair(Y,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(Z),c_^message_^omsg_^o^m^pair(Y,c_^message_^omsg_^o^key(U))),c_^message_^omsg_^o^crypt(c_^public_^oshr^k(X),c_^message_^omsg_^o^m^pair(V,c_^message_^omsg_^o^key(U)))))),c_^list_^oset(W,tc_^event_^oevent),tc_^event_^oevent) | c_in(c_^event_^oevent_^o^notes(c_^message_^oagent_^o^spy,c_^message_^omsg_^o^m^pair(Y,c_^message_^omsg_^o^m^pair(V,c_^message_^omsg_^o^key(U)))),c_^list_^oset(W,tc_^event_^oevent),tc_^event_^oevent) | -c_in(c_^message_^omsg_^o^key(U),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,W)),tc_^message_^omsg) | -c_in(W,c_^otway^rees_^ootway,tc_^list_^olist(tc_^event_^oevent)) | c_in(Z,c_^event_^obad,tc_^message_^oagent) | c_in(X,c_^event_^obad,tc_^message_^oagent).
% 9 [] c_in(c_^event_^oevent_^o^says(c_^message_^oagent_^o^server,v_^b,c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^a),c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^key(v_^k))),c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^b),c_^message_^omsg_^o^m^pair(v_^n^b,c_^message_^omsg_^o^key(v_^k)))))),c_^list_^oset(v_evs,tc_^event_^oevent),tc_^event_^oevent).
% 10 [] -c_in(c_^event_^oevent_^o^notes(c_^message_^oagent_^o^spy,c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^m^pair(v_^n^b,c_^message_^omsg_^o^key(v_^k)))),c_^list_^oset(v_evs,tc_^event_^oevent),tc_^event_^oevent).
% 11 [] -c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 12 [] -c_in(v_^b,c_^event_^obad,tc_^message_^oagent).
% 13 [] c_in(v_evs,c_^otway^rees_^ootway,tc_^list_^olist(tc_^event_^oevent)).
% 14 [] c_in(c_^message_^omsg_^o^key(v_^k),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs)),tc_^message_^omsg).
% 18 [hyper:8,9,cut:14,cut:13,cut:10,cut:11,cut:12] 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 11
% clause depth limited to 7
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    7
%  derived clauses:   4
%  kept clauses:      1
%  kept size sum:     21
%  kept mid-nuclei:   2
%  kept new demods:   0
%  forw unit-subs:    0
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  3
%  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/SystemOnTPTP22270/SWV/SWV314-2+noeq.in")
% 
%------------------------------------------------------------------------------