%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT028+1 : TPTP v9.3.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n011.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 : Theorem 0.10s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT028+1 : TPTP v9.3.0. Released v2.0.0. % 0.00/0.04 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.10/0.35 % Computer : n011.cluster.edu % 0.10/0.35 % Model : x86_64 x86_64 % 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.35 % Memory : 8046.5625MB % 0.10/0.35 % OS : Linux 6.8.0-71-generic % 0.10/0.35 % CPULimit : 300 % 0.10/0.35 % WCLimit : 300 % 0.10/0.35 % DateTime : Mon Sep 7 12:14:30 UTC 2026 % 0.10/0.35 % CPUTime : % 0.10/0.37 % SZS status Theorem % 0.10/0.37 % SZS output begin IncompleteProof % 0.10/0.37 cnf(c0, axiom, % 0.10/0.37 environment(sK7)). % 0.10/0.37 cnf(c1, plain, % 0.10/0.37 environment(sK7), % 0.10/0.37 inference(start, [], [c0])). % 0.10/0.37 % 0.10/0.37 cnf(c2, axiom, % 0.10/0.37 in_environment(X0,sK5(X0)) | ~stable(X0) | ~environment(X0)). % 0.10/0.37 cnf(a0, assumption, % 0.10/0.37 sK7 = X0). % 0.10/0.37 cnf(c3, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.37 cnf(c4, plain, % 0.10/0.37 in_environment(X0,sK5(X0)) | ~stable(X0), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.37 % 0.10/0.37 cnf(c5, axiom, % 0.10/0.37 greater(zero,growth_rate(first_movers,X1)) | ~greater_or_equal(X1,sK4(X2)) | ~subpopulations(first_movers,efficient_producers,X2,X1) | sP0(X3,X2) | ~in_environment(X2,X3) | ~stable(X2) | ~environment(X2)). % 0.10/0.37 cnf(a1, assumption, % 0.10/0.37 X0 = X2). % 0.10/0.37 cnf(a2, assumption, % 0.10/0.37 sK5(X0) = X3). % 0.10/0.37 cnf(c6, plain, % 0.10/0.37 ~stable(X0), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 0.10/0.37 cnf(c7, plain, % 0.10/0.37 greater(zero,growth_rate(first_movers,X1)) | ~greater_or_equal(X1,sK4(X2)) | ~subpopulations(first_movers,efficient_producers,X2,X1) | sP0(X3,X2) | ~stable(X2) | ~environment(X2), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 0.10/0.37 % 0.10/0.37 cnf(c8, axiom, % 0.10/0.37 ~greater(zero,growth_rate(first_movers,sK6(X4,X5))) | ~sP2(X4,X5)). % 0.10/0.37 cnf(a3, assumption, % 0.10/0.37 zero = zero). % 0.10/0.37 cnf(a4, assumption, % 0.10/0.37 growth_rate(first_movers,X1) = growth_rate(first_movers,sK6(X4,X5))). % 0.10/0.37 cnf(c9, plain, % 0.10/0.37 ~greater_or_equal(X1,sK4(X2)) | ~subpopulations(first_movers,efficient_producers,X2,X1) | sP0(X3,X2) | ~stable(X2) | ~environment(X2), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 0.10/0.37 cnf(c10, plain, % 0.10/0.37 ~sP2(X4,X5), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 0.10/0.37 % 0.10/0.37 cnf(c11, axiom, % 0.10/0.37 sP2(X6,sK7) | ~greater(X6,appear(efficient_producers,sK7))). % 0.10/0.37 cnf(a5, assumption, % 0.10/0.37 X4 = X6). % 0.10/0.37 cnf(a6, assumption, % 0.10/0.37 X5 = sK7). % 0.10/0.37 cnf(c12, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 0.10/0.37 cnf(c13, plain, % 0.10/0.37 ~greater(X6,appear(efficient_producers,sK7)), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 0.10/0.37 % 0.10/0.37 cnf(c14, axiom, % 0.10/0.37 greater(sK4(X7),appear(efficient_producers,X7)) | sP0(X8,X7) | ~in_environment(X7,X8) | ~stable(X7) | ~environment(X7)). % 0.10/0.37 cnf(a7, assumption, % 0.10/0.37 X6 = sK4(X7)). % 0.10/0.37 cnf(a8, assumption, % 0.10/0.37 appear(efficient_producers,sK7) = appear(efficient_producers,X7)). % 0.10/0.37 cnf(c15, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 0.10/0.37 cnf(c16, plain, % 0.10/0.37 sP0(X8,X7) | ~in_environment(X7,X8) | ~stable(X7) | ~environment(X7), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 0.10/0.37 % 0.10/0.37 cnf(c17, axiom, % 0.10/0.37 subpopulations(first_movers,efficient_producers,X9,sK3(X10,X9)) | ~sP0(X10,X9)). % 0.10/0.37 cnf(a9, assumption, % 0.10/0.37 X8 = X10). % 0.10/0.37 cnf(a10, assumption, % 0.10/0.37 X7 = X9). % 0.10/0.37 cnf(c18, plain, % 0.10/0.37 ~in_environment(X7,X8) | ~stable(X7) | ~environment(X7), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c17])). % 0.10/0.37 cnf(c19, plain, % 0.10/0.37 subpopulations(first_movers,efficient_producers,X9,sK3(X10,X9)), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c17])). % 0.10/0.37 % 0.10/0.37 cnf(c20, axiom, % 0.10/0.37 greater(zero,growth_rate(first_movers,X11)) | ~greater_or_equal(X11,X12) | ~subpopulations(first_movers,efficient_producers,X13,X11) | ~sP1(X12,X13)). % 0.10/0.37 cnf(a11, assumption, % 0.10/0.37 first_movers = first_movers). % 0.10/0.37 cnf(a12, assumption, % 0.10/0.37 efficient_producers = efficient_producers). % 0.10/0.37 cnf(a13, assumption, % 0.10/0.37 X9 = X13). % 0.10/0.37 cnf(a14, assumption, % 0.10/0.37 sK3(X10,X9) = X11). % 0.10/0.37 cnf(c21, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a11, a12, a13, a14])], [c19, c20])). % 0.10/0.37 cnf(c22, plain, % 0.10/0.37 greater(zero,growth_rate(first_movers,X11)) | ~greater_or_equal(X11,X12) | ~sP1(X12,X13), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a11, a12, a13, a14])], [c19, c20])). % 0.10/0.37 % 0.10/0.37 cnf(c23, axiom, % 0.10/0.37 ~greater(zero,growth_rate(first_movers,sK3(X14,X15))) | ~sP0(X14,X15)). % 0.10/0.37 cnf(a15, assumption, % 0.10/0.37 zero = zero). % 0.10/0.37 cnf(a16, assumption, % 0.10/0.37 growth_rate(first_movers,X11) = growth_rate(first_movers,sK3(X14,X15))). % 0.10/0.37 cnf(c24, plain, % 0.10/0.37 ~greater_or_equal(X11,X12) | ~sP1(X12,X13), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a15, a16])], [c22, c23])). % 0.10/0.37 cnf(c25, plain, % 0.10/0.37 ~sP0(X14,X15), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a15, a16])], [c22, c23])). % 0.10/0.37 % 0.10/0.37 cnf(c26, plain, % 0.10/0.37 sP0(X8,X7)). % 0.10/0.37 cnf(a17, assumption, % 0.10/0.37 X14 = X8). % 0.10/0.37 cnf(a18, assumption, % 0.10/0.37 X15 = X7). % 0.10/0.37 cnf(c27, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(predicate_reduction, [assumptions([a17, a18])], [c25, c26])). % 0.10/0.37 % 0.10/0.37 cnf(c28, axiom, % 0.10/0.37 greater_or_equal(sK3(X16,X17),X16) | ~sP0(X16,X17)). % 0.10/0.37 cnf(a19, assumption, % 0.10/0.37 X11 = sK3(X16,X17)). % 0.10/0.37 cnf(a20, assumption, % 0.10/0.37 X12 = X16). % 0.10/0.37 cnf(c29, plain, % 0.10/0.37 ~sP1(X12,X13), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a19, a20])], [c24, c28])). % 0.10/0.37 cnf(c30, plain, % 0.10/0.37 ~sP0(X16,X17), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a19, a20])], [c24, c28])). % 0.10/0.37 % 0.10/0.37 cnf(c31, plain, % 0.10/0.37 sP0(X8,X7)). % 0.10/0.37 cnf(a21, assumption, % 0.10/0.37 X16 = X8). % 0.10/0.37 cnf(a22, assumption, % 0.10/0.37 X17 = X7). % 0.10/0.37 cnf(c32, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(predicate_reduction, [assumptions([a21, a22])], [c30, c31])). % 0.10/0.37 % 0.10/0.37 cnf(c33, axiom, % 0.10/0.37 sP1(sK5(X18),X18) | ~stable(X18) | ~environment(X18)). % 0.10/0.37 cnf(a23, assumption, % 0.10/0.37 X12 = sK5(X18)). % 0.10/0.37 cnf(a24, assumption, % 0.10/0.37 X13 = X18). % 0.10/0.37 cnf(c34, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a23, a24])], [c29, c33])). % 0.10/0.37 cnf(c35, plain, % 0.10/0.37 ~stable(X18) | ~environment(X18), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a23, a24])], [c29, c33])). % 0.10/0.37 % 0.10/0.37 cnf(c36, axiom, % 0.10/0.37 stable(sK7)). % 0.10/0.37 cnf(a25, assumption, % 0.10/0.37 X18 = sK7). % 0.10/0.37 cnf(c37, plain, % 0.10/0.37 ~environment(X18), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a25])], [c35, c36])). % 0.10/0.37 cnf(c38, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a25])], [c35, c36])). % 0.10/0.37 % 0.10/0.37 cnf(c39, plain, % 0.10/0.37 environment(sK7)). % 0.10/0.37 cnf(a26, assumption, % 0.10/0.37 X18 = sK7). % 0.10/0.37 cnf(c40, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(predicate_reduction, [assumptions([a26])], [c37, c39])). % 0.10/0.37 % 0.10/0.37 cnf(c41, plain, % 0.10/0.37 in_environment(X0,sK5(X0))). % 0.10/0.37 cnf(a27, assumption, % 0.10/0.37 X7 = X0). % 0.10/0.37 cnf(a28, assumption, % 0.10/0.37 X8 = sK5(X0)). % 0.10/0.37 cnf(c42, plain, % 0.10/0.37 ~stable(X7) | ~environment(X7), % 0.10/0.37 inference(predicate_reduction, [assumptions([a27, a28])], [c18, c41])). % 0.10/0.37 % 0.10/0.37 cnf(c43, plain, % 0.10/0.37 stable(X18)). % 0.10/0.37 cnf(a29, assumption, % 0.10/0.37 X7 = X18). % 0.10/0.37 cnf(c44, plain, % 0.10/0.37 ~environment(X7), % 0.10/0.37 inference(predicate_reduction, [assumptions([a29])], [c42, c43])). % 0.10/0.37 % 0.10/0.37 cnf(c45, plain, % 0.10/0.37 environment(sK7)). % 0.10/0.37 cnf(a30, assumption, % 0.10/0.37 X7 = sK7). % 0.10/0.37 cnf(c46, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(predicate_reduction, [assumptions([a30])], [c44, c45])). % 0.10/0.37 % 0.10/0.37 cnf(c47, axiom, % 0.10/0.37 greater_or_equal(sK6(X19,X20),X19) | ~sP2(X19,X20)). % 0.10/0.37 cnf(a31, assumption, % 0.10/0.37 X1 = sK6(X19,X20)). % 0.10/0.37 cnf(a32, assumption, % 0.10/0.37 sK4(X2) = X19). % 0.10/0.37 cnf(c48, plain, % 0.10/0.37 ~subpopulations(first_movers,efficient_producers,X2,X1) | sP0(X3,X2) | ~stable(X2) | ~environment(X2), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a31, a32])], [c9, c47])). % 0.10/0.37 cnf(c49, plain, % 0.10/0.37 ~sP2(X19,X20), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a31, a32])], [c9, c47])). % 0.10/0.37 % 0.10/0.37 cnf(c50, plain, % 0.10/0.37 sP2(X4,X5)). % 0.10/0.37 cnf(a33, assumption, % 0.10/0.37 X19 = X4). % 0.10/0.37 cnf(a34, assumption, % 0.10/0.37 X20 = X5). % 0.10/0.37 cnf(c51, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(predicate_reduction, [assumptions([a33, a34])], [c49, c50])). % 0.10/0.37 % 0.10/0.37 cnf(c52, axiom, % 0.10/0.37 subpopulations(first_movers,efficient_producers,X21,sK6(X22,X21)) | ~sP2(X22,X21)). % 0.10/0.37 cnf(a35, assumption, % 0.10/0.37 first_movers = first_movers). % 0.10/0.37 cnf(a36, assumption, % 0.10/0.37 efficient_producers = efficient_producers). % 0.10/0.37 cnf(a37, assumption, % 0.10/0.37 X2 = X21). % 0.10/0.37 cnf(a38, assumption, % 0.10/0.37 X1 = sK6(X22,X21)). % 0.10/0.37 cnf(c53, plain, % 0.10/0.37 sP0(X3,X2) | ~stable(X2) | ~environment(X2), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a35, a36, a37, a38])], [c48, c52])). % 0.10/0.37 cnf(c54, plain, % 0.10/0.37 ~sP2(X22,X21), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a35, a36, a37, a38])], [c48, c52])). % 0.10/0.37 % 0.10/0.37 cnf(c55, plain, % 0.10/0.37 sP2(X4,X5)). % 0.10/0.37 cnf(a39, assumption, % 0.10/0.37 X22 = X4). % 0.10/0.37 cnf(a40, assumption, % 0.10/0.37 X21 = X5). % 0.10/0.37 cnf(c56, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(predicate_reduction, [assumptions([a39, a40])], [c54, c55])). % 0.10/0.37 % 0.10/0.37 cnf(c57, plain, % 0.10/0.37 ~sP0(X8,X7)). % 0.10/0.37 cnf(a41, assumption, % 0.10/0.37 X3 = X8). % 0.10/0.37 cnf(a42, assumption, % 0.10/0.37 X2 = X7). % 0.10/0.37 cnf(c58, plain, % 0.10/0.37 ~stable(X2) | ~environment(X2), % 0.10/0.37 inference(predicate_reduction, [assumptions([a41, a42])], [c53, c57])). % 0.10/0.37 % 0.10/0.37 cnf(c59, plain, % 0.10/0.37 stable(X18)). % 0.10/0.37 cnf(a43, assumption, % 0.10/0.37 X2 = X18). % 0.10/0.37 cnf(c60, plain, % 0.10/0.37 ~environment(X2), % 0.10/0.37 inference(predicate_reduction, [assumptions([a43])], [c58, c59])). % 0.10/0.37 % 0.10/0.37 cnf(c61, plain, % 0.10/0.37 environment(sK7)). % 0.10/0.37 cnf(a44, assumption, % 0.10/0.37 X2 = sK7). % 0.10/0.37 cnf(c62, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(predicate_reduction, [assumptions([a44])], [c60, c61])). % 0.10/0.37 % 0.10/0.37 cnf(c63, plain, % 0.10/0.37 stable(X18)). % 0.10/0.37 cnf(a45, assumption, % 0.10/0.37 X0 = X18). % 0.10/0.37 cnf(c64, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(predicate_reduction, [assumptions([a45])], [c6, c63])). % 0.10/0.37 % 0.10/0.37 cnf(c65, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(constraint_solving, [ % 0.10/0.37 bind(X0, sK7), % 0.10/0.37 bind(X1, sK6(X4,X5)), % 0.10/0.37 bind(X2, sK7), % 0.10/0.37 bind(X3, sK5(X0)), % 0.10/0.37 bind(X4, sK4(X7)), % 0.10/0.37 bind(X5, sK7), % 0.10/0.37 bind(X6, sK4(X7)), % 0.10/0.37 bind(X7, sK7), % 0.10/0.37 bind(X8, sK5(X18)), % 0.10/0.37 bind(X9, sK7), % 0.10/0.37 bind(X10, sK5(X18)), % 0.10/0.37 bind(X11, sK3(X10,X9)), % 0.10/0.37 bind(X12, sK5(X18)), % 0.10/0.37 bind(X13, sK7), % 0.10/0.37 bind(X14, sK5(X18)), % 0.10/0.37 bind(X15, sK7), % 0.10/0.37 bind(X16, sK5(X18)), % 0.10/0.37 bind(X17, sK7), % 0.10/0.37 bind(X18, sK7), % 0.10/0.37 bind(X19, sK4(X7)), % 0.10/0.37 bind(X20, sK7), % 0.10/0.37 bind(X21, sK7), % 0.10/0.37 bind(X22, sK4(X7)) % 0.10/0.37 ], % 0.10/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, a37, a38, a39, a40, a41, a42, a43, a44, a45])). % 0.10/0.37 % 0.10/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------