TSTP Solution File: SWV347-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV347-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 : art02.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/SystemOnTPTP27974/SWV/SWV347-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,27,50,0,35,0,0,46,50,0,54,0,0,65,50,0,73,0,0,84,50,0,92,0,0,103,50,0,111,0,0,122,50,0,130,0,0,141,50,0,149,0,0,160,50,0,168,0,1,179,50,1,187,0,1,198,50,1,206,0,1,217,50,1,225,0,1,236,50,1,244,0,1,255,50,1,263,0,1,274,50,1,282,0,1,293,50,1,293,40,1,301,0,1)
%
%
% START OF PROOF
% 295 [] -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(X6,V).
% 296 [] -c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 297 [] c_in(v_^aa,c_^event_^obad,tc_^message_^oagent).
% 298 [] c_in(v_evs3,c_^yahalom_^oyahalom,tc_^list_^olist(tc_^event_^oevent)).
% 299 [] 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).
% 300 [] 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).
% 301 [] -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).
% 306 [binary:300,295,cut:301,cut:298] -c_in(c_^event_^oevent_^o^gets(X,c_^message_^omsg_^o^m^pair(Y,c_^message_^omsg_^o^crypt(c_^public_^oshr^k(Z),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(U),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(V),c_^message_^omsg_^o^nonce(v_^n^b)))))),c_^list_^oset(v_evs3,tc_^event_^oevent),tc_^event_^oevent) | equal(U,v_^a).
% 309 [binary:299,306] equal(v_^aa,v_^a).
% 312 [para:309.1.2,296.1.1,cut:297] 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 9
% clause depth limited to 7
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 160
% derived clauses: 281
% kept clauses: 38
% kept size sum: 607
% kept mid-nuclei: 120
% kept new demods: 16
% forw unit-subs: 105
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 109
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.3
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 33
% length fails: 0
% strength fails: 33
% 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/SystemOnTPTP27974/SWV/SWV347-2+eq_r.in")
%
%------------------------------------------------------------------------------