TSTP Solution File: SET084-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET084-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 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/SET084-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,433388,4,1877,435377,5,2503,435378,1,2506,435378,50,2512,435378,40,2512,435473,0,2512)
%
%
% START OF PROOF
% 435379 [] equal(X,X).
% 435387 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 435388 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 435391 [] equal(unordered_pair(X,X),singleton(X)).
% 435471 [] equal(singleton(x),singleton(y)).
% 435472 [] member(y,universal_class).
% 435473 [] -equal(x,y).
% 435502 [para:435391.1.2,435471.1.1] equal(unordered_pair(x,x),singleton(y)).
% 435525 [para:435502.1.1,435387.1.2] -member(X,singleton(y)) | equal(X,x).
% 435530 [binary:435472,435388.2] member(y,unordered_pair(y,X)).
% 435538 [para:435391.1.1,435530.1.2] member(y,singleton(y)).
% 435592 [binary:435538,435525] equal(y,x).
% 435631 [para:435592.1.2,435473.1.1,cut:435379] 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: 684
% derived clauses: 546296
% kept clauses: 77163
% kept size sum: 1156
% kept mid-nuclei: 8294
% kept new demods: 87
% forw unit-subs: 83721
% forw double-subs: 12496
% forw overdouble-subs: 493
% backward subs: 12
% fast unit cutoff: 74
% full unit cutoff: 0
% dbl unit cutoff: 68
% real runtime : 25.13
% process. runtime: 25.13
% specific non-discr-tree subsumption statistics:
% tried: 4580
% length fails: 21
% strength fails: 29
% predlist fails: 3145
% aux str. fails: 14
% by-lit fails: 11
% full subs tried: 1348
% full subs fail: 861
%
% ; 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/SET084-6+eq_r.in")
%
%------------------------------------------------------------------------------