%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL686+1.010 : TPTP v9.3.1. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n017.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 12:29:12 PM UTC 2026 % Result : Theorem 10.72s 1.84s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL686+1.010 : TPTP v9.3.1. Released v4.0.0. % 0.00/0.04 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.10/0.36 % Computer : n017.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Sat Sep 5 16:19:22 UTC 2026 % 0.10/0.36 % CPUTime : % 10.72/1.84 % SZS status Theorem % 10.72/1.84 % SZS output begin IncompleteProof % 10.72/1.84 cnf(c0, axiom, % 10.72/1.84 sP57(X0) | ~r1(sK89,X0)). % 10.72/1.84 cnf(c1, plain, % 10.72/1.84 sP57(X0) | ~r1(sK89,X0), % 10.72/1.84 inference(start, [], [c0])). % 10.72/1.84 % 10.72/1.84 cnf(c2, axiom, % 10.72/1.84 sP55(X1) | ~sP57(X1)). % 10.72/1.84 cnf(a0, assumption, % 10.72/1.84 X0 = X1). % 10.72/1.84 cnf(c3, plain, % 10.72/1.84 ~r1(sK89,X0), % 10.72/1.84 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 10.72/1.84 cnf(c4, plain, % 10.72/1.84 sP55(X1), % 10.72/1.84 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 10.72/1.84 % 10.72/1.84 cnf(c5, axiom, % 10.72/1.84 p1(X2) | ~p2(X2) | ~r1(X3,X2) | ~sP55(X3)). % 10.72/1.84 cnf(a1, assumption, % 10.72/1.84 X1 = X3). % 10.72/1.84 cnf(c6, plain, % 10.72/1.84 $false, % 10.72/1.84 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 10.72/1.84 cnf(c7, plain, % 10.72/1.84 p1(X2) | ~p2(X2) | ~r1(X3,X2), % 10.72/1.84 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 10.72/1.84 % 10.72/1.84 cnf(c8, axiom, % 10.72/1.84 ~p1(sK59(X4)) | ~p2(sK59(X4)) | ~sP54(X4)). % 10.72/1.84 cnf(a2, assumption, % 10.72/1.84 X2 = sK59(X4)). % 10.72/1.84 cnf(c9, plain, % 10.72/1.84 ~p2(X2) | ~r1(X3,X2), % 10.72/1.84 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 10.72/1.84 cnf(c10, plain, % 10.72/1.84 ~p2(sK59(X4)) | ~sP54(X4), % 10.72/1.84 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 10.72/1.84 % 10.72/1.84 cnf(c11, axiom, % 10.72/1.84 ~p1(X5) | p2(X5) | ~r1(X6,X5) | ~sP55(X6)). % 10.72/1.84 cnf(a3, assumption, % 10.72/1.84 sK59(X4) = X5). % 10.72/1.84 cnf(c12, plain, % 10.72/1.84 ~sP54(X4), % 10.72/1.84 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 10.72/1.84 cnf(c13, plain, % 10.72/1.84 ~p1(X5) | ~r1(X6,X5) | ~sP55(X6), % 10.72/1.84 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 10.72/1.84 % 10.72/1.84 cnf(c14, plain, % 10.72/1.84 p1(X2)). % 10.72/1.84 cnf(a4, assumption, % 10.72/1.84 X5 = X2). % 10.72/1.84 cnf(c15, plain, % 10.72/1.84 ~r1(X6,X5) | ~sP55(X6), % 10.72/1.84 inference(predicate_reduction, [assumptions([a4])], [c13, c14])). % 10.72/1.84 % 10.72/1.84 cnf(c16, axiom, % 10.72/1.84 r1(X7,sK59(X7)) | ~sP54(X7)). % 10.72/1.84 cnf(a5, assumption, % 10.72/1.84 X6 = X7). % 10.72/1.84 cnf(a6, assumption, % 10.72/1.84 X5 = sK59(X7)). % 10.72/1.84 cnf(c17, plain, % 10.72/1.84 ~sP55(X6), % 10.72/1.84 inference(strict_predicate_extension, [assumptions([a5, a6])], [c15, c16])). % 10.72/1.84 cnf(c18, plain, % 10.72/1.84 ~sP54(X7), % 10.72/1.84 inference(strict_predicate_extension, [assumptions([a5, a6])], [c15, c16])). % 10.72/1.84 % 10.72/1.84 cnf(c19, axiom, % 10.72/1.84 sP54(X8) | ~sP57(X8)). % 10.72/1.84 cnf(a7, assumption, % 10.72/1.84 X7 = X8). % 10.72/1.84 cnf(c20, plain, % 10.72/1.84 $false, % 10.72/1.84 inference(strict_predicate_extension, [assumptions([a7])], [c18, c19])). % 10.72/1.84 cnf(c21, plain, % 10.72/1.84 ~sP57(X8), % 10.72/1.84 inference(strict_predicate_extension, [assumptions([a7])], [c18, c19])). % 10.72/1.84 % 10.72/1.84 cnf(c22, plain, % 10.72/1.84 sP57(X0)). % 10.72/1.84 cnf(a8, assumption, % 10.72/1.84 X8 = X0). % 10.72/1.84 cnf(c23, plain, % 10.72/1.84 $false, % 10.72/1.84 inference(predicate_reduction, [assumptions([a8])], [c21, c22])). % 10.72/1.84 % 10.72/1.84 cnf(c24, plain, % 10.72/1.84 sP55(X1)). % 10.72/1.84 cnf(a9, assumption, % 10.72/1.84 X6 = X1). % 10.72/1.84 cnf(c25, plain, % 10.72/1.84 $false, % 10.72/1.84 inference(predicate_reduction, [assumptions([a9])], [c17, c24])). % 10.72/1.84 % 10.72/1.84 cnf(c26, plain, % 10.72/1.84 sP54(X7)). % 10.72/1.84 cnf(a10, assumption, % 10.72/1.84 X4 = X7). % 10.72/1.84 cnf(c27, plain, % 10.72/1.84 $false, % 10.72/1.84 inference(predicate_reduction, [assumptions([a10])], [c12, c26])). % 10.72/1.84 % 10.72/1.84 cnf(c28, axiom, % 10.72/1.84 p2(sK59(X9)) | p1(sK59(X9)) | ~sP54(X9)). % 10.72/1.84 cnf(a11, assumption, % 10.72/1.84 X2 = sK59(X9)). % 10.72/1.84 cnf(c29, plain, % 10.72/1.84 ~r1(X3,X2), % 10.72/1.84 inference(strict_predicate_extension, [assumptions([a11])], [c9, c28])). % 10.72/1.84 cnf(c30, plain, % 10.72/1.84 p1(sK59(X9)) | ~sP54(X9), % 10.72/1.84 inference(strict_predicate_extension, [assumptions([a11])], [c9, c28])). % 10.72/1.84 % 10.72/1.84 cnf(c31, plain, % 10.72/1.84 ~p1(X2)). % 10.72/1.84 cnf(a12, assumption, % 10.72/1.84 sK59(X9) = X2). % 10.72/1.84 cnf(c32, plain, % 10.72/1.84 ~sP54(X9), % 10.72/1.84 inference(predicate_reduction, [assumptions([a12])], [c30, c31])). % 10.72/1.84 % 10.72/1.84 cnf(c33, plain, % 10.72/1.84 sP54(X7)). % 10.72/1.84 cnf(a13, assumption, % 10.72/1.84 X9 = X7). % 10.72/1.84 cnf(c34, plain, % 10.72/1.84 $false, % 10.72/1.84 inference(predicate_reduction, [assumptions([a13])], [c32, c33])). % 10.72/1.84 % 10.72/1.84 cnf(c35, plain, % 10.72/1.84 r1(X6,X5)). % 10.72/1.84 cnf(a14, assumption, % 10.72/1.84 X3 = X6). % 10.72/1.84 cnf(a15, assumption, % 10.72/1.84 X2 = X5). % 10.72/1.84 cnf(c36, plain, % 10.72/1.84 $false, % 10.72/1.84 inference(predicate_reduction, [assumptions([a14, a15])], [c29, c35])). % 10.72/1.84 % 10.72/1.84 cnf(c37, axiom, % 10.72/1.84 r1(X10,X10)). % 10.72/1.84 cnf(a16, assumption, % 10.72/1.84 sK89 = X10). % 10.72/1.84 cnf(a17, assumption, % 10.72/1.84 X0 = X10). % 10.72/1.84 cnf(c38, plain, % 10.72/1.84 $false, % 10.72/1.84 inference(strict_predicate_extension, [assumptions([a16, a17])], [c3, c37])). % 10.72/1.84 cnf(c39, plain, % 10.72/1.84 $false, % 10.72/1.84 inference(strict_predicate_extension, [assumptions([a16, a17])], [c3, c37])). % 10.72/1.84 % 10.72/1.84 cnf(c40, plain, % 10.72/1.84 $false, % 10.72/1.84 inference(constraint_solving, [ % 10.72/1.84 bind(X0, sK89), % 10.72/1.84 bind(X1, sK89), % 10.72/1.84 bind(X2, sK59(X4)), % 10.72/1.84 bind(X3, sK89), % 10.72/1.84 bind(X4, sK89), % 10.72/1.84 bind(X5, sK59(X4)), % 10.72/1.84 bind(X6, sK89), % 10.72/1.84 bind(X7, sK89), % 10.72/1.84 bind(X8, sK89), % 10.72/1.84 bind(X9, sK89), % 10.72/1.84 bind(X10, sK89) % 10.72/1.84 ], % 10.72/1.84 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])). % 10.72/1.84 % 10.72/1.84 % SZS output end IncompleteProof %------------------------------------------------------------------------------