TSTP Solution File: SET163-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET163-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 : art04.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 60.0s
% Output : Assurance 60.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/SET163-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(114,40,2,228,0,3,378192,4,2120,384837,5,2804,384838,1,2807,384838,50,2813,384838,40,2813,384952,0,2814,411526,3,4227,415097,4,4917,430995,5,5615,430996,5,5616,430997,1,5616,430997,50,5619,430997,40,5619,431111,0,5619,462673,3,6180,467003,4,6445)
%
%
% START OF PROOF
% 430999 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 431000 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 431001 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 431002 [] subclass(X,universal_class).
% 431005 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 431019 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 431022 [] -member(X,complement(Y)) | -member(X,Y).
% 431023 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 431024 [] equal(complement(intersection(complement(X),complement(Y))),union(X,Y)).
% 431064 [] member(regular(X),X) | equal(X,null_class).
% 431111 [] -equal(union(universal_class,x),universal_class).
% 431125 [binary:431002,430999.2] member(X,universal_class) | -member(X,Y).
% 431159 [binary:431111,431005.3,cut:431002] -subclass(universal_class,union(universal_class,x)).
% 431174 [binary:431000.2,431159] member(not_subclass_element(universal_class,union(universal_class,x)),universal_class).
% 431176 [binary:431001.2,431159] -member(not_subclass_element(universal_class,union(universal_class,x)),union(universal_class,x)).
% 431706 [binary:431125,431022.2,factor] -member(X,complement(universal_class)).
% 431755 [binary:431019.2,431706] -member(X,intersection(complement(universal_class),Y)).
% 433632 [binary:431706,431064] equal(complement(universal_class),null_class).
% 433654 [binary:431755,431064,demod:433632] equal(intersection(null_class,X),null_class).
% 433704 [para:433632.1.1,431022.1.2,binarycut:431125] -member(X,null_class).
% 433714 [para:433632.1.1,431024.1.1.1.1,demod:433654] equal(complement(null_class),union(universal_class,X)).
% 435023 [para:433714.1.2,431174.1.1.2] member(not_subclass_element(universal_class,complement(null_class)),universal_class).
% 435024 [para:433714.1.2,431176.1.1.2,demod:433714] -member(not_subclass_element(universal_class,complement(null_class)),complement(null_class)).
% 467538 [binary:435024,431023,cut:435023,cut:433704] 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 double 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: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3645
% derived clauses: 669214
% kept clauses: 141459
% kept size sum: 748492
% kept mid-nuclei: 24949
% kept new demods: 218
% forw unit-subs: 142907
% forw double-subs: 24896
% forw overdouble-subs: 4075
% backward subs: 86
% fast unit cutoff: 2192
% full unit cutoff: 378
% dbl unit cutoff: 88
% real runtime : 64.73
% process. runtime: 64.72
% specific non-discr-tree subsumption statistics:
% tried: 147804
% length fails: 7035
% strength fails: 17467
% predlist fails: 96423
% aux str. fails: 1526
% by-lit fails: 313
% full subs tried: 24567
% full subs fail: 20431
%
% ; 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/SET163-6+eq_r.in")
%
%------------------------------------------------------------------------------