TSTP Solution File: SET021-6 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET021-6 : 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 : 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 59.5s
% Output   : Assurance 59.5s
% 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/SET021-6+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 6 9)
% (binary-unit 9 #f 6 9)
% (binary-double 9 #f 6 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 6 9)
% (binary-order 25 #f 6 9)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(94,40,1,188,0,1,504536,4,1888,508792,5,2503,508793,1,2506,508793,50,2512,508793,40,2512,508887,0,2512,522658,3,2981,524770,4,3192,537771,5,3413,537771,5,3413,537772,1,3413,537772,50,3414,537772,40,3414,537866,0,3415,565105,3,3866,568726,4,4091,579555,5,4316,579556,1,4316,579556,50,4318,579556,40,4318,579650,0,4318,613116,3,5069,617162,4,5445,624677,5,5819,624678,5,5820,624680,1,5820,624680,50,5822,624680,40,5822,624774,0,5822)
% 
% 
% START OF PROOF
% 582369 [?] ?
% 582384 [?] ?
% 624682 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 624686 [] -equal(X,Y) | subclass(X,Y).
% 624689 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 624690 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 624695 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 624696 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 624697 [] member(ordered_pair(X,Y),cross_product(Z,U)) | -member(Y,U) | -member(X,Z).
% 624698 [] equal(ordered_pair(first(X),second(X)),X) | -member(X,cross_product(Y,Z)).
% 624702 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 624705 [] -member(X,complement(Y)) | -member(X,Y).
% 624706 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 624748 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 624773 [] member(ordered_pair(u,v),cross_product(universal_class,universal_class)).
% 624774 [] -equal(second(ordered_pair(u,v)),v).
% 624776 [binary:624689.2,624774] -member(second(ordered_pair(u,v)),unordered_pair(v,X)) | equal(second(ordered_pair(u,v)),X).
% 624779 [binary:624695,624773] member(u,universal_class).
% 624780 [binary:624696,624773] member(v,universal_class).
% 624790 [binary:624682,624779] -subclass(universal_class,X) | member(u,X).
% 624794 [binary:624697.3,624779] member(ordered_pair(u,X),cross_product(universal_class,Y)) | -member(X,Y).
% 624799 [binary:624706.2,624779] member(u,complement(X)) | member(u,X).
% 624806 [binary:624690.2,624780] member(v,unordered_pair(v,X)).
% 624814 [binary:624706.2,624780] member(v,complement(X)) | member(v,X).
% 624907 [binary:624696.2,624776] -member(ordered_pair(X,second(ordered_pair(u,v))),cross_product(Y,unordered_pair(v,Z))) | equal(second(ordered_pair(u,v)),Z).
% 625384 [binary:624705.2,624790.2] -member(u,complement(X)) | -subclass(universal_class,X).
% 625944 [binary:624806,624794.2] member(ordered_pair(u,v),cross_product(universal_class,unordered_pair(v,X))).
% 626346 [binary:624682,624799.2,factor:binarydemod:625384] -subclass(X,complement(X)) | -subclass(universal_class,X).
% 627904 [binary:624686.2,626346.2] -subclass(X,complement(X)) | -equal(universal_class,X).
% 628140 [binary:624748.2,627904.2,cut:582369] equal(intersection(universal_class,regular(universal_class)),null_class).
% 628721 [para:628140.1.1,624702.1.2] -member(X,null_class) | member(X,universal_class).
% 628774 [binary:624697.2,628721.2,factor:cut:582384] -member(X,null_class).
% 628806 [binary:624814.2,628774] member(v,complement(null_class)).
% 628907 [binary:624705.2,628806] -member(v,complement(complement(null_class))).
% 629170 [binary:624706.3,628907,cut:624780] member(v,complement(complement(complement(null_class)))).
% 631501 [binary:624794.2,629170] member(ordered_pair(u,v),cross_product(universal_class,complement(complement(complement(null_class))))).
% 634583 [para:624698.1.1,624907.1.1,slowcut:625944,slowcut:631501,slowcut:624774] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using sos strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 15
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    4908
%  derived clauses:   938370
%  kept clauses:      168079
%  kept size sum:     0
%  kept mid-nuclei:   37846
%  kept new demods:   340
%  forw unit-subs:    242621
%  forw double-subs: 43769
%  forw overdouble-subs: 9223
%  backward subs:     255
%  fast unit cutoff:  4105
%  full unit cutoff:  2810
%  dbl  unit cutoff:  187
%  real runtime  :  60.6
%  process. runtime:  59.56
% specific non-discr-tree subsumption statistics: 
%  tried:           546460
%  length fails:    28767
%  strength fails:  83566
%  predlist fails:  345631
%  aux str. fails:  5310
%  by-lit fails:    3471
%  full subs tried: 78144
%  full subs fail:  68826
% 
% ; 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/SET021-6+eq_r.in")
% 
%------------------------------------------------------------------------------