%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET102-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 : art02.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 19.9s
% Output   : Assurance 19.9s
% 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/SET102-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,0,186,0,1,339806,4,1882,340583,5,2503,340584,1,2506,340584,50,2512,340584,40,2512,340677,0,2512)
% 
% 
% START OF PROOF
% 340595 [] member(X,unordered_pair(Y,X)) | -member(X,universal_class).
% 340596 [] member(unordered_pair(X,Y),universal_class).
% 340598 [] equal(unordered_pair(singleton(X),unordered_pair(X,singleton(Y))),ordered_pair(X,Y)).
% 340677 [] -member(unordered_pair(x,singleton(y)),ordered_pair(x,y)).
% 340767 [para:340598.1.1,340595.1.2,cut:340596,slowcut:340677] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos 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 9
% clause depth limited to 6
% seconds given: 9
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    663
%  derived clauses:   454183
%  kept clauses:      77103
%  kept size sum:     613
%  kept mid-nuclei:   8095
%  kept new demods:   75
%  forw unit-subs:    84063
%  forw double-subs: 11181
%  forw overdouble-subs: 403
%  backward subs:     8
%  fast unit cutoff:  55
%  full unit cutoff:  3
%  dbl  unit cutoff:  28
%  real runtime  :  25.70
%  process. runtime:  25.13
% specific non-discr-tree subsumption statistics: 
%  tried:           4143
%  length fails:    7
%  strength fails:  23
%  predlist fails:  2800
%  aux str. fails:  13
%  by-lit fails:    4
%  full subs tried: 1288
%  full subs fail:  888
% 
% ; 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/SET102-6+eq_r.in")
% 
%------------------------------------------------------------------------------