%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET956+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 : n016.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:26 EDT 2022 % Result : Theorem 0.12s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET956+1 : TPTP v8.1.0. Released v3.2.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n016.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jul 11 02:02:42 EDT 2022 % 0.12/0.34 % 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 ~subset(sK6,sK9)). % 0.12/0.37 cnf(c1, plain, % 0.12/0.37 ~subset(sK6,sK9), % 0.12/0.37 inference(start, [], [c0])). % 0.12/0.37 % 0.12/0.37 cnf(c2, axiom, % 0.12/0.37 subset(X0,X1) | in(sK1(X0,X1),X0)). % 0.12/0.37 cnf(a0, assumption, % 0.12/0.37 sK6 = X0). % 0.12/0.37 cnf(a1, assumption, % 0.12/0.37 sK9 = X1). % 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 in(sK1(X0,X1),X0), % 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 sP0(X2,X3,X4) | ~in(X2,X5) | ~subset(X5,cartesian_product2(X4,X3))). % 0.12/0.37 cnf(a2, assumption, % 0.12/0.37 sK1(X0,X1) = X2). % 0.12/0.37 cnf(a3, assumption, % 0.12/0.37 X0 = X5). % 0.12/0.37 cnf(c6, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.37 cnf(c7, plain, % 0.12/0.37 sP0(X2,X3,X4) | ~subset(X5,cartesian_product2(X4,X3)), % 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 unordered_pair(unordered_pair(sK4(X6,X7,X8),sK5(X6,X7,X8)),singleton(sK4(X6,X7,X8))) = X6 | ~sP0(X6,X7,X8)). % 0.12/0.37 cnf(a4, assumption, % 0.12/0.37 X2 = X6). % 0.12/0.37 cnf(a5, assumption, % 0.12/0.37 X3 = X7). % 0.12/0.37 cnf(a6, assumption, % 0.12/0.37 X4 = X8). % 0.12/0.37 cnf(c9, plain, % 0.12/0.37 ~subset(X5,cartesian_product2(X4,X3)), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])). % 0.12/0.37 cnf(c10, plain, % 0.12/0.37 unordered_pair(unordered_pair(sK4(X6,X7,X8),sK5(X6,X7,X8)),singleton(sK4(X6,X7,X8))) = X6, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])). % 0.12/0.37 % 0.12/0.37 cnf(c11, axiom, % 0.12/0.37 in(unordered_pair(unordered_pair(X9,X10),singleton(X9)),sK9) | ~in(unordered_pair(unordered_pair(X9,X10),singleton(X9)),sK6)). % 0.12/0.37 cnf(a7, assumption, % 0.12/0.37 unordered_pair(unordered_pair(X9,X10),singleton(X9)) = unordered_pair(unordered_pair(sK4(X6,X7,X8),sK5(X6,X7,X8)),singleton(sK4(X6,X7,X8)))). % 0.12/0.37 cnf(c12, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_subterm_extension, [assumptions([a7])], [c10, c11])). % 0.12/0.37 cnf(c13, plain, % 0.12/0.37 ~in(unordered_pair(unordered_pair(X9,X10),singleton(X9)),sK6), % 0.12/0.37 inference(strict_subterm_extension, [assumptions([a7])], [c10, c11])). % 0.12/0.37 cnf(c14, plain, % 0.12/0.37 in(X6,sK9), % 0.12/0.37 inference(strict_subterm_extension, [assumptions([a7])], [c10, c11])). % 0.12/0.37 % 0.12/0.37 cnf(c15, axiom, % 0.12/0.37 subset(X11,X12) | ~in(sK1(X11,X12),X12)). % 0.12/0.37 cnf(a8, assumption, % 0.12/0.37 X6 = sK1(X11,X12)). % 0.12/0.37 cnf(a9, assumption, % 0.12/0.37 sK9 = X12). % 0.12/0.37 cnf(c16, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a8, a9])], [c14, c15])). % 0.12/0.37 cnf(c17, plain, % 0.12/0.37 subset(X11,X12), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a8, a9])], [c14, c15])). % 0.12/0.37 % 0.12/0.37 cnf(c18, plain, % 0.12/0.37 ~subset(sK6,sK9)). % 0.12/0.37 cnf(a10, assumption, % 0.12/0.37 X11 = sK6). % 0.12/0.37 cnf(a11, assumption, % 0.12/0.37 X12 = sK9). % 0.12/0.37 cnf(c19, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(predicate_reduction, [assumptions([a10, a11])], [c17, c18])). % 0.12/0.37 % 0.12/0.37 cnf(c20, plain, % 0.12/0.37 unordered_pair(unordered_pair(sK4(X6,X7,X8),sK5(X6,X7,X8)),singleton(sK4(X6,X7,X8))) = X6). % 0.12/0.37 cnf(a12, assumption, % 0.12/0.37 unordered_pair(unordered_pair(X9,X10),singleton(X9)) = unordered_pair(unordered_pair(sK4(X6,X7,X8),sK5(X6,X7,X8)),singleton(sK4(X6,X7,X8)))). % 0.12/0.37 cnf(c21, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(equality_reduction, [assumptions([a12])], [c13, c20])). % 0.12/0.37 cnf(c22, plain, % 0.12/0.37 ~in(X6,sK6), % 0.12/0.37 inference(equality_reduction, [assumptions([a12])], [c13, c20])). % 0.12/0.37 % 0.12/0.37 cnf(c23, plain, % 0.12/0.37 in(sK1(X0,X1),X0)). % 0.12/0.37 cnf(a13, assumption, % 0.12/0.37 X6 = sK1(X0,X1)). % 0.12/0.37 cnf(a14, assumption, % 0.12/0.37 sK6 = X0). % 0.12/0.37 cnf(c24, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(predicate_reduction, [assumptions([a13, a14])], [c22, c23])). % 0.12/0.37 % 0.12/0.37 cnf(c25, axiom, % 0.12/0.37 subset(sK6,cartesian_product2(sK7,sK8))). % 0.12/0.37 cnf(a15, assumption, % 0.12/0.37 X5 = sK6). % 0.12/0.37 cnf(a16, assumption, % 0.12/0.37 cartesian_product2(X4,X3) = cartesian_product2(sK7,sK8)). % 0.12/0.37 cnf(c26, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a15, a16])], [c9, c25])). % 0.12/0.37 cnf(c27, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a15, a16])], [c9, c25])). % 0.12/0.37 % 0.12/0.37 cnf(c28, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(constraint_solving, [ % 0.12/0.37 bind(X0, sK6), % 0.12/0.37 bind(X1, sK9), % 0.12/0.37 bind(X2, sK1(X0,X1)), % 0.12/0.37 bind(X3, sK8), % 0.12/0.37 bind(X4, sK7), % 0.12/0.37 bind(X5, sK6), % 0.12/0.37 bind(X6, sK1(X0,X1)), % 0.12/0.37 bind(X7, sK8), % 0.12/0.37 bind(X8, sK7), % 0.12/0.37 bind(X9, sK4(X6,X7,X8)), % 0.12/0.37 bind(X10, sK5(X6,X7,X8)), % 0.12/0.37 bind(X11, sK6), % 0.12/0.37 bind(X12, sK9) % 0.12/0.37 ], % 0.12/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])). % 0.12/0.37 % 0.12/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------