TSTP Solution File: SET189-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET189-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 : art10.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 40.0s
% Output : Assurance 40.0s
% 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/SET189-6+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(116,40,1,232,0,1,367871,4,2103,368646,5,2804,368647,1,2806,368647,50,2813,368647,40,2813,368763,0,2813,393184,3,4214)
%
%
% START OF PROOF
% 368649 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 368650 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 368651 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 368652 [] subclass(X,universal_class).
% 368654 [] -equal(X,Y) | subclass(Y,X).
% 368655 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 368669 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 368671 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 368673 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 368715 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 368761 [] equal(intersection(complement(y),x),null_class).
% 368762 [] subclass(y,x).
% 368763 [] -equal(x,y).
% 368800 [binary:368762,368655,cut:368763] -subclass(x,y).
% 368807 [binary:368650.2,368800] member(not_subclass_element(x,y),x).
% 368808 [binary:368651.2,368800] -member(not_subclass_element(x,y),y).
% 368810 [binary:368649,368807] member(not_subclass_element(x,y),X) | -subclass(x,X).
% 368811 [binary:368649.3,368808] -member(not_subclass_element(x,y),X) | -subclass(X,y).
% 368835 [binary:368652,368810.2] member(not_subclass_element(x,y),universal_class).
% 368997 [binary:368808,368669.2] -member(not_subclass_element(x,y),intersection(y,X)).
% 369056 [para:368761.1.1,368671.1.2] -member(X,complement(y)) | -member(X,x) | member(X,null_class).
% 369107 [binary:368808,368673.3,cut:368835] member(not_subclass_element(x,y),complement(y)).
% 392667 [binary:368807,369056.2,cut:369107] member(not_subclass_element(x,y),null_class).
% 392675 [binary:368811,392667] -subclass(null_class,y).
% 392730 [binary:368654.2,392675] -equal(y,null_class).
% 392754 [binary:368715.2,392730] equal(intersection(y,regular(y)),null_class).
% 395590 [para:392754.1.1,368997.1.2,cut:392667] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation 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: 2205
% derived clauses: 516559
% kept clauses: 103590
% kept size sum: 282915
% kept mid-nuclei: 8572
% kept new demods: 134
% forw unit-subs: 99325
% forw double-subs: 11916
% forw overdouble-subs: 390
% backward subs: 38
% fast unit cutoff: 334
% full unit cutoff: 0
% dbl unit cutoff: 214
% real runtime : 46.1
% process. runtime: 46.1
% specific non-discr-tree subsumption statistics:
% tried: 26187
% length fails: 1693
% strength fails: 23
% predlist fails: 16782
% aux str. fails: 52
% by-lit fails: 20
% full subs tried: 7576
% full subs fail: 7191
%
% ; 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/SET189-6+eq_r.in")
%
%------------------------------------------------------------------------------