TSTP Solution File: NUM010-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NUM010-1 : TPTP v3.4.2. Bugfixed v1.2.1.
% 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 89.1s
% Output : Assurance 89.1s
% 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/NUM010-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 5 15)
% (binary-unit 28 #f 5 15)
% (binary-double 11 #f 5 15)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 15)
% (binary-order 28 #f 5 15)
% (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(222,40,2,444,0,2,242588,5,2803,242589,1,2803,242589,50,2805,242589,40,2805,242811,0,2805,298386,3,4206,312493,4,4906,328310,5,5609,328310,5,5610,328311,1,5610,328311,50,5613,328311,40,5613,328533,0,5613,363460,3,6164,373188,4,6440,397251,5,6714,397252,5,6715,397252,1,6715,397252,50,6717,397252,40,6717,397474,0,6717,450085,3,7569,459268,4,7993,477427,5,8418,477428,5,8419,477428,1,8419,477428,50,8421,477428,40,8421,477650,0,8422,543415,3,9279,555475,4,9698)
%
%
% START OF PROOF
% 477430 [] -member(X,Y) | little_set(X).
% 477489 [] little_set(infinity).
% 477490 [] member(empty_set,infinity).
% 477491 [] member(successor(X),infinity) | -member(X,infinity).
% 477595 [] member(f43(X,Y),Y) | -member(empty_set,Y) | -member(X,natural_numbers) | member(X,Y) | -little_set(Y).
% 477596 [] -member(successor(f43(X,Y)),Y) | -member(empty_set,Y) | -member(X,natural_numbers) | member(X,Y) | -little_set(Y).
% 477597 [] little_set(f44(X)) | member(X,natural_numbers) | -little_set(X).
% 477598 [] member(empty_set,f44(X)) | member(X,natural_numbers) | -little_set(X).
% 477599 [] member(successor(X),f44(Y)) | -member(X,f44(Y)) | member(Y,natural_numbers) | -little_set(Y).
% 477600 [] -member(X,f44(X)) | member(X,natural_numbers).
% 477649 [] member(f74,natural_numbers).
% 477650 [] -member(successor(f74),natural_numbers).
% 477680 [binary:477595.3,477649] member(f43(f74,X),X) | -member(empty_set,X) | member(f74,X) | -little_set(X).
% 477681 [binary:477596.3,477649] -member(successor(f43(f74,X)),X) | -member(empty_set,X) | member(f74,X) | -little_set(X).
% 477945 [binary:477600.2,477650] -member(successor(f74),f44(successor(f74))).
% 484924 [binary:477491.2,477680.3,cut:477490,cut:477489] member(f43(f74,infinity),infinity) | member(successor(f74),infinity).
% 485279 [binary:477491.2,477681.3,cut:477490,cut:477489,binarydemod:477491,binarycut:484924] member(successor(f74),infinity).
% 485529 [binary:477430,485279] little_set(successor(f74)).
% 485601 [binary:477597.3,485529,cut:477650] little_set(f44(successor(f74))).
% 485602 [binary:477598.3,485529,cut:477650] member(empty_set,f44(successor(f74))).
% 520636 [binary:477599,477945,cut:477650,cut:485529] -member(f74,f44(successor(f74))).
% 521869 [binary:477595.4,520636,cut:477649,cut:485602,cut:485601] member(f43(f74,f44(successor(f74))),f44(successor(f74))).
% 521870 [binary:477596.4,520636,cut:477649,cut:485602,cut:485601] -member(successor(f43(f74,f44(successor(f74)))),f44(successor(f74))).
% 556265 [binary:521870,477599,cut:521869,cut:477650,cut:485529] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 17
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 5831
% derived clauses: 1459307
% kept clauses: 302776
% kept size sum: 0
% kept mid-nuclei: 82512
% kept new demods: 133
% forw unit-subs: 616697
% forw double-subs: 68444
% forw overdouble-subs: 73563
% backward subs: 101
% fast unit cutoff: 23661
% full unit cutoff: 2388
% dbl unit cutoff: 395
% real runtime : 98.25
% process. runtime: 97.24
% specific non-discr-tree subsumption statistics:
% tried: 23115284
% length fails: 1726182
% strength fails: 7579487
% predlist fails: 3321729
% aux str. fails: 1517389
% by-lit fails: 5557956
% full subs tried: 2831751
% full subs fail: 2756670
%
% ; 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/NUM010-1+eq_r.in")
%
%------------------------------------------------------------------------------