TSTP Solution File: SET021-7 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET021-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 : 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 39.5s
% Output : Assurance 39.5s
% 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/SET021-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(160,40,1,320,0,1,393461,4,2104,512475,5,2803,512476,1,2805,512476,50,2811,512476,40,2811,512636,0,2811)
%
%
% START OF PROOF
% 512487 [] member(X,unordered_pair(Y,X)) | -member(X,universal_class).
% 512491 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 512492 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 512493 [] member(ordered_pair(X,Y),cross_product(Z,U)) | -member(Y,U) | -member(X,Z).
% 512494 [] equal(ordered_pair(first(X),second(X)),X) | -member(X,cross_product(Y,Z)).
% 512500 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 512572 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,universal_class).
% 512629 [] -equal(ordered_pair(X,Y),ordered_pair(Z,U)) | -member(Y,universal_class) | equal(Y,U).
% 512635 [] member(ordered_pair(u,v),cross_product(universal_class,universal_class)).
% 512636 [] -equal(second(ordered_pair(u,v)),v).
% 512640 [input:512500,factor] member(X,intersection(Y,Y)) | -member(X,Y).
% 512745 [binary:512635,512491] member(u,universal_class).
% 512759 [binary:512635,512492] member(v,universal_class).
% 512767 [binary:512487.2,512759] member(v,unordered_pair(X,v)).
% 512825 [binary:512493.2,512767] member(ordered_pair(X,v),cross_product(Y,unordered_pair(Z,v))) | -member(X,Y).
% 512837 [binary:512635,512494.2] equal(ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))),ordered_pair(u,v)).
% 521009 [binary:512636,512629.3,slowcut:512837] -member(second(ordered_pair(u,v)),universal_class).
% 521870 [binary:512745,512640.2] member(u,intersection(universal_class,universal_class)).
% 542614 [binary:521870,512825.2] member(ordered_pair(u,v),cross_product(intersection(universal_class,universal_class),unordered_pair(X,v))).
% 544734 [para:512837.1.1,512572.1.1,cut:521009,slowcut:542614] 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: 2132
% derived clauses: 796097
% kept clauses: 108750
% kept size sum: 359017
% kept mid-nuclei: 131892
% kept new demods: 807
% forw unit-subs: 215051
% forw double-subs: 24367
% forw overdouble-subs: 4850
% backward subs: 39
% fast unit cutoff: 3021
% full unit cutoff: 209
% dbl unit cutoff: 98
% real runtime : 40.73
% process. runtime: 40.23
% specific non-discr-tree subsumption statistics:
% tried: 541129
% length fails: 115018
% strength fails: 6665
% predlist fails: 254707
% aux str. fails: 25181
% by-lit fails: 3935
% full subs tried: 103446
% full subs fail: 98858
%
% ; 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/SET021-7+eq_r.in")
%
%------------------------------------------------------------------------------