TSTP Solution File: SET020-7 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET020-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 : 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 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/SET020-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,0,320,0,0,397829,4,2102,516919,5,2801,516921,1,2801,516921,50,2807,516921,40,2807,517081,0,2807)
%
%
% START OF PROOF
% 516932 [] member(X,unordered_pair(Y,X)) | -member(X,universal_class).
% 516936 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 516937 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 516938 [] member(ordered_pair(X,Y),cross_product(Z,U)) | -member(Y,U) | -member(X,Z).
% 516939 [] equal(ordered_pair(first(X),second(X)),X) | -member(X,cross_product(Y,Z)).
% 516945 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 517016 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,universal_class).
% 517073 [] -equal(ordered_pair(X,Y),ordered_pair(Z,U)) | -member(X,universal_class) | equal(X,Z).
% 517080 [] member(ordered_pair(u,v),cross_product(universal_class,universal_class)).
% 517081 [] -equal(first(ordered_pair(u,v)),u).
% 517085 [input:516945,factor] member(X,intersection(Y,Y)) | -member(X,Y).
% 517190 [binary:517080,516936] member(u,universal_class).
% 517204 [binary:517080,516937] member(v,universal_class).
% 517212 [binary:516932.2,517204] member(v,unordered_pair(X,v)).
% 517270 [binary:516938.2,517212] member(ordered_pair(X,v),cross_product(Y,unordered_pair(Z,v))) | -member(X,Y).
% 517282 [binary:517080,516939.2] equal(ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))),ordered_pair(u,v)).
% 525190 [binary:517081,517073.3,slowcut:517282] -member(first(ordered_pair(u,v)),universal_class).
% 526314 [binary:517190,517085.2] member(u,intersection(universal_class,universal_class)).
% 547058 [binary:526314,517270.2] member(ordered_pair(u,v),cross_product(intersection(universal_class,universal_class),unordered_pair(X,v))).
% 549176 [para:517282.1.1,517016.1.1,cut:525190,slowcut:547058] 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: 2134
% derived clauses: 800699
% kept clauses: 108748
% kept size sum: 358995
% kept mid-nuclei: 131930
% kept new demods: 807
% forw unit-subs: 215191
% forw double-subs: 24367
% forw overdouble-subs: 4850
% backward subs: 39
% fast unit cutoff: 3023
% full unit cutoff: 213
% dbl unit cutoff: 98
% real runtime : 40.87
% process. runtime: 40.39
% specific non-discr-tree subsumption statistics:
% tried: 541237
% length fails: 115030
% strength fails: 6675
% predlist fails: 254723
% aux str. fails: 25181
% by-lit fails: 3935
% full subs tried: 103516
% full subs fail: 98928
%
% ; 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/SET020-7+eq_r.in")
%
%------------------------------------------------------------------------------