%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : ALG211+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 : n029.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 : Thu Jul 14 17:20:49 EDT 2022 % Result : Theorem 0.13s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : ALG211+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.13/0.34 % Computer : n029.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Wed Jun 8 06:45:21 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.35 % SZS status Theorem % 0.13/0.35 % SZS output begin IncompleteProof % 0.13/0.35 cnf(c0, axiom, % 0.13/0.35 a_vector_subspace_of(sK2,sK3)). % 0.13/0.35 cnf(c1, plain, % 0.13/0.35 a_vector_subspace_of(sK2,sK3), % 0.13/0.35 inference(start, [], [c0])). % 0.13/0.35 % 0.13/0.35 cnf(c2, axiom, % 0.13/0.35 lin_ind_subset(X0,X1) | ~lin_ind_subset(X0,X2) | ~a_subset_of(X0,vec_to_class(X2)) | ~a_vector_subspace_of(X2,X1)). % 0.13/0.35 cnf(a0, assumption, % 0.13/0.35 sK2 = X2). % 0.13/0.35 cnf(a1, assumption, % 0.13/0.35 sK3 = X1). % 0.13/0.35 cnf(c3, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.35 cnf(c4, plain, % 0.13/0.35 lin_ind_subset(X0,X1) | ~lin_ind_subset(X0,X2) | ~a_subset_of(X0,vec_to_class(X2)), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.35 % 0.13/0.35 cnf(c5, axiom, % 0.13/0.35 basis_of(union(X3,sK0(X3,X4,X5)),X5) | ~basis_of(X4,X5) | ~lin_ind_subset(X3,X5)). % 0.13/0.35 cnf(a2, assumption, % 0.13/0.35 X0 = X3). % 0.13/0.35 cnf(a3, assumption, % 0.13/0.35 X1 = X5). % 0.13/0.35 cnf(c6, plain, % 0.13/0.35 ~lin_ind_subset(X0,X2) | ~a_subset_of(X0,vec_to_class(X2)), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.13/0.35 cnf(c7, plain, % 0.13/0.35 basis_of(union(X3,sK0(X3,X4,X5)),X5) | ~basis_of(X4,X5), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.13/0.35 % 0.13/0.35 cnf(c8, axiom, % 0.13/0.35 ~basis_of(X6,sK2) | ~basis_of(union(X6,X7),sK3)). % 0.13/0.35 cnf(a4, assumption, % 0.13/0.35 union(X3,sK0(X3,X4,X5)) = union(X6,X7)). % 0.13/0.35 cnf(a5, assumption, % 0.13/0.35 X5 = sK3). % 0.13/0.35 cnf(c9, plain, % 0.13/0.35 ~basis_of(X4,X5), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.13/0.35 cnf(c10, plain, % 0.13/0.35 ~basis_of(X6,sK2), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.13/0.35 % 0.13/0.35 cnf(c11, axiom, % 0.13/0.35 basis_of(sK1(X8),X8) | ~a_vector_space(X8)). % 0.13/0.35 cnf(a6, assumption, % 0.13/0.35 X6 = sK1(X8)). % 0.13/0.35 cnf(a7, assumption, % 0.13/0.35 sK2 = X8). % 0.13/0.35 cnf(c12, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.13/0.35 cnf(c13, plain, % 0.13/0.35 ~a_vector_space(X8), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.13/0.35 % 0.13/0.35 cnf(c14, axiom, % 0.13/0.35 a_vector_space(X9) | ~a_vector_subspace_of(X9,X10)). % 0.13/0.35 cnf(a8, assumption, % 0.13/0.35 X8 = X9). % 0.13/0.35 cnf(c15, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a8])], [c13, c14])). % 0.13/0.35 cnf(c16, plain, % 0.13/0.35 ~a_vector_subspace_of(X9,X10), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a8])], [c13, c14])). % 0.13/0.35 % 0.13/0.35 cnf(c17, plain, % 0.13/0.35 a_vector_subspace_of(sK2,sK3)). % 0.13/0.35 cnf(a9, assumption, % 0.13/0.35 X9 = sK2). % 0.13/0.35 cnf(a10, assumption, % 0.13/0.35 X10 = sK3). % 0.13/0.35 cnf(c18, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(predicate_reduction, [assumptions([a9, a10])], [c16, c17])). % 0.13/0.35 % 0.13/0.35 cnf(c19, axiom, % 0.13/0.35 basis_of(sK1(X11),X11) | ~a_vector_space(X11)). % 0.13/0.35 cnf(a11, assumption, % 0.13/0.35 X4 = sK1(X11)). % 0.13/0.35 cnf(a12, assumption, % 0.13/0.35 X5 = X11). % 0.13/0.35 cnf(c20, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a11, a12])], [c9, c19])). % 0.13/0.35 cnf(c21, plain, % 0.13/0.35 ~a_vector_space(X11), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a11, a12])], [c9, c19])). % 0.13/0.35 % 0.13/0.35 cnf(c22, axiom, % 0.13/0.35 a_vector_space(sK3)). % 0.13/0.35 cnf(a13, assumption, % 0.13/0.35 X11 = sK3). % 0.13/0.35 cnf(c23, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a13])], [c21, c22])). % 0.13/0.35 cnf(c24, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a13])], [c21, c22])). % 0.13/0.35 % 0.13/0.35 cnf(c25, axiom, % 0.13/0.35 lin_ind_subset(X12,X13) | ~basis_of(X12,X13)). % 0.13/0.36 cnf(a14, assumption, % 0.13/0.36 X0 = X12). % 0.13/0.36 cnf(a15, assumption, % 0.13/0.36 X2 = X13). % 0.13/0.36 cnf(c26, plain, % 0.13/0.36 ~a_subset_of(X0,vec_to_class(X2)), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a14, a15])], [c6, c25])). % 0.13/0.36 cnf(c27, plain, % 0.13/0.36 ~basis_of(X12,X13), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a14, a15])], [c6, c25])). % 0.13/0.36 % 0.13/0.36 cnf(c28, plain, % 0.13/0.36 basis_of(X6,sK2)). % 0.13/0.36 cnf(a16, assumption, % 0.13/0.36 X12 = X6). % 0.13/0.36 cnf(a17, assumption, % 0.13/0.36 X13 = sK2). % 0.13/0.36 cnf(c29, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(predicate_reduction, [assumptions([a16, a17])], [c27, c28])). % 0.13/0.36 % 0.13/0.36 cnf(c30, axiom, % 0.13/0.36 a_subset_of(X14,vec_to_class(X15)) | ~basis_of(X14,X15)). % 0.13/0.36 cnf(a18, assumption, % 0.13/0.36 X0 = X14). % 0.13/0.36 cnf(a19, assumption, % 0.13/0.36 vec_to_class(X2) = vec_to_class(X15)). % 0.13/0.36 cnf(c31, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a18, a19])], [c26, c30])). % 0.13/0.36 cnf(c32, plain, % 0.13/0.36 ~basis_of(X14,X15), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a18, a19])], [c26, c30])). % 0.13/0.36 % 0.13/0.36 cnf(c33, plain, % 0.13/0.36 basis_of(X6,sK2)). % 0.13/0.36 cnf(a20, assumption, % 0.13/0.36 X14 = X6). % 0.13/0.36 cnf(a21, assumption, % 0.13/0.36 X15 = sK2). % 0.13/0.36 cnf(c34, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(predicate_reduction, [assumptions([a20, a21])], [c32, c33])). % 0.13/0.36 % 0.13/0.36 cnf(c35, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(constraint_solving, [ % 0.13/0.36 bind(X0, sK1(X8)), % 0.13/0.36 bind(X1, sK3), % 0.13/0.36 bind(X2, sK2), % 0.13/0.36 bind(X3, sK1(X8)), % 0.13/0.36 bind(X4, sK1(X11)), % 0.13/0.36 bind(X5, sK3), % 0.13/0.36 bind(X6, sK1(X8)), % 0.13/0.36 bind(X7, sK0(X3,X4,X5)), % 0.13/0.36 bind(X8, sK2), % 0.13/0.36 bind(X9, sK2), % 0.13/0.36 bind(X10, sK3), % 0.13/0.36 bind(X11, sK3), % 0.13/0.36 bind(X12, sK1(X8)), % 0.13/0.36 bind(X13, sK2), % 0.13/0.36 bind(X14, sK1(X8)), % 0.13/0.36 bind(X15, sK2) % 0.13/0.36 ], % 0.13/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])). % 0.13/0.36 % 0.13/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------