TSTP Solution File: NUM078-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NUM078-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 : 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 219.3s
% Output : Assurance 219.3s
% 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/NUM/NUM078-1+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(162,40,1,324,0,1,292604,4,2116,293013,5,2802,293014,1,2805,293014,50,2812,293014,40,2812,293176,0,2830,317035,3,4232,320363,4,4932,334519,5,5631,334519,5,5631,334520,1,5631,334520,50,5635,334520,40,5635,334682,0,5635,363398,3,6186,366101,4,6461,372729,5,6736,372730,5,6739,372730,1,6739,372730,50,6746,372730,40,6746,372892,0,6747,402676,3,7609,406209,4,8060,415528,5,8448,415529,5,8449,415529,1,8449,415529,50,8451,415529,40,8451,415691,0,8452,452077,3,9303,457214,4,9729,463008,5,10154,463008,5,10155,463008,1,10155,463008,50,10158,463008,40,10158,463170,0,10158,554677,3,14516,561719,4,16684,581036,5,18861,581037,5,18864,581037,1,18864,581037,50,18868,581037,40,18868,581199,0,18869,627687,3,20270,628638,4,20970,663260,5,21670,663260,1,21670,663260,50,21672,663260,40,21672,663422,0,21672)
%
%
% START OF PROOF
% 601968 [?] ?
% 602099 [?] ?
% 663262 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 663263 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 663265 [] subclass(X,universal_class).
% 663266 [] -equal(X,Y) | subclass(X,Y).
% 663267 [] -equal(X,Y) | subclass(Y,X).
% 663268 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 663269 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 663270 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 663273 [] equal(unordered_pair(X,X),singleton(X)).
% 663282 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 663284 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 663285 [] -member(X,complement(Y)) | -member(X,Y).
% 663286 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 663327 [] member(regular(X),X) | equal(X,null_class).
% 663328 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 663418 [] equal(integer_of(X),X) | -member(X,omega).
% 663419 [] equal(integer_of(X),null_class) | member(X,omega).
% 663421 [] member(u,y).
% 663422 [] member(u,intersection(u,y)).
% 663431 [binary:663421,663262] -subclass(y,X) | member(u,X).
% 663441 [binary:663262,663263] member(not_subclass_element(X,Y),Z) | -subclass(X,Z) | subclass(X,Y).
% 663443 [binary:663265,663431] member(u,universal_class).
% 663467 [para:663273.1.1,663269.1.2] -member(X,singleton(Y)) | equal(X,Y).
% 663475 [binary:663443,663270.2] member(u,unordered_pair(u,X)).
% 663487 [para:663273.1.1,663475.1.2] member(u,singleton(u)).
% 663488 [binary:663262,663487] -subclass(singleton(u),X) | member(u,X).
% 663566 [binary:663422,663282] member(u,u).
% 663621 [binary:663566,663284.2] member(u,intersection(X,u)) | -member(u,X).
% 663662 [binary:663443,663286.2] member(u,complement(X)) | member(u,X).
% 663672 [binary:663266,663327.2] member(regular(X),X) | subclass(X,null_class).
% 663721 [binary:663285,663662.2] member(u,complement(complement(X))) | -member(u,X).
% 663806 [binary:663488,663672.2,cut:602099] member(regular(singleton(u)),singleton(u)).
% 663842 [binary:663467,663806] equal(regular(singleton(u)),u).
% 665252 [binary:663266,663419] subclass(integer_of(X),null_class) | member(X,omega).
% 668506 [binary:663422,663721.2] member(u,complement(complement(intersection(u,y)))).
% 669511 [binary:665252,663441.2,cut:602099] subclass(integer_of(X),Y) | member(X,omega).
% 669659 [para:663419.1.1,669511.1.1] member(X,omega) | subclass(null_class,Y).
% 669672 [binary:663418.2,669659] equal(integer_of(X),X) | subclass(null_class,Y).
% 669877 [binary:663285,668506] -member(u,complement(intersection(u,y))).
% 669932 [binary:663267,669672] subclass(X,integer_of(X)) | subclass(null_class,Y).
% 670092 [binary:663441.2,669932,factor:cut:602099] subclass(null_class,X).
% 670094 [binary:663268,670092] -subclass(X,null_class) | equal(X,null_class).
% 670120 [para:663328.2.2,670094.1.2,factor:cut:601968] equal(intersection(X,regular(X)),null_class).
% 670125 [para:670120.1.1,663282.1.2] -member(X,null_class) | member(X,Y).
% 670128 [para:663842.1.1,670120.1.1.2] equal(intersection(singleton(u),u),null_class).
% 670137 [binary:663662.2,670125,slowcut:669877] member(u,complement(null_class)).
% 670148 [binary:663285,670137] -member(u,null_class).
% 689613 [binary:663487,663621.2,demod:670128,cut:670148] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred 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: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 14014
% derived clauses: 1505797
% kept clauses: 351829
% kept size sum: 812844
% kept mid-nuclei: 110430
% kept new demods: 689
% forw unit-subs: 557791
% forw double-subs: 184481
% forw overdouble-subs: 70866
% backward subs: 961
% fast unit cutoff: 18577
% full unit cutoff: 2594
% dbl unit cutoff: 1428
% real runtime : 220.91
% process. runtime: 219.97
% specific non-discr-tree subsumption statistics:
% tried: 9138701
% length fails: 200861
% strength fails: 1679814
% predlist fails: 4482819
% aux str. fails: 384534
% by-lit fails: 898415
% full subs tried: 1100168
% full subs fail: 1034298
%
% ; 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/NUM/NUM078-1+eq_r.in")
%
%------------------------------------------------------------------------------