%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT045+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 : n006.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.09s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT045+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.09/0.35 % Computer : n006.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Mon Sep 7 13:08:31 UTC 2026 % 0.09/0.36 % CPUTime : % 0.09/0.37 % SZS status Theorem % 0.09/0.37 % SZS output begin IncompleteProof % 0.09/0.37 cnf(c0, axiom, % 0.09/0.37 organization(sK0)). % 0.09/0.37 cnf(c1, plain, % 0.09/0.37 organization(sK0), % 0.09/0.37 inference(start, [], [c0])). % 0.09/0.37 % 0.09/0.37 cnf(c2, axiom, % 0.09/0.37 greater(position(X0,X1),position(X0,X2)) | ~greater(external_ties(X0,X1),external_ties(X0,X2)) | ~organization(X0)). % 0.09/0.37 cnf(a0, assumption, % 0.09/0.37 sK0 = X0). % 0.09/0.37 cnf(c3, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.09/0.37 cnf(c4, plain, % 0.09/0.37 greater(position(X0,X1),position(X0,X2)) | ~greater(external_ties(X0,X1),external_ties(X0,X2)), % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.09/0.37 % 0.09/0.37 cnf(c5, axiom, % 0.09/0.37 ~greater(position(sK0,sK2),position(sK0,sK1))). % 0.09/0.37 cnf(a1, assumption, % 0.09/0.37 position(X0,X1) = position(sK0,sK2)). % 0.09/0.37 cnf(a2, assumption, % 0.09/0.37 position(X0,X2) = position(sK0,sK1)). % 0.09/0.37 cnf(c6, plain, % 0.09/0.37 ~greater(external_ties(X0,X1),external_ties(X0,X2)), % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 0.09/0.37 cnf(c7, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 0.09/0.37 % 0.09/0.37 cnf(c8, axiom, % 0.09/0.37 greater(external_ties(X3,X4),external_ties(X3,X5)) | ~greater(age(X3,X4),age(X3,X5)) | ~organization(X3)). % 0.09/0.37 cnf(a3, assumption, % 0.09/0.37 external_ties(X0,X1) = external_ties(X3,X4)). % 0.09/0.37 cnf(a4, assumption, % 0.09/0.37 external_ties(X0,X2) = external_ties(X3,X5)). % 0.09/0.37 cnf(c9, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])). % 0.09/0.37 cnf(c10, plain, % 0.09/0.37 ~greater(age(X3,X4),age(X3,X5)) | ~organization(X3), % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])). % 0.09/0.37 % 0.09/0.37 cnf(c11, axiom, % 0.09/0.37 greater(age(sK0,sK2),age(sK0,sK1))). % 0.09/0.37 cnf(a5, assumption, % 0.09/0.37 age(X3,X4) = age(sK0,sK2)). % 0.09/0.37 cnf(a6, assumption, % 0.09/0.37 age(X3,X5) = age(sK0,sK1)). % 0.09/0.37 cnf(c12, plain, % 0.09/0.37 ~organization(X3), % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 0.09/0.37 cnf(c13, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 0.09/0.37 % 0.09/0.37 cnf(c14, plain, % 0.09/0.37 organization(sK0)). % 0.09/0.37 cnf(a7, assumption, % 0.09/0.37 X3 = sK0). % 0.09/0.37 cnf(c15, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(predicate_reduction, [assumptions([a7])], [c12, c14])). % 0.09/0.37 % 0.09/0.37 cnf(c16, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(constraint_solving, [ % 0.09/0.37 bind(X0, sK0), % 0.09/0.37 bind(X1, sK2), % 0.09/0.37 bind(X2, sK1), % 0.09/0.37 bind(X3, sK0), % 0.09/0.37 bind(X4, sK2), % 0.09/0.37 bind(X5, sK1) % 0.09/0.37 ], % 0.09/0.37 [a0, a1, a2, a3, a4, a5, a6, a7])). % 0.09/0.37 % 0.09/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------