TSTP Solution File: SET067-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET067-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 : art08.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/SET067-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(93,40,1,186,0,1,425104,4,1877)
%
%
% START OF PROOF
% 95 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 96 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 97 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 98 [] subclass(X,universal_class).
% 102 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 103 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 106 [] equal(unordered_pair(X,X),singleton(X)).
% 186 [] -subclass(singleton(x),unordered_pair(x,y)).
% 347 [hyper:186,96] member(not_subclass_element(singleton(x),unordered_pair(x,y)),singleton(x)).
% 1670 [para:106.1.2,347.1.2] member(not_subclass_element(singleton(x),unordered_pair(x,y)),unordered_pair(x,x)).
% 2566 [hyper:102,1670] equal(not_subclass_element(singleton(x),unordered_pair(x,y)),x).
% 2654 [hyper:95,1670,98,demod:2566] member(x,universal_class).
% 2659 [hyper:103,2654] member(x,unordered_pair(x,X)).
% 425443 [binary:97.2,186,demod:2566,cut:2659] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 604
% derived clauses: 527430
% kept clauses: 77025
% kept size sum: 0
% kept mid-nuclei: 8174
% kept new demods: 55
% forw unit-subs: 87883
% forw double-subs: 12509
% forw overdouble-subs: 481
% backward subs: 10
% fast unit cutoff: 76
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 22.86
% process. runtime: 22.84
% specific non-discr-tree subsumption statistics:
% tried: 3493
% length fails: 9
% strength fails: 25
% predlist fails: 2275
% aux str. fails: 14
% by-lit fails: 5
% full subs tried: 1153
% full subs fail: 678
%
% ; 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/SET067-6+eq_r.in")
%
%------------------------------------------------------------------------------