%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET846-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 : art09.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/SystemOnTPTP7664/SET/SET846-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 4 3)
% (binary-unit 11 #f 4 3)
% (binary-double 17 #f 4 3)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 4 3)
% (binary-posweight-order 283 #f)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(5,40,0,10,0,0)
% 
% 
% START OF PROOF
% 6 [] c_lessequals(X,c_^union(Y,Z),tc_set(Z)) | -c_in(X,Y,tc_set(Z)).
% 7 [] c_lessequals(X,X,tc_set(Y)).
% 8 [] c_in(c_^zorn_^osucc(X,Y,Z),c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | -c_in(Y,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))).
% 9 [] -c_lessequals(X,c_^zorn_^o^t^fin(Y,Z),tc_set(tc_set(tc_set(Z)))) | c_in(c_^union(X,tc_set(Z)),c_^zorn_^o^t^fin(Y,Z),tc_set(tc_set(Z))).
% 10 [] -c_lessequals(c_^zorn_^osucc(v_^s,c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a)),t_a),c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a)),tc_set(tc_set(t_a))).
% 11 [hyper:9,7] c_in(c_^union(c_^zorn_^o^t^fin(X,Y),tc_set(Y)),c_^zorn_^o^t^fin(X,Y),tc_set(tc_set(Y))).
% 13 [hyper:8,11] c_in(c_^zorn_^osucc(X,c_^union(c_^zorn_^o^t^fin(X,Y),tc_set(Y)),Y),c_^zorn_^o^t^fin(X,Y),tc_set(tc_set(Y))).
% 15 [hyper:6,13,slowcut:10] 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 3
% clause depth limited to 4
% seconds given: 29
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    4
%  derived clauses:   6
%  kept clauses:      2
%  kept size sum:     29
%  kept mid-nuclei:   0
%  kept new demods:   0
%  forw unit-subs:    2
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  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/SystemOnTPTP7664/SET/SET846-2+noeq.in")
% 
%------------------------------------------------------------------------------