%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET947+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 : n028.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:23 EDT 2022 % Result : Theorem 0.12s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : SET947+1 : TPTP v8.1.0. Released v3.2.0. % 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n028.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 : Mon Jul 11 01:23:43 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 % SZS status Theorem % 0.12/0.34 % SZS output begin IncompleteProof % 0.12/0.34 cnf(c0, axiom, % 0.12/0.34 ~subset(sK5,powerset(union(sK5)))). % 0.12/0.34 cnf(c1, plain, % 0.12/0.34 ~subset(sK5,powerset(union(sK5))), % 0.12/0.34 inference(start, [], [c0])). % 0.12/0.34 % 0.12/0.34 cnf(c2, axiom, % 0.12/0.34 subset(X0,X1) | ~in(sK2(X0,X1),X1)). % 0.12/0.34 cnf(a0, assumption, % 0.12/0.34 sK5 = X0). % 0.12/0.34 cnf(a1, assumption, % 0.12/0.34 powerset(union(sK5)) = X1). % 0.12/0.34 cnf(c3, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.34 cnf(c4, plain, % 0.12/0.34 ~in(sK2(X0,X1),X1), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.34 % 0.12/0.34 cnf(c5, axiom, % 0.12/0.34 in(X2,X3) | ~subset(X2,X4) | ~sP0(X4,X3)). % 0.12/0.34 cnf(a2, assumption, % 0.12/0.34 sK2(X0,X1) = X2). % 0.12/0.34 cnf(a3, assumption, % 0.12/0.34 X1 = X3). % 0.12/0.34 cnf(c6, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.34 cnf(c7, plain, % 0.12/0.34 ~subset(X2,X4) | ~sP0(X4,X3), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.34 % 0.12/0.34 cnf(c8, axiom, % 0.12/0.34 subset(X5,union(X6)) | ~in(X5,X6)). % 0.12/0.34 cnf(a4, assumption, % 0.12/0.34 X2 = X5). % 0.12/0.34 cnf(a5, assumption, % 0.12/0.34 X4 = union(X6)). % 0.12/0.34 cnf(c9, plain, % 0.12/0.34 ~sP0(X4,X3), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.12/0.34 cnf(c10, plain, % 0.12/0.34 ~in(X5,X6), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.12/0.34 % 0.12/0.34 cnf(c11, axiom, % 0.12/0.34 subset(X7,X8) | in(sK2(X7,X8),X7)). % 0.12/0.34 cnf(a6, assumption, % 0.12/0.34 X5 = sK2(X7,X8)). % 0.12/0.34 cnf(a7, assumption, % 0.12/0.34 X6 = X7). % 0.12/0.34 cnf(c12, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.12/0.34 cnf(c13, plain, % 0.12/0.34 subset(X7,X8), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.12/0.34 % 0.12/0.34 cnf(c14, plain, % 0.12/0.34 ~subset(sK5,powerset(union(sK5)))). % 0.12/0.34 cnf(a8, assumption, % 0.12/0.34 X7 = sK5). % 0.12/0.34 cnf(a9, assumption, % 0.12/0.34 X8 = powerset(union(sK5))). % 0.12/0.34 cnf(c15, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [assumptions([a8, a9])], [c13, c14])). % 0.12/0.34 % 0.12/0.34 cnf(c16, axiom, % 0.12/0.34 sP0(X9,powerset(X9))). % 0.12/0.34 cnf(a10, assumption, % 0.12/0.34 X4 = X9). % 0.12/0.34 cnf(a11, assumption, % 0.12/0.34 X3 = powerset(X9)). % 0.12/0.34 cnf(c17, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a10, a11])], [c9, c16])). % 0.12/0.34 cnf(c18, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a10, a11])], [c9, c16])). % 0.12/0.34 % 0.12/0.34 cnf(c19, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(constraint_solving, [ % 0.12/0.34 bind(X0, sK5), % 0.12/0.34 bind(X1, powerset(union(sK5))), % 0.12/0.34 bind(X2, sK2(X0,X1)), % 0.12/0.34 bind(X3, powerset(union(sK5))), % 0.12/0.34 bind(X4, union(X6)), % 0.12/0.34 bind(X5, sK2(X0,X1)), % 0.12/0.34 bind(X6, sK5), % 0.12/0.34 bind(X7, sK5), % 0.12/0.34 bind(X8, powerset(union(sK5))), % 0.12/0.34 bind(X9, union(X6)) % 0.12/0.34 ], % 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.12/0.34 % 0.12/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------