TSTP Solution File: SET012-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET012-2 : 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 0.0s
% Output : Assurance 0.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/SET012-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 2 5)
% (binary-unit 10 #f 2 5)
% (binary-double 16 #f 2 5)
% (binary 54 #t 2 5)
% (binary-order 27 #f 2 5)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(24,40,2,48,0,2)
%
%
% START OF PROOF
% 26 [] -subset(X,Y) | -member(Z,X) | member(Z,Y).
% 27 [] member(member_of_1_not_of_2(X,Y),X) | subset(X,Y).
% 28 [] -member(member_of_1_not_of_2(X,Y),Y) | subset(X,Y).
% 29 [] member(X,complement(Y)) | member(X,Y).
% 30 [] -member(X,complement(Y)) | -member(X,Y).
% 37 [] -equal_sets(X,Y) | subset(X,Y).
% 38 [] -equal_sets(X,Y) | subset(Y,X).
% 39 [] -subset(Y,X) | -subset(X,Y) | equal_sets(Y,X).
% 46 [] equal_sets(complement(a),b).
% 47 [] equal_sets(complement(b),c).
% 48 [] -equal_sets(a,c).
% 50 [hyper:37,46] subset(complement(a),b).
% 51 [hyper:38,46] subset(b,complement(a)).
% 55 [hyper:37,47] subset(complement(b),c).
% 56 [hyper:38,47] subset(c,complement(b)).
% 81 [hyper:26,27,27] member(member_of_1_not_of_2(X,Z),X) | member(member_of_1_not_of_2(X,Y),Z) | subset(X,Y).
% 102 [hyper:26,29,50] member(X,b) | member(X,a).
% 103 [hyper:26,29,55] member(X,c) | member(X,b).
% 106 [hyper:26,29,56] member(X,complement(c)) | member(X,complement(b)).
% 165 [hyper:26,103,51] member(X,complement(a)) | member(X,c).
% 304 [hyper:30,106,102] member(X,complement(c)) | member(X,a).
% 800 [hyper:30,81,165,factor:binarycut:28] subset(a,c).
% 805 [hyper:30,81,304,factor:binarycut:28] subset(c,a).
% 928 [hyper:39,800,cut:805] equal_sets(a,c).
% 936 [hyper:48,928] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 2
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 75
% derived clauses: 3872
% kept clauses: 418
% kept size sum: 5534
% kept mid-nuclei: 329
% kept new demods: 0
% forw unit-subs: 604
% forw double-subs: 772
% forw overdouble-subs: 310
% backward subs: 0
% fast unit cutoff: 23
% full unit cutoff: 0
% dbl unit cutoff: 16
% real runtime : 0.7
% process. runtime: 0.6
% specific non-discr-tree subsumption statistics:
% tried: 2104
% length fails: 235
% strength fails: 283
% predlist fails: 347
% aux str. fails: 117
% by-lit fails: 31
% full subs tried: 967
% full subs fail: 636
%
% ; 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/SET012-2+noeq.in")
%
%------------------------------------------------------------------------------