%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU321+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n010.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:55:03 EDT 2022 % Result : Theorem 9.26s 1.52s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU321+1 : TPTP v8.1.0. Released v3.3.0. % 0.12/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n010.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 Jun 20 06:21:37 EDT 2022 % 0.12/0.33 % CPUTime : % 9.26/1.52 % SZS status Theorem % 9.26/1.52 % SZS output begin IncompleteProof % 9.26/1.52 cnf(c0, axiom, % 9.26/1.52 ~in(sK14,sK13) | in(sK14,subset_complement(the_carrier(sK12),sK13))). % 9.26/1.52 cnf(c1, plain, % 9.26/1.52 ~in(sK14,sK13) | in(sK14,subset_complement(the_carrier(sK12),sK13)), % 9.26/1.52 inference(start, [], [c0])). % 9.26/1.52 % 9.26/1.52 cnf(c2, axiom, % 9.26/1.52 in(sK14,sK13) | ~in(sK14,subset_complement(the_carrier(sK12),sK13))). % 9.26/1.52 cnf(a0, assumption, % 9.26/1.52 sK14 = sK14). % 9.26/1.52 cnf(a1, assumption, % 9.26/1.52 sK13 = sK13). % 9.26/1.52 cnf(c3, plain, % 9.26/1.52 in(sK14,subset_complement(the_carrier(sK12),sK13)), % 9.26/1.52 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 9.26/1.52 cnf(c4, plain, % 9.26/1.52 ~in(sK14,subset_complement(the_carrier(sK12),sK13)), % 9.26/1.52 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 9.26/1.52 % 9.26/1.52 cnf(c5, axiom, % 9.26/1.52 in(X0,subset_complement(X1,X2)) | in(X0,X2) | ~element(X0,X1) | ~element(X2,powerset(X1)) | empty_set = X1). % 9.26/1.52 cnf(a2, assumption, % 9.26/1.52 sK14 = X0). % 9.26/1.52 cnf(a3, assumption, % 9.26/1.52 subset_complement(the_carrier(sK12),sK13) = subset_complement(X1,X2)). % 9.26/1.52 cnf(c6, plain, % 9.26/1.52 $false, % 9.26/1.52 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 9.26/1.52 cnf(c7, plain, % 9.26/1.52 in(X0,X2) | ~element(X0,X1) | ~element(X2,powerset(X1)) | empty_set = X1, % 9.26/1.52 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 9.26/1.52 % 9.26/1.52 cnf(c8, plain, % 9.26/1.52 ~in(sK14,sK13)). % 9.26/1.52 cnf(a4, assumption, % 9.26/1.52 X0 = sK14). % 9.26/1.52 cnf(a5, assumption, % 9.26/1.52 X2 = sK13). % 9.26/1.52 cnf(c9, plain, % 9.26/1.52 ~element(X0,X1) | ~element(X2,powerset(X1)) | empty_set = X1, % 9.26/1.52 inference(predicate_reduction, [assumptions([a4, a5])], [c7, c8])). % 9.26/1.52 % 9.26/1.52 cnf(c10, axiom, % 9.26/1.52 element(sK14,the_carrier(sK12))). % 9.26/1.52 cnf(a6, assumption, % 9.26/1.52 X0 = sK14). % 9.26/1.52 cnf(a7, assumption, % 9.26/1.52 X1 = the_carrier(sK12)). % 9.26/1.52 cnf(c11, plain, % 9.26/1.52 ~element(X2,powerset(X1)) | empty_set = X1, % 9.26/1.52 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c10])). % 9.26/1.52 cnf(c12, plain, % 9.26/1.52 $false, % 9.26/1.52 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c10])). % 9.26/1.52 % 9.26/1.52 cnf(c13, axiom, % 9.26/1.52 element(sK13,powerset(the_carrier(sK12)))). % 9.26/1.52 cnf(a8, assumption, % 9.26/1.52 X2 = sK13). % 9.26/1.52 cnf(a9, assumption, % 9.26/1.52 powerset(X1) = powerset(the_carrier(sK12))). % 9.26/1.52 cnf(c14, plain, % 9.26/1.52 empty_set = X1, % 9.26/1.52 inference(strict_predicate_extension, [assumptions([a8, a9])], [c11, c13])). % 9.26/1.52 cnf(c15, plain, % 9.26/1.52 $false, % 9.26/1.52 inference(strict_predicate_extension, [assumptions([a8, a9])], [c11, c13])). % 9.26/1.52 % 9.26/1.52 cnf(c16, axiom, % 9.26/1.52 ~empty(the_carrier(X3)) | ~one_sorted_str(X3) | empty_carrier(X3)). % 9.26/1.52 cnf(a10, assumption, % 9.26/1.52 the_carrier(X3) = X1). % 9.26/1.52 cnf(a11, assumption, % 9.26/1.52 empty_set = X4). % 9.26/1.52 cnf(c17, plain, % 9.26/1.52 $false, % 9.26/1.52 inference(strict_subterm_extension, [assumptions([a10, a11])], [c14, c16])). % 9.26/1.52 cnf(c18, plain, % 9.26/1.52 ~one_sorted_str(X3) | empty_carrier(X3), % 9.26/1.52 inference(strict_subterm_extension, [assumptions([a10, a11])], [c14, c16])). % 9.26/1.52 cnf(c19, plain, % 9.26/1.52 ~empty(X4), % 9.26/1.52 inference(strict_subterm_extension, [assumptions([a10, a11])], [c14, c16])). % 9.26/1.52 % 9.26/1.52 cnf(c20, axiom, % 9.26/1.52 empty(empty_set)). % 9.26/1.52 cnf(a12, assumption, % 9.26/1.52 X4 = empty_set). % 9.26/1.52 cnf(c21, plain, % 9.26/1.52 $false, % 9.26/1.52 inference(strict_predicate_extension, [assumptions([a12])], [c19, c20])). % 9.26/1.52 cnf(c22, plain, % 9.26/1.52 $false, % 9.26/1.52 inference(strict_predicate_extension, [assumptions([a12])], [c19, c20])). % 9.26/1.52 % 9.26/1.52 cnf(c23, axiom, % 9.26/1.52 one_sorted_str(sK12)). % 9.26/1.52 cnf(a13, assumption, % 9.26/1.52 X3 = sK12). % 9.26/1.52 cnf(c24, plain, % 9.26/1.52 empty_carrier(X3), % 9.26/1.52 inference(strict_predicate_extension, [assumptions([a13])], [c18, c23])). % 9.26/1.52 cnf(c25, plain, % 9.26/1.52 $false, % 9.26/1.52 inference(strict_predicate_extension, [assumptions([a13])], [c18, c23])). % 9.26/1.52 % 9.26/1.52 cnf(c26, axiom, % 9.26/1.52 ~empty_carrier(sK12)). % 9.26/1.52 cnf(a14, assumption, % 9.26/1.52 X3 = sK12). % 9.26/1.52 cnf(c27, plain, % 9.26/1.52 $false, % 9.26/1.52 inference(strict_predicate_extension, [assumptions([a14])], [c24, c26])). % 9.26/1.52 cnf(c28, plain, % 9.26/1.52 $false, % 9.26/1.52 inference(strict_predicate_extension, [assumptions([a14])], [c24, c26])). % 9.26/1.52 % 9.26/1.52 cnf(c29, axiom, % 9.26/1.52 ~in(X5,X6) | ~in(X5,subset_complement(X7,X6)) | ~element(X6,powerset(X7))). % 9.26/1.52 cnf(a15, assumption, % 9.26/1.52 sK14 = X5). % 9.26/1.52 cnf(a16, assumption, % 9.26/1.52 subset_complement(the_carrier(sK12),sK13) = subset_complement(X7,X6)). % 9.26/1.52 cnf(c30, plain, % 9.26/1.52 $false, % 9.26/1.52 inference(strict_predicate_extension, [assumptions([a15, a16])], [c3, c29])). % 9.26/1.52 cnf(c31, plain, % 9.26/1.52 ~in(X5,X6) | ~element(X6,powerset(X7)), % 9.26/1.52 inference(strict_predicate_extension, [assumptions([a15, a16])], [c3, c29])). % 9.26/1.52 % 9.26/1.52 cnf(c32, plain, % 9.26/1.52 in(sK14,sK13)). % 9.26/1.52 cnf(a17, assumption, % 9.26/1.52 X5 = sK14). % 9.26/1.52 cnf(a18, assumption, % 9.26/1.52 X6 = sK13). % 9.26/1.52 cnf(c33, plain, % 9.26/1.52 ~element(X6,powerset(X7)), % 9.26/1.52 inference(predicate_reduction, [assumptions([a17, a18])], [c31, c32])). % 9.26/1.52 % 9.26/1.52 cnf(c34, plain, % 9.26/1.52 element(X2,powerset(X1))). % 9.26/1.52 cnf(a19, assumption, % 9.26/1.52 X6 = X2). % 9.26/1.52 cnf(a20, assumption, % 9.26/1.52 powerset(X7) = powerset(X1)). % 9.26/1.52 cnf(c35, plain, % 9.26/1.52 $false, % 9.26/1.52 inference(predicate_reduction, [assumptions([a19, a20])], [c33, c34])). % 9.26/1.52 % 9.26/1.52 cnf(c36, plain, % 9.26/1.52 $false, % 9.26/1.52 inference(constraint_solving, [ % 9.26/1.52 bind(X0, sK14), % 9.26/1.52 bind(X1, the_carrier(sK12)), % 9.26/1.52 bind(X2, sK13), % 9.26/1.52 bind(X3, sK12), % 9.26/1.52 bind(X4, empty_set), % 9.26/1.52 bind(X5, sK14), % 9.26/1.52 bind(X6, sK13), % 9.26/1.52 bind(X7, the_carrier(sK12)) % 9.26/1.52 ], % 9.26/1.52 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])). % 9.26/1.52 % 9.26/1.52 % SZS output end IncompleteProof %------------------------------------------------------------------------------