%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET853-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 : art04.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 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/SystemOnTPTP9229/SET/SET853-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 3 9)
% (binary-unit 9 #f 3 9)
% (binary-double 9 #f 3 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 9)
% (binary-order 25 #f 3 9)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(14,40,0,28,0,0,5760,50,136,5774,0,136,26086,50,1141,26100,0,1141,47205,4,2119)
% 
% 
% START OF PROOF
% 6306 [?] ?
% 26089 [] c_lessequals(X,X,tc_set(Y)).
% 26094 [] c_lessequals(X,c_^zorn_^osucc(Y,Z,U),tc_set(tc_set(U))) | -c_lessequals(X,Z,tc_set(tc_set(U))).
% 26096 [] c_in(v_xa,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 26099 [] -c_lessequals(c_^zorn_^osucc(v_^s,v_xa,t_a),c_^zorn_^osucc(v_^s,v_x,t_a),tc_set(tc_set(t_a))).
% 26100 [] c_lessequals(c_^zorn_^osucc(v_^s,X,t_a),v_x,tc_set(tc_set(t_a))) | -c_in(X,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))) | -c_lessequals(X,v_x,tc_set(tc_set(t_a))) | equal(X,v_x).
% 26110 [hyper:26100,26096,cut:6306] c_lessequals(c_^zorn_^osucc(v_^s,v_xa,t_a),v_x,tc_set(tc_set(t_a))) | equal(v_xa,v_x).
% 26141 [hyper:26094,26110,slowcut:26099] equal(v_xa,v_x).
% 61063 [para:26141.1.1,26099.1.1.2,cut:26089] 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 9
% clause depth limited to 5
% seconds given: 25
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    2038
%  derived clauses:   320678
%  kept clauses:      17884
%  kept size sum:     0
%  kept mid-nuclei:   33157
%  kept new demods:   3
%  forw unit-subs:    58345
%  forw double-subs: 21090
%  forw overdouble-subs: 150065
%  backward subs:     7136
%  fast unit cutoff:  6491
%  full unit cutoff:  50
%  dbl  unit cutoff:  403
%  real runtime  :  23.52
%  process. runtime:  23.34
% specific non-discr-tree subsumption statistics: 
%  tried:           4646609
%  length fails:    220884
%  strength fails:  492964
%  predlist fails:  929198
%  aux str. fails:  17747
%  by-lit fails:    1409682
%  full subs tried: 1344687
%  full subs fail:  1220676
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP9229/SET/SET853-2+eq_r.in")
% WARNING: TreeLimitedRun lost 19.82s, total lost is 19.82s
% 
%------------------------------------------------------------------------------