%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT090+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 : n027.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.07s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT090+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.07/0.34 % Computer : n027.cluster.edu % 0.07/0.34 % Model : x86_64 x86_64 % 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.34 % Memory : 8046.5625MB % 0.07/0.34 % OS : Linux 6.8.0-71-generic % 0.07/0.34 % CPULimit : 300 % 0.07/0.34 % WCLimit : 300 % 0.07/0.34 % DateTime : Mon Sep 7 14:25:15 UTC 2026 % 0.07/0.34 % CPUTime : % 0.07/0.36 % SZS status Theorem % 0.07/0.36 % SZS output begin IncompleteProof % 0.07/0.36 cnf(c0, axiom, % 0.07/0.36 ~wf(lt,v600,v0,v1200)). % 0.07/0.36 cnf(c1, plain, % 0.07/0.36 ~wf(lt,v600,v0,v1200), % 0.07/0.36 inference(start, [], [c0])). % 0.07/0.36 % 0.07/0.36 cnf(c2, axiom, % 0.07/0.36 wf(lt,X0,X1,X2) | X0 = X1 | ~leq(X0,X2) | ~leq(X1,X0)). % 0.07/0.36 cnf(a0, assumption, % 0.07/0.36 lt = lt). % 0.07/0.36 cnf(a1, assumption, % 0.07/0.36 v600 = X0). % 0.07/0.36 cnf(a2, assumption, % 0.07/0.36 v0 = X1). % 0.07/0.36 cnf(a3, assumption, % 0.07/0.36 v1200 = X2). % 0.07/0.36 cnf(c3, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])). % 0.07/0.36 cnf(c4, plain, % 0.07/0.36 X0 = X1 | ~leq(X0,X2) | ~leq(X1,X0), % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])). % 0.07/0.36 % 0.07/0.36 cnf(c5, axiom, % 0.07/0.36 less(v0,v600)). % 0.07/0.36 cnf(a4, assumption, % 0.07/0.36 v600 = X0). % 0.07/0.36 cnf(c6, plain, % 0.07/0.36 ~leq(X0,X2) | ~leq(X1,X0), % 0.07/0.36 inference(strict_subterm_extension, [assumptions([a4])], [c4, c5])). % 0.07/0.36 cnf(c7, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_subterm_extension, [assumptions([a4])], [c4, c5])). % 0.07/0.36 cnf(c8, plain, % 0.07/0.36 less(v0,X1), % 0.07/0.36 inference(strict_subterm_extension, [assumptions([a4])], [c4, c5])). % 0.07/0.36 % 0.07/0.36 cnf(c9, axiom, % 0.07/0.36 ~less(X3,X3)). % 0.07/0.36 cnf(a5, assumption, % 0.07/0.36 v0 = X3). % 0.07/0.36 cnf(a6, assumption, % 0.07/0.36 X1 = X3). % 0.07/0.36 cnf(c10, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c9])). % 0.07/0.36 cnf(c11, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c9])). % 0.07/0.36 % 0.07/0.36 cnf(c12, axiom, % 0.07/0.36 leq(X4,X5) | ~less(X4,X5)). % 0.07/0.36 cnf(a7, assumption, % 0.07/0.36 X0 = X4). % 0.07/0.36 cnf(a8, assumption, % 0.07/0.36 X2 = X5). % 0.07/0.36 cnf(c13, plain, % 0.07/0.36 ~leq(X1,X0), % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a7, a8])], [c6, c12])). % 0.07/0.36 cnf(c14, plain, % 0.07/0.36 ~less(X4,X5), % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a7, a8])], [c6, c12])). % 0.07/0.36 % 0.07/0.36 cnf(c15, axiom, % 0.07/0.36 less(v600,v1200)). % 0.07/0.36 cnf(a9, assumption, % 0.07/0.36 X4 = v600). % 0.07/0.36 cnf(a10, assumption, % 0.07/0.36 X5 = v1200). % 0.07/0.36 cnf(c16, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c15])). % 0.07/0.36 cnf(c17, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c15])). % 0.07/0.36 % 0.07/0.36 cnf(c18, axiom, % 0.07/0.36 leq(X6,X7) | ~less(X6,X7)). % 0.07/0.36 cnf(a11, assumption, % 0.07/0.36 X1 = X6). % 0.07/0.36 cnf(a12, assumption, % 0.07/0.36 X0 = X7). % 0.07/0.36 cnf(c19, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a11, a12])], [c13, c18])). % 0.07/0.36 cnf(c20, plain, % 0.07/0.36 ~less(X6,X7), % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a11, a12])], [c13, c18])). % 0.07/0.36 % 0.07/0.36 cnf(c21, axiom, % 0.07/0.36 less(v0,v600)). % 0.07/0.36 cnf(a13, assumption, % 0.07/0.36 X6 = v0). % 0.07/0.36 cnf(a14, assumption, % 0.07/0.36 X7 = v600). % 0.07/0.36 cnf(c22, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a13, a14])], [c20, c21])). % 0.07/0.36 cnf(c23, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a13, a14])], [c20, c21])). % 0.07/0.36 % 0.07/0.36 cnf(c24, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(constraint_solving, [ % 0.07/0.36 bind(X0, v600), % 0.07/0.36 bind(X1, v0), % 0.07/0.36 bind(X2, v1200), % 0.07/0.36 bind(X3, v0), % 0.07/0.36 bind(X4, v600), % 0.07/0.36 bind(X5, v1200), % 0.07/0.36 bind(X6, v0), % 0.07/0.36 bind(X7, v600) % 0.07/0.36 ], % 0.07/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])). % 0.07/0.36 % 0.07/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------