%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN350-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 : n003.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:58 EDT 2022 % Result : Unsatisfiable 0.19s 0.95s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.72 % Problem : SYN350-1 : TPTP v8.1.0. Released v1.2.0. % 0.11/0.73 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.94 % Computer : n003.cluster.edu % 0.12/0.94 % Model : x86_64 x86_64 % 0.12/0.94 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.94 % Memory : 8042.1875MB % 0.12/0.94 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.94 % CPULimit : 300 % 0.12/0.94 % WCLimit : 600 % 0.12/0.94 % DateTime : Tue Jul 12 01:46:07 EDT 2022 % 0.12/0.94 % CPUTime : % 0.19/0.95 % SZS status Unsatisfiable % 0.19/0.95 % SZS output begin IncompleteProof % 0.19/0.95 cnf(c0, axiom, % 0.19/0.95 ~f(X0,X1) | ~f(X1,z(X0,X1)) | ~f(a,z(X0,X1))). % 0.19/0.95 cnf(c1, plain, % 0.19/0.95 ~f(X0,X1) | ~f(X1,z(X0,X1)) | ~f(a,z(X0,X1)), % 0.19/0.95 inference(start, [], [c0])). % 0.19/0.95 % 0.19/0.95 cnf(c2, axiom, % 0.19/0.95 f(z(X2,X3),a) | ~f(a,z(X2,X3))). % 0.19/0.95 cnf(a0, assumption, % 0.19/0.95 X0 = z(X2,X3)). % 0.19/0.95 cnf(a1, assumption, % 0.19/0.95 X1 = a). % 0.19/0.95 cnf(c3, plain, % 0.19/0.95 ~f(X1,z(X0,X1)) | ~f(a,z(X0,X1)), % 0.19/0.95 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.95 cnf(c4, plain, % 0.19/0.95 ~f(a,z(X2,X3)), % 0.19/0.95 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.95 % 0.19/0.95 cnf(c5, axiom, % 0.19/0.95 f(X4,z(X4,X5)) | f(X5,z(X4,X5)) | f(a,z(X4,X5))). % 0.19/0.95 cnf(a2, assumption, % 0.19/0.95 a = X5). % 0.19/0.95 cnf(a3, assumption, % 0.19/0.95 z(X2,X3) = z(X4,X5)). % 0.19/0.95 cnf(c6, plain, % 0.19/0.95 $false, % 0.19/0.95 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.19/0.95 cnf(c7, plain, % 0.19/0.95 f(X4,z(X4,X5)) | f(a,z(X4,X5)), % 0.19/0.95 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.19/0.95 % 0.19/0.95 cnf(c8, plain, % 0.19/0.95 ~f(a,z(X2,X3))). % 0.19/0.95 cnf(a4, assumption, % 0.19/0.95 X4 = a). % 0.19/0.95 cnf(a5, assumption, % 0.19/0.95 z(X4,X5) = z(X2,X3)). % 0.19/0.95 cnf(c9, plain, % 0.19/0.95 f(a,z(X4,X5)), % 0.19/0.95 inference(predicate_reduction, [assumptions([a4, a5])], [c7, c8])). % 0.19/0.95 % 0.19/0.95 cnf(c10, plain, % 0.19/0.95 ~f(a,z(X2,X3))). % 0.19/0.95 cnf(a6, assumption, % 0.19/0.95 a = a). % 0.19/0.95 cnf(a7, assumption, % 0.19/0.95 z(X4,X5) = z(X2,X3)). % 0.19/0.95 cnf(c11, plain, % 0.19/0.95 $false, % 0.19/0.95 inference(predicate_reduction, [assumptions([a6, a7])], [c9, c10])). % 0.19/0.95 % 0.19/0.95 cnf(c12, axiom, % 0.19/0.95 ~f(X6,X7) | f(X7,z(X6,X7)) | f(a,z(X6,X7))). % 0.19/0.95 cnf(a8, assumption, % 0.19/0.95 X1 = a). % 0.19/0.95 cnf(a9, assumption, % 0.19/0.95 z(X0,X1) = z(X6,X7)). % 0.19/0.95 cnf(c13, plain, % 0.19/0.95 ~f(a,z(X0,X1)), % 0.19/0.95 inference(strict_predicate_extension, [assumptions([a8, a9])], [c3, c12])). % 0.19/0.95 cnf(c14, plain, % 0.19/0.95 ~f(X6,X7) | f(X7,z(X6,X7)), % 0.19/0.95 inference(strict_predicate_extension, [assumptions([a8, a9])], [c3, c12])). % 0.19/0.95 % 0.19/0.95 cnf(c15, plain, % 0.19/0.95 f(X0,X1)). % 0.19/0.95 cnf(a10, assumption, % 0.19/0.95 X6 = X0). % 0.19/0.95 cnf(a11, assumption, % 0.19/0.95 X7 = X1). % 0.19/0.95 cnf(c16, plain, % 0.19/0.95 f(X7,z(X6,X7)), % 0.19/0.95 inference(predicate_reduction, [assumptions([a10, a11])], [c14, c15])). % 0.19/0.95 % 0.19/0.95 cnf(c17, plain, % 0.19/0.95 ~f(X1,z(X0,X1))). % 0.19/0.95 cnf(a12, assumption, % 0.19/0.95 X7 = X1). % 0.19/0.95 cnf(a13, assumption, % 0.19/0.95 z(X6,X7) = z(X0,X1)). % 0.19/0.95 cnf(c18, plain, % 0.19/0.95 $false, % 0.19/0.95 inference(predicate_reduction, [assumptions([a12, a13])], [c16, c17])). % 0.19/0.95 % 0.19/0.95 cnf(c19, plain, % 0.19/0.95 f(X1,z(X0,X1))). % 0.19/0.95 cnf(a14, assumption, % 0.19/0.95 a = X1). % 0.19/0.95 cnf(a15, assumption, % 0.19/0.95 z(X0,X1) = z(X0,X1)). % 0.19/0.95 cnf(c20, plain, % 0.19/0.95 $false, % 0.19/0.95 inference(predicate_reduction, [assumptions([a14, a15])], [c13, c19])). % 0.19/0.95 % 0.19/0.95 cnf(c21, plain, % 0.19/0.95 $false, % 0.19/0.95 inference(constraint_solving, [ % 0.19/0.95 bind(X0, z(X2,X3)), % 0.19/0.95 bind(X1, a), % 0.19/0.95 bind(X2, a), % 0.19/0.95 bind(X3, a), % 0.19/0.95 bind(X4, a), % 0.19/0.95 bind(X5, a), % 0.19/0.95 bind(X6, z(X2,X3)), % 0.19/0.95 bind(X7, a) % 0.19/0.95 ], % 0.19/0.95 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 0.19/0.95 % 0.19/0.95 % SZS output end IncompleteProof %------------------------------------------------------------------------------