%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT071+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n013.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:22 AM UTC 2026 % Result : Theorem 0.08s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT071+1 : TPTP v9.3.0. Released v9.3.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.35 % Computer : n013.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Mon Sep 7 13:54:05 UTC 2026 % 0.08/0.36 % CPUTime : % 0.08/0.37 % SZS status Theorem % 0.08/0.37 % SZS output begin IncompleteProof % 0.08/0.37 cnf(c0, axiom, % 0.08/0.37 in_closed(sK3,n0,n5)). % 0.08/0.37 cnf(c1, plain, % 0.08/0.37 in_closed(sK3,n0,n5), % 0.08/0.37 inference(start, [], [c0])). % 0.08/0.37 % 0.08/0.37 cnf(c2, axiom, % 0.08/0.37 ~in_closed(X0,X1,X2) | ~in_closed(X0,X3,X4) | ~axis_conflict(X3,X4,X1,X2)). % 0.08/0.37 cnf(a0, assumption, % 0.08/0.37 sK3 = X0). % 0.08/0.37 cnf(a1, assumption, % 0.08/0.37 n0 = X3). % 0.08/0.37 cnf(a2, assumption, % 0.08/0.37 n5 = X4). % 0.08/0.37 cnf(c3, plain, % 0.08/0.37 $false, % 0.08/0.37 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.08/0.37 cnf(c4, plain, % 0.08/0.37 ~in_closed(X0,X1,X2) | ~axis_conflict(X3,X4,X1,X2), % 0.08/0.37 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.08/0.37 % 0.08/0.37 cnf(c5, axiom, % 0.08/0.37 in_closed(sK3,n10,n15)). % 0.08/0.37 cnf(a3, assumption, % 0.08/0.37 X0 = sK3). % 0.08/0.37 cnf(a4, assumption, % 0.08/0.37 X1 = n10). % 0.08/0.37 cnf(a5, assumption, % 0.08/0.37 X2 = n15). % 0.08/0.37 cnf(c6, plain, % 0.08/0.37 ~axis_conflict(X3,X4,X1,X2), % 0.08/0.37 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.08/0.37 cnf(c7, plain, % 0.08/0.37 $false, % 0.08/0.37 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.08/0.37 % 0.08/0.37 cnf(c8, axiom, % 0.08/0.37 axis_conflict(n0,n5,n10,n15)). % 0.08/0.37 cnf(a6, assumption, % 0.08/0.37 X3 = n0). % 0.08/0.37 cnf(a7, assumption, % 0.08/0.37 X4 = n5). % 0.08/0.37 cnf(a8, assumption, % 0.08/0.37 X1 = n10). % 0.08/0.37 cnf(a9, assumption, % 0.08/0.37 X2 = n15). % 0.08/0.37 cnf(c9, plain, % 0.08/0.37 $false, % 0.08/0.37 inference(strict_predicate_extension, [assumptions([a6, a7, a8, a9])], [c6, c8])). % 0.08/0.37 cnf(c10, plain, % 0.08/0.37 $false, % 0.08/0.37 inference(strict_predicate_extension, [assumptions([a6, a7, a8, a9])], [c6, c8])). % 0.08/0.37 % 0.08/0.37 cnf(c11, plain, % 0.08/0.37 $false, % 0.08/0.37 inference(constraint_solving, [ % 0.08/0.37 bind(X0, sK3), % 0.08/0.37 bind(X1, n10), % 0.08/0.37 bind(X2, n15), % 0.08/0.37 bind(X3, n0), % 0.08/0.37 bind(X4, n5) % 0.08/0.37 ], % 0.08/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])). % 0.08/0.37 % 0.08/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------