TSTP Solution File: SET017-7 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET017-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 : 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 19.6s
% Output : Assurance 19.6s
% 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/SET017-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(117,40,2,234,0,2,514877,4,2117,515512,5,2803,515513,1,2805,515513,50,2812,515513,40,2812,515630,0,2812)
%
%
% START OF PROOF
% 515514 [] equal(X,X).
% 515522 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 515524 [] member(X,unordered_pair(Y,X)) | -member(X,universal_class).
% 515528 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 515529 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 515628 [] equal(unordered_pair(x,y),unordered_pair(x,z)).
% 515629 [] member(ordered_pair(y,z),cross_product(universal_class,universal_class)).
% 515630 [] -equal(y,z).
% 515685 [para:515628.1.2,515522.1.2] -member(X,unordered_pair(x,y)) | equal(X,x) | equal(X,z).
% 515744 [binary:515629,515528] member(y,universal_class).
% 515748 [binary:515524.2,515744] member(y,unordered_pair(X,y)).
% 515758 [binary:515629,515529] member(z,universal_class).
% 515762 [binary:515524.2,515758] member(z,unordered_pair(X,z)).
% 515766 [para:515628.1.2,515762.1.2] member(z,unordered_pair(x,y)).
% 515769 [binary:515522,515766] equal(z,x) | equal(z,y).
% 519979 [binary:515630,515685.3,cut:515748] equal(y,x).
% 525270 [para:515769.1.1,515630.1.2,cut:519979] equal(z,y).
% 525272 [para:525270.1.1,515630.1.2,cut:515514] 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: 1526
% derived clauses: 628019
% kept clauses: 86542
% kept size sum: 88227
% kept mid-nuclei: 8675
% kept new demods: 177
% forw unit-subs: 94391
% forw double-subs: 8355
% forw overdouble-subs: 248
% backward subs: 37
% fast unit cutoff: 577
% full unit cutoff: 137
% dbl unit cutoff: 56
% real runtime : 29.88
% process. runtime: 29.44
% specific non-discr-tree subsumption statistics:
% tried: 14242
% length fails: 2274
% strength fails: 26
% predlist fails: 6169
% aux str. fails: 59
% by-lit fails: 3
% full subs tried: 5706
% full subs fail: 5461
%
% ; 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/SET017-7+eq_r.in")
%
%------------------------------------------------------------------------------