%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET974+1 : TPTP v8.1.0. Released v3.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:49:32 EDT 2022 % Result : Theorem 0.20s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SET974+1 : TPTP v8.1.0. Released v3.2.0. % 0.03/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 15:11:31 EDT 2022 % 0.12/0.33 % CPUTime : % 0.20/0.35 % SZS status Theorem % 0.20/0.35 % SZS output begin IncompleteProof % 0.20/0.35 cnf(c0, axiom, % 0.20/0.35 disjoint(sK7,sK8) | disjoint(sK5,sK6)). % 0.20/0.35 cnf(c1, plain, % 0.20/0.35 disjoint(sK7,sK8) | disjoint(sK5,sK6), % 0.20/0.35 inference(start, [], [c0])). % 0.20/0.35 % 0.20/0.35 cnf(c2, axiom, % 0.20/0.35 ~disjoint(X0,X1) | ~in(X2,set_intersection2(X0,X1))). % 0.20/0.35 cnf(a0, assumption, % 0.20/0.35 sK7 = X0). % 0.20/0.35 cnf(a1, assumption, % 0.20/0.35 sK8 = X1). % 0.20/0.35 cnf(c3, plain, % 0.20/0.35 disjoint(sK5,sK6), % 0.20/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.35 cnf(c4, plain, % 0.20/0.35 ~in(X2,set_intersection2(X0,X1)), % 0.20/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.35 % 0.20/0.35 cnf(c5, axiom, % 0.20/0.35 in(sK4(X3,X4,X5,X6,X7),set_intersection2(X4,X3)) | ~sP0(X3,X4,X5,X6,X7)). % 0.20/0.35 cnf(a2, assumption, % 0.20/0.35 X2 = sK4(X3,X4,X5,X6,X7)). % 0.20/0.35 cnf(a3, assumption, % 0.20/0.35 set_intersection2(X0,X1) = set_intersection2(X4,X3)). % 0.20/0.35 cnf(c6, plain, % 0.20/0.35 $false, % 0.20/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.35 cnf(c7, plain, % 0.20/0.35 ~sP0(X3,X4,X5,X6,X7), % 0.20/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.35 % 0.20/0.35 cnf(c8, axiom, % 0.20/0.35 sP0(X8,X9,X10,X11,X12) | ~in(X12,set_intersection2(cartesian_product2(X11,X9),cartesian_product2(X10,X8)))). % 0.20/0.35 cnf(a4, assumption, % 0.20/0.35 X3 = X8). % 0.20/0.35 cnf(a5, assumption, % 0.20/0.35 X4 = X9). % 0.20/0.35 cnf(a6, assumption, % 0.20/0.35 X5 = X10). % 0.20/0.35 cnf(a7, assumption, % 0.20/0.35 X6 = X11). % 0.20/0.35 cnf(a8, assumption, % 0.20/0.35 X7 = X12). % 0.20/0.35 cnf(c9, plain, % 0.20/0.35 $false, % 0.20/0.35 inference(strict_predicate_extension, [assumptions([a4, a5, a6, a7, a8])], [c7, c8])). % 0.20/0.35 cnf(c10, plain, % 0.20/0.35 ~in(X12,set_intersection2(cartesian_product2(X11,X9),cartesian_product2(X10,X8))), % 0.20/0.35 inference(strict_predicate_extension, [assumptions([a4, a5, a6, a7, a8])], [c7, c8])). % 0.20/0.35 % 0.20/0.35 cnf(c11, axiom, % 0.20/0.35 in(sK9(X13,X14),set_intersection2(X13,X14)) | disjoint(X13,X14)). % 0.20/0.35 cnf(a9, assumption, % 0.20/0.35 X12 = sK9(X13,X14)). % 0.20/0.35 cnf(a10, assumption, % 0.20/0.35 set_intersection2(cartesian_product2(X11,X9),cartesian_product2(X10,X8)) = set_intersection2(X13,X14)). % 0.20/0.35 cnf(c12, plain, % 0.20/0.35 $false, % 0.20/0.35 inference(strict_predicate_extension, [assumptions([a9, a10])], [c10, c11])). % 0.20/0.35 cnf(c13, plain, % 0.20/0.35 disjoint(X13,X14), % 0.20/0.35 inference(strict_predicate_extension, [assumptions([a9, a10])], [c10, c11])). % 0.20/0.35 % 0.20/0.35 cnf(c14, axiom, % 0.20/0.35 ~disjoint(cartesian_product2(sK5,sK7),cartesian_product2(sK6,sK8))). % 0.20/0.35 cnf(a11, assumption, % 0.20/0.35 X13 = cartesian_product2(sK5,sK7)). % 0.20/0.35 cnf(a12, assumption, % 0.20/0.35 X14 = cartesian_product2(sK6,sK8)). % 0.20/0.35 cnf(c15, plain, % 0.20/0.35 $false, % 0.20/0.35 inference(strict_predicate_extension, [assumptions([a11, a12])], [c13, c14])). % 0.20/0.35 cnf(c16, plain, % 0.20/0.35 $false, % 0.20/0.35 inference(strict_predicate_extension, [assumptions([a11, a12])], [c13, c14])). % 0.20/0.35 % 0.20/0.35 cnf(c17, axiom, % 0.20/0.35 ~disjoint(X15,X16) | ~in(X17,set_intersection2(X15,X16))). % 0.20/0.35 cnf(a13, assumption, % 0.20/0.35 sK5 = X15). % 0.20/0.35 cnf(a14, assumption, % 0.20/0.35 sK6 = X16). % 0.20/0.35 cnf(c18, plain, % 0.20/0.35 $false, % 0.20/0.35 inference(strict_predicate_extension, [assumptions([a13, a14])], [c3, c17])). % 0.20/0.35 cnf(c19, plain, % 0.20/0.35 ~in(X17,set_intersection2(X15,X16)), % 0.20/0.35 inference(strict_predicate_extension, [assumptions([a13, a14])], [c3, c17])). % 0.20/0.35 % 0.20/0.35 cnf(c20, axiom, % 0.20/0.35 in(sK3(X18,X19,X20,X21,X22),set_intersection2(X21,X20)) | ~sP0(X18,X19,X20,X21,X22)). % 0.20/0.35 cnf(a15, assumption, % 0.20/0.35 X17 = sK3(X18,X19,X20,X21,X22)). % 0.20/0.35 cnf(a16, assumption, % 0.20/0.35 set_intersection2(X15,X16) = set_intersection2(X21,X20)). % 0.20/0.35 cnf(c21, plain, % 0.20/0.35 $false, % 0.20/0.35 inference(strict_predicate_extension, [assumptions([a15, a16])], [c19, c20])). % 0.20/0.35 cnf(c22, plain, % 0.20/0.35 ~sP0(X18,X19,X20,X21,X22), % 0.20/0.35 inference(strict_predicate_extension, [assumptions([a15, a16])], [c19, c20])). % 0.20/0.35 % 0.20/0.35 cnf(c23, plain, % 0.20/0.35 sP0(X3,X4,X5,X6,X7)). % 0.20/0.35 cnf(a17, assumption, % 0.20/0.35 X18 = X3). % 0.20/0.35 cnf(a18, assumption, % 0.20/0.35 X19 = X4). % 0.20/0.35 cnf(a19, assumption, % 0.20/0.35 X20 = X5). % 0.20/0.35 cnf(a20, assumption, % 0.20/0.35 X21 = X6). % 0.20/0.35 cnf(a21, assumption, % 0.20/0.35 X22 = X7). % 0.20/0.35 cnf(c24, plain, % 0.20/0.35 $false, % 0.20/0.35 inference(predicate_reduction, [assumptions([a17, a18, a19, a20, a21])], [c22, c23])). % 0.20/0.35 % 0.20/0.35 cnf(c25, plain, % 0.20/0.35 $false, % 0.20/0.35 inference(constraint_solving, [ % 0.20/0.35 bind(X0, sK7), % 0.20/0.35 bind(X1, sK8), % 0.20/0.35 bind(X2, sK4(X3,X4,X5,X6,X7)), % 0.20/0.35 bind(X3, sK8), % 0.20/0.35 bind(X4, sK7), % 0.20/0.35 bind(X5, sK6), % 0.20/0.35 bind(X6, sK5), % 0.20/0.35 bind(X7, sK9(X13,X14)), % 0.20/0.35 bind(X8, sK8), % 0.20/0.35 bind(X9, sK7), % 0.20/0.35 bind(X10, sK6), % 0.20/0.35 bind(X11, sK5), % 0.20/0.35 bind(X12, sK9(X13,X14)), % 0.20/0.35 bind(X13, cartesian_product2(X11,X9)), % 0.20/0.35 bind(X14, cartesian_product2(X10,X8)), % 0.20/0.35 bind(X15, sK5), % 0.20/0.35 bind(X16, sK6), % 0.20/0.35 bind(X17, sK3(X18,X19,X20,X21,X22)), % 0.20/0.35 bind(X18, sK8), % 0.20/0.35 bind(X19, sK7), % 0.20/0.35 bind(X20, sK6), % 0.20/0.35 bind(X21, sK5), % 0.20/0.35 bind(X22, sK9(X13,X14)) % 0.20/0.35 ], % 0.20/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])). % 0.20/0.35 % 0.20/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------