%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT003+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 : 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:13 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.02 % Problem : MGT003+1 : TPTP v9.3.0. Released v2.0.0. % 0.00/0.03 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.10/0.36 % Computer : n003.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Mon Sep 7 11:35:39 UTC 2026 % 0.10/0.36 % 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 organization(sK1,sK4)). % 0.10/0.37 cnf(c1, plain, % 0.10/0.37 organization(sK1,sK4), % 0.10/0.37 inference(start, [], [c0])). % 0.10/0.37 % 0.10/0.37 cnf(c2, axiom, % 0.10/0.37 greater(X0,X1) | ~greater(X2,X3) | ~survival_chance(X4,X0,X5) | ~survival_chance(X6,X1,X7) | ~inertia(X4,X2,X5) | ~inertia(X6,X3,X7) | ~reorganization_free(X4,X5,X5) | ~reorganization_free(X6,X7,X7) | ~organization(X4,X5) | ~organization(X6,X7)). % 0.10/0.37 cnf(a0, assumption, % 0.10/0.37 sK1 = X6). % 0.10/0.37 cnf(a1, assumption, % 0.10/0.37 sK4 = X7). % 0.10/0.37 cnf(c3, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.10/0.37 cnf(c4, plain, % 0.10/0.37 greater(X0,X1) | ~greater(X2,X3) | ~survival_chance(X4,X0,X5) | ~survival_chance(X6,X1,X7) | ~inertia(X4,X2,X5) | ~inertia(X6,X3,X7) | ~reorganization_free(X4,X5,X5) | ~reorganization_free(X6,X7,X7) | ~organization(X4,X5), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.10/0.37 % 0.10/0.37 cnf(c5, axiom, % 0.10/0.37 ~greater(sK3,sK2)). % 0.10/0.37 cnf(a2, assumption, % 0.10/0.37 X0 = sK3). % 0.10/0.37 cnf(a3, assumption, % 0.10/0.37 X1 = sK2). % 0.10/0.37 cnf(c6, plain, % 0.10/0.37 ~greater(X2,X3) | ~survival_chance(X4,X0,X5) | ~survival_chance(X6,X1,X7) | ~inertia(X4,X2,X5) | ~inertia(X6,X3,X7) | ~reorganization_free(X4,X5,X5) | ~reorganization_free(X6,X7,X7) | ~organization(X4,X5), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.10/0.37 cnf(c7, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.10/0.37 % 0.10/0.37 cnf(c8, axiom, % 0.10/0.37 greater(X8,X9) | ~greater(X10,X11) | ~inertia(X12,X8,X10) | ~inertia(X12,X9,X11) | ~reorganization_free(X12,X11,X10) | ~organization(X12,X10) | ~organization(X12,X11)). % 0.10/0.37 cnf(a4, assumption, % 0.10/0.37 X2 = X8). % 0.10/0.37 cnf(a5, assumption, % 0.10/0.37 X3 = X9). % 0.10/0.37 cnf(c9, plain, % 0.10/0.37 ~survival_chance(X4,X0,X5) | ~survival_chance(X6,X1,X7) | ~inertia(X4,X2,X5) | ~inertia(X6,X3,X7) | ~reorganization_free(X4,X5,X5) | ~reorganization_free(X6,X7,X7) | ~organization(X4,X5), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.10/0.37 cnf(c10, plain, % 0.10/0.37 ~greater(X10,X11) | ~inertia(X12,X8,X10) | ~inertia(X12,X9,X11) | ~reorganization_free(X12,X11,X10) | ~organization(X12,X10) | ~organization(X12,X11), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.10/0.37 % 0.10/0.37 cnf(c11, axiom, % 0.10/0.37 greater(sK5,sK4)). % 0.10/0.37 cnf(a6, assumption, % 0.10/0.37 X10 = sK5). % 0.10/0.37 cnf(a7, assumption, % 0.10/0.37 X11 = sK4). % 0.10/0.37 cnf(c12, plain, % 0.10/0.37 ~inertia(X12,X8,X10) | ~inertia(X12,X9,X11) | ~reorganization_free(X12,X11,X10) | ~organization(X12,X10) | ~organization(X12,X11), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.10/0.37 cnf(c13, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.10/0.37 % 0.10/0.37 cnf(c14, axiom, % 0.10/0.37 inertia(X13,sK0(X13,X14),X14) | ~organization(X13,X14)). % 0.10/0.37 cnf(a8, assumption, % 0.10/0.37 X12 = X13). % 0.10/0.37 cnf(a9, assumption, % 0.10/0.37 X8 = sK0(X13,X14)). % 0.10/0.37 cnf(a10, assumption, % 0.10/0.37 X10 = X14). % 0.10/0.37 cnf(c15, plain, % 0.10/0.37 ~inertia(X12,X9,X11) | ~reorganization_free(X12,X11,X10) | ~organization(X12,X10) | ~organization(X12,X11), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c12, c14])). % 0.10/0.37 cnf(c16, plain, % 0.10/0.37 ~organization(X13,X14), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c12, c14])). % 0.10/0.37 % 0.10/0.37 cnf(c17, axiom, % 0.10/0.37 organization(sK1,sK5)). % 0.10/0.37 cnf(a11, assumption, % 0.10/0.37 X13 = sK1). % 0.10/0.37 cnf(a12, assumption, % 0.10/0.37 X14 = sK5). % 0.10/0.37 cnf(c18, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a11, a12])], [c16, c17])). % 0.10/0.37 cnf(c19, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a11, a12])], [c16, c17])). % 0.10/0.37 % 0.10/0.37 cnf(c20, axiom, % 0.10/0.37 inertia(X15,sK0(X15,X16),X16) | ~organization(X15,X16)). % 0.10/0.37 cnf(a13, assumption, % 0.10/0.37 X12 = X15). % 0.10/0.37 cnf(a14, assumption, % 0.10/0.37 X9 = sK0(X15,X16)). % 0.10/0.37 cnf(a15, assumption, % 0.10/0.37 X11 = X16). % 0.10/0.37 cnf(c21, plain, % 0.10/0.37 ~reorganization_free(X12,X11,X10) | ~organization(X12,X10) | ~organization(X12,X11), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a13, a14, a15])], [c15, c20])). % 0.10/0.37 cnf(c22, plain, % 0.10/0.37 ~organization(X15,X16), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a13, a14, a15])], [c15, c20])). % 0.10/0.37 % 0.10/0.37 cnf(c23, plain, % 0.10/0.37 organization(sK1,sK4)). % 0.10/0.37 cnf(a16, assumption, % 0.10/0.37 X15 = sK1). % 0.10/0.37 cnf(a17, assumption, % 0.10/0.37 X16 = sK4). % 0.10/0.37 cnf(c24, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(predicate_reduction, [assumptions([a16, a17])], [c22, c23])). % 0.10/0.37 % 0.10/0.37 cnf(c25, axiom, % 0.10/0.37 reorganization_free(sK1,sK4,sK5)). % 0.10/0.37 cnf(a18, assumption, % 0.10/0.37 X12 = sK1). % 0.10/0.37 cnf(a19, assumption, % 0.10/0.37 X11 = sK4). % 0.10/0.37 cnf(a20, assumption, % 0.10/0.37 X10 = sK5). % 0.10/0.37 cnf(c26, plain, % 0.10/0.37 ~organization(X12,X10) | ~organization(X12,X11), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a18, a19, a20])], [c21, c25])). % 0.10/0.37 cnf(c27, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a18, a19, a20])], [c21, c25])). % 0.10/0.37 % 0.10/0.37 cnf(c28, plain, % 0.10/0.37 organization(X13,X14)). % 0.10/0.37 cnf(a21, assumption, % 0.10/0.37 X12 = X13). % 0.10/0.37 cnf(a22, assumption, % 0.10/0.37 X10 = X14). % 0.10/0.37 cnf(c29, plain, % 0.10/0.37 ~organization(X12,X11), % 0.10/0.37 inference(predicate_reduction, [assumptions([a21, a22])], [c26, c28])). % 0.10/0.37 % 0.10/0.37 cnf(c30, plain, % 0.10/0.37 organization(sK1,sK4)). % 0.10/0.37 cnf(a23, assumption, % 0.10/0.37 X12 = sK1). % 0.10/0.37 cnf(a24, assumption, % 0.10/0.37 X11 = sK4). % 0.10/0.37 cnf(c31, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(predicate_reduction, [assumptions([a23, a24])], [c29, c30])). % 0.10/0.37 % 0.10/0.37 cnf(c32, axiom, % 0.10/0.37 survival_chance(sK1,sK3,sK5)). % 0.10/0.37 cnf(a25, assumption, % 0.10/0.37 X4 = sK1). % 0.10/0.37 cnf(a26, assumption, % 0.10/0.37 X0 = sK3). % 0.10/0.37 cnf(a27, assumption, % 0.10/0.37 X5 = sK5). % 0.10/0.37 cnf(c33, plain, % 0.10/0.37 ~survival_chance(X6,X1,X7) | ~inertia(X4,X2,X5) | ~inertia(X6,X3,X7) | ~reorganization_free(X4,X5,X5) | ~reorganization_free(X6,X7,X7) | ~organization(X4,X5), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a25, a26, a27])], [c9, c32])). % 0.10/0.37 cnf(c34, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a25, a26, a27])], [c9, c32])). % 0.10/0.37 % 0.10/0.37 cnf(c35, axiom, % 0.10/0.37 survival_chance(sK1,sK2,sK4)). % 0.10/0.37 cnf(a28, assumption, % 0.10/0.37 X6 = sK1). % 0.10/0.37 cnf(a29, assumption, % 0.10/0.37 X1 = sK2). % 0.10/0.37 cnf(a30, assumption, % 0.10/0.37 X7 = sK4). % 0.10/0.37 cnf(c36, plain, % 0.10/0.37 ~inertia(X4,X2,X5) | ~inertia(X6,X3,X7) | ~reorganization_free(X4,X5,X5) | ~reorganization_free(X6,X7,X7) | ~organization(X4,X5), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a28, a29, a30])], [c33, c35])). % 0.10/0.37 cnf(c37, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a28, a29, a30])], [c33, c35])). % 0.10/0.37 % 0.10/0.37 cnf(c38, plain, % 0.10/0.37 inertia(X12,X8,X10)). % 0.10/0.37 cnf(a31, assumption, % 0.10/0.37 X4 = X12). % 0.10/0.37 cnf(a32, assumption, % 0.10/0.37 X2 = X8). % 0.10/0.37 cnf(a33, assumption, % 0.10/0.37 X5 = X10). % 0.10/0.37 cnf(c39, plain, % 0.10/0.37 ~inertia(X6,X3,X7) | ~reorganization_free(X4,X5,X5) | ~reorganization_free(X6,X7,X7) | ~organization(X4,X5), % 0.10/0.37 inference(predicate_reduction, [assumptions([a31, a32, a33])], [c36, c38])). % 0.10/0.37 % 0.10/0.37 cnf(c40, plain, % 0.10/0.37 inertia(X12,X9,X11)). % 0.10/0.37 cnf(a34, assumption, % 0.10/0.37 X6 = X12). % 0.10/0.37 cnf(a35, assumption, % 0.10/0.37 X3 = X9). % 0.10/0.37 cnf(a36, assumption, % 0.10/0.37 X7 = X11). % 0.10/0.37 cnf(c41, plain, % 0.10/0.37 ~reorganization_free(X4,X5,X5) | ~reorganization_free(X6,X7,X7) | ~organization(X4,X5), % 0.10/0.37 inference(predicate_reduction, [assumptions([a34, a35, a36])], [c39, c40])). % 0.10/0.37 % 0.10/0.37 cnf(c42, axiom, % 0.10/0.37 reorganization_free(X17,X18,X18) | ~reorganization_free(X17,X19,X18)). % 0.10/0.37 cnf(a37, assumption, % 0.10/0.37 X4 = X17). % 0.10/0.37 cnf(a38, assumption, % 0.10/0.37 X5 = X18). % 0.10/0.37 cnf(a39, assumption, % 0.10/0.37 X5 = X18). % 0.10/0.37 cnf(c43, plain, % 0.10/0.37 ~reorganization_free(X6,X7,X7) | ~organization(X4,X5), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a37, a38, a39])], [c41, c42])). % 0.10/0.37 cnf(c44, plain, % 0.10/0.37 ~reorganization_free(X17,X19,X18), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a37, a38, a39])], [c41, c42])). % 0.10/0.37 % 0.10/0.37 cnf(c45, plain, % 0.10/0.37 reorganization_free(X12,X11,X10)). % 0.10/0.37 cnf(a40, assumption, % 0.10/0.37 X17 = X12). % 0.10/0.37 cnf(a41, assumption, % 0.10/0.37 X19 = X11). % 0.10/0.37 cnf(a42, assumption, % 0.10/0.37 X18 = X10). % 0.10/0.37 cnf(c46, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(predicate_reduction, [assumptions([a40, a41, a42])], [c44, c45])). % 0.10/0.37 % 0.10/0.37 cnf(c47, axiom, % 0.10/0.37 reorganization_free(X20,X21,X21) | ~reorganization_free(X20,X21,X22)). % 0.10/0.37 cnf(a43, assumption, % 0.10/0.37 X6 = X20). % 0.10/0.37 cnf(a44, assumption, % 0.10/0.37 X7 = X21). % 0.10/0.37 cnf(a45, assumption, % 0.10/0.37 X7 = X21). % 0.10/0.37 cnf(c48, plain, % 0.10/0.37 ~organization(X4,X5), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a43, a44, a45])], [c43, c47])). % 0.10/0.37 cnf(c49, plain, % 0.10/0.37 ~reorganization_free(X20,X21,X22), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a43, a44, a45])], [c43, c47])). % 0.10/0.37 % 0.10/0.37 cnf(c50, plain, % 0.10/0.37 reorganization_free(X12,X11,X10)). % 0.10/0.37 cnf(a46, assumption, % 0.10/0.37 X20 = X12). % 0.10/0.37 cnf(a47, assumption, % 0.10/0.37 X21 = X11). % 0.10/0.37 cnf(a48, assumption, % 0.10/0.37 X22 = X10). % 0.10/0.37 cnf(c51, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(predicate_reduction, [assumptions([a46, a47, a48])], [c49, c50])). % 0.10/0.37 % 0.10/0.37 cnf(c52, plain, % 0.10/0.37 organization(X13,X14)). % 0.10/0.37 cnf(a49, assumption, % 0.10/0.37 X4 = X13). % 0.10/0.37 cnf(a50, assumption, % 0.10/0.37 X5 = X14). % 0.10/0.37 cnf(c53, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(predicate_reduction, [assumptions([a49, a50])], [c48, c52])). % 0.10/0.37 % 0.10/0.37 cnf(c54, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(constraint_solving, [ % 0.10/0.37 bind(X0, sK3), % 0.10/0.37 bind(X1, sK2), % 0.10/0.37 bind(X2, sK0(X13,X14)), % 0.10/0.37 bind(X3, sK0(X15,X16)), % 0.10/0.37 bind(X4, sK1), % 0.10/0.37 bind(X5, sK5), % 0.10/0.37 bind(X6, sK1), % 0.10/0.37 bind(X7, sK4), % 0.10/0.37 bind(X8, sK0(X13,X14)), % 0.10/0.37 bind(X9, sK0(X15,X16)), % 0.10/0.37 bind(X10, sK5), % 0.10/0.37 bind(X11, sK4), % 0.10/0.37 bind(X12, sK1), % 0.10/0.37 bind(X13, sK1), % 0.10/0.37 bind(X14, sK5), % 0.10/0.37 bind(X15, sK1), % 0.10/0.37 bind(X16, sK4), % 0.10/0.37 bind(X17, sK1), % 0.10/0.37 bind(X18, sK5), % 0.10/0.37 bind(X19, sK4), % 0.10/0.37 bind(X20, sK1), % 0.10/0.37 bind(X21, sK4), % 0.10/0.37 bind(X22, sK5) % 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, a46, a47, a48, a49, a50])). % 0.10/0.37 % 0.10/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------