TSTP Solution File: SET005-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET005-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 : 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 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/SET005-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(16,40,0,32,0,1)
%
%
% START OF PROOF
% 17 [] -subset(X,Y) | -member(Z,X) | member(Z,Y).
% 18 [] member(member_of_1_not_of_2(X,Y),X) | subset(X,Y).
% 19 [] -member(member_of_1_not_of_2(X,Y),Y) | subset(X,Y).
% 23 [] -intersection(X,Y,Z) | -member(U,Z) | member(U,X).
% 24 [] -intersection(X,Y,Z) | -member(U,Z) | member(U,Y).
% 25 [] -intersection(X,Y,Z) | -member(U,X) | -member(U,Y) | member(U,Z).
% 26 [] member(h(X,Y,Z),X) | member(h(X,Y,Z),Z) | intersection(X,Y,Z).
% 27 [] member(h(X,Y,Z),Y) | member(h(X,Y,Z),Z) | intersection(X,Y,Z).
% 28 [] -member(h(X,Y,Z),X) | -member(h(X,Y,Z),Z) | -member(h(X,Y,Z),Y) | intersection(X,Y,Z).
% 29 [] intersection(a,b,a^ib).
% 30 [] intersection(b,c,b^ic).
% 31 [] intersection(a,b^ic,a^ib^ic).
% 32 [] -intersection(a^ib,c,a^ib^ic).
% 58 [hyper:23,18,29] member(member_of_1_not_of_2(a^ib,X),a) | subset(a^ib,X).
% 59 [hyper:23,18,30] member(member_of_1_not_of_2(b^ic,X),b) | subset(b^ic,X).
% 60 [hyper:23,18,31] member(member_of_1_not_of_2(a^ib^ic,X),a) | subset(a^ib^ic,X).
% 62 [hyper:24,18,29] member(member_of_1_not_of_2(a^ib,X),b) | subset(a^ib,X).
% 63 [hyper:24,18,30] member(member_of_1_not_of_2(b^ic,X),c) | subset(b^ic,X).
% 64 [hyper:24,18,31] member(member_of_1_not_of_2(a^ib^ic,X),b^ic) | subset(a^ib^ic,X).
% 84 [hyper:17,58,18,factor:binarycut:19] subset(a^ib,a).
% 116 [hyper:17,59,18,factor:binarycut:19] subset(b^ic,b).
% 194 [hyper:17,62,18,factor:binarycut:19] subset(a^ib,b).
% 233 [hyper:17,63,18,factor:binarycut:19] subset(b^ic,c).
% 278 [hyper:17,64,116] member(member_of_1_not_of_2(a^ib^ic,X),b) | subset(a^ib^ic,X).
% 280 [hyper:17,64,233] member(member_of_1_not_of_2(a^ib^ic,X),c) | subset(a^ib^ic,X).
% 353 [hyper:25,278,29,binarycut:60] member(member_of_1_not_of_2(a^ib^ic,X),a^ib) | subset(a^ib^ic,X).
% 391 [hyper:17,280,18,factor:binarycut:19] subset(a^ib^ic,c).
% 448 [hyper:17,353,18,factor:binarycut:19] subset(a^ib^ic,a^ib).
% 530 [hyper:32,26] member(h(a^ib,c,a^ib^ic),a^ib^ic) | member(h(a^ib,c,a^ib^ic),a^ib).
% 1077 [hyper:17,27,391,factor] member(h(X,c,a^ib^ic),c) | intersection(X,c,a^ib^ic).
% 1581 [hyper:17,530,448] member(h(a^ib,c,a^ib^ic),a^ib).
% 1641 [hyper:17,1581,84] member(h(a^ib,c,a^ib^ic),a).
% 1643 [hyper:17,1581,194] member(h(a^ib,c,a^ib^ic),b).
% 1677 [hyper:28,1581,27,binarycut:1077,cut:32] member(h(a^ib,c,a^ib^ic),c).
% 1774 [hyper:25,1643,30,cut:1677] member(h(a^ib,c,a^ib^ic),b^ic).
% 2018 [hyper:25,1774,31,cut:1641] member(h(a^ib,c,a^ib^ic),a^ib^ic).
% 2102 [hyper:28,2018,cut:1581,cut:1677] intersection(a^ib,c,a^ib^ic).
% 2125 [hyper:32,2102] 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: 52
% derived clauses: 4311
% kept clauses: 801
% kept size sum: 13302
% kept mid-nuclei: 999
% kept new demods: 0
% forw unit-subs: 661
% forw double-subs: 454
% forw overdouble-subs: 1196
% backward subs: 2
% fast unit cutoff: 165
% full unit cutoff: 0
% dbl unit cutoff: 17
% real runtime : 0.15
% process. runtime: 0.14
% specific non-discr-tree subsumption statistics:
% tried: 41065
% length fails: 5233
% strength fails: 20618
% predlist fails: 7140
% aux str. fails: 66
% by-lit fails: 180
% full subs tried: 7739
% full subs fail: 6464
%
% ; 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/SET005-1+noeq.in")
%
%------------------------------------------------------------------------------