↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET206-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 : art01.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 60.0s
% Output   : Assurance 60.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/SET206-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,1,228,0,1,338282,4,2113,348997,5,2803,348998,1,2805,348998,50,2812,348998,40,2812,349112,0,2812,373546,3,4215,376654,4,4914,390579,5,5613,390580,5,5613,390581,1,5613,390581,50,5616,390581,40,5616,390695,0,5616,421052,3,6167,423843,4,6442)
% 
% 
% START OF PROOF
% 390583 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 390584 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 390586 [] subclass(X,universal_class).
% 390589 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 390596 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 390599 [] equal(ordered_pair(first(X),second(X)),X) | -member(X,cross_product(Y,Z)).
% 390606 [] -member(X,complement(Y)) | -member(X,Y).
% 390648 [] member(regular(X),X) | equal(X,null_class).
% 390695 [] -equal(cross_product(null_class,y),null_class).
% 390709 [binary:390586,390583.2] member(X,universal_class) | -member(X,Y).
% 390743 [binary:390695,390589.3] -subclass(cross_product(null_class,y),null_class) | -subclass(null_class,cross_product(null_class,y)).
% 391049 [para:390599.1.1,390596.1.1,factor] -member(X,cross_product(Y,Z)) | member(first(X),Y).
% 391540 [binary:390709,390606.2,factor] -member(X,complement(universal_class)).
% 391592 [binary:390584,391540] subclass(complement(universal_class),X).
% 393336 [binary:391540,390648] equal(complement(universal_class),null_class).
% 393421 [para:393336.1.1,390606.1.2,binarycut:390709] -member(X,null_class).
% 393423 [para:393336.1.1,391592.1.1] subclass(null_class,X).
% 393451 [binary:390743.2,393423] -subclass(cross_product(null_class,y),null_class).
% 393615 [binary:390584.2,393451] member(not_subclass_element(cross_product(null_class,y),null_class),cross_product(null_class,y)).
% 427572 [binary:393615,391049,cut:393421] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit 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:    3665
%  derived clauses:   673351
%  kept clauses:      138611
%  kept size sum:     696565
%  kept mid-nuclei:   26050
%  kept new demods:   227
%  forw unit-subs:    182294
%  forw double-subs: 23863
%  forw overdouble-subs: 3124
%  backward subs:     107
%  fast unit cutoff:  1797
%  full unit cutoff:  156
%  dbl  unit cutoff:  104
%  real runtime  :  65.55
%  process. runtime:  65.54
% specific non-discr-tree subsumption statistics: 
%  tried:           454196
%  length fails:    59308
%  strength fails:  64208
%  predlist fails:  250326
%  aux str. fails:  5121
%  by-lit fails:    6925
%  full subs tried: 65989
%  full subs fail:  62863
% 
% ; 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/SET206-6+eq_r.in")
% 
%------------------------------------------------------------------------------