%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET119-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 : art01.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 29.5s
% Output   : Assurance 29.5s
% 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/SET119-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(168,40,1,336,0,1,374872,4,2106,493639,5,2803,493640,1,2805,493640,50,2811,493640,40,2811,493808,0,2811)
% 
% 
% START OF PROOF
% 493641 [] equal(X,X).
% 493642 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 493645 [] subclass(X,universal_class).
% 493649 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 493650 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 493655 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 493786 [] member(ordered_pair(X,Y),universal_class).
% 493795 [] member(ordered_pair(first(X),second(X)),cross_product(universal_class,universal_class)) | equal(first(X),X).
% 493797 [] equal(ordered_pair(first(X),second(X)),X) | equal(first(X),X).
% 493807 [] -member(x,universal_class).
% 493808 [] -equal(first(ordered_pair(x,y)),ordered_pair(x,y)).
% 493822 [binary:493807,493642.3,cut:493645] -member(x,X).
% 493863 [binary:493808,493649.2] -member(first(ordered_pair(x,y)),unordered_pair(ordered_pair(x,y),X)) | equal(first(ordered_pair(x,y)),X).
% 493874 [binary:493786,493650.2] member(ordered_pair(X,Y),unordered_pair(ordered_pair(X,Y),Z)).
% 493879 [binary:493808,493863.2] -member(first(ordered_pair(x,y)),unordered_pair(ordered_pair(x,y),ordered_pair(x,y))).
% 493925 [binary:493822,493655.2] -member(ordered_pair(x,X),cross_product(Y,Z)).
% 502555 [para:493797.2.1,493808.1.1,cut:493641] equal(ordered_pair(first(ordered_pair(x,y)),second(ordered_pair(x,y))),ordered_pair(x,y)).
% 506756 [para:493795.2.1,493879.1.1,demod:502555,cut:493874,cut:493925] 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: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1627
%  derived clauses:   719467
%  kept clauses:      89788
%  kept size sum:     143945
%  kept mid-nuclei:   131453
%  kept new demods:   719
%  forw unit-subs:    178042
%  forw double-subs: 18905
%  forw overdouble-subs: 6738
%  backward subs:     16
%  fast unit cutoff:  2122
%  full unit cutoff:  133
%  dbl  unit cutoff:  99
%  real runtime  :  30.32
%  process. runtime:  29.83
% specific non-discr-tree subsumption statistics: 
%  tried:           290163
%  length fails:    55274
%  strength fails:  10448
%  predlist fails:  94498
%  aux str. fails:  25533
%  by-lit fails:    6891
%  full subs tried: 77627
%  full subs fail:  71097
% 
% ; 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/SET119-7+eq_r.in")
% 
%------------------------------------------------------------------------------