%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET643+3 : TPTP v8.1.0. Released v2.2.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n025.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 : Tue Jul 19 02:47:22 EDT 2022 % Result : Theorem 0.12s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : SET643+3 : TPTP v8.1.0. Released v2.2.0. % 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n025.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sun Jul 10 04:17:46 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.37 % SZS status Theorem % 0.12/0.37 % SZS output begin IncompleteProof % 0.12/0.37 cnf(c0, axiom, % 0.12/0.37 ilf_type(sK23,set_type)). % 0.12/0.37 cnf(c1, plain, % 0.12/0.37 ilf_type(sK23,set_type), % 0.12/0.37 inference(start, [], [c0])). % 0.12/0.37 % 0.12/0.37 cnf(c2, axiom, % 0.12/0.37 ilf_type(X0,relation_type(X1,X2)) | ~subset(X0,cross_product(X1,X2)) | ~ilf_type(X2,set_type) | ~ilf_type(X1,set_type) | ~ilf_type(X0,set_type)). % 0.12/0.37 cnf(a0, assumption, % 0.12/0.37 sK23 = X2). % 0.12/0.37 cnf(a1, assumption, % 0.12/0.37 set_type = set_type). % 0.12/0.37 cnf(c3, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.37 cnf(c4, plain, % 0.12/0.37 ilf_type(X0,relation_type(X1,X2)) | ~subset(X0,cross_product(X1,X2)) | ~ilf_type(X1,set_type) | ~ilf_type(X0,set_type), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.37 % 0.12/0.37 cnf(c5, axiom, % 0.12/0.37 ~ilf_type(cross_product(sK22,sK23),relation_type(sK22,sK23))). % 0.12/0.37 cnf(a2, assumption, % 0.12/0.37 X0 = cross_product(sK22,sK23)). % 0.12/0.37 cnf(a3, assumption, % 0.12/0.37 relation_type(X1,X2) = relation_type(sK22,sK23)). % 0.12/0.37 cnf(c6, plain, % 0.12/0.37 ~subset(X0,cross_product(X1,X2)) | ~ilf_type(X1,set_type) | ~ilf_type(X0,set_type), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.37 cnf(c7, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.37 % 0.12/0.37 cnf(c8, axiom, % 0.12/0.37 subset(X3,X3) | ~ilf_type(X3,set_type)). % 0.12/0.37 cnf(a4, assumption, % 0.12/0.37 X0 = X3). % 0.12/0.37 cnf(a5, assumption, % 0.12/0.37 cross_product(X1,X2) = X3). % 0.12/0.37 cnf(c9, plain, % 0.12/0.37 ~ilf_type(X1,set_type) | ~ilf_type(X0,set_type), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.12/0.37 cnf(c10, plain, % 0.12/0.37 ~ilf_type(X3,set_type), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.12/0.37 % 0.12/0.37 cnf(c11, axiom, % 0.12/0.37 ilf_type(X4,set_type)). % 0.12/0.37 cnf(a6, assumption, % 0.12/0.37 X3 = X4). % 0.12/0.37 cnf(a7, assumption, % 0.12/0.37 set_type = set_type). % 0.12/0.37 cnf(c12, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.12/0.37 cnf(c13, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.12/0.37 % 0.12/0.37 cnf(c14, axiom, % 0.12/0.37 ilf_type(X5,set_type)). % 0.12/0.37 cnf(a8, assumption, % 0.12/0.37 X1 = X5). % 0.12/0.37 cnf(a9, assumption, % 0.12/0.37 set_type = set_type). % 0.12/0.37 cnf(c15, plain, % 0.12/0.37 ~ilf_type(X0,set_type), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])). % 0.12/0.37 cnf(c16, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])). % 0.12/0.37 % 0.12/0.37 cnf(c17, plain, % 0.12/0.37 ilf_type(X3,set_type)). % 0.12/0.37 cnf(a10, assumption, % 0.12/0.37 X0 = X3). % 0.12/0.37 cnf(a11, assumption, % 0.12/0.37 set_type = set_type). % 0.12/0.37 cnf(c18, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(predicate_reduction, [assumptions([a10, a11])], [c15, c17])). % 0.12/0.37 % 0.12/0.37 cnf(c19, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(constraint_solving, [ % 0.12/0.37 bind(X0, cross_product(sK22,sK23)), % 0.12/0.37 bind(X1, sK22), % 0.12/0.37 bind(X2, sK23), % 0.12/0.37 bind(X3, cross_product(sK22,sK23)), % 0.12/0.37 bind(X4, cross_product(sK22,sK23)), % 0.12/0.37 bind(X5, sK22) % 0.12/0.37 ], % 0.12/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.12/0.37 % 0.12/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------