TSTP Solution File: MGT003-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : MGT003-1 : TPTP v8.1.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 : n032.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:16:23 EDT 2022
% Result : Unsatisfiable 0.10s 0.31s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : MGT003-1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.10 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Thu Jun 9 07:31:07 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.10/0.31 % SZS status Unsatisfiable
% 0.10/0.31 % SZS output begin IncompleteProof
% 0.10/0.31 cnf(c0, axiom,
% 0.10/0.31 reorganization_free(sk2,sk5,sk6)).
% 0.10/0.31 cnf(c1, plain,
% 0.10/0.31 reorganization_free(sk2,sk5,sk6),
% 0.10/0.31 inference(start, [], [c0])).
% 0.10/0.31
% 0.10/0.31 cnf(c2, axiom,
% 0.10/0.31 reorganization_free(X0,X1,X1) | ~reorganization_free(X0,X1,X2)).
% 0.10/0.31 cnf(a0, assumption,
% 0.10/0.31 sk2 = X0).
% 0.10/0.31 cnf(a1, assumption,
% 0.10/0.31 sk5 = X1).
% 0.10/0.31 cnf(a2, assumption,
% 0.10/0.31 sk6 = X2).
% 0.10/0.31 cnf(c3, plain,
% 0.10/0.31 $false,
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.10/0.31 cnf(c4, plain,
% 0.10/0.31 reorganization_free(X0,X1,X1),
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.10/0.31
% 0.10/0.31 cnf(c5, axiom,
% 0.10/0.31 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.31 cnf(a3, assumption,
% 0.10/0.31 X0 = X9).
% 0.10/0.31 cnf(a4, assumption,
% 0.10/0.31 X1 = X10).
% 0.10/0.31 cnf(a5, assumption,
% 0.10/0.31 X1 = X10).
% 0.10/0.31 cnf(c6, plain,
% 0.10/0.31 $false,
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.10/0.31 cnf(c7, plain,
% 0.10/0.31 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.31 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.10/0.31
% 0.10/0.31 cnf(c8, axiom,
% 0.10/0.31 ~greater(sk4,sk3)).
% 0.10/0.31 cnf(a6, assumption,
% 0.10/0.31 X3 = sk4).
% 0.10/0.31 cnf(a7, assumption,
% 0.10/0.31 X4 = sk3).
% 0.10/0.31 cnf(c9, plain,
% 0.10/0.31 ~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.31 inference(strict_predicate_extension, [assumptions([a6, a7])], [c7, c8])).
% 0.10/0.31 cnf(c10, plain,
% 0.10/0.31 $false,
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a6, a7])], [c7, c8])).
% 0.10/0.31
% 0.10/0.31 cnf(c11, axiom,
% 0.10/0.31 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.31 cnf(a8, assumption,
% 0.10/0.31 X5 = X11).
% 0.10/0.31 cnf(a9, assumption,
% 0.10/0.31 X6 = X12).
% 0.10/0.31 cnf(c12, plain,
% 0.10/0.31 ~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.31 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c11])).
% 0.10/0.31 cnf(c13, plain,
% 0.10/0.31 ~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.31 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c11])).
% 0.10/0.31
% 0.10/0.31 cnf(c14, axiom,
% 0.10/0.31 greater(sk6,sk5)).
% 0.10/0.31 cnf(a10, assumption,
% 0.10/0.31 X13 = sk6).
% 0.10/0.31 cnf(a11, assumption,
% 0.10/0.31 X14 = sk5).
% 0.10/0.31 cnf(c15, plain,
% 0.10/0.31 ~inertia(X15,X11,X13) | ~inertia(X15,X12,X14) | ~reorganization_free(X15,X14,X13) | ~organization(X15,X13) | ~organization(X15,X14),
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a10, a11])], [c13, c14])).
% 0.10/0.31 cnf(c16, plain,
% 0.10/0.31 $false,
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a10, a11])], [c13, c14])).
% 0.10/0.31
% 0.10/0.31 cnf(c17, axiom,
% 0.10/0.31 inertia(X16,sk1(X17,X16),X17) | ~organization(X16,X17)).
% 0.10/0.31 cnf(a12, assumption,
% 0.10/0.31 X15 = X16).
% 0.10/0.31 cnf(a13, assumption,
% 0.10/0.31 X11 = sk1(X17,X16)).
% 0.10/0.31 cnf(a14, assumption,
% 0.10/0.31 X13 = X17).
% 0.10/0.31 cnf(c18, plain,
% 0.10/0.31 ~inertia(X15,X12,X14) | ~reorganization_free(X15,X14,X13) | ~organization(X15,X13) | ~organization(X15,X14),
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c15, c17])).
% 0.10/0.31 cnf(c19, plain,
% 0.10/0.31 ~organization(X16,X17),
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c15, c17])).
% 0.10/0.31
% 0.10/0.31 cnf(c20, axiom,
% 0.10/0.31 organization(sk2,sk6)).
% 0.10/0.31 cnf(a15, assumption,
% 0.10/0.31 X16 = sk2).
% 0.10/0.31 cnf(a16, assumption,
% 0.10/0.31 X17 = sk6).
% 0.10/0.31 cnf(c21, plain,
% 0.10/0.31 $false,
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a15, a16])], [c19, c20])).
% 0.10/0.31 cnf(c22, plain,
% 0.10/0.31 $false,
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a15, a16])], [c19, c20])).
% 0.10/0.31
% 0.10/0.31 cnf(c23, axiom,
% 0.10/0.31 inertia(X18,sk1(X19,X18),X19) | ~organization(X18,X19)).
% 0.10/0.31 cnf(a17, assumption,
% 0.10/0.31 X15 = X18).
% 0.10/0.31 cnf(a18, assumption,
% 0.10/0.31 X12 = sk1(X19,X18)).
% 0.10/0.31 cnf(a19, assumption,
% 0.10/0.31 X14 = X19).
% 0.10/0.31 cnf(c24, plain,
% 0.10/0.31 ~reorganization_free(X15,X14,X13) | ~organization(X15,X13) | ~organization(X15,X14),
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a17, a18, a19])], [c18, c23])).
% 0.10/0.31 cnf(c25, plain,
% 0.10/0.31 ~organization(X18,X19),
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a17, a18, a19])], [c18, c23])).
% 0.10/0.31
% 0.10/0.31 cnf(c26, axiom,
% 0.10/0.31 organization(sk2,sk5)).
% 0.10/0.31 cnf(a20, assumption,
% 0.10/0.31 X18 = sk2).
% 0.10/0.31 cnf(a21, assumption,
% 0.10/0.31 X19 = sk5).
% 0.10/0.31 cnf(c27, plain,
% 0.10/0.31 $false,
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a20, a21])], [c25, c26])).
% 0.10/0.31 cnf(c28, plain,
% 0.10/0.31 $false,
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a20, a21])], [c25, c26])).
% 0.10/0.31
% 0.10/0.31 cnf(c29, plain,
% 0.10/0.31 reorganization_free(sk2,sk5,sk6)).
% 0.10/0.31 cnf(a22, assumption,
% 0.10/0.31 X15 = sk2).
% 0.10/0.31 cnf(a23, assumption,
% 0.10/0.31 X14 = sk5).
% 0.10/0.31 cnf(a24, assumption,
% 0.10/0.31 X13 = sk6).
% 0.10/0.31 cnf(c30, plain,
% 0.10/0.31 ~organization(X15,X13) | ~organization(X15,X14),
% 0.10/0.31 inference(predicate_reduction, [assumptions([a22, a23, a24])], [c24, c29])).
% 0.10/0.31
% 0.10/0.31 cnf(c31, plain,
% 0.10/0.31 organization(X16,X17)).
% 0.10/0.31 cnf(a25, assumption,
% 0.10/0.31 X15 = X16).
% 0.10/0.31 cnf(a26, assumption,
% 0.10/0.31 X13 = X17).
% 0.10/0.31 cnf(c32, plain,
% 0.10/0.31 ~organization(X15,X14),
% 0.10/0.31 inference(predicate_reduction, [assumptions([a25, a26])], [c30, c31])).
% 0.10/0.31
% 0.10/0.31 cnf(c33, plain,
% 0.10/0.31 organization(X18,X19)).
% 0.10/0.31 cnf(a27, assumption,
% 0.10/0.31 X15 = X18).
% 0.10/0.31 cnf(a28, assumption,
% 0.10/0.31 X14 = X19).
% 0.10/0.31 cnf(c34, plain,
% 0.10/0.31 $false,
% 0.10/0.31 inference(predicate_reduction, [assumptions([a27, a28])], [c32, c33])).
% 0.10/0.31
% 0.10/0.31 cnf(c35, axiom,
% 0.10/0.31 survival_chance(sk2,sk4,sk6)).
% 0.10/0.31 cnf(a29, assumption,
% 0.10/0.31 X7 = sk2).
% 0.10/0.31 cnf(a30, assumption,
% 0.10/0.31 X3 = sk4).
% 0.10/0.31 cnf(a31, assumption,
% 0.10/0.31 X8 = sk6).
% 0.10/0.31 cnf(c36, plain,
% 0.10/0.31 ~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.31 inference(strict_predicate_extension, [assumptions([a29, a30, a31])], [c12, c35])).
% 0.10/0.31 cnf(c37, plain,
% 0.10/0.31 $false,
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a29, a30, a31])], [c12, c35])).
% 0.10/0.31
% 0.10/0.31 cnf(c38, axiom,
% 0.10/0.31 survival_chance(sk2,sk3,sk5)).
% 0.10/0.31 cnf(a32, assumption,
% 0.10/0.31 X9 = sk2).
% 0.10/0.31 cnf(a33, assumption,
% 0.10/0.31 X4 = sk3).
% 0.10/0.31 cnf(a34, assumption,
% 0.10/0.31 X10 = sk5).
% 0.10/0.31 cnf(c39, plain,
% 0.10/0.31 ~inertia(X7,X5,X8) | ~inertia(X9,X6,X10) | ~reorganization_free(X7,X8,X8) | ~organization(X7,X8) | ~organization(X9,X10),
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a32, a33, a34])], [c36, c38])).
% 0.10/0.31 cnf(c40, plain,
% 0.10/0.31 $false,
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a32, a33, a34])], [c36, c38])).
% 0.10/0.31
% 0.10/0.31 cnf(c41, plain,
% 0.10/0.31 inertia(X15,X11,X13)).
% 0.10/0.31 cnf(a35, assumption,
% 0.10/0.31 X7 = X15).
% 0.10/0.31 cnf(a36, assumption,
% 0.10/0.31 X5 = X11).
% 0.10/0.31 cnf(a37, assumption,
% 0.10/0.31 X8 = X13).
% 0.10/0.31 cnf(c42, plain,
% 0.10/0.31 ~inertia(X9,X6,X10) | ~reorganization_free(X7,X8,X8) | ~organization(X7,X8) | ~organization(X9,X10),
% 0.10/0.31 inference(predicate_reduction, [assumptions([a35, a36, a37])], [c39, c41])).
% 0.10/0.31
% 0.10/0.31 cnf(c43, plain,
% 0.10/0.31 inertia(X15,X12,X14)).
% 0.10/0.31 cnf(a38, assumption,
% 0.10/0.31 X9 = X15).
% 0.10/0.31 cnf(a39, assumption,
% 0.10/0.31 X6 = X12).
% 0.10/0.31 cnf(a40, assumption,
% 0.10/0.31 X10 = X14).
% 0.10/0.31 cnf(c44, plain,
% 0.10/0.31 ~reorganization_free(X7,X8,X8) | ~organization(X7,X8) | ~organization(X9,X10),
% 0.10/0.31 inference(predicate_reduction, [assumptions([a38, a39, a40])], [c42, c43])).
% 0.10/0.31
% 0.10/0.31 cnf(c45, axiom,
% 0.10/0.31 reorganization_free(X20,X21,X21) | ~reorganization_free(X20,X22,X21)).
% 0.10/0.31 cnf(a41, assumption,
% 0.10/0.31 X7 = X20).
% 0.10/0.31 cnf(a42, assumption,
% 0.10/0.31 X8 = X21).
% 0.10/0.31 cnf(a43, assumption,
% 0.10/0.31 X8 = X21).
% 0.10/0.31 cnf(c46, plain,
% 0.10/0.31 ~organization(X7,X8) | ~organization(X9,X10),
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a41, a42, a43])], [c44, c45])).
% 0.10/0.31 cnf(c47, plain,
% 0.10/0.31 ~reorganization_free(X20,X22,X21),
% 0.10/0.31 inference(strict_predicate_extension, [assumptions([a41, a42, a43])], [c44, c45])).
% 0.10/0.31
% 0.10/0.31 cnf(c48, plain,
% 0.10/0.31 reorganization_free(sk2,sk5,sk6)).
% 0.10/0.31 cnf(a44, assumption,
% 0.10/0.31 X20 = sk2).
% 0.10/0.31 cnf(a45, assumption,
% 0.10/0.31 X22 = sk5).
% 0.10/0.31 cnf(a46, assumption,
% 0.10/0.31 X21 = sk6).
% 0.10/0.31 cnf(c49, plain,
% 0.10/0.31 $false,
% 0.10/0.31 inference(predicate_reduction, [assumptions([a44, a45, a46])], [c47, c48])).
% 0.10/0.31
% 0.10/0.31 cnf(c50, plain,
% 0.10/0.31 organization(X16,X17)).
% 0.10/0.31 cnf(a47, assumption,
% 0.10/0.31 X7 = X16).
% 0.10/0.31 cnf(a48, assumption,
% 0.10/0.31 X8 = X17).
% 0.10/0.31 cnf(c51, plain,
% 0.10/0.31 ~organization(X9,X10),
% 0.10/0.31 inference(predicate_reduction, [assumptions([a47, a48])], [c46, c50])).
% 0.10/0.31
% 0.10/0.31 cnf(c52, plain,
% 0.10/0.31 organization(X18,X19)).
% 0.10/0.31 cnf(a49, assumption,
% 0.10/0.31 X9 = X18).
% 0.10/0.31 cnf(a50, assumption,
% 0.10/0.31 X10 = X19).
% 0.10/0.31 cnf(c53, plain,
% 0.10/0.31 $false,
% 0.10/0.31 inference(predicate_reduction, [assumptions([a49, a50])], [c51, c52])).
% 0.10/0.31
% 0.10/0.31 cnf(c54, plain,
% 0.10/0.31 $false,
% 0.10/0.31 inference(constraint_solving, [
% 0.10/0.31 bind(X0, sk2),
% 0.10/0.31 bind(X1, sk5),
% 0.10/0.31 bind(X2, sk6),
% 0.10/0.31 bind(X3, sk4),
% 0.10/0.31 bind(X4, sk3),
% 0.10/0.31 bind(X5, sk1(X17,X16)),
% 0.10/0.31 bind(X6, sk1(X19,X18)),
% 0.10/0.31 bind(X7, sk2),
% 0.10/0.31 bind(X8, sk6),
% 0.10/0.31 bind(X9, sk2),
% 0.10/0.31 bind(X10, sk5),
% 0.10/0.31 bind(X11, sk1(X17,X16)),
% 0.10/0.31 bind(X12, sk1(X19,X18)),
% 0.10/0.31 bind(X13, sk6),
% 0.10/0.31 bind(X14, sk5),
% 0.10/0.31 bind(X15, sk2),
% 0.10/0.31 bind(X16, sk2),
% 0.10/0.31 bind(X17, sk6),
% 0.10/0.31 bind(X18, sk2),
% 0.10/0.31 bind(X19, sk5),
% 0.10/0.31 bind(X20, sk2),
% 0.10/0.31 bind(X21, sk6),
% 0.10/0.31 bind(X22, sk5)
% 0.10/0.31 ],
% 0.10/0.31 [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.31
% 0.10/0.31 % SZS output end IncompleteProof
%------------------------------------------------------------------------------