TSTP Solution File: SWV332-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV332-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 : art10.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/SystemOnTPTP12297/SWV/SWV332-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 9 7)
% (binary-unit 9 #f 9 7)
% (binary-double 9 #f 9 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 9 7)
% (binary-order 25 #f 9 7)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% SOS clause
% -equal(X,v_^x) | -equal(v_^b,v_^ba) | -equal(v_^a,v_^aa).
% was split for some strategies as:
% -equal(X,v_^x).
% -equal(v_^b,v_^ba).
% -equal(v_^a,v_^aa).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(16,40,0,32,0,0,130,50,0,146,0,0)
%
%
% START OF PROOF
% 87 [?] ?
% 133 [] -c_in(c_^message_^omsg_^o^m^pair(X,Y),c_^message_^oanalz(Z),tc_^message_^omsg) | c_in(Y,c_^message_^oanalz(Z),tc_^message_^omsg).
% 134 [] -c_in(c_^message_^omsg_^o^m^pair(X,Y),c_^message_^oanalz(Z),tc_^message_^omsg) | c_in(X,c_^message_^oanalz(Z),tc_^message_^omsg).
% 135 [] -c_in(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(X),Y),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,Z)),tc_^message_^omsg) | c_in(Y,c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,Z)),tc_^message_^omsg) | -c_in(X,c_^event_^obad,tc_^message_^oagent).
% 138 [] 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)).
% 141 [] c_in(v_evs4,c_^yahalom_^oyahalom,tc_^list_^olist(tc_^event_^oevent)).
% 143 [] c_in(c_^event_^oevent_^o^gets(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^a),c_^message_^omsg_^o^nonce(v_^n^b))))),v_^x)),c_^list_^oset(v_evs4,tc_^event_^oevent),tc_^event_^oevent).
% 144 [] -c_in(c_^message_^omsg_^o^key(v_^k),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4)),tc_^message_^omsg).
% 155 [hyper:138,143,cut:141] c_in(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^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).
% 162 [hyper:134,155] c_in(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^a),c_^message_^omsg_^o^nonce(v_^n^b))))),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4)),tc_^message_^omsg).
% 167 [hyper:135,162,cut:87] c_in(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^a),c_^message_^omsg_^o^nonce(v_^n^b)))),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4)),tc_^message_^omsg).
% 169 [hyper:133,167] c_in(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^a),c_^message_^omsg_^o^nonce(v_^n^b))),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4)),tc_^message_^omsg).
% 175 [hyper:134,169,cut:144] 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 7
% clause depth limited to 10
% seconds given: 12
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 54
% derived clauses: 159
% kept clauses: 35
% kept size sum: 775
% kept mid-nuclei: 61
% kept new demods: 0
% forw unit-subs: 29
% forw double-subs: 7
% forw overdouble-subs: 0
% backward subs: 12
% fast unit cutoff: 45
% full unit cutoff: 4
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 22
% length fails: 6
% strength fails: 12
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 4
% full subs fail: 4
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP12297/SWV/SWV332-2+eq_r.in")
%
%------------------------------------------------------------------------------