TSTP Solution File: NUM180-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NUM180-1 : 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/NUM/NUM180-1+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(160,40,0,320,0,0,226350,4,2211,227215,5,2801,227216,1,2804,227216,50,2810,227216,40,2810,227376,0,2827)
%
%
% START OF PROOF
% 227219 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 227220 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 227239 [] -member(X,intersection(Y,Z)) | member(X,Z).
% 227356 [] equal(intersection(complement(kind_1_ordinals),ordinal_numbers),limit_ordinals).
% 227376 [] -subclass(limit_ordinals,ordinal_numbers).
% 227393 [binary:227376,227219.2] member(not_subclass_element(limit_ordinals,ordinal_numbers),limit_ordinals).
% 227401 [binary:227376,227220.2] -member(not_subclass_element(limit_ordinals,ordinal_numbers),ordinal_numbers).
% 227646 [para:227356.1.1,227239.1.2] -member(X,limit_ordinals) | member(X,ordinal_numbers).
% 227683 [binary:227393,227646,cut:227401] 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: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 628
% derived clauses: 330958
% kept clauses: 77275
% kept size sum: 2404
% kept mid-nuclei: 25114
% kept new demods: 92
% forw unit-subs: 78590
% forw double-subs: 23250
% forw overdouble-subs: 1271
% backward subs: 21
% fast unit cutoff: 90
% full unit cutoff: 37
% dbl unit cutoff: 26
% real runtime : 28.29
% process. runtime: 28.28
% specific non-discr-tree subsumption statistics:
% tried: 10893
% length fails: 326
% strength fails: 690
% predlist fails: 3990
% aux str. fails: 169
% by-lit fails: 1105
% full subs tried: 3710
% full subs fail: 2411
%
% ; 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/NUM/NUM180-1+eq_r.in")
%
%------------------------------------------------------------------------------