TSTP Solution File: NUM094-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NUM094-1 : 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 89.5s
% Output : Assurance 89.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/NUM/NUM094-1+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(163,40,3,326,0,4,261074,4,2114,261928,5,2805,261929,1,2808,261929,50,2834,261929,40,2834,262092,0,2834,282130,3,4235,285452,4,4935,296679,5,5643,296680,5,5643,296681,1,5643,296681,50,5646,296681,40,5646,296844,0,5646,325230,3,6197,329985,4,6472,344778,5,6747,344778,5,6747,344778,1,6747,344778,50,6750,344778,40,6750,344941,0,6750,377705,3,7601,381463,4,8027,389542,5,8451,389543,5,8451,389543,1,8451,389543,50,8454,389543,40,8454,389706,0,8454,425931,3,9305,430664,4,9730)
%
%
% START OF PROOF
% 389545 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 389546 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 389547 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 389548 [] subclass(X,universal_class).
% 389551 [] -subclass(X,Y) | -subclass(Y,X) | equal(Y,X).
% 389566 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 389567 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 389569 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 389669 [] member(least(X,Y),Y) | -well_ordering(X,Z) | -member(U,Y) | -subclass(Y,Z).
% 389675 [] -section(X,Y,Z) | subclass(Y,Z).
% 389703 [] well_ordering(xr,y).
% 389704 [] section(xr,w,y).
% 389705 [] -member(least(xr,intersection(complement(w),y)),y).
% 389706 [] -equal(y,w).
% 389709 [binary:389669.2,389703] member(least(xr,X),X) | -subclass(X,y) | -member(Y,X).
% 389716 [binary:389675,389704] subclass(w,y).
% 389719 [binary:389551,389716,cut:389706] -subclass(y,w).
% 389730 [binary:389566.2,389705] -member(least(xr,intersection(complement(w),y)),intersection(X,y)).
% 389732 [binary:389546.2,389719] member(not_subclass_element(y,w),y).
% 389733 [binary:389547.2,389719] -member(not_subclass_element(y,w),w).
% 389738 [binary:389545,389732] member(not_subclass_element(y,w),X) | -subclass(y,X).
% 389742 [binary:389567.2,389732] member(not_subclass_element(y,w),intersection(X,y)) | -member(not_subclass_element(y,w),X).
% 389875 [binary:389546.2,389709.2] member(not_subclass_element(X,y),X) | member(least(xr,X),X) | -member(Y,X).
% 389877 [binary:389547.2,389709.2] -member(not_subclass_element(X,y),y) | member(least(xr,X),X) | -member(Y,X).
% 392302 [binary:389548,389738.2] member(not_subclass_element(y,w),universal_class).
% 393446 [binary:389569.3,389733,cut:392302] member(not_subclass_element(y,w),complement(w)).
% 393474 [binary:389742.2,393446] member(not_subclass_element(y,w),intersection(complement(w),y)).
% 408631 [binary:389730,389875.2,slowcut:393474] member(not_subclass_element(intersection(complement(w),y),y),intersection(complement(w),y)).
% 408929 [binary:389730,389877.2,slowcut:408631] -member(not_subclass_element(intersection(complement(w),y),y),y).
% 431571 [binary:408631,389566,cut:408929] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using unit paramodulation strategy
% using unit 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: 17
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 7198
% derived clauses: 742668
% kept clauses: 207004
% kept size sum: 532562
% kept mid-nuclei: 60514
% kept new demods: 414
% forw unit-subs: 234007
% forw double-subs: 67213
% forw overdouble-subs: 11019
% backward subs: 529
% fast unit cutoff: 4388
% full unit cutoff: 3779
% dbl unit cutoff: 584
% real runtime : 98.9
% process. runtime: 97.47
% specific non-discr-tree subsumption statistics:
% tried: 809986
% length fails: 66084
% strength fails: 135786
% predlist fails: 333556
% aux str. fails: 29297
% by-lit fails: 57116
% full subs tried: 113289
% full subs fail: 102843
%
% ; 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/NUM/NUM094-1+eq_r.in")
%
%------------------------------------------------------------------------------