TSTP Solution File: SET013-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET013-1 : 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 : 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 338.2s
% Output : Assurance 338.2s
% 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-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 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(22,40,1,44,0,1,26441,4,2049,58940,5,2702,58940,1,2702,58940,50,2703,58940,40,2703,58962,0,2703,59131,50,2703,59153,0,2703,64318,50,3158,64340,0,3158,72117,3,3410,73300,4,3535,74178,5,3659,74179,5,3659,74179,1,3659,74179,50,3660,74179,40,3660,74201,0,3660,107332,3,4461,112243,4,4861,115793,5,5261,115794,5,5261,115794,1,5261,115794,50,5262,115794,40,5262,115816,0,5262,154760,3,7963,157137,4,9313,159578,5,10663,159579,5,10663,159579,1,10663,159579,50,10663,159579,40,10663,159601,0,10663,215089,3,12016,215823,4,12689,221244,5,13364,221245,1,13364,221245,50,13365,221245,40,13365,221267,0,13365,585099,3,19617,681875,4,22741,711178,5,25866,711179,5,25867,711179,1,25867,711179,50,25871,711179,40,25871,711201,0,25871,800812,3,28572,805153,4,29935,845228,5,31272,845230,5,31273,845230,1,31273,845230,50,31276,845230,40,31276,845252,0,31276,865841,3,32627,869339,4,33303,873009,5,33977,873010,5,33978,873010,1,33978,873010,50,33980,873010,40,33980,873032,0,33980)
%
%
% START OF PROOF
% 873013 [] member(member_of_1_not_of_2(X,Y),X) | subset(X,Y).
% 873014 [] -member(member_of_1_not_of_2(X,Y),Y) | subset(X,Y).
% 873020 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 873021 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 873022 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 873025 [] -subset(Y,X) | -subset(X,Y) | equal_sets(Y,X).
% 873032 [] -equal_sets(intersection(as,bs),intersection(bs,as)).
% 873055 [binary:873013,873021] member(member_of_1_not_of_2(intersection(X,Y),Z),X) | subset(intersection(X,Y),Z).
% 873057 [binary:873013,873022] member(member_of_1_not_of_2(intersection(X,Y),Z),Y) | subset(intersection(X,Y),Z).
% 873065 [binary:873014,873020] -member(member_of_1_not_of_2(X,intersection(Y,Z)),Y) | -member(member_of_1_not_of_2(X,intersection(Y,Z)),Z) | subset(X,intersection(Y,Z)).
% 873233 [binary:873057,873065] -member(member_of_1_not_of_2(intersection(X,Y),intersection(Y,Z)),Z) | subset(intersection(X,Y),intersection(Y,Z)).
% 879074 [binary:873055,873233] subset(intersection(X,Y),intersection(Y,X)).
% 879108 [binary:873025,879074,cut:879074,slowcut:873032] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using weight-order strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 54
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 27614
% derived clauses: 3040647
% kept clauses: 303106
% kept size sum: 401350
% kept mid-nuclei: 83912
% kept new demods: 0
% forw unit-subs: 839731
% forw double-subs: 471539
% forw overdouble-subs: 346120
% backward subs: 1173
% fast unit cutoff: 94302
% full unit cutoff: 16202
% dbl unit cutoff: 1905
% real runtime : 342.36
% process. runtime: 340.27
% specific non-discr-tree subsumption statistics:
% tried: 73062910
% length fails: 2929830
% strength fails: 23880770
% predlist fails: 29724290
% aux str. fails: 1955042
% by-lit fails: 600476
% full subs tried: 13330085
% full subs fail: 12975196
%
% ; 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-1+noeq.in")
%
%------------------------------------------------------------------------------