%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET950+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 : n014.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:24 EDT 2022 % Result : Theorem 4.74s 0.96s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SET950+1 : TPTP v8.1.0. Released v3.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 : n014.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 03:15:35 EDT 2022 % 0.12/0.34 % CPUTime : % 4.74/0.96 % SZS status Theorem % 4.74/0.96 % SZS output begin IncompleteProof % 4.74/0.96 cnf(c0, axiom, % 4.74/0.96 subset(sK8,cartesian_product2(sK9,sK10))). % 4.74/0.96 cnf(c1, plain, % 4.74/0.96 subset(sK8,cartesian_product2(sK9,sK10)), % 4.74/0.96 inference(start, [], [c0])). % 4.74/0.96 % 4.74/0.96 cnf(c2, axiom, % 4.74/0.96 in(X0,X1) | ~in(X0,X2) | ~subset(X2,X1)). % 4.74/0.96 cnf(a0, assumption, % 4.74/0.96 sK8 = X2). % 4.74/0.96 cnf(a1, assumption, % 4.74/0.96 cartesian_product2(sK9,sK10) = X1). % 4.74/0.96 cnf(c3, plain, % 4.74/0.96 $false, % 4.74/0.96 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 4.74/0.96 cnf(c4, plain, % 4.74/0.96 in(X0,X1) | ~in(X0,X2), % 4.74/0.96 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 4.74/0.96 % 4.74/0.96 cnf(c5, axiom, % 4.74/0.96 sP0(X3,X4,X5) | ~in(X3,X6) | ~sP1(X5,X4,X6)). % 4.74/0.96 cnf(a2, assumption, % 4.74/0.96 X0 = X3). % 4.74/0.96 cnf(a3, assumption, % 4.74/0.96 X1 = X6). % 4.74/0.96 cnf(c6, plain, % 4.74/0.96 ~in(X0,X2), % 4.74/0.96 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 4.74/0.96 cnf(c7, plain, % 4.74/0.96 sP0(X3,X4,X5) | ~sP1(X5,X4,X6), % 4.74/0.96 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 4.74/0.96 % 4.74/0.96 cnf(c8, axiom, % 4.74/0.96 unordered_pair(unordered_pair(sK3(X7,X8,X9),sK4(X7,X8,X9)),singleton(sK3(X7,X8,X9))) = X7 | ~sP0(X7,X8,X9)). % 4.74/0.96 cnf(a4, assumption, % 4.74/0.96 X3 = X7). % 4.74/0.96 cnf(a5, assumption, % 4.74/0.96 X4 = X8). % 4.74/0.96 cnf(a6, assumption, % 4.74/0.96 X5 = X9). % 4.74/0.96 cnf(c9, plain, % 4.74/0.96 ~sP1(X5,X4,X6), % 4.74/0.96 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])). % 4.74/0.96 cnf(c10, plain, % 4.74/0.96 unordered_pair(unordered_pair(sK3(X7,X8,X9),sK4(X7,X8,X9)),singleton(sK3(X7,X8,X9))) = X7, % 4.74/0.96 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])). % 4.74/0.96 % 4.74/0.96 cnf(c11, axiom, % 4.74/0.96 sK11 != unordered_pair(unordered_pair(X10,X11),singleton(X10)) | ~in(X11,sK10) | ~in(X10,sK9)). % 4.74/0.96 cnf(a7, assumption, % 4.74/0.96 unordered_pair(unordered_pair(X10,X11),singleton(X10)) = unordered_pair(unordered_pair(sK3(X7,X8,X9),sK4(X7,X8,X9)),singleton(sK3(X7,X8,X9)))). % 4.74/0.96 cnf(c12, plain, % 4.74/0.96 $false, % 4.74/0.96 inference(strict_subterm_extension, [assumptions([a7])], [c10, c11])). % 4.74/0.96 cnf(c13, plain, % 4.74/0.96 ~in(X11,sK10) | ~in(X10,sK9), % 4.74/0.96 inference(strict_subterm_extension, [assumptions([a7])], [c10, c11])). % 4.74/0.96 cnf(c14, plain, % 4.74/0.96 sK11 != X7, % 4.74/0.96 inference(strict_subterm_extension, [assumptions([a7])], [c10, c11])). % 4.74/0.96 % 4.74/0.96 cnf(a8, assumption, % 4.74/0.96 sK11 = X7). % 4.74/0.96 cnf(c15, plain, % 4.74/0.96 $false, % 4.74/0.96 inference(reflexivity, [assumptions([a8])], [c14])). % 4.74/0.96 % 4.74/0.96 cnf(c16, axiom, % 4.74/0.96 in(sK4(X12,X13,X14),X13) | ~sP0(X12,X13,X14)). % 4.74/0.96 cnf(a9, assumption, % 4.74/0.96 X11 = sK4(X12,X13,X14)). % 4.74/0.96 cnf(a10, assumption, % 4.74/0.96 sK10 = X13). % 4.74/0.96 cnf(c17, plain, % 4.74/0.96 ~in(X10,sK9), % 4.74/0.96 inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c16])). % 4.74/0.96 cnf(c18, plain, % 4.74/0.96 ~sP0(X12,X13,X14), % 4.74/0.96 inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c16])). % 4.74/0.96 % 4.74/0.96 cnf(c19, plain, % 4.74/0.96 sP0(X3,X4,X5)). % 4.74/0.96 cnf(a11, assumption, % 4.74/0.96 X12 = X3). % 4.74/0.96 cnf(a12, assumption, % 4.74/0.96 X13 = X4). % 4.74/0.96 cnf(a13, assumption, % 4.74/0.96 X14 = X5). % 4.74/0.96 cnf(c20, plain, % 4.74/0.96 $false, % 4.74/0.96 inference(predicate_reduction, [assumptions([a11, a12, a13])], [c18, c19])). % 4.74/0.96 % 4.74/0.96 cnf(c21, axiom, % 4.74/0.96 in(sK3(X15,X16,X17),X17) | ~sP0(X15,X16,X17)). % 4.74/0.96 cnf(a14, assumption, % 4.74/0.96 X10 = sK3(X15,X16,X17)). % 4.74/0.96 cnf(a15, assumption, % 4.74/0.96 sK9 = X17). % 4.74/0.96 cnf(c22, plain, % 4.74/0.96 $false, % 4.74/0.96 inference(strict_predicate_extension, [assumptions([a14, a15])], [c17, c21])). % 4.74/0.96 cnf(c23, plain, % 4.74/0.96 ~sP0(X15,X16,X17), % 4.74/0.96 inference(strict_predicate_extension, [assumptions([a14, a15])], [c17, c21])). % 4.74/0.96 % 4.74/0.96 cnf(c24, plain, % 4.74/0.96 sP0(X3,X4,X5)). % 4.74/0.96 cnf(a16, assumption, % 4.74/0.96 X15 = X3). % 4.74/0.96 cnf(a17, assumption, % 4.74/0.96 X16 = X4). % 4.74/0.96 cnf(a18, assumption, % 4.74/0.96 X17 = X5). % 4.74/0.96 cnf(c25, plain, % 4.74/0.96 $false, % 4.74/0.96 inference(predicate_reduction, [assumptions([a16, a17, a18])], [c23, c24])). % 4.74/0.96 % 4.74/0.96 cnf(c26, axiom, % 4.74/0.96 sP1(X18,X19,cartesian_product2(X18,X19))). % 4.74/0.96 cnf(a19, assumption, % 4.74/0.96 X5 = X18). % 4.74/0.96 cnf(a20, assumption, % 4.74/0.96 X4 = X19). % 4.74/0.96 cnf(a21, assumption, % 4.74/0.96 X6 = cartesian_product2(X18,X19)). % 4.74/0.96 cnf(c27, plain, % 4.74/0.96 $false, % 4.74/0.96 inference(strict_predicate_extension, [assumptions([a19, a20, a21])], [c9, c26])). % 4.74/0.96 cnf(c28, plain, % 4.74/0.96 $false, % 4.74/0.96 inference(strict_predicate_extension, [assumptions([a19, a20, a21])], [c9, c26])). % 4.74/0.96 % 4.74/0.96 cnf(c29, axiom, % 4.74/0.96 in(sK11,sK8)). % 4.74/0.96 cnf(a22, assumption, % 4.74/0.96 X0 = sK11). % 4.74/0.96 cnf(a23, assumption, % 4.74/0.96 X2 = sK8). % 4.74/0.96 cnf(c30, plain, % 4.74/0.96 $false, % 4.74/0.96 inference(strict_predicate_extension, [assumptions([a22, a23])], [c6, c29])). % 4.74/0.96 cnf(c31, plain, % 4.74/0.96 $false, % 4.74/0.96 inference(strict_predicate_extension, [assumptions([a22, a23])], [c6, c29])). % 4.74/0.96 % 4.74/0.96 cnf(c32, plain, % 4.74/0.96 $false, % 4.74/0.96 inference(constraint_solving, [ % 4.74/0.96 bind(X0, sK11), % 4.74/0.96 bind(X1, cartesian_product2(sK9,sK10)), % 4.74/0.96 bind(X2, sK8), % 4.74/0.96 bind(X3, sK11), % 4.74/0.96 bind(X4, sK10), % 4.74/0.96 bind(X5, sK9), % 4.74/0.96 bind(X6, cartesian_product2(sK9,sK10)), % 4.74/0.96 bind(X7, sK11), % 4.74/0.96 bind(X8, sK10), % 4.74/0.96 bind(X9, sK9), % 4.74/0.96 bind(X10, sK3(X7,X8,X9)), % 4.74/0.96 bind(X11, sK4(X7,X8,X9)), % 4.74/0.96 bind(X12, sK11), % 4.74/0.96 bind(X13, sK10), % 4.74/0.96 bind(X14, sK9), % 4.74/0.96 bind(X15, sK11), % 4.74/0.96 bind(X16, sK10), % 4.74/0.96 bind(X17, sK9), % 4.74/0.96 bind(X18, sK9), % 4.74/0.96 bind(X19, sK10) % 4.74/0.96 ], % 4.74/0.96 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23])). % 4.74/0.96 % 4.74/0.96 % SZS output end IncompleteProof %------------------------------------------------------------------------------