%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT048+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 : n002.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:20 AM UTC 2026 % Result : Theorem 0.87s 0.55s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT048+1 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.03 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.08/0.34 % Computer : n002.cluster.edu % 0.08/0.34 % Model : x86_64 x86_64 % 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.34 % Memory : 8046.5625MB % 0.08/0.34 % OS : Linux 6.8.0-71-generic % 0.08/0.34 % CPULimit : 300 % 0.08/0.34 % WCLimit : 300 % 0.08/0.34 % DateTime : Mon Sep 7 13:16:37 UTC 2026 % 0.08/0.35 % CPUTime : % 0.87/0.55 % SZS status Theorem % 0.87/0.55 % SZS output begin IncompleteProof % 0.87/0.55 cnf(c0, axiom, % 0.87/0.55 organization(sK1)). % 0.87/0.55 cnf(c1, plain, % 0.87/0.55 organization(sK1), % 0.87/0.55 inference(start, [], [c0])). % 0.87/0.55 % 0.87/0.55 cnf(c2, axiom, % 0.87/0.55 stock_of_knowledge(X0,X1) = stock_of_knowledge(X0,X2) | ~organization(X0)). % 0.87/0.55 cnf(a0, assumption, % 0.87/0.55 sK1 = X0). % 0.87/0.55 cnf(c3, plain, % 0.87/0.55 $false, % 0.87/0.55 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.87/0.55 cnf(c4, plain, % 0.87/0.55 stock_of_knowledge(X0,X1) = stock_of_knowledge(X0,X2), % 0.87/0.55 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.87/0.55 % 0.87/0.55 cnf(c5, axiom, % 0.87/0.55 smaller(capability(X3,X4),capability(X3,X5)) | ~greater(internal_friction(X3,X4),internal_friction(X3,X5)) | ~smaller_or_equal(stock_of_knowledge(X3,X4),stock_of_knowledge(X3,X5)) | ~sP0(X5,X3,X4)). % 0.87/0.55 cnf(a1, assumption, % 0.87/0.55 stock_of_knowledge(X3,X5) = stock_of_knowledge(X0,X1)). % 0.87/0.55 cnf(a2, assumption, % 0.87/0.55 stock_of_knowledge(X0,X2) = X6). % 0.87/0.55 cnf(c6, plain, % 0.87/0.55 $false, % 0.87/0.55 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])). % 0.87/0.55 cnf(c7, plain, % 0.87/0.55 smaller(capability(X3,X4),capability(X3,X5)) | ~greater(internal_friction(X3,X4),internal_friction(X3,X5)) | ~sP0(X5,X3,X4), % 0.87/0.55 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])). % 0.87/0.55 cnf(c8, plain, % 0.87/0.55 ~smaller_or_equal(stock_of_knowledge(X3,X4),X6), % 0.87/0.55 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])). % 0.87/0.55 % 0.87/0.55 cnf(c9, axiom, % 0.87/0.55 smaller_or_equal(X7,X7)). % 0.87/0.55 cnf(a3, assumption, % 0.87/0.55 stock_of_knowledge(X3,X4) = X7). % 0.87/0.55 cnf(a4, assumption, % 0.87/0.55 X6 = X7). % 0.87/0.55 cnf(c10, plain, % 0.87/0.55 $false, % 0.87/0.55 inference(strict_predicate_extension, [assumptions([a3, a4])], [c8, c9])). % 0.87/0.55 cnf(c11, plain, % 0.87/0.55 $false, % 0.87/0.55 inference(strict_predicate_extension, [assumptions([a3, a4])], [c8, c9])). % 0.87/0.55 % 0.87/0.55 cnf(c12, axiom, % 0.87/0.55 ~smaller(capability(sK1,sK3),capability(sK1,sK2))). % 0.87/0.55 cnf(a5, assumption, % 0.87/0.55 capability(X3,X4) = capability(sK1,sK3)). % 0.87/0.55 cnf(a6, assumption, % 0.87/0.55 capability(X3,X5) = capability(sK1,sK2)). % 0.87/0.55 cnf(c13, plain, % 0.87/0.55 ~greater(internal_friction(X3,X4),internal_friction(X3,X5)) | ~sP0(X5,X3,X4), % 0.87/0.55 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c12])). % 0.87/0.55 cnf(c14, plain, % 0.87/0.55 $false, % 0.87/0.55 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c12])). % 0.87/0.55 % 0.87/0.55 cnf(c15, axiom, % 0.87/0.55 greater(internal_friction(X8,X9),internal_friction(X8,X10)) | ~greater(age(X8,X9),age(X8,X10)) | ~organization(X8)). % 0.87/0.55 cnf(a7, assumption, % 0.87/0.55 internal_friction(X3,X4) = internal_friction(X8,X9)). % 0.87/0.55 cnf(a8, assumption, % 0.87/0.55 internal_friction(X3,X5) = internal_friction(X8,X10)). % 0.87/0.55 cnf(c16, plain, % 0.87/0.55 ~sP0(X5,X3,X4), % 0.87/0.55 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c15])). % 0.87/0.55 cnf(c17, plain, % 0.87/0.55 ~greater(age(X8,X9),age(X8,X10)) | ~organization(X8), % 0.87/0.55 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c15])). % 0.87/0.55 % 0.87/0.55 cnf(c18, axiom, % 0.87/0.55 greater(age(sK1,sK3),age(sK1,sK2))). % 0.87/0.55 cnf(a9, assumption, % 0.87/0.55 age(X8,X9) = age(sK1,sK3)). % 0.87/0.55 cnf(a10, assumption, % 0.87/0.55 age(X8,X10) = age(sK1,sK2)). % 0.87/0.55 cnf(c19, plain, % 0.87/0.55 ~organization(X8), % 0.87/0.55 inference(strict_predicate_extension, [assumptions([a9, a10])], [c17, c18])). % 0.87/0.55 cnf(c20, plain, % 0.87/0.55 $false, % 0.87/0.55 inference(strict_predicate_extension, [assumptions([a9, a10])], [c17, c18])). % 0.87/0.55 % 0.87/0.55 cnf(c21, plain, % 0.87/0.55 organization(sK1)). % 0.87/0.55 cnf(a11, assumption, % 0.87/0.55 X8 = sK1). % 0.87/0.55 cnf(c22, plain, % 0.87/0.55 $false, % 0.87/0.55 inference(predicate_reduction, [assumptions([a11])], [c19, c21])). % 0.87/0.55 % 0.87/0.55 cnf(c23, axiom, % 0.87/0.55 sP0(X11,X12,X13) | ~organization(X12)). % 0.87/0.55 cnf(a12, assumption, % 0.87/0.55 X5 = X11). % 0.87/0.55 cnf(a13, assumption, % 0.87/0.55 X3 = X12). % 0.87/0.55 cnf(a14, assumption, % 0.87/0.55 X4 = X13). % 0.87/0.55 cnf(c24, plain, % 0.87/0.55 $false, % 0.87/0.55 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c16, c23])). % 0.87/0.55 cnf(c25, plain, % 0.87/0.55 ~organization(X12), % 0.87/0.55 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c16, c23])). % 0.87/0.55 % 0.87/0.55 cnf(c26, plain, % 0.87/0.55 organization(sK1)). % 0.87/0.55 cnf(a15, assumption, % 0.87/0.55 X12 = sK1). % 0.87/0.55 cnf(c27, plain, % 0.87/0.55 $false, % 0.87/0.55 inference(predicate_reduction, [assumptions([a15])], [c25, c26])). % 0.87/0.55 % 0.87/0.55 cnf(c28, plain, % 0.87/0.55 $false, % 0.87/0.55 inference(constraint_solving, [ % 0.87/0.55 bind(X0, sK1), % 0.87/0.55 bind(X1, sK2), % 0.87/0.55 bind(X2, sK3), % 0.87/0.55 bind(X3, sK1), % 0.87/0.55 bind(X4, sK3), % 0.87/0.55 bind(X5, sK2), % 0.87/0.55 bind(X6, stock_of_knowledge(X0,X2)), % 0.87/0.55 bind(X7, stock_of_knowledge(X3,X4)), % 0.87/0.55 bind(X8, sK1), % 0.87/0.55 bind(X9, sK3), % 0.87/0.55 bind(X10, sK2), % 0.87/0.55 bind(X11, sK2), % 0.87/0.55 bind(X12, sK1), % 0.87/0.55 bind(X13, sK3) % 0.87/0.55 ], % 0.87/0.55 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 0.87/0.55 % 0.87/0.55 % SZS output end IncompleteProof %------------------------------------------------------------------------------