%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : KRS128+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 : n019.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:04 EDT 2022 % Result : Unsatisfiable 0.12s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : KRS128+1 : TPTP v8.1.0. Released v3.1.0. % 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n019.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 13:37:40 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 % SZS status Theorem % 0.12/0.34 % SZS output begin IncompleteProof % 0.12/0.34 cnf(c0, axiom, % 0.12/0.34 ~ra_Px4(X0,X1) | ~ca_Cx4xcomp(X0)). % 0.12/0.34 cnf(c1, plain, % 0.12/0.34 ~ra_Px4(X0,X1) | ~ca_Cx4xcomp(X0), % 0.12/0.34 inference(start, [], [c0])). % 0.12/0.34 % 0.12/0.34 cnf(c2, axiom, % 0.12/0.34 ra_Px4(X2,sK10(X2)) | ~ca_Cx4(X2)). % 0.12/0.34 cnf(a0, assumption, % 0.12/0.34 X0 = X2). % 0.12/0.34 cnf(a1, assumption, % 0.12/0.34 X1 = sK10(X2)). % 0.12/0.34 cnf(c3, plain, % 0.12/0.34 ~ca_Cx4xcomp(X0), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.34 cnf(c4, plain, % 0.12/0.34 ~ca_Cx4(X2), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.34 % 0.12/0.34 cnf(c5, axiom, % 0.12/0.34 ca_Cx4(X3) | ~rr(X4,X3) | ~sP2(X4)). % 0.12/0.34 cnf(a2, assumption, % 0.12/0.34 X2 = X3). % 0.12/0.34 cnf(c6, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])). % 0.12/0.34 cnf(c7, plain, % 0.12/0.34 ~rr(X4,X3) | ~sP2(X4), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])). % 0.12/0.34 % 0.12/0.34 cnf(c8, axiom, % 0.12/0.34 rr(X5,sK4(X5)) | ~sP1(X5)). % 0.12/0.34 cnf(a3, assumption, % 0.12/0.34 X4 = X5). % 0.12/0.34 cnf(a4, assumption, % 0.12/0.34 X3 = sK4(X5)). % 0.12/0.34 cnf(c9, plain, % 0.12/0.34 ~sP2(X4), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 0.12/0.34 cnf(c10, plain, % 0.12/0.34 ~sP1(X5), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 0.12/0.34 % 0.12/0.34 cnf(c11, axiom, % 0.12/0.34 sP1(X6) | ~sP2(X6)). % 0.12/0.34 cnf(a5, assumption, % 0.12/0.34 X5 = X6). % 0.12/0.34 cnf(c12, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a5])], [c10, c11])). % 0.12/0.34 cnf(c13, plain, % 0.12/0.34 ~sP2(X6), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a5])], [c10, c11])). % 0.12/0.34 % 0.12/0.34 cnf(c14, axiom, % 0.12/0.34 sP2(X7) | ~cUnsatisfiable(X7)). % 0.12/0.34 cnf(a6, assumption, % 0.12/0.34 X6 = X7). % 0.12/0.34 cnf(c15, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a6])], [c13, c14])). % 0.12/0.34 cnf(c16, plain, % 0.12/0.34 ~cUnsatisfiable(X7), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a6])], [c13, c14])). % 0.12/0.34 % 0.12/0.34 cnf(c17, axiom, % 0.12/0.34 cUnsatisfiable(i2003_11_14_17_22_31584)). % 0.12/0.34 cnf(a7, assumption, % 0.12/0.34 X7 = i2003_11_14_17_22_31584). % 0.12/0.34 cnf(c18, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a7])], [c16, c17])). % 0.12/0.34 cnf(c19, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a7])], [c16, c17])). % 0.12/0.34 % 0.12/0.34 cnf(c20, plain, % 0.12/0.34 sP2(X6)). % 0.12/0.34 cnf(a8, assumption, % 0.12/0.34 X4 = X6). % 0.12/0.34 cnf(c21, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [assumptions([a8])], [c9, c20])). % 0.12/0.34 % 0.12/0.34 cnf(c22, axiom, % 0.12/0.34 ca_Cx4xcomp(X8) | ~cexcomp(X8) | ~cd(X8)). % 0.12/0.34 cnf(a9, assumption, % 0.12/0.34 X0 = X8). % 0.12/0.34 cnf(c23, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a9])], [c3, c22])). % 0.12/0.34 cnf(c24, plain, % 0.12/0.34 ~cexcomp(X8) | ~cd(X8), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a9])], [c3, c22])). % 0.12/0.34 % 0.12/0.34 cnf(c25, axiom, % 0.12/0.34 cexcomp(sK4(X9)) | ~sP1(X9)). % 0.12/0.34 cnf(a10, assumption, % 0.12/0.34 X8 = sK4(X9)). % 0.12/0.34 cnf(c26, plain, % 0.12/0.34 ~cd(X8), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a10])], [c24, c25])). % 0.12/0.34 cnf(c27, plain, % 0.12/0.34 ~sP1(X9), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a10])], [c24, c25])). % 0.12/0.34 % 0.12/0.34 cnf(c28, plain, % 0.12/0.34 sP1(X5)). % 0.12/0.34 cnf(a11, assumption, % 0.12/0.34 X9 = X5). % 0.12/0.34 cnf(c29, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [assumptions([a11])], [c27, c28])). % 0.12/0.34 % 0.12/0.34 cnf(c30, axiom, % 0.12/0.34 cd(X10) | ~rr(X11,X10) | ~sP0(X11)). % 0.12/0.34 cnf(a12, assumption, % 0.12/0.34 X8 = X10). % 0.12/0.34 cnf(c31, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a12])], [c26, c30])). % 0.12/0.34 cnf(c32, plain, % 0.12/0.34 ~rr(X11,X10) | ~sP0(X11), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a12])], [c26, c30])). % 0.12/0.34 % 0.12/0.34 cnf(c33, plain, % 0.12/0.34 rr(X4,X3)). % 0.12/0.34 cnf(a13, assumption, % 0.12/0.34 X11 = X4). % 0.12/0.34 cnf(a14, assumption, % 0.12/0.34 X10 = X3). % 0.12/0.34 cnf(c34, plain, % 0.12/0.34 ~sP0(X11), % 0.12/0.34 inference(predicate_reduction, [assumptions([a13, a14])], [c32, c33])). % 0.12/0.34 % 0.12/0.34 cnf(c35, axiom, % 0.12/0.34 sP0(X12) | ~sP2(X12)). % 0.12/0.34 cnf(a15, assumption, % 0.12/0.34 X11 = X12). % 0.12/0.34 cnf(c36, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a15])], [c34, c35])). % 0.12/0.34 cnf(c37, plain, % 0.12/0.34 ~sP2(X12), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a15])], [c34, c35])). % 0.12/0.34 % 0.12/0.34 cnf(c38, plain, % 0.12/0.34 sP2(X6)). % 0.12/0.34 cnf(a16, assumption, % 0.12/0.34 X12 = X6). % 0.12/0.34 cnf(c39, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [assumptions([a16])], [c37, c38])). % 0.12/0.34 % 0.12/0.34 cnf(c40, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(constraint_solving, [ % 0.12/0.34 bind(X0, sK4(X5)), % 0.12/0.34 bind(X1, sK10(X2)), % 0.12/0.34 bind(X2, sK4(X5)), % 0.12/0.34 bind(X3, sK4(X5)), % 0.12/0.34 bind(X4, i2003_11_14_17_22_31584), % 0.12/0.34 bind(X5, i2003_11_14_17_22_31584), % 0.12/0.34 bind(X6, i2003_11_14_17_22_31584), % 0.12/0.34 bind(X7, i2003_11_14_17_22_31584), % 0.12/0.34 bind(X8, sK4(X5)), % 0.12/0.34 bind(X9, i2003_11_14_17_22_31584), % 0.12/0.34 bind(X10, sK4(X5)), % 0.12/0.34 bind(X11, i2003_11_14_17_22_31584), % 0.12/0.34 bind(X12, i2003_11_14_17_22_31584) % 0.12/0.34 ], % 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])). % 0.12/0.34 % 0.12/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------