TSTP Solution File: SET020-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET020-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 : art09.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 59.5s
% Output : Assurance 59.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-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(94,40,0,188,0,1,490186,4,1879,494504,5,2502,494505,1,2505,494505,50,2511,494505,40,2511,494599,0,2511,508740,3,2962,510928,4,3187,524361,5,3412,524362,5,3412,524363,1,3413,524363,50,3414,524363,40,3414,524457,0,3414,551597,3,3865,555184,4,4090,565204,5,4315,565206,5,4315,565206,1,4315,565206,50,4317,565206,40,4317,565300,0,4317,598754,3,5086,602760,4,5443,610269,5,5818,610270,5,5819,610272,1,5819,610272,50,5821,610272,40,5821,610366,0,5821)
%
%
% START OF PROOF
% 568019 [?] ?
% 568034 [?] ?
% 610274 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 610278 [] -equal(X,Y) | subclass(X,Y).
% 610281 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 610282 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 610287 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 610288 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 610289 [] member(ordered_pair(X,Y),cross_product(Z,U)) | -member(Y,U) | -member(X,Z).
% 610290 [] equal(ordered_pair(first(X),second(X)),X) | -member(X,cross_product(Y,Z)).
% 610294 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 610297 [] -member(X,complement(Y)) | -member(X,Y).
% 610298 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 610340 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 610365 [] member(ordered_pair(u,v),cross_product(universal_class,universal_class)).
% 610366 [] -equal(first(ordered_pair(u,v)),u).
% 610368 [binary:610281.2,610366] -member(first(ordered_pair(u,v)),unordered_pair(u,X)) | equal(first(ordered_pair(u,v)),X).
% 610371 [binary:610287,610365] member(u,universal_class).
% 610372 [binary:610288,610365] member(v,universal_class).
% 610382 [binary:610274,610371] -subclass(universal_class,X) | member(u,X).
% 610383 [binary:610282.2,610371] member(u,unordered_pair(u,X)).
% 610386 [binary:610289.3,610371] member(ordered_pair(u,X),cross_product(universal_class,Y)) | -member(X,Y).
% 610391 [binary:610298.2,610371] member(u,complement(X)) | member(u,X).
% 610400 [binary:610289.2,610372] member(ordered_pair(X,v),cross_product(Y,universal_class)) | -member(X,Y).
% 610406 [binary:610298.2,610372] member(v,complement(X)) | member(v,X).
% 610498 [binary:610287.2,610368] -member(ordered_pair(first(ordered_pair(u,v)),X),cross_product(unordered_pair(u,Y),Z)) | equal(first(ordered_pair(u,v)),Y).
% 610976 [binary:610297.2,610382.2] -member(u,complement(X)) | -subclass(universal_class,X).
% 611938 [binary:610274,610391.2,factor:binarydemod:610976] -subclass(X,complement(X)) | -subclass(universal_class,X).
% 612419 [binary:610383,610400.2] member(ordered_pair(u,v),cross_product(unordered_pair(u,X),universal_class)).
% 613502 [binary:610278.2,611938.2] -subclass(X,complement(X)) | -equal(universal_class,X).
% 613738 [binary:610340.2,613502.2,cut:568019] equal(intersection(universal_class,regular(universal_class)),null_class).
% 614319 [para:613738.1.1,610294.1.2] -member(X,null_class) | member(X,universal_class).
% 614372 [binary:610289.2,614319.2,factor:cut:568034] -member(X,null_class).
% 614404 [binary:610406.2,614372] member(v,complement(null_class)).
% 614505 [binary:610297.2,614404] -member(v,complement(complement(null_class))).
% 614768 [binary:610298.3,614505,cut:610372] member(v,complement(complement(complement(null_class)))).
% 617099 [binary:610386.2,614768] member(ordered_pair(u,v),cross_product(universal_class,complement(complement(complement(null_class))))).
% 619884 [para:610290.1.1,610498.1.1,slowcut:612419,slowcut:617099,slowcut:610366] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 15
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 4891
% derived clauses: 924142
% kept clauses: 168060
% kept size sum: 0
% kept mid-nuclei: 37631
% kept new demods: 340
% forw unit-subs: 244390
% forw double-subs: 43346
% forw overdouble-subs: 8596
% backward subs: 251
% fast unit cutoff: 4110
% full unit cutoff: 2523
% dbl unit cutoff: 187
% real runtime : 59.97
% process. runtime: 59.48
% specific non-discr-tree subsumption statistics:
% tried: 525840
% length fails: 28620
% strength fails: 82423
% predlist fails: 328123
% aux str. fails: 5239
% by-lit fails: 3447
% full subs tried: 76455
% full subs fail: 67764
%
% ; 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-6+eq_r.in")
%
%------------------------------------------------------------------------------