TSTP Solution File: SWV288-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV288-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 34.7s
% Output : Assurance 34.7s
% 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/SystemOnTPTP20604/SWV/SWV288-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 9 9)
% (binary-unit 28 #f 9 9)
% (binary-double 11 #f 9 9)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 9 9)
% (binary-order 28 #f 9 9)
% (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(1478,40,7,2956,0,14,291405,4,2124,292529,5,2815,292530,5,2821,292531,1,2821,292531,50,2829,292531,40,2829,294009,0,2834)
%
%
% START OF PROOF
% 292533 [] c_in(X,c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,Y)),tc_^message_^omsg) | -c_in(c_^event_^oevent_^o^says(Z,U,X),c_^list_^oset(Y,tc_^event_^oevent),tc_^event_^oevent).
% 292536 [] -c_in(X,c_^message_^oanalz(Y),tc_^message_^omsg) | c_in(X,c_^message_^oparts(Y),tc_^message_^omsg).
% 292609 [] -c_in(c_^message_^omsg_^o^m^pair(X,Y),c_^message_^oparts(Z),tc_^message_^omsg) | c_in(Y,c_^message_^oparts(Z),tc_^message_^omsg).
% 294003 [] -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($ganapfun5($ganc76,X,Y,V,Z,U),c_^message_^omsg_^o^key(V)))))),c_^list_^oset(U,tc_^event_^oevent),tc_^event_^oevent) | -c_in(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_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,U)),tc_^message_^omsg) | -c_in(U,c_^otway^rees_^ootway,tc_^list_^olist(tc_^event_^oevent)) | c_in(X,c_^event_^obad,tc_^message_^oagent).
% 294005 [] 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).
% 294006 [] 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).
% 294007 [] -c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 294008 [] c_in(v_evs,c_^otway^rees_^ootway,tc_^list_^olist(tc_^event_^oevent)).
% 294009 [] -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(X,c_^message_^omsg_^o^key(v_^k)))))),c_^list_^oset(v_evs,tc_^event_^oevent),tc_^event_^oevent).
% 294029 [binary:294006,292533.2] c_in(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_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs)),tc_^message_^omsg).
% 294033 [binary:294029,292536] c_in(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_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs)),tc_^message_^omsg).
% 294738 [binary:294033,292609] c_in(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_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs)),tc_^message_^omsg).
% 327994 [binary:294009,294003.2,cut:294005,cut:294738,cut:294008,cut:294007] 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 9
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 4123
% derived clauses: 390409
% kept clauses: 109740
% kept size sum: 419700
% kept mid-nuclei: 10735
% kept new demods: 55
% forw unit-subs: 59635
% forw double-subs: 6848
% forw overdouble-subs: 538
% backward subs: 33
% fast unit cutoff: 444
% full unit cutoff: 302
% dbl unit cutoff: 0
% real runtime : 36.20
% process. runtime: 35.85
% specific non-discr-tree subsumption statistics:
% tried: 3363
% length fails: 72
% strength fails: 60
% predlist fails: 453
% aux str. fails: 13
% by-lit fails: 17
% full subs tried: 2541
% full subs fail: 2003
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP20604/SWV/SWV288-1+eq_r.in")
% WARNING: TreeLimitedRun lost 34.67s, total lost is 34.67s
%
%------------------------------------------------------------------------------