%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : KRS088+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:58 EDT 2022 % Result : Unsatisfiable 0.13s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : KRS088+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 : n020.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 19:40:36 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.36 % SZS status Theorem % 0.13/0.36 % SZS output begin IncompleteProof % 0.13/0.36 cnf(c0, axiom, % 0.13/0.36 ~cp1(sK2(X0)) | ~rinvF(X1,X0) | ~sP0(X1)). % 0.13/0.36 cnf(c1, plain, % 0.13/0.36 ~cp1(sK2(X0)) | ~rinvF(X1,X0) | ~sP0(X1), % 0.13/0.36 inference(start, [], [c0])). % 0.13/0.36 % 0.13/0.36 cnf(c2, axiom, % 0.13/0.36 cp1(sK3(X2)) | ~cUnsatisfiable(X2)). % 0.13/0.36 cnf(a0, assumption, % 0.13/0.36 X3 = sK2(X0)). % 0.13/0.36 cnf(c3, plain, % 0.13/0.36 ~rinvF(X1,X0) | ~sP0(X1), % 0.13/0.36 inference(lazy_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.36 cnf(c4, plain, % 0.13/0.36 ~cUnsatisfiable(X2), % 0.13/0.36 inference(lazy_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.36 cnf(c5, plain, % 0.13/0.36 sK3(X2) != X3, % 0.13/0.36 inference(lazy_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.36 % 0.13/0.36 cnf(c6, axiom, % 0.13/0.36 X4 = X5 | ~rf(X6,X5) | ~rf(X6,X4)). % 0.13/0.36 cnf(a1, assumption, % 0.13/0.36 sK3(X2) = X5). % 0.13/0.36 cnf(c7, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(variable_extension, [assumptions([a1])], [c5, c6])). % 0.13/0.36 cnf(c8, plain, % 0.13/0.36 ~rf(X6,X5) | ~rf(X6,X4), % 0.13/0.36 inference(variable_extension, [assumptions([a1])], [c5, c6])). % 0.13/0.36 cnf(c9, plain, % 0.13/0.36 X4 != X7 | X7 != X3, % 0.13/0.36 inference(variable_extension, [assumptions([a1])], [c5, c6])). % 0.13/0.36 % 0.13/0.36 cnf(a2, assumption, % 0.13/0.36 X4 = X7). % 0.13/0.36 cnf(c10, plain, % 0.13/0.36 X7 != X3, % 0.13/0.36 inference(reflexivity, [assumptions([a2])], [c9])). % 0.13/0.36 % 0.13/0.36 cnf(a3, assumption, % 0.13/0.36 X7 = X3). % 0.13/0.36 cnf(c11, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(reflexivity, [assumptions([a3])], [c10])). % 0.13/0.36 % 0.13/0.36 cnf(c12, axiom, % 0.13/0.36 rf(X8,sK3(X8)) | ~cUnsatisfiable(X8)). % 0.13/0.36 cnf(a4, assumption, % 0.13/0.36 X6 = X8). % 0.13/0.36 cnf(a5, assumption, % 0.13/0.36 X5 = sK3(X8)). % 0.13/0.36 cnf(c13, plain, % 0.13/0.36 ~rf(X6,X4), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c12])). % 0.13/0.36 cnf(c14, plain, % 0.13/0.36 ~cUnsatisfiable(X8), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c12])). % 0.13/0.36 % 0.13/0.36 cnf(c15, axiom, % 0.13/0.36 cUnsatisfiable(i2003_11_14_17_19_49673)). % 0.13/0.36 cnf(a6, assumption, % 0.13/0.36 X8 = i2003_11_14_17_19_49673). % 0.13/0.36 cnf(c16, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a6])], [c14, c15])). % 0.13/0.36 cnf(c17, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a6])], [c14, c15])). % 0.13/0.36 % 0.13/0.36 cnf(c18, axiom, % 0.13/0.36 rf(X9,sK2(X9)) | ~rinvF(X10,X9) | ~sP0(X10)). % 0.13/0.36 cnf(a7, assumption, % 0.13/0.36 X6 = X9). % 0.13/0.36 cnf(a8, assumption, % 0.13/0.36 X4 = sK2(X9)). % 0.13/0.36 cnf(c19, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c18])). % 0.13/0.36 cnf(c20, plain, % 0.13/0.36 ~rinvF(X10,X9) | ~sP0(X10), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c18])). % 0.13/0.36 % 0.13/0.36 cnf(c21, axiom, % 0.13/0.36 rinvF(X11,X12) | ~rf(X12,X11)). % 0.13/0.36 cnf(a9, assumption, % 0.13/0.36 X10 = X11). % 0.13/0.36 cnf(a10, assumption, % 0.13/0.36 X9 = X12). % 0.13/0.36 cnf(c22, plain, % 0.13/0.36 ~sP0(X10), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a9, a10])], [c20, c21])). % 0.13/0.36 cnf(c23, plain, % 0.13/0.36 ~rf(X12,X11), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a9, a10])], [c20, c21])). % 0.13/0.36 % 0.13/0.36 cnf(c24, plain, % 0.13/0.36 rf(X6,X5)). % 0.13/0.36 cnf(a11, assumption, % 0.13/0.36 X12 = X6). % 0.13/0.36 cnf(a12, assumption, % 0.13/0.36 X11 = X5). % 0.13/0.36 cnf(c25, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(predicate_reduction, [assumptions([a11, a12])], [c23, c24])). % 0.13/0.36 % 0.13/0.36 cnf(c26, axiom, % 0.13/0.36 sP0(sK3(X13)) | ~cUnsatisfiable(X13)). % 0.13/0.36 cnf(a13, assumption, % 0.13/0.36 X10 = sK3(X13)). % 0.13/0.36 cnf(c27, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a13])], [c22, c26])). % 0.13/0.36 cnf(c28, plain, % 0.13/0.36 ~cUnsatisfiable(X13), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a13])], [c22, c26])). % 0.13/0.36 % 0.13/0.36 cnf(c29, plain, % 0.13/0.36 cUnsatisfiable(X8)). % 0.13/0.36 cnf(a14, assumption, % 0.13/0.36 X13 = X8). % 0.13/0.36 cnf(c30, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(predicate_reduction, [assumptions([a14])], [c28, c29])). % 0.13/0.36 % 0.13/0.36 cnf(c31, plain, % 0.13/0.36 cUnsatisfiable(X8)). % 0.13/0.36 cnf(a15, assumption, % 0.13/0.36 X2 = X8). % 0.13/0.36 cnf(c32, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(predicate_reduction, [assumptions([a15])], [c4, c31])). % 0.13/0.36 % 0.13/0.36 cnf(c33, plain, % 0.13/0.36 rinvF(X10,X9)). % 0.13/0.36 cnf(a16, assumption, % 0.13/0.36 X1 = X10). % 0.13/0.36 cnf(a17, assumption, % 0.13/0.36 X0 = X9). % 0.13/0.36 cnf(c34, plain, % 0.13/0.36 ~sP0(X1), % 0.13/0.36 inference(predicate_reduction, [assumptions([a16, a17])], [c3, c33])). % 0.13/0.36 % 0.13/0.36 cnf(c35, plain, % 0.13/0.36 sP0(X10)). % 0.13/0.36 cnf(a18, assumption, % 0.13/0.36 X1 = X10). % 0.13/0.36 cnf(c36, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(predicate_reduction, [assumptions([a18])], [c34, c35])). % 0.13/0.36 % 0.13/0.36 cnf(c37, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(constraint_solving, [ % 0.13/0.36 bind(X0, i2003_11_14_17_19_49673), % 0.13/0.36 bind(X1, sK3(X2)), % 0.13/0.36 bind(X2, i2003_11_14_17_19_49673), % 0.13/0.36 bind(X3, sK2(X0)), % 0.13/0.36 bind(X4, sK2(X0)), % 0.13/0.36 bind(X5, sK3(X2)), % 0.13/0.36 bind(X6, i2003_11_14_17_19_49673), % 0.13/0.36 bind(X7, sK2(X0)), % 0.13/0.36 bind(X8, i2003_11_14_17_19_49673), % 0.13/0.36 bind(X9, i2003_11_14_17_19_49673), % 0.13/0.36 bind(X10, sK3(X2)), % 0.13/0.36 bind(X11, sK3(X2)), % 0.13/0.36 bind(X12, i2003_11_14_17_19_49673), % 0.13/0.36 bind(X13, i2003_11_14_17_19_49673) % 0.13/0.36 ], % 0.13/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])). % 0.13/0.36 % 0.13/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------