TSTP Solution File: MGT035-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT035-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 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/MGT035-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(26,40,1,52,0,1,183,50,3,209,0,3,816,50,11,842,0,11,5609,50,141,5635,0,141,10402,50,262,10428,0,262,15195,50,385,15221,0,385,19988,50,510,20014,0,510,24781,50,636,24807,0,636,29574,50,763,29600,0,764,34367,50,893,34393,0,893,39160,50,1024,39186,0,1024,43953,50,1156,43979,0,1156,48746,50,1290,48746,40,1290,48772,0,1290,48843,50,1291,48869,0,1291,49030,50,1291,49056,0,1291,49293,50,1293,49319,0,1293,49556,50,1294,49582,0,1294,49819,50,1295,49845,0,1295,50082,50,1296,50108,0,1296,50345,50,1298,50371,0,1298,50608,50,1299,50634,0,1299,50871,50,1300,50897,0,1301,51134,50,1302,51160,0,1302,51397,50,1304,51423,0,1304,51660,50,1305,51686,0,1305,51923,50,1307,51949,0,1307,52186,50,1308,52212,0,1308,52449,50,1310,52475,0,1310,52712,50,1311,52738,0,1311,52975,50,1313,53001,0,1313,53238,50,1314,53264,0,1315,53501,50,1316,53527,0,1316,53764,50,1318,53764,40,1318,53790,0,1318,54717,50,1338,54743,0,1338,62125,3,1739,63328,4,1939,64249,50,2093,64249,40,2093,64275,0,2093)
%
%
% START OF PROOF
% 56349 [?] ?
% 64251 [] -greater(Y,Z) | -greater(X,Y) | greater(X,Z).
% 64252 [] -in_environment(X,Y) | -in_environment(X,Z) | greater(Y,Z) | greater(Z,Y) | equal(Z,Y).
% 64253 [] -greater_or_equal(X,Y) | greater(X,Y) | equal(X,Y).
% 64254 [] -greater(X,Y) | greater_or_equal(X,Y).
% 64255 [] -equal(X,Y) | greater_or_equal(X,Y).
% 64256 [] -greater_or_equal(growth_rate(X,Y),zero) | -greater(zero,growth_rate(Z,Y)) | -subpopulations(Z,X,U,Y) | outcompetes(X,Z,Y) | -environment(U).
% 64259 [] greater(growth_rate(first_movers,X),zero) | greater(growth_rate(efficient_producers,X),zero) | equal(growth_rate(first_movers,X),zero) | -greater_or_equal(X,equilibrium(Y)) | -subpopulations(first_movers,efficient_producers,Y,X) | -environment(Y).
% 64260 [] greater(growth_rate(first_movers,X),zero) | greater(zero,growth_rate(first_movers,X)) | equal(growth_rate(first_movers,X),zero) | -greater_or_equal(X,equilibrium(Y)) | -subpopulations(first_movers,efficient_producers,Y,X) | -environment(Y).
% 64262 [] greater(zero,growth_rate(efficient_producers,X)) | greater(zero,growth_rate(first_movers,X)) | equal(growth_rate(first_movers,X),zero) | -greater_or_equal(X,equilibrium(Y)) | -subpopulations(first_movers,efficient_producers,Y,X) | -environment(Y).
% 64264 [] greater(growth_rate(first_movers,X),zero) | greater(zero,growth_rate(first_movers,X)) | equal(growth_rate(efficient_producers,X),zero) | -greater_or_equal(X,equilibrium(Y)) | -subpopulations(first_movers,efficient_producers,Y,X) | -environment(Y).
% 64266 [] greater(zero,growth_rate(efficient_producers,X)) | greater(zero,growth_rate(first_movers,X)) | equal(growth_rate(efficient_producers,X),zero) | -greater_or_equal(X,equilibrium(Y)) | -subpopulations(first_movers,efficient_producers,Y,X) | -environment(Y).
% 64267 [] in_environment(X,sk1(X)) | -stable(X) | -environment(X).
% 64268 [] greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | -greater_or_equal(X,sk1(Y)) | -subpopulations(first_movers,efficient_producers,Y,X) | -stable(Y) | -environment(Y).
% 64269 [] in_environment(X,sk2(X)) | -stable(X) | -environment(X).
% 64270 [] greater_or_equal(sk2(X),equilibrium(X)) | -stable(X) | -environment(X).
% 64271 [] environment(sk3).
% 64272 [] stable(sk3).
% 64273 [] subpopulations(first_movers,efficient_producers,sk3,sk4(X)) | -in_environment(sk3,X).
% 64274 [] greater_or_equal(sk4(X),X) | -in_environment(sk3,X).
% 64275 [] -outcompetes(efficient_producers,first_movers,sk4(X)) | -in_environment(sk3,X).
% 64281 [binary:64254.2,64256] -greater(growth_rate(X,Y),zero) | -greater(zero,growth_rate(Z,Y)) | -subpopulations(Z,X,U,Y) | outcompetes(X,Z,Y) | -environment(U).
% 64285 [binary:64271,64267.3,cut:64272] in_environment(sk3,sk1(sk3)).
% 64286 [binary:64274.2,64267,cut:64272,cut:64271] greater_or_equal(sk4(sk1(sk3)),sk1(sk3)).
% 64290 [binary:64271,64269.3,cut:64272] in_environment(sk3,sk2(sk3)).
% 64291 [binary:64274.2,64269,cut:64272,cut:64271] greater_or_equal(sk4(sk2(sk3)),sk2(sk3)).
% 64294 [binary:64267,64275.2,cut:64272,cut:64271] -outcompetes(efficient_producers,first_movers,sk4(sk1(sk3))).
% 64295 [binary:64269,64275.2,cut:64272,cut:64271] -outcompetes(efficient_producers,first_movers,sk4(sk2(sk3))).
% 64302 [binary:64271,64270.3,cut:64272] greater_or_equal(sk2(sk3),equilibrium(sk3)).
% 64305 [binary:64256.3,64273,cut:64271,binarycut:64275] -greater_or_equal(growth_rate(efficient_producers,sk4(X)),zero) | -greater(zero,growth_rate(first_movers,sk4(X))) | -in_environment(sk3,X).
% 64306 [binary:64267,64273.2,cut:64272,cut:64271] subpopulations(first_movers,efficient_producers,sk3,sk4(sk1(sk3))).
% 64307 [binary:64269,64273.2,cut:64272,cut:64271] subpopulations(first_movers,efficient_producers,sk3,sk4(sk2(sk3))).
% 64308 [binary:64256.3,64306,cut:64294,cut:64271] -greater_or_equal(growth_rate(efficient_producers,sk4(sk1(sk3))),zero) | -greater(zero,growth_rate(first_movers,sk4(sk1(sk3)))).
% 64310 [binary:64271,64259.6] greater(growth_rate(efficient_producers,X),zero) | greater(growth_rate(first_movers,X),zero) | equal(growth_rate(first_movers,X),zero) | -greater_or_equal(X,equilibrium(sk3)) | -subpopulations(first_movers,efficient_producers,sk3,X).
% 64322 [binary:64259.5,64307,cut:56349,cut:64271] greater(growth_rate(efficient_producers,sk4(sk2(sk3))),zero) | greater(growth_rate(first_movers,sk4(sk2(sk3))),zero) | equal(growth_rate(first_movers,sk4(sk2(sk3))),zero).
% 64324 [binary:64254,64251.3] -greater(Y,Z) | -greater(X,Y) | greater_or_equal(X,Z).
% 64326 [binary:64274,64253] greater(sk4(X),X) | equal(sk4(X),X) | -in_environment(sk3,X).
% 64329 [binary:64302,64253] greater(sk2(sk3),equilibrium(sk3)) | equal(sk2(sk3),equilibrium(sk3)).
% 64334 [para:64329.2.1,64291.1.2] greater_or_equal(sk4(sk2(sk3)),equilibrium(sk3)) | greater(sk2(sk3),equilibrium(sk3)).
% 64337 [binary:64251,64329] equal(sk2(sk3),equilibrium(sk3)) | -greater(X,sk2(sk3)) | greater(X,equilibrium(sk3)).
% 64342 [binary:64271,64260.6] greater(zero,growth_rate(first_movers,X)) | greater(growth_rate(first_movers,X),zero) | equal(growth_rate(first_movers,X),zero) | -greater_or_equal(X,equilibrium(sk3)) | -subpopulations(first_movers,efficient_producers,sk3,X).
% 64382 [binary:64324,64334.2,factor] -greater(sk4(sk2(sk3)),sk2(sk3)) | greater_or_equal(sk4(sk2(sk3)),equilibrium(sk3)).
% 64423 [binary:64271,64262.6] greater(zero,growth_rate(first_movers,X)) | greater(zero,growth_rate(efficient_producers,X)) | equal(growth_rate(first_movers,X),zero) | -greater_or_equal(X,equilibrium(sk3)) | -subpopulations(first_movers,efficient_producers,sk3,X).
% 64431 [binary:64273,64262.5,cut:64271] greater(zero,growth_rate(efficient_producers,sk4(X))) | greater(zero,growth_rate(first_movers,sk4(X))) | equal(growth_rate(first_movers,sk4(X)),zero) | -greater_or_equal(sk4(X),equilibrium(sk3)) | -in_environment(sk3,X).
% 64485 [binary:64271,64264.6] greater(zero,growth_rate(first_movers,X)) | greater(growth_rate(first_movers,X),zero) | equal(growth_rate(efficient_producers,X),zero) | -greater_or_equal(X,equilibrium(sk3)) | -subpopulations(first_movers,efficient_producers,sk3,X).
% 64504 [binary:64253.2,64382,cut:64291] greater_or_equal(sk4(sk2(sk3)),equilibrium(sk3)) | equal(sk4(sk2(sk3)),sk2(sk3)).
% 64611 [binary:64271,64266.6] greater(zero,growth_rate(first_movers,X)) | greater(zero,growth_rate(efficient_producers,X)) | equal(growth_rate(efficient_producers,X),zero) | -greater_or_equal(X,equilibrium(sk3)) | -subpopulations(first_movers,efficient_producers,sk3,X).
% 64703 [binary:64271,64268.5,cut:64272] greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | -greater_or_equal(X,sk1(sk3)) | -subpopulations(first_movers,efficient_producers,sk3,X).
% 64709 [binary:64286,64268.2,cut:64306,cut:64272,cut:64271] greater(growth_rate(efficient_producers,sk4(sk1(sk3))),growth_rate(first_movers,sk4(sk1(sk3)))).
% 64718 [binary:64251,64709] -greater(X,growth_rate(efficient_producers,sk4(sk1(sk3)))) | greater(X,growth_rate(first_movers,sk4(sk1(sk3)))).
% 64719 [binary:64251.2,64709] -greater(growth_rate(first_movers,sk4(sk1(sk3))),X) | greater(growth_rate(efficient_producers,sk4(sk1(sk3))),X).
% 64782 [binary:64254,64252.4,binarycut:64255] -in_environment(X,Y) | -in_environment(X,Z) | greater_or_equal(Z,Y) | greater(Y,Z).
% 64796 [binary:64285,64782] greater_or_equal(X,sk1(sk3)) | greater(sk1(sk3),X) | -in_environment(sk3,X).
% 64812 [binary:64290,64796.3] greater_or_equal(sk2(sk3),sk1(sk3)) | greater(sk1(sk3),sk2(sk3)).
% 64827 [para:64337.1.1,64812.2.2,factor] -greater(sk1(sk3),sk2(sk3)) | greater_or_equal(sk2(sk3),sk1(sk3)) | greater(sk1(sk3),equilibrium(sk3)).
% 64870 [binary:64307,64281.3,cut:64295,cut:64271] -greater(zero,growth_rate(first_movers,sk4(sk2(sk3)))) | -greater(growth_rate(efficient_producers,sk4(sk2(sk3))),zero).
% 65173 [para:64310.3.1,64709.1.2,cut:64306,binarycut:64719] greater(growth_rate(efficient_producers,sk4(sk1(sk3))),zero) | -greater_or_equal(sk4(sk1(sk3)),equilibrium(sk3)).
% 65176 [binary:64254,65173] greater_or_equal(growth_rate(efficient_producers,sk4(sk1(sk3))),zero) | -greater_or_equal(sk4(sk1(sk3)),equilibrium(sk3)).
% 65211 [binary:64305,65176,cut:64285] -greater(zero,growth_rate(first_movers,sk4(sk1(sk3)))) | -greater_or_equal(sk4(sk1(sk3)),equilibrium(sk3)).
% 65290 [binary:64718.2,65211] -greater(zero,growth_rate(efficient_producers,sk4(sk1(sk3)))) | -greater_or_equal(sk4(sk1(sk3)),equilibrium(sk3)).
% 65923 [binary:64254,64322.2,binarycut:64255] greater_or_equal(growth_rate(first_movers,sk4(sk2(sk3))),zero) | greater(growth_rate(efficient_producers,sk4(sk2(sk3))),zero).
% 65965 [binary:64870.2,65923.2] -greater(zero,growth_rate(first_movers,sk4(sk2(sk3)))) | greater_or_equal(growth_rate(first_movers,sk4(sk2(sk3))),zero).
% 66071 [binary:65965,64342,cut:64307,binarycut:64254,binarycut:64255] greater_or_equal(growth_rate(first_movers,sk4(sk2(sk3))),zero) | -greater_or_equal(sk4(sk2(sk3)),equilibrium(sk3)).
% 66083 [para:64326.2.1,66071.2.1,cut:64302,cut:64290] greater_or_equal(growth_rate(first_movers,sk4(sk2(sk3))),zero) | greater(sk4(sk2(sk3)),sk2(sk3)).
% 66085 [binary:64382.2,66071.2] greater_or_equal(growth_rate(first_movers,sk4(sk2(sk3))),zero) | -greater(sk4(sk2(sk3)),sk2(sk3)).
% 66347 [binary:66083.2,66085.2] greater_or_equal(growth_rate(first_movers,sk4(sk2(sk3))),zero).
% 66349 [binary:64253,66347] greater(growth_rate(first_movers,sk4(sk2(sk3))),zero) | equal(growth_rate(first_movers,sk4(sk2(sk3))),zero).
% 67025 [binary:64812.2,64827] greater_or_equal(sk2(sk3),sk1(sk3)) | greater(sk1(sk3),equilibrium(sk3)).
% 67030 [binary:64253,67025] greater(sk2(sk3),sk1(sk3)) | greater(sk1(sk3),equilibrium(sk3)) | equal(sk2(sk3),sk1(sk3)).
% 67184 [para:67030.3.1,64302.1.1,binarycut:64254] greater_or_equal(sk1(sk3),equilibrium(sk3)) | greater(sk2(sk3),sk1(sk3)).
% 67251 [binary:64253,67184] greater(sk1(sk3),equilibrium(sk3)) | greater(sk2(sk3),sk1(sk3)) | equal(sk1(sk3),equilibrium(sk3)).
% 67338 [para:67251.3.1,64286.1.2] greater_or_equal(sk4(sk1(sk3)),equilibrium(sk3)) | greater(sk2(sk3),sk1(sk3)) | greater(sk1(sk3),equilibrium(sk3)).
% 67624 [para:64423.3.1,64308.2.2,cut:64306,binarycut:65176,binarycut:65211,binarycut:65290] -greater_or_equal(sk4(sk1(sk3)),equilibrium(sk3)) | -greater(zero,zero).
% 68646 [para:64485.3.1,64709.1.1,cut:64306,binarycut:65211] greater(growth_rate(first_movers,sk4(sk1(sk3))),zero) | -greater_or_equal(sk4(sk1(sk3)),equilibrium(sk3)).
% 68702 [para:64423.3.1,68646.1.1,cut:64306,binarycut:65211,binarycut:65290] -greater_or_equal(sk4(sk1(sk3)),equilibrium(sk3)) | greater(zero,zero).
% 68741 [binary:67624.2,68702.2] -greater_or_equal(sk4(sk1(sk3)),equilibrium(sk3)).
% 68776 [binary:64254.2,68741] -greater(sk4(sk1(sk3)),equilibrium(sk3)).
% 68778 [binary:64324.3,68741] -greater(sk4(sk1(sk3)),X) | -greater(X,equilibrium(sk3)).
% 68814 [para:64326.2.1,68776.1.1,cut:64285,binarycut:68778] -greater(sk1(sk3),equilibrium(sk3)).
% 68852 [binary:67025.2,68814] greater_or_equal(sk2(sk3),sk1(sk3)).
% 69100 [binary:67338,68741,cut:68814] greater(sk2(sk3),sk1(sk3)).
% 69101 [binary:64251,69100] -greater(X,sk2(sk3)) | greater(X,sk1(sk3)).
% 69120 [binary:64253.2,69101] -greater_or_equal(X,sk2(sk3)) | greater(X,sk1(sk3)) | equal(X,sk2(sk3)).
% 71180 [para:69120.3.2,68852.1.1,binarycut:64254] -greater_or_equal(X,sk2(sk3)) | greater_or_equal(X,sk1(sk3)).
% 71186 [binary:64274,71180,cut:64290] greater_or_equal(sk4(sk2(sk3)),sk1(sk3)).
% 71205 [binary:64268.2,71186,cut:64307,cut:64272,cut:64271] greater(growth_rate(efficient_producers,sk4(sk2(sk3))),growth_rate(first_movers,sk4(sk2(sk3)))).
% 71504 [binary:64251.2,71205] -greater(growth_rate(first_movers,sk4(sk2(sk3))),X) | greater(growth_rate(efficient_producers,sk4(sk2(sk3))),X).
% 71542 [para:66349.2.1,71205.1.2,binarycut:71504] greater(growth_rate(efficient_producers,sk4(sk2(sk3))),zero).
% 71599 [binary:64870.2,71542] -greater(zero,growth_rate(first_movers,sk4(sk2(sk3)))).
% 71671 [binary:64251.3,71599] -greater(X,growth_rate(first_movers,sk4(sk2(sk3)))) | -greater(zero,X).
% 72389 [binary:64703,71671,cut:71186,cut:64307] -greater(zero,growth_rate(efficient_producers,sk4(sk2(sk3)))).
% 72392 [para:64423.3.1,71671.1.2,cut:72389,cut:71599,cut:64307,factor] -greater_or_equal(sk4(sk2(sk3)),equilibrium(sk3)) | -greater(zero,zero).
% 72447 [?] ?
% 72554 [para:64326.2.1,72392.1.1,cut:64302,cut:64290,binarycut:72447] -greater(zero,zero).
% 74987 [binary:64262.4,64504,cut:64307,cut:64271,cut:71599,cut:72389] equal(growth_rate(first_movers,sk4(sk2(sk3))),zero) | equal(sk4(sk2(sk3)),sk2(sk3)).
% 75008 [para:64431.2.1,74987.4.1,cut:64302,cut:71599,cut:72389,cut:64290] equal(growth_rate(first_movers,sk4(sk2(sk3))),zero).
% 76570 [para:64611.3.1,71205.1.1,demod:75008,cut:72389,cut:72554,cut:64307] -greater_or_equal(sk4(sk2(sk3)),equilibrium(sk3)).
% 76588 [para:64326.2.1,76570.1.1,cut:64302,cut:64290] greater(sk4(sk2(sk3)),sk2(sk3)).
% 76590 [binary:64382.2,76570,cut:76588] 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
% seconds given: 15
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 12258
% derived clauses: 415615
% kept clauses: 35154
% kept size sum: 0
% kept mid-nuclei: 27760
% kept new demods: 1
% forw unit-subs: 53003
% forw double-subs: 74930
% forw overdouble-subs: 211302
% backward subs: 15163
% fast unit cutoff: 17965
% full unit cutoff: 0
% dbl unit cutoff: 674
% real runtime : 23.99
% process. runtime: 23.99
% specific non-discr-tree subsumption statistics:
% tried: 5522404
% length fails: 84000
% strength fails: 400968
% predlist fails: 2281855
% aux str. fails: 1723
% by-lit fails: 2227525
% full subs tried: 98338
% full subs fail: 79535
%
% ; 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/MGT035-1+eq_r.in")
%
%------------------------------------------------------------------------------