TSTP Solution File: SET013-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET013-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 : art10.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-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,1,48,0,2)
%
%
% 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).
% 34 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 35 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 36 [] -member(X,intersection(Y,Z)) | 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).
% 46 [] equal_sets(intersection(as,bs),cs).
% 47 [] equal_sets(intersection(bs,as),ds).
% 48 [] -equal_sets(cs,ds).
% 50 [hyper:37,46] subset(intersection(as,bs),cs).
% 51 [hyper:38,46] subset(cs,intersection(as,bs)).
% 55 [hyper:37,47] subset(intersection(bs,as),ds).
% 56 [hyper:38,47] subset(ds,intersection(bs,as)).
% 79 [hyper:26,27,51] member(member_of_1_not_of_2(cs,X),intersection(as,bs)) | subset(cs,X).
% 80 [hyper:26,27,56] member(member_of_1_not_of_2(ds,X),intersection(bs,as)) | subset(ds,X).
% 81 [hyper:26,27,27] member(member_of_1_not_of_2(X,Z),X) | member(member_of_1_not_of_2(X,Y),Z) | subset(X,Y).
% 107 [hyper:28,29] member(member_of_1_not_of_2(X,Y),complement(Y)) | subset(X,Y).
% 233 [hyper:35,79] member(member_of_1_not_of_2(cs,X),as) | subset(cs,X).
% 234 [hyper:36,79] member(member_of_1_not_of_2(cs,X),bs) | subset(cs,X).
% 252 [hyper:26,233,27,factor:binarycut:28] subset(cs,as).
% 289 [hyper:35,80] member(member_of_1_not_of_2(ds,X),bs) | subset(ds,X).
% 290 [hyper:36,80] member(member_of_1_not_of_2(ds,X),as) | subset(ds,X).
% 306 [hyper:26,252,29] member(X,complement(cs)) | member(X,as).
% 354 [hyper:26,234,27,factor:binarycut:28] subset(cs,bs).
% 387 [hyper:26,354,29] member(X,complement(cs)) | member(X,bs).
% 422 [hyper:34,387,306] member(X,intersection(bs,as)) | member(X,complement(cs)).
% 3694 [hyper:26,422,55] member(X,complement(cs)) | member(X,ds).
% 3750 [hyper:30,3694,81,factor:binarycut:28] subset(cs,ds).
% 3853 [hyper:39,3750,107,cut:48] member(member_of_1_not_of_2(ds,cs),complement(cs)).
% 3857 [hyper:39,3750,289,cut:48] member(member_of_1_not_of_2(ds,cs),bs).
% 3858 [hyper:39,3750,290,cut:48] member(member_of_1_not_of_2(ds,cs),as).
% 3983 [hyper:34,3858,3857] member(member_of_1_not_of_2(ds,cs),intersection(as,bs)).
% 4393 [hyper:26,3983,50] member(member_of_1_not_of_2(ds,cs),cs).
% 4417 [hyper:30,4393,cut:3853] 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: 169
% derived clauses: 30454
% kept clauses: 2567
% kept size sum: 39034
% kept mid-nuclei: 1146
% kept new demods: 0
% forw unit-subs: 2854
% forw double-subs: 6225
% forw overdouble-subs: 3542
% backward subs: 39
% fast unit cutoff: 893
% full unit cutoff: 48
% dbl unit cutoff: 43
% real runtime : 0.45
% process. runtime: 0.45
% specific non-discr-tree subsumption statistics:
% tried: 63172
% length fails: 2351
% strength fails: 31209
% predlist fails: 12984
% aux str. fails: 574
% by-lit fails: 231
% full subs tried: 15279
% full subs fail: 11739
%
% ; 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-2+noeq.in")
%
%------------------------------------------------------------------------------