TSTP Solution File: SWV326-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV326-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 : 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 34.8s
% Output : Assurance 34.8s
% 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/SystemOnTPTP11669/SWV/SWV326-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 5 7)
% (binary-unit 28 #f 5 7)
% (binary-double 11 #f 5 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 7)
% (binary-order 28 #f 5 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)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
% **** EMPTY CLAUSE DERIVED ****
% By given clause simplification.
%
%
% timer checkpoints: c(1512,40,7,3024,0,13,503635,4,2115,510707,5,2814,510707,1,2814,510707,50,2820,510707,40,2820,512219,0,2822)
%
%
% START OF PROOF
% 510713 [] -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).
% 510716 [] -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).
% 510745 [] -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).
% 512192 [] -c_in(c_^message_^omsg_^o^nonce(v_^n^aa),c_^event_^oused(v_evs1),tc_^message_^omsg).
% 512200 [] 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) | 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).
% 512203 [] equal(v_^a,v_^aa).
% 512215 [] equal(v_^n^a,c_^message_^omsg_^o^nonce(v_^n^aa)).
% 512273 [binary:512192,510716.2,demod:512215] -c_in(c_^message_^omsg_^o^m^pair(v_^n^a,X),c_^event_^oused(v_evs1),tc_^message_^omsg).
% 512458 [binary:512273,510745.2] -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).
% 512542 [binary:510713.2,512458] -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).
% 552830 [para:512203.1.2,512200.1.1.1.1,demod:512215,cut:512542,cut:512542] 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 5
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 4522
% derived clauses: 677988
% kept clauses: 116330
% kept size sum: 487817
% kept mid-nuclei: 9444
% kept new demods: 68
% forw unit-subs: 40916
% forw double-subs: 3608
% forw overdouble-subs: 457
% backward subs: 107
% fast unit cutoff: 763
% full unit cutoff: 436
% dbl unit cutoff: 0
% real runtime : 37.81
% process. runtime: 37.61
% specific non-discr-tree subsumption statistics:
% tried: 3965
% length fails: 156
% strength fails: 57
% predlist fails: 984
% aux str. fails: 49
% by-lit fails: 15
% full subs tried: 2686
% full subs fail: 2234
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP11669/SWV/SWV326-1+eq_r.in")
% WARNING: TreeLimitedRun lost 34.82s, total lost is 34.82s
%
%------------------------------------------------------------------------------