%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET013-4 : TPTP v3.4.2. Bugfixed v1.2.1.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art06.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 0.0s
% Output : Assurance 0.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/SET013-4+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 2 5)
% (binary-unit 9 #f 2 5)
% (binary-double 9 #f 2 5)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 5)
% (binary-order 25 #f 2 5)
% (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(13,40,0,26,0,0,227,50,3,240,0,3)
%
%
% START OF PROOF
% 231 [] member(f1(X,Y),Y) | member(f1(X,Y),X) | equal(X,Y).
% 232 [] -member(f1(X,Y),Y) | -member(f1(X,Y),X) | equal(X,Y).
% 233 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 234 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 235 [] member(X,intersection(Y,Z)) | -member(X,Y) | -member(X,Z).
% 238 [] equal(intersection(as,bs),cs).
% 239 [] equal(intersection(bs,as),ds).
% 240 [] -equal(cs,ds).
% 257 [hyper:233,231] member(f1(X,intersection(Y,Z)),Y) | member(f1(X,intersection(Y,Z)),X) | equal(X,intersection(Y,Z)).
% 259 [hyper:233,231] member(f1(intersection(X,Y),Z),X) | member(f1(intersection(X,Y),Z),Z) | equal(intersection(X,Y),Z).
% 261 [hyper:234,231] member(f1(X,intersection(Y,Z)),Z) | member(f1(X,intersection(Y,Z)),X) | equal(X,intersection(Y,Z)).
% 263 [hyper:234,231] member(f1(intersection(X,Y),Z),Y) | member(f1(intersection(X,Y),Z),Z) | equal(intersection(X,Y),Z).
% 554 [hyper:235,261,257,factor] member(f1(intersection(X,Y),intersection(Y,X)),intersection(X,Y)) | equal(intersection(X,Y),intersection(Y,X)).
% 597 [hyper:235,263,259,factor] member(f1(intersection(X,Y),intersection(Y,X)),intersection(Y,X)) | equal(intersection(X,Y),intersection(Y,X)).
% 1893 [hyper:232,554,binarycut:597] equal(intersection(X,Y),intersection(Y,X)).
% 1895 [para:238.1.1,1893.1.1,demod:239,cut:240] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 3
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 293
% derived clauses: 93855
% kept clauses: 366
% kept size sum: 6206
% kept mid-nuclei: 1218
% kept new demods: 11
% forw unit-subs: 6680
% forw double-subs: 71451
% forw overdouble-subs: 8734
% backward subs: 7
% fast unit cutoff: 26773
% full unit cutoff: 0
% dbl unit cutoff: 4
% real runtime : 1.28
% process. runtime: 1.25
% specific non-discr-tree subsumption statistics:
% tried: 9353
% length fails: 0
% strength fails: 6
% predlist fails: 193
% aux str. fails: 8
% by-lit fails: 6
% full subs tried: 9140
% full subs fail: 406
%
% ; 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-4+eq_r.in")
%
%------------------------------------------------------------------------------