↑ Up

Gandalf---c-2.6.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWV329-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 : art06.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/SystemOnTPTP23664/SWV/SWV329-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 4 5)
% (binary-unit 10 #f 4 5)
% (binary-double 16 #f)
% (binary 16 #t 4 5)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 4 5)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(10,40,0,20,0,0,26,50,0,36,0,0)
% 
% 
% START OF PROOF
% 27 [] -c_in(c_^message_^omsg_^o^crypt(X,Y),c_^message_^osynth(Z),tc_^message_^omsg) | c_in(c_^message_^omsg_^o^crypt(X,Y),Z,tc_^message_^omsg) | c_in(c_^message_^omsg_^o^key(X),Z,tc_^message_^omsg).
% 28 [] c_in(X,c_union(c_^message_^osynth(c_^message_^oanalz(Y)),c_^message_^oparts(Y),tc_^message_^omsg),tc_^message_^omsg) | -c_in(X,c_^message_^oparts(c_insert(Z,Y,tc_^message_^omsg)),tc_^message_^omsg) | -c_in(Z,c_^message_^osynth(c_^message_^oanalz(Y)),tc_^message_^omsg).
% 29 [] -c_in(X,c_^message_^oanalz(Y),tc_^message_^omsg) | c_in(X,c_^message_^oparts(Y),tc_^message_^omsg).
% 30 [] -c_in(X,c_union(Y,Z,U),U) | c_in(X,Z,U) | c_in(X,Y,U).
% 31 [] -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(X)),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,Y)),tc_^message_^omsg) | -c_in(Y,c_^yahalom_^oyahalom,tc_^list_^olist(tc_^event_^oevent)) | c_in(X,c_^event_^obad,tc_^message_^oagent).
% 32 [] c_in(v_evsf,c_^yahalom_^oyahalom,tc_^list_^olist(tc_^event_^oevent)).
% 33 [] c_in(v_^x,c_^message_^osynth(c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),tc_^message_^omsg).
% 34 [] c_in(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^key(v_^k))),c_^message_^oparts(c_insert(v_^x,c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf),tc_^message_^omsg)),tc_^message_^omsg).
% 35 [] -c_in(v_^b,c_^event_^obad,tc_^message_^oagent).
% 36 [] -c_in(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^key(v_^k))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg).
% 40 [hyper:28,34,cut:33] c_in(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^key(v_^k))),c_union(c_^message_^osynth(c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg),tc_^message_^omsg).
% 44 [hyper:30,40,cut:36] c_in(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^key(v_^k))),c_^message_^osynth(c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),tc_^message_^omsg).
% 45 [hyper:27,44] c_in(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^key(v_^k))),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg) | c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^b)),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg).
% 48 [hyper:29,45,cut:36] c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^b)),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg).
% 52 [hyper:31,48,cut:32] c_in(v_^b,c_^event_^obad,tc_^message_^oagent).
% 54 [hyper:35,52] 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 5
% clause depth limited to 5
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    25
%  derived clauses:   35
%  kept clauses:      9
%  kept size sum:     126
%  kept mid-nuclei:   3
%  kept new demods:   0
%  forw unit-subs:    4
%  forw double-subs: 3
%  forw overdouble-subs: 0
%  backward subs:     1
%  fast unit cutoff:  7
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.2
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  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/SystemOnTPTP23664/SWV/SWV329-2+noeq.in")
% 
%------------------------------------------------------------------------------