%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT080+1 : TPTP v9.3.1. Bugfixed v9.3.1. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n001.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:23 AM UTC 2026 % Result : Theorem 0.79s 0.52s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT080+1 : TPTP v9.3.1. Bugfixed v9.3.1. % 0.00/0.03 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.09/0.35 % Computer : n001.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.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Mon Sep 7 14:20:07 UTC 2026 % 0.09/0.36 % CPUTime : % 0.79/0.52 % SZS status Theorem % 0.79/0.52 % SZS output begin IncompleteProof % 0.79/0.52 cnf(c0, axiom, % 0.79/0.52 in_closed(sK3,v800,v800)). % 0.79/0.52 cnf(c1, plain, % 0.79/0.52 in_closed(sK3,v800,v800), % 0.79/0.52 inference(start, [], [c0])). % 0.79/0.52 % 0.79/0.52 cnf(c2, axiom, % 0.79/0.52 leq(X0,X1) | ~in_closed(X1,X0,X2)). % 0.79/0.52 cnf(a0, assumption, % 0.79/0.52 sK3 = X1). % 0.79/0.52 cnf(a1, assumption, % 0.79/0.52 v800 = X0). % 0.79/0.52 cnf(a2, assumption, % 0.79/0.52 v800 = X2). % 0.79/0.52 cnf(c3, plain, % 0.79/0.52 $false, % 0.79/0.52 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.79/0.52 cnf(c4, plain, % 0.79/0.52 leq(X0,X1), % 0.79/0.52 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.79/0.52 % 0.79/0.52 cnf(c5, axiom, % 0.79/0.52 less(X3,X4) | ~less(X5,X4) | ~leq(X3,X5)). % 0.79/0.52 cnf(a3, assumption, % 0.79/0.52 X0 = X3). % 0.79/0.52 cnf(a4, assumption, % 0.79/0.52 X1 = X5). % 0.79/0.52 cnf(c6, plain, % 0.79/0.52 $false, % 0.79/0.52 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])). % 0.79/0.52 cnf(c7, plain, % 0.79/0.52 less(X3,X4) | ~less(X5,X4), % 0.79/0.52 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])). % 0.79/0.52 % 0.79/0.52 cnf(c8, axiom, % 0.79/0.52 ~less(X6,X6)). % 0.79/0.52 cnf(a5, assumption, % 0.79/0.52 X3 = X6). % 0.79/0.52 cnf(a6, assumption, % 0.79/0.52 X4 = X6). % 0.79/0.52 cnf(c9, plain, % 0.79/0.52 ~less(X5,X4), % 0.79/0.52 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])). % 0.79/0.52 cnf(c10, plain, % 0.79/0.52 $false, % 0.79/0.52 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])). % 0.79/0.52 % 0.79/0.52 cnf(c11, axiom, % 0.79/0.52 less(X7,X8) | ~less(X9,X8) | ~leq(X7,X9)). % 0.79/0.52 cnf(a7, assumption, % 0.79/0.52 X5 = X7). % 0.79/0.52 cnf(a8, assumption, % 0.79/0.52 X4 = X8). % 0.79/0.52 cnf(c12, plain, % 0.79/0.52 $false, % 0.79/0.52 inference(strict_predicate_extension, [assumptions([a7, a8])], [c9, c11])). % 0.79/0.52 cnf(c13, plain, % 0.79/0.52 ~less(X9,X8) | ~leq(X7,X9), % 0.79/0.52 inference(strict_predicate_extension, [assumptions([a7, a8])], [c9, c11])). % 0.79/0.52 % 0.79/0.52 cnf(c14, axiom, % 0.79/0.52 less(v600,v800)). % 0.79/0.52 cnf(a9, assumption, % 0.79/0.52 X9 = v600). % 0.79/0.52 cnf(a10, assumption, % 0.79/0.52 X8 = v800). % 0.79/0.52 cnf(c15, plain, % 0.79/0.52 ~leq(X7,X9), % 0.79/0.52 inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c14])). % 0.79/0.52 cnf(c16, plain, % 0.79/0.52 $false, % 0.79/0.52 inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c14])). % 0.79/0.52 % 0.79/0.52 cnf(c17, axiom, % 0.79/0.52 leq(X10,X11) | ~in_closed(X10,X12,X11)). % 0.79/0.52 cnf(a11, assumption, % 0.79/0.52 X7 = X10). % 0.79/0.52 cnf(a12, assumption, % 0.79/0.52 X9 = X11). % 0.79/0.52 cnf(c18, plain, % 0.79/0.52 $false, % 0.79/0.52 inference(strict_predicate_extension, [assumptions([a11, a12])], [c15, c17])). % 0.79/0.52 cnf(c19, plain, % 0.79/0.52 ~in_closed(X10,X12,X11), % 0.79/0.52 inference(strict_predicate_extension, [assumptions([a11, a12])], [c15, c17])). % 0.79/0.52 % 0.79/0.52 cnf(c20, axiom, % 0.79/0.52 in_closed(sK3,v600,v600)). % 0.79/0.52 cnf(a13, assumption, % 0.79/0.52 X10 = sK3). % 0.79/0.52 cnf(a14, assumption, % 0.79/0.52 X12 = v600). % 0.79/0.52 cnf(a15, assumption, % 0.79/0.52 X11 = v600). % 0.79/0.52 cnf(c21, plain, % 0.79/0.52 $false, % 0.79/0.52 inference(strict_predicate_extension, [assumptions([a13, a14, a15])], [c19, c20])). % 0.79/0.52 cnf(c22, plain, % 0.79/0.52 $false, % 0.79/0.52 inference(strict_predicate_extension, [assumptions([a13, a14, a15])], [c19, c20])). % 0.79/0.52 % 0.79/0.52 cnf(c23, plain, % 0.79/0.52 $false, % 0.79/0.52 inference(constraint_solving, [ % 0.79/0.52 bind(X0, v800), % 0.79/0.52 bind(X1, sK3), % 0.79/0.52 bind(X2, v800), % 0.79/0.52 bind(X3, v800), % 0.79/0.52 bind(X4, v800), % 0.79/0.52 bind(X5, sK3), % 0.79/0.52 bind(X6, v800), % 0.79/0.52 bind(X7, sK3), % 0.79/0.52 bind(X8, v800), % 0.79/0.52 bind(X9, v600), % 0.79/0.52 bind(X10, sK3), % 0.79/0.52 bind(X11, v600), % 0.79/0.52 bind(X12, v600) % 0.79/0.52 ], % 0.79/0.52 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 0.79/0.52 % 0.79/0.52 % SZS output end IncompleteProof %------------------------------------------------------------------------------