TSTP Solution File: MGT005-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT005-2 : 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 : art09.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/MGT005-2+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 37)
% (binary-unit 9 #f 2 37)
% (binary-double 9 #f 2 37)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 37)
% (binary-order 25 #f 2 37)
% (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(39,40,1,78,0,2)
%
%
% START OF PROOF
% 46 [] -organization(X,Y) | -organization(X,Z) | -greater(Z,U) | -greater(U,Y) | organization(X,U).
% 47 [] -reorganization(X,Y,Z) | greater(Z,Y).
% 50 [] -complexity(U,V,Z) | -complexity(X,Y,Z) | -reorganization_type(U,W,Z) | -reorganization_type(X,W,Z) | -class(X,X1,Z) | -class(U,X1,Z) | -reorganization(X,Z,X3) | -reorganization(U,Z,X2) | -organization(X,Z) | -organization(X,X3) | -organization(U,Z) | -greater(Y,V) | greater(X3,X2).
% 51 [] -complexity(X,Y,Z) | -complexity(U,V,Z) | -reorganization_type(U,W,Z) | -reorganization_type(X,W,Z) | -class(X,X1,Z) | -class(U,X1,Z) | -reorganization(U,Z,X3) | -reorganization(X,Z,X2) | -survival_chance(X,X6,X2) | -survival_chance(U,X5,X2) | -survival_chance(U,X4,Z) | -survival_chance(X,X4,Z) | -organization(X,X2) | -organization(U,X2) | -organization(X,Z) | -organization(U,Z) | -greater(V,Y) | greater(X6,X5) | equal(X6,X5).
% 57 [] organization(sk5,sk15).
% 58 [] organization(sk6,sk15).
% 59 [] organization(sk5,sk17).
% 60 [] organization(sk6,sk17).
% 61 [] class(sk5,sk8,sk15).
% 62 [] class(sk6,sk8,sk15).
% 63 [] survival_chance(sk5,sk9,sk15).
% 64 [] survival_chance(sk6,sk9,sk15).
% 65 [] reorganization(sk5,sk15,sk16).
% 66 [] reorganization(sk6,sk15,sk17).
% 67 [] reorganization_type(sk5,sk7,sk15).
% 68 [] reorganization_type(sk6,sk7,sk15).
% 70 [] survival_chance(sk5,sk10,sk14).
% 71 [] survival_chance(sk6,sk11,sk14).
% 72 [] complexity(sk5,sk12,sk15).
% 73 [] complexity(sk6,sk13,sk15).
% 74 [] greater(sk13,sk12).
% 76 [] equal(sk14,sk16).
% 77 [] -greater(sk10,sk11).
% 78 [] -equal(sk10,sk11).
% 355 [hyper:47,65] greater(sk16,sk15).
% 565 [para:76.1.1,70.1.3] survival_chance(sk5,sk10,sk16).
% 792 [para:76.1.1,71.1.3] survival_chance(sk6,sk11,sk16).
% 8094 [hyper:50,73,68,62,66,74,65,cut:58,cut:60,cut:61,cut:67,cut:72,cut:57] greater(sk17,sk16).
% 20358 [hyper:46,8094,57,cut:355,cut:59] organization(sk5,sk16).
% 20359 [hyper:46,8094,58,cut:355,cut:60] organization(sk6,sk16).
% 50092 [hyper:51,792,73,68,62,65,72,64,565,cut:20359,cut:58,slowcut:66,cut:61,cut:67,cut:20358,cut:57,cut:74,cut:63,cut:77,cut:78] 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 37
% clause depth limited to 2
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 34
% derived clauses: 60532
% kept clauses: 16
% kept size sum: 86
% kept mid-nuclei: 47792
% kept new demods: 1
% forw unit-subs: 12617
% forw double-subs: 86
% forw overdouble-subs: 4
% backward subs: 1
% fast unit cutoff: 24345
% full unit cutoff: 2200
% dbl unit cutoff: 0
% real runtime : 1.69
% process. runtime: 1.68
% specific non-discr-tree subsumption statistics:
% tried: 21313
% length fails: 0
% strength fails: 11707
% predlist fails: 6707
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 2895
% full subs fail: 2895
%
% ; 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/MGT005-2+eq_r.in")
%
%------------------------------------------------------------------------------