%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : KRS108+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 : n025.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:13:01 EDT 2022 % Result : Unsatisfiable 0.19s 0.49s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : KRS108+1 : TPTP v8.1.0. Released v3.1.0. % 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n025.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jun 7 12:25:49 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.49 % SZS status Theorem % 0.19/0.49 % SZS output begin IncompleteProof % 0.19/0.49 cnf(c0, axiom, % 0.19/0.49 ~ra_Px5(X0,X1) | ~cp2xcomp(X0)). % 0.19/0.49 cnf(c1, plain, % 0.19/0.49 ~ra_Px5(X0,X1) | ~cp2xcomp(X0), % 0.19/0.49 inference(start, [], [c0])). % 0.19/0.49 % 0.19/0.49 cnf(c2, axiom, % 0.19/0.49 ra_Px5(X2,sK2(X2)) | ~cp2(X2)). % 0.19/0.49 cnf(a0, assumption, % 0.19/0.49 X0 = X2). % 0.19/0.49 cnf(a1, assumption, % 0.19/0.49 X1 = sK2(X2)). % 0.19/0.49 cnf(c3, plain, % 0.19/0.49 ~cp2xcomp(X0), % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.49 cnf(c4, plain, % 0.19/0.49 ~cp2(X2), % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.19/0.49 % 0.19/0.49 cnf(c5, axiom, % 0.19/0.49 cp2(X3) | ~cUnsatisfiable(X3)). % 0.19/0.49 cnf(a2, assumption, % 0.19/0.49 X2 = X3). % 0.19/0.49 cnf(c6, plain, % 0.19/0.49 $false, % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])). % 0.19/0.49 cnf(c7, plain, % 0.19/0.49 ~cUnsatisfiable(X3), % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])). % 0.19/0.49 % 0.19/0.49 cnf(c8, axiom, % 0.19/0.49 cUnsatisfiable(i2003_11_14_17_21_04740)). % 0.19/0.49 cnf(a3, assumption, % 0.19/0.49 X3 = i2003_11_14_17_21_04740). % 0.19/0.49 cnf(c9, plain, % 0.19/0.49 $false, % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a3])], [c7, c8])). % 0.19/0.49 cnf(c10, plain, % 0.19/0.49 $false, % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a3])], [c7, c8])). % 0.19/0.49 % 0.19/0.49 cnf(c11, axiom, % 0.19/0.49 cp2xcomp(X4) | ~ca_Cx1(X4)). % 0.19/0.49 cnf(a4, assumption, % 0.19/0.49 X0 = X4). % 0.19/0.49 cnf(c12, plain, % 0.19/0.49 $false, % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a4])], [c3, c11])). % 0.19/0.49 cnf(c13, plain, % 0.19/0.49 ~ca_Cx1(X4), % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a4])], [c3, c11])). % 0.19/0.49 % 0.19/0.49 cnf(c14, axiom, % 0.19/0.49 ca_Cx1(X5) | ~cp1(X5)). % 0.19/0.49 cnf(a5, assumption, % 0.19/0.49 X4 = X5). % 0.19/0.49 cnf(c15, plain, % 0.19/0.49 $false, % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a5])], [c13, c14])). % 0.19/0.49 cnf(c16, plain, % 0.19/0.49 ~cp1(X5), % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a5])], [c13, c14])). % 0.19/0.49 % 0.19/0.49 cnf(c17, axiom, % 0.19/0.49 cp1(sK12(X6)) | ~ca_Ax14(X6)). % 0.19/0.49 cnf(a6, assumption, % 0.19/0.49 X7 = X5). % 0.19/0.49 cnf(c18, plain, % 0.19/0.49 $false, % 0.19/0.49 inference(lazy_predicate_extension, [assumptions([a6])], [c16, c17])). % 0.19/0.49 cnf(c19, plain, % 0.19/0.49 ~ca_Ax14(X6), % 0.19/0.49 inference(lazy_predicate_extension, [assumptions([a6])], [c16, c17])). % 0.19/0.49 cnf(c20, plain, % 0.19/0.49 sK12(X6) != X7, % 0.19/0.49 inference(lazy_predicate_extension, [assumptions([a6])], [c16, c17])). % 0.19/0.49 % 0.19/0.49 cnf(c21, axiom, % 0.19/0.49 X8 = X9 | ~rr(X10,X9) | ~rr(X10,X8) | ~sP0(X10)). % 0.19/0.49 cnf(a7, assumption, % 0.19/0.49 sK12(X6) = X8). % 0.19/0.49 cnf(c22, plain, % 0.19/0.49 $false, % 0.19/0.49 inference(variable_extension, [assumptions([a7])], [c20, c21])). % 0.19/0.49 cnf(c23, plain, % 0.19/0.49 ~rr(X10,X9) | ~rr(X10,X8) | ~sP0(X10), % 0.19/0.49 inference(variable_extension, [assumptions([a7])], [c20, c21])). % 0.19/0.49 cnf(c24, plain, % 0.19/0.49 X9 != X11 | X11 != X7, % 0.19/0.49 inference(variable_extension, [assumptions([a7])], [c20, c21])). % 0.19/0.49 % 0.19/0.49 cnf(a8, assumption, % 0.19/0.49 X9 = X11). % 0.19/0.49 cnf(c25, plain, % 0.19/0.49 X11 != X7, % 0.19/0.49 inference(reflexivity, [assumptions([a8])], [c24])). % 0.19/0.49 % 0.19/0.49 cnf(a9, assumption, % 0.19/0.49 X11 = X7). % 0.19/0.49 cnf(c26, plain, % 0.19/0.49 $false, % 0.19/0.49 inference(reflexivity, [assumptions([a9])], [c25])). % 0.19/0.49 % 0.19/0.49 cnf(c27, axiom, % 0.19/0.49 rr(X12,X13) | ~rinvR(X13,X12)). % 0.19/0.49 cnf(a10, assumption, % 0.19/0.49 X10 = X12). % 0.19/0.49 cnf(a11, assumption, % 0.19/0.49 X9 = X13). % 0.19/0.49 cnf(c28, plain, % 0.19/0.49 ~rr(X10,X8) | ~sP0(X10), % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a10, a11])], [c23, c27])). % 0.19/0.49 cnf(c29, plain, % 0.19/0.49 ~rinvR(X13,X12), % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a10, a11])], [c23, c27])). % 0.19/0.49 % 0.19/0.49 cnf(c30, axiom, % 0.19/0.49 rinvR(X14,sK1(X14)) | ~cUnsatisfiable(X14)). % 0.19/0.49 cnf(a12, assumption, % 0.19/0.49 X13 = X14). % 0.19/0.49 cnf(a13, assumption, % 0.19/0.49 X12 = sK1(X14)). % 0.19/0.49 cnf(c31, plain, % 0.19/0.49 $false, % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a12, a13])], [c29, c30])). % 0.19/0.49 cnf(c32, plain, % 0.19/0.49 ~cUnsatisfiable(X14), % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a12, a13])], [c29, c30])). % 0.19/0.49 % 0.19/0.49 cnf(c33, plain, % 0.19/0.49 cUnsatisfiable(X3)). % 0.19/0.49 cnf(a14, assumption, % 0.19/0.49 X14 = X3). % 0.19/0.49 cnf(c34, plain, % 0.19/0.49 $false, % 0.19/0.49 inference(predicate_reduction, [assumptions([a14])], [c32, c33])). % 0.19/0.49 % 0.19/0.49 cnf(c35, axiom, % 0.19/0.49 rr(X15,sK12(X15)) | ~ca_Ax14(X15)). % 0.19/0.49 cnf(a15, assumption, % 0.19/0.49 X10 = X15). % 0.19/0.49 cnf(a16, assumption, % 0.19/0.49 X8 = sK12(X15)). % 0.19/0.49 cnf(c36, plain, % 0.19/0.49 ~sP0(X10), % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a15, a16])], [c28, c35])). % 0.19/0.49 cnf(c37, plain, % 0.19/0.49 ~ca_Ax14(X15), % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a15, a16])], [c28, c35])). % 0.19/0.49 % 0.19/0.49 cnf(c38, axiom, % 0.19/0.49 ca_Ax14(sK1(X16)) | ~cUnsatisfiable(X16)). % 0.19/0.49 cnf(a17, assumption, % 0.19/0.49 X15 = sK1(X16)). % 0.19/0.49 cnf(c39, plain, % 0.19/0.49 $false, % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a17])], [c37, c38])). % 0.19/0.49 cnf(c40, plain, % 0.19/0.49 ~cUnsatisfiable(X16), % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a17])], [c37, c38])). % 0.19/0.49 % 0.19/0.49 cnf(c41, plain, % 0.19/0.49 cUnsatisfiable(X3)). % 0.19/0.49 cnf(a18, assumption, % 0.19/0.49 X16 = X3). % 0.19/0.49 cnf(c42, plain, % 0.19/0.49 $false, % 0.19/0.49 inference(predicate_reduction, [assumptions([a18])], [c40, c41])). % 0.19/0.49 % 0.19/0.49 cnf(c43, axiom, % 0.19/0.49 sP0(X17) | ~ca_Ax14(X17)). % 0.19/0.49 cnf(a19, assumption, % 0.19/0.49 X10 = X17). % 0.19/0.49 cnf(c44, plain, % 0.19/0.49 $false, % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a19])], [c36, c43])). % 0.19/0.49 cnf(c45, plain, % 0.19/0.49 ~ca_Ax14(X17), % 0.19/0.49 inference(strict_predicate_extension, [assumptions([a19])], [c36, c43])). % 0.19/0.49 % 0.19/0.49 cnf(c46, plain, % 0.19/0.49 ca_Ax14(X15)). % 0.19/0.49 cnf(a20, assumption, % 0.19/0.49 X17 = X15). % 0.19/0.49 cnf(c47, plain, % 0.19/0.49 $false, % 0.19/0.49 inference(predicate_reduction, [assumptions([a20])], [c45, c46])). % 0.19/0.49 % 0.19/0.49 cnf(c48, plain, % 0.19/0.49 ca_Ax14(X15)). % 0.19/0.49 cnf(a21, assumption, % 0.19/0.49 X6 = X15). % 0.19/0.49 cnf(c49, plain, % 0.19/0.49 $false, % 0.19/0.49 inference(predicate_reduction, [assumptions([a21])], [c19, c48])). % 0.19/0.49 % 0.19/0.49 cnf(c50, plain, % 0.19/0.49 $false, % 0.19/0.49 inference(constraint_solving, [ % 0.19/0.49 bind(X0, i2003_11_14_17_21_04740), % 0.19/0.49 bind(X1, sK2(X2)), % 0.19/0.49 bind(X2, i2003_11_14_17_21_04740), % 0.19/0.49 bind(X3, i2003_11_14_17_21_04740), % 0.19/0.49 bind(X4, i2003_11_14_17_21_04740), % 0.19/0.49 bind(X5, i2003_11_14_17_21_04740), % 0.19/0.49 bind(X6, sK1(X14)), % 0.19/0.49 bind(X7, i2003_11_14_17_21_04740), % 0.19/0.49 bind(X8, sK12(X6)), % 0.19/0.49 bind(X9, i2003_11_14_17_21_04740), % 0.19/0.49 bind(X10, sK1(X14)), % 0.19/0.49 bind(X11, i2003_11_14_17_21_04740), % 0.19/0.49 bind(X12, sK1(X14)), % 0.19/0.49 bind(X13, i2003_11_14_17_21_04740), % 0.19/0.49 bind(X14, i2003_11_14_17_21_04740), % 0.19/0.49 bind(X15, sK1(X14)), % 0.19/0.49 bind(X16, i2003_11_14_17_21_04740), % 0.19/0.49 bind(X17, sK1(X14)) % 0.19/0.49 ], % 0.19/0.49 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])). % 0.19/0.49 % 0.19/0.49 % SZS output end IncompleteProof %------------------------------------------------------------------------------