%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET018-3 : TPTP v3.4.2. Released v1.0.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art08.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 59.3s
% Output   : Assurance 59.3s
% 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/SET018-3+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 4 15)
% (binary-unit 28 #f 4 15)
% (binary-double 11 #f 4 15)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 15)
% (binary-order 28 #f 4 15)
% (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(150,40,2,300,0,2,224784,5,2803,224784,1,2803,224784,50,2805,224784,40,2805,224934,0,2805,282589,3,4206,288224,4,4907,305896,5,5606,305897,5,5607,305898,1,5607,305898,50,5611,305898,40,5611,306048,0,5611,341483,3,6164,350572,4,6440)
% 
% 
% START OF PROOF
% 305907 [] little_set(non_ordered_pair(X,Y)).
% 305909 [] equal(ordered_pair(X,Y),non_ordered_pair(singleton_set(X),non_ordered_pair(X,Y))).
% 306041 [] -equal(ordered_pair(X,Y),ordered_pair(Z,U)) | equal(X,Z) | -little_set(X) | -little_set(Z).
% 306042 [] -equal(non_ordered_pair(X,Y),non_ordered_pair(X,Z)) | equal(Y,Z) | -little_set(Y) | -little_set(Z).
% 306043 [] little_set(a).
% 306044 [] little_set(b).
% 306045 [] little_set(c).
% 306046 [] little_set(d).
% 306047 [] equal(ordered_pair(a,b),ordered_pair(c,d)).
% 306048 [] -equal(b,d).
% 317013 [binary:306047,306041,cut:306043,cut:306045] equal(a,c).
% 317214 [para:317013.1.2,306047.1.2.1] equal(ordered_pair(a,b),ordered_pair(a,d)).
% 317259 [binary:306048,306042.2,cut:306044,cut:306046] -equal(non_ordered_pair(X,b),non_ordered_pair(X,d)).
% 317319 [para:305909.1.2,306042.1.1,cut:305907] -equal(ordered_pair(X,Y),non_ordered_pair(singleton_set(X),Z)) | equal(non_ordered_pair(X,Y),Z) | -little_set(Z).
% 377212 [binary:317259,317319.2,demod:305909,cut:305907,slowcut:317214] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double 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 15
% clause depth limited to 4
% seconds given: 11
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    3703
%  derived clauses:   1965575
%  kept clauses:      164865
%  kept size sum:     938097
%  kept mid-nuclei:   74239
%  kept new demods:   130
%  forw unit-subs:    429041
%  forw double-subs: 43317
%  forw overdouble-subs: 98891
%  backward subs:     63
%  fast unit cutoff:  14001
%  full unit cutoff:  1630
%  dbl  unit cutoff:  89
%  real runtime  :  68.6
%  process. runtime:  67.8
% specific non-discr-tree subsumption statistics: 
%  tried:           5995003
%  length fails:    113063
%  strength fails:  2074421
%  predlist fails:  2454076
%  aux str. fails:  118872
%  by-lit fails:    48346
%  full subs tried: 1122788
%  full subs fail:  1048998
% 
% ; 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/SET018-3+eq_r.in")
% 
%------------------------------------------------------------------------------