%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWV242-2 : 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 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/SystemOnTPTP19781/SWV/SWV242-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: small
% detected subclass: short
% 
% strategies selected: 
% (hyper 29 #f 3 5)
% (binary-unit 11 #f 3 5)
% (binary-double 17 #f 3 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 3 5)
% (binary-posweight-order 283 #f)
% 
% 
% SOS clause 
% -c_lessequals(v_^h,c_^message_^oanalz(c_union(v_^g_^h,v_^h_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)) | -c_lessequals(v_^g,c_^message_^oanalz(c_union(v_^g_^h,v_^h_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% was split for some strategies as: 
% -c_lessequals(v_^h,c_^message_^oanalz(c_union(v_^g_^h,v_^h_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% -c_lessequals(v_^g,c_^message_^oanalz(c_union(v_^g_^h,v_^h_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(7,40,0,14,0,0)
% 
% 
% START OF PROOF
% 8 [] c_lessequals(c_^message_^oanalz(X),c_^message_^oanalz(Y),tc_set(tc_^message_^omsg)) | -c_lessequals(X,Y,tc_set(tc_^message_^omsg)).
% 9 [] c_lessequals(X,c_union(X,Y,Z),tc_set(Z)).
% 10 [] c_lessequals(X,c_union(Y,X,Z),tc_set(Z)).
% 11 [] -c_lessequals(U,X,tc_set(Z)) | -c_lessequals(X,Y,tc_set(Z)) | c_lessequals(U,Y,tc_set(Z)).
% 12 [] c_lessequals(v_^g,c_^message_^oanalz(v_^g_^h),tc_set(tc_^message_^omsg)).
% 13 [] c_lessequals(v_^h,c_^message_^oanalz(v_^h_^h),tc_set(tc_^message_^omsg)).
% 14 [] -c_lessequals(v_^h,c_^message_^oanalz(c_union(v_^g_^h,v_^h_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)) | -c_lessequals(v_^g,c_^message_^oanalz(c_union(v_^g_^h,v_^h_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 21 [hyper:8,9] c_lessequals(c_^message_^oanalz(X),c_^message_^oanalz(c_union(X,Y,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 27 [hyper:8,10] c_lessequals(c_^message_^oanalz(X),c_^message_^oanalz(c_union(Y,X,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 51 [hyper:11,21,12] c_lessequals(v_^g,c_^message_^oanalz(c_union(v_^g_^h,X,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 62 [hyper:11,27,13] c_lessequals(v_^h,c_^message_^oanalz(c_union(X,v_^h_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 96 [hyper:14,62,cut:51] 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 5
% clause depth limited to 3
% seconds given: 14
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    19
%  derived clauses:   196
%  kept clauses:      16
%  kept size sum:     152
%  kept mid-nuclei:   62
%  kept new demods:   0
%  forw unit-subs:    18
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.2
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  predlist fails:  0
%  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/SystemOnTPTP19781/SWV/SWV242-2+noeq.in")
% 
%------------------------------------------------------------------------------