TSTP Solution File: SWV286-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV286-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 : art04.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% 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/SystemOnTPTP12058/SWV/SWV286-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: small
%
% strategies selected:
% (hyper 27 #f 11 9)
% (binary-unit 10 #f 11 9)
% (binary-double 16 #f)
% (binary 16 #t 11 9)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 11 9)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
% **** EMPTY CLAUSE DERIVED ****
% By given clause simplification.
%
%
% timer checkpoints: c(8,40,0,16,0,0)
%
%
% START OF PROOF
% 9 [] -c_in(c_^event_^oevent_^o^says(X,Y,c_^message_^omsg_^o^m^pair(Z,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(X),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(Y),c_^message_^omsg_^o^crypt(c_^public_^oshr^k(X),c_^message_^omsg_^o^m^pair(Z,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(X),c_^message_^omsg_^o^agent(Y)))))))),c_^list_^oset(U,tc_^event_^oevent),tc_^event_^oevent) | c_in(c_^event_^oevent_^o^says(c_^message_^oagent_^o^server,Y,c_^message_^omsg_^o^m^pair(Z,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(X),c_^message_^omsg_^o^m^pair(Z,c_^message_^omsg_^o^key(V))),c_^message_^omsg_^o^crypt(c_^public_^oshr^k(Y),c_^message_^omsg_^o^m^pair(v_sko__u8o(X,Y,V,Z,U),c_^message_^omsg_^o^key(V)))))),c_^list_^oset(U,tc_^event_^oevent),tc_^event_^oevent) | -c_in(c_^event_^oevent_^o^says(W,X,c_^message_^omsg_^o^m^pair(Z,c_^message_^omsg_^o^crypt(c_^public_^oshr^k(X),c_^message_^omsg_^o^m^pair(Z,c_^message_^omsg_^o^key(V))))),c_^list_^oset(U,tc_^event_^oevent),tc_^event_^oevent) | -c_in(U,c_^otway^rees_^ootway,tc_^list_^olist(tc_^event_^oevent)) | c_in(X,c_^event_^obad,tc_^message_^oagent).
% 10 [] c_in(c_^event_^oevent_^o^says(X,c_^message_^oagent_^o^server,c_^message_^omsg_^o^m^pair(Y,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(Z),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(X),c_^message_^omsg_^o^m^pair(v_sko__v^eb(Z,X,Y,U,V),c_^message_^omsg_^o^crypt(c_^public_^oshr^k(X),c_^message_^omsg_^o^m^pair(Y,c_^message_^omsg_^o^m^pair(U,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(Z),c_^message_^omsg_^o^agent(X)))))))))),c_^list_^oset(V,tc_^event_^oevent),tc_^event_^oevent) | -c_in(c_^event_^oevent_^o^says(c_^message_^oagent_^o^server,X,c_^message_^omsg_^o^m^pair(Y,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(Z),c_^message_^omsg_^o^m^pair(Y,c_^message_^omsg_^o^key(W))),c_^message_^omsg_^o^crypt(c_^public_^oshr^k(X),c_^message_^omsg_^o^m^pair(U,c_^message_^omsg_^o^key(W)))))),c_^list_^oset(V,tc_^event_^oevent),tc_^event_^oevent) | -c_in(V,c_^otway^rees_^ootway,tc_^list_^olist(tc_^event_^oevent)) | c_in(X,c_^event_^obad,tc_^message_^oagent).
% 11 [] c_in(c_^event_^oevent_^o^says(v_^b_^h,v_^a,c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^a),c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^key(v_^k))))),c_^list_^oset(v_evs,tc_^event_^oevent),tc_^event_^oevent).
% 12 [] c_in(c_^event_^oevent_^o^says(v_^a,v_^b,c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^a),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^b),c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^a),c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^a),c_^message_^omsg_^o^agent(v_^b)))))))),c_^list_^oset(v_evs,tc_^event_^oevent),tc_^event_^oevent).
% 13 [] -c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 14 [] -c_in(v_^b,c_^event_^obad,tc_^message_^oagent).
% 15 [] c_in(v_evs,c_^otway^rees_^ootway,tc_^list_^olist(tc_^event_^oevent)).
% 16 [] -c_in(c_^event_^oevent_^o^says(v_^b,c_^message_^oagent_^o^server,c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^a),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^b),c_^message_^omsg_^o^m^pair(X,c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^b),c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^m^pair(Y,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^a),c_^message_^omsg_^o^agent(v_^b)))))))))),c_^list_^oset(v_evs,tc_^event_^oevent),tc_^event_^oevent).
% 21 [hyper:9,12,11,cut:15,cut:13] c_in(c_^event_^oevent_^o^says(c_^message_^oagent_^o^server,v_^b,c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^a),c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^key(v_^k))),c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^b),c_^message_^omsg_^o^m^pair(v_sko__u8o(v_^a,v_^b,v_^k,v_^n^a,v_evs),c_^message_^omsg_^o^key(v_^k)))))),c_^list_^oset(v_evs,tc_^event_^oevent),tc_^event_^oevent).
% 23 [hyper:10,21,cut:15,cut:16,cut:14] 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 11
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 8
% derived clauses: 7
% kept clauses: 2
% kept size sum: 79
% kept mid-nuclei: 4
% kept new demods: 0
% forw unit-subs: 0
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 5
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 3
% length fails: 0
% strength fails: 1
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 2
% full subs fail: 2
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP12058/SWV/SWV286-2+noeq.in")
%
%------------------------------------------------------------------------------