TSTP Solution File: SET131-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET131-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 : art03.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 269.2s
% Output : Assurance 269.2s
% 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/SET131-6+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 6 9)
% (binary-unit 9 #f 6 9)
% (binary-double 9 #f 6 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 6 9)
% (binary-order 25 #f 6 9)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(95,40,1,190,0,1,407867,4,1881,408221,5,2502,408222,1,2505,408222,50,2512,408222,40,2512,408317,0,2512,421375,3,2964,423389,4,3188,432589,5,3413,432590,5,3413,432591,1,3413,432591,50,3415,432591,40,3415,432686,0,3415,461076,3,3866,464925,4,4093,474750,5,4316,474750,5,4316,474751,1,4316,474751,50,4318,474751,40,4318,474846,0,4318,509187,3,5079,513080,4,5444,519876,5,5819,519876,5,5820,519877,1,5820,519877,50,5822,519877,40,5822,519972,0,5822,552199,3,6573,556732,4,6948,565047,5,7323,565047,5,7323,565047,1,7323,565047,50,7326,565047,40,7326,565142,0,7326,637590,3,9833,640968,4,11079,662288,5,12327,662288,5,12329,662288,1,12329,662288,50,12335,662288,40,12335,662383,0,12335,711283,3,13586,713017,4,14211,756833,5,14836,756834,1,14836,756834,50,14837,756834,40,14837,756929,0,14837,944185,3,19889,1020453,4,22414,1162822,5,24939,1162822,5,24940,1162823,1,24940,1162823,50,24948,1162823,40,24948,1162918,0,24948,1209189,3,26199,1218312,4,26824)
%
%
% START OF PROOF
% 1162834 [] member(X,unordered_pair(Y,X)) | -member(X,universal_class).
% 1162845 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 1162846 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 1162848 [] -member(X,complement(Y)) | -member(X,Y).
% 1162849 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 1162917 [] member(u,universal_class).
% 1162918 [] -member(u,complement(intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))))).
% 1163008 [binary:1162917,1162834.2] member(u,unordered_pair(X,u)).
% 1163277 [binary:1162917,1162849.2] member(u,complement(X)) | member(u,X).
% 1163300 [binary:1162848,1163277.2] member(u,complement(complement(X))) | -member(u,X).
% 1163302 [binary:1162845,1163277.2] member(u,complement(intersection(X,Y))) | member(u,X).
% 1163303 [binary:1162846,1163277.2] member(u,complement(intersection(X,Y))) | member(u,Y).
% 1163359 [binary:1163008,1163300.2] member(u,complement(complement(unordered_pair(X,u)))).
% 1163385 [binary:1162848,1163359] -member(u,complement(unordered_pair(X,u))).
% 1164330 [binary:1163385,1163302.2] member(u,complement(intersection(complement(unordered_pair(X,u)),Y))).
% 1172815 [binary:1162918,1163303] member(u,complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))).
% 1178343 [binary:1163300.2,1164330] member(u,complement(complement(complement(intersection(complement(unordered_pair(X,u)),Y))))).
% 1229182 [binary:1178343,1162848,slowcut:1172815] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 25
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 16007
% derived clauses: 2505809
% kept clauses: 435686
% kept size sum: 0
% kept mid-nuclei: 257792
% kept new demods: 971
% forw unit-subs: 964254
% forw double-subs: 222915
% forw overdouble-subs: 76535
% backward subs: 1315
% fast unit cutoff: 24693
% full unit cutoff: 4715
% dbl unit cutoff: 476
% real runtime : 272.20
% process. runtime: 271.17
% specific non-discr-tree subsumption statistics:
% tried: 8300333
% length fails: 160210
% strength fails: 1904086
% predlist fails: 5438650
% aux str. fails: 84651
% by-lit fails: 17401
% full subs tried: 682689
% full subs fail: 604431
%
% ; 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/SET131-6+eq_r.in")
%
%------------------------------------------------------------------------------