%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET013-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 : art05.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.8s
% Output   : Assurance 59.8s
% 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/SET013-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(145,40,1,290,0,1,223496,4,2103,244057,5,2802,244058,1,2802,244058,50,2806,244058,40,2806,244203,0,2806,291493,3,4208,301509,4,4908,321966,5,5607,321967,5,5608,321968,1,5608,321968,50,5611,321968,40,5611,322113,0,5611,352048,3,6162,357483,4,6437)
% 
% 
% START OF PROOF
% 321972 [] member(f1(X,Y),Y) | member(f1(X,Y),X) | equal(X,Y).
% 321973 [] -member(f1(X,Y),Y) | -member(f1(X,Y),X) | equal(X,Y).
% 321997 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 321998 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 321999 [] member(X,intersection(Y,Z)) | -member(X,Y) | -member(X,Z).
% 322111 [] equal(intersection(as,bs),cs).
% 322112 [] equal(intersection(bs,as),ds).
% 322113 [] -equal(cs,ds).
% 322204 [binary:322113,321972.3] member(f1(cs,ds),cs) | member(f1(cs,ds),ds).
% 322226 [binary:322113,321973.3] -member(f1(cs,ds),cs) | -member(f1(cs,ds),ds).
% 323277 [para:322111.1.1,321997.1.2] -member(X,cs) | member(X,as).
% 323278 [para:322112.1.1,321997.1.2] -member(X,ds) | member(X,bs).
% 323347 [para:322111.1.1,321998.1.2] -member(X,cs) | member(X,bs).
% 323348 [para:322112.1.1,321998.1.2] -member(X,ds) | member(X,as).
% 323397 [para:322111.1.1,321999.1.2] -member(X,as) | -member(X,bs) | member(X,cs).
% 323400 [para:322112.1.1,321999.1.2] -member(X,bs) | -member(X,as) | member(X,ds).
% 334038 [binary:323277,322204,binarycut:323348] member(f1(cs,ds),as).
% 334044 [binary:323278,322204.2,binarycut:323347] member(f1(cs,ds),bs).
% 334196 [binary:323397.3,322226,cut:334044,cut:334038] -member(f1(cs,ds),ds).
% 358642 [binary:334044,323400,cut:334038,cut:334196] 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
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    4117
%  derived clauses:   1832241
%  kept clauses:      165708
%  kept size sum:     0
%  kept mid-nuclei:   56635
%  kept new demods:   107
%  forw unit-subs:    330603
%  forw double-subs: 90012
%  forw overdouble-subs: 114952
%  backward subs:     100
%  fast unit cutoff:  11270
%  full unit cutoff:  2726
%  dbl  unit cutoff:  150
%  real runtime  :  65.0
%  process. runtime:  64.82
% specific non-discr-tree subsumption statistics: 
%  tried:           3330445
%  length fails:    303075
%  strength fails:  810424
%  predlist fails:  1363714
%  aux str. fails:  30624
%  by-lit fails:    42002
%  full subs tried: 729475
%  full subs fail:  623463
% 
% ; 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/SET013-3+eq_r.in")
% 
%------------------------------------------------------------------------------