TSTP Solution File: MGT005-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT005-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/MGT005-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 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(30,40,0,60,0,0)
%
%
% START OF PROOF
% 31 [] equal(X,X).
% 32 [] -greater(X,Y) | -equal(X,Y).
% 33 [] -greater(X,Y) | -greater(Y,X).
% 34 [] -greater(Y,Z) | -greater(X,Y) | greater(X,Z).
% 35 [] survival_chance(X,sk1(Y,X),Y) | -organization(X,Y).
% 36 [] -organization(X,Y) | -organization(X,Z) | -greater(Z,U) | -greater(U,Y) | organization(X,U).
% 37 [] -reorganization(X,Y,Z) | greater(Z,Y).
% 38 [] -reorganization_free(X,Y,Z) | -survival_chance(X,U,Y) | -survival_chance(X,V,Z) | -organization(X,Z) | -organization(X,Y) | -greater(Z,Y) | greater(V,U).
% 39 [] -reorganization(X,Y,Z) | -survival_chance(X,W,X1) | -survival_chance(X,U,V) | -organization(X,V) | -organization(X,X1) | -greater(X1,V) | greater(X1,Z) | greater(U,W) | greater(Y,V).
% 40 [] -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).
% 41 [] -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).
% 42 [] organization(sk2,sk11).
% 43 [] organization(sk3,sk11).
% 44 [] organization(sk2,sk13).
% 45 [] organization(sk3,sk13).
% 46 [] class(sk2,sk5,sk11).
% 47 [] class(sk3,sk5,sk11).
% 48 [] survival_chance(sk2,sk6,sk11).
% 49 [] survival_chance(sk3,sk6,sk11).
% 50 [] reorganization(sk2,sk11,sk12).
% 51 [] reorganization(sk3,sk11,sk13).
% 52 [] reorganization_type(sk2,sk4,sk11).
% 53 [] reorganization_type(sk3,sk4,sk11).
% 54 [] reorganization_free(sk2,sk12,sk13).
% 55 [] survival_chance(sk2,sk7,sk13).
% 56 [] survival_chance(sk3,sk8,sk13).
% 57 [] complexity(sk2,sk9,sk11).
% 58 [] complexity(sk3,sk10,sk11).
% 59 [] greater(sk10,sk9).
% 60 [] -greater(sk7,sk8).
% 177 [hyper:37,50] greater(sk12,sk11).
% 7606 [hyper:40,58,53,47,51,59,50,cut:43,cut:45,cut:46,cut:52,cut:57,cut:42] greater(sk13,sk12).
% 162489 [hyper:36,7606,42,cut:177,cut:44] organization(sk2,sk12).
% 162490 [hyper:36,7606,43,cut:177,cut:45] organization(sk3,sk12).
% 163810 [hyper:35,162489] survival_chance(sk2,sk1(sk12,sk2),sk12).
% 165140 [hyper:35,162490] survival_chance(sk3,sk1(sk12,sk3),sk12).
% 180818 [hyper:38,163810,54,55,cut:162489,cut:44,cut:7606] greater(sk7,sk1(sk12,sk2)).
% 208434 [hyper:39,165140,51,56,cut:162490,cut:45,cut:7606] greater(sk1(sk12,sk3),sk8) | greater(sk11,sk12) | greater(sk13,sk13).
% 208511 [hyper:41,165140,58,53,47,50,57,163810,49,cut:162490,cut:43,slowcut:51,cut:46,cut:52,cut:42,cut:162489,cut:59,cut:48] greater(sk1(sk12,sk2),sk1(sk12,sk3)) | equal(sk1(sk12,sk2),sk1(sk12,sk3)).
% 219652 [hyper:32,208434,cut:31] greater(sk1(sk12,sk3),sk8) | greater(sk11,sk12).
% 219774 [hyper:33,219652,cut:177] greater(sk1(sk12,sk3),sk8).
% 219802 [hyper:34,208511,180818] equal(sk1(sk12,sk2),sk1(sk12,sk3)) | greater(sk7,sk1(sk12,sk3)).
% 219925 [hyper:34,219802,219774,cut:60] equal(sk1(sk12,sk2),sk1(sk12,sk3)).
% 219930 [para:219925.1.2,219774.1.1] greater(sk1(sk12,sk2),sk8).
% 219940 [hyper:34,219930,180818,cut:60] 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: 77
% derived clauses: 239917
% kept clauses: 68
% kept size sum: 589
% kept mid-nuclei: 214247
% kept new demods: 1
% forw unit-subs: 15537
% forw double-subs: 9448
% forw overdouble-subs: 356
% backward subs: 34
% fast unit cutoff: 77619
% full unit cutoff: 5532
% dbl unit cutoff: 0
% real runtime : 6.41
% process. runtime: 6.40
% specific non-discr-tree subsumption statistics:
% tried: 29937
% length fails: 0
% strength fails: 9207
% predlist fails: 15983
% aux str. fails: 315
% by-lit fails: 280
% full subs tried: 3796
% full subs fail: 3796
%
% ; 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-1+eq_r.in")
%
%------------------------------------------------------------------------------