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