TSTP Solution File: SET094-7 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET094-7 : 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 39.8s
% Output : Assurance 39.8s
% 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/SET094-7+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(141,40,0,282,0,0,441724,4,2102,566050,5,2801,566051,1,2803,566051,50,2809,566051,40,2809,566192,0,2809,603041,3,4226)
%
%
% START OF PROOF
% 566053 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 566058 [] -equal(X,Y) | subclass(Y,X).
% 566059 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 566060 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 566064 [] equal(unordered_pair(X,X),singleton(X)).
% 566155 [] -member(X,null_class).
% 566161 [] subclass(singleton(X),unordered_pair(X,Y)).
% 566171 [] subclass(unordered_pair(X,Y),Z) | -member(Y,Z) | -member(X,Z).
% 566178 [] equal(singleton(X),null_class) | member(X,universal_class).
% 566179 [] -equal(singleton(X),singleton(Y)) | -member(X,universal_class) | equal(X,Y).
% 566190 [] equal(singleton(member_of(x)),x).
% 566191 [] member(y,x).
% 566192 [] -equal(member_of(x),y).
% 566193 [input:566060,factor] -member(X,unordered_pair(Y,Y)) | equal(X,Y).
% 566202 [input:566171,factor] subclass(unordered_pair(X,X),Y) | -member(X,Y).
% 566206 [binary:566191,566053] -subclass(x,X) | member(y,X).
% 566220 [binary:566155,566206.2] -subclass(x,null_class).
% 566235 [binary:566220,566058.2] -equal(null_class,x).
% 566305 [para:566190.1.1,566161.1.1] subclass(x,unordered_pair(member_of(x),X)).
% 567674 [binary:566206,566305] member(y,unordered_pair(member_of(x),X)).
% 570629 [para:566178.1.1,566190.1.1,cut:566235] member(member_of(x),universal_class).
% 570695 [binary:566192,566179.3,demod:566190,cut:570629] -equal(x,singleton(y)).
% 572835 [binary:566191,566202.2] subclass(unordered_pair(y,y),x).
% 586323 [para:566064.1.1,572835.1.1] subclass(singleton(y),x).
% 586436 [binary:566059,586323,cut:570695] -subclass(x,singleton(y)).
% 586446 [binary:566058.2,586436] -equal(singleton(y),x).
% 606889 [binary:566193,567674] equal(y,member_of(x)).
% 606890 [para:606889.1.2,566190.1.1.1,cut:586446] 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: 2444
% derived clauses: 870493
% kept clauses: 117509
% kept size sum: 411882
% kept mid-nuclei: 136580
% kept new demods: 875
% forw unit-subs: 234633
% forw double-subs: 19829
% forw overdouble-subs: 6350
% backward subs: 45
% fast unit cutoff: 3067
% full unit cutoff: 161
% dbl unit cutoff: 94
% real runtime : 47.80
% process. runtime: 47.23
% specific non-discr-tree subsumption statistics:
% tried: 64118
% length fails: 4984
% strength fails: 2718
% predlist fails: 20356
% aux str. fails: 5924
% by-lit fails: 844
% full subs tried: 28799
% full subs fail: 22440
%
% ; 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/SET094-7+eq_r.in")
%
%------------------------------------------------------------------------------