%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV295-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 : art07.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/SystemOnTPTP2284/SWV/SWV295-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 9)
% (binary-unit 28 #f 9 9)
% (binary-double 11 #f 9 9)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 9 9)
% (binary-order 28 #f 9 9)
% (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_^event_^oevent_^o^says(c_^message_^oagent_^o^server,v_^b,c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^a),c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^key(v_^k))),c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^b),c_^message_^omsg_^o^m^pair(v_x,c_^message_^omsg_^o^key(v_^k)))))),c_^list_^oset(v_evs1,tc_^event_^oevent),tc_^event_^oevent) | -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^key(v_^k))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs1)),tc_^message_^omsg) | -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_evs1,tc_^event_^oevent),tc_^event_^oevent).
% was split for some strategies as:
% c_in(c_^event_^oevent_^o^says(c_^message_^oagent_^o^server,v_^b,c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^m^pair(c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^a),c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^key(v_^k))),c_^message_^omsg_^o^crypt(c_^public_^oshr^k(v_^b),c_^message_^omsg_^o^m^pair(v_x,c_^message_^omsg_^o^key(v_^k)))))),c_^list_^oset(v_evs1,tc_^event_^oevent),tc_^event_^oevent).
% -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^key(v_^k))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs1)),tc_^message_^omsg).
% -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_evs1,tc_^event_^oevent),tc_^event_^oevent).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(1490,40,7,2980,0,13)
%
%
% START OF PROOF
% 1496 [] -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).
% 1530 [] -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).
% 1571 [] -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).
% 1758 [] -c_in(X,c_uminus(Y,tc_set(Z)),Z) | -c_in(X,Y,Z).
% 1759 [] c_in(X,c_uminus(Y,tc_set(Z)),Z) | c_in(X,Y,Z).
% 2970 [] 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^key(v_^k))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs1)),tc_^message_^omsg).
% 2973 [] -c_in(c_^message_^omsg_^o^nonce(v_^n^aa),c_^event_^oused(v_evs1),tc_^message_^omsg).
% 2976 [] equal(v_^n^a,c_^message_^omsg_^o^nonce(v_^n^aa)).
% 3004 [hyper:1496,2970,demod:2976] c_in(c_^message_^omsg_^o^m^pair(v_^n^a,c_^message_^omsg_^o^key(v_^k)),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs1)),tc_^message_^omsg).
% 3183 [hyper:1571,3004] c_in(v_^n^a,c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs1)),tc_^message_^omsg).
% 3270 [hyper:1530,3183] c_in(v_^n^a,c_^event_^oused(v_evs1),tc_^message_^omsg).
% 22005 [hyper:2973,1759,demod:2976] c_in(v_^n^a,c_uminus(c_^event_^oused(v_evs1),tc_set(tc_^message_^omsg)),tc_^message_^omsg).
% 24528 [hyper:1758,22005,cut:3270] 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 9
% clause depth limited to 9
% seconds given: 13
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1374
% derived clauses: 26655
% kept clauses: 17869
% kept size sum: 264303
% kept mid-nuclei: 2695
% kept new demods: 28
% forw unit-subs: 4750
% forw double-subs: 287
% forw overdouble-subs: 77
% backward subs: 20
% fast unit cutoff: 47
% full unit cutoff: 11
% dbl unit cutoff: 0
% real runtime : 2.95
% process. runtime: 2.92
% specific non-discr-tree subsumption statistics:
% tried: 186
% length fails: 8
% strength fails: 20
% predlist fails: 13
% aux str. fails: 1
% by-lit fails: 1
% full subs tried: 136
% full subs fail: 59
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP2284/SWV/SWV295-1+eq_r.in")
%
%------------------------------------------------------------------------------