↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : MGT036-1 : TPTP v9.3.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 : n008.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep  8 06:13:18 AM UTC 2026

% Result   : Unsatisfiable 0.14s 0.38s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

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