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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : MGT060-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 : 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 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/MGT/MGT060-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 9)
% (binary-unit 9 #f 2 9)
% (binary-double 9 #f 2 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 9)
% (binary-order 25 #f 2 9)
% (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(26,40,0,52,0,0,29557,4,1883)
% 
% 
% START OF PROOF
% 37 [] -greater(Y,Z) | -greater(X,Y) | greater(X,Z).
% 39 [] equal(hazard_of_mortality(X,Y),very_low) | -has_immunity(X,Y) | -organization(X).
% 40 [] equal(hazard_of_mortality(X,Y),low) | -positional_advantage(X,Y) | -is_aligned(X,Y) | has_immunity(X,Y) | -organization(X).
% 41 [] equal(hazard_of_mortality(X,Y),mod1) | -positional_advantage(X,Y) | is_aligned(X,Y) | has_immunity(X,Y) | -organization(X).
% 42 [] equal(hazard_of_mortality(X,Y),mod2) | -is_aligned(X,Y) | positional_advantage(X,Y) | has_immunity(X,Y) | -organization(X).
% 43 [] equal(hazard_of_mortality(X,Y),high) | positional_advantage(X,Y) | is_aligned(X,Y) | has_immunity(X,Y) | -organization(X).
% 44 [] greater(high,mod1).
% 45 [] greater(mod1,low).
% 46 [] greater(low,very_low).
% 48 [] greater(mod2,low).
% 49 [] organization(sk1).
% 50 [] has_immunity(sk1,sk2).
% 51 [] -has_immunity(sk1,sk3).
% 52 [] -greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)).
% 60 [hyper:39,50,cut:49] equal(hazard_of_mortality(sk1,sk2),very_low).
% 72 [hyper:37,45,44] greater(high,low).
% 79 [hyper:37,46,45] greater(mod1,very_low).
% 93 [hyper:37,48,46] greater(mod2,very_low).
% 103 [hyper:37,72,46] greater(high,very_low).
% 68471 [para:43.1.1,52.1.1,demod:60,cut:103,cut:51,cut:49] positional_advantage(sk1,sk3) | is_aligned(sk1,sk3).
% 68474 [para:41.1.1,52.1.1,demod:60,cut:79,cut:51,cut:49,binarycut:68471] is_aligned(sk1,sk3).
% 68475 [para:40.1.1,52.1.1,demod:60,cut:46,cut:68474,cut:51,cut:49] -positional_advantage(sk1,sk3).
% 68480 [para:42.1.1,52.1.1,demod:60,cut:93,cut:68474,cut:68475,cut:51,cut:49] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 9
% clause depth limited to 2
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    903
%  derived clauses:   716120
%  kept clauses:      46298
%  kept size sum:     748751
%  kept mid-nuclei:   12923
%  kept new demods:   1
%  forw unit-subs:    372513
%  forw double-subs: 153783
%  forw overdouble-subs: 128932
%  backward subs:     462
%  fast unit cutoff:  4357
%  full unit cutoff:  0
%  dbl  unit cutoff:  833
%  real runtime  :  23.48
%  process. runtime:  23.48
% specific non-discr-tree subsumption statistics: 
%  tried:           15075680
%  length fails:    281777
%  strength fails:  5715561
%  predlist fails:  5564032
%  aux str. fails:  183797
%  by-lit fails:    43258
%  full subs tried: 3251623
%  full subs fail:  3124665
% 
% ; 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/MGT060-1+eq_r.in")
% 
%------------------------------------------------------------------------------