↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET071-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 : art06.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 40.0s
% Output   : Assurance 40.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/SET071-6+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 6 9)
% (binary-unit 9 #f 6 9)
% (binary-double 9 #f 6 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 6 9)
% (binary-order 25 #f 6 9)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(95,40,1,190,0,1,331169,4,1877,351455,5,2504,351456,1,2507,351456,50,2513,351456,40,2513,351551,0,2513,362668,3,2980,364751,4,3189,369393,5,3414,369394,5,3414,369394,1,3414,369394,50,3415,369394,40,3415,369489,0,3416,394969,3,3877,398269,4,4093,402589,5,4317,402590,5,4317,402592,1,4317,402592,50,4319,402592,40,4319,402687,0,4319)
% 
% 
% START OF PROOF
% 371961 [?] ?
% 402594 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 402595 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 402597 [] subclass(X,universal_class).
% 402600 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 402601 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 402685 [] -equal(unordered_pair(x,y),null_class).
% 402686 [] -member(x,universal_class).
% 402687 [] -member(y,universal_class).
% 402700 [binary:402686,402594.3,cut:402597] -member(x,X).
% 402701 [binary:402687,402594.3,cut:402597] -member(y,X).
% 402731 [binary:402685,402600.3,cut:371961] -subclass(unordered_pair(x,y),null_class).
% 402744 [binary:402595.2,402731] member(not_subclass_element(unordered_pair(x,y),null_class),unordered_pair(x,y)).
% 402755 [binary:402595,402601] equal(not_subclass_element(unordered_pair(X,Y),Z),Y) | equal(not_subclass_element(unordered_pair(X,Y),Z),X) | subclass(unordered_pair(X,Y),Z).
% 409581 [para:402755.1.1,402744.1.1,cut:402701,cut:402731] equal(not_subclass_element(unordered_pair(x,y),null_class),x).
% 409582 [para:402755.2.1,402744.1.1,demod:409581,cut:402700,cut:402731] equal(x,y).
% 409664 [para:409582.1.1,402744.1.2.1,demod:409581,cut:402700] 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
% seconds given: 15
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    3616
%  derived clauses:   572832
%  kept clauses:      124592
%  kept size sum:     532755
%  kept mid-nuclei:   16920
%  kept new demods:   264
%  forw unit-subs:    125407
%  forw double-subs: 26971
%  forw overdouble-subs: 4299
%  backward subs:     149
%  fast unit cutoff:  2457
%  full unit cutoff:  417
%  dbl  unit cutoff:  239
%  real runtime  :  43.88
%  process. runtime:  43.85
% specific non-discr-tree subsumption statistics: 
%  tried:           133081
%  length fails:    6317
%  strength fails:  13819
%  predlist fails:  90687
%  aux str. fails:  840
%  by-lit fails:    220
%  full subs tried: 20480
%  full subs fail:  16234
% 
% ; 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/SET071-6+eq_r.in")
% 
%------------------------------------------------------------------------------