TSTP Solution File: SWV335-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV335-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 : art09.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/SystemOnTPTP12411/SWV/SWV335-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(9,40,0,18,0,0,23,50,0,32,0,0)
%
%
% START OF PROOF
% 24 [] -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(Y,c_^message_^osynth(Z),tc_^message_^omsg).
% 25 [] 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).
% 26 [] -c_in(c_^message_^omsg_^o^nonce(X),c_^message_^osynth(Y),tc_^message_^omsg) | c_in(c_^message_^omsg_^o^nonce(X),Y,tc_^message_^omsg).
% 27 [] -c_in(X,c_^message_^oanalz(Y),tc_^message_^omsg) | c_in(X,c_^message_^oparts(Y),tc_^message_^omsg).
% 28 [] -c_in(X,c_union(Y,Z,U),U) | c_in(X,Z,U) | c_in(X,Y,U).
% 29 [] c_in(v_^x,c_^message_^osynth(c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),tc_^message_^omsg).
% 30 [] -c_in(c_^message_^omsg_^o^nonce(v_^n^b),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg).
% 31 [] c_in(c_^message_^omsg_^o^crypt(v_^k,c_^message_^omsg_^o^nonce(v_^n^b)),c_^message_^oparts(c_insert(v_^x,c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf),tc_^message_^omsg)),tc_^message_^omsg).
% 32 [] -c_in(c_^message_^omsg_^o^crypt(v_^k,c_^message_^omsg_^o^nonce(v_^n^b)),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg).
% 36 [hyper:25,31,cut:29] c_in(c_^message_^omsg_^o^crypt(v_^k,c_^message_^omsg_^o^nonce(v_^n^b)),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).
% 38 [hyper:28,36,cut:32] c_in(c_^message_^omsg_^o^crypt(v_^k,c_^message_^omsg_^o^nonce(v_^n^b)),c_^message_^osynth(c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),tc_^message_^omsg).
% 39 [hyper:24,38] c_in(c_^message_^omsg_^o^nonce(v_^n^b),c_^message_^osynth(c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),tc_^message_^omsg) | c_in(c_^message_^omsg_^o^crypt(v_^k,c_^message_^omsg_^o^nonce(v_^n^b)),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg).
% 45 [hyper:27,39,cut:32] c_in(c_^message_^omsg_^o^nonce(v_^n^b),c_^message_^osynth(c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),tc_^message_^omsg).
% 48 [hyper:26,45,cut:30] 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: 22
% derived clauses: 29
% kept clauses: 5
% kept size sum: 66
% kept mid-nuclei: 4
% kept new demods: 0
% forw unit-subs: 4
% forw double-subs: 1
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 5
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.10
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 1
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 1
% full subs fail: 1
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP12411/SWV/SWV335-2+noeq.in")
% Killed 1 orphans
%
%------------------------------------------------------------------------------