TSTP Solution File: SET071-7 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET071-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 : 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 20.0s
% Output   : Assurance 20.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-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(116,40,0,232,0,1,472605,4,2118,474391,5,2803,474391,1,2803,474391,50,2810,474391,40,2810,474507,0,2810)
% 
% 
% START OF PROOF
% 474393 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 474394 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 474396 [] subclass(X,universal_class).
% 474399 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 474400 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 474496 [] subclass(null_class,X).
% 474504 [] equal(unordered_pair(X,Y),singleton(Y)) | member(X,universal_class).
% 474505 [] -equal(unordered_pair(x,y),null_class).
% 474506 [] -member(x,universal_class).
% 474507 [] -member(y,universal_class).
% 474518 [binary:474506,474393.3,cut:474396] -member(x,X).
% 474519 [binary:474507,474393.3,cut:474396] -member(y,X).
% 474540 [binary:474505,474399.3,cut:474496] -subclass(unordered_pair(x,y),null_class).
% 474546 [binary:474394.2,474540] member(not_subclass_element(unordered_pair(x,y),null_class),unordered_pair(x,y)).
% 474557 [binary:474546,474400] equal(not_subclass_element(unordered_pair(x,y),null_class),x) | equal(not_subclass_element(unordered_pair(x,y),null_class),y).
% 477669 [binary:474518,474504.2] equal(unordered_pair(x,X),singleton(X)).
% 477670 [binary:474519,474504.2] equal(unordered_pair(y,X),singleton(X)).
% 478998 [para:474557.1.1,474546.1.1,demod:477669,cut:474518] equal(not_subclass_element(singleton(y),null_class),y).
% 478999 [para:474557.2.1,474546.1.1,demod:478998,477669,cut:474519] equal(y,x).
% 479002 [para:478999.1.2,474546.1.1.1.1,demod:477669,478998,477670,cut:474519] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit 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: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1260
%  derived clauses:   579723
%  kept clauses:      81634
%  kept size sum:     40323
%  kept mid-nuclei:   8609
%  kept new demods:   163
%  forw unit-subs:    88166
%  forw double-subs: 11217
%  forw overdouble-subs: 1850
%  backward subs:     13
%  fast unit cutoff:  504
%  full unit cutoff:  283
%  dbl  unit cutoff:  331
%  real runtime  :  28.51
%  process. runtime:  28.51
% specific non-discr-tree subsumption statistics: 
%  tried:           23385
%  length fails:    263
%  strength fails:  1892
%  predlist fails:  11695
%  aux str. fails:  887
%  by-lit fails:    407
%  full subs tried: 8071
%  full subs fail:  6286
% 
% ; 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-7+eq_r.in")
% 
%------------------------------------------------------------------------------