%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET024-7 : TPTP v3.4.2. Bugfixed v2.1.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art06.cs.miami.edu
% Model    : i686 unknown
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1000MB
% OS       : Linux 2.4.22-21mdk-i686-up-4GB
% 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: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/SET/SET024-7+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 6 9)
% (binary-unit 28 #f 6 9)
% (binary-double 11 #f 6 9)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 6 9)
% (binary-order 28 #f 6 9)
% (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(124,40,1,248,0,1)
% 
% 
% START OF PROOF
% 134 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 137 [] equal(unordered_pair(X,X),singleton(X)).
% 247 [] member(x,universal_class).
% 248 [] -member(x,singleton(x)).
% 267 [hyper:134,247] member(x,unordered_pair(x,X)).
% 2230 [para:137.1.1,267.1.2,cut:248] 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 9
% clause depth limited to 6
% seconds given: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    60
%  derived clauses:   2472
%  kept clauses:      1541
%  kept size sum:     15516
%  kept mid-nuclei:   426
%  kept new demods:   18
%  forw unit-subs:    418
%  forw double-subs: 57
%  forw overdouble-subs: 11
%  backward subs:     0
%  fast unit cutoff:  8
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.6
%  process. runtime:  0.5
% specific non-discr-tree subsumption statistics: 
%  tried:           23
%  length fails:    0
%  strength fails:  2
%  predlist fails:  5
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 16
%  full subs fail:  5
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/SET/SET024-7+eq_r.in")
% 
%------------------------------------------------------------------------------