TSTP Solution File: SET517-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET517-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 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/SET517-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(115,40,1,230,0,1,489455,4,2119,489911,5,2802,489912,1,2805,489912,50,2811,489912,40,2811,490027,0,2812,511949,3,4216,514966,4,4913,525482,5,5613,525483,5,5614,525484,1,5614,525484,50,5616,525484,40,5616,525599,0,5616)
%
%
% START OF PROOF
% 525486 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 525489 [] subclass(X,universal_class).
% 525490 [] -equal(X,Y) | subclass(X,Y).
% 525493 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 525494 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 525496 [] member(unordered_pair(X,Y),universal_class).
% 525497 [] equal(unordered_pair(X,X),singleton(X)).
% 525508 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 525509 [] -member(X,complement(Y)) | -member(X,Y).
% 525551 [] member(regular(X),X) | equal(X,null_class).
% 525552 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 525555 [] member(apply(choice,X),X) | -member(X,universal_class) | equal(X,null_class).
% 525598 [] equal(singleton(member_of(x)),x).
% 525599 [] equal(member_of(x),x).
% 525612 [binary:525489,525486.2] member(X,universal_class) | -member(X,Y).
% 525636 [para:525497.1.2,525598.1.1,demod:525599] equal(unordered_pair(x,x),x).
% 525637 [para:525497.1.1,525496.1.1] member(singleton(X),universal_class).
% 525640 [para:525598.1.1,525637.1.1] member(x,universal_class).
% 525679 [para:525636.1.1,525493.1.2] -member(X,x) | equal(X,x).
% 525695 [para:525636.1.1,525494.1.2,cut:525640] member(x,x).
% 525696 [binary:525486,525695] -subclass(x,X) | member(x,X).
% 526280 [binary:525612,525509.2,factor] -member(X,complement(universal_class)).
% 526806 [binary:526280,525696.2] -subclass(x,complement(universal_class)).
% 526837 [binary:525490.2,526806] -equal(x,complement(universal_class)).
% 528221 [binary:526280,525551] equal(complement(universal_class),null_class).
% 528275 [para:528221.1.1,525509.1.2,binarycut:525612] -member(X,null_class).
% 528287 [para:528221.1.1,526837.1.2] -equal(x,null_class).
% 528404 [binary:525551.2,528287] member(regular(x),x).
% 528429 [binary:525640,525555.2,cut:528287] member(apply(choice,x),x).
% 528553 [binary:525679,528404] equal(regular(x),x).
% 528575 [para:528553.1.1,525552.1.1.2,cut:528287] equal(intersection(x,x),null_class).
% 528801 [para:528575.1.1,525508.1.2,cut:528275,slowcut:528429] 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: 2881
% derived clauses: 685237
% kept clauses: 104710
% kept size sum: 279005
% kept mid-nuclei: 19492
% kept new demods: 260
% forw unit-subs: 126618
% forw double-subs: 16306
% forw overdouble-subs: 813
% backward subs: 57
% fast unit cutoff: 525
% full unit cutoff: 11
% dbl unit cutoff: 201
% real runtime : 56.36
% process. runtime: 56.37
% specific non-discr-tree subsumption statistics:
% tried: 41523
% length fails: 4199
% strength fails: 206
% predlist fails: 25944
% aux str. fails: 71
% by-lit fails: 48
% full subs tried: 10967
% full subs fail: 10158
%
% ; 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/SET517-6+eq_r.in")
%
%------------------------------------------------------------------------------