%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET148+4 : 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 : n013.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:44:15 EDT 2022 % Result : Theorem 19.02s 2.79s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET148+4 : TPTP v8.1.0. Released v2.2.0. % 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n013.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:20:29 EDT 2022 % 0.12/0.34 % CPUTime : % 19.02/2.79 % SZS status Theorem % 19.02/2.79 % SZS output begin IncompleteProof % 19.02/2.79 cnf(c0, axiom, % 19.02/2.79 ~equal_set(intersection(sK3,sK3),sK3)). % 19.02/2.79 cnf(c1, plain, % 19.02/2.79 ~equal_set(intersection(sK3,sK3),sK3), % 19.02/2.79 inference(start, [], [c0])). % 19.02/2.79 % 19.02/2.79 cnf(c2, axiom, % 19.02/2.79 equal_set(X0,X1) | ~subset(X1,X0) | ~subset(X0,X1)). % 19.02/2.79 cnf(a0, assumption, % 19.02/2.79 intersection(sK3,sK3) = X0). % 19.02/2.79 cnf(a1, assumption, % 19.02/2.79 sK3 = X1). % 19.02/2.79 cnf(c3, plain, % 19.02/2.79 $false, % 19.02/2.79 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 19.02/2.79 cnf(c4, plain, % 19.02/2.79 ~subset(X1,X0) | ~subset(X0,X1), % 19.02/2.79 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 19.02/2.79 % 19.02/2.79 cnf(c5, axiom, % 19.02/2.79 subset(X2,X3) | member(sK0(X2,X3),X2)). % 19.02/2.79 cnf(a2, assumption, % 19.02/2.79 X1 = X2). % 19.02/2.79 cnf(a3, assumption, % 19.02/2.79 X0 = X3). % 19.02/2.79 cnf(c6, plain, % 19.02/2.79 ~subset(X0,X1), % 19.02/2.79 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 19.02/2.79 cnf(c7, plain, % 19.02/2.79 member(sK0(X2,X3),X2), % 19.02/2.79 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 19.02/2.79 % 19.02/2.79 cnf(c8, axiom, % 19.02/2.79 member(X4,intersection(X5,X6)) | ~member(X4,X6) | ~member(X4,X5)). % 19.02/2.79 cnf(a4, assumption, % 19.02/2.79 sK0(X2,X3) = X4). % 19.02/2.79 cnf(a5, assumption, % 19.02/2.79 X2 = X6). % 19.02/2.79 cnf(c9, plain, % 19.02/2.79 $false, % 19.02/2.79 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 19.02/2.79 cnf(c10, plain, % 19.02/2.79 member(X4,intersection(X5,X6)) | ~member(X4,X5), % 19.02/2.79 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 19.02/2.79 % 19.02/2.79 cnf(c11, axiom, % 19.02/2.79 subset(X7,X8) | ~member(sK0(X7,X8),X8)). % 19.02/2.79 cnf(a6, assumption, % 19.02/2.79 X4 = sK0(X7,X8)). % 19.02/2.79 cnf(a7, assumption, % 19.02/2.79 intersection(X5,X6) = X8). % 19.02/2.79 cnf(c12, plain, % 19.02/2.79 ~member(X4,X5), % 19.02/2.79 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 19.02/2.79 cnf(c13, plain, % 19.02/2.79 subset(X7,X8), % 19.02/2.79 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 19.02/2.79 % 19.02/2.79 cnf(c14, plain, % 19.02/2.79 ~subset(X1,X0)). % 19.02/2.79 cnf(a8, assumption, % 19.02/2.79 X7 = X1). % 19.02/2.79 cnf(a9, assumption, % 19.02/2.79 X8 = X0). % 19.02/2.79 cnf(c15, plain, % 19.02/2.79 $false, % 19.02/2.79 inference(predicate_reduction, [assumptions([a8, a9])], [c13, c14])). % 19.02/2.79 % 19.02/2.79 cnf(c16, plain, % 19.02/2.79 member(sK0(X2,X3),X2)). % 19.02/2.79 cnf(a10, assumption, % 19.02/2.79 X4 = sK0(X2,X3)). % 19.02/2.79 cnf(a11, assumption, % 19.02/2.79 X5 = X2). % 19.02/2.79 cnf(c17, plain, % 19.02/2.79 $false, % 19.02/2.79 inference(predicate_reduction, [assumptions([a10, a11])], [c12, c16])). % 19.02/2.79 % 19.02/2.79 cnf(c18, axiom, % 19.02/2.79 subset(X9,X10) | ~member(sK0(X9,X10),X10)). % 19.02/2.79 cnf(a12, assumption, % 19.02/2.79 X0 = X9). % 19.02/2.79 cnf(a13, assumption, % 19.02/2.79 X1 = X10). % 19.02/2.79 cnf(c19, plain, % 19.02/2.79 $false, % 19.02/2.79 inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c18])). % 19.02/2.79 cnf(c20, plain, % 19.02/2.79 ~member(sK0(X9,X10),X10), % 19.02/2.79 inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c18])). % 19.02/2.79 % 19.02/2.79 cnf(c21, axiom, % 19.02/2.79 member(X11,X12) | ~member(X11,intersection(X13,X12))). % 19.02/2.79 cnf(a14, assumption, % 19.02/2.79 sK0(X9,X10) = X11). % 19.02/2.79 cnf(a15, assumption, % 19.02/2.79 X10 = X12). % 19.02/2.79 cnf(c22, plain, % 19.02/2.79 $false, % 19.02/2.79 inference(strict_predicate_extension, [assumptions([a14, a15])], [c20, c21])). % 19.02/2.79 cnf(c23, plain, % 19.02/2.79 ~member(X11,intersection(X13,X12)), % 19.02/2.79 inference(strict_predicate_extension, [assumptions([a14, a15])], [c20, c21])). % 19.02/2.79 % 19.02/2.79 cnf(c24, axiom, % 19.02/2.79 subset(X14,X15) | member(sK0(X14,X15),X14)). % 19.02/2.79 cnf(a16, assumption, % 19.02/2.79 X11 = sK0(X14,X15)). % 19.02/2.79 cnf(a17, assumption, % 19.02/2.79 intersection(X13,X12) = X14). % 19.02/2.79 cnf(c25, plain, % 19.02/2.79 $false, % 19.02/2.79 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])). % 19.02/2.79 cnf(c26, plain, % 19.02/2.79 subset(X14,X15), % 19.02/2.79 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])). % 19.02/2.79 % 19.02/2.79 cnf(c27, plain, % 19.02/2.79 ~subset(X0,X1)). % 19.02/2.79 cnf(a18, assumption, % 19.02/2.79 X14 = X0). % 19.02/2.79 cnf(a19, assumption, % 19.02/2.79 X15 = X1). % 19.02/2.79 cnf(c28, plain, % 19.02/2.79 $false, % 19.02/2.79 inference(predicate_reduction, [assumptions([a18, a19])], [c26, c27])). % 19.02/2.79 % 19.02/2.79 cnf(c29, plain, % 19.02/2.79 $false, % 19.02/2.79 inference(constraint_solving, [ % 19.02/2.79 bind(X0, intersection(sK3,sK3)), % 19.02/2.79 bind(X1, sK3), % 19.02/2.79 bind(X2, sK3), % 19.02/2.79 bind(X3, intersection(sK3,sK3)), % 19.02/2.79 bind(X4, sK0(X2,X3)), % 19.02/2.79 bind(X5, sK3), % 19.02/2.79 bind(X6, sK3), % 19.02/2.79 bind(X7, sK3), % 19.02/2.79 bind(X8, intersection(sK3,sK3)), % 19.02/2.79 bind(X9, intersection(sK3,sK3)), % 19.02/2.79 bind(X10, sK3), % 19.02/2.79 bind(X11, sK0(X9,X10)), % 19.02/2.79 bind(X12, sK3), % 19.02/2.79 bind(X13, sK3), % 19.02/2.79 bind(X14, intersection(sK3,sK3)), % 19.02/2.79 bind(X15, sK3) % 19.02/2.79 ], % 19.02/2.79 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])). % 19.02/2.79 % 19.02/2.79 % SZS output end IncompleteProof %------------------------------------------------------------------------------