%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT092+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 : n026.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.12s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT092+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.08/0.35 % Computer : n026.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 14:26:57 UTC 2026 % 0.08/0.35 % CPUTime : % 0.12/0.38 % SZS status Theorem % 0.12/0.38 % SZS output begin IncompleteProof % 0.12/0.38 cnf(c0, axiom, % 0.12/0.38 ~completion_conflict(v400,v800,v0,v1200)). % 0.12/0.38 cnf(c1, plain, % 0.12/0.38 ~completion_conflict(v400,v800,v0,v1200), % 0.12/0.38 inference(start, [], [c0])). % 0.12/0.38 % 0.12/0.38 cnf(c2, axiom, % 0.12/0.38 completion_conflict(X0,X1,X2,X3) | ~leq(X1,X3) | ~less(X0,X1) | ~leq(X0,X3) | ~leq(X2,X0)). % 0.12/0.38 cnf(a0, assumption, % 0.12/0.38 v400 = X0). % 0.12/0.38 cnf(a1, assumption, % 0.12/0.38 v800 = X1). % 0.12/0.38 cnf(a2, assumption, % 0.12/0.38 v0 = X2). % 0.12/0.38 cnf(a3, assumption, % 0.12/0.38 v1200 = X3). % 0.12/0.38 cnf(c3, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])). % 0.12/0.38 cnf(c4, plain, % 0.12/0.38 ~leq(X1,X3) | ~less(X0,X1) | ~leq(X0,X3) | ~leq(X2,X0), % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])). % 0.12/0.38 % 0.12/0.38 cnf(c5, axiom, % 0.12/0.38 leq(X4,X5) | ~less(X4,X5)). % 0.12/0.38 cnf(a4, assumption, % 0.12/0.38 X1 = X4). % 0.12/0.38 cnf(a5, assumption, % 0.12/0.38 X3 = X5). % 0.12/0.38 cnf(c6, plain, % 0.12/0.38 ~less(X0,X1) | ~leq(X0,X3) | ~leq(X2,X0), % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a4, a5])], [c4, c5])). % 0.12/0.38 cnf(c7, plain, % 0.12/0.38 ~less(X4,X5), % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a4, a5])], [c4, c5])). % 0.12/0.38 % 0.12/0.38 cnf(c8, axiom, % 0.12/0.38 less(v800,v1200)). % 0.12/0.38 cnf(a6, assumption, % 0.12/0.38 X4 = v800). % 0.12/0.38 cnf(a7, assumption, % 0.12/0.38 X5 = v1200). % 0.12/0.38 cnf(c9, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a6, a7])], [c7, c8])). % 0.12/0.38 cnf(c10, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a6, a7])], [c7, c8])). % 0.12/0.38 % 0.12/0.38 cnf(c11, axiom, % 0.12/0.38 less(v400,v800)). % 0.12/0.38 cnf(a8, assumption, % 0.12/0.38 X0 = v400). % 0.12/0.38 cnf(a9, assumption, % 0.12/0.38 X1 = v800). % 0.12/0.38 cnf(c12, plain, % 0.12/0.38 ~leq(X0,X3) | ~leq(X2,X0), % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c11])). % 0.12/0.38 cnf(c13, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c11])). % 0.12/0.38 % 0.12/0.38 cnf(c14, axiom, % 0.12/0.38 leq(X6,X7) | ~less(X6,X7)). % 0.12/0.38 cnf(a10, assumption, % 0.12/0.38 X0 = X6). % 0.12/0.38 cnf(a11, assumption, % 0.12/0.38 X3 = X7). % 0.12/0.38 cnf(c15, plain, % 0.12/0.38 ~leq(X2,X0), % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c14])). % 0.12/0.38 cnf(c16, plain, % 0.12/0.38 ~less(X6,X7), % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c14])). % 0.12/0.38 % 0.12/0.38 cnf(c17, axiom, % 0.12/0.38 less(X8,X9) | ~less(X10,X9) | ~less(X8,X10)). % 0.12/0.38 cnf(a12, assumption, % 0.12/0.38 X6 = X8). % 0.12/0.38 cnf(a13, assumption, % 0.12/0.38 X7 = X9). % 0.12/0.38 cnf(c18, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a12, a13])], [c16, c17])). % 0.12/0.38 cnf(c19, plain, % 0.12/0.38 ~less(X10,X9) | ~less(X8,X10), % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a12, a13])], [c16, c17])). % 0.12/0.38 % 0.12/0.38 cnf(c20, plain, % 0.12/0.38 less(X4,X5)). % 0.12/0.38 cnf(a14, assumption, % 0.12/0.38 X10 = X4). % 0.12/0.38 cnf(a15, assumption, % 0.12/0.38 X9 = X5). % 0.12/0.38 cnf(c21, plain, % 0.12/0.38 ~less(X8,X10), % 0.12/0.38 inference(predicate_reduction, [assumptions([a14, a15])], [c19, c20])). % 0.12/0.38 % 0.12/0.38 cnf(c22, plain, % 0.12/0.38 less(X0,X1)). % 0.12/0.38 cnf(a16, assumption, % 0.12/0.38 X8 = X0). % 0.12/0.38 cnf(a17, assumption, % 0.12/0.38 X10 = X1). % 0.12/0.38 cnf(c23, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(predicate_reduction, [assumptions([a16, a17])], [c21, c22])). % 0.12/0.38 % 0.12/0.38 cnf(c24, axiom, % 0.12/0.38 leq(X11,X12) | ~less(X11,X12)). % 0.12/0.38 cnf(a18, assumption, % 0.12/0.38 X2 = X11). % 0.12/0.38 cnf(a19, assumption, % 0.12/0.38 X0 = X12). % 0.12/0.38 cnf(c25, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a18, a19])], [c15, c24])). % 0.12/0.38 cnf(c26, plain, % 0.12/0.38 ~less(X11,X12), % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a18, a19])], [c15, c24])). % 0.12/0.38 % 0.12/0.38 cnf(c27, axiom, % 0.12/0.38 less(v0,v400)). % 0.12/0.38 cnf(a20, assumption, % 0.12/0.38 X11 = v0). % 0.12/0.38 cnf(a21, assumption, % 0.12/0.38 X12 = v400). % 0.12/0.38 cnf(c28, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a20, a21])], [c26, c27])). % 0.12/0.38 cnf(c29, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(strict_predicate_extension, [assumptions([a20, a21])], [c26, c27])). % 0.12/0.38 % 0.12/0.38 cnf(c30, plain, % 0.12/0.38 $false, % 0.12/0.38 inference(constraint_solving, [ % 0.12/0.38 bind(X0, v400), % 0.12/0.38 bind(X1, v800), % 0.12/0.38 bind(X2, v0), % 0.12/0.38 bind(X3, v1200), % 0.12/0.38 bind(X4, v800), % 0.12/0.38 bind(X5, v1200), % 0.12/0.38 bind(X6, v400), % 0.12/0.38 bind(X7, v1200), % 0.12/0.38 bind(X8, v400), % 0.12/0.38 bind(X9, v1200), % 0.12/0.38 bind(X10, v800), % 0.12/0.38 bind(X11, v0), % 0.12/0.38 bind(X12, v400) % 0.12/0.38 ], % 0.12/0.38 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])). % 0.12/0.38 % 0.12/0.38 % SZS output end IncompleteProof %------------------------------------------------------------------------------