TSTP Solution File: SET016-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET016-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 : art02.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 20.0s
% Output : Assurance 20.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/SET016-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(95,40,1,190,0,1,431429,4,1877,433300,5,2503,433301,1,2506,433301,50,2512,433301,40,2512,433396,0,2512)
%
%
% START OF PROOF
% 433303 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 433308 [] -equal(X,Y) | subclass(Y,X).
% 433310 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 433311 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 433313 [] member(unordered_pair(X,Y),universal_class).
% 433314 [] equal(unordered_pair(X,X),singleton(X)).
% 433315 [] equal(unordered_pair(singleton(X),unordered_pair(X,singleton(Y))),ordered_pair(X,Y)).
% 433394 [] equal(ordered_pair(w,x),ordered_pair(y,z)).
% 433395 [] member(w,universal_class).
% 433396 [] -equal(w,y).
% 433397 [input:433310,factor] -member(X,unordered_pair(Y,Y)) | equal(X,Y).
% 433425 [para:433314.1.1,433313.1.1] member(singleton(X),universal_class).
% 433452 [binary:433395,433311.2] member(w,unordered_pair(w,X)).
% 433458 [binary:433303,433452] -subclass(unordered_pair(w,X),Y) | member(w,Y).
% 433459 [para:433314.1.1,433452.1.2] member(w,singleton(w)).
% 433466 [binary:433303,433459] -subclass(singleton(w),X) | member(w,X).
% 433477 [para:433315.1.1,433310.1.2] equal(X,unordered_pair(Y,singleton(Z))) | -member(X,ordered_pair(Y,Z)) | equal(X,singleton(Y)).
% 433478 [para:433315.1.1,433311.1.2,cut:433425] member(singleton(X),ordered_pair(X,Y)).
% 433486 [para:433394.1.2,433478.1.2] member(singleton(y),ordered_pair(w,x)).
% 436128 [binary:433396,433397.2] -member(w,unordered_pair(y,y)).
% 436294 [para:433314.1.1,436128.1.2] -member(w,singleton(y)).
% 436310 [binary:433466.2,436294] -subclass(singleton(w),singleton(y)).
% 436438 [binary:433308.2,436310] -equal(singleton(y),singleton(w)).
% 437486 [binary:436294,433458.2] -subclass(unordered_pair(w,X),singleton(y)).
% 437947 [binary:433486,433477.2,cut:436438] equal(singleton(y),unordered_pair(w,singleton(x))).
% 438516 [binary:433308.2,437486,slowcut:437947] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1204
% derived clauses: 554848
% kept clauses: 82026
% kept size sum: 50706
% kept mid-nuclei: 8293
% kept new demods: 115
% forw unit-subs: 85983
% forw double-subs: 12613
% forw overdouble-subs: 501
% backward subs: 20
% fast unit cutoff: 156
% full unit cutoff: 0
% dbl unit cutoff: 84
% real runtime : 25.64
% process. runtime: 25.63
% specific non-discr-tree subsumption statistics:
% tried: 9984
% length fails: 1205
% strength fails: 29
% predlist fails: 6312
% aux str. fails: 40
% by-lit fails: 11
% full subs tried: 2349
% full subs fail: 1856
%
% ; 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/SET016-6+eq_r.in")
%
%------------------------------------------------------------------------------