%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT106+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 : n017.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:24 AM UTC 2026 % Result : Unsatisfiable 0.10s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT106+1 : TPTP v9.3.1. Bugfixed v9.3.1. % 0.00/0.04 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.10/0.37 % Computer : n017.cluster.edu % 0.10/0.37 % Model : x86_64 x86_64 % 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.37 % Memory : 8046.5625MB % 0.10/0.37 % OS : Linux 6.8.0-71-generic % 0.10/0.37 % CPULimit : 300 % 0.10/0.37 % WCLimit : 300 % 0.10/0.37 % DateTime : Mon Sep 7 14:36:24 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/0.39 % SZS status Theorem % 0.10/0.39 % SZS output begin IncompleteProof % 0.10/0.39 cnf(c0, axiom, % 0.10/0.39 ~less(X0,X0)). % 0.10/0.39 cnf(c1, plain, % 0.10/0.39 ~less(X0,X0), % 0.10/0.39 inference(start, [], [c0])). % 0.10/0.39 % 0.10/0.39 cnf(c2, axiom, % 0.10/0.39 less(X1,X2) | ~leq(X3,X2) | ~less(X1,X3)). % 0.10/0.39 cnf(a0, assumption, % 0.10/0.39 X0 = X1). % 0.10/0.39 cnf(a1, assumption, % 0.10/0.39 X0 = X2). % 0.10/0.39 cnf(c3, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.10/0.39 cnf(c4, plain, % 0.10/0.39 ~leq(X3,X2) | ~less(X1,X3), % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.10/0.39 % 0.10/0.39 cnf(c5, axiom, % 0.10/0.39 leq(v800,w)). % 0.10/0.39 cnf(a2, assumption, % 0.10/0.39 X3 = v800). % 0.10/0.39 cnf(a3, assumption, % 0.10/0.39 X2 = w). % 0.10/0.39 cnf(c6, plain, % 0.10/0.39 ~less(X1,X3), % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.10/0.39 cnf(c7, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.10/0.39 % 0.10/0.39 cnf(c8, axiom, % 0.10/0.39 less(X4,X5) | ~less(X6,X5) | ~leq(X4,X6)). % 0.10/0.39 cnf(a4, assumption, % 0.10/0.39 X1 = X4). % 0.10/0.39 cnf(a5, assumption, % 0.10/0.39 X3 = X5). % 0.10/0.39 cnf(c9, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.10/0.39 cnf(c10, plain, % 0.10/0.39 ~less(X6,X5) | ~leq(X4,X6), % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.10/0.39 % 0.10/0.39 cnf(c11, axiom, % 0.10/0.39 less(v600,v800)). % 0.10/0.39 cnf(a6, assumption, % 0.10/0.39 X6 = v600). % 0.10/0.39 cnf(a7, assumption, % 0.10/0.39 X5 = v800). % 0.10/0.39 cnf(c12, plain, % 0.10/0.39 ~leq(X4,X6), % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.10/0.39 cnf(c13, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.10/0.39 % 0.10/0.39 cnf(c14, axiom, % 0.10/0.39 leq(X7,X8) | ~in_lopen(X7,X9,X8)). % 0.10/0.39 cnf(a8, assumption, % 0.10/0.39 X4 = X7). % 0.10/0.39 cnf(a9, assumption, % 0.10/0.39 X6 = X8). % 0.10/0.39 cnf(c15, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 0.10/0.39 cnf(c16, plain, % 0.10/0.39 ~in_lopen(X7,X9,X8), % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 0.10/0.39 % 0.10/0.39 cnf(c17, axiom, % 0.10/0.39 in_lopen(w,v0,v600)). % 0.10/0.39 cnf(a10, assumption, % 0.10/0.39 X7 = w). % 0.10/0.39 cnf(a11, assumption, % 0.10/0.39 X9 = v0). % 0.10/0.39 cnf(a12, assumption, % 0.10/0.39 X8 = v600). % 0.10/0.39 cnf(c18, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a10, a11, a12])], [c16, c17])). % 0.10/0.39 cnf(c19, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(strict_predicate_extension, [assumptions([a10, a11, a12])], [c16, c17])). % 0.10/0.39 % 0.10/0.39 cnf(c20, plain, % 0.10/0.39 $false, % 0.10/0.39 inference(constraint_solving, [ % 0.10/0.39 bind(X0, w), % 0.10/0.39 bind(X1, w), % 0.10/0.39 bind(X2, w), % 0.10/0.39 bind(X3, v800), % 0.10/0.39 bind(X4, w), % 0.10/0.39 bind(X5, v800), % 0.10/0.39 bind(X6, v600), % 0.10/0.39 bind(X7, w), % 0.10/0.39 bind(X8, v600), % 0.10/0.39 bind(X9, v0) % 0.10/0.39 ], % 0.10/0.39 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])). % 0.10/0.39 % 0.10/0.39 % SZS output end IncompleteProof %------------------------------------------------------------------------------