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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : MGT042-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 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/MGT042-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(39,40,0,78,0,1,19785,5,2502,19785,1,2503,19785,50,2503,19785,40,2503,19824,0,2503,19940,50,2503,19979,0,2503,20095,50,2504,20134,0,2504,20250,50,2505,20289,0,2505,20405,50,2505,20444,0,2506,20560,50,2506,20599,0,2506,20715,50,2507,20754,0,2507,20870,50,2508,20909,0,2508,21025,50,2508,21064,0,2509,21180,50,2509,21219,0,2509,21335,50,2510,21374,0,2511,21490,50,2511,21529,0,2511,21645,50,2512,21684,0,2512,21800,50,2513,21839,0,2513,21955,50,2513,21994,0,2514,22110,50,2515,22149,0,2515,22265,50,2515,22304,0,2516,22420,50,2516,22459,0,2516,22575,50,2517,22614,0,2518,22730,50,2518,22769,0,2518,22885,50,2519,22885,40,2519,22924,0,2520)
% 
% 
% START OF PROOF
% 22886 [] equal(X,X).
% 22887 [] -smaller_or_equal(X,Y) | smaller(X,Y) | equal(X,Y).
% 22889 [] -equal(X,Y) | smaller_or_equal(X,Y).
% 22890 [] -greater_or_equal(X,Y) | greater(X,Y) | equal(X,Y).
% 22891 [] -greater(X,Y) | greater_or_equal(X,Y).
% 22892 [] -equal(X,Y) | greater_or_equal(X,Y).
% 22893 [] -smaller(X,Y) | greater(Y,X).
% 22898 [] -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).
% 22899 [] -greater(position(X,Y),position(X,Z)) | -greater_or_equal(capability(X,Y),capability(X,Z)) | smaller(hazard_of_mortality(X,Y),hazard_of_mortality(X,Z)) | has_immunity(X,Z) | has_immunity(X,Y) | -organization(X).
% 22901 [] -greater(stock_of_knowledge(X,Y),stock_of_knowledge(X,Z)) | -smaller_or_equal(internal_friction(X,Y),internal_friction(X,Z)) | greater(capability(X,Y),capability(X,Z)) | -organization(X).
% 22902 [] -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).
% 22903 [] -equal(internal_friction(X,Y),internal_friction(X,Z)) | -equal(stock_of_knowledge(X,Y),stock_of_knowledge(X,Z)) | equal(capability(X,Y),capability(X,Z)) | -organization(X).
% 22904 [] -greater(external_ties(X,Y),external_ties(X,Z)) | greater(position(X,Y),position(X,Z)) | -organization(X).
% 22905 [] -equal(external_ties(X,Y),external_ties(X,Z)) | equal(position(X,Y),position(X,Z)) | -organization(X).
% 22906 [] organization(sk1).
% 22907 [] -has_immunity(sk1,sk2).
% 22908 [] -has_immunity(sk1,sk3).
% 22909 [?] ?
% 22911 [] greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)) | greater(external_ties(sk1,sk3),external_ties(sk1,sk2)).
% 22914 [] smaller_or_equal(internal_friction(sk1,sk3),internal_friction(sk1,sk2)).
% 22917 [?] ?
% 22924 [] -smaller(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)).
% 22927 [input:22909,binarycut:22891] greater_or_equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)).
% 22930 [binary:22886,22889] smaller_or_equal(X,X).
% 22961 [binary:22893,22887.2] -smaller_or_equal(X,Y) | greater(Y,X) | equal(X,Y).
% 22967 [binary:22927,22890] greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)) | equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)).
% 23018 [input:22917,binarycut:22891] greater_or_equal(external_ties(sk1,sk3),external_ties(sk1,sk2)).
% 23019 [binary:22890,23018] greater(external_ties(sk1,sk3),external_ties(sk1,sk2)) | equal(external_ties(sk1,sk3),external_ties(sk1,sk2)).
% 23468 [binary:22906,22904.3] -greater(external_ties(sk1,X),external_ties(sk1,Y)) | greater(position(sk1,X),position(sk1,Y)).
% 23492 [binary:22906,22905.3] -equal(external_ties(sk1,X),external_ties(sk1,Y)) | equal(position(sk1,X),position(sk1,Y)).
% 24240 [binary:22891,22967,binarycut:22892] greater_or_equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)).
% 24404 [binary:22891,23468.2] -greater(external_ties(sk1,X),external_ties(sk1,Y)) | greater_or_equal(position(sk1,X),position(sk1,Y)).
% 24495 [binary:22892,23492.2] -equal(external_ties(sk1,X),external_ties(sk1,Y)) | greater_or_equal(position(sk1,X),position(sk1,Y)).
% 24726 [binary:24404,23019,binarycut:24495] greater_or_equal(position(sk1,sk3),position(sk1,sk2)).
% 24739 [binary:22898.2,24726,cut:22924,cut:22907,cut:22908,cut:22906] -greater(capability(sk1,sk3),capability(sk1,sk2)).
% 24744 [binary:22893.2,24739] -smaller(capability(sk1,sk2),capability(sk1,sk3)).
% 24763 [binary:22901.3,24739,cut:22914,cut:22906] -greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)).
% 24792 [binary:22911,24763] greater(external_ties(sk1,sk3),external_ties(sk1,sk2)).
% 24793 [binary:22890.2,24763,cut:24240] equal(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)).
% 24831 [binary:22904,24792,cut:22906] greater(position(sk1,sk3),position(sk1,sk2)).
% 24888 [binary:22899,24831,cut:22924,cut:22907,cut:22908,cut:22906] -greater_or_equal(capability(sk1,sk3),capability(sk1,sk2)).
% 24940 [binary:22892.2,24888] -equal(capability(sk1,sk3),capability(sk1,sk2)).
% 24986 [binary:22903.3,24940,demod:24793,cut:22886,cut:22906] -equal(internal_friction(sk1,sk3),internal_friction(sk1,sk2)).
% 24998 [binary:22961.3,24986,cut:22914] greater(internal_friction(sk1,sk2),internal_friction(sk1,sk3)).
% 25052 [binary:22902,24998,demod:24793,cut:22930,cut:24744,cut:22906] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 11
% clause depth limited to 2
% seconds given: 9
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1860
%  derived clauses:   56197
%  kept clauses:      9348
%  kept size sum:     264795
%  kept mid-nuclei:   9238
%  kept new demods:   1
%  forw unit-subs:    9171
%  forw double-subs: 4132
%  forw overdouble-subs: 22273
%  backward subs:     233
%  fast unit cutoff:  1249
%  full unit cutoff:  0
%  dbl  unit cutoff:  982
%  real runtime  :  25.47
%  process. runtime:  25.39
% specific non-discr-tree subsumption statistics: 
%  tried:           9677054
%  length fails:    31380
%  strength fails:  910596
%  predlist fails:  5366731
%  aux str. fails:  1149
%  by-lit fails:    4874
%  full subs tried: 3359672
%  full subs fail:  3337186
% 
% ; 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/MGT042-1+eq_r.in")
% 
%------------------------------------------------------------------------------