%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU113+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 : n008.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 11:53:12 EDT 2022 % Result : Theorem 3.94s 0.90s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEU113+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.14/0.34 % Computer : n008.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Sun Jun 19 04:12:37 EDT 2022 % 0.14/0.34 % CPUTime : % 3.94/0.90 % SZS status Theorem % 3.94/0.90 % SZS output begin IncompleteProof % 3.94/0.90 cnf(c0, axiom, % 3.94/0.90 ~subset(finite_subsets(sK17),powerset(sK17))). % 3.94/0.90 cnf(c1, plain, % 3.94/0.90 ~subset(finite_subsets(sK17),powerset(sK17)), % 3.94/0.90 inference(start, [], [c0])). % 3.94/0.90 % 3.94/0.90 cnf(c2, axiom, % 3.94/0.90 subset(X0,X1) | in(sK5(X0,X1),X0)). % 3.94/0.90 cnf(a0, assumption, % 3.94/0.90 finite_subsets(sK17) = X0). % 3.94/0.90 cnf(a1, assumption, % 3.94/0.90 powerset(sK17) = X1). % 3.94/0.90 cnf(c3, plain, % 3.94/0.90 $false, % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 3.94/0.90 cnf(c4, plain, % 3.94/0.90 in(sK5(X0,X1),X0), % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 3.94/0.90 % 3.94/0.90 cnf(c5, axiom, % 3.94/0.90 sP0(X2,X3) | ~in(X2,X4) | ~sP1(X3,X4)). % 3.94/0.90 cnf(a2, assumption, % 3.94/0.90 sK5(X0,X1) = X2). % 3.94/0.90 cnf(a3, assumption, % 3.94/0.90 X0 = X4). % 3.94/0.90 cnf(c6, plain, % 3.94/0.90 $false, % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 3.94/0.90 cnf(c7, plain, % 3.94/0.90 sP0(X2,X3) | ~sP1(X3,X4), % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 3.94/0.90 % 3.94/0.90 cnf(c8, axiom, % 3.94/0.90 subset(X5,X6) | ~sP0(X5,X6)). % 3.94/0.90 cnf(a4, assumption, % 3.94/0.90 X2 = X5). % 3.94/0.90 cnf(a5, assumption, % 3.94/0.90 X3 = X6). % 3.94/0.90 cnf(c9, plain, % 3.94/0.90 ~sP1(X3,X4), % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 3.94/0.90 cnf(c10, plain, % 3.94/0.90 subset(X5,X6), % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 3.94/0.90 % 3.94/0.90 cnf(c11, axiom, % 3.94/0.90 element(X7,powerset(X8)) | ~subset(X7,X8)). % 3.94/0.90 cnf(a6, assumption, % 3.94/0.90 X5 = X7). % 3.94/0.90 cnf(a7, assumption, % 3.94/0.90 X6 = X8). % 3.94/0.90 cnf(c12, plain, % 3.94/0.90 $false, % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 3.94/0.90 cnf(c13, plain, % 3.94/0.90 element(X7,powerset(X8)), % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 3.94/0.90 % 3.94/0.90 cnf(c14, axiom, % 3.94/0.90 in(X9,X10) | empty(X10) | ~element(X9,X10)). % 3.94/0.90 cnf(a8, assumption, % 3.94/0.90 X7 = X9). % 3.94/0.90 cnf(a9, assumption, % 3.94/0.90 powerset(X8) = X10). % 3.94/0.90 cnf(c15, plain, % 3.94/0.90 $false, % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])). % 3.94/0.90 cnf(c16, plain, % 3.94/0.90 in(X9,X10) | empty(X10), % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])). % 3.94/0.90 % 3.94/0.90 cnf(c17, axiom, % 3.94/0.90 subset(X11,X12) | ~in(sK5(X11,X12),X12)). % 3.94/0.90 cnf(a10, assumption, % 3.94/0.90 X9 = sK5(X11,X12)). % 3.94/0.90 cnf(a11, assumption, % 3.94/0.90 X10 = X12). % 3.94/0.90 cnf(c18, plain, % 3.94/0.90 empty(X10), % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 3.94/0.90 cnf(c19, plain, % 3.94/0.90 subset(X11,X12), % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 3.94/0.90 % 3.94/0.90 cnf(c20, plain, % 3.94/0.90 ~subset(finite_subsets(sK17),powerset(sK17))). % 3.94/0.90 cnf(a12, assumption, % 3.94/0.90 X11 = finite_subsets(sK17)). % 3.94/0.90 cnf(a13, assumption, % 3.94/0.90 X12 = powerset(sK17)). % 3.94/0.90 cnf(c21, plain, % 3.94/0.90 $false, % 3.94/0.90 inference(predicate_reduction, [assumptions([a12, a13])], [c19, c20])). % 3.94/0.90 % 3.94/0.90 cnf(c22, axiom, % 3.94/0.90 ~empty(powerset(X13))). % 3.94/0.90 cnf(a14, assumption, % 3.94/0.90 X10 = powerset(X13)). % 3.94/0.90 cnf(c23, plain, % 3.94/0.90 $false, % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a14])], [c18, c22])). % 3.94/0.90 cnf(c24, plain, % 3.94/0.90 $false, % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a14])], [c18, c22])). % 3.94/0.90 % 3.94/0.90 cnf(c25, axiom, % 3.94/0.90 sP1(X14,finite_subsets(X14)) | ~sP2(finite_subsets(X14),X14)). % 3.94/0.90 cnf(a15, assumption, % 3.94/0.90 X3 = X14). % 3.94/0.90 cnf(a16, assumption, % 3.94/0.90 X4 = finite_subsets(X14)). % 3.94/0.90 cnf(c26, plain, % 3.94/0.90 $false, % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a15, a16])], [c9, c25])). % 3.94/0.90 cnf(c27, plain, % 3.94/0.90 ~sP2(finite_subsets(X14),X14), % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a15, a16])], [c9, c25])). % 3.94/0.90 % 3.94/0.90 cnf(c28, axiom, % 3.94/0.90 sP2(X15,X16) | ~preboolean(X15)). % 3.94/0.90 cnf(a17, assumption, % 3.94/0.90 finite_subsets(X14) = X15). % 3.94/0.90 cnf(a18, assumption, % 3.94/0.90 X14 = X16). % 3.94/0.90 cnf(c29, plain, % 3.94/0.90 $false, % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a17, a18])], [c27, c28])). % 3.94/0.90 cnf(c30, plain, % 3.94/0.90 ~preboolean(X15), % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a17, a18])], [c27, c28])). % 3.94/0.90 % 3.94/0.90 cnf(c31, axiom, % 3.94/0.90 preboolean(finite_subsets(X17))). % 3.94/0.90 cnf(a19, assumption, % 3.94/0.90 X15 = finite_subsets(X17)). % 3.94/0.90 cnf(c32, plain, % 3.94/0.90 $false, % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a19])], [c30, c31])). % 3.94/0.90 cnf(c33, plain, % 3.94/0.90 $false, % 3.94/0.90 inference(strict_predicate_extension, [assumptions([a19])], [c30, c31])). % 3.94/0.90 % 3.94/0.90 cnf(c34, plain, % 3.94/0.90 $false, % 3.94/0.90 inference(constraint_solving, [ % 3.94/0.90 bind(X0, finite_subsets(sK17)), % 3.94/0.90 bind(X1, powerset(sK17)), % 3.94/0.90 bind(X2, sK5(X0,X1)), % 3.94/0.90 bind(X3, sK17), % 3.94/0.90 bind(X4, finite_subsets(sK17)), % 3.94/0.90 bind(X5, sK5(X0,X1)), % 3.94/0.90 bind(X6, sK17), % 3.94/0.90 bind(X7, sK5(X0,X1)), % 3.94/0.90 bind(X8, sK17), % 3.94/0.90 bind(X9, sK5(X0,X1)), % 3.94/0.90 bind(X10, powerset(X8)), % 3.94/0.90 bind(X11, finite_subsets(sK17)), % 3.94/0.90 bind(X12, powerset(sK17)), % 3.94/0.90 bind(X13, sK17), % 3.94/0.90 bind(X14, sK17), % 3.94/0.90 bind(X15, finite_subsets(X14)), % 3.94/0.90 bind(X16, sK17), % 3.94/0.90 bind(X17, sK17) % 3.94/0.90 ], % 3.94/0.90 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])). % 3.94/0.90 % 3.94/0.90 % SZS output end IncompleteProof %------------------------------------------------------------------------------