%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWX206+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 : n019.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Tue May 5 07:03:23 PM UTC 2026 % Result : Theorem 0.15s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SWX206+1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.15/0.33 % Computer : n019.cluster.edu % 0.15/0.33 % Model : x86_64 x86_64 % 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.33 % Memory : 8042.1875MB % 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.33 % CPULimit : 300 % 0.15/0.33 % WCLimit : 300 % 0.15/0.33 % DateTime : Tue May 5 11:32:59 EDT 2026 % 0.15/0.33 % CPUTime : % 0.15/0.34 % SZS status Theorem % 0.15/0.34 % SZS output begin IncompleteProof % 0.15/0.34 cnf(c0, axiom, % 0.15/0.34 x2(X0,X0) != X0). % 0.15/0.34 cnf(c1, plain, % 0.15/0.34 x2(X0,X0) != X0, % 0.15/0.34 inference(start, [], [c0])). % 0.15/0.34 % 0.15/0.34 cnf(c2, axiom, % 0.15/0.34 x2(z,X1) = X1). % 0.15/0.34 cnf(a0, assumption, % 0.15/0.34 x2(X0,X0) = x2(z,X1)). % 0.15/0.34 cnf(c3, plain, % 0.15/0.34 $false, % 0.15/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.15/0.34 cnf(c4, plain, % 0.15/0.34 $false, % 0.15/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.15/0.34 cnf(c5, plain, % 0.15/0.34 X2 != X1 | X2 != X0, % 0.15/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.15/0.34 % 0.15/0.34 cnf(a1, assumption, % 0.15/0.34 X2 = X1). % 0.15/0.34 cnf(c6, plain, % 0.15/0.34 X2 != X0, % 0.15/0.34 inference(reflexivity, [assumptions([a1])], [c5])). % 0.15/0.34 % 0.15/0.34 cnf(a2, assumption, % 0.15/0.34 X2 = X0). % 0.15/0.34 cnf(c7, plain, % 0.15/0.34 $false, % 0.15/0.34 inference(reflexivity, [assumptions([a2])], [c6])). % 0.15/0.34 % 0.15/0.34 cnf(c8, plain, % 0.15/0.34 $false, % 0.15/0.34 inference(constraint_solving, [ % 0.15/0.34 bind(X0, z), % 0.15/0.34 bind(X1, z), % 0.15/0.34 bind(X2, z) % 0.15/0.34 ], % 0.15/0.34 [a0, a1, a2])). % 0.15/0.34 % 0.15/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------