TSTP Solution File: NUM009-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NUM009-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 0.0s
% Output : Assurance 0.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/NUM009-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(221,40,2,442,0,2)
%
%
% START OF PROOF
% 223 [] -member(X,Y) | little_set(X).
% 283 [] member(empty_set,infinity).
% 391 [] member(empty_set,f44(X)) | member(X,natural_numbers) | -little_set(X).
% 393 [] -member(X,f44(X)) | member(X,natural_numbers).
% 442 [] -member(empty_set,natural_numbers).
% 712 [hyper:223,283] little_set(empty_set).
% 813 [hyper:391,712,cut:442] member(empty_set,f44(empty_set)).
% 33288 [hyper:393,813,cut:442] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 15
% clause depth limited to 5
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 57
% derived clauses: 45566
% kept clauses: 22880
% kept size sum: 704430
% kept mid-nuclei: 6865
% kept new demods: 10
% forw unit-subs: 432
% forw double-subs: 349
% forw overdouble-subs: 5806
% backward subs: 0
% fast unit cutoff: 302
% full unit cutoff: 0
% dbl unit cutoff: 20
% real runtime : 2.7
% process. runtime: 2.7
% specific non-discr-tree subsumption statistics:
% tried: 102600
% length fails: 15134
% strength fails: 19631
% predlist fails: 2738
% aux str. fails: 3854
% by-lit fails: 18984
% full subs tried: 31451
% full subs fail: 25213
%
% ; 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/NUM009-1+eq_r.in")
%
%------------------------------------------------------------------------------