%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET011-1 : 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 : 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/SET011-1+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 7)
% (binary-unit 10 #f 2 7)
% (binary-double 16 #f 2 7)
% (binary 54 #t 2 7)
% (binary-order 27 #f 2 7)
% (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(21,40,0,42,0,0)
%
%
% START OF PROOF
% 22 [] -subset(X,Y) | -member(Z,X) | member(Z,Y).
% 23 [] member(member_of_1_not_of_2(X,Y),X) | subset(X,Y).
% 24 [] -member(member_of_1_not_of_2(X,Y),Y) | subset(X,Y).
% 31 [] member(h(X,Y,Z),X) | member(h(X,Y,Z),Z) | intersection(X,Y,Z).
% 32 [] member(h(X,Y,Z),Y) | member(h(X,Y,Z),Z) | intersection(X,Y,Z).
% 33 [] -member(h(X,Y,Z),X) | -member(h(X,Y,Z),Z) | -member(h(X,Y,Z),Y) | intersection(X,Y,Z).
% 34 [] -difference(X,Y,Z) | -member(U,Z) | member(U,X).
% 35 [] -difference(X,Y,Z) | -member(U,Z) | -member(U,Y).
% 36 [] -difference(X,Y,Z) | -member(U,X) | member(U,Z) | member(U,Y).
% 40 [] difference(a,b,a^db).
% 41 [] difference(a,a^db,a^d_a^db).
% 42 [] -intersection(a,b,a^d_a^db).
% 73 [hyper:34,23,41] member(member_of_1_not_of_2(a^d_a^db,X),a) | subset(a^d_a^db,X).
% 133 [hyper:22,73,23] member(member_of_1_not_of_2(a^d_a^db,X),a) | member(member_of_1_not_of_2(a^d_a^db,Y),X) | subset(a^d_a^db,Y).
% 135 [hyper:22,73,23,factor:binarycut:24] subset(a^d_a^db,a).
% 499 [hyper:42,31] member(h(a,b,a^d_a^db),a^d_a^db) | member(h(a,b,a^d_a^db),a).
% 946 [hyper:22,499,135] member(h(a,b,a^d_a^db),a).
% 981 [hyper:36,499,41] member(h(a,b,a^d_a^db),a^db) | member(h(a,b,a^d_a^db),a^d_a^db).
% 1109 [hyper:42,32] member(h(a,b,a^d_a^db),a^d_a^db) | member(h(a,b,a^d_a^db),b).
% 1963 [hyper:35,1109,40,binarycut:981] member(h(a,b,a^d_a^db),a^d_a^db).
% 16196 [hyper:36,133,40,factor:factor:binarycut:24] member(member_of_1_not_of_2(a^d_a^db,b),a^db) | subset(a^d_a^db,b).
% 18727 [hyper:35,16196,23,slowcut:41] subset(a^d_a^db,b).
% 18745 [hyper:22,18727,1963] member(h(a,b,a^d_a^db),b).
% 18815 [hyper:33,18745,cut:1963,cut:946] intersection(a,b,a^d_a^db).
% 18876 [hyper:42,18815] 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 7
% clause depth limited to 2
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 113
% derived clauses: 82089
% kept clauses: 4967
% kept size sum: 91045
% kept mid-nuclei: 11312
% kept new demods: 0
% forw unit-subs: 13302
% forw double-subs: 23099
% forw overdouble-subs: 27946
% backward subs: 18
% fast unit cutoff: 200
% full unit cutoff: 2
% dbl unit cutoff: 241
% real runtime : 3.77
% process. runtime: 3.77
% specific non-discr-tree subsumption statistics:
% tried: 2012379
% length fails: 471781
% strength fails: 433949
% predlist fails: 611833
% aux str. fails: 4747
% by-lit fails: 3693
% full subs tried: 484376
% full subs fail: 456784
%
% ; 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/SET011-1+noeq.in")
%
%------------------------------------------------------------------------------