%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET834-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 : art06.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 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/SystemOnTPTP17954/SET/SET834-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: small
% 
% strategies selected: 
% (hyper 27 #f 2 5)
% (binary-unit 10 #f 2 5)
% (binary-double 16 #f)
% (binary 16 #t 2 5)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 2 5)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(10,40,0,20,0,0)
% 
% 
% START OF PROOF
% 11 [] c_in(X,c_union(Y,Z,U),U) | -c_in(X,Z,U).
% 12 [] c_in(X,c_union(Y,Z,U),U) | -c_in(X,Y,U).
% 13 [] -c_in(X,c_union(Y,Z,U),U) | c_in(X,Z,U) | c_in(X,Y,U).
% 14 [] -c_lessequals(X,Y,tc_set(Z)) | -c_in(U,X,Z) | c_in(U,Y,Z).
% 15 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 16 [] -c_in(c_^main_^osubset^i__1(X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 17 [] c_in(v_x,v_^x,t_a).
% 18 [] -c_in(v_x,v_^z,t_a).
% 19 [] -c_in(v_x,v_^y,t_a).
% 20 [] -c_lessequals(v_^z,X,tc_set(t_a)) | -c_lessequals(v_^y,X,tc_set(t_a)) | c_lessequals(v_^x,X,tc_set(t_a)).
% 33 [hyper:11,15] c_in(c_^main_^osubset^i__1(X,Y,Z),c_union(U,X,Z),Z) | c_lessequals(X,Y,tc_set(Z)).
% 34 [hyper:12,15] c_in(c_^main_^osubset^i__1(X,Y,Z),c_union(X,U,Z),Z) | c_lessequals(X,Y,tc_set(Z)).
% 146 [hyper:16,33] c_lessequals(X,c_union(Y,X,Z),tc_set(Z)).
% 210 [hyper:16,34] c_lessequals(X,c_union(X,Y,Z),tc_set(Z)).
% 216 [hyper:20,210,146] c_lessequals(v_^x,c_union(v_^z,v_^y,t_a),tc_set(t_a)).
% 222 [hyper:14,216,17] c_in(v_x,c_union(v_^z,v_^y,t_a),t_a).
% 230 [hyper:13,222,cut:19,cut:18] 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 2
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    39
%  derived clauses:   713
%  kept clauses:      100
%  kept size sum:     1729
%  kept mid-nuclei:   90
%  kept new demods:   0
%  forw unit-subs:    119
%  forw double-subs: 94
%  forw overdouble-subs: 70
%  backward subs:     2
%  fast unit cutoff:  3
%  full unit cutoff:  0
%  dbl  unit cutoff:  1
%  real runtime  :  0.3
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           229
%  length fails:    22
%  strength fails:  28
%  predlist fails:  53
%  aux str. fails:  0
%  by-lit fails:    1
%  full subs tried: 125
%  full subs fail:  55
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP17954/SET/SET834-2+noeq.in")
% 
%------------------------------------------------------------------------------