%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV360-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/SystemOnTPTP24145/SWV/SWV360-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 9)
% (binary-unit 10 #f 7 9)
% (binary-double 10 #f 7 9)
% (binary-double 16 #f)
% (binary-double 10 #t)
% (binary 16 #t 7 9)
% (binary-order 27 #f 7 9)
% (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)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(8,40,0,16,0,0)
%
%
% START OF PROOF
% 10 [] -c_in(c_^event_^oevent_^o^says(X,Y,c_^message_^omsg_^o^m^pair(Z,c_^message_^omsg_^o^crypt(c_^public_^oshr^k(U),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(V),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(W),X1))))),c_^list_^oset(X2,tc_^event_^oevent),tc_^event_^oevent) | -c_in(c_^event_^oevent_^o^gets(X3,c_^message_^omsg_^o^m^pair(X4,c_^message_^omsg_^o^crypt(c_^public_^oshr^k(X5),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(X6),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(X7),X1))))),c_^list_^oset(X2,tc_^event_^oevent),tc_^event_^oevent) | c_in(X1,c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,X2)),tc_^message_^omsg) | -c_in(X2,c_^yahalom_^oyahalom,tc_^list_^olist(tc_^event_^oevent)) | equal(X5,U).
% 11 [] -c_in(v_^b,c_^event_^obad,tc_^message_^oagent).
% 12 [] c_in(v_evs3,c_^yahalom_^oyahalom,tc_^list_^olist(tc_^event_^oevent)).
% 13 [] c_in(c_^event_^oevent_^o^gets(c_^message_^oagent_^o^server,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^ba),c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^ba),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^aa),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(v_^n^aa),c_^message_^omsg_^o^nonce(v_^n^b)))))),c_^list_^oset(v_evs3,tc_^event_^oevent),tc_^event_^oevent).
% 14 [] c_in(c_^event_^oevent_^o^says(v_^b,c_^message_^oagent_^o^server,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^b),c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^b),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^a),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(v_^n^a),c_^message_^omsg_^o^nonce(v_^n^b)))))),c_^list_^oset(v_evs3,tc_^event_^oevent),tc_^event_^oevent).
% 15 [] -c_in(c_^message_^omsg_^o^nonce(v_^n^b),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs3)),tc_^message_^omsg).
% 16 [] c_in(v_^ba,c_^event_^obad,tc_^message_^oagent).
% 20 [hyper:10,14,13,cut:12,cut:15] equal(v_^ba,v_^b).
% 21 [para:20.1.1,16.1.1,cut:11] 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 9
% clause depth limited to 7
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 8
% derived clauses: 5
% kept clauses: 1
% kept size sum: 3
% kept mid-nuclei: 3
% kept new demods: 1
% forw unit-subs: 0
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 4
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 1
% length fails: 0
% strength fails: 1
% 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/SystemOnTPTP24145/SWV/SWV360-2+eq_r.in")
%
%------------------------------------------------------------------------------