%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET846-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 50.0s
% Output   : Assurance 50.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/SystemOnTPTP31728/SET/SET846-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(1367,40,6,2734,0,12,462350,4,2114,483852,5,2813,483853,1,2813,483853,50,2819,483853,40,2819,485220,0,2820,519904,3,4221,523619,4,4921)
% 
% 
% START OF PROOF
% 484164 [] c_lessequals(X,X,tc_set(Y)).
% 485214 [] c_lessequals(X,c_^union(Y,Z),tc_set(Z)) | -c_in(X,Y,tc_set(Z)).
% 485216 [] 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))).
% 485217 [] -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))).
% 485220 [] -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))).
% 492451 [binary:485220,485214] -c_in(c_^zorn_^osucc(v_^s,c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a)),t_a),c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 492825 [binary:484164,485217] 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))).
% 527629 [binary:492451,485216,cut:492825] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit paramodulation 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 7
% clause depth limited to 4
% seconds given: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    6650
%  derived clauses:   1250758
%  kept clauses:      114159
%  kept size sum:     526690
%  kept mid-nuclei:   13547
%  kept new demods:   70
%  forw unit-subs:    94330
%  forw double-subs: 5154
%  forw overdouble-subs: 711
%  backward subs:     44
%  fast unit cutoff:  1791
%  full unit cutoff:  814
%  dbl  unit cutoff:  9
%  real runtime  :  53.89
%  process. runtime:  53.83
% specific non-discr-tree subsumption statistics: 
%  tried:           6064
%  length fails:    333
%  strength fails:  19
%  predlist fails:  1238
%  aux str. fails:  51
%  by-lit fails:    17
%  full subs tried: 4228
%  full subs fail:  3517
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP31728/SET/SET846-1+eq_r.in")
% WARNING: TreeLimitedRun lost 49.97s, total lost is 49.97s
% 
%------------------------------------------------------------------------------