%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : KRS078+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 : n028.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:57 EDT 2022 % Result : Unsatisfiable 0.13s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : KRS078+1 : TPTP v8.1.0. Released v3.1.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.34 % Computer : n028.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 : Tue Jun 7 13:52:30 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.35 % SZS status Theorem % 0.13/0.35 % SZS output begin IncompleteProof % 0.13/0.35 cnf(c0, axiom, % 0.13/0.35 ~cp(sK6(X0)) | ~cUnsatisfiable(X0)). % 0.13/0.35 cnf(c1, plain, % 0.13/0.35 ~cp(sK6(X0)) | ~cUnsatisfiable(X0), % 0.13/0.35 inference(start, [], [c0])). % 0.13/0.35 % 0.13/0.35 cnf(c2, axiom, % 0.13/0.35 cp(X1) | ~rs(sK3(X2),X1) | ~sP1(X2)). % 0.13/0.35 cnf(a0, assumption, % 0.13/0.35 sK6(X0) = X1). % 0.13/0.35 cnf(c3, plain, % 0.13/0.35 ~cUnsatisfiable(X0), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.35 cnf(c4, plain, % 0.13/0.35 ~rs(sK3(X2),X1) | ~sP1(X2), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.35 % 0.13/0.35 cnf(c5, axiom, % 0.13/0.35 X3 = X4 | ~rinvR(X5,X4) | ~rinvR(X5,X3) | ~sP0(X5)). % 0.13/0.35 cnf(a1, assumption, % 0.13/0.35 sK3(X2) = X4). % 0.13/0.35 cnf(c6, plain, % 0.13/0.35 ~sP1(X2), % 0.13/0.35 inference(variable_extension, [assumptions([a1])], [c4, c5])). % 0.13/0.35 cnf(c7, plain, % 0.13/0.35 ~rinvR(X5,X4) | ~rinvR(X5,X3) | ~sP0(X5), % 0.13/0.35 inference(variable_extension, [assumptions([a1])], [c4, c5])). % 0.13/0.35 cnf(c8, plain, % 0.13/0.35 X3 != X6 | ~rs(X6,X1), % 0.13/0.35 inference(variable_extension, [assumptions([a1])], [c4, c5])). % 0.13/0.35 % 0.13/0.35 cnf(a2, assumption, % 0.13/0.35 X3 = X6). % 0.13/0.35 cnf(c9, plain, % 0.13/0.35 ~rs(X6,X1), % 0.13/0.35 inference(reflexivity, [assumptions([a2])], [c8])). % 0.13/0.35 % 0.13/0.35 cnf(c10, axiom, % 0.13/0.35 rs(X7,sK6(X7)) | ~cUnsatisfiable(X7)). % 0.13/0.35 cnf(a3, assumption, % 0.13/0.35 X6 = X7). % 0.13/0.35 cnf(a4, assumption, % 0.13/0.35 X1 = sK6(X7)). % 0.13/0.35 cnf(c11, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c9, c10])). % 0.13/0.35 cnf(c12, plain, % 0.13/0.35 ~cUnsatisfiable(X7), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c9, c10])). % 0.13/0.35 % 0.13/0.35 cnf(c13, axiom, % 0.13/0.35 cUnsatisfiable(i2003_11_14_17_19_13721)). % 0.13/0.35 cnf(a5, assumption, % 0.13/0.35 X7 = i2003_11_14_17_19_13721). % 0.13/0.35 cnf(c14, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c12, c13])). % 0.13/0.35 cnf(c15, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c12, c13])). % 0.13/0.35 % 0.13/0.35 cnf(c16, axiom, % 0.13/0.35 rinvR(X8,sK3(X8)) | ~sP1(X8)). % 0.13/0.35 cnf(a6, assumption, % 0.13/0.35 X5 = X8). % 0.13/0.35 cnf(a7, assumption, % 0.13/0.35 X4 = sK3(X8)). % 0.13/0.35 cnf(c17, plain, % 0.13/0.35 ~rinvR(X5,X3) | ~sP0(X5), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c7, c16])). % 0.13/0.35 cnf(c18, plain, % 0.13/0.35 ~sP1(X8), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c7, c16])). % 0.13/0.35 % 0.13/0.35 cnf(c19, axiom, % 0.13/0.35 sP1(sK7(X9)) | ~cUnsatisfiable(X9)). % 0.13/0.35 cnf(a8, assumption, % 0.13/0.35 X8 = sK7(X9)). % 0.13/0.35 cnf(c20, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a8])], [c18, c19])). % 0.13/0.35 cnf(c21, plain, % 0.13/0.35 ~cUnsatisfiable(X9), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a8])], [c18, c19])). % 0.13/0.35 % 0.13/0.35 cnf(c22, plain, % 0.13/0.35 cUnsatisfiable(X7)). % 0.13/0.35 cnf(a9, assumption, % 0.13/0.35 X9 = X7). % 0.13/0.35 cnf(c23, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(predicate_reduction, [assumptions([a9])], [c21, c22])). % 0.13/0.35 % 0.13/0.35 cnf(c24, axiom, % 0.13/0.35 rinvR(X10,X11) | ~rr(X11,X10)). % 0.13/0.35 cnf(a10, assumption, % 0.13/0.35 X5 = X10). % 0.13/0.35 cnf(a11, assumption, % 0.13/0.35 X3 = X11). % 0.13/0.35 cnf(c25, plain, % 0.13/0.35 ~sP0(X5), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a10, a11])], [c17, c24])). % 0.13/0.35 cnf(c26, plain, % 0.13/0.35 ~rr(X11,X10), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a10, a11])], [c17, c24])). % 0.13/0.35 % 0.13/0.35 cnf(c27, axiom, % 0.13/0.35 rr(X12,sK7(X12)) | ~cUnsatisfiable(X12)). % 0.13/0.35 cnf(a12, assumption, % 0.13/0.35 X11 = X12). % 0.13/0.35 cnf(a13, assumption, % 0.13/0.35 X10 = sK7(X12)). % 0.13/0.35 cnf(c28, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a12, a13])], [c26, c27])). % 0.13/0.35 cnf(c29, plain, % 0.13/0.35 ~cUnsatisfiable(X12), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a12, a13])], [c26, c27])). % 0.13/0.35 % 0.13/0.35 cnf(c30, plain, % 0.13/0.35 cUnsatisfiable(X7)). % 0.13/0.35 cnf(a14, assumption, % 0.13/0.35 X12 = X7). % 0.13/0.35 cnf(c31, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(predicate_reduction, [assumptions([a14])], [c29, c30])). % 0.13/0.35 % 0.13/0.35 cnf(c32, axiom, % 0.13/0.35 sP0(sK7(X13)) | ~cUnsatisfiable(X13)). % 0.13/0.35 cnf(a15, assumption, % 0.13/0.35 X5 = sK7(X13)). % 0.13/0.35 cnf(c33, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a15])], [c25, c32])). % 0.13/0.35 cnf(c34, plain, % 0.13/0.35 ~cUnsatisfiable(X13), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a15])], [c25, c32])). % 0.13/0.35 % 0.13/0.35 cnf(c35, plain, % 0.13/0.35 cUnsatisfiable(X7)). % 0.13/0.35 cnf(a16, assumption, % 0.13/0.35 X13 = X7). % 0.13/0.35 cnf(c36, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(predicate_reduction, [assumptions([a16])], [c34, c35])). % 0.13/0.35 % 0.13/0.35 cnf(c37, plain, % 0.13/0.35 sP1(X8)). % 0.13/0.35 cnf(a17, assumption, % 0.13/0.35 X2 = X8). % 0.13/0.35 cnf(c38, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(predicate_reduction, [assumptions([a17])], [c6, c37])). % 0.13/0.35 % 0.13/0.35 cnf(c39, plain, % 0.13/0.35 cUnsatisfiable(X7)). % 0.13/0.35 cnf(a18, assumption, % 0.13/0.35 X0 = X7). % 0.13/0.35 cnf(c40, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(predicate_reduction, [assumptions([a18])], [c3, c39])). % 0.13/0.35 % 0.13/0.35 cnf(c41, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(constraint_solving, [ % 0.13/0.35 bind(X0, i2003_11_14_17_19_13721), % 0.13/0.35 bind(X1, sK6(X0)), % 0.13/0.35 bind(X2, sK7(X9)), % 0.13/0.35 bind(X3, i2003_11_14_17_19_13721), % 0.13/0.35 bind(X4, sK3(X2)), % 0.13/0.35 bind(X5, sK7(X9)), % 0.13/0.35 bind(X6, i2003_11_14_17_19_13721), % 0.13/0.35 bind(X7, i2003_11_14_17_19_13721), % 0.13/0.35 bind(X8, sK7(X9)), % 0.13/0.35 bind(X9, i2003_11_14_17_19_13721), % 0.13/0.35 bind(X10, sK7(X9)), % 0.13/0.35 bind(X11, i2003_11_14_17_19_13721), % 0.13/0.35 bind(X12, i2003_11_14_17_19_13721), % 0.13/0.35 bind(X13, i2003_11_14_17_19_13721) % 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, a18])). % 0.13/0.35 % 0.13/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------