TSTP Solution File: NUM098-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : NUM098-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 : art08.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 417.1s
% Output   : Assurance 417.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/NUM/NUM098-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(160,40,0,320,0,0,227425,4,2151,239738,5,2802,239739,1,2802,239739,50,2809,239739,40,2809,239899,0,2809,264868,3,4296,267891,4,4910,288481,5,5610,288481,5,5610,288482,1,5610,288482,50,5613,288482,40,5613,288642,0,5613,318982,3,6165,323095,4,6439,335447,5,6714,335448,5,6714,335448,1,6714,335448,50,6717,335448,40,6717,335608,0,6717,368104,3,7573,371827,4,7999,379533,5,8418,379534,5,8418,379535,1,8418,379535,50,8421,379535,40,8421,379695,0,8421,412567,3,9272,416944,4,9697,424313,5,10124,424313,5,10125,424313,1,10125,424313,50,10127,424313,40,10127,424473,0,10127,529464,3,14478,536215,4,16653,564602,5,18830,564602,5,18831,564603,1,18831,564603,50,18836,564603,40,18836,564763,0,18836,609115,3,20237,610202,4,20937,647095,5,21637,647095,1,21637,647095,50,21638,647095,40,21638,647255,0,21638,768215,3,24562,800929,4,25990,940999,5,27568,940999,5,27569,941000,1,27569,941000,50,27576,941000,40,27576,941160,0,27609,1002247,3,29010,1008318,4,29711,1020430,5,30410,1020431,1,30411,1020431,50,30415,1020431,40,30415,1020591,0,30446,1047244,3,30997,1048760,4,31272,1053577,5,31547,1053577,1,31547,1053577,50,31548,1053577,40,31548,1053737,0,31548,1102519,3,32949,1103475,4,33649,1140369,5,34349,1140370,1,34349,1140370,50,34351,1140370,40,34351,1140530,0,34351,1160088,3,35752,1163906,4,36452,1176372,5,37152,1176373,5,37153,1176374,1,37153,1176374,50,37155,1176374,40,37155,1176534,0,37155,1222666,3,38556,1223427,4,39256,1228327,5,39956,1228329,1,39956,1228329,50,39958,1228329,40,39958,1228489,0,39958,1259532,3,40809,1261641,4,41234,1274790,5,41659,1274791,5,41659,1274792,1,41659,1274792,50,41661,1274792,40,41661,1274952,0,41661)
% 
% 
% START OF PROOF
% 1235540 [?] ?
% 1235999 [?] ?
% 1274794 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 1274795 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 1274797 [] subclass(X,universal_class).
% 1274800 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 1274817 [] -member(X,complement(Y)) | -member(X,Y).
% 1274840 [] member(null_class,X) | -inductive(X).
% 1274843 [] inductive(omega).
% 1274846 [] equal(domain_of(restrict(element_relation,universal_class,X)),sum_class(X)).
% 1274859 [] member(regular(X),X) | equal(X,null_class).
% 1274921 [] -equal(not_well_ordering(X,Y),null_class) | -connected(X,Y) | well_ordering(X,Y).
% 1274922 [] subclass(not_well_ordering(X,Y),Y) | -connected(X,Y) | well_ordering(X,Y).
% 1274925 [] subclass(domain_of(restrict(X,Y,Z)),Z) | -section(X,Z,Y).
% 1274926 [] -subclass(domain_of(restrict(X,Y,Z)),Z) | section(X,Z,Y) | -subclass(Z,Y).
% 1274929 [] -subclass(sum_class(X),X) | -well_ordering(element_relation,X) | -member(X,universal_class) | member(X,ordinal_numbers).
% 1274952 [] -member(null_class,ordinal_numbers).
% 1274962 [binary:1274797,1274794.2] member(X,universal_class) | -member(X,Y).
% 1275274 [binary:1274840,1274962.2,slowcut:1274843] member(null_class,universal_class).
% 1275597 [binary:1274962,1274817.2,factor] -member(X,complement(universal_class)).
% 1275611 [binary:1274795,1275597] subclass(complement(universal_class),X).
% 1277215 [binary:1275597,1274859] equal(complement(universal_class),null_class).
% 1277549 [para:1277215.1.1,1275611.1.1] subclass(null_class,X).
% 1277563 [binary:1274800,1277549] -subclass(X,null_class) | equal(X,null_class).
% 1281009 [binary:1277563,1274922,cut:1235540] equal(not_well_ordering(X,null_class),null_class) | well_ordering(X,null_class).
% 1281276 [para:1274846.1.1,1274925.1.1] subclass(sum_class(X),X) | -section(element_relation,X,universal_class).
% 1281294 [binary:1277563,1274925,cut:1235999] equal(domain_of(restrict(X,Y,null_class)),null_class).
% 1281327 [binary:1275611,1274926.3,demod:1281294,1277215,cut:1277549] section(X,null_class,Y).
% 1281462 [binary:1274952,1274929.4,cut:1275274,binarydemod:1281276,cut:1281327] -well_ordering(element_relation,null_class).
% 1281604 [binary:1274921.3,1281462,cut:1235540,binarydemod:1281009,cut:1281462] 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
% seconds given: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    33649
%  derived clauses:   2985329
%  kept clauses:      632814
%  kept size sum:     494793
%  kept mid-nuclei:   352780
%  kept new demods:   2048
%  forw unit-subs:    1154980
%  forw double-subs: 383409
%  forw overdouble-subs: 168482
%  backward subs:     3893
%  fast unit cutoff:  42576
%  full unit cutoff:  8930
%  dbl  unit cutoff:  2712
%  real runtime  :  420.61
%  process. runtime:  417.27
% specific non-discr-tree subsumption statistics: 
%  tried:           15882513
%  length fails:    312497
%  strength fails:  3086524
%  predlist fails:  6304246
%  aux str. fails:  1054326
%  by-lit fails:    1891894
%  full subs tried: 2287125
%  full subs fail:  2130502
% 
% ; 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/NUM098-1+eq_r.in")
% 
%------------------------------------------------------------------------------