%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT093+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.14s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT093+1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.03 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.11/0.36 % Computer : n014.cluster.edu % 0.11/0.36 % Model : x86_64 x86_64 % 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.36 % Memory : 8046.5625MB % 0.11/0.36 % OS : Linux 6.8.0-71-generic % 0.11/0.36 % CPULimit : 300 % 0.11/0.36 % WCLimit : 300 % 0.11/0.36 % DateTime : Mon Sep 7 14:01:26 UTC 2026 % 0.14/0.36 % CPUTime : % 0.14/0.37 % SZS status Theorem % 0.14/0.37 % SZS output begin IncompleteProof % 0.14/0.37 cnf(c0, axiom, % 0.14/0.37 compatible != xone_verdict(compatible,conflict)). % 0.14/0.37 cnf(c1, plain, % 0.14/0.37 compatible != xone_verdict(compatible,conflict), % 0.14/0.37 inference(start, [], [c0])). % 0.14/0.37 % 0.14/0.37 cnf(c2, axiom, % 0.14/0.37 compatible = xone_verdict(compatible,conflict) | ~is_verdict(conflict) | ~is_verdict(compatible)). % 0.14/0.37 cnf(a0, assumption, % 0.14/0.37 xone_verdict(compatible,conflict) = xone_verdict(compatible,conflict)). % 0.14/0.37 cnf(c3, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.37 cnf(c4, plain, % 0.14/0.37 ~is_verdict(conflict) | ~is_verdict(compatible), % 0.14/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.37 cnf(c5, plain, % 0.14/0.37 X0 != compatible | compatible != X0, % 0.14/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.37 % 0.14/0.37 cnf(a1, assumption, % 0.14/0.37 X0 = compatible). % 0.14/0.37 cnf(c6, plain, % 0.14/0.37 compatible != X0, % 0.14/0.37 inference(reflexivity, [assumptions([a1])], [c5])). % 0.14/0.37 % 0.14/0.37 cnf(a2, assumption, % 0.14/0.37 compatible = X0). % 0.14/0.37 cnf(c7, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(reflexivity, [assumptions([a2])], [c6])). % 0.14/0.37 % 0.14/0.37 cnf(c8, axiom, % 0.14/0.37 is_verdict(conflict)). % 0.14/0.37 cnf(a3, assumption, % 0.14/0.37 conflict = conflict). % 0.14/0.37 cnf(c9, plain, % 0.14/0.37 ~is_verdict(compatible), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a3])], [c4, c8])). % 0.14/0.37 cnf(c10, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a3])], [c4, c8])). % 0.14/0.37 % 0.14/0.37 cnf(c11, axiom, % 0.14/0.37 is_verdict(compatible)). % 0.14/0.37 cnf(a4, assumption, % 0.14/0.37 compatible = compatible). % 0.14/0.37 cnf(c12, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a4])], [c9, c11])). % 0.14/0.37 cnf(c13, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a4])], [c9, c11])). % 0.14/0.37 % 0.14/0.37 cnf(c14, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(constraint_solving, [ % 0.14/0.37 bind(X0, compatible) % 0.14/0.37 ], % 0.14/0.37 [a0, a1, a2, a3, a4])). % 0.14/0.37 % 0.14/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------