%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV322-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 : 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/SystemOnTPTP11600/SWV/SWV322-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 11 7)
% (binary-unit 28 #f 11 7)
% (binary-double 11 #f 11 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 11 7)
% (binary-order 28 #f 11 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 ****
%
%
% timer checkpoints: c(1479,40,7,2958,0,13)
%
%
% START OF PROOF
% 1510 [] c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(X)),c_^event_^oused(Y),tc_^message_^omsg).
% 2952 [] -c_in(c_^message_^omsg_^o^key(v_^k^a^b),c_^event_^oused(v_evs3),tc_^message_^omsg).
% 2954 [] -c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 2958 [?] ?
% 2993 [input:2958,cut:2954] equal(c_^public_^oshr^k(v_^a),v_^k^a^b).
% 3833 [para:2993.1.1,1510.1.1.1,slowcut:2952] 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 7
% clause depth limited to 11
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 184
% derived clauses: 2249
% kept clauses: 487
% kept size sum: 8833
% kept mid-nuclei: 369
% kept new demods: 12
% forw unit-subs: 1368
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 9
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.23
% process. runtime: 0.21
% specific non-discr-tree subsumption statistics:
% tried: 1
% length fails: 0
% strength fails: 0
% predlist fails: 1
% 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/SystemOnTPTP11600/SWV/SWV322-1+eq_r.in")
% Killed 1 orphans
%
%------------------------------------------------------------------------------