↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : MGT032-2 : 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 : n003.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:17 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT032-2 : 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.11/0.37  % Computer : n003.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep  7 12:24:09 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.38  % SZS status Unsatisfiable
% 0.11/0.38  % SZS output begin IncompleteProof
% 0.11/0.38  cnf(c0, axiom,
% 0.11/0.38  	stable(sk2)).
% 0.11/0.38  cnf(c1, plain,
% 0.11/0.38  	stable(sk2),
% 0.11/0.38  	inference(start, [], [c0])).
% 0.11/0.38  
% 0.11/0.38  cnf(c2, axiom,
% 0.11/0.38  	in_environment(X0,sk1(X0)) | ~stable(X0) | ~environment(X0)).
% 0.11/0.38  cnf(a0, assumption,
% 0.11/0.38  	sk2 = X0).
% 0.11/0.38  cnf(c3, plain,
% 0.11/0.38  	$false,
% 0.11/0.38  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.11/0.38  cnf(c4, plain,
% 0.11/0.38  	in_environment(X0,sk1(X0)) | ~environment(X0),
% 0.11/0.38  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.11/0.38  
% 0.11/0.38  cnf(c5, axiom,
% 0.11/0.38  	subpopulations(first_movers,efficient_producers,sk2,sk3(X1)) | ~in_environment(sk2,X1)).
% 0.11/0.38  cnf(a1, assumption,
% 0.11/0.38  	X0 = sk2).
% 0.11/0.38  cnf(a2, assumption,
% 0.11/0.38  	sk1(X0) = X1).
% 0.11/0.38  cnf(c6, plain,
% 0.11/0.38  	~environment(X0),
% 0.11/0.38  	inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.11/0.38  cnf(c7, plain,
% 0.11/0.38  	subpopulations(first_movers,efficient_producers,sk2,sk3(X1)),
% 0.11/0.38  	inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.11/0.38  
% 0.11/0.38  cnf(c8, axiom,
% 0.11/0.38  	greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) | ~greater_or_equal(X2,sk1(X3)) | ~subpopulations(first_movers,efficient_producers,X3,X2) | ~stable(X3) | ~environment(X3)).
% 0.11/0.38  cnf(a3, assumption,
% 0.11/0.38  	first_movers = first_movers).
% 0.11/0.38  cnf(a4, assumption,
% 0.11/0.38  	efficient_producers = efficient_producers).
% 0.11/0.38  cnf(a5, assumption,
% 0.11/0.38  	sk2 = X3).
% 0.11/0.38  cnf(a6, assumption,
% 0.11/0.38  	sk3(X1) = X2).
% 0.11/0.38  cnf(c9, plain,
% 0.11/0.38  	$false,
% 0.11/0.38  	inference(strict_predicate_extension, [assumptions([a3, a4, a5, a6])], [c7, c8])).
% 0.11/0.38  cnf(c10, plain,
% 0.11/0.38  	greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) | ~greater_or_equal(X2,sk1(X3)) | ~stable(X3) | ~environment(X3),
% 0.11/0.38  	inference(strict_predicate_extension, [assumptions([a3, a4, a5, a6])], [c7, c8])).
% 0.11/0.38  
% 0.11/0.38  cnf(c11, axiom,
% 0.11/0.38  	selection_favors(X4,X5,X6) | ~greater(growth_rate(X4,X6),growth_rate(X5,X6)) | ~subpopulations(X5,X4,X7,X6) | ~environment(X7)).
% 0.11/0.38  cnf(a7, assumption,
% 0.11/0.38  	growth_rate(efficient_producers,X2) = growth_rate(X4,X6)).
% 0.11/0.38  cnf(a8, assumption,
% 0.11/0.38  	growth_rate(first_movers,X2) = growth_rate(X5,X6)).
% 0.11/0.38  cnf(c12, plain,
% 0.11/0.38  	~greater_or_equal(X2,sk1(X3)) | ~stable(X3) | ~environment(X3),
% 0.11/0.38  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])).
% 0.11/0.38  cnf(c13, plain,
% 0.11/0.38  	selection_favors(X4,X5,X6) | ~subpopulations(X5,X4,X7,X6) | ~environment(X7),
% 0.11/0.38  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])).
% 0.11/0.38  
% 0.11/0.38  cnf(c14, axiom,
% 0.11/0.38  	~selection_favors(efficient_producers,first_movers,sk3(X8)) | ~in_environment(sk2,X8)).
% 0.11/0.38  cnf(a9, assumption,
% 0.11/0.38  	X4 = efficient_producers).
% 0.11/0.38  cnf(a10, assumption,
% 0.11/0.38  	X5 = first_movers).
% 0.11/0.38  cnf(a11, assumption,
% 0.11/0.38  	X6 = sk3(X8)).
% 0.11/0.38  cnf(c15, plain,
% 0.11/0.38  	~subpopulations(X5,X4,X7,X6) | ~environment(X7),
% 0.11/0.38  	inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c13, c14])).
% 0.11/0.38  cnf(c16, plain,
% 0.11/0.38  	~in_environment(sk2,X8),
% 0.11/0.38  	inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c13, c14])).
% 0.11/0.38  
% 0.11/0.38  cnf(c17, plain,
% 0.11/0.38  	in_environment(X0,sk1(X0))).
% 0.11/0.38  cnf(a12, assumption,
% 0.11/0.38  	sk2 = X0).
% 0.11/0.38  cnf(a13, assumption,
% 0.11/0.38  	X8 = sk1(X0)).
% 0.11/0.38  cnf(c18, plain,
% 0.11/0.38  	$false,
% 0.11/0.38  	inference(predicate_reduction, [assumptions([a12, a13])], [c16, c17])).
% 0.11/0.38  
% 0.11/0.38  cnf(c19, plain,
% 0.11/0.38  	subpopulations(first_movers,efficient_producers,sk2,sk3(X1))).
% 0.11/0.38  cnf(a14, assumption,
% 0.11/0.38  	X5 = first_movers).
% 0.11/0.38  cnf(a15, assumption,
% 0.11/0.38  	X4 = efficient_producers).
% 0.11/0.38  cnf(a16, assumption,
% 0.11/0.38  	X7 = sk2).
% 0.11/0.38  cnf(a17, assumption,
% 0.11/0.38  	X6 = sk3(X1)).
% 0.11/0.38  cnf(c20, plain,
% 0.11/0.38  	~environment(X7),
% 0.11/0.38  	inference(predicate_reduction, [assumptions([a14, a15, a16, a17])], [c15, c19])).
% 0.11/0.38  
% 0.11/0.38  cnf(c21, axiom,
% 0.11/0.38  	environment(sk2)).
% 0.11/0.38  cnf(a18, assumption,
% 0.11/0.38  	X7 = sk2).
% 0.11/0.38  cnf(c22, plain,
% 0.11/0.38  	$false,
% 0.11/0.38  	inference(strict_predicate_extension, [assumptions([a18])], [c20, c21])).
% 0.11/0.38  cnf(c23, plain,
% 0.11/0.38  	$false,
% 0.11/0.38  	inference(strict_predicate_extension, [assumptions([a18])], [c20, c21])).
% 0.11/0.38  
% 0.11/0.38  cnf(c24, axiom,
% 0.11/0.38  	greater_or_equal(sk3(X9),X9) | ~in_environment(sk2,X9)).
% 0.11/0.38  cnf(a19, assumption,
% 0.11/0.38  	X2 = sk3(X9)).
% 0.11/0.38  cnf(a20, assumption,
% 0.11/0.38  	sk1(X3) = X9).
% 0.11/0.38  cnf(c25, plain,
% 0.11/0.38  	~stable(X3) | ~environment(X3),
% 0.11/0.38  	inference(strict_predicate_extension, [assumptions([a19, a20])], [c12, c24])).
% 0.11/0.38  cnf(c26, plain,
% 0.11/0.38  	~in_environment(sk2,X9),
% 0.11/0.38  	inference(strict_predicate_extension, [assumptions([a19, a20])], [c12, c24])).
% 0.11/0.38  
% 0.11/0.38  cnf(c27, plain,
% 0.11/0.38  	in_environment(X0,sk1(X0))).
% 0.11/0.38  cnf(a21, assumption,
% 0.11/0.38  	sk2 = X0).
% 0.11/0.38  cnf(a22, assumption,
% 0.11/0.38  	X9 = sk1(X0)).
% 0.11/0.38  cnf(c28, plain,
% 0.11/0.38  	$false,
% 0.11/0.38  	inference(predicate_reduction, [assumptions([a21, a22])], [c26, c27])).
% 0.11/0.38  
% 0.11/0.38  cnf(c29, plain,
% 0.11/0.38  	stable(sk2)).
% 0.11/0.38  cnf(a23, assumption,
% 0.11/0.38  	X3 = sk2).
% 0.11/0.38  cnf(c30, plain,
% 0.11/0.38  	~environment(X3),
% 0.11/0.38  	inference(predicate_reduction, [assumptions([a23])], [c25, c29])).
% 0.11/0.38  
% 0.11/0.38  cnf(c31, plain,
% 0.11/0.38  	environment(X7)).
% 0.11/0.38  cnf(a24, assumption,
% 0.11/0.38  	X3 = X7).
% 0.11/0.38  cnf(c32, plain,
% 0.11/0.38  	$false,
% 0.11/0.38  	inference(predicate_reduction, [assumptions([a24])], [c30, c31])).
% 0.11/0.38  
% 0.11/0.38  cnf(c33, plain,
% 0.11/0.38  	environment(X7)).
% 0.11/0.38  cnf(a25, assumption,
% 0.11/0.38  	X0 = X7).
% 0.11/0.38  cnf(c34, plain,
% 0.11/0.38  	$false,
% 0.11/0.38  	inference(predicate_reduction, [assumptions([a25])], [c6, c33])).
% 0.11/0.38  
% 0.11/0.38  cnf(c35, plain,
% 0.11/0.38  	$false,
% 0.11/0.38  	inference(constraint_solving, [
% 0.11/0.38  		bind(X0, sk2),
% 0.11/0.38  		bind(X1, sk1(X0)),
% 0.11/0.38  		bind(X2, sk3(X1)),
% 0.11/0.38  		bind(X3, sk2),
% 0.11/0.38  		bind(X4, efficient_producers),
% 0.11/0.38  		bind(X5, first_movers),
% 0.11/0.38  		bind(X6, sk3(X1)),
% 0.11/0.38  		bind(X7, sk2),
% 0.11/0.38  		bind(X8, sk1(X0)),
% 0.11/0.38  		bind(X9, sk1(X0))
% 0.11/0.38  	],
% 0.11/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])).
% 0.11/0.38  
% 0.11/0.38  % SZS output end IncompleteProof
%------------------------------------------------------------------------------