%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : KRS110+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:13:01 EDT 2022 % Result : Unsatisfiable 0.16s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.14 % Problem : KRS110+1 : TPTP v8.1.0. Released v3.1.0. % 0.13/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.16/0.36 % Computer : n020.cluster.edu % 0.16/0.36 % Model : x86_64 x86_64 % 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.36 % Memory : 8042.1875MB % 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.36 % CPULimit : 300 % 0.16/0.36 % WCLimit : 600 % 0.16/0.36 % DateTime : Tue Jun 7 06:56:37 EDT 2022 % 0.16/0.36 % CPUTime : % 0.16/0.37 % SZS status Theorem % 0.16/0.37 % SZS output begin IncompleteProof % 0.16/0.37 cnf(c0, axiom, % 0.16/0.37 ~ra_Px1(X0,X1) | ~cp(X0)). % 0.16/0.37 cnf(c1, plain, % 0.16/0.37 ~ra_Px1(X0,X1) | ~cp(X0), % 0.16/0.37 inference(start, [], [c0])). % 0.16/0.37 % 0.16/0.37 cnf(c2, axiom, % 0.16/0.37 ra_Px1(X2,sK5(X2)) | ~cpxcomp(X2)). % 0.16/0.37 cnf(a0, assumption, % 0.16/0.37 X0 = X2). % 0.16/0.37 cnf(a1, assumption, % 0.16/0.37 X1 = sK5(X2)). % 0.16/0.37 cnf(c3, plain, % 0.16/0.37 ~cp(X0), % 0.16/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.16/0.37 cnf(c4, plain, % 0.16/0.37 ~cpxcomp(X2), % 0.16/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.16/0.37 % 0.16/0.37 cnf(c5, axiom, % 0.16/0.37 cpxcomp(X3) | ~rs(X4,X3) | ~sP1(X4)). % 0.16/0.37 cnf(a2, assumption, % 0.16/0.37 X2 = X3). % 0.16/0.37 cnf(c6, plain, % 0.16/0.37 $false, % 0.16/0.37 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])). % 0.16/0.37 cnf(c7, plain, % 0.16/0.37 ~rs(X4,X3) | ~sP1(X4), % 0.16/0.37 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])). % 0.16/0.37 % 0.16/0.37 cnf(c8, axiom, % 0.16/0.37 rs(X5,sK3(X5)) | ~sP0(X5)). % 0.16/0.37 cnf(a3, assumption, % 0.16/0.37 X4 = X5). % 0.16/0.37 cnf(a4, assumption, % 0.16/0.37 X3 = sK3(X5)). % 0.16/0.37 cnf(c9, plain, % 0.16/0.37 ~sP1(X4), % 0.16/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 0.16/0.37 cnf(c10, plain, % 0.16/0.37 ~sP0(X5), % 0.16/0.37 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 0.16/0.37 % 0.16/0.37 cnf(c11, axiom, % 0.16/0.37 sP0(X6) | ~sP1(X6)). % 0.16/0.37 cnf(a5, assumption, % 0.16/0.37 X5 = X6). % 0.16/0.37 cnf(c12, plain, % 0.16/0.37 $false, % 0.16/0.37 inference(strict_predicate_extension, [assumptions([a5])], [c10, c11])). % 0.16/0.37 cnf(c13, plain, % 0.16/0.37 ~sP1(X6), % 0.16/0.37 inference(strict_predicate_extension, [assumptions([a5])], [c10, c11])). % 0.16/0.37 % 0.16/0.37 cnf(c14, axiom, % 0.16/0.37 sP1(X7) | ~cUnsatisfiable(X7)). % 0.16/0.37 cnf(a6, assumption, % 0.16/0.37 X6 = X7). % 0.16/0.37 cnf(c15, plain, % 0.16/0.37 $false, % 0.16/0.37 inference(strict_predicate_extension, [assumptions([a6])], [c13, c14])). % 0.16/0.37 cnf(c16, plain, % 0.16/0.37 ~cUnsatisfiable(X7), % 0.16/0.37 inference(strict_predicate_extension, [assumptions([a6])], [c13, c14])). % 0.16/0.37 % 0.16/0.37 cnf(c17, axiom, % 0.16/0.37 cUnsatisfiable(i2003_11_14_17_21_12565)). % 0.16/0.37 cnf(a7, assumption, % 0.16/0.37 X7 = i2003_11_14_17_21_12565). % 0.16/0.37 cnf(c18, plain, % 0.16/0.37 $false, % 0.16/0.37 inference(strict_predicate_extension, [assumptions([a7])], [c16, c17])). % 0.16/0.37 cnf(c19, plain, % 0.16/0.37 $false, % 0.16/0.37 inference(strict_predicate_extension, [assumptions([a7])], [c16, c17])). % 0.16/0.37 % 0.16/0.37 cnf(c20, plain, % 0.16/0.37 sP1(X6)). % 0.16/0.37 cnf(a8, assumption, % 0.16/0.37 X4 = X6). % 0.16/0.37 cnf(c21, plain, % 0.16/0.37 $false, % 0.16/0.37 inference(predicate_reduction, [assumptions([a8])], [c9, c20])). % 0.16/0.37 % 0.16/0.37 cnf(c22, axiom, % 0.16/0.37 cp(X8) | ~ca_Ax2(X8)). % 0.16/0.37 cnf(a9, assumption, % 0.16/0.37 X0 = X8). % 0.16/0.37 cnf(c23, plain, % 0.16/0.37 $false, % 0.16/0.37 inference(strict_predicate_extension, [assumptions([a9])], [c3, c22])). % 0.16/0.37 cnf(c24, plain, % 0.16/0.37 ~ca_Ax2(X8), % 0.16/0.37 inference(strict_predicate_extension, [assumptions([a9])], [c3, c22])). % 0.16/0.37 % 0.16/0.37 cnf(c25, axiom, % 0.16/0.37 ca_Ax2(sK3(X9)) | ~sP0(X9)). % 0.16/0.37 cnf(a10, assumption, % 0.16/0.37 X8 = sK3(X9)). % 0.16/0.37 cnf(c26, plain, % 0.16/0.37 $false, % 0.16/0.37 inference(strict_predicate_extension, [assumptions([a10])], [c24, c25])). % 0.16/0.37 cnf(c27, plain, % 0.16/0.37 ~sP0(X9), % 0.16/0.37 inference(strict_predicate_extension, [assumptions([a10])], [c24, c25])). % 0.16/0.37 % 0.16/0.37 cnf(c28, plain, % 0.16/0.37 sP0(X5)). % 0.16/0.37 cnf(a11, assumption, % 0.16/0.37 X9 = X5). % 0.16/0.37 cnf(c29, plain, % 0.16/0.37 $false, % 0.16/0.37 inference(predicate_reduction, [assumptions([a11])], [c27, c28])). % 0.16/0.37 % 0.16/0.37 cnf(c30, plain, % 0.16/0.37 $false, % 0.16/0.37 inference(constraint_solving, [ % 0.16/0.37 bind(X0, sK3(X5)), % 0.16/0.37 bind(X1, sK5(X2)), % 0.16/0.37 bind(X2, sK3(X5)), % 0.16/0.37 bind(X3, sK3(X5)), % 0.16/0.37 bind(X4, i2003_11_14_17_21_12565), % 0.16/0.37 bind(X5, i2003_11_14_17_21_12565), % 0.16/0.37 bind(X6, i2003_11_14_17_21_12565), % 0.16/0.37 bind(X7, i2003_11_14_17_21_12565), % 0.16/0.37 bind(X8, sK3(X5)), % 0.16/0.37 bind(X9, i2003_11_14_17_21_12565) % 0.16/0.37 ], % 0.16/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.16/0.37 % 0.16/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------