%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU361+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 : n021.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:21 EDT 2022 % Result : Theorem 22.66s 3.28s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SEU361+1 : TPTP v8.1.0. Released v3.3.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.11/0.33 % Computer : n021.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 600 % 0.11/0.33 % DateTime : Sun Jun 19 22:40:03 EDT 2022 % 0.11/0.33 % CPUTime : % 22.66/3.28 % SZS status Theorem % 22.66/3.28 % SZS output begin IncompleteProof % 22.66/3.28 cnf(c0, axiom, % 22.66/3.28 rel_str(sK11)). % 22.66/3.28 cnf(c1, plain, % 22.66/3.28 rel_str(sK11), % 22.66/3.28 inference(start, [], [c0])). % 22.66/3.28 % 22.66/3.28 cnf(c2, axiom, % 22.66/3.28 bottom_of_relstr(X0) = join_on_relstr(X0,empty_set) | ~rel_str(X0)). % 22.66/3.28 cnf(a0, assumption, % 22.66/3.28 sK11 = X0). % 22.66/3.28 cnf(c3, plain, % 22.66/3.28 $false, % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 22.66/3.28 cnf(c4, plain, % 22.66/3.28 bottom_of_relstr(X0) = join_on_relstr(X0,empty_set), % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 22.66/3.28 % 22.66/3.28 cnf(c5, axiom, % 22.66/3.28 related(X1,join_on_relstr(X1,X2),X3) | ~relstr_set_smaller(X1,X2,X3) | ~element(X3,the_carrier(X1)) | ~ex_sup_of_relstr_set(X1,X2) | ~sP1(join_on_relstr(X1,X2),X1,X2)). % 22.66/3.28 cnf(a1, assumption, % 22.66/3.28 join_on_relstr(X1,X2) = join_on_relstr(X0,empty_set)). % 22.66/3.28 cnf(a2, assumption, % 22.66/3.28 bottom_of_relstr(X0) = X4). % 22.66/3.28 cnf(c6, plain, % 22.66/3.28 $false, % 22.66/3.28 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])). % 22.66/3.28 cnf(c7, plain, % 22.66/3.28 ~relstr_set_smaller(X1,X2,X3) | ~element(X3,the_carrier(X1)) | ~ex_sup_of_relstr_set(X1,X2) | ~sP1(join_on_relstr(X1,X2),X1,X2), % 22.66/3.28 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])). % 22.66/3.28 cnf(c8, plain, % 22.66/3.28 related(X1,X4,X3), % 22.66/3.28 inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])). % 22.66/3.28 % 22.66/3.28 cnf(c9, axiom, % 22.66/3.28 ~related(sK11,bottom_of_relstr(sK11),sK12)). % 22.66/3.28 cnf(a3, assumption, % 22.66/3.28 X1 = sK11). % 22.66/3.28 cnf(a4, assumption, % 22.66/3.28 X4 = bottom_of_relstr(sK11)). % 22.66/3.28 cnf(a5, assumption, % 22.66/3.28 X3 = sK12). % 22.66/3.28 cnf(c10, plain, % 22.66/3.28 $false, % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c8, c9])). % 22.66/3.28 cnf(c11, plain, % 22.66/3.28 $false, % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c8, c9])). % 22.66/3.28 % 22.66/3.28 cnf(c12, axiom, % 22.66/3.28 relstr_set_smaller(X5,empty_set,X6) | ~element(X6,the_carrier(X5)) | ~rel_str(X5)). % 22.66/3.28 cnf(a6, assumption, % 22.66/3.28 X1 = X5). % 22.66/3.28 cnf(a7, assumption, % 22.66/3.28 X2 = empty_set). % 22.66/3.28 cnf(a8, assumption, % 22.66/3.28 X3 = X6). % 22.66/3.28 cnf(c13, plain, % 22.66/3.28 ~element(X3,the_carrier(X1)) | ~ex_sup_of_relstr_set(X1,X2) | ~sP1(join_on_relstr(X1,X2),X1,X2), % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c7, c12])). % 22.66/3.28 cnf(c14, plain, % 22.66/3.28 ~element(X6,the_carrier(X5)) | ~rel_str(X5), % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c7, c12])). % 22.66/3.28 % 22.66/3.28 cnf(c15, axiom, % 22.66/3.28 element(sK12,the_carrier(sK11))). % 22.66/3.28 cnf(a9, assumption, % 22.66/3.28 X6 = sK12). % 22.66/3.28 cnf(a10, assumption, % 22.66/3.28 the_carrier(X5) = the_carrier(sK11)). % 22.66/3.28 cnf(c16, plain, % 22.66/3.28 ~rel_str(X5), % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c15])). % 22.66/3.28 cnf(c17, plain, % 22.66/3.28 $false, % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c15])). % 22.66/3.28 % 22.66/3.28 cnf(c18, plain, % 22.66/3.28 rel_str(sK11)). % 22.66/3.28 cnf(a11, assumption, % 22.66/3.28 X5 = sK11). % 22.66/3.28 cnf(c19, plain, % 22.66/3.28 $false, % 22.66/3.28 inference(predicate_reduction, [assumptions([a11])], [c16, c18])). % 22.66/3.28 % 22.66/3.28 cnf(c20, plain, % 22.66/3.28 element(X6,the_carrier(X5))). % 22.66/3.28 cnf(a12, assumption, % 22.66/3.28 X3 = X6). % 22.66/3.28 cnf(a13, assumption, % 22.66/3.28 the_carrier(X1) = the_carrier(X5)). % 22.66/3.28 cnf(c21, plain, % 22.66/3.28 ~ex_sup_of_relstr_set(X1,X2) | ~sP1(join_on_relstr(X1,X2),X1,X2), % 22.66/3.28 inference(predicate_reduction, [assumptions([a12, a13])], [c13, c20])). % 22.66/3.28 % 22.66/3.28 cnf(c22, axiom, % 22.66/3.28 ex_sup_of_relstr_set(X7,empty_set) | ~rel_str(X7) | ~lower_bounded_relstr(X7) | ~antisymmetric_relstr(X7) | empty_carrier(X7)). % 22.66/3.28 cnf(a14, assumption, % 22.66/3.28 X1 = X7). % 22.66/3.28 cnf(a15, assumption, % 22.66/3.28 X2 = empty_set). % 22.66/3.28 cnf(c23, plain, % 22.66/3.28 ~sP1(join_on_relstr(X1,X2),X1,X2), % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c22])). % 22.66/3.28 cnf(c24, plain, % 22.66/3.28 ~rel_str(X7) | ~lower_bounded_relstr(X7) | ~antisymmetric_relstr(X7) | empty_carrier(X7), % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c22])). % 22.66/3.28 % 22.66/3.28 cnf(c25, plain, % 22.66/3.28 rel_str(sK11)). % 22.66/3.28 cnf(a16, assumption, % 22.66/3.28 X7 = sK11). % 22.66/3.28 cnf(c26, plain, % 22.66/3.28 ~lower_bounded_relstr(X7) | ~antisymmetric_relstr(X7) | empty_carrier(X7), % 22.66/3.28 inference(predicate_reduction, [assumptions([a16])], [c24, c25])). % 22.66/3.28 % 22.66/3.28 cnf(c27, axiom, % 22.66/3.28 lower_bounded_relstr(sK11)). % 22.66/3.28 cnf(a17, assumption, % 22.66/3.28 X7 = sK11). % 22.66/3.28 cnf(c28, plain, % 22.66/3.28 ~antisymmetric_relstr(X7) | empty_carrier(X7), % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a17])], [c26, c27])). % 22.66/3.28 cnf(c29, plain, % 22.66/3.28 $false, % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a17])], [c26, c27])). % 22.66/3.28 % 22.66/3.28 cnf(c30, axiom, % 22.66/3.28 antisymmetric_relstr(sK11)). % 22.66/3.28 cnf(a18, assumption, % 22.66/3.28 X7 = sK11). % 22.66/3.28 cnf(c31, plain, % 22.66/3.28 empty_carrier(X7), % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a18])], [c28, c30])). % 22.66/3.28 cnf(c32, plain, % 22.66/3.28 $false, % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a18])], [c28, c30])). % 22.66/3.28 % 22.66/3.28 cnf(c33, axiom, % 22.66/3.28 ~empty_carrier(sK11)). % 22.66/3.28 cnf(a19, assumption, % 22.66/3.28 X7 = sK11). % 22.66/3.28 cnf(c34, plain, % 22.66/3.28 $false, % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a19])], [c31, c33])). % 22.66/3.28 cnf(c35, plain, % 22.66/3.28 $false, % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a19])], [c31, c33])). % 22.66/3.28 % 22.66/3.28 cnf(c36, axiom, % 22.66/3.28 sP1(X8,X9,X10) | ~element(X8,the_carrier(X9)) | ~rel_str(X9) | ~antisymmetric_relstr(X9)). % 22.66/3.28 cnf(a20, assumption, % 22.66/3.28 join_on_relstr(X1,X2) = X8). % 22.66/3.28 cnf(a21, assumption, % 22.66/3.28 X1 = X9). % 22.66/3.28 cnf(a22, assumption, % 22.66/3.28 X2 = X10). % 22.66/3.28 cnf(c37, plain, % 22.66/3.28 $false, % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a20, a21, a22])], [c23, c36])). % 22.66/3.28 cnf(c38, plain, % 22.66/3.28 ~element(X8,the_carrier(X9)) | ~rel_str(X9) | ~antisymmetric_relstr(X9), % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a20, a21, a22])], [c23, c36])). % 22.66/3.28 % 22.66/3.28 cnf(c39, axiom, % 22.66/3.28 element(join_on_relstr(X11,X12),the_carrier(X11)) | ~rel_str(X11)). % 22.66/3.28 cnf(a23, assumption, % 22.66/3.28 X8 = join_on_relstr(X11,X12)). % 22.66/3.28 cnf(a24, assumption, % 22.66/3.28 the_carrier(X9) = the_carrier(X11)). % 22.66/3.28 cnf(c40, plain, % 22.66/3.28 ~rel_str(X9) | ~antisymmetric_relstr(X9), % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a23, a24])], [c38, c39])). % 22.66/3.28 cnf(c41, plain, % 22.66/3.28 ~rel_str(X11), % 22.66/3.28 inference(strict_predicate_extension, [assumptions([a23, a24])], [c38, c39])). % 22.66/3.28 % 22.66/3.28 cnf(c42, plain, % 22.66/3.28 rel_str(sK11)). % 22.66/3.28 cnf(a25, assumption, % 22.66/3.28 X11 = sK11). % 22.66/3.28 cnf(c43, plain, % 22.66/3.28 $false, % 22.66/3.28 inference(predicate_reduction, [assumptions([a25])], [c41, c42])). % 22.66/3.28 % 22.66/3.28 cnf(c44, plain, % 22.66/3.28 rel_str(sK11)). % 22.66/3.28 cnf(a26, assumption, % 22.66/3.28 X9 = sK11). % 22.66/3.28 cnf(c45, plain, % 22.66/3.28 ~antisymmetric_relstr(X9), % 22.66/3.28 inference(predicate_reduction, [assumptions([a26])], [c40, c44])). % 22.66/3.28 % 22.66/3.28 cnf(c46, plain, % 22.66/3.28 antisymmetric_relstr(X7)). % 22.66/3.28 cnf(a27, assumption, % 22.66/3.28 X9 = X7). % 22.66/3.28 cnf(c47, plain, % 22.66/3.28 $false, % 22.66/3.28 inference(predicate_reduction, [assumptions([a27])], [c45, c46])). % 22.66/3.28 % 22.66/3.28 cnf(c48, plain, % 22.66/3.28 $false, % 22.66/3.28 inference(constraint_solving, [ % 22.66/3.28 bind(X0, sK11), % 22.66/3.28 bind(X1, sK11), % 22.66/3.28 bind(X2, empty_set), % 22.66/3.28 bind(X3, sK12), % 22.66/3.28 bind(X4, bottom_of_relstr(X0)), % 22.66/3.28 bind(X5, sK11), % 22.66/3.28 bind(X6, sK12), % 22.66/3.28 bind(X7, sK11), % 22.66/3.28 bind(X8, join_on_relstr(X1,X2)), % 22.66/3.28 bind(X9, sK11), % 22.66/3.28 bind(X10, empty_set), % 22.66/3.28 bind(X11, sK11), % 22.66/3.28 bind(X12, empty_set) % 22.66/3.28 ], % 22.66/3.28 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27])). % 22.66/3.28 % 22.66/3.28 % SZS output end IncompleteProof %------------------------------------------------------------------------------