↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET099-7 : 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 50.0s
% Output   : Assurance 50.0s
% 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/SET099-7+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(145,40,1,290,0,1,436886,4,2105,560668,5,2802,560668,1,2802,560668,50,2808,560668,40,2808,560813,0,2808,595814,3,4209,599408,4,4909,616398,5,5609,616398,5,5609,616399,1,5609,616399,50,5612,616399,40,5612,616544,0,5612)
% 
% 
% START OF PROOF
% 616416 [] member(ordered_pair(X,Y),cross_product(Z,U)) | -member(Y,U) | -member(X,Z).
% 616421 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 616424 [] -member(X,complement(Y)) | -member(X,Y).
% 616495 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,universal_class).
% 616522 [] member(X,singleton(X)) | -member(X,universal_class).
% 616541 [] member(not_subclass_element(intersection(complement(singleton(not_subclass_element(X,null_class))),X),null_class),intersection(complement(singleton(not_subclass_element(X,null_class))),X)) | equal(singleton(not_subclass_element(X,null_class)),X) | equal(X,null_class).
% 616542 [] equal(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),not_subclass_element(x,null_class)).
% 616543 [] -equal(singleton(not_subclass_element(x,null_class)),x).
% 616544 [] -equal(x,null_class).
% 616547 [input:616416,factor:binarydemod:616495] member(X,universal_class) | -member(X,Y).
% 622253 [binary:616424.2,616522,binarycut:616547] -member(X,complement(singleton(X))).
% 624748 [binary:616421.2,622253] -member(X,intersection(complement(singleton(X)),Y)).
% 625202 [para:616542.1.1,616541.1.1,cut:624748,cut:616543,cut:616544] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using double 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: 11
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    3173
%  derived clauses:   976579
%  kept clauses:      123620
%  kept size sum:     499739
%  kept mid-nuclei:   148803
%  kept new demods:   911
%  forw unit-subs:    307762
%  forw double-subs: 29172
%  forw overdouble-subs: 7209
%  backward subs:     97
%  fast unit cutoff:  4082
%  full unit cutoff:  142
%  dbl  unit cutoff:  254
%  real runtime  :  56.87
%  process. runtime:  56.85
% specific non-discr-tree subsumption statistics: 
%  tried:           377404
%  length fails:    63288
%  strength fails:  14279
%  predlist fails:  148494
%  aux str. fails:  30176
%  by-lit fails:    6381
%  full subs tried: 85797
%  full subs fail:  78782
% 
% ; 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/SET099-7+eq_r.in")
% 
%------------------------------------------------------------------------------