TSTP Solution File: SET246-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET246-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 188.1s
% Output : Assurance 188.1s
% 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/SET246-6+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: big
%
% strategies selected:
% (hyper 28 #f 6 9)
% (binary-unit 28 #f 6 9)
% (binary-double 11 #f 6 9)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 6 9)
% (binary-order 28 #f 6 9)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(114,40,0,228,0,0,370496,4,2104,393463,5,2802,393464,1,2805,393464,50,2812,393464,40,2812,393578,0,2812,418369,3,4213,422196,4,4914,436905,5,5613,436906,5,5613,436907,1,5613,436907,50,5616,436907,40,5616,437021,0,5616,467179,3,6167,470695,4,6442,485134,5,6717,485136,5,6717,485137,1,6717,485137,50,6720,485137,40,6720,485251,0,6720,518088,3,7597,521258,4,7996,532356,5,8421,532358,5,8421,532358,1,8421,532358,50,8424,532358,40,8424,532472,0,8424,568202,3,9275,572682,4,9700,576731,5,10125,576731,5,10126,576731,1,10126,576731,50,10129,576731,40,10129,576845,0,10129,671235,3,14483,678542,4,16655,697069,5,18830,697070,5,18832,697070,1,18832,697070,50,18836,697070,40,18836,697184,0,18836)
%
%
% START OF PROOF
% 697072 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 697073 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 697074 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 697075 [] subclass(X,universal_class).
% 697078 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 697085 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 697088 [] equal(ordered_pair(first(X),second(X)),X) | -member(X,cross_product(Y,Z)).
% 697093 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 697095 [] -member(X,complement(Y)) | -member(X,Y).
% 697099 [] equal(intersection(X,cross_product(Y,Z)),restrict(X,Y,Z)).
% 697137 [] member(regular(X),X) | equal(X,null_class).
% 697184 [] -equal(restrict(xr,null_class,y),null_class).
% 697198 [binary:697075,697072.2] member(X,universal_class) | -member(X,Y).
% 697202 [binary:697072.3,697072] -member(X,Y) | -subclass(Y,Z) | -subclass(Z,U) | member(X,U).
% 697210 [binary:697072,697073] member(not_subclass_element(X,Y),Z) | -subclass(X,Z) | subclass(X,Y).
% 697231 [binary:697184,697078.3] -subclass(restrict(xr,null_class,y),null_class) | -subclass(null_class,restrict(xr,null_class,y)).
% 697260 [binary:697073,697198.2] member(not_subclass_element(X,Y),universal_class) | subclass(X,Y).
% 697425 [binary:697072.3,697095,factor] -subclass(X,complement(X)) | -member(Y,X).
% 697426 [binary:697073,697095] -member(not_subclass_element(complement(X),Y),X) | subclass(complement(X),Y).
% 697448 [para:697088.1.1,697085.1.1,factor] -member(X,cross_product(Y,Z)) | member(first(X),Y).
% 697581 [binary:697073,697093] member(not_subclass_element(intersection(X,Y),Z),Y) | subclass(intersection(X,Y),Z).
% 697849 [binary:697425.2,697137] -subclass(X,complement(X)) | equal(X,null_class).
% 732216 [binary:697260,697426] subclass(complement(universal_class),X).
% 732241 [binary:697425,732216] -member(X,complement(universal_class)).
% 732246 [binary:697849,732216] equal(complement(universal_class),null_class).
% 732254 [binary:697202.2,732216,demod:732246,slowcut:732216,slowcut:732241] -member(X,null_class).
% 732282 [binary:697073,732254] subclass(null_class,X).
% 732286 [binary:697210,732254] -subclass(X,null_class) | subclass(X,Y).
% 732307 [binary:697231.2,732282] -subclass(restrict(xr,null_class,y),null_class).
% 733452 [binary:732254,697448.2] -member(X,cross_product(null_class,Y)).
% 734086 [binary:697137,733452] equal(cross_product(null_class,X),null_class).
% 734922 [para:734086.1.1,697099.1.1.2] equal(intersection(X,null_class),restrict(X,null_class,Y)).
% 737445 [binary:732307,732286.2,demod:734922] -subclass(intersection(xr,null_class),null_class).
% 741798 [binary:697074,697581,slowcut:737445] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using term-depth-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
% clause length limited to 9
% clause depth limited to 6
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 11680
% derived clauses: 1611059
% kept clauses: 321334
% kept size sum: 436339
% kept mid-nuclei: 67850
% kept new demods: 517
% forw unit-subs: 664491
% forw double-subs: 133680
% forw overdouble-subs: 53098
% backward subs: 1292
% fast unit cutoff: 25294
% full unit cutoff: 5750
% dbl unit cutoff: 421
% real runtime : 199.34
% process. runtime: 196.92
% specific non-discr-tree subsumption statistics:
% tried: 7592832
% length fails: 228464
% strength fails: 1139865
% predlist fails: 4754890
% aux str. fails: 124173
% by-lit fails: 106147
% full subs tried: 1189772
% full subs fail: 1135270
%
% ; 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/SET246-6+eq_r.in")
%
%------------------------------------------------------------------------------