TSTP Solution File: SWV307-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV307-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 : art04.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 10.0s
% Output : Assurance 10.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/SystemOnTPTP13112/SWV/SWV307-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 6 7)
% (binary-unit 28 #f 6 7)
% (binary-double 11 #f 6 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 6 7)
% (binary-order 28 #f 6 7)
% (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)
%
%
% SOS clause
% -c_in(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^a),c_^message_^omsg_^o^m^pair(v_^n^a_^h,c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^a_^h),c_^message_^omsg_^o^agent(v_^a))))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs2)),tc_^message_^omsg) | -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_^b)))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs2)),tc_^message_^omsg).
% was split for some strategies as:
% -c_in(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^a),c_^message_^omsg_^o^m^pair(v_^n^a_^h,c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^agent(v_^a_^h),c_^message_^omsg_^o^agent(v_^a))))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs2)),tc_^message_^omsg).
% -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_^b)))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs2)),tc_^message_^omsg).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(1482,40,7,2964,0,13,110355,4,990,111220,5,1314,111221,5,1318,111221,1,1318,111221,50,1324,111221,40,1324,112703,0,1325)
%
%
% START OF PROOF
% 111227 [] -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).
% 111230 [] -c_in(c_^message_^omsg_^o^m^pair(X,Y),c_^event_^oused(Z),tc_^message_^omsg) | c_in(X,c_^event_^oused(Z),tc_^message_^omsg).
% 111259 [] -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).
% 112696 [] -c_in(c_^message_^omsg_^o^nonce(v_^n^b),c_^event_^oused(v_evs2),tc_^message_^omsg).
% 112698 [] 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_^b)))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs2)),tc_^message_^omsg).
% 112700 [] equal(v_^n^a,c_^message_^omsg_^o^nonce(v_^n^b)).
% 112728 [binary:112698,111227] c_in(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_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs2)),tc_^message_^omsg).
% 112734 [binary:112696,111230.2,demod:112700] -c_in(c_^message_^omsg_^o^m^pair(v_^n^a,X),c_^event_^oused(v_evs2),tc_^message_^omsg).
% 112853 [binary:112728,111259,cut:112734] 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 7
% clause depth limited to 6
% seconds given: 13
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2017
% derived clauses: 155410
% kept clauses: 77103
% kept size sum: 928
% kept mid-nuclei: 7975
% kept new demods: 45
% forw unit-subs: 26023
% forw double-subs: 3527
% forw overdouble-subs: 257
% backward subs: 21
% fast unit cutoff: 205
% full unit cutoff: 220
% dbl unit cutoff: 0
% real runtime : 13.25
% process. runtime: 13.23
% specific non-discr-tree subsumption statistics:
% tried: 927
% length fails: 31
% strength fails: 35
% predlist fails: 12
% aux str. fails: 1
% by-lit fails: 16
% full subs tried: 822
% full subs fail: 565
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP13112/SWV/SWV307-1+eq_r.in")
% WARNING: TreeLimitedRun lost 9.97s, total lost is 9.97s
%
%------------------------------------------------------------------------------