%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET015-2 : 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 : 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 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/SET015-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 2 5)
% (binary-unit 10 #f 2 5)
% (binary-double 16 #f 2 5)
% (binary 54 #t 2 5)
% (binary-order 27 #f 2 5)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(24,40,0,48,0,0)
%
%
% START OF PROOF
% 26 [] -subset(X,Y) | -member(Z,X) | member(Z,Y).
% 27 [] member(member_of_1_not_of_2(X,Y),X) | subset(X,Y).
% 28 [] -member(member_of_1_not_of_2(X,Y),Y) | subset(X,Y).
% 29 [] member(X,complement(Y)) | member(X,Y).
% 30 [] -member(X,complement(Y)) | -member(X,Y).
% 31 [] member(X,union(Y,Z)) | -member(X,Y).
% 32 [] member(X,union(Y,Z)) | -member(X,Z).
% 33 [] -member(X,union(Y,Z)) | member(X,Y) | member(X,Z).
% 37 [] -equal_sets(X,Y) | subset(X,Y).
% 38 [] -equal_sets(X,Y) | subset(Y,X).
% 39 [] -subset(Y,X) | -subset(X,Y) | equal_sets(Y,X).
% 41 [] -equal_sets(X,Y) | equal_sets(Y,X).
% 46 [] equal_sets(union(as,bs),cs).
% 47 [] equal_sets(union(bs,as),ds).
% 48 [] -equal_sets(cs,ds).
% 50 [hyper:37,46] subset(union(as,bs),cs).
% 51 [hyper:38,46] subset(cs,union(as,bs)).
% 55 [hyper:37,47] subset(union(bs,as),ds).
% 56 [hyper:38,47] subset(ds,union(bs,as)).
% 79 [hyper:26,27,51] member(member_of_1_not_of_2(cs,X),union(as,bs)) | subset(cs,X).
% 80 [hyper:26,27,56] member(member_of_1_not_of_2(ds,X),union(bs,as)) | subset(ds,X).
% 85 [hyper:32,27] member(member_of_1_not_of_2(X,Y),union(Z,X)) | subset(X,Y).
% 108 [hyper:31,29] member(X,union(Y,Z)) | member(X,complement(Y)).
% 218 [hyper:26,108,50] member(X,complement(as)) | member(X,cs).
% 219 [hyper:26,108,55] member(X,complement(bs)) | member(X,ds).
% 232 [hyper:30,218,27] member(member_of_1_not_of_2(as,X),cs) | subset(as,X).
% 265 [hyper:33,79] member(member_of_1_not_of_2(cs,X),as) | member(member_of_1_not_of_2(cs,X),bs) | subset(cs,X).
% 285 [hyper:30,219,27] member(member_of_1_not_of_2(bs,X),ds) | subset(bs,X).
% 320 [hyper:33,80] member(member_of_1_not_of_2(ds,X),bs) | member(member_of_1_not_of_2(ds,X),as) | subset(ds,X).
% 341 [hyper:26,232,27,factor:binarycut:28] subset(as,cs).
% 395 [hyper:26,285,27,factor:binarycut:28] subset(bs,ds).
% 1056 [hyper:26,85,50] member(member_of_1_not_of_2(bs,X),cs) | subset(bs,X).
% 1057 [hyper:26,85,55] member(member_of_1_not_of_2(as,X),ds) | subset(as,X).
% 1138 [hyper:26,1056,27,factor:binarycut:28] subset(bs,cs).
% 1197 [hyper:26,1138,29] member(X,complement(bs)) | member(X,cs).
% 1238 [hyper:28,1197] member(member_of_1_not_of_2(X,cs),complement(bs)) | subset(X,cs).
% 1284 [hyper:26,1057,27,factor:binarycut:28] subset(as,ds).
% 1418 [hyper:26,1284,29] member(X,complement(as)) | member(X,ds).
% 1469 [hyper:28,1418] member(member_of_1_not_of_2(X,ds),complement(as)) | subset(X,ds).
% 19253 [hyper:30,265,1469] member(member_of_1_not_of_2(cs,ds),bs) | subset(cs,ds).
% 23105 [hyper:30,320,1238] member(member_of_1_not_of_2(ds,cs),as) | subset(ds,cs).
% 24086 [hyper:26,19253,395,binarycut:28] subset(cs,ds).
% 26772 [hyper:26,23105,341,binarycut:28] subset(ds,cs).
% 26848 [hyper:39,26772,cut:24086] equal_sets(ds,cs).
% 26919 [hyper:41,26848,cut:48] 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 2
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 517
% derived clauses: 300460
% kept clauses: 18361
% kept size sum: 324427
% kept mid-nuclei: 4189
% kept new demods: 0
% forw unit-subs: 21889
% forw double-subs: 61368
% forw overdouble-subs: 39812
% backward subs: 198
% fast unit cutoff: 4597
% full unit cutoff: 253
% dbl unit cutoff: 206
% real runtime : 7.79
% process. runtime: 7.76
% specific non-discr-tree subsumption statistics:
% tried: 1628133
% length fails: 111926
% strength fails: 693983
% predlist fails: 336787
% aux str. fails: 15266
% by-lit fails: 19029
% full subs tried: 425046
% full subs fail: 386578
%
% ; 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/SET015-2+noeq.in")
%
%------------------------------------------------------------------------------