%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET849-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 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/SystemOnTPTP31874/SET/SET849-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 5 7)
% (binary-unit 28 #f 5 7)
% (binary-double 11 #f 5 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 7)
% (binary-order 28 #f 5 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 *********
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(1366,40,6,2732,0,12,1205188,4,2114)
% 
% 
% START OF PROOF
% 1367 [] equal(X,X).
% 1677 [] c_lessequals(X,X,tc_set(Y)).
% 2726 [] -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))).
% 2729 [] equal(c_^union(c_^zorn_^o^t^fin(X,Y),tc_set(Y)),c_^zorn_^osucc(X,c_^union(c_^zorn_^o^t^fin(X,Y),tc_set(Y)),Y)) | -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))).
% 2732 [] -equal(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))).
% 7283 [hyper:2726,1677] 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))).
% 291445 [input:2729,cut:7283] equal(c_^union(c_^zorn_^o^t^fin(X,Y),tc_set(Y)),c_^zorn_^osucc(X,c_^union(c_^zorn_^o^t^fin(X,Y),tc_set(Y)),Y)).
% 1208526 [para:291445.1.1,2732.1.2,cut:1367] 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 7
% clause depth limited to 5
% seconds given: 28
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1940
%  derived clauses:   1425462
%  kept clauses:      77026
%  kept size sum:     0
%  kept mid-nuclei:   7976
%  kept new demods:   23
%  forw unit-subs:    80579
%  forw double-subs: 988
%  forw overdouble-subs: 298
%  backward subs:     15
%  fast unit cutoff:  222
%  full unit cutoff:  72
%  dbl  unit cutoff:  1
%  real runtime  :  22.31
%  process. runtime:  22.12
% specific non-discr-tree subsumption statistics: 
%  tried:           664
%  length fails:    18
%  strength fails:  12
%  predlist fails:  48
%  aux str. fails:  2
%  by-lit fails:    2
%  full subs tried: 570
%  full subs fail:  272
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP31874/SET/SET849-1+eq_r.in")
% WARNING: TreeLimitedRun lost 19.81s, total lost is 19.81s
% 
%------------------------------------------------------------------------------