%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT089+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 : n014.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.09s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT089+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.09/0.37 % Computer : n014.cluster.edu % 0.09/0.37 % Model : x86_64 x86_64 % 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.37 % Memory : 8046.5625MB % 0.09/0.37 % OS : Linux 6.8.0-71-generic % 0.09/0.37 % CPULimit : 300 % 0.09/0.37 % WCLimit : 300 % 0.09/0.37 % DateTime : Mon Sep 7 13:59:56 UTC 2026 % 0.09/0.37 % CPUTime : % 0.09/0.38 % SZS status Theorem % 0.09/0.38 % SZS output begin IncompleteProof % 0.09/0.38 cnf(c0, axiom, % 0.09/0.38 ~prec(v5,v5,o,o)). % 0.09/0.38 cnf(c1, plain, % 0.09/0.38 ~prec(v5,v5,o,o), % 0.09/0.38 inference(start, [], [c0])). % 0.09/0.38 % 0.09/0.38 cnf(c2, axiom, % 0.09/0.38 prec(X0,X1,o,o) | ~leq(X0,X1)). % 0.09/0.38 cnf(a0, assumption, % 0.09/0.38 v5 = X0). % 0.09/0.38 cnf(a1, assumption, % 0.09/0.38 v5 = X1). % 0.09/0.38 cnf(a2, assumption, % 0.09/0.38 o = o). % 0.09/0.38 cnf(a3, assumption, % 0.09/0.38 o = o). % 0.09/0.38 cnf(c3, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])). % 0.09/0.38 cnf(c4, plain, % 0.09/0.38 ~leq(X0,X1), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])). % 0.09/0.38 % 0.09/0.38 cnf(c5, axiom, % 0.09/0.38 leq(X2,X2)). % 0.09/0.38 cnf(a4, assumption, % 0.09/0.38 X0 = X2). % 0.09/0.38 cnf(a5, assumption, % 0.09/0.38 X1 = X2). % 0.09/0.38 cnf(c6, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a4, a5])], [c4, c5])). % 0.09/0.38 cnf(c7, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a4, a5])], [c4, c5])). % 0.09/0.38 % 0.09/0.38 cnf(c8, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(constraint_solving, [ % 0.09/0.38 bind(X0, v5), % 0.09/0.38 bind(X1, v5), % 0.09/0.38 bind(X2, v5) % 0.09/0.38 ], % 0.09/0.38 [a0, a1, a2, a3, a4, a5])). % 0.09/0.38 % 0.09/0.38 % SZS output end IncompleteProof %------------------------------------------------------------------------------