%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET017-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 20.0s
% Output   : Assurance 20.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/SET017-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(95,40,0,190,0,1,389688,4,1895,390178,5,2503,390179,1,2505,390179,50,2512,390179,40,2512,390274,0,2512)
% 
% 
% START OF PROOF
% 390180 [] equal(X,X).
% 390188 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 390190 [] member(X,unordered_pair(Y,X)) | -member(X,universal_class).
% 390194 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 390195 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 390272 [] equal(unordered_pair(x,y),unordered_pair(x,z)).
% 390273 [] member(ordered_pair(y,z),cross_product(universal_class,universal_class)).
% 390274 [] -equal(y,z).
% 390275 [input:390188,factor] -member(X,unordered_pair(Y,Y)) | equal(X,Y).
% 390369 [binary:390273,390194] member(y,universal_class).
% 390372 [binary:390190.2,390369] member(y,unordered_pair(X,y)).
% 390379 [binary:390273,390195] member(z,universal_class).
% 390382 [binary:390190.2,390379] member(z,unordered_pair(X,z)).
% 390386 [para:390272.1.2,390382.1.2] member(z,unordered_pair(x,y)).
% 390389 [binary:390188,390386] equal(z,x) | equal(z,y).
% 390457 [para:390389.2.1,390274.1.2,cut:390180] equal(z,x).
% 390468 [para:390457.1.1,390274.1.2] -equal(y,x).
% 390469 [para:390457.1.1,390272.1.2.2] equal(unordered_pair(x,y),unordered_pair(x,x)).
% 393178 [binary:390468,390275.2,demod:390469,cut:390372] 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:    979
%  derived clauses:   477081
%  kept clauses:      79833
%  kept size sum:     27857
%  kept mid-nuclei:   7531
%  kept new demods:   102
%  forw unit-subs:    73439
%  forw double-subs: 9984
%  forw overdouble-subs: 422
%  backward subs:     20
%  fast unit cutoff:  190
%  full unit cutoff:  0
%  dbl  unit cutoff:  63
%  real runtime  :  25.32
%  process. runtime:  25.29
% specific non-discr-tree subsumption statistics: 
%  tried:           1195
%  length fails:    11
%  strength fails:  39
%  predlist fails:  414
%  aux str. fails:  11
%  by-lit fails:    2
%  full subs tried: 711
%  full subs fail:  295
% 
% ; 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/SET017-6+eq_r.in")
% 
%------------------------------------------------------------------------------