%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : COL024-1 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n018.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 : 600s % DateTime : Fri Jul 15 00:33:56 EDT 2022 % Result : Unsatisfiable 0.14s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : COL024-1 : TPTP v8.1.0. Released v1.0.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.35 % Computer : n018.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Tue May 31 06:47:27 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.36 % SZS status Unsatisfiable % 0.14/0.36 % SZS output begin IncompleteProof % 0.14/0.36 cnf(c0, axiom, % 0.14/0.36 apply(combinator,X0) != X0). % 0.14/0.36 cnf(c1, plain, % 0.14/0.36 apply(combinator,X0) != X0, % 0.14/0.36 inference(start, [], [c0])). % 0.14/0.36 % 0.14/0.36 cnf(c2, axiom, % 0.14/0.36 apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3))). % 0.14/0.36 cnf(a0, assumption, % 0.14/0.36 apply(combinator,X0) = apply(X1,apply(X2,X3))). % 0.14/0.36 cnf(c3, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.36 cnf(c4, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.36 cnf(c5, plain, % 0.14/0.36 X4 != apply(apply(apply(b,X1),X2),X3) | X4 != X0, % 0.14/0.36 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.36 % 0.14/0.36 cnf(c6, axiom, % 0.14/0.36 apply(m,X5) = apply(X5,X5)). % 0.14/0.36 cnf(a1, assumption, % 0.14/0.36 apply(apply(apply(b,X1),X2),X3) = apply(X5,X5)). % 0.14/0.36 cnf(c7, plain, % 0.14/0.36 X4 != X0, % 0.14/0.36 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.14/0.36 cnf(c8, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.14/0.36 cnf(c9, plain, % 0.14/0.36 X6 != apply(m,X5) | X4 != X6, % 0.14/0.36 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.14/0.36 % 0.14/0.36 cnf(a2, assumption, % 0.14/0.36 X6 = apply(m,X5)). % 0.14/0.36 cnf(c10, plain, % 0.14/0.36 X4 != X6, % 0.14/0.36 inference(reflexivity, [assumptions([a2])], [c9])). % 0.14/0.36 % 0.14/0.36 cnf(a3, assumption, % 0.14/0.36 X4 = X6). % 0.14/0.36 cnf(c11, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(reflexivity, [assumptions([a3])], [c10])). % 0.14/0.36 % 0.14/0.36 cnf(a4, assumption, % 0.14/0.36 X4 = X0). % 0.14/0.36 cnf(c12, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(reflexivity, [assumptions([a4])], [c7])). % 0.14/0.36 % 0.14/0.36 cnf(c13, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(constraint_solving, [ % 0.14/0.36 bind(X0, apply(X2,X3)), % 0.14/0.36 bind(X1, combinator), % 0.14/0.36 bind(X2, m), % 0.14/0.36 bind(X3, apply(apply(b,X1),X2)), % 0.14/0.36 bind(X4, apply(m,X5)), % 0.14/0.36 bind(X5, apply(apply(b,X1),X2)), % 0.14/0.36 bind(X6, apply(m,X5)) % 0.14/0.36 ], % 0.14/0.36 [a0, a1, a2, a3, a4])). % 0.14/0.36 % 0.14/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------