TSTP Solution File: MGT023-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT023-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 : art01.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/MGT023-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 11)
% (binary-unit 9 #f 3 11)
% (binary-double 9 #f 3 11)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 11)
% (binary-order 25 #f 3 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(18,40,2,36,0,2,111,50,2,129,0,2,500,50,5,518,0,5,889,50,8,907,0,8,1278,50,11,1296,0,11,1667,50,15,1685,0,15,2056,50,17,2074,0,18,2445,50,20,2463,0,20,2834,50,22,2852,0,22,3223,50,24,3241,0,24,3612,50,26,3630,0,26,4001,50,28,4019,0,28,4390,50,31,4408,0,31,4779,50,33,4797,0,33,5168,50,35,5186,0,35,5557,50,38,5575,0,38,5946,50,40,5964,0,40,6335,50,43,6353,0,43,6724,50,45,6742,0,45,7113,50,48,7113,40,48,7131,0,48,7193,50,48,7211,0,48,7282,50,48,7300,0,48,7371,50,49,7389,0,49,7460,50,49,7478,0,49,7549,50,49,7567,0,49,7638,50,50,7656,0,50,7727,50,50,7745,0,50,7816,50,50,7834,0,50,7905,50,51,7923,0,51,7994,50,51,8012,0,51,8083,50,52,8101,0,52,8172,50,52,8190,0,52,8261,50,52,8279,0,52,8350,50,53,8368,0,53,8439,50,53,8457,0,53,8528,50,54,8546,0,54,8617,50,54,8635,0,54,8706,50,55,8724,0,55,8795,50,55,8795,40,55,8813,0,55,8981,50,57,8999,0,57)
%
%
% START OF PROOF
% 8983 [] subpopulations(first_movers,efficient_producers,X,sk1(Y,X)) | in_environment(X,sk2(X)) | -in_environment(X,Y) | -environment(X).
% 8984 [] greater_or_equal(sk1(X,Y),X) | in_environment(Y,sk2(Y)) | -in_environment(Y,X) | -environment(Y).
% 8985 [] -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).
% 8986 [] 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).
% 8987 [] -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).
% 8988 [] greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | greater_or_equal(sk1(Y,Z),Y) | -greater(X,sk2(Z)) | -subpopulations(first_movers,efficient_producers,Z,X) | -in_environment(Z,Y) | -environment(Z).
% 8989 [] -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).
% 8990 [] -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).
% 8991 [] -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).
% 8992 [] greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | subpopulations(first_movers,efficient_producers,Y,sk3(X,Y)) | equal(X,critical_point(Y)) | -in_environment(Y,X) | -environment(Y).
% 8993 [] greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | greater(sk3(X,Y),X) | equal(X,critical_point(Y)) | -in_environment(Y,X) | -environment(Y).
% 8994 [] -greater(growth_rate(efficient_producers,sk3(X,Y)),growth_rate(first_movers,sk3(X,Y))) | greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | equal(X,critical_point(Y)) | -in_environment(Y,X) | -environment(Y).
% 8995 [] in_environment(X,sk4(X)) | -stable(X) | -environment(X).
% 8996 [] greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | -greater_or_equal(X,sk4(Y)) | -subpopulations(first_movers,efficient_producers,Y,X) | -stable(Y) | -environment(Y).
% 8997 [] environment(sk5).
% 8998 [] stable(sk5).
% 8999 [] -in_environment(sk5,critical_point(sk5)).
% 9001 [binary:8997,8995.3,cut:8998] in_environment(sk5,sk4(sk5)).
% 9004 [para:8992.3.2,8999.1.2,cut:8997] subpopulations(first_movers,efficient_producers,sk5,sk3(X,sk5)) | greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | -in_environment(sk5,X).
% 9008 [binary:9001,8984.3,cut:8997] greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)) | in_environment(sk5,sk2(sk5)).
% 9017 [para:8993.3.2,8999.1.2,cut:8997] greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | greater(sk3(X,sk5),X) | -in_environment(sk5,X).
% 9025 [binary:9001,8983.3,cut:8997] subpopulations(first_movers,efficient_producers,sk5,sk1(sk4(sk5),sk5)) | in_environment(sk5,sk2(sk5)).
% 9035 [para:8994.3.2,8999.1.2,cut:8997] -greater(growth_rate(efficient_producers,sk3(X,sk5)),growth_rate(first_movers,sk3(X,sk5))) | greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | -in_environment(sk5,X).
% 9042 [binary:9001,8987.3,cut:8997] -greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)).
% 9046 [binary:9004.2,9042] subpopulations(first_movers,efficient_producers,sk5,sk3(sk2(sk5),sk5)) | greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)) | -in_environment(sk5,sk2(sk5)).
% 9048 [binary:9017,9042] greater(sk3(sk2(sk5),sk5),sk2(sk5)) | greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)) | -in_environment(sk5,sk2(sk5)).
% 9052 [binary:9008.2,9048.3] greater(sk3(sk2(sk5),sk5),sk2(sk5)) | greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)).
% 9054 [binary:8997,8996.5,cut:8998] greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | -greater_or_equal(X,sk4(sk5)) | -subpopulations(first_movers,efficient_producers,sk5,X).
% 9056 [binary:9008,8996.2,cut:8998,cut:8997,binarycut:9025] greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | in_environment(sk5,sk2(sk5)).
% 9074 [binary:9001,8985.3,cut:8997] -greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | subpopulations(first_movers,efficient_producers,sk5,sk1(sk4(sk5),sk5)).
% 9080 [binary:9017,9074] subpopulations(first_movers,efficient_producers,sk5,sk1(sk4(sk5),sk5)) | greater(sk3(sk2(sk5),sk5),sk2(sk5)) | -in_environment(sk5,sk2(sk5)).
% 9087 [binary:9008.2,9046.3] subpopulations(first_movers,efficient_producers,sk5,sk3(sk2(sk5),sk5)) | greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)).
% 9092 [binary:9025.2,9080.3] subpopulations(first_movers,efficient_producers,sk5,sk1(sk4(sk5),sk5)) | greater(sk3(sk2(sk5),sk5),sk2(sk5)).
% 9120 [binary:9052,8988.3,cut:8997,binarycut:9087,factor:cut:9001] greater(growth_rate(efficient_producers,sk3(sk2(sk5),sk5)),growth_rate(first_movers,sk3(sk2(sk5),sk5))) | greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)).
% 9129 [binary:9001,8989.3,cut:8997,binarycut:9056] in_environment(sk5,sk2(sk5)).
% 9133 [binary:9017.3,9129] greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | greater(sk3(sk2(sk5),sk5),sk2(sk5)).
% 9162 [binary:9001,8990.3,cut:8997] -greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | -greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))).
% 9164 [binary:9133,8990.2,cut:8997] greater(sk3(sk2(sk5),sk5),sk2(sk5)) | -greater(growth_rate(efficient_producers,sk1(X,sk5)),growth_rate(first_movers,sk1(X,sk5))) | -in_environment(sk5,X).
% 9247 [binary:8994,9120,cut:9129,cut:8997,binarycut:9042] greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)) | equal(sk2(sk5),critical_point(sk5)).
% 9250 [para:9247.2.2,8999.1.2,cut:9129] greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)).
% 9252 [binary:8996.2,9250,cut:8998,cut:8997] greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | -subpopulations(first_movers,efficient_producers,sk5,sk1(sk4(sk5),sk5)).
% 9277 [binary:9001,9164.3] -greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | greater(sk3(sk2(sk5),sk5),sk2(sk5)).
% 9286 [binary:9054,9277,cut:9250,binarycut:9092] greater(sk3(sk2(sk5),sk5),sk2(sk5)).
% 9296 [binary:8985.2,9252.2,cut:9001,cut:8997,binarycut:9162] -greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))).
% 9305 [binary:9004.2,9296,cut:9129] subpopulations(first_movers,efficient_producers,sk5,sk3(sk2(sk5),sk5)).
% 9313 [binary:9035.2,9296,cut:9129] -greater(growth_rate(efficient_producers,sk3(sk2(sk5),sk5)),growth_rate(first_movers,sk3(sk2(sk5),sk5))).
% 9315 [binary:8986.4,9305,cut:9286,cut:9313,cut:8997] subpopulations(first_movers,efficient_producers,sk5,sk1(X,sk5)) | -in_environment(sk5,X).
% 9317 [binary:8991.4,9305,cut:9286,cut:9313,cut:8997] -greater(growth_rate(efficient_producers,sk1(X,sk5)),growth_rate(first_movers,sk1(X,sk5))) | -in_environment(sk5,X).
% 9327 [binary:9252.2,9315,cut:9001,binarydemod:9317,cut:9001] 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 4
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1970
% derived clauses: 16615
% kept clauses: 1986
% kept size sum: 43200
% kept mid-nuclei: 4550
% kept new demods: 18
% forw unit-subs: 467
% forw double-subs: 1547
% forw overdouble-subs: 6418
% backward subs: 1153
% fast unit cutoff: 5876
% full unit cutoff: 0
% dbl unit cutoff: 323
% real runtime : 0.58
% process. runtime: 0.57
% specific non-discr-tree subsumption statistics:
% tried: 29900
% length fails: 214
% strength fails: 1802
% predlist fails: 17571
% aux str. fails: 242
% by-lit fails: 3044
% full subs tried: 234
% full subs fail: 34
%
% ; 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/MGT023-2+eq_r.in")
%
%------------------------------------------------------------------------------