↑ Up

Gandalf---c-2.6.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : MGT043-1 : TPTP v3.4.2. Released v2.4.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art05.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/MGT/MGT043-1+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 2 11)
% (binary-unit 9 #f 2 11)
% (binary-double 9 #f 2 11)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 11)
% (binary-order 25 #f 2 11)
% (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(27,40,0,54,0,0)
% 
% 
% START OF PROOF
% 28 [] equal(X,X).
% 31 [] -equal(X,Y) | smaller_or_equal(X,Y).
% 34 [] -equal(X,Y) | greater_or_equal(X,Y).
% 35 [] -smaller(X,Y) | greater(Y,X).
% 40 [] -greater(capability(X,Y),capability(X,Z)) | -greater_or_equal(position(X,Y),position(X,Z)) | smaller(hazard_of_mortality(X,Y),hazard_of_mortality(X,Z)) | has_immunity(X,Z) | has_immunity(X,Y) | -organization(X).
% 44 [] -greater(internal_friction(X,Y),internal_friction(X,Z)) | -smaller_or_equal(stock_of_knowledge(X,Y),stock_of_knowledge(X,Z)) | smaller(capability(X,Y),capability(X,Z)) | -organization(X).
% 47 [] -equal(external_ties(X,Y),external_ties(X,Z)) | equal(position(X,Y),position(X,Z)) | -organization(X).
% 48 [] organization(sk1).
% 49 [] -has_immunity(sk1,sk2).
% 50 [] -has_immunity(sk1,sk3).
% 51 [] equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)).
% 52 [] greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2)).
% 53 [] equal(external_ties(sk1,sk2),external_ties(sk1,sk3)).
% 54 [] -greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)).
% 63 [hyper:31,28] smaller_or_equal(X,X).
% 64 [hyper:34,28] greater_or_equal(X,X).
% 80 [hyper:44,52,demod:51,cut:63,cut:48] smaller(capability(sk1,sk3),capability(sk1,sk2)).
% 86 [hyper:47,53,cut:48] equal(position(sk1,sk2),position(sk1,sk3)).
% 90 [hyper:35,80] greater(capability(sk1,sk2),capability(sk1,sk3)).
% 670 [hyper:40,90,demod:86,cut:64,cut:48,cut:50,cut:49] smaller(hazard_of_mortality(sk1,sk2),hazard_of_mortality(sk1,sk3)).
% 672 [hyper:35,670,cut:54] 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 11
% clause depth limited to 2
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    44
%  derived clauses:   1415
%  kept clauses:      153
%  kept size sum:     2987
%  kept mid-nuclei:   434
%  kept new demods:   3
%  forw unit-subs:    296
%  forw double-subs: 72
%  forw overdouble-subs: 427
%  backward subs:     0
%  fast unit cutoff:  19
%  full unit cutoff:  0
%  dbl  unit cutoff:  2
%  real runtime  :  0.6
%  process. runtime:  0.5
% specific non-discr-tree subsumption statistics: 
%  tried:           3047
%  length fails:    0
%  strength fails:  208
%  predlist fails:  1674
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 1159
%  full subs fail:  738
% 
% ; 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/MGT/MGT043-1+eq_r.in")
% 
%------------------------------------------------------------------------------