TSTP Solution File: MGT036-2 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : MGT036-2 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n023.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sun Jul 17 22:16:33 EDT 2022

% Result   : Unsatisfiable 0.20s 0.37s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : MGT036-2 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34  % Computer : n023.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Thu Jun  9 08:54:53 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.37  % SZS status Unsatisfiable
% 0.20/0.37  % SZS output begin IncompleteProof
% 0.20/0.37  cnf(c0, axiom,
% 0.20/0.37  	outcompetes(first_movers,efficient_producers,sk2)).
% 0.20/0.37  cnf(c1, plain,
% 0.20/0.37  	outcompetes(first_movers,efficient_producers,sk2),
% 0.20/0.37  	inference(start, [], [c0])).
% 0.20/0.37  
% 0.20/0.37  cnf(c2, axiom,
% 0.20/0.37  	greater_or_equal(growth_rate(X0,X1),zero) | ~outcompetes(X0,X2,X1) | ~subpopulations(X2,X0,X3,X1) | ~environment(X3)).
% 0.20/0.37  cnf(a0, assumption,
% 0.20/0.37  	first_movers = X0).
% 0.20/0.37  cnf(a1, assumption,
% 0.20/0.37  	efficient_producers = X2).
% 0.20/0.37  cnf(a2, assumption,
% 0.20/0.37  	sk2 = X1).
% 0.20/0.37  cnf(c3, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.20/0.37  cnf(c4, plain,
% 0.20/0.37  	greater_or_equal(growth_rate(X0,X1),zero) | ~subpopulations(X2,X0,X3,X1) | ~environment(X3),
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.20/0.37  
% 0.20/0.37  cnf(c5, axiom,
% 0.20/0.37  	~greater(zero,growth_rate(X4,X5)) | ~greater_or_equal(growth_rate(X4,X5),zero)).
% 0.20/0.37  cnf(a3, assumption,
% 0.20/0.37  	growth_rate(X0,X1) = growth_rate(X4,X5)).
% 0.20/0.37  cnf(a4, assumption,
% 0.20/0.37  	zero = zero).
% 0.20/0.37  cnf(c6, plain,
% 0.20/0.37  	~subpopulations(X2,X0,X3,X1) | ~environment(X3),
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])).
% 0.20/0.37  cnf(c7, plain,
% 0.20/0.37  	~greater(zero,growth_rate(X4,X5)),
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])).
% 0.20/0.37  
% 0.20/0.37  cnf(c8, axiom,
% 0.20/0.37  	~greater(zero,growth_rate(X6,X7)) | ~greater(resilience(X6),resilience(X8)) | greater(zero,growth_rate(X8,X7)) | ~in_environment(X9,X7) | ~environment(X9)).
% 0.20/0.37  cnf(a5, assumption,
% 0.20/0.37  	zero = zero).
% 0.20/0.37  cnf(a6, assumption,
% 0.20/0.37  	growth_rate(X4,X5) = growth_rate(X8,X7)).
% 0.20/0.37  cnf(c9, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])).
% 0.20/0.37  cnf(c10, plain,
% 0.20/0.37  	~greater(zero,growth_rate(X6,X7)) | ~greater(resilience(X6),resilience(X8)) | ~in_environment(X9,X7) | ~environment(X9),
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])).
% 0.20/0.37  
% 0.20/0.37  cnf(c11, axiom,
% 0.20/0.37  	greater(zero,growth_rate(X10,X11)) | ~outcompetes(X12,X10,X11) | ~subpopulations(X10,X12,X13,X11) | ~environment(X13)).
% 0.20/0.37  cnf(a7, assumption,
% 0.20/0.37  	zero = zero).
% 0.20/0.37  cnf(a8, assumption,
% 0.20/0.37  	growth_rate(X6,X7) = growth_rate(X10,X11)).
% 0.20/0.37  cnf(c12, plain,
% 0.20/0.37  	~greater(resilience(X6),resilience(X8)) | ~in_environment(X9,X7) | ~environment(X9),
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])).
% 0.20/0.37  cnf(c13, plain,
% 0.20/0.37  	~outcompetes(X12,X10,X11) | ~subpopulations(X10,X12,X13,X11) | ~environment(X13),
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])).
% 0.20/0.37  
% 0.20/0.37  cnf(c14, plain,
% 0.20/0.37  	outcompetes(first_movers,efficient_producers,sk2)).
% 0.20/0.37  cnf(a9, assumption,
% 0.20/0.37  	X12 = first_movers).
% 0.20/0.37  cnf(a10, assumption,
% 0.20/0.37  	X10 = efficient_producers).
% 0.20/0.37  cnf(a11, assumption,
% 0.20/0.37  	X11 = sk2).
% 0.20/0.37  cnf(c15, plain,
% 0.20/0.37  	~subpopulations(X10,X12,X13,X11) | ~environment(X13),
% 0.20/0.37  	inference(predicate_reduction, [assumptions([a9, a10, a11])], [c13, c14])).
% 0.20/0.37  
% 0.20/0.37  cnf(c16, axiom,
% 0.20/0.37  	subpopulations(X14,X15,X16,X17) | ~subpopulations(X15,X14,X16,X17) | ~environment(X16)).
% 0.20/0.37  cnf(a12, assumption,
% 0.20/0.37  	X10 = X14).
% 0.20/0.37  cnf(a13, assumption,
% 0.20/0.37  	X12 = X15).
% 0.20/0.37  cnf(a14, assumption,
% 0.20/0.37  	X13 = X16).
% 0.20/0.37  cnf(a15, assumption,
% 0.20/0.37  	X11 = X17).
% 0.20/0.37  cnf(c17, plain,
% 0.20/0.37  	~environment(X13),
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a12, a13, a14, a15])], [c15, c16])).
% 0.20/0.37  cnf(c18, plain,
% 0.20/0.37  	~subpopulations(X15,X14,X16,X17) | ~environment(X16),
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a12, a13, a14, a15])], [c15, c16])).
% 0.20/0.37  
% 0.20/0.37  cnf(c19, axiom,
% 0.20/0.37  	subpopulations(first_movers,efficient_producers,sk1,sk2)).
% 0.20/0.37  cnf(a16, assumption,
% 0.20/0.37  	X15 = first_movers).
% 0.20/0.37  cnf(a17, assumption,
% 0.20/0.37  	X14 = efficient_producers).
% 0.20/0.37  cnf(a18, assumption,
% 0.20/0.37  	X16 = sk1).
% 0.20/0.37  cnf(a19, assumption,
% 0.20/0.37  	X17 = sk2).
% 0.20/0.37  cnf(c20, plain,
% 0.20/0.37  	~environment(X16),
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a16, a17, a18, a19])], [c18, c19])).
% 0.20/0.37  cnf(c21, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a16, a17, a18, a19])], [c18, c19])).
% 0.20/0.37  
% 0.20/0.37  cnf(c22, axiom,
% 0.20/0.37  	environment(sk1)).
% 0.20/0.37  cnf(a20, assumption,
% 0.20/0.37  	X16 = sk1).
% 0.20/0.37  cnf(c23, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a20])], [c20, c22])).
% 0.20/0.37  cnf(c24, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a20])], [c20, c22])).
% 0.20/0.37  
% 0.20/0.37  cnf(c25, plain,
% 0.20/0.37  	environment(X16)).
% 0.20/0.37  cnf(a21, assumption,
% 0.20/0.37  	X13 = X16).
% 0.20/0.37  cnf(c26, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(predicate_reduction, [assumptions([a21])], [c17, c25])).
% 0.20/0.37  
% 0.20/0.37  cnf(c27, axiom,
% 0.20/0.37  	greater(resilience(efficient_producers),resilience(first_movers))).
% 0.20/0.37  cnf(a22, assumption,
% 0.20/0.37  	resilience(X6) = resilience(efficient_producers)).
% 0.20/0.37  cnf(a23, assumption,
% 0.20/0.37  	resilience(X8) = resilience(first_movers)).
% 0.20/0.37  cnf(c28, plain,
% 0.20/0.37  	~in_environment(X9,X7) | ~environment(X9),
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a22, a23])], [c12, c27])).
% 0.20/0.37  cnf(c29, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a22, a23])], [c12, c27])).
% 0.20/0.37  
% 0.20/0.37  cnf(c30, axiom,
% 0.20/0.37  	in_environment(X18,X19) | ~subpopulations(first_movers,efficient_producers,X18,X19) | ~environment(X18)).
% 0.20/0.37  cnf(a24, assumption,
% 0.20/0.37  	X9 = X18).
% 0.20/0.37  cnf(a25, assumption,
% 0.20/0.37  	X7 = X19).
% 0.20/0.37  cnf(c31, plain,
% 0.20/0.37  	~environment(X9),
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a24, a25])], [c28, c30])).
% 0.20/0.37  cnf(c32, plain,
% 0.20/0.37  	~subpopulations(first_movers,efficient_producers,X18,X19) | ~environment(X18),
% 0.20/0.37  	inference(strict_predicate_extension, [assumptions([a24, a25])], [c28, c30])).
% 0.20/0.37  
% 0.20/0.37  cnf(c33, plain,
% 0.20/0.37  	subpopulations(X15,X14,X16,X17)).
% 0.20/0.37  cnf(a26, assumption,
% 0.20/0.37  	first_movers = X15).
% 0.20/0.37  cnf(a27, assumption,
% 0.20/0.37  	efficient_producers = X14).
% 0.20/0.37  cnf(a28, assumption,
% 0.20/0.37  	X18 = X16).
% 0.20/0.37  cnf(a29, assumption,
% 0.20/0.37  	X19 = X17).
% 0.20/0.37  cnf(c34, plain,
% 0.20/0.37  	~environment(X18),
% 0.20/0.37  	inference(predicate_reduction, [assumptions([a26, a27, a28, a29])], [c32, c33])).
% 0.20/0.37  
% 0.20/0.37  cnf(c35, plain,
% 0.20/0.37  	environment(X16)).
% 0.20/0.37  cnf(a30, assumption,
% 0.20/0.37  	X18 = X16).
% 0.20/0.37  cnf(c36, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(predicate_reduction, [assumptions([a30])], [c34, c35])).
% 0.20/0.37  
% 0.20/0.37  cnf(c37, plain,
% 0.20/0.37  	environment(X16)).
% 0.20/0.37  cnf(a31, assumption,
% 0.20/0.37  	X9 = X16).
% 0.20/0.37  cnf(c38, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(predicate_reduction, [assumptions([a31])], [c31, c37])).
% 0.20/0.37  
% 0.20/0.37  cnf(c39, plain,
% 0.20/0.37  	subpopulations(X10,X12,X13,X11)).
% 0.20/0.37  cnf(a32, assumption,
% 0.20/0.37  	X2 = X10).
% 0.20/0.37  cnf(a33, assumption,
% 0.20/0.37  	X0 = X12).
% 0.20/0.37  cnf(a34, assumption,
% 0.20/0.37  	X3 = X13).
% 0.20/0.37  cnf(a35, assumption,
% 0.20/0.37  	X1 = X11).
% 0.20/0.37  cnf(c40, plain,
% 0.20/0.37  	~environment(X3),
% 0.20/0.37  	inference(predicate_reduction, [assumptions([a32, a33, a34, a35])], [c6, c39])).
% 0.20/0.37  
% 0.20/0.37  cnf(c41, plain,
% 0.20/0.37  	environment(X16)).
% 0.20/0.37  cnf(a36, assumption,
% 0.20/0.37  	X3 = X16).
% 0.20/0.37  cnf(c42, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(predicate_reduction, [assumptions([a36])], [c40, c41])).
% 0.20/0.37  
% 0.20/0.37  cnf(c43, plain,
% 0.20/0.37  	$false,
% 0.20/0.37  	inference(constraint_solving, [
% 0.20/0.37  		bind(X0, first_movers),
% 0.20/0.37  		bind(X1, sk2),
% 0.20/0.37  		bind(X2, efficient_producers),
% 0.20/0.37  		bind(X3, sk1),
% 0.20/0.37  		bind(X4, first_movers),
% 0.20/0.37  		bind(X5, sk2),
% 0.20/0.37  		bind(X6, efficient_producers),
% 0.20/0.37  		bind(X7, sk2),
% 0.20/0.37  		bind(X8, first_movers),
% 0.20/0.37  		bind(X9, sk1),
% 0.20/0.37  		bind(X10, efficient_producers),
% 0.20/0.37  		bind(X11, sk2),
% 0.20/0.37  		bind(X12, first_movers),
% 0.20/0.37  		bind(X13, sk1),
% 0.20/0.37  		bind(X14, efficient_producers),
% 0.20/0.37  		bind(X15, first_movers),
% 0.20/0.37  		bind(X16, sk1),
% 0.20/0.37  		bind(X17, sk2),
% 0.20/0.37  		bind(X18, sk1),
% 0.20/0.37  		bind(X19, sk2)
% 0.20/0.37  	],
% 0.20/0.37  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28, a29, a30, a31, a32, a33, a34, a35, a36])).
% 0.20/0.37  
% 0.20/0.37  % SZS output end IncompleteProof
%------------------------------------------------------------------------------