%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT070+1 : TPTP v9.3.0. Released v9.3.0. % 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:22 AM UTC 2026 % Result : Theorem 0.10s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT070+1 : TPTP v9.3.0. Released v9.3.0. % 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 : n026.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 13:56:12 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/0.38 % SZS status Theorem % 0.10/0.38 % SZS output begin IncompleteProof % 0.10/0.38 cnf(c0, axiom, % 0.10/0.38 ~completion_compatible(X0,ninf,nsup) | ~leq(X0,nsup) | ~leq(ninf,X0)). % 0.10/0.38 cnf(c1, plain, % 0.10/0.38 ~completion_compatible(X0,ninf,nsup) | ~leq(X0,nsup) | ~leq(ninf,X0), % 0.10/0.38 inference(start, [], [c0])). % 0.10/0.38 % 0.10/0.38 cnf(c2, axiom, % 0.10/0.38 completion_compatible(X1,X2,X3) | ~leq(X1,X3) | ~leq(X2,X1)). % 0.10/0.38 cnf(a0, assumption, % 0.10/0.38 X0 = X1). % 0.10/0.38 cnf(a1, assumption, % 0.10/0.38 ninf = X2). % 0.10/0.38 cnf(a2, assumption, % 0.10/0.38 nsup = X3). % 0.10/0.38 cnf(c3, plain, % 0.10/0.38 ~leq(X0,nsup) | ~leq(ninf,X0), % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.10/0.38 cnf(c4, plain, % 0.10/0.38 ~leq(X1,X3) | ~leq(X2,X1), % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.10/0.38 % 0.10/0.38 cnf(c5, axiom, % 0.10/0.38 leq(X4,X4)). % 0.10/0.38 cnf(a3, assumption, % 0.10/0.38 X1 = X4). % 0.10/0.38 cnf(a4, assumption, % 0.10/0.38 X3 = X4). % 0.10/0.38 cnf(c6, plain, % 0.10/0.38 ~leq(X2,X1), % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])). % 0.10/0.38 cnf(c7, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])). % 0.10/0.38 % 0.10/0.38 cnf(c8, axiom, % 0.10/0.38 leq(ninf,X5)). % 0.10/0.38 cnf(a5, assumption, % 0.10/0.38 X2 = ninf). % 0.10/0.38 cnf(a6, assumption, % 0.10/0.38 X1 = X5). % 0.10/0.38 cnf(c9, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c8])). % 0.10/0.38 cnf(c10, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c8])). % 0.10/0.38 % 0.10/0.38 cnf(c11, plain, % 0.10/0.38 leq(X1,X3)). % 0.10/0.38 cnf(a7, assumption, % 0.10/0.38 X0 = X1). % 0.10/0.38 cnf(a8, assumption, % 0.10/0.38 nsup = X3). % 0.10/0.38 cnf(c12, plain, % 0.10/0.38 ~leq(ninf,X0), % 0.10/0.38 inference(predicate_reduction, [assumptions([a7, a8])], [c3, c11])). % 0.10/0.38 % 0.10/0.38 cnf(c13, plain, % 0.10/0.38 leq(X2,X1)). % 0.10/0.38 cnf(a9, assumption, % 0.10/0.38 ninf = X2). % 0.10/0.38 cnf(a10, assumption, % 0.10/0.38 X0 = X1). % 0.10/0.38 cnf(c14, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(predicate_reduction, [assumptions([a9, a10])], [c12, c13])). % 0.10/0.38 % 0.10/0.38 cnf(c15, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(constraint_solving, [ % 0.10/0.38 bind(X0, nsup), % 0.10/0.38 bind(X1, nsup), % 0.10/0.38 bind(X2, ninf), % 0.10/0.38 bind(X3, nsup), % 0.10/0.38 bind(X4, nsup), % 0.10/0.38 bind(X5, nsup) % 0.10/0.38 ], % 0.10/0.38 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])). % 0.10/0.38 % 0.10/0.38 % SZS output end IncompleteProof %------------------------------------------------------------------------------