TSTP Solution File: SWV326-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV326-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 : art10.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% 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/SystemOnTPTP11879/SWV/SWV326-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: small
%
% strategies selected:
% (hyper 27 #f 5 3)
% (binary-unit 10 #f 5 3)
% (binary-double 10 #f 5 3)
% (binary-double 16 #f)
% (binary-double 10 #t)
% (binary 16 #t 5 3)
% (binary-order 27 #f 5 3)
% (binary-posweight-order 125 #f)
% (binary-posweight-lex-big-order 43 #f)
% (binary-posweight-lex-small-order 16 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-weightorder 65 #f)
% (binary-order 27 #f)
% (hyper-order 37 #f)
% (binary 63 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(9,40,0,18,0,0,33,50,0,42,0,0,57,50,0,66,0,0,81,50,0,90,0,0,105,50,0,114,0,0,129,50,0,138,0,0,153,50,0,162,0,0,177,50,0,186,0,0,201,50,0,210,0,0,225,50,0,234,0,0,249,50,1,258,0,1,273,50,1,282,0,1,297,50,1,306,0,1,321,50,1,330,0,1,345,50,1,354,0,1,369,50,1,378,0,1,393,50,1,402,0,1,417,50,1,417,40,1,426,0,1)
%
%
% START OF PROOF
% 418 [] equal(X,X).
% 419 [] -c_in(X,c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,Y)),tc_^message_^omsg) | c_in(X,c_^event_^oused(Y),tc_^message_^omsg).
% 420 [] -c_in(c_^message_^omsg_^o^m^pair(X,Y),c_^message_^oparts(Z),tc_^message_^omsg) | c_in(X,c_^message_^oparts(Z),tc_^message_^omsg).
% 421 [] -c_in(c_^message_^omsg_^o^crypt(X,Y),c_^message_^oparts(Z),tc_^message_^omsg) | c_in(Y,c_^message_^oparts(Z),tc_^message_^omsg).
% 422 [] -c_in(c_^message_^omsg_^o^nonce(v_^n^aa),c_^event_^oused(v_evs1),tc_^message_^omsg).
% 423 [] 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^m^pair(c_^message_^omsg_^o^agent(v_^a),c_^message_^omsg_^o^agent(v_^c)))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs1)),tc_^message_^omsg) | equal(v_^c,v_^ba).
% 425 [] c_in(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^aa),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^nonce(v_^n^aa),c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^aa),c_^message_^omsg_^o^agent(v_^b)))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs1)),tc_^message_^omsg) | -equal(v_^ba,v_^c).
% 426 [] equal(v_^n^a,c_^message_^omsg_^o^nonce(v_^n^aa)).
% 434 [binary:422,419.2,demod:426] -c_in(v_^n^a,c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs1)),tc_^message_^omsg).
% 435 [binary:420.2,434] -c_in(c_^message_^omsg_^o^m^pair(v_^n^a,X),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs1)),tc_^message_^omsg).
% 438 [binary:421.2,435] -c_in(c_^message_^omsg_^o^crypt(X,c_^message_^omsg_^o^m^pair(v_^n^a,Y)),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs1)),tc_^message_^omsg).
% 440 [para:426.1.2,425.1.1.2.1,cut:438] -equal(v_^ba,v_^c).
% 441 [para:423.2.2,440.1.1,cut:418,cut:438] 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 3
% clause depth limited to 5
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 251
% derived clauses: 428
% kept clauses: 94
% kept size sum: 1198
% kept mid-nuclei: 0
% kept new demods: 36
% forw unit-subs: 73
% forw double-subs: 85
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 2
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.3
% process. runtime: 0.1
% 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/SystemOnTPTP11879/SWV/SWV326-2+eq_r.in")
%
%------------------------------------------------------------------------------