TSTP Solution File: MGT034-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT034-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 : art10.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/MGT034-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 3 13)
% (binary-unit 9 #f 3 13)
% (binary-double 9 #f 3 13)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 13)
% (binary-order 25 #f 3 13)
% (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(31,40,0,62,0,0,528,50,3,559,0,3)
%
%
% START OF PROOF
% 529 [] equal(X,X).
% 530 [] -greater(growth_rate(X,Y),growth_rate(Z,Y)) | -subpopulations(Z,X,U,Y) | selection_favors(X,Z,Y) | -environment(U).
% 531 [] -decreases(difference(disbanding_rate(first_movers,X),disbanding_rate(efficient_producers,X))) | -subpopulations(first_movers,efficient_producers,Y,X) | -environment(Y).
% 532 [] subpopulations(first_movers,efficient_producers,X,critical_point(X)) | -in_environment(X,critical_point(X)) | -environment(X).
% 533 [] subpopulations(first_movers,efficient_producers,X,appear(efficient_producers,X)) | -in_environment(X,appear(efficient_producers,X)) | -environment(X).
% 534 [] -decreases(difference(founding_rate(first_movers,X),founding_rate(efficient_producers,X))) | decreases(difference(disbanding_rate(first_movers,X),disbanding_rate(efficient_producers,X))) | decreases(difference(growth_rate(first_movers,X),growth_rate(efficient_producers,X))).
% 535 [] -greater_or_equal(difference(growth_rate(first_movers,X),growth_rate(efficient_producers,X)),zero) | greater(difference(growth_rate(first_movers,Y),growth_rate(efficient_producers,Y)),zero) | -decreases(difference(growth_rate(first_movers,Y),growth_rate(efficient_producers,Y))) | -greater_or_equal(Y,appear(efficient_producers,Z)) | -in_environment(Z,X) | -greater(X,Y) | -environment(Z).
% 536 [] -greater(zero,difference(growth_rate(first_movers,X),growth_rate(efficient_producers,X))) | greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)).
% 538 [] -greater(difference(growth_rate(first_movers,X),growth_rate(efficient_producers,X)),zero) | greater(growth_rate(first_movers,X),growth_rate(efficient_producers,X)).
% 543 [] -greater_or_equal(X,appear(efficient_producers,Y)) | -in_environment(Y,critical_point(Y)) | -greater(critical_point(Y),X) | in_environment(Y,X) | -environment(Y).
% 545 [] -subpopulations(first_movers,efficient_producers,X,Y) | subpopulations(efficient_producers,first_movers,X,Y) | -environment(X).
% 546 [] greater_or_equal(X,appear(efficient_producers,Y)) | -subpopulations(first_movers,efficient_producers,Y,X) | -environment(Y).
% 547 [] -greater_or_equal(X,Y) | greater(X,Y) | equal(X,Y).
% 548 [] -greater(X,Y) | greater_or_equal(X,Y).
% 549 [] -equal(X,Y) | greater_or_equal(X,Y).
% 550 [] greater_or_equal(difference(growth_rate(first_movers,X),growth_rate(efficient_producers,X)),zero) | greater(zero,difference(growth_rate(first_movers,X),growth_rate(efficient_producers,X))) | -subpopulations(first_movers,efficient_producers,Y,X) | -environment(Y).
% 551 [] -greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | -equal(X,critical_point(Y)) | -environment(Y).
% 553 [] -subpopulations(first_movers,efficient_producers,X,Z) | -subpopulations(first_movers,efficient_producers,X,Y) | subpopulations(first_movers,efficient_producers,X,U) | -greater_or_equal(Y,U) | -greater_or_equal(U,Z) | -environment(X).
% 554 [] decreases(difference(founding_rate(first_movers,X),founding_rate(efficient_producers,X))) | -subpopulations(first_movers,efficient_producers,Y,X) | -environment(Y).
% 555 [] environment(sk1).
% 556 [] in_environment(sk1,critical_point(sk1)).
% 557 [] greater_or_equal(sk2,appear(efficient_producers,sk1)).
% 558 [] greater(critical_point(sk1),sk2).
% 559 [] -selection_favors(first_movers,efficient_producers,sk2).
% 566 [hyper:532,555,cut:556] subpopulations(first_movers,efficient_producers,sk1,critical_point(sk1)).
% 579 [hyper:549,529] greater_or_equal(X,X).
% 590 [hyper:548,558] greater_or_equal(critical_point(sk1),sk2).
% 634 [hyper:546,566,cut:555] greater_or_equal(critical_point(sk1),appear(efficient_producers,sk1)).
% 635 [hyper:550,566,cut:555] greater_or_equal(difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))),zero) | greater(zero,difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1)))).
% 651 [hyper:547,634] greater(critical_point(sk1),appear(efficient_producers,sk1)) | equal(critical_point(sk1),appear(efficient_producers,sk1)).
% 676 [hyper:543,651,cut:556,cut:579,cut:555] equal(critical_point(sk1),appear(efficient_producers,sk1)) | in_environment(sk1,appear(efficient_producers,sk1)).
% 680 [hyper:533,676,cut:555] subpopulations(first_movers,efficient_producers,sk1,appear(efficient_producers,sk1)) | equal(critical_point(sk1),appear(efficient_producers,sk1)).
% 689 [hyper:553,680,590,cut:555,cut:566,cut:557] equal(critical_point(sk1),appear(efficient_producers,sk1)) | subpopulations(first_movers,efficient_producers,sk1,sk2).
% 713 [hyper:554,689,cut:555] decreases(difference(founding_rate(first_movers,sk2),founding_rate(efficient_producers,sk2))) | equal(critical_point(sk1),appear(efficient_producers,sk1)).
% 716 [hyper:545,689,cut:555] equal(critical_point(sk1),appear(efficient_producers,sk1)) | subpopulations(efficient_producers,first_movers,sk1,sk2).
% 739 [hyper:534,713] decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))) | decreases(difference(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2))) | equal(critical_point(sk1),appear(efficient_producers,sk1)).
% 817 [hyper:536,635] greater_or_equal(difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))),zero) | greater(growth_rate(efficient_producers,critical_point(sk1)),growth_rate(first_movers,critical_point(sk1))).
% 835 [hyper:551,817,529,cut:555] greater_or_equal(difference(growth_rate(first_movers,critical_point(sk1)),growth_rate(efficient_producers,critical_point(sk1))),zero).
% 923 [hyper:531,739,689,cut:555] decreases(difference(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2))) | equal(critical_point(sk1),appear(efficient_producers,sk1)).
% 936 [hyper:535,923,556,cut:558,cut:557,cut:835,cut:555] greater(difference(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2)),zero) | equal(critical_point(sk1),appear(efficient_producers,sk1)).
% 939 [hyper:538,936] greater(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2)) | equal(critical_point(sk1),appear(efficient_producers,sk1)).
% 962 [hyper:530,939,716,cut:555,cut:559] equal(critical_point(sk1),appear(efficient_producers,sk1)).
% 963 [para:962.1.2,557.1.2] greater_or_equal(sk2,critical_point(sk1)).
% 969 [hyper:553,963,566,cut:566,cut:590,cut:555] subpopulations(first_movers,efficient_producers,sk1,sk2).
% 998 [hyper:554,969,cut:555] decreases(difference(founding_rate(first_movers,sk2),founding_rate(efficient_producers,sk2))).
% 1001 [hyper:545,969,cut:555] subpopulations(efficient_producers,first_movers,sk1,sk2).
% 1021 [hyper:530,1001,939,cut:555,cut:559] equal(critical_point(sk1),appear(efficient_producers,sk1)).
% 1035 [hyper:534,998] decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))) | decreases(difference(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2))).
% 1038 [hyper:531,1035,969,cut:555] decreases(difference(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2))).
% 1048 [hyper:535,1038,556,demod:1021,cut:558,cut:963,cut:835,cut:555] greater(difference(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2)),zero).
% 1050 [hyper:538,1048] greater(growth_rate(first_movers,sk2),growth_rate(efficient_producers,sk2)).
% 1055 [hyper:530,1050,1001,cut:555] selection_favors(first_movers,efficient_producers,sk2).
% 1062 [hyper:559,1055] 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 13
% clause depth limited to 4
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 145
% derived clauses: 1900
% kept clauses: 108
% kept size sum: 1753
% kept mid-nuclei: 732
% kept new demods: 1
% forw unit-subs: 385
% forw double-subs: 145
% forw overdouble-subs: 170
% backward subs: 37
% fast unit cutoff: 344
% full unit cutoff: 0
% dbl unit cutoff: 23
% real runtime : 0.6
% process. runtime: 0.6
% specific non-discr-tree subsumption statistics:
% tried: 965
% length fails: 14
% strength fails: 90
% predlist fails: 567
% aux str. fails: 14
% by-lit fails: 35
% full subs tried: 64
% full subs fail: 64
%
% ; 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/MGT034-2+eq_r.in")
%
%------------------------------------------------------------------------------