%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : COL001-2 : 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 : n023.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:52 EDT 2022 % Result : Unsatisfiable 0.20s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : COL001-2 : TPTP v8.1.0. Released v1.0.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.35 % Computer : n023.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Tue May 31 11:03:26 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.39 % SZS status Unsatisfiable % 0.20/0.39 % SZS output begin IncompleteProof % 0.20/0.39 cnf(c0, axiom, % 0.20/0.39 apply(combinator,X0) != X0). % 0.20/0.39 cnf(c1, plain, % 0.20/0.39 apply(combinator,X0) != X0, % 0.20/0.39 inference(start, [], [c0])). % 0.20/0.39 % 0.20/0.39 cnf(c2, axiom, % 0.20/0.39 apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3))). % 0.20/0.39 cnf(a0, assumption, % 0.20/0.39 apply(combinator,X0) = apply(X1,apply(X2,X3))). % 0.20/0.39 cnf(c3, plain, % 0.20/0.39 $false, % 0.20/0.39 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.20/0.39 cnf(c4, plain, % 0.20/0.39 $false, % 0.20/0.39 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.20/0.39 cnf(c5, plain, % 0.20/0.39 X4 != apply(apply(apply(b,X1),X2),X3) | X4 != X0, % 0.20/0.39 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.20/0.39 % 0.20/0.39 cnf(c6, axiom, % 0.20/0.39 apply(apply(apply(s,X5),X6),X7) = apply(apply(X5,X7),apply(X6,X7))). % 0.20/0.39 cnf(a1, assumption, % 0.20/0.39 apply(X8,X9) = apply(apply(apply(b,X1),X2),X3)). % 0.20/0.39 cnf(c7, plain, % 0.20/0.39 X4 != X0, % 0.20/0.39 inference(lazy_function_extension, [assumptions([a1])], [c5, c6])). % 0.20/0.39 cnf(c8, plain, % 0.20/0.39 $false, % 0.20/0.39 inference(lazy_function_extension, [assumptions([a1])], [c5, c6])). % 0.20/0.39 cnf(c9, plain, % 0.20/0.39 X8 != apply(X5,X7) | X9 != apply(X6,X7) | X10 != apply(apply(apply(s,X5),X6),X7) | X4 != X10, % 0.20/0.39 inference(lazy_function_extension, [assumptions([a1])], [c5, c6])). % 0.20/0.39 % 0.20/0.39 cnf(a2, assumption, % 0.20/0.39 X8 = apply(X5,X7)). % 0.20/0.39 cnf(c10, plain, % 0.20/0.39 X9 != apply(X6,X7) | X10 != apply(apply(apply(s,X5),X6),X7) | X4 != X10, % 0.20/0.39 inference(reflexivity, [assumptions([a2])], [c9])). % 0.20/0.39 % 0.20/0.39 cnf(c11, axiom, % 0.20/0.39 apply(i,X11) = X11). % 0.20/0.39 cnf(a3, assumption, % 0.20/0.39 apply(X6,X7) = apply(i,X11)). % 0.20/0.39 cnf(c12, plain, % 0.20/0.39 X10 != apply(apply(apply(s,X5),X6),X7) | X4 != X10, % 0.20/0.39 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 0.20/0.39 cnf(c13, plain, % 0.20/0.39 $false, % 0.20/0.39 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 0.20/0.39 cnf(c14, plain, % 0.20/0.39 X12 != X11 | X9 != X12, % 0.20/0.39 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 0.20/0.39 % 0.20/0.39 cnf(a4, assumption, % 0.20/0.39 X12 = X11). % 0.20/0.39 cnf(c15, plain, % 0.20/0.39 X9 != X12, % 0.20/0.39 inference(reflexivity, [assumptions([a4])], [c14])). % 0.20/0.39 % 0.20/0.39 cnf(a5, assumption, % 0.20/0.39 X9 = X12). % 0.20/0.39 cnf(c16, plain, % 0.20/0.39 $false, % 0.20/0.39 inference(reflexivity, [assumptions([a5])], [c15])). % 0.20/0.39 % 0.20/0.39 cnf(a6, assumption, % 0.20/0.39 X10 = apply(apply(apply(s,X5),X6),X7)). % 0.20/0.39 cnf(c17, plain, % 0.20/0.39 X4 != X10, % 0.20/0.39 inference(reflexivity, [assumptions([a6])], [c12])). % 0.20/0.39 % 0.20/0.39 cnf(a7, assumption, % 0.20/0.39 X4 = X10). % 0.20/0.39 cnf(c18, plain, % 0.20/0.39 $false, % 0.20/0.39 inference(reflexivity, [assumptions([a7])], [c17])). % 0.20/0.39 % 0.20/0.39 cnf(a8, assumption, % 0.20/0.39 X4 = X0). % 0.20/0.39 cnf(c19, plain, % 0.20/0.39 $false, % 0.20/0.39 inference(reflexivity, [assumptions([a8])], [c7])). % 0.20/0.39 % 0.20/0.39 cnf(c20, plain, % 0.20/0.39 $false, % 0.20/0.39 inference(constraint_solving, [ % 0.20/0.39 bind(X0, apply(X2,X3)), % 0.20/0.39 bind(X1, combinator), % 0.20/0.39 bind(X2, apply(apply(s,X5),X6)), % 0.20/0.39 bind(X3, apply(apply(s,X5),X6)), % 0.20/0.39 bind(X4, apply(apply(apply(s,X5),X6),X7)), % 0.20/0.39 bind(X5, apply(b,X1)), % 0.20/0.39 bind(X6, i), % 0.20/0.39 bind(X7, apply(apply(s,X5),X6)), % 0.20/0.39 bind(X10, apply(apply(apply(s,X5),X6),X7)), % 0.20/0.39 bind(X8, apply(apply(b,X1),X2)), % 0.20/0.39 bind(X9, apply(apply(s,X5),X6)), % 0.20/0.39 bind(X11, apply(apply(s,X5),X6)), % 0.20/0.39 bind(X12, apply(apply(s,X5),X6)) % 0.20/0.39 ], % 0.20/0.39 [a0, a1, a2, a3, a4, a5, a6, a7, a8])). % 0.20/0.39 % 0.20/0.39 % SZS output end IncompleteProof %------------------------------------------------------------------------------