%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT052+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 : n003.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:21 AM UTC 2026 % Result : Theorem 0.10s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT052+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.36 % Computer : n003.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Mon Sep 7 13:22:24 UTC 2026 % 0.10/0.36 % CPUTime : % 0.10/0.37 % SZS status Theorem % 0.10/0.37 % SZS output begin IncompleteProof % 0.10/0.37 cnf(c0, axiom, % 0.10/0.37 dissimilar(sK1,sK2,sK2)). % 0.10/0.37 cnf(c1, plain, % 0.10/0.37 dissimilar(sK1,sK2,sK2), % 0.10/0.37 inference(start, [], [c0])). % 0.10/0.37 % 0.10/0.37 cnf(c2, axiom, % 0.10/0.37 sP0(X0,X1,X2) | ~dissimilar(X1,X2,X0)). % 0.10/0.37 cnf(a0, assumption, % 0.10/0.37 sK1 = X1). % 0.10/0.37 cnf(a1, assumption, % 0.10/0.37 sK2 = X2). % 0.10/0.37 cnf(a2, assumption, % 0.10/0.37 sK2 = X0). % 0.10/0.37 cnf(c3, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.10/0.37 cnf(c4, plain, % 0.10/0.37 sP0(X0,X1,X2), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.10/0.37 % 0.10/0.37 cnf(c5, axiom, % 0.10/0.37 ~is_aligned(X3,X4) | ~is_aligned(X3,X5) | ~sP0(X4,X3,X5)). % 0.10/0.37 cnf(a3, assumption, % 0.10/0.37 X0 = X4). % 0.10/0.37 cnf(a4, assumption, % 0.10/0.37 X1 = X3). % 0.10/0.37 cnf(a5, assumption, % 0.10/0.37 X2 = X5). % 0.10/0.37 cnf(c6, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.10/0.37 cnf(c7, plain, % 0.10/0.37 ~is_aligned(X3,X4) | ~is_aligned(X3,X5), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.10/0.37 % 0.10/0.37 cnf(c8, axiom, % 0.10/0.37 is_aligned(X6,X7) | is_aligned(X6,X8) | ~sP0(X7,X6,X8)). % 0.10/0.37 cnf(a6, assumption, % 0.10/0.37 X3 = X6). % 0.10/0.37 cnf(a7, assumption, % 0.10/0.37 X4 = X8). % 0.10/0.37 cnf(c9, plain, % 0.10/0.37 ~is_aligned(X3,X5), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a6, a7])], [c7, c8])). % 0.10/0.37 cnf(c10, plain, % 0.10/0.37 is_aligned(X6,X7) | ~sP0(X7,X6,X8), % 0.10/0.37 inference(strict_predicate_extension, [assumptions([a6, a7])], [c7, c8])). % 0.10/0.37 % 0.10/0.37 cnf(c11, plain, % 0.10/0.37 ~is_aligned(X3,X4)). % 0.10/0.37 cnf(a8, assumption, % 0.10/0.37 X6 = X3). % 0.10/0.37 cnf(a9, assumption, % 0.10/0.37 X7 = X4). % 0.10/0.37 cnf(c12, plain, % 0.10/0.37 ~sP0(X7,X6,X8), % 0.10/0.37 inference(predicate_reduction, [assumptions([a8, a9])], [c10, c11])). % 0.10/0.37 % 0.10/0.37 cnf(c13, plain, % 0.10/0.37 sP0(X0,X1,X2)). % 0.10/0.37 cnf(a10, assumption, % 0.10/0.37 X7 = X0). % 0.10/0.37 cnf(a11, assumption, % 0.10/0.37 X6 = X1). % 0.10/0.37 cnf(a12, assumption, % 0.10/0.37 X8 = X2). % 0.10/0.37 cnf(c14, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(predicate_reduction, [assumptions([a10, a11, a12])], [c12, c13])). % 0.10/0.37 % 0.10/0.37 cnf(c15, plain, % 0.10/0.37 is_aligned(X3,X4)). % 0.10/0.37 cnf(a13, assumption, % 0.10/0.37 X3 = X3). % 0.10/0.37 cnf(a14, assumption, % 0.10/0.37 X5 = X4). % 0.10/0.37 cnf(c16, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(predicate_reduction, [assumptions([a13, a14])], [c9, c15])). % 0.10/0.37 % 0.10/0.37 cnf(c17, plain, % 0.10/0.37 $false, % 0.10/0.37 inference(constraint_solving, [ % 0.10/0.37 bind(X0, sK2), % 0.10/0.37 bind(X1, sK1), % 0.10/0.37 bind(X2, sK2), % 0.10/0.37 bind(X3, sK1), % 0.10/0.37 bind(X4, sK2), % 0.10/0.37 bind(X5, sK2), % 0.10/0.37 bind(X6, sK1), % 0.10/0.37 bind(X7, sK2), % 0.10/0.37 bind(X8, sK2) % 0.10/0.37 ], % 0.10/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])). % 0.10/0.37 % 0.10/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------