%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET844-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 : art08.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 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/SystemOnTPTP18128/SET/SET844-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: heq
% detected subclass: small
% detected subclass: long
% 
% strategies selected: 
% (hyper 57 #f 4 7)
% (binary-posweight-order 28 #f 4 7)
% (binary-unit 28 #f 4 7)
% (hyper 188 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 114 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary 22 #t)
% (binary-unit 58 #f)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(7,40,0,14,0,0)
% 
% 
% START OF PROOF
% 8 [] equal(X,X).
% 9 [] c_lessequals(X,X,tc_set(Y)).
% 10 [] -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))).
% 11 [] -c_in(X,c_^zorn_^o^t^fin(Y,Z),tc_set(tc_set(Z))) | -c_in(U,c_^zorn_^o^t^fin(Y,Z),tc_set(tc_set(Z))) | c_lessequals(U,X,tc_set(tc_set(Z))) | -equal(X,c_^zorn_^osucc(Y,X,Z)).
% 12 [] c_in(v_m,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 13 [] equal(v_m,c_^zorn_^osucc(v_^s,v_m,t_a)).
% 14 [] -c_lessequals(c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 15 [hyper:10,9] 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))).
% 22 [hyper:11,15,12,demod:13,cut:8] c_lessequals(c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 23 [hyper:14,22] 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: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    8
%  derived clauses:   15
%  kept clauses:      2
%  kept size sum:     24
%  kept mid-nuclei:   5
%  kept new demods:   1
%  forw unit-subs:    6
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  3
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  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/SystemOnTPTP18128/SET/SET844-2+eq_r.in")
% 
%------------------------------------------------------------------------------