%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN352-1 : TPTP v8.1.0. Released v1.2.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n020.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 : Thu Jul 21 08:09:59 EDT 2022 % Result : Unsatisfiable 0.13s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : SYN352-1 : TPTP v8.1.0. Released v1.2.0. % 0.08/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n020.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jul 11 19:39:42 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.35 % SZS status Unsatisfiable % 0.13/0.35 % SZS output begin IncompleteProof % 0.13/0.35 cnf(c0, axiom, % 0.13/0.35 ~f(X0,z(X1,X0)) | ~f(X1,z(X1,X0)) | ~f(X1,X0)). % 0.13/0.35 cnf(c1, plain, % 0.13/0.35 ~f(X0,z(X1,X0)) | ~f(X1,z(X1,X0)) | ~f(X1,X0), % 0.13/0.35 inference(start, [], [c0])). % 0.13/0.35 % 0.13/0.35 cnf(c2, axiom, % 0.13/0.35 f(X2,z(X3,X2)) | f(X3,z(X3,X2)) | ~f(X3,X2)). % 0.13/0.35 cnf(a0, assumption, % 0.13/0.35 X0 = X2). % 0.13/0.35 cnf(a1, assumption, % 0.13/0.35 z(X1,X0) = z(X3,X2)). % 0.13/0.35 cnf(c3, plain, % 0.13/0.35 ~f(X1,z(X1,X0)) | ~f(X1,X0), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.35 cnf(c4, plain, % 0.13/0.35 f(X3,z(X3,X2)) | ~f(X3,X2), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.35 % 0.13/0.35 cnf(c5, plain, % 0.13/0.35 ~f(X0,z(X1,X0))). % 0.13/0.35 cnf(a2, assumption, % 0.13/0.35 X3 = X0). % 0.13/0.35 cnf(a3, assumption, % 0.13/0.35 z(X3,X2) = z(X1,X0)). % 0.13/0.35 cnf(c6, plain, % 0.13/0.35 ~f(X3,X2), % 0.13/0.35 inference(predicate_reduction, [assumptions([a2, a3])], [c4, c5])). % 0.13/0.35 % 0.13/0.35 cnf(c7, axiom, % 0.13/0.35 f(z(X4,X5),z(X4,X5)) | ~f(X4,z(X4,X5)) | ~f(b,z(X4,X5))). % 0.13/0.35 cnf(a4, assumption, % 0.13/0.35 X3 = z(X4,X5)). % 0.13/0.35 cnf(a5, assumption, % 0.13/0.35 X2 = z(X4,X5)). % 0.13/0.35 cnf(c8, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c7])). % 0.13/0.35 cnf(c9, plain, % 0.13/0.35 ~f(X4,z(X4,X5)) | ~f(b,z(X4,X5)), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c7])). % 0.13/0.35 % 0.13/0.35 cnf(c10, axiom, % 0.13/0.35 f(z(X6,X7),z(X6,X7)) | f(X6,z(X6,X7)) | f(b,z(X6,X7))). % 0.13/0.35 cnf(a6, assumption, % 0.13/0.35 X4 = X6). % 0.13/0.35 cnf(a7, assumption, % 0.13/0.35 z(X4,X5) = z(X6,X7)). % 0.13/0.35 cnf(c11, plain, % 0.13/0.35 ~f(b,z(X4,X5)), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c10])). % 0.13/0.35 cnf(c12, plain, % 0.13/0.35 f(z(X6,X7),z(X6,X7)) | f(b,z(X6,X7)), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c10])). % 0.13/0.35 % 0.13/0.35 cnf(c13, plain, % 0.13/0.35 ~f(X3,X2)). % 0.13/0.35 cnf(a8, assumption, % 0.13/0.35 z(X6,X7) = X3). % 0.13/0.35 cnf(a9, assumption, % 0.13/0.35 z(X6,X7) = X2). % 0.13/0.35 cnf(c14, plain, % 0.13/0.35 f(b,z(X6,X7)), % 0.13/0.35 inference(predicate_reduction, [assumptions([a8, a9])], [c12, c13])). % 0.13/0.35 % 0.13/0.35 cnf(c15, plain, % 0.13/0.35 ~f(X4,z(X4,X5))). % 0.13/0.35 cnf(a10, assumption, % 0.13/0.35 b = X4). % 0.13/0.35 cnf(a11, assumption, % 0.13/0.35 z(X6,X7) = z(X4,X5)). % 0.13/0.35 cnf(c16, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(predicate_reduction, [assumptions([a10, a11])], [c14, c15])). % 0.13/0.35 % 0.13/0.35 cnf(c17, plain, % 0.13/0.35 f(X4,z(X4,X5))). % 0.13/0.35 cnf(a12, assumption, % 0.13/0.35 b = X4). % 0.13/0.35 cnf(a13, assumption, % 0.13/0.35 z(X4,X5) = z(X4,X5)). % 0.13/0.35 cnf(c18, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(predicate_reduction, [assumptions([a12, a13])], [c11, c17])). % 0.13/0.35 % 0.13/0.35 cnf(c19, plain, % 0.13/0.35 f(X0,z(X1,X0))). % 0.13/0.35 cnf(a14, assumption, % 0.13/0.35 X1 = X0). % 0.13/0.35 cnf(a15, assumption, % 0.13/0.35 z(X1,X0) = z(X1,X0)). % 0.13/0.35 cnf(c20, plain, % 0.13/0.35 ~f(X1,X0), % 0.13/0.35 inference(predicate_reduction, [assumptions([a14, a15])], [c3, c19])). % 0.13/0.35 % 0.13/0.35 cnf(c21, plain, % 0.13/0.35 f(X3,X2)). % 0.13/0.35 cnf(a16, assumption, % 0.13/0.35 X1 = X3). % 0.13/0.35 cnf(a17, assumption, % 0.13/0.35 X0 = X2). % 0.13/0.35 cnf(c22, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(predicate_reduction, [assumptions([a16, a17])], [c20, c21])). % 0.13/0.35 % 0.13/0.35 cnf(c23, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(constraint_solving, [ % 0.13/0.35 bind(X0, z(X4,X5)), % 0.13/0.35 bind(X1, z(X4,X5)), % 0.13/0.35 bind(X2, z(X4,X5)), % 0.13/0.35 bind(X3, z(X4,X5)), % 0.13/0.35 bind(X4, b), % 0.13/0.35 bind(X5, X7), % 0.13/0.35 bind(X6, b), % 0.13/0.35 bind(X7, X7) % 0.13/0.35 ], % 0.13/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])). % 0.13/0.35 % 0.13/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------