%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : KRS072+1 : TPTP v8.1.0. Released v3.1.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 : Sun Jul 17 03:12:55 EDT 2022 % Result : Unsatisfiable 0.16s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : KRS072+1 : TPTP v8.1.0. Released v3.1.0. % 0.08/0.15 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.16/0.37 % Computer : n020.cluster.edu % 0.16/0.37 % Model : x86_64 x86_64 % 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.37 % Memory : 8042.1875MB % 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.37 % CPULimit : 300 % 0.16/0.37 % WCLimit : 600 % 0.16/0.37 % DateTime : Tue Jun 7 20:20:06 EDT 2022 % 0.16/0.37 % CPUTime : % 0.16/0.38 % SZS status Theorem % 0.16/0.38 % SZS output begin IncompleteProof % 0.16/0.38 cnf(c0, axiom, % 0.16/0.38 ~cp2(X0) | ~sP1(X0)). % 0.16/0.38 cnf(c1, plain, % 0.16/0.38 ~cp2(X0) | ~sP1(X0), % 0.16/0.38 inference(start, [], [c0])). % 0.16/0.38 % 0.16/0.38 cnf(c2, axiom, % 0.16/0.38 cp2(X1) | ~cUnsatisfiable(X1)). % 0.16/0.38 cnf(a0, assumption, % 0.16/0.38 X0 = X1). % 0.16/0.38 cnf(c3, plain, % 0.16/0.38 ~sP1(X0), % 0.16/0.38 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.16/0.38 cnf(c4, plain, % 0.16/0.38 ~cUnsatisfiable(X1), % 0.16/0.38 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.16/0.38 % 0.16/0.38 cnf(c5, axiom, % 0.16/0.38 cUnsatisfiable(i2003_11_14_17_18_50190)). % 0.16/0.38 cnf(a1, assumption, % 0.16/0.38 X1 = i2003_11_14_17_18_50190). % 0.16/0.38 cnf(c6, plain, % 0.16/0.38 $false, % 0.16/0.38 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.16/0.38 cnf(c7, plain, % 0.16/0.38 $false, % 0.16/0.38 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.16/0.38 % 0.16/0.38 cnf(c8, axiom, % 0.16/0.38 sP1(X2) | ~cp1(X2)). % 0.16/0.38 cnf(a2, assumption, % 0.16/0.38 X0 = X2). % 0.16/0.38 cnf(c9, plain, % 0.16/0.38 $false, % 0.16/0.38 inference(strict_predicate_extension, [assumptions([a2])], [c3, c8])). % 0.16/0.38 cnf(c10, plain, % 0.16/0.38 ~cp1(X2), % 0.16/0.38 inference(strict_predicate_extension, [assumptions([a2])], [c3, c8])). % 0.16/0.38 % 0.16/0.38 cnf(c11, axiom, % 0.16/0.38 cp1(sK6(X3)) | ~cUnsatisfiable(X3)). % 0.16/0.38 cnf(a3, assumption, % 0.16/0.38 X4 = X2). % 0.16/0.38 cnf(c12, plain, % 0.16/0.38 $false, % 0.16/0.38 inference(lazy_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.16/0.38 cnf(c13, plain, % 0.16/0.38 ~cUnsatisfiable(X3), % 0.16/0.38 inference(lazy_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.16/0.38 cnf(c14, plain, % 0.16/0.38 sK6(X3) != X4, % 0.16/0.38 inference(lazy_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.16/0.38 % 0.16/0.38 cnf(c15, axiom, % 0.16/0.38 X5 = X6 | ~rr(X7,X6) | ~rr(X7,X5) | ~sP0(X7)). % 0.16/0.38 cnf(a4, assumption, % 0.16/0.38 sK6(X3) = X5). % 0.16/0.38 cnf(c16, plain, % 0.16/0.38 $false, % 0.16/0.38 inference(variable_extension, [assumptions([a4])], [c14, c15])). % 0.16/0.38 cnf(c17, plain, % 0.16/0.38 ~rr(X7,X6) | ~rr(X7,X5) | ~sP0(X7), % 0.16/0.38 inference(variable_extension, [assumptions([a4])], [c14, c15])). % 0.16/0.38 cnf(c18, plain, % 0.16/0.38 X6 != X8 | X8 != X4, % 0.16/0.38 inference(variable_extension, [assumptions([a4])], [c14, c15])). % 0.16/0.38 % 0.16/0.38 cnf(a5, assumption, % 0.16/0.38 X6 = X8). % 0.16/0.38 cnf(c19, plain, % 0.16/0.38 X8 != X4, % 0.16/0.38 inference(reflexivity, [assumptions([a5])], [c18])). % 0.16/0.38 % 0.16/0.38 cnf(a6, assumption, % 0.16/0.38 X8 = X4). % 0.16/0.38 cnf(c20, plain, % 0.16/0.38 $false, % 0.16/0.38 inference(reflexivity, [assumptions([a6])], [c19])). % 0.16/0.38 % 0.16/0.38 cnf(c21, axiom, % 0.16/0.38 rr(X9,X10) | ~rinvR(X10,X9)). % 0.16/0.38 cnf(a7, assumption, % 0.16/0.38 X7 = X9). % 0.16/0.38 cnf(a8, assumption, % 0.16/0.38 X6 = X10). % 0.16/0.38 cnf(c22, plain, % 0.16/0.38 ~rr(X7,X5) | ~sP0(X7), % 0.16/0.38 inference(strict_predicate_extension, [assumptions([a7, a8])], [c17, c21])). % 0.16/0.38 cnf(c23, plain, % 0.16/0.38 ~rinvR(X10,X9), % 0.16/0.38 inference(strict_predicate_extension, [assumptions([a7, a8])], [c17, c21])). % 0.16/0.38 % 0.16/0.38 cnf(c24, axiom, % 0.16/0.38 rinvR(X11,sK5(X11)) | ~cUnsatisfiable(X11)). % 0.16/0.38 cnf(a9, assumption, % 0.16/0.38 X10 = X11). % 0.16/0.38 cnf(a10, assumption, % 0.16/0.38 X9 = sK5(X11)). % 0.16/0.38 cnf(c25, plain, % 0.16/0.38 $false, % 0.16/0.38 inference(strict_predicate_extension, [assumptions([a9, a10])], [c23, c24])). % 0.16/0.38 cnf(c26, plain, % 0.16/0.38 ~cUnsatisfiable(X11), % 0.16/0.38 inference(strict_predicate_extension, [assumptions([a9, a10])], [c23, c24])). % 0.16/0.38 % 0.16/0.38 cnf(c27, plain, % 0.16/0.38 cUnsatisfiable(X1)). % 0.16/0.38 cnf(a11, assumption, % 0.16/0.38 X11 = X1). % 0.16/0.38 cnf(c28, plain, % 0.16/0.38 $false, % 0.16/0.38 inference(predicate_reduction, [assumptions([a11])], [c26, c27])). % 0.16/0.38 % 0.16/0.38 cnf(c29, axiom, % 0.16/0.38 rr(sK5(X12),sK6(X12)) | ~cUnsatisfiable(X12)). % 0.16/0.38 cnf(a12, assumption, % 0.16/0.38 X7 = sK5(X12)). % 0.16/0.38 cnf(a13, assumption, % 0.16/0.38 X5 = sK6(X12)). % 0.16/0.38 cnf(c30, plain, % 0.16/0.38 ~sP0(X7), % 0.16/0.38 inference(strict_predicate_extension, [assumptions([a12, a13])], [c22, c29])). % 0.16/0.38 cnf(c31, plain, % 0.16/0.38 ~cUnsatisfiable(X12), % 0.16/0.38 inference(strict_predicate_extension, [assumptions([a12, a13])], [c22, c29])). % 0.16/0.38 % 0.16/0.38 cnf(c32, plain, % 0.16/0.38 cUnsatisfiable(X1)). % 0.16/0.38 cnf(a14, assumption, % 0.16/0.38 X12 = X1). % 0.16/0.38 cnf(c33, plain, % 0.16/0.38 $false, % 0.16/0.38 inference(predicate_reduction, [assumptions([a14])], [c31, c32])). % 0.16/0.38 % 0.16/0.38 cnf(c34, axiom, % 0.16/0.38 sP0(sK5(X13)) | ~cUnsatisfiable(X13)). % 0.16/0.38 cnf(a15, assumption, % 0.16/0.38 X7 = sK5(X13)). % 0.16/0.38 cnf(c35, plain, % 0.16/0.38 $false, % 0.16/0.38 inference(strict_predicate_extension, [assumptions([a15])], [c30, c34])). % 0.16/0.38 cnf(c36, plain, % 0.16/0.38 ~cUnsatisfiable(X13), % 0.16/0.38 inference(strict_predicate_extension, [assumptions([a15])], [c30, c34])). % 0.16/0.38 % 0.16/0.38 cnf(c37, plain, % 0.16/0.38 cUnsatisfiable(X1)). % 0.16/0.38 cnf(a16, assumption, % 0.16/0.38 X13 = X1). % 0.16/0.38 cnf(c38, plain, % 0.16/0.38 $false, % 0.16/0.38 inference(predicate_reduction, [assumptions([a16])], [c36, c37])). % 0.16/0.38 % 0.16/0.38 cnf(c39, plain, % 0.16/0.38 cUnsatisfiable(X1)). % 0.16/0.38 cnf(a17, assumption, % 0.16/0.38 X3 = X1). % 0.16/0.38 cnf(c40, plain, % 0.16/0.38 $false, % 0.16/0.38 inference(predicate_reduction, [assumptions([a17])], [c13, c39])). % 0.16/0.38 % 0.16/0.38 cnf(c41, plain, % 0.16/0.38 $false, % 0.16/0.38 inference(constraint_solving, [ % 0.16/0.38 bind(X0, i2003_11_14_17_18_50190), % 0.16/0.38 bind(X1, i2003_11_14_17_18_50190), % 0.16/0.38 bind(X2, i2003_11_14_17_18_50190), % 0.16/0.38 bind(X3, i2003_11_14_17_18_50190), % 0.16/0.38 bind(X4, i2003_11_14_17_18_50190), % 0.16/0.38 bind(X5, sK6(X3)), % 0.16/0.38 bind(X6, i2003_11_14_17_18_50190), % 0.16/0.38 bind(X7, sK5(X11)), % 0.16/0.38 bind(X8, i2003_11_14_17_18_50190), % 0.16/0.38 bind(X9, sK5(X11)), % 0.16/0.38 bind(X10, i2003_11_14_17_18_50190), % 0.16/0.38 bind(X11, i2003_11_14_17_18_50190), % 0.16/0.38 bind(X12, i2003_11_14_17_18_50190), % 0.16/0.38 bind(X13, i2003_11_14_17_18_50190) % 0.16/0.38 ], % 0.16/0.38 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])). % 0.16/0.38 % 0.16/0.38 % SZS output end IncompleteProof %------------------------------------------------------------------------------