TSTP Solution File: SWV313-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV313-1 : 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/SystemOnTPTP22130/SWV/SWV313-1+eq_r.in
%
% Some predicates or functions were curried and renamed.
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: big
%
% strategies selected:
% (hyper 28 #f 7 11)
% (binary-unit 28 #f 7 11)
% (binary-double 11 #f 7 11)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 7 11)
% (binary-order 28 #f 7 11)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(1479,40,7,2958,0,13)
%
%
% START OF PROOF
% 1572 [] c_in(X,c_^message_^oanalz(Y),tc_^message_^omsg) | -c_in(X,Y,tc_^message_^omsg).
% 2952 [] -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(U))),c_^message_^omsg_^o^crypt(c_^public_^oshr^k(X),c_^message_^omsg_^o^m^pair(V,c_^message_^omsg_^o^key(U)))))),c_^list_^oset(W,tc_^event_^oevent),tc_^event_^oevent) | c_in(c_^event_^oevent_^o^notes(c_^message_^oagent_^o^spy,c_^message_^omsg_^o^m^pair(Y,c_^message_^omsg_^o^m^pair(V,c_^message_^omsg_^o^key(U)))),c_^list_^oset(W,tc_^event_^oevent),tc_^event_^oevent) | -c_in(c_^message_^omsg_^o^key(U),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,W)),tc_^message_^omsg) | -c_in(W,c_^otway^rees_^ootway,tc_^list_^olist(tc_^event_^oevent)) | c_in(Z,c_^event_^obad,tc_^message_^oagent) | c_in(X,c_^event_^obad,tc_^message_^oagent).
% 2953 [] 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_^n^b,c_^message_^omsg_^o^key(v_^k)))))),c_^list_^oset(v_evs,tc_^event_^oevent),tc_^event_^oevent).
% 2954 [] -c_in(c_^event_^oevent_^o^notes(c_^message_^oagent_^o^spy,c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^m^pair(v_^n^b,c_^message_^omsg_^o^key(v_^k)))),c_^list_^oset(v_evs,tc_^event_^oevent),tc_^event_^oevent).
% 2955 [] -c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 2956 [] -c_in(v_^b,c_^event_^obad,tc_^message_^oagent).
% 2957 [] c_in(v_evs,c_^otway^rees_^ootway,tc_^list_^olist(tc_^event_^oevent)).
% 2958 [] c_in(c_^message_^omsg_^o^key(v_^k),c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs),tc_^message_^omsg).
% 2997 [hyper:1572,2958] c_in(c_^message_^omsg_^o^key(v_^k),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs)),tc_^message_^omsg).
% 3044 [hyper:2952,2997,2953,cut:2957,cut:2954,cut:2955,cut:2956] 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 11
% clause depth limited to 7
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 33
% derived clauses: 386
% kept clauses: 38
% kept size sum: 614
% kept mid-nuclei: 47
% kept new demods: 11
% forw unit-subs: 295
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 3
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.12
% process. runtime: 0.11
% specific non-discr-tree subsumption statistics:
% tried: 2
% length fails: 0
% strength fails: 2
% 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/SystemOnTPTP22130/SWV/SWV313-1+eq_r.in")
%
%------------------------------------------------------------------------------