%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL674+1.001 : 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 : n013.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:08 PM UTC 2026 % Result : Theorem 0.07s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL674+1.001 : TPTP v9.3.1. Released v4.0.0. % 0.00/0.03 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.07/0.34 % Computer : n013.cluster.edu % 0.07/0.34 % Model : x86_64 x86_64 % 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.34 % Memory : 8046.5625MB % 0.07/0.34 % OS : Linux 6.8.0-71-generic % 0.07/0.34 % CPULimit : 300 % 0.07/0.34 % WCLimit : 300 % 0.07/0.34 % DateTime : Sat Sep 5 02:04:34 UTC 2026 % 0.07/0.34 % CPUTime : % 0.07/0.35 % SZS status Theorem % 0.07/0.35 % SZS output begin IncompleteProof % 0.07/0.35 cnf(c0, axiom, % 0.07/0.35 p2(X0) | ~r1(sK8,X0)). % 0.07/0.35 cnf(c1, plain, % 0.07/0.35 p2(X0) | ~r1(sK8,X0), % 0.07/0.35 inference(start, [], [c0])). % 0.07/0.35 % 0.07/0.35 cnf(c2, axiom, % 0.07/0.35 ~p2(sK7(X1)) | ~sP0(X1)). % 0.07/0.35 cnf(a0, assumption, % 0.07/0.35 X0 = sK7(X1)). % 0.07/0.35 cnf(c3, plain, % 0.07/0.35 ~r1(sK8,X0), % 0.07/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.07/0.35 cnf(c4, plain, % 0.07/0.35 ~sP0(X1), % 0.07/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.07/0.35 % 0.07/0.35 cnf(c5, axiom, % 0.07/0.35 ~p100(X2) | p101(X2) | sP0(X2) | ~sP2(X2)). % 0.07/0.35 cnf(a1, assumption, % 0.07/0.35 X1 = X2). % 0.07/0.35 cnf(c6, plain, % 0.07/0.35 $false, % 0.07/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.07/0.35 cnf(c7, plain, % 0.07/0.35 ~p100(X2) | p101(X2) | ~sP2(X2), % 0.07/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.07/0.35 % 0.07/0.35 cnf(c8, axiom, % 0.07/0.35 p100(sK8)). % 0.07/0.35 cnf(a2, assumption, % 0.07/0.35 X2 = sK8). % 0.07/0.35 cnf(c9, plain, % 0.07/0.35 p101(X2) | ~sP2(X2), % 0.07/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.07/0.35 cnf(c10, plain, % 0.07/0.35 $false, % 0.07/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.07/0.35 % 0.07/0.35 cnf(c11, axiom, % 0.07/0.36 ~p101(sK8)). % 0.07/0.36 cnf(a3, assumption, % 0.07/0.36 X2 = sK8). % 0.07/0.36 cnf(c12, plain, % 0.07/0.36 ~sP2(X2), % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])). % 0.07/0.36 cnf(c13, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])). % 0.07/0.36 % 0.07/0.36 cnf(c14, axiom, % 0.07/0.36 sP2(X3) | ~sP5(X3)). % 0.07/0.36 cnf(a4, assumption, % 0.07/0.36 X2 = X3). % 0.07/0.36 cnf(c15, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])). % 0.07/0.36 cnf(c16, plain, % 0.07/0.36 ~sP5(X3), % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])). % 0.07/0.36 % 0.07/0.36 cnf(c17, axiom, % 0.07/0.36 sP5(X4) | ~r1(sK8,X4)). % 0.07/0.36 cnf(a5, assumption, % 0.07/0.36 X3 = X4). % 0.07/0.36 cnf(c18, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 0.07/0.36 cnf(c19, plain, % 0.07/0.36 ~r1(sK8,X4), % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 0.07/0.36 % 0.07/0.36 cnf(c20, axiom, % 0.07/0.36 r1(X5,X5)). % 0.07/0.36 cnf(a6, assumption, % 0.07/0.36 sK8 = X5). % 0.07/0.36 cnf(a7, assumption, % 0.07/0.36 X4 = X5). % 0.07/0.36 cnf(c21, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c19, c20])). % 0.07/0.36 cnf(c22, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c19, c20])). % 0.07/0.36 % 0.07/0.36 cnf(c23, axiom, % 0.07/0.36 r1(X6,sK7(X6)) | ~sP0(X6)). % 0.07/0.36 cnf(a8, assumption, % 0.07/0.36 sK8 = X6). % 0.07/0.36 cnf(a9, assumption, % 0.07/0.36 X0 = sK7(X6)). % 0.07/0.36 cnf(c24, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a8, a9])], [c3, c23])). % 0.07/0.36 cnf(c25, plain, % 0.07/0.36 ~sP0(X6), % 0.07/0.36 inference(strict_predicate_extension, [assumptions([a8, a9])], [c3, c23])). % 0.07/0.36 % 0.07/0.36 cnf(c26, plain, % 0.07/0.36 sP0(X1)). % 0.07/0.36 cnf(a10, assumption, % 0.07/0.36 X6 = X1). % 0.07/0.36 cnf(c27, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(predicate_reduction, [assumptions([a10])], [c25, c26])). % 0.07/0.36 % 0.07/0.36 cnf(c28, plain, % 0.07/0.36 $false, % 0.07/0.36 inference(constraint_solving, [ % 0.07/0.36 bind(X0, sK7(X1)), % 0.07/0.36 bind(X1, sK8), % 0.07/0.36 bind(X2, sK8), % 0.07/0.36 bind(X3, sK8), % 0.07/0.36 bind(X4, sK8), % 0.07/0.36 bind(X5, sK8), % 0.07/0.36 bind(X6, sK8) % 0.07/0.36 ], % 0.07/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])). % 0.07/0.36 % 0.07/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------