TSTP Solution File: SWV353-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV353-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/SystemOnTPTP5360/SWV/SWV353-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 8 9)
% (binary-unit 10 #f 8 9)
% (binary-double 10 #f 8 9)
% (binary-double 16 #f)
% (binary-double 10 #t)
% (binary 16 #t 8 9)
% (binary-order 27 #f 8 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)
%
%
% SOS clause
% -equal(X,c_^message_^omsg_^o^key(v_^k)) | -equal(v_^n^a,v_^n^aa).
% was split for some strategies as:
% -equal(X,c_^message_^omsg_^o^key(v_^k)).
% -equal(v_^n^a,v_^n^aa).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(8,40,0,16,0,0,33,50,0,41,0,0,58,50,0,66,0,0,83,50,0,91,0,0,108,50,0,116,0,0,133,50,0,141,0,0,158,50,1,166,0,1,183,50,1,191,0,1,208,50,1,216,0,1,233,50,1,241,0,1,258,50,1,266,0,1,283,50,1,291,0,1,308,50,1,316,0,1,333,50,1,341,0,1,358,50,1,358,40,1,366,0,2)
%
%
% START OF PROOF
% 359 [] equal(X,X).
% 360 [] -c_in(c_^event_^oevent_^o^says(c_^message_^oagent_^o^server,X,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(X),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(Y),c_^message_^omsg_^o^m^pair(Z,c_^message_^omsg_^o^m^pair(U,V)))),W)),c_^list_^oset(X1,tc_^event_^oevent),tc_^event_^oevent) | c_in(c_^event_^oevent_^o^gets(c_^message_^oagent_^o^server,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(Y),c_^message_^omsg_^o^crypt(c_^public_^oshr^k(Y),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(X),c_^message_^omsg_^o^m^pair(U,V))))),c_^list_^oset(X1,tc_^event_^oevent),tc_^event_^oevent) | -c_in(X1,c_^yahalom_^oyahalom,tc_^list_^olist(tc_^event_^oevent)).
% 361 [] -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(X7,W).
% 362 [] c_in(v_evso,c_^yahalom_^oyahalom,tc_^list_^olist(tc_^event_^oevent)).
% 363 [] c_in(c_^event_^oevent_^o^says(c_^message_^oagent_^o^server,v_^aa,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^aa),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^ba),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^key(v_^k),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(v_^n^aa),c_^message_^omsg_^o^nonce(v_^n^b))))),v_^x)),c_^list_^oset(v_evso,tc_^event_^oevent),tc_^event_^oevent).
% 364 [] 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_evso,tc_^event_^oevent),tc_^event_^oevent).
% 365 [] -c_in(c_^message_^omsg_^o^nonce(v_^n^b),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evso)),tc_^message_^omsg).
% 366 [?] ?
% 368 [input:366,slowcut:359] -equal(v_^n^a,v_^n^aa).
% 371 [binary:363,360,cut:362] 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_evso,tc_^event_^oevent),tc_^event_^oevent).
% 377 [binary:364,361,cut:365,cut:362] -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_evso,tc_^event_^oevent),tc_^event_^oevent) | equal(V,v_^n^a).
% 383 [binary:371,377] equal(v_^n^aa,v_^n^a).
% 386 [para:383.1.1,368.1.2,cut:359] 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 8
% seconds given: 4
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 181
% derived clauses: 359
% kept clauses: 68
% kept size sum: 1355
% kept mid-nuclei: 126
% kept new demods: 15
% forw unit-subs: 113
% forw double-subs: 2
% forw overdouble-subs: 1
% backward subs: 0
% fast unit cutoff: 105
% full unit cutoff: 15
% dbl unit cutoff: 0
% real runtime : 0.4
% process. runtime: 0.2
% specific non-discr-tree subsumption statistics:
% tried: 39
% length fails: 0
% strength fails: 38
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 1
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP5360/SWV/SWV353-2+eq_r.in")
%
%------------------------------------------------------------------------------