%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET077-6 : 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 : art07.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/SET077-6+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 6 9)
% (binary-unit 9 #f 6 9)
% (binary-double 9 #f 6 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 6 9)
% (binary-order 25 #f 6 9)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(93,40,1,186,0,1)
% 
% 
% START OF PROOF
% 105 [] member(unordered_pair(X,Y),universal_class).
% 106 [] equal(unordered_pair(X,X),singleton(X)).
% 186 [] -member(singleton(x),universal_class).
% 1599 [para:106.1.1,105.1.1,slowcut:186] 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: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    52
%  derived clauses:   1700
%  kept clauses:      1098
%  kept size sum:     11110
%  kept mid-nuclei:   300
%  kept new demods:   18
%  forw unit-subs:    232
%  forw double-subs: 46
%  forw overdouble-subs: 8
%  backward subs:     1
%  fast unit cutoff:  5
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.3
%  process. runtime:  0.4
% specific non-discr-tree subsumption statistics: 
%  tried:           16
%  length fails:    0
%  strength fails:  2
%  predlist fails:  4
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 10
%  full subs fail:  2
% 
% ; 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/SET077-6+eq_r.in")
% 
%------------------------------------------------------------------------------