%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET850-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 : art07.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 4.9s
% Output   : Assurance 4.9s
% 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/SystemOnTPTP32061/SET/SET850-1+eq_r.in
% 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(1362,40,6,2724,0,12)
% 
% 
% START OF PROOF
% 2721 [] -c_lessequals(U,X,tc_set(Z)) | -c_lessequals(X,Y,tc_set(Z)) | c_lessequals(U,Y,tc_set(Z)).
% 2722 [] c_lessequals(X,c_^zorn_^osucc(Y,X,Z),tc_set(tc_set(Z))).
% 2723 [] c_lessequals(v_x,v_y,tc_set(tc_set(t_a))).
% 2724 [] -c_lessequals(v_x,c_^zorn_^osucc(v_^s,v_y,t_a),tc_set(tc_set(t_a))).
% 73507 [hyper:2721,2722,2723,slowcut:2724] 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 4
% seconds given: 28
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1636
%  derived clauses:   197084
%  kept clauses:      66111
%  kept size sum:     0
%  kept mid-nuclei:   3405
%  kept new demods:   23
%  forw unit-subs:    69001
%  forw double-subs: 782
%  forw overdouble-subs: 209
%  backward subs:     14
%  fast unit cutoff:  106
%  full unit cutoff:  24
%  dbl  unit cutoff:  1
%  real runtime  :  4.91
%  process. runtime:  4.89
% specific non-discr-tree subsumption statistics: 
%  tried:           390
%  length fails:    18
%  strength fails:  8
%  predlist fails:  8
%  aux str. fails:  2
%  by-lit fails:    2
%  full subs tried: 348
%  full subs fail:  139
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP32061/SET/SET850-1+eq_r.in")
% WARNING: TreeLimitedRun lost 4.95s, total lost is 4.95s
% 
%------------------------------------------------------------------------------