TSTP Solution File: SET247-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET247-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 : art05.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.7s
% Output : Assurance 188.7s
% 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/SET247-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,1,368575,4,2104,391570,5,2803,391571,1,2806,391571,50,2813,391571,40,2813,391685,0,2813,416304,3,4216,419892,4,4914,434962,5,5614,434962,5,5614,434963,1,5614,434963,50,5617,434963,40,5617,435077,0,5617,465441,3,6168,469033,4,6443,483322,5,6718,483324,5,6719,483324,1,6719,483324,50,6721,483324,40,6721,483438,0,6721,514858,3,7572,518697,4,7999,529445,5,8422,529446,5,8423,529446,1,8423,529446,50,8425,529446,40,8425,529560,0,8425,563102,3,9276,567359,4,9703,571230,5,10134,571231,5,10136,571232,1,10136,571232,50,10138,571232,40,10138,571346,0,10138,662265,3,14521,668289,4,16665,686898,5,18839,686899,5,18841,686899,1,18841,686899,50,18846,686899,40,18846,687013,0,18846)
%
%
% START OF PROOF
% 686901 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 686902 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 686903 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 686904 [] subclass(X,universal_class).
% 686907 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 686915 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 686917 [] equal(ordered_pair(first(X),second(X)),X) | -member(X,cross_product(Y,Z)).
% 686922 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 686924 [] -member(X,complement(Y)) | -member(X,Y).
% 686928 [] equal(intersection(X,cross_product(Y,Z)),restrict(X,Y,Z)).
% 686966 [] member(regular(X),X) | equal(X,null_class).
% 687013 [] -equal(restrict(xr,x,null_class),null_class).
% 687027 [binary:686904,686901.2] member(X,universal_class) | -member(X,Y).
% 687031 [binary:686901.3,686901] -member(X,Y) | -subclass(Y,Z) | -subclass(Z,U) | member(X,U).
% 687039 [binary:686901,686902] member(not_subclass_element(X,Y),Z) | -subclass(X,Z) | subclass(X,Y).
% 687060 [binary:687013,686907.3] -subclass(restrict(xr,x,null_class),null_class) | -subclass(null_class,restrict(xr,x,null_class)).
% 687089 [binary:686902,687027.2] member(not_subclass_element(X,Y),universal_class) | subclass(X,Y).
% 687254 [binary:686901.3,686924,factor] -subclass(X,complement(X)) | -member(Y,X).
% 687255 [binary:686902,686924] -member(not_subclass_element(complement(X),Y),X) | subclass(complement(X),Y).
% 687283 [para:686917.1.1,686915.1.1,factor] -member(X,cross_product(Y,Z)) | member(second(X),Z).
% 687410 [binary:686902,686922] member(not_subclass_element(intersection(X,Y),Z),Y) | subclass(intersection(X,Y),Z).
% 687678 [binary:687254.2,686966] -subclass(X,complement(X)) | equal(X,null_class).
% 722045 [binary:687089,687255] subclass(complement(universal_class),X).
% 722070 [binary:687254,722045] -member(X,complement(universal_class)).
% 722075 [binary:687678,722045] equal(complement(universal_class),null_class).
% 722083 [binary:687031.2,722045,demod:722075,slowcut:722045,slowcut:722070] -member(X,null_class).
% 722111 [binary:686902,722083] subclass(null_class,X).
% 722115 [binary:687039,722083] -subclass(X,null_class) | subclass(X,Y).
% 722136 [binary:687060.2,722111] -subclass(restrict(xr,x,null_class),null_class).
% 723708 [binary:722083,687283.2] -member(X,cross_product(Y,null_class)).
% 724300 [binary:686966,723708] equal(cross_product(X,null_class),null_class).
% 724754 [para:724300.1.1,686928.1.1.2] equal(intersection(X,null_class),restrict(X,Y,null_class)).
% 727274 [binary:722136,722115.2,demod:724754] -subclass(intersection(xr,null_class),null_class).
% 731627 [binary:686903,687410,slowcut:727274] 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: 11488
% derived clauses: 1604939
% kept clauses: 318049
% kept size sum: 436339
% kept mid-nuclei: 67680
% kept new demods: 517
% forw unit-subs: 669671
% forw double-subs: 133104
% forw overdouble-subs: 52930
% backward subs: 1288
% fast unit cutoff: 25207
% full unit cutoff: 5657
% dbl unit cutoff: 415
% real runtime : 199.28
% process. runtime: 197.46
% specific non-discr-tree subsumption statistics:
% tried: 7421741
% length fails: 221096
% strength fails: 1107231
% predlist fails: 4648773
% aux str. fails: 123242
% by-lit fails: 104532
% full subs tried: 1168287
% full subs fail: 1113943
%
% ; 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/SET247-6+eq_r.in")
%
%------------------------------------------------------------------------------