%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT077+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 : n005.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.12s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT077+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 : n005.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:12:50 UTC 2026 % 0.09/0.35 % CPUTime : % 0.12/0.36 % SZS status Theorem % 0.12/0.36 % SZS output begin IncompleteProof % 0.12/0.36 cnf(c0, axiom, % 0.12/0.36 ~in_open(X0,v0,v500) | ~less(v100,X0) | ~in_open(X1,v0,v800) | ~less(v200,X1)). % 0.12/0.36 cnf(c1, plain, % 0.12/0.36 ~in_open(X0,v0,v500) | ~less(v100,X0) | ~in_open(X1,v0,v800) | ~less(v200,X1), % 0.12/0.36 inference(start, [], [c0])). % 0.12/0.36 % 0.12/0.36 cnf(c2, axiom, % 0.12/0.36 in_open(X2,X3,X4) | ~less(X2,X4) | ~less(X3,X2)). % 0.12/0.36 cnf(a0, assumption, % 0.12/0.36 X0 = X2). % 0.12/0.36 cnf(a1, assumption, % 0.12/0.36 v0 = X3). % 0.12/0.36 cnf(a2, assumption, % 0.12/0.36 v500 = X4). % 0.12/0.36 cnf(c3, plain, % 0.12/0.36 ~less(v100,X0) | ~in_open(X1,v0,v800) | ~less(v200,X1), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.12/0.36 cnf(c4, plain, % 0.12/0.36 ~less(X2,X4) | ~less(X3,X2), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.12/0.36 % 0.12/0.36 cnf(c5, axiom, % 0.12/0.36 less(v200,v500)). % 0.12/0.36 cnf(a3, assumption, % 0.12/0.36 X2 = v200). % 0.12/0.36 cnf(a4, assumption, % 0.12/0.36 X4 = v500). % 0.12/0.36 cnf(c6, plain, % 0.12/0.36 ~less(X3,X2), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])). % 0.12/0.36 cnf(c7, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])). % 0.12/0.36 % 0.12/0.36 cnf(c8, axiom, % 0.12/0.36 less(v0,v200)). % 0.12/0.36 cnf(a5, assumption, % 0.12/0.36 X3 = v0). % 0.12/0.36 cnf(a6, assumption, % 0.12/0.36 X2 = v200). % 0.12/0.36 cnf(c9, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c8])). % 0.12/0.36 cnf(c10, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c8])). % 0.12/0.36 % 0.12/0.36 cnf(c11, axiom, % 0.12/0.36 less(v100,v200)). % 0.12/0.36 cnf(a7, assumption, % 0.12/0.36 v100 = v100). % 0.12/0.36 cnf(a8, assumption, % 0.12/0.36 X0 = v200). % 0.12/0.36 cnf(c12, plain, % 0.12/0.36 ~in_open(X1,v0,v800) | ~less(v200,X1), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a7, a8])], [c3, c11])). % 0.12/0.36 cnf(c13, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a7, a8])], [c3, c11])). % 0.12/0.36 % 0.12/0.36 cnf(c14, axiom, % 0.12/0.36 in_open(X5,X6,X7) | ~less(X5,X7) | ~less(X6,X5)). % 0.12/0.36 cnf(a9, assumption, % 0.12/0.36 X1 = X5). % 0.12/0.36 cnf(a10, assumption, % 0.12/0.36 v0 = X6). % 0.12/0.36 cnf(a11, assumption, % 0.12/0.36 v800 = X7). % 0.12/0.36 cnf(c15, plain, % 0.12/0.36 ~less(v200,X1), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c12, c14])). % 0.12/0.36 cnf(c16, plain, % 0.12/0.36 ~less(X5,X7) | ~less(X6,X5), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c12, c14])). % 0.12/0.36 % 0.12/0.36 cnf(c17, axiom, % 0.12/0.36 less(v500,v800)). % 0.12/0.36 cnf(a12, assumption, % 0.12/0.36 X5 = v500). % 0.12/0.36 cnf(a13, assumption, % 0.12/0.36 X7 = v800). % 0.12/0.36 cnf(c18, plain, % 0.12/0.36 ~less(X6,X5), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a12, a13])], [c16, c17])). % 0.12/0.36 cnf(c19, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a12, a13])], [c16, c17])). % 0.12/0.36 % 0.12/0.36 cnf(c20, axiom, % 0.12/0.36 less(v0,v500)). % 0.12/0.36 cnf(a14, assumption, % 0.12/0.36 X6 = v0). % 0.12/0.36 cnf(a15, assumption, % 0.12/0.36 X5 = v500). % 0.12/0.36 cnf(c21, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a14, a15])], [c18, c20])). % 0.12/0.36 cnf(c22, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a14, a15])], [c18, c20])). % 0.12/0.36 % 0.12/0.36 cnf(c23, plain, % 0.12/0.36 less(X2,X4)). % 0.12/0.36 cnf(a16, assumption, % 0.12/0.36 v200 = X2). % 0.12/0.36 cnf(a17, assumption, % 0.12/0.36 X1 = X4). % 0.12/0.36 cnf(c24, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(predicate_reduction, [assumptions([a16, a17])], [c15, c23])). % 0.12/0.36 % 0.12/0.36 cnf(c25, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(constraint_solving, [ % 0.12/0.36 bind(X0, v200), % 0.12/0.36 bind(X1, v500), % 0.12/0.36 bind(X2, v200), % 0.12/0.36 bind(X3, v0), % 0.12/0.36 bind(X4, v500), % 0.12/0.36 bind(X5, v500), % 0.12/0.36 bind(X6, v0), % 0.12/0.37 bind(X7, v800) % 0.12/0.37 ], % 0.12/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])). % 0.12/0.37 % 0.12/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------