TSTP Solution File: SET098-7 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET098-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 : art02.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/SET098-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,426759,4,2102,545845,5,2803,545846,1,2805,545846,50,2811,545846,40,2811,545991,0,2811)
%
%
% START OF PROOF
% 545869 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 545988 [] 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).
% 545989 [] -member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),x).
% 545990 [] -equal(singleton(not_subclass_element(x,null_class)),x).
% 545991 [] -equal(x,null_class).
% 546260 [binary:545989,545869.2] -member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),intersection(X,x)).
% 552592 [binary:545991,545988.3,cut:545990,cut:546260] 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: 1312
% derived clauses: 748654
% kept clauses: 83502
% kept size sum: 64953
% kept mid-nuclei: 131671
% kept new demods: 708
% forw unit-subs: 164409
% forw double-subs: 18109
% forw overdouble-subs: 6570
% backward subs: 16
% fast unit cutoff: 1651
% full unit cutoff: 124
% dbl unit cutoff: 159
% real runtime : 28.61
% process. runtime: 28.61
% specific non-discr-tree subsumption statistics:
% tried: 157047
% length fails: 22769
% strength fails: 10934
% predlist fails: 16916
% aux str. fails: 25807
% by-lit fails: 6077
% full subs tried: 51973
% full subs fail: 45619
%
% ; 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/SET098-7+eq_r.in")
%
%------------------------------------------------------------------------------