TSTP Solution File: SET516-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET516-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 : art09.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/SET516-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,0,228,0,0,505886,4,2103,506325,5,2802,506326,1,2805,506326,50,2831,506326,40,2831,506440,0,2831,528289,3,4260,531235,4,4933,541726,5,5632,541727,5,5632,541728,1,5632,541728,50,5635,541728,40,5635,541842,0,5635)
%
%
% START OF PROOF
% 541730 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 541733 [] subclass(X,universal_class).
% 541734 [] -equal(X,Y) | subclass(X,Y).
% 541737 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 541738 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 541740 [] member(unordered_pair(X,Y),universal_class).
% 541741 [] equal(unordered_pair(X,X),singleton(X)).
% 541752 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 541753 [] -member(X,complement(Y)) | -member(X,Y).
% 541795 [] member(regular(X),X) | equal(X,null_class).
% 541796 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 541799 [] member(apply(choice,X),X) | -member(X,universal_class) | equal(X,null_class).
% 541842 [] equal(singleton(x),x).
% 541856 [binary:541733,541730.2] member(X,universal_class) | -member(X,Y).
% 541875 [para:541741.1.2,541842.1.1] equal(unordered_pair(x,x),x).
% 541876 [para:541741.1.1,541740.1.1] member(singleton(X),universal_class).
% 541882 [para:541842.1.1,541876.1.1] member(x,universal_class).
% 541924 [para:541875.1.1,541737.1.2] -member(X,x) | equal(X,x).
% 541939 [para:541875.1.1,541738.1.2,cut:541882] member(x,x).
% 541940 [binary:541730,541939] -subclass(x,X) | member(x,X).
% 542531 [binary:541856,541753.2,factor] -member(X,complement(universal_class)).
% 543047 [binary:542531,541940.2] -subclass(x,complement(universal_class)).
% 543078 [binary:541734.2,543047] -equal(x,complement(universal_class)).
% 544461 [binary:542531,541795] equal(complement(universal_class),null_class).
% 544515 [para:544461.1.1,541753.1.2,binarycut:541856] -member(X,null_class).
% 544527 [para:544461.1.1,543078.1.2] -equal(x,null_class).
% 544644 [binary:541795.2,544527] member(regular(x),x).
% 544669 [binary:541882,541799.2,cut:544527] member(apply(choice,x),x).
% 544793 [binary:541924,544644] equal(regular(x),x).
% 544815 [para:544793.1.1,541796.1.1.2,cut:544527] equal(intersection(x,x),null_class).
% 545024 [para:544815.1.1,541752.1.2,cut:544515,slowcut:544669] 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: 2865
% derived clauses: 702561
% kept clauses: 104522
% kept size sum: 277134
% kept mid-nuclei: 19324
% kept new demods: 253
% forw unit-subs: 125751
% forw double-subs: 16036
% forw overdouble-subs: 748
% backward subs: 59
% fast unit cutoff: 525
% full unit cutoff: 10
% dbl unit cutoff: 62
% real runtime : 56.61
% process. runtime: 56.61
% specific non-discr-tree subsumption statistics:
% tried: 36427
% length fails: 4399
% strength fails: 205
% predlist fails: 22473
% aux str. fails: 69
% by-lit fails: 22
% full subs tried: 9171
% full subs fail: 8427
%
% ; 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/SET516-6+eq_r.in")
%
%------------------------------------------------------------------------------