TSTP Solution File: SET079-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET079-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 : art06.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 0.0s
% Output : Assurance 0.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/SET079-6+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 6 9)
% (binary-unit 9 #f 6 9)
% (binary-double 9 #f 6 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 6 9)
% (binary-order 25 #f 6 9)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(94,40,1,188,0,2)
%
%
% START OF PROOF
% 96 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 99 [] subclass(X,universal_class).
% 101 [] -equal(X,Y) | subclass(Y,X).
% 104 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 107 [] equal(unordered_pair(X,X),singleton(X)).
% 119 [] -member(X,complement(Y)) | -member(X,Y).
% 161 [] member(regular(X),X) | equal(X,null_class).
% 187 [] member(x,universal_class).
% 188 [] equal(singleton(x),null_class).
% 207 [hyper:104,187] member(x,unordered_pair(x,X)).
% 2060 [para:107.1.1,207.1.2,demod:188] member(x,null_class).
% 21325 [hyper:101,161] member(regular(X),X) | subclass(null_class,X).
% 27741 [hyper:96,21325,2060] member(regular(X),X) | member(x,X).
% 28783 [hyper:119,27741,187] member(regular(complement(universal_class)),complement(universal_class)).
% 28823 [hyper:96,28783,99] member(regular(complement(universal_class)),universal_class).
% 29144 [hyper:119,28783,cut:28823] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 9
% clause depth limited to 6
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 225
% derived clauses: 56616
% kept clauses: 26648
% kept size sum: 330437
% kept mid-nuclei: 2264
% kept new demods: 40
% forw unit-subs: 24375
% forw double-subs: 3121
% forw overdouble-subs: 135
% backward subs: 1
% fast unit cutoff: 25
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 1.50
% process. runtime: 1.50
% specific non-discr-tree subsumption statistics:
% tried: 389
% length fails: 6
% strength fails: 9
% predlist fails: 149
% aux str. fails: 4
% by-lit fails: 0
% full subs tried: 221
% full subs fail: 86
%
% ; 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/SET079-6+eq_r.in")
%
%------------------------------------------------------------------------------