TSTP Solution File: MGT004-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : MGT004-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 : 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 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/MGT004-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: medium
% 
% strategies selected: 
% (hyper 27 #f 2 21)
% (binary-unit 10 #f 2 21)
% (binary-double 16 #f 2 21)
% (binary 54 #t 2 21)
% (binary-order 27 #f 2 21)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(14,40,0,28,0,1)
% 
% 
% START OF PROOF
% 15 [] reliability(X,sk1(Y,X),Y) | -organization(X,Y).
% 16 [] accountability(X,sk2(Y,X),Y) | -organization(X,Y).
% 17 [] -survival_chance(X,Y,Z) | -survival_chance(U,V,W) | -accountability(U,X2,W) | -accountability(X,X1,Z) | -reliability(U,X4,W) | -reliability(X,X3,Z) | -greater(X2,X1) | -greater(X4,X3) | -organization(X,Z) | -organization(U,W) | greater(V,Y).
% 18 [] -reorganization(X,Y,Z) | -accountability(X,W,X1) | -accountability(X,U,V) | -reliability(X,X2,V) | -reliability(X,X3,X1) | -greater(X1,V) | -organization(X,V) | -organization(X,X1) | greater(X1,Z) | greater(X2,X3) | greater(Y,V).
% 19 [] -reorganization(X,Y,Z) | -accountability(X,W,X1) | -accountability(X,U,V) | -reliability(X,X2,V) | -reliability(X,X3,X1) | -greater(X1,V) | -organization(X,V) | -organization(X,X1) | greater(X1,Z) | greater(U,W) | greater(Y,V).
% 20 [] organization(sk3,sk6).
% 21 [] organization(sk3,sk7).
% 22 [] reorganization(sk3,sk8,sk9).
% 23 [] survival_chance(sk3,sk4,sk6).
% 24 [] survival_chance(sk3,sk5,sk7).
% 25 [] -greater(sk8,sk6).
% 26 [] greater(sk7,sk6).
% 27 [] -greater(sk7,sk9).
% 28 [] -greater(sk4,sk5).
% 35 [hyper:15,20] reliability(sk3,sk1(sk6,sk3),sk6).
% 36 [hyper:16,20] accountability(sk3,sk2(sk6,sk3),sk6).
% 43 [hyper:15,21] reliability(sk3,sk1(sk7,sk3),sk7).
% 44 [hyper:16,21] accountability(sk3,sk2(sk7,sk3),sk7).
% 224 [hyper:18,43,22,36,35,cut:21,slowcut:44,cut:26,cut:20,cut:27,cut:25] greater(sk1(sk6,sk3),sk1(sk7,sk3)).
% 508 [hyper:19,44,22,36,cut:21,slowcut:43,cut:26,cut:20,slowcut:35,cut:25,cut:27] greater(sk2(sk6,sk3),sk2(sk7,sk3)).
% 538 [hyper:17,508,36,44,24,23,35,224,cut:20,cut:21,cut:43] greater(sk4,sk5).
% 579 [hyper:28,538] 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 21
% clause depth limited to 2
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    21
%  derived clauses:   442
%  kept clauses:      9
%  kept size sum:     63
%  kept mid-nuclei:   412
%  kept new demods:   0
%  forw unit-subs:    13
%  forw double-subs: 0
%  forw overdouble-subs: 1
%  backward subs:     1
%  fast unit cutoff:  254
%  full unit cutoff:  123
%  dbl  unit cutoff:  0
%  real runtime  :  0.3
%  process. runtime:  0.3
% specific non-discr-tree subsumption statistics: 
%  tried:           303
%  length fails:    0
%  strength fails:  90
%  predlist fails:  118
%  aux str. fails:  84
%  by-lit fails:    0
%  full subs tried: 10
%  full subs fail:  10
% 
% ; 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/MGT004-1+noeq.in")
% 
%------------------------------------------------------------------------------