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