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