%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET841-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/SystemOnTPTP7244/SET/SET841-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: small
% 
% strategies selected: 
% (hyper 27 #f 3 9)
% (binary-unit 10 #f 3 9)
% (binary-double 10 #f 3 9)
% (binary-double 16 #f)
% (binary-double 10 #t)
% (binary 16 #t 3 9)
% (binary-order 27 #f 3 9)
% (binary-posweight-order 125 #f)
% (binary-posweight-lex-big-order 43 #f)
% (binary-posweight-lex-small-order 16 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-weightorder 65 #f)
% (binary-order 27 #f)
% (hyper-order 37 #f)
% (binary 63 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(8,40,0,16,0,0,26,50,0,34,0,0,44,50,0,52,0,0,62,50,0,70,0,0,80,50,0,88,0,0,98,50,0,106,0,0,116,50,0,124,0,0,134,50,0,142,0,0,152,50,0,160,0,0,170,50,0,178,0,0,188,50,0,196,0,0,206,50,0,214,0,0,224,50,0,232,0,1,242,50,1,250,0,1,260,50,1,268,0,1,278,50,1,286,0,1,296,50,1,304,0,1,314,50,1,322,0,1,332,50,1,340,0,1,350,50,1,350,40,1,358,0,1)
% 
% 
% START OF PROOF
% 352 [] c_lessequals(X,X,tc_set(Y)).
% 353 [] c_lessequals(c_^zorn_^osucc(X,Y,Z),U,tc_set(tc_set(Z))) | -c_in(Y,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | -c_in(U,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | -c_lessequals(Y,U,tc_set(tc_set(Z))) | equal(Y,U).
% 354 [] c_in(v_m,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 355 [] equal(v_m,c_^zorn_^osucc(v_^s,v_m,t_a)).
% 356 [] c_in(v_x,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 357 [] c_lessequals(v_x,v_m,tc_set(tc_set(t_a))).
% 358 [] -c_lessequals(c_^zorn_^osucc(v_^s,v_x,t_a),v_m,tc_set(tc_set(t_a))).
% 364 [binary:358,353,cut:356,cut:354,cut:357] equal(v_x,v_m).
% 365 [para:364.1.1,358.1.1.2,demod:355,cut:352] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 9
% clause depth limited to 3
% seconds given: 10
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    180
%  derived clauses:   509
%  kept clauses:      24
%  kept size sum:     337
%  kept mid-nuclei:   133
%  kept new demods:   21
%  forw unit-subs:    215
%  forw double-subs: 19
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  59
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.3
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           98
%  length fails:    0
%  strength fails:  98
%  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/SystemOnTPTP7244/SET/SET841-2+eq_r.in")
% 
%------------------------------------------------------------------------------