TSTP Solution File: MGT030-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT030-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 : art03.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/MGT030-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 3 11)
% (binary-unit 10 #f 3 11)
% (binary-double 16 #f 3 11)
% (binary 54 #t 3 11)
% (binary-order 27 #f 3 11)
% (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(16,40,0,32,0,1,104,50,1,120,0,1)
%
%
% START OF PROOF
% 105 [] subpopulations(first_movers,efficient_producers,X,sk1(Y,X)) | in_environment(X,sk2(X)) | -in_environment(X,Y) | -environment(X).
% 106 [] greater_or_equal(sk1(X,Y),X) | in_environment(Y,sk2(Y)) | -in_environment(Y,X) | -environment(Y).
% 107 [] -greater(growth_rate(efficient_producers,sk2(X)),growth_rate(first_movers,sk2(X))) | subpopulations(first_movers,efficient_producers,X,sk1(Y,X)) | -in_environment(X,Y) | -environment(X).
% 108 [] greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | subpopulations(first_movers,efficient_producers,Y,sk1(Z,Y)) | -greater(X,sk2(Y)) | -subpopulations(first_movers,efficient_producers,Y,X) | -in_environment(Y,Z) | -environment(Y).
% 109 [] -greater(growth_rate(efficient_producers,sk2(X)),growth_rate(first_movers,sk2(X))) | greater_or_equal(sk1(Y,X),Y) | -in_environment(X,Y) | -environment(X).
% 111 [] -greater(growth_rate(efficient_producers,sk1(X,Y)),growth_rate(first_movers,sk1(X,Y))) | in_environment(Y,sk2(Y)) | -in_environment(Y,X) | -environment(Y).
% 112 [] -greater(growth_rate(efficient_producers,sk1(X,Y)),growth_rate(first_movers,sk1(X,Y))) | -greater(growth_rate(efficient_producers,sk2(Y)),growth_rate(first_movers,sk2(Y))) | -in_environment(Y,X) | -environment(Y).
% 113 [] -greater(growth_rate(efficient_producers,sk1(X,Y)),growth_rate(first_movers,sk1(X,Y))) | greater(growth_rate(efficient_producers,Z),growth_rate(first_movers,Z)) | -greater(Z,sk2(Y)) | -subpopulations(first_movers,efficient_producers,Y,Z) | -in_environment(Y,X) | -environment(Y).
% 114 [] in_environment(X,sk3(X)) | -stable(X) | -environment(X).
% 115 [] greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | -greater_or_equal(X,sk3(Y)) | -subpopulations(first_movers,efficient_producers,Y,X) | -stable(Y) | -environment(Y).
% 116 [] environment(sk4).
% 117 [] stable(sk4).
% 118 [] greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | subpopulations(first_movers,efficient_producers,sk4,sk5(X)) | -in_environment(sk4,X).
% 119 [] greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | greater(sk5(X),X) | -in_environment(sk4,X).
% 120 [] -greater(growth_rate(efficient_producers,sk5(X)),growth_rate(first_movers,sk5(X))) | greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | -in_environment(sk4,X).
% 121 [hyper:114,116,cut:117] in_environment(sk4,sk3(sk4)).
% 136 [hyper:105,121,cut:116] subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4)) | in_environment(sk4,sk2(sk4)).
% 137 [hyper:106,121,cut:116] greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4)) | in_environment(sk4,sk2(sk4)).
% 148 [hyper:115,137,cut:117,cut:116,binarycut:136] greater(growth_rate(efficient_producers,sk1(sk3(sk4),sk4)),growth_rate(first_movers,sk1(sk3(sk4),sk4))) | in_environment(sk4,sk2(sk4)).
% 189 [hyper:111,148,cut:121,cut:116] in_environment(sk4,sk2(sk4)).
% 193 [hyper:118,189] greater(growth_rate(efficient_producers,sk2(sk4)),growth_rate(first_movers,sk2(sk4))) | subpopulations(first_movers,efficient_producers,sk4,sk5(sk2(sk4))).
% 194 [hyper:119,189] greater(growth_rate(efficient_producers,sk2(sk4)),growth_rate(first_movers,sk2(sk4))) | greater(sk5(sk2(sk4)),sk2(sk4)).
% 205 [hyper:107,194,121,cut:116] subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4)) | greater(sk5(sk2(sk4)),sk2(sk4)).
% 209 [hyper:109,194,121,cut:116] greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4)) | greater(sk5(sk2(sk4)),sk2(sk4)).
% 220 [hyper:115,209,cut:117,cut:116,binarycut:205] greater(growth_rate(efficient_producers,sk1(sk3(sk4),sk4)),growth_rate(first_movers,sk1(sk3(sk4),sk4))) | greater(sk5(sk2(sk4)),sk2(sk4)).
% 235 [hyper:107,193,121,cut:116] subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4)) | subpopulations(first_movers,efficient_producers,sk4,sk5(sk2(sk4))).
% 351 [hyper:108,235,205,121,cut:116] greater(growth_rate(efficient_producers,sk5(sk2(sk4))),growth_rate(first_movers,sk5(sk2(sk4)))) | subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4)).
% 366 [?] ?
% 372 [hyper:109,121,cut:116,binarycut:366] greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4)).
% 383 [hyper:112,220,cut:121,cut:116,binarycut:194] greater(sk5(sk2(sk4)),sk2(sk4)).
% 414 [hyper:120,351,cut:189] greater(growth_rate(efficient_producers,sk2(sk4)),growth_rate(first_movers,sk2(sk4))) | subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4)).
% 418 [hyper:107,414,121,cut:116] subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4)).
% 419 [hyper:115,418,cut:372,cut:117,cut:116] greater(growth_rate(efficient_producers,sk1(sk3(sk4),sk4)),growth_rate(first_movers,sk1(sk3(sk4),sk4))).
% 421 [hyper:112,419,193,cut:121,cut:116] subpopulations(first_movers,efficient_producers,sk4,sk5(sk2(sk4))).
% 423 [hyper:113,419,383,cut:121,cut:116,cut:421] greater(growth_rate(efficient_producers,sk5(sk2(sk4))),growth_rate(first_movers,sk5(sk2(sk4)))).
% 427 [hyper:120,423,cut:189] greater(growth_rate(efficient_producers,sk2(sk4)),growth_rate(first_movers,sk2(sk4))).
% 432 [hyper:112,427,419,cut:116,cut:121] 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 11
% clause depth limited to 4
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 76
% derived clauses: 848
% kept clauses: 72
% kept size sum: 1243
% kept mid-nuclei: 237
% kept new demods: 0
% forw unit-subs: 56
% forw double-subs: 193
% forw overdouble-subs: 127
% backward subs: 30
% fast unit cutoff: 255
% full unit cutoff: 0
% dbl unit cutoff: 13
% real runtime : 0.3
% process. runtime: 0.3
% specific non-discr-tree subsumption statistics:
% tried: 1119
% length fails: 24
% strength fails: 32
% predlist fails: 735
% aux str. fails: 5
% by-lit fails: 152
% full subs tried: 0
% full subs fail: 0
%
% ; 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/MGT030-1+noeq.in")
%
%------------------------------------------------------------------------------