%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT002+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 : 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:13 AM UTC 2026 % Result : Theorem 0.09s 0.43s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT002+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.09/0.41 % Computer : n008.cluster.edu % 0.09/0.41 % Model : x86_64 x86_64 % 0.09/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.41 % Memory : 8046.5625MB % 0.09/0.41 % OS : Linux 6.8.0-71-generic % 0.09/0.41 % CPULimit : 300 % 0.09/0.41 % WCLimit : 300 % 0.09/0.42 % DateTime : Mon Sep 7 11:33:23 UTC 2026 % 0.09/0.42 % CPUTime : % 0.09/0.43 % SZS status Theorem % 0.09/0.43 % SZS output begin IncompleteProof % 0.09/0.43 cnf(c0, axiom, % 0.09/0.43 reorganization_free(sK1,sK4,sK5)). % 0.09/0.43 cnf(c1, plain, % 0.09/0.43 reorganization_free(sK1,sK4,sK5), % 0.09/0.43 inference(start, [], [c0])). % 0.09/0.43 % 0.09/0.43 cnf(c2, axiom, % 0.09/0.43 reorganization_free(X0,X1,X1) | ~reorganization_free(X0,X2,X1)). % 0.09/0.43 cnf(a0, assumption, % 0.09/0.43 sK1 = X0). % 0.09/0.43 cnf(a1, assumption, % 0.09/0.43 sK4 = X2). % 0.09/0.43 cnf(a2, assumption, % 0.09/0.43 sK5 = X1). % 0.09/0.43 cnf(c3, plain, % 0.09/0.43 $false, % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.09/0.43 cnf(c4, plain, % 0.09/0.43 reorganization_free(X0,X1,X1), % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.09/0.43 % 0.09/0.43 cnf(c5, axiom, % 0.09/0.43 greater(X3,X4) | ~greater(X5,X6) | ~inertia(X7,X3,X8) | ~inertia(X9,X4,X10) | ~reproducibility(X7,X5,X8) | ~reproducibility(X9,X6,X10) | ~reorganization_free(X7,X8,X8) | ~reorganization_free(X9,X10,X10) | ~organization(X7,X8) | ~organization(X9,X10)). % 0.09/0.43 cnf(a3, assumption, % 0.09/0.43 X0 = X7). % 0.09/0.43 cnf(a4, assumption, % 0.09/0.43 X1 = X8). % 0.09/0.43 cnf(a5, assumption, % 0.09/0.43 X1 = X8). % 0.09/0.43 cnf(c6, plain, % 0.09/0.43 $false, % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.09/0.43 cnf(c7, plain, % 0.09/0.43 greater(X3,X4) | ~greater(X5,X6) | ~inertia(X7,X3,X8) | ~inertia(X9,X4,X10) | ~reproducibility(X7,X5,X8) | ~reproducibility(X9,X6,X10) | ~reorganization_free(X9,X10,X10) | ~organization(X7,X8) | ~organization(X9,X10), % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.09/0.43 % 0.09/0.43 cnf(c8, axiom, % 0.09/0.43 ~greater(sK3,sK2)). % 0.09/0.43 cnf(a6, assumption, % 0.09/0.43 X3 = sK3). % 0.09/0.43 cnf(a7, assumption, % 0.09/0.43 X4 = sK2). % 0.09/0.43 cnf(c9, plain, % 0.09/0.43 ~greater(X5,X6) | ~inertia(X7,X3,X8) | ~inertia(X9,X4,X10) | ~reproducibility(X7,X5,X8) | ~reproducibility(X9,X6,X10) | ~reorganization_free(X9,X10,X10) | ~organization(X7,X8) | ~organization(X9,X10), % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a6, a7])], [c7, c8])). % 0.09/0.43 cnf(c10, plain, % 0.09/0.43 $false, % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a6, a7])], [c7, c8])). % 0.09/0.43 % 0.09/0.43 cnf(c11, axiom, % 0.09/0.43 greater(X11,X12) | ~greater(X13,X14) | ~reproducibility(X15,X11,X13) | ~reproducibility(X15,X12,X14) | ~reorganization_free(X15,X14,X13) | ~organization(X15,X13) | ~organization(X15,X14)). % 0.09/0.43 cnf(a8, assumption, % 0.09/0.43 X5 = X11). % 0.09/0.43 cnf(a9, assumption, % 0.09/0.43 X6 = X12). % 0.09/0.43 cnf(c12, plain, % 0.09/0.43 ~inertia(X7,X3,X8) | ~inertia(X9,X4,X10) | ~reproducibility(X7,X5,X8) | ~reproducibility(X9,X6,X10) | ~reorganization_free(X9,X10,X10) | ~organization(X7,X8) | ~organization(X9,X10), % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c11])). % 0.09/0.43 cnf(c13, plain, % 0.09/0.43 ~greater(X13,X14) | ~reproducibility(X15,X11,X13) | ~reproducibility(X15,X12,X14) | ~reorganization_free(X15,X14,X13) | ~organization(X15,X13) | ~organization(X15,X14), % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c11])). % 0.09/0.43 % 0.09/0.43 cnf(c14, axiom, % 0.09/0.43 greater(sK5,sK4)). % 0.09/0.43 cnf(a10, assumption, % 0.09/0.43 X13 = sK5). % 0.09/0.43 cnf(a11, assumption, % 0.09/0.43 X14 = sK4). % 0.09/0.43 cnf(c15, plain, % 0.09/0.43 ~reproducibility(X15,X11,X13) | ~reproducibility(X15,X12,X14) | ~reorganization_free(X15,X14,X13) | ~organization(X15,X13) | ~organization(X15,X14), % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a10, a11])], [c13, c14])). % 0.09/0.43 cnf(c16, plain, % 0.09/0.43 $false, % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a10, a11])], [c13, c14])). % 0.09/0.43 % 0.09/0.43 cnf(c17, axiom, % 0.09/0.43 reproducibility(X16,sK0(X16,X17),X17) | ~organization(X16,X17)). % 0.09/0.43 cnf(a12, assumption, % 0.09/0.43 X15 = X16). % 0.09/0.43 cnf(a13, assumption, % 0.09/0.43 X11 = sK0(X16,X17)). % 0.09/0.43 cnf(a14, assumption, % 0.09/0.43 X13 = X17). % 0.09/0.43 cnf(c18, plain, % 0.09/0.43 ~reproducibility(X15,X12,X14) | ~reorganization_free(X15,X14,X13) | ~organization(X15,X13) | ~organization(X15,X14), % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c15, c17])). % 0.09/0.43 cnf(c19, plain, % 0.09/0.43 ~organization(X16,X17), % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c15, c17])). % 0.09/0.43 % 0.09/0.43 cnf(c20, axiom, % 0.09/0.43 organization(sK1,sK5)). % 0.09/0.43 cnf(a15, assumption, % 0.09/0.43 X16 = sK1). % 0.09/0.43 cnf(a16, assumption, % 0.09/0.43 X17 = sK5). % 0.09/0.43 cnf(c21, plain, % 0.09/0.43 $false, % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a15, a16])], [c19, c20])). % 0.09/0.43 cnf(c22, plain, % 0.09/0.43 $false, % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a15, a16])], [c19, c20])). % 0.09/0.43 % 0.09/0.43 cnf(c23, axiom, % 0.09/0.43 reproducibility(X18,sK0(X18,X19),X19) | ~organization(X18,X19)). % 0.09/0.43 cnf(a17, assumption, % 0.09/0.43 X15 = X18). % 0.09/0.43 cnf(a18, assumption, % 0.09/0.43 X12 = sK0(X18,X19)). % 0.09/0.43 cnf(a19, assumption, % 0.09/0.43 X14 = X19). % 0.09/0.43 cnf(c24, plain, % 0.09/0.43 ~reorganization_free(X15,X14,X13) | ~organization(X15,X13) | ~organization(X15,X14), % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a17, a18, a19])], [c18, c23])). % 0.09/0.43 cnf(c25, plain, % 0.09/0.43 ~organization(X18,X19), % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a17, a18, a19])], [c18, c23])). % 0.09/0.43 % 0.09/0.43 cnf(c26, axiom, % 0.09/0.43 organization(sK1,sK4)). % 0.09/0.43 cnf(a20, assumption, % 0.09/0.43 X18 = sK1). % 0.09/0.43 cnf(a21, assumption, % 0.09/0.43 X19 = sK4). % 0.09/0.43 cnf(c27, plain, % 0.09/0.43 $false, % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a20, a21])], [c25, c26])). % 0.09/0.43 cnf(c28, plain, % 0.09/0.43 $false, % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a20, a21])], [c25, c26])). % 0.09/0.43 % 0.09/0.43 cnf(c29, plain, % 0.09/0.43 reorganization_free(sK1,sK4,sK5)). % 0.09/0.43 cnf(a22, assumption, % 0.09/0.43 X15 = sK1). % 0.09/0.43 cnf(a23, assumption, % 0.09/0.43 X14 = sK4). % 0.09/0.43 cnf(a24, assumption, % 0.09/0.43 X13 = sK5). % 0.09/0.43 cnf(c30, plain, % 0.09/0.43 ~organization(X15,X13) | ~organization(X15,X14), % 0.09/0.43 inference(predicate_reduction, [assumptions([a22, a23, a24])], [c24, c29])). % 0.09/0.43 % 0.09/0.43 cnf(c31, plain, % 0.09/0.43 organization(X16,X17)). % 0.09/0.43 cnf(a25, assumption, % 0.09/0.43 X15 = X16). % 0.09/0.43 cnf(a26, assumption, % 0.09/0.43 X13 = X17). % 0.09/0.43 cnf(c32, plain, % 0.09/0.43 ~organization(X15,X14), % 0.09/0.43 inference(predicate_reduction, [assumptions([a25, a26])], [c30, c31])). % 0.09/0.43 % 0.09/0.43 cnf(c33, plain, % 0.09/0.43 organization(X18,X19)). % 0.09/0.43 cnf(a27, assumption, % 0.09/0.43 X15 = X18). % 0.09/0.43 cnf(a28, assumption, % 0.09/0.43 X14 = X19). % 0.09/0.43 cnf(c34, plain, % 0.09/0.43 $false, % 0.09/0.43 inference(predicate_reduction, [assumptions([a27, a28])], [c32, c33])). % 0.09/0.43 % 0.09/0.43 cnf(c35, axiom, % 0.09/0.43 inertia(sK1,sK3,sK5)). % 0.09/0.43 cnf(a29, assumption, % 0.09/0.43 X7 = sK1). % 0.09/0.43 cnf(a30, assumption, % 0.09/0.43 X3 = sK3). % 0.09/0.43 cnf(a31, assumption, % 0.09/0.43 X8 = sK5). % 0.09/0.43 cnf(c36, plain, % 0.09/0.43 ~inertia(X9,X4,X10) | ~reproducibility(X7,X5,X8) | ~reproducibility(X9,X6,X10) | ~reorganization_free(X9,X10,X10) | ~organization(X7,X8) | ~organization(X9,X10), % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a29, a30, a31])], [c12, c35])). % 0.09/0.43 cnf(c37, plain, % 0.09/0.43 $false, % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a29, a30, a31])], [c12, c35])). % 0.09/0.43 % 0.09/0.43 cnf(c38, axiom, % 0.09/0.43 inertia(sK1,sK2,sK4)). % 0.09/0.43 cnf(a32, assumption, % 0.09/0.43 X9 = sK1). % 0.09/0.43 cnf(a33, assumption, % 0.09/0.43 X4 = sK2). % 0.09/0.43 cnf(a34, assumption, % 0.09/0.43 X10 = sK4). % 0.09/0.43 cnf(c39, plain, % 0.09/0.43 ~reproducibility(X7,X5,X8) | ~reproducibility(X9,X6,X10) | ~reorganization_free(X9,X10,X10) | ~organization(X7,X8) | ~organization(X9,X10), % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a32, a33, a34])], [c36, c38])). % 0.09/0.43 cnf(c40, plain, % 0.09/0.43 $false, % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a32, a33, a34])], [c36, c38])). % 0.09/0.43 % 0.09/0.43 cnf(c41, plain, % 0.09/0.43 reproducibility(X15,X11,X13)). % 0.09/0.43 cnf(a35, assumption, % 0.09/0.43 X7 = X15). % 0.09/0.43 cnf(a36, assumption, % 0.09/0.43 X5 = X11). % 0.09/0.43 cnf(a37, assumption, % 0.09/0.43 X8 = X13). % 0.09/0.43 cnf(c42, plain, % 0.09/0.43 ~reproducibility(X9,X6,X10) | ~reorganization_free(X9,X10,X10) | ~organization(X7,X8) | ~organization(X9,X10), % 0.09/0.43 inference(predicate_reduction, [assumptions([a35, a36, a37])], [c39, c41])). % 0.09/0.43 % 0.09/0.43 cnf(c43, plain, % 0.09/0.43 reproducibility(X15,X12,X14)). % 0.09/0.43 cnf(a38, assumption, % 0.09/0.43 X9 = X15). % 0.09/0.43 cnf(a39, assumption, % 0.09/0.43 X6 = X12). % 0.09/0.43 cnf(a40, assumption, % 0.09/0.43 X10 = X14). % 0.09/0.43 cnf(c44, plain, % 0.09/0.43 ~reorganization_free(X9,X10,X10) | ~organization(X7,X8) | ~organization(X9,X10), % 0.09/0.43 inference(predicate_reduction, [assumptions([a38, a39, a40])], [c42, c43])). % 0.09/0.43 % 0.09/0.43 cnf(c45, axiom, % 0.09/0.43 reorganization_free(X20,X21,X21) | ~reorganization_free(X20,X21,X22)). % 0.09/0.43 cnf(a41, assumption, % 0.09/0.43 X9 = X20). % 0.09/0.43 cnf(a42, assumption, % 0.09/0.43 X10 = X21). % 0.09/0.43 cnf(a43, assumption, % 0.09/0.43 X10 = X21). % 0.09/0.43 cnf(c46, plain, % 0.09/0.43 ~organization(X7,X8) | ~organization(X9,X10), % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a41, a42, a43])], [c44, c45])). % 0.09/0.43 cnf(c47, plain, % 0.09/0.43 ~reorganization_free(X20,X21,X22), % 0.09/0.43 inference(strict_predicate_extension, [assumptions([a41, a42, a43])], [c44, c45])). % 0.09/0.43 % 0.09/0.43 cnf(c48, plain, % 0.09/0.43 reorganization_free(sK1,sK4,sK5)). % 0.09/0.43 cnf(a44, assumption, % 0.09/0.43 X20 = sK1). % 0.09/0.43 cnf(a45, assumption, % 0.09/0.43 X21 = sK4). % 0.09/0.43 cnf(a46, assumption, % 0.09/0.43 X22 = sK5). % 0.09/0.43 cnf(c49, plain, % 0.09/0.43 $false, % 0.09/0.43 inference(predicate_reduction, [assumptions([a44, a45, a46])], [c47, c48])). % 0.09/0.43 % 0.09/0.43 cnf(c50, plain, % 0.09/0.43 organization(X16,X17)). % 0.09/0.43 cnf(a47, assumption, % 0.09/0.43 X7 = X16). % 0.09/0.43 cnf(a48, assumption, % 0.09/0.43 X8 = X17). % 0.09/0.43 cnf(c51, plain, % 0.09/0.43 ~organization(X9,X10), % 0.09/0.43 inference(predicate_reduction, [assumptions([a47, a48])], [c46, c50])). % 0.09/0.43 % 0.09/0.43 cnf(c52, plain, % 0.09/0.43 organization(X18,X19)). % 0.09/0.43 cnf(a49, assumption, % 0.09/0.43 X9 = X18). % 0.09/0.43 cnf(a50, assumption, % 0.09/0.43 X10 = X19). % 0.09/0.43 cnf(c53, plain, % 0.09/0.43 $false, % 0.09/0.43 inference(predicate_reduction, [assumptions([a49, a50])], [c51, c52])). % 0.09/0.43 % 0.09/0.43 cnf(c54, plain, % 0.09/0.43 $false, % 0.09/0.43 inference(constraint_solving, [ % 0.09/0.43 bind(X0, sK1), % 0.09/0.43 bind(X1, sK5), % 0.09/0.43 bind(X2, sK4), % 0.09/0.43 bind(X3, sK3), % 0.09/0.43 bind(X4, sK2), % 0.09/0.43 bind(X5, sK0(X16,X17)), % 0.09/0.43 bind(X6, sK0(X18,X19)), % 0.09/0.43 bind(X7, sK1), % 0.09/0.43 bind(X8, sK5), % 0.09/0.43 bind(X9, sK1), % 0.09/0.43 bind(X10, sK4), % 0.09/0.43 bind(X11, sK0(X16,X17)), % 0.09/0.43 bind(X12, sK0(X18,X19)), % 0.09/0.43 bind(X13, sK5), % 0.09/0.43 bind(X14, sK4), % 0.09/0.43 bind(X15, sK1), % 0.09/0.43 bind(X16, sK1), % 0.09/0.43 bind(X17, sK5), % 0.09/0.43 bind(X18, sK1), % 0.09/0.43 bind(X19, sK4), % 0.09/0.43 bind(X20, sK1), % 0.09/0.43 bind(X21, sK4), % 0.09/0.43 bind(X22, sK5) % 0.09/0.43 ], % 0.09/0.43 [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.09/0.43 % 0.09/0.43 % SZS output end IncompleteProof %------------------------------------------------------------------------------