%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV340-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/SystemOnTPTP4686/SWV/SWV340-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: short
%
% strategies selected:
% (binary-posweight-order 57 #f 8 5)
% (binary-unit 28 #f 8 5)
% (binary-double 28 #f 8 5)
% (binary 45 #t 8 5)
% (hyper 11 #t 8 5)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(12,40,0,24,0,0)
%
%
% START OF PROOF
% 14 [] -c_in(X,c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,Y)),tc_^message_^omsg) | c_in(X,c_^event_^oused(Y),tc_^message_^omsg).
% 15 [] -c_in(c_^message_^omsg_^o^m^pair(X,Y),c_^message_^oparts(Z),tc_^message_^omsg) | c_in(Y,c_^message_^oparts(Z),tc_^message_^omsg).
% 16 [] -c_in(c_^message_^omsg_^o^m^pair(X,Y),c_^message_^oparts(Z),tc_^message_^omsg) | c_in(X,c_^message_^oparts(Z),tc_^message_^omsg).
% 17 [] -c_in(c_^message_^omsg_^o^crypt(X,Y),c_^message_^oparts(Z),tc_^message_^omsg) | c_in(Y,c_^message_^oparts(Z),tc_^message_^omsg).
% 18 [] c_in(X,c_^message_^oparts(Y),tc_^message_^omsg) | -c_in(X,Y,tc_^message_^omsg).
% 19 [] equal(c_^message_^oparts(c_^message_^oanalz(X)),c_^message_^oparts(X)).
% 20 [] c_in(X,c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,Y)),tc_^message_^omsg) | -c_in(c_^event_^oevent_^o^gets(Z,X),c_^list_^oset(Y,tc_^event_^oevent),tc_^event_^oevent) | -c_in(Y,c_^yahalom_^oyahalom,tc_^list_^olist(tc_^event_^oevent)).
% 21 [] c_in(v_evs4,c_^yahalom_^oyahalom,tc_^list_^olist(tc_^event_^oevent)).
% 22 [] c_in(c_^event_^oevent_^o^gets(v_^a,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^a),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^b),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^key(v_^ka),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(v_^n^a),c_^message_^omsg_^o^nonce(v_^n^b))))),v_^x)),c_^list_^oset(v_evs4,tc_^event_^oevent),tc_^event_^oevent).
% 23 [] -c_in(c_^message_^omsg_^o^key(v_^k),c_^event_^oused(v_evs4),tc_^message_^omsg).
% 24 [] equal(v_^k,v_^ka).
% 25 [para:24.1.1,23.1.1.1] -c_in(c_^message_^omsg_^o^key(v_^ka),c_^event_^oused(v_evs4),tc_^message_^omsg).
% 32 [binary:22,20.2,cut:21] c_in(c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^a),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^b),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^key(v_^ka),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(v_^n^a),c_^message_^omsg_^o^nonce(v_^n^b))))),v_^x),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4)),tc_^message_^omsg).
% 33 [binary:18.2,32,demod:19] c_in(c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^a),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^b),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^key(v_^ka),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(v_^n^a),c_^message_^omsg_^o^nonce(v_^n^b))))),v_^x),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4)),tc_^message_^omsg).
% 36 [binary:16,33] c_in(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^a),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^b),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^key(v_^ka),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(v_^n^a),c_^message_^omsg_^o^nonce(v_^n^b))))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4)),tc_^message_^omsg).
% 48 [binary:17,36] c_in(c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^b),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^key(v_^ka),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(v_^n^a),c_^message_^omsg_^o^nonce(v_^n^b)))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4)),tc_^message_^omsg).
% 56 [binary:15,48] c_in(c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^key(v_^ka),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(v_^n^a),c_^message_^omsg_^o^nonce(v_^n^b))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4)),tc_^message_^omsg).
% 77 [binary:16,56] c_in(c_^message_^omsg_^o^key(v_^ka),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4)),tc_^message_^omsg).
% 80 [binary:14,77,cut:25] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos 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 5
% clause depth limited to 8
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 51
% derived clauses: 74
% kept clauses: 49
% kept size sum: 643
% kept mid-nuclei: 0
% kept new demods: 2
% forw unit-subs: 11
% forw double-subs: 3
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 2
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.0
% 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/SystemOnTPTP4686/SWV/SWV340-2+eq_r.in")
%
%------------------------------------------------------------------------------