TSTP Solution File: SET194-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET194-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 : art03.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/SET/SET194-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,2,370301,4,2112,371142,5,2805,371143,1,2807,371143,50,2814,371143,40,2814,371257,0,2814,396724,3,4215,400304,4,4918,413555,5,5615,413556,5,5615,413557,1,5615,413557,50,5618,413557,40,5618,413671,0,5618,442642,3,6173,445954,4,6444,451425,5,6719,451427,5,6719,451427,1,6719,451427,50,6722,451427,40,6722,451541,0,6722,482606,3,7583,486014,4,8001,494769,5,8423,494770,5,8423,494771,1,8423,494771,50,8426,494771,40,8426,494885,0,8426,538715,3,9278,542619,4,9702)
%
%
% START OF PROOF
% 494773 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 494774 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 494775 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 494776 [] subclass(X,universal_class).
% 494777 [] -equal(X,Y) | subclass(X,Y).
% 494793 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 494796 [] -member(X,complement(Y)) | -member(X,Y).
% 494797 [] member(X,complement(Y)) | -member(X,universal_class) | member(X,Y).
% 494798 [] equal(complement(intersection(complement(X),complement(Y))),union(X,Y)).
% 494885 [] -subclass(x,union(x,y)).
% 494886 [binary:494774.2,494885] member(not_subclass_element(x,union(x,y)),x).
% 494887 [binary:494775.2,494885] -member(not_subclass_element(x,union(x,y)),union(x,y)).
% 494894 [binary:494773,494886] member(not_subclass_element(x,union(x,y)),X) | -subclass(x,X).
% 494900 [binary:494796.2,494886] -member(not_subclass_element(x,union(x,y)),complement(x)).
% 494905 [binary:494793.2,494900] -member(not_subclass_element(x,union(x,y)),intersection(complement(x),X)).
% 494908 [binary:494773.3,494887] -member(not_subclass_element(x,union(x,y)),X) | -subclass(X,union(x,y)).
% 495432 [binary:494776,494894.2] member(not_subclass_element(x,union(x,y)),universal_class).
% 496524 [binary:494797.3,494905,cut:495432] member(not_subclass_element(x,union(x,y)),complement(intersection(complement(x),X))).
% 496751 [binary:494777.2,494908.2] -member(not_subclass_element(x,union(x,y)),X) | -equal(X,union(x,y)).
% 546207 [binary:496524,496751,slowcut:494798] 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: 6066
% derived clauses: 832164
% kept clauses: 214831
% kept size sum: 787403
% kept mid-nuclei: 39311
% kept new demods: 303
% forw unit-subs: 212239
% forw double-subs: 40867
% forw overdouble-subs: 6627
% backward subs: 173
% fast unit cutoff: 3279
% full unit cutoff: 289
% dbl unit cutoff: 340
% real runtime : 99.43
% process. runtime: 98.48
% specific non-discr-tree subsumption statistics:
% tried: 4222700
% length fails: 614627
% strength fails: 659978
% predlist fails: 1983309
% aux str. fails: 126178
% by-lit fails: 130391
% full subs tried: 664101
% full subs fail: 657369
%
% ; 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/SET194-6+eq_r.in")
%
%------------------------------------------------------------------------------