%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWV284-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 : art08.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 19.8s
% Output   : Assurance 19.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/SystemOnTPTP21368/SWV/SWV284-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 4 7)
% (binary-unit 28 #f 4 7)
% (binary-double 11 #f 4 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 7)
% (binary-order 28 #f 4 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(1449,40,6,2898,0,12,248199,4,2117)
% 
% 
% START OF PROOF
% 2887 [] -c_in(c_^message_^omsg_^o^nonce(X),c_^message_^oparts(c_insert(Y,c_emptyset,tc_^message_^omsg)),tc_^message_^omsg) | -c_lessequals($ganapfun1($ganc72,Y),X,tc_nat).
% 3048 [?] ?
% 3087 [?] ?
% 248670 [binary:3087,2887,slowcut:3048] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos 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 4
% seconds given: 28
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    2176
%  derived clauses:   682344
%  kept clauses:      77034
%  kept size sum:     0
%  kept mid-nuclei:   16113
%  kept new demods:   32
%  forw unit-subs:    92389
%  forw double-subs: 17134
%  forw overdouble-subs: 1461
%  backward subs:     17
%  fast unit cutoff:  445
%  full unit cutoff:  874
%  dbl  unit cutoff:  191
%  real runtime  :  22.2
%  process. runtime:  21.85
% specific non-discr-tree subsumption statistics: 
%  tried:           10888
%  length fails:    609
%  strength fails:  34
%  predlist fails:  249
%  aux str. fails:  32
%  by-lit fails:    25
%  full subs tried: 9933
%  full subs fail:  8469
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP21368/SWV/SWV284-1+eq_r.in")
% WARNING: TreeLimitedRun lost 19.83s, total lost is 19.83s
% 
%------------------------------------------------------------------------------