TSTP Solution File: SWV291-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV291-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 44.8s
% Output : Assurance 44.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/SystemOnTPTP12333/SWV/SWV291-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 7)
% (binary-unit 28 #f 9 7)
% (binary-double 11 #f 9 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 9 7)
% (binary-order 28 #f 9 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
% -equal(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))))))),v_^x) | -equal(v_^b,v_^ba) | -equal(v_^a,c_^message_^oagent_^o^spy).
% was split for some strategies as:
% -equal(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))))))),v_^x).
% -equal(v_^b,v_^ba).
% -equal(v_^a,c_^message_^oagent_^o^spy).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(1479,40,7,2958,0,13,99766,4,1051,100145,5,1314,100146,5,1320,100147,1,1320,100147,50,1326,100147,40,1326,101626,0,1328,130608,3,1979,143174,4,2305,144914,5,2629,144915,5,2631,144916,1,2631,144916,50,2634,144916,40,2634,146395,0,2636,162476,3,2888,164760,4,3012,167757,5,3137,167758,5,3137,167758,1,3137,167758,50,3139,167758,40,3139,169237,0,3141,191627,3,3542,197752,4,3742,199937,5,3942,199938,5,3943,199939,1,3943,199939,50,3945,199939,40,3945,201418,0,3946,214610,3,4347,217220,4,4548)
%
%
% START OF PROOF
% 199942 [] 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).
% 199944 [] -c_in(X,c_^message_^oanalz(Y),tc_^message_^omsg) | c_in(X,c_^message_^oparts(Y),tc_^message_^omsg).
% 199991 [] -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(c_^message_^omsg_^o^key(X),Z,tc_^message_^omsg).
% 200222 [] -c_in(X,c_union(Y,Z,U),U) | c_in(X,Z,U) | c_in(X,Y,U).
% 200229 [] c_in(X,c_insert(X,Y,Z),Z).
% 200230 [] -c_in(X,c_insert(Y,Z,U),U) | c_in(X,Z,U) | equal(X,Y).
% 201411 [] -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(X)),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,Y)),tc_^message_^omsg) | -c_in(Y,c_^otway^rees_^ootway,tc_^list_^olist(tc_^event_^oevent)) | c_in(X,c_^event_^obad,tc_^message_^oagent).
% 201412 [] -c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 201413 [] c_in(v_evsf,c_^otway^rees_^ootway,tc_^list_^olist(tc_^event_^oevent)).
% 201414 [] c_in(v_^x,c_^message_^osynth(c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),tc_^message_^omsg).
% 201415 [] 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_insert(v_^x,c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf),tc_^message_^omsg)),tc_^message_^omsg).
% 201416 [] -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_evsf,tc_^event_^oevent),tc_^event_^oevent).
% 201417 [?] ?
% 201427 [binary:200230.2,201412] -c_in(v_^a,c_insert(X,c_^event_^obad,tc_^message_^oagent),tc_^message_^oagent) | equal(v_^a,X).
% 201431 [binary:201411.3,201412] -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,X)),tc_^message_^omsg) | -c_in(X,c_^otway^rees_^ootway,tc_^list_^olist(tc_^event_^oevent)).
% 201505 [binary:199942.2,201415,cut:201414] 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_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).
% 201660 [input:201417,cut:201416] -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_evsf)),tc_^message_^omsg).
% 201661 [binary:199944.2,201660] -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_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg).
% 202488 [para:201427.2.1,201660.1.1.2.2.1.1] -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(X),c_^message_^omsg_^o^agent(v_^b)))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg) | -c_in(v_^a,c_insert(X,c_^event_^obad,tc_^message_^oagent),tc_^message_^oagent).
% 202923 [binary:201413,201431.2] -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg).
% 202925 [binary:199944.2,202923] -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf)),tc_^message_^omsg).
% 211717 [binary:200222,201505,binarydemod:202488,cut:200229] 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_^osynth(c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evsf))),tc_^message_^omsg).
% 217265 [binary:211717,199991,cut:201661,cut:202925] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 8
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 8154
% derived clauses: 275771
% kept clauses: 177131
% kept size sum: 783770
% kept mid-nuclei: 13943
% kept new demods: 127
% forw unit-subs: 48993
% forw double-subs: 16123
% forw overdouble-subs: 1524
% backward subs: 73
% fast unit cutoff: 1609
% full unit cutoff: 601
% dbl unit cutoff: 4
% real runtime : 45.90
% process. runtime: 45.61
% specific non-discr-tree subsumption statistics:
% tried: 67107
% length fails: 2987
% strength fails: 2724
% predlist fails: 26359
% aux str. fails: 5604
% by-lit fails: 1807
% full subs tried: 24860
% full subs fail: 23337
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP12333/SWV/SWV291-1+eq_r.in")
% WARNING: TreeLimitedRun lost 44.81s, total lost is 44.81s
%
%------------------------------------------------------------------------------