↑ Up

Gandalf---c-2.6.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : NUM156-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 : art04.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 288.5s
% Output   : Assurance 288.5s
% 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/NUM156-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,232077,4,2220,244274,5,2802,244275,1,2804,244275,50,2811,244275,40,2811,244435,0,2811,271124,3,4212,274548,4,4912,293333,5,5612,293334,1,5612,293334,50,5615,293334,40,5615,293494,0,5615,323309,3,6166,326557,4,6441,336426,5,6716,336426,5,6716,336426,1,6716,336426,50,6719,336426,40,6719,336586,0,6719,369998,3,7583,373672,4,7996,381447,5,8420,381448,5,8420,381448,1,8420,381448,50,8423,381448,40,8423,381608,0,8423,414343,3,9274,419071,4,9699,426353,5,10125,426353,5,10126,426354,1,10126,426354,50,10128,426354,40,10128,426514,0,10128,529581,3,14481,537704,4,16656,556496,5,18831,556497,5,18832,556497,1,18832,556497,50,18837,556497,40,18837,556657,0,18837,603056,3,20239,604061,4,20938,640720,5,21638,640721,1,21638,640721,50,21640,640721,40,21640,640881,0,21640,760335,3,24575,789367,4,25991,915256,5,27471,915256,5,27474,915257,1,27474,915257,50,27481,915257,40,27481,915417,0,27513,973328,3,28915,976079,4,29614)
% 
% 
% START OF PROOF
% 915259 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 915262 [] subclass(X,universal_class).
% 915267 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 915279 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 915282 [] -member(X,complement(Y)) | -member(X,Y).
% 915283 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 915305 [] member(null_class,X) | -inductive(X).
% 915308 [] inductive(omega).
% 915396 [] equal(complement(intersection(complement(unordered_pair(null_class,null_class)),complement(domain_of(domain_of(flip(cross_product(intersection(successor_relation,cross_product(ordinal_numbers,universal_class)),universal_class))))))),kind_1_ordinals).
% 915417 [] -member(null_class,kind_1_ordinals).
% 915428 [binary:915308,915305.2] member(null_class,omega).
% 915431 [binary:915259,915428] -subclass(omega,X) | member(null_class,X).
% 915476 [binary:915262,915431] member(null_class,universal_class).
% 915479 [binary:915267.2,915476] member(null_class,unordered_pair(null_class,X)).
% 915820 [binary:915476,915283.2] member(null_class,complement(X)) | member(null_class,X).
% 915877 [binary:915282,915820.2] member(null_class,complement(complement(X))) | -member(null_class,X).
% 917138 [binary:915479,915877.2] member(null_class,complement(complement(unordered_pair(null_class,X)))).
% 917746 [binary:915282,917138] -member(null_class,complement(unordered_pair(null_class,X))).
% 920691 [para:915396.1.1,915820.1.2,cut:915417] member(null_class,intersection(complement(unordered_pair(null_class,null_class)),complement(domain_of(domain_of(flip(cross_product(intersection(successor_relation,cross_product(ordinal_numbers,universal_class)),universal_class))))))).
% 981489 [binary:920691,915279,cut:917746] 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: 28
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    19179
%  derived clauses:   2121617
%  kept clauses:      462068
%  kept size sum:     0
%  kept mid-nuclei:   251856
%  kept new demods:   986
%  forw unit-subs:    833907
%  forw double-subs: 240222
%  forw overdouble-subs: 68254
%  backward subs:     2000
%  fast unit cutoff:  21532
%  full unit cutoff:  4574
%  dbl  unit cutoff:  1471
%  real runtime  :  298.96
%  process. runtime:  297.19
% specific non-discr-tree subsumption statistics: 
%  tried:           5500670
%  length fails:    174619
%  strength fails:  1183480
%  predlist fails:  2115720
%  aux str. fails:  286753
%  by-lit fails:    490620
%  full subs tried: 847586
%  full subs fail:  780097
% 
% ; 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/NUM156-1+eq_r.in")
% 
%------------------------------------------------------------------------------