%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : KRS096+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 : n018.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:59 EDT 2022 % Result : Unsatisfiable 0.14s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : KRS096+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.14/0.34 % Computer : n018.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Tue Jun 7 15:52:21 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.35 % SZS status Theorem % 0.14/0.35 % SZS output begin IncompleteProof % 0.14/0.35 cnf(c0, axiom, % 0.14/0.35 ~cd(X0) | ~cc(X0)). % 0.14/0.35 cnf(c1, plain, % 0.14/0.35 ~cd(X0) | ~cc(X0), % 0.14/0.35 inference(start, [], [c0])). % 0.14/0.35 % 0.14/0.35 cnf(c2, axiom, % 0.14/0.35 cd(sK3(X1)) | ~cUnsatisfiable(X1)). % 0.14/0.35 cnf(a0, assumption, % 0.14/0.35 X0 = sK3(X1)). % 0.14/0.35 cnf(c3, plain, % 0.14/0.35 ~cc(X0), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.35 cnf(c4, plain, % 0.14/0.35 ~cUnsatisfiable(X1), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.35 % 0.14/0.35 cnf(c5, axiom, % 0.14/0.35 cUnsatisfiable(i2003_11_14_17_20_18265)). % 0.14/0.35 cnf(a1, assumption, % 0.14/0.35 X1 = i2003_11_14_17_20_18265). % 0.14/0.35 cnf(c6, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.14/0.35 cnf(c7, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.14/0.35 % 0.14/0.35 cnf(c8, axiom, % 0.14/0.35 cc(sK4(X2)) | ~cUnsatisfiable(X2)). % 0.14/0.35 cnf(a2, assumption, % 0.14/0.35 X3 = X0). % 0.14/0.35 cnf(c9, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(lazy_predicate_extension, [assumptions([a2])], [c3, c8])). % 0.14/0.35 cnf(c10, plain, % 0.14/0.35 ~cUnsatisfiable(X2), % 0.14/0.35 inference(lazy_predicate_extension, [assumptions([a2])], [c3, c8])). % 0.14/0.35 cnf(c11, plain, % 0.14/0.35 sK4(X2) != X3, % 0.14/0.35 inference(lazy_predicate_extension, [assumptions([a2])], [c3, c8])). % 0.14/0.35 % 0.14/0.35 cnf(c12, axiom, % 0.14/0.35 X4 = X5 | ~rr(X6,X5) | ~rr(X6,X4) | ~sP0(X6)). % 0.14/0.35 cnf(a3, assumption, % 0.14/0.35 sK4(X2) = X5). % 0.14/0.35 cnf(c13, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(variable_extension, [assumptions([a3])], [c11, c12])). % 0.14/0.35 cnf(c14, plain, % 0.14/0.35 ~rr(X6,X5) | ~rr(X6,X4) | ~sP0(X6), % 0.14/0.35 inference(variable_extension, [assumptions([a3])], [c11, c12])). % 0.14/0.35 cnf(c15, plain, % 0.14/0.35 X4 != X7 | X7 != X3, % 0.14/0.35 inference(variable_extension, [assumptions([a3])], [c11, c12])). % 0.14/0.35 % 0.14/0.35 cnf(a4, assumption, % 0.14/0.35 X4 = X7). % 0.14/0.35 cnf(c16, plain, % 0.14/0.35 X7 != X3, % 0.14/0.35 inference(reflexivity, [assumptions([a4])], [c15])). % 0.14/0.35 % 0.14/0.35 cnf(a5, assumption, % 0.14/0.35 X7 = X3). % 0.14/0.35 cnf(c17, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(reflexivity, [assumptions([a5])], [c16])). % 0.14/0.35 % 0.14/0.35 cnf(c18, axiom, % 0.14/0.35 rr(X8,sK4(X8)) | ~cUnsatisfiable(X8)). % 0.14/0.35 cnf(a6, assumption, % 0.14/0.35 X6 = X8). % 0.14/0.35 cnf(a7, assumption, % 0.14/0.35 X5 = sK4(X8)). % 0.14/0.35 cnf(c19, plain, % 0.14/0.35 ~rr(X6,X4) | ~sP0(X6), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c14, c18])). % 0.14/0.35 cnf(c20, plain, % 0.14/0.35 ~cUnsatisfiable(X8), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c14, c18])). % 0.14/0.35 % 0.14/0.35 cnf(c21, plain, % 0.14/0.35 cUnsatisfiable(X1)). % 0.14/0.35 cnf(a8, assumption, % 0.14/0.35 X8 = X1). % 0.14/0.35 cnf(c22, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(predicate_reduction, [assumptions([a8])], [c20, c21])). % 0.14/0.35 % 0.14/0.35 cnf(c23, axiom, % 0.14/0.35 rr(X9,sK3(X9)) | ~cUnsatisfiable(X9)). % 0.14/0.35 cnf(a9, assumption, % 0.14/0.35 X6 = X9). % 0.14/0.35 cnf(a10, assumption, % 0.14/0.35 X4 = sK3(X9)). % 0.14/0.35 cnf(c24, plain, % 0.14/0.35 ~sP0(X6), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a9, a10])], [c19, c23])). % 0.14/0.35 cnf(c25, plain, % 0.14/0.35 ~cUnsatisfiable(X9), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a9, a10])], [c19, c23])). % 0.14/0.35 % 0.14/0.35 cnf(c26, plain, % 0.14/0.35 cUnsatisfiable(X1)). % 0.14/0.35 cnf(a11, assumption, % 0.14/0.35 X9 = X1). % 0.14/0.35 cnf(c27, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(predicate_reduction, [assumptions([a11])], [c25, c26])). % 0.14/0.35 % 0.14/0.35 cnf(c28, axiom, % 0.14/0.35 sP0(X10) | ~cUnsatisfiable(X10)). % 0.14/0.35 cnf(a12, assumption, % 0.14/0.35 X6 = X10). % 0.14/0.35 cnf(c29, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a12])], [c24, c28])). % 0.14/0.35 cnf(c30, plain, % 0.14/0.35 ~cUnsatisfiable(X10), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a12])], [c24, c28])). % 0.14/0.35 % 0.14/0.35 cnf(c31, plain, % 0.14/0.35 cUnsatisfiable(X1)). % 0.14/0.35 cnf(a13, assumption, % 0.14/0.35 X10 = X1). % 0.14/0.35 cnf(c32, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(predicate_reduction, [assumptions([a13])], [c30, c31])). % 0.14/0.35 % 0.14/0.35 cnf(c33, plain, % 0.14/0.35 cUnsatisfiable(X1)). % 0.14/0.35 cnf(a14, assumption, % 0.14/0.35 X2 = X1). % 0.14/0.35 cnf(c34, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(predicate_reduction, [assumptions([a14])], [c10, c33])). % 0.14/0.35 % 0.14/0.35 cnf(c35, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(constraint_solving, [ % 0.14/0.35 bind(X0, sK3(X1)), % 0.14/0.35 bind(X1, i2003_11_14_17_20_18265), % 0.14/0.35 bind(X2, i2003_11_14_17_20_18265), % 0.14/0.35 bind(X3, sK3(X1)), % 0.14/0.35 bind(X4, sK3(X1)), % 0.14/0.35 bind(X5, sK4(X2)), % 0.14/0.35 bind(X6, i2003_11_14_17_20_18265), % 0.14/0.35 bind(X7, sK3(X1)), % 0.14/0.35 bind(X8, i2003_11_14_17_20_18265), % 0.14/0.35 bind(X9, i2003_11_14_17_20_18265), % 0.14/0.35 bind(X10, i2003_11_14_17_20_18265) % 0.14/0.35 ], % 0.14/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])). % 0.14/0.35 % 0.14/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------