%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT083+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 : n011.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.13s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT083+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.08/0.35 % Computer : n011.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:17:45 UTC 2026 % 0.08/0.35 % CPUTime : % 0.13/0.36 % SZS status Theorem % 0.13/0.36 % SZS output begin IncompleteProof % 0.13/0.36 cnf(c0, axiom, % 0.13/0.36 less(v600,sK3)). % 0.13/0.36 cnf(c1, plain, % 0.13/0.36 less(v600,sK3), % 0.13/0.36 inference(start, [], [c0])). % 0.13/0.36 % 0.13/0.36 cnf(c2, axiom, % 0.13/0.36 less(X0,X1) | ~less(X2,X1) | ~less(X0,X2)). % 0.13/0.36 cnf(a0, assumption, % 0.13/0.36 v600 = X2). % 0.13/0.36 cnf(a1, assumption, % 0.13/0.36 sK3 = X1). % 0.13/0.36 cnf(c3, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.36 cnf(c4, plain, % 0.13/0.36 less(X0,X1) | ~less(X0,X2), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.36 % 0.13/0.36 cnf(c5, axiom, % 0.13/0.36 ~less(X3,X3)). % 0.13/0.36 cnf(a2, assumption, % 0.13/0.36 X0 = X3). % 0.13/0.36 cnf(a3, assumption, % 0.13/0.36 X1 = X3). % 0.13/0.36 cnf(c6, plain, % 0.13/0.36 ~less(X0,X2), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.13/0.36 cnf(c7, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.13/0.36 % 0.13/0.36 cnf(c8, axiom, % 0.13/0.36 less(X4,X5) | ~in_open(X4,X6,X5)). % 0.13/0.36 cnf(a4, assumption, % 0.13/0.36 X0 = X4). % 0.13/0.36 cnf(a5, assumption, % 0.13/0.36 X2 = X5). % 0.13/0.36 cnf(c9, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.13/0.36 cnf(c10, plain, % 0.13/0.36 ~in_open(X4,X6,X5), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.13/0.36 % 0.13/0.36 cnf(c11, axiom, % 0.13/0.36 in_open(sK3,v0,v600)). % 0.13/0.36 cnf(a6, assumption, % 0.13/0.36 X4 = sK3). % 0.13/0.36 cnf(a7, assumption, % 0.13/0.36 X6 = v0). % 0.13/0.36 cnf(a8, assumption, % 0.13/0.36 X5 = v600). % 0.13/0.36 cnf(c12, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c10, c11])). % 0.13/0.36 cnf(c13, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c10, c11])). % 0.13/0.36 % 0.13/0.36 cnf(c14, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(constraint_solving, [ % 0.13/0.36 bind(X0, sK3), % 0.13/0.36 bind(X1, sK3), % 0.13/0.36 bind(X2, v600), % 0.13/0.36 bind(X3, sK3), % 0.13/0.36 bind(X4, sK3), % 0.13/0.36 bind(X5, v600), % 0.13/0.36 bind(X6, v0) % 0.13/0.36 ], % 0.13/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8])). % 0.13/0.36 % 0.13/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------