TSTP Solution File: SET148-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET148-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 : 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 49.5s
% Output : Assurance 49.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/SET148-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,1,228,0,1,372347,4,2106,373143,5,2802,373144,1,2805,373144,50,2811,373144,40,2811,373258,0,2811,397606,3,4213,401581,4,4915,414562,5,5612,414563,5,5612,414564,1,5612,414564,50,5615,414564,40,5615,414678,0,5615)
%
%
% START OF PROOF
% 414566 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 414567 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 414568 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 414569 [] subclass(X,universal_class).
% 414570 [] -equal(X,Y) | subclass(X,Y).
% 414572 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 414580 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 414581 [] member(ordered_pair(X,Y),cross_product(Z,U)) | -member(Y,U) | -member(X,Z).
% 414587 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 414588 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 414589 [] -member(X,complement(Y)) | -member(X,Y).
% 414612 [] member(null_class,X) | -inductive(X).
% 414615 [] inductive(omega).
% 414631 [] member(regular(X),X) | equal(X,null_class).
% 414678 [] -equal(intersection(x,x),x).
% 414681 [input:414588,factor] member(X,intersection(Y,Y)) | -member(X,Y).
% 414690 [binary:414615,414612.2] member(null_class,omega).
% 414692 [binary:414569,414566.2] member(X,universal_class) | -member(X,Y).
% 414726 [binary:414678,414572.3] -subclass(intersection(x,x),x) | -subclass(x,intersection(x,x)).
% 414745 [binary:414567.2,414726] member(not_subclass_element(intersection(x,x),x),intersection(x,x)) | -subclass(x,intersection(x,x)).
% 415159 [binary:414692,414589.2,factor] -member(X,complement(universal_class)).
% 415331 [binary:414580.2,414587] -member(ordered_pair(X,Y),cross_product(Z,intersection(U,V))) | member(Y,V).
% 417257 [binary:415159,414631] equal(complement(universal_class),null_class).
% 417332 [para:417257.1.1,414589.1.2,binarycut:414692] -member(X,null_class).
% 417347 [binary:414566.3,417332] -subclass(X,null_class) | -member(Y,X).
% 417789 [binary:414570.2,417347] -equal(X,null_class) | -member(Y,X).
% 420044 [binary:414690,414681.2] member(null_class,intersection(omega,omega)).
% 420046 [binary:414568,414681] -member(not_subclass_element(X,intersection(Y,Y)),Y) | subclass(X,intersection(Y,Y)).
% 422178 [binary:417789.2,420044] -equal(intersection(omega,omega),null_class).
% 422920 [binary:414631.2,422178] member(regular(intersection(omega,omega)),intersection(omega,omega)).
% 423474 [binary:414581.2,414745,binarydemod:414568,415331,binarycut:414726,slowcut:422920] -subclass(x,intersection(x,x)).
% 423500 [binary:414567.2,423474,binarydemod:420046,cut:423474] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not 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
% clause length limited to 9
% clause depth limited to 6
% seconds given: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2911
% derived clauses: 590962
% kept clauses: 113532
% kept size sum: 407270
% kept mid-nuclei: 21442
% kept new demods: 197
% forw unit-subs: 121798
% forw double-subs: 15626
% forw overdouble-subs: 1124
% backward subs: 85
% fast unit cutoff: 815
% full unit cutoff: 26
% dbl unit cutoff: 75
% real runtime : 57.69
% process. runtime: 57.23
% specific non-discr-tree subsumption statistics:
% tried: 28550
% length fails: 1521
% strength fails: 739
% predlist fails: 18362
% aux str. fails: 185
% by-lit fails: 36
% full subs tried: 7535
% full subs fail: 6434
%
% ; 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/SET148-6+eq_r.in")
%
%------------------------------------------------------------------------------