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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET135-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 : art03.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 268.4s
% Output   : Assurance 268.4s
% 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/SET135-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(95,40,2,190,0,2,405931,4,1882,406287,5,2505,406288,1,2508,406288,50,2514,406288,40,2514,406383,0,2514,419745,3,2971,421323,4,3192,429996,5,3415,429997,5,3415,429998,1,3415,429998,50,3417,429998,40,3417,430093,0,3417,458632,3,3868,462639,4,4095,467817,5,4318,467818,5,4319,467819,1,4319,467819,50,4321,467819,40,4321,467914,0,4321,501794,3,5107,505922,4,5448,512331,5,5822,512332,5,5823,512332,1,5823,512332,50,5825,512332,40,5825,512427,0,5825,543413,3,6577,549416,4,6951,559089,5,7329,559090,5,7330,559091,1,7330,559091,50,7333,559091,40,7333,559186,0,7333,630514,3,9836,633889,4,11084,655606,5,12334,655606,5,12336,655606,1,12336,655606,50,12342,655606,40,12342,655701,0,12342,703744,3,13593,705522,4,14218,748654,5,14843,748655,5,14843,748655,1,14843,748655,50,14844,748655,40,14844,748750,0,14844,935278,3,19896,1011114,4,22421,1153850,5,24945,1153851,5,24947,1153852,1,24947,1153852,50,24955,1153852,40,24955,1153947,0,24955,1199502,3,26206,1209808,4,26831)
% 
% 
% START OF PROOF
% 1153854 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 1153855 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 1153863 [] member(X,unordered_pair(Y,X)) | -member(X,universal_class).
% 1153868 [] -member(unordered_pair(unordered_pair(X,X),unordered_pair(X,unordered_pair(Y,Y))),cross_product(Z,U)) | member(Y,U).
% 1153869 [] member(unordered_pair(unordered_pair(X,X),unordered_pair(X,unordered_pair(Y,Y))),cross_product(Z,U)) | -member(Y,U) | -member(X,Z).
% 1153874 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 1153875 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 1153876 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 1153877 [] -member(X,complement(Y)) | -member(X,Y).
% 1153878 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 1153919 [] member(regular(X),X) | equal(X,null_class).
% 1153920 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 1153946 [] member(u,universal_class).
% 1153947 [] equal(complement(intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))))),null_class).
% 1153949 [input:1153876,factor] member(X,intersection(Y,Y)) | -member(X,Y).
% 1154037 [binary:1153946,1153863.2] member(u,unordered_pair(X,u)).
% 1154242 [binary:1153946,1153876.2] member(u,intersection(X,universal_class)) | -member(u,X).
% 1154306 [binary:1153946,1153878.2] member(u,complement(X)) | member(u,X).
% 1154328 [binary:1153877,1154306.2] member(u,complement(complement(X))) | -member(u,X).
% 1154330 [binary:1153874,1154306.2] member(u,complement(intersection(X,Y))) | member(u,X).
% 1154331 [binary:1153875,1154306.2] member(u,complement(intersection(X,Y))) | member(u,Y).
% 1154388 [binary:1153946,1154328.2] member(u,complement(complement(universal_class))).
% 1154392 [binary:1154037,1154328.2] member(u,complement(complement(unordered_pair(X,u)))).
% 1154397 [binary:1153877,1154388] -member(u,complement(universal_class)).
% 1154418 [binary:1153877,1154392] -member(u,complement(unordered_pair(X,u))).
% 1155364 [binary:1154397,1154330.2] member(u,complement(intersection(complement(universal_class),X))).
% 1155366 [binary:1154418,1154330.2] member(u,complement(intersection(complement(unordered_pair(X,u)),Y))).
% 1155541 [binary:1153854,1154331,factor] -subclass(complement(intersection(X,Y)),Y) | member(u,Y).
% 1155831 [para:1153920.1.1,1155364.1.2.1] member(u,complement(null_class)) | equal(complement(universal_class),null_class).
% 1155903 [para:1155831.2.1,1154388.1.2.1] member(u,complement(null_class)).
% 1155907 [binary:1153877,1155903] -member(u,null_class).
% 1155913 [binary:1154328.2,1155903] member(u,complement(complement(complement(null_class)))).
% 1155916 [para:1153919.2.2,1155907.1.2] member(regular(X),X) | -member(u,X).
% 1155991 [binary:1153877,1155913] -member(u,complement(complement(null_class))).
% 1155998 [binary:1154242.2,1155913] member(u,intersection(complement(complement(complement(null_class))),universal_class)).
% 1156003 [binary:1154330.2,1155991] member(u,complement(intersection(complement(complement(null_class)),X))).
% 1156070 [binary:1154388,1155916.2] member(regular(complement(complement(universal_class))),complement(complement(universal_class))).
% 1156366 [binary:1153877,1156003] -member(u,intersection(complement(complement(null_class)),X)).
% 1156380 [para:1153920.2.2,1156366.1.2.1.1.1] -member(u,intersection(complement(complement(X)),Y)) | equal(intersection(X,regular(X)),null_class).
% 1156598 [binary:1153949.2,1156070] member(regular(complement(complement(universal_class))),intersection(complement(complement(universal_class)),complement(complement(universal_class)))).
% 1156609 [binary:1153869.2,1155998,binarydemod:1156380,1153868,slowcut:1156598] equal(intersection(complement(null_class),regular(complement(null_class))),null_class).
% 1156924 [para:1156609.1.1,1153874.1.2,binarycut:1153877] -member(X,null_class).
% 1156927 [binary:1153855,1156924] subclass(null_class,X).
% 1163934 [para:1153947.1.1,1155541.1.1,cut:1156927] member(u,complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))).
% 1168903 [binary:1154328.2,1155366] member(u,complement(complement(complement(intersection(complement(unordered_pair(X,u)),Y))))).
% 1221170 [binary:1168903,1153877,slowcut:1163934] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 25
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    15846
%  derived clauses:   2479843
%  kept clauses:      434539
%  kept size sum:     0
%  kept mid-nuclei:   255963
%  kept new demods:   983
%  forw unit-subs:    938736
%  forw double-subs: 231018
%  forw overdouble-subs: 74032
%  backward subs:     1252
%  fast unit cutoff:  23874
%  full unit cutoff:  2760
%  dbl  unit cutoff:  481
%  real runtime  :  273.82
%  process. runtime:  271.68
% specific non-discr-tree subsumption statistics: 
%  tried:           8105696
%  length fails:    137312
%  strength fails:  1835911
%  predlist fails:  5345766
%  aux str. fails:  84914
%  by-lit fails:    16886
%  full subs tried: 672374
%  full subs fail:  596709
% 
% ; 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/SET135-6+eq_r.in")
% 
%------------------------------------------------------------------------------