%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU146+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 : 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 11:53:28 EDT 2022 % Result : Theorem 259.72s 33.45s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : SEU146+1 : TPTP v8.1.0. Released v3.3.0. % 0.08/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.36 % Computer : n016.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Sat Jun 18 23:07:23 EDT 2022 % 0.14/0.36 % CPUTime : % 259.72/33.45 % SZS status Theorem % 259.72/33.45 % SZS output begin IncompleteProof % 259.72/33.45 cnf(c0, axiom, % 259.72/33.45 sK0 = singleton(sK1) | empty_set = sK0 | subset(sK0,singleton(sK1))). % 259.72/33.45 cnf(c1, plain, % 259.72/33.45 sK0 = singleton(sK1) | empty_set = sK0 | subset(sK0,singleton(sK1)), % 259.72/33.45 inference(start, [], [c0])). % 259.72/33.45 % 259.72/33.45 cnf(c2, axiom, % 259.72/33.45 sK0 != singleton(sK1) | ~subset(sK0,singleton(sK1))). % 259.72/33.45 cnf(a0, assumption, % 259.72/33.45 singleton(sK1) = singleton(sK1)). % 259.72/33.45 cnf(a1, assumption, % 259.72/33.45 sK0 = X0). % 259.72/33.45 cnf(c3, plain, % 259.72/33.45 empty_set = sK0 | subset(sK0,singleton(sK1)), % 259.72/33.45 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 259.72/33.45 cnf(c4, plain, % 259.72/33.45 sK0 != singleton(sK1), % 259.72/33.45 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 259.72/33.45 cnf(c5, plain, % 259.72/33.45 ~subset(sK0,X0), % 259.72/33.45 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 259.72/33.45 % 259.72/33.45 cnf(c6, axiom, % 259.72/33.45 subset(X1,X1)). % 259.72/33.45 cnf(a2, assumption, % 259.72/33.45 sK0 = X1). % 259.72/33.45 cnf(a3, assumption, % 259.72/33.45 X0 = X1). % 259.72/33.45 cnf(c7, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 259.72/33.45 cnf(c8, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 259.72/33.45 % 259.72/33.45 cnf(c9, plain, % 259.72/33.45 sK0 = singleton(sK1)). % 259.72/33.45 cnf(a4, assumption, % 259.72/33.45 singleton(sK1) = singleton(sK1)). % 259.72/33.45 cnf(a5, assumption, % 259.72/33.45 sK0 = X2). % 259.72/33.45 cnf(c10, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(equality_reduction, [assumptions([a4, a5])], [c4, c9])). % 259.72/33.45 cnf(c11, plain, % 259.72/33.45 sK0 != X2, % 259.72/33.45 inference(equality_reduction, [assumptions([a4, a5])], [c4, c9])). % 259.72/33.45 % 259.72/33.45 cnf(a6, assumption, % 259.72/33.45 sK0 = X2). % 259.72/33.45 cnf(c12, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(reflexivity, [assumptions([a6])], [c11])). % 259.72/33.45 % 259.72/33.45 cnf(c13, axiom, % 259.72/33.45 empty_set != sK0 | ~subset(sK0,singleton(sK1))). % 259.72/33.45 cnf(a7, assumption, % 259.72/33.45 sK0 = sK0). % 259.72/33.45 cnf(a8, assumption, % 259.72/33.45 empty_set = X3). % 259.72/33.45 cnf(c14, plain, % 259.72/33.45 subset(sK0,singleton(sK1)), % 259.72/33.45 inference(strict_subterm_extension, [assumptions([a7, a8])], [c3, c13])). % 259.72/33.45 cnf(c15, plain, % 259.72/33.45 empty_set != sK0, % 259.72/33.45 inference(strict_subterm_extension, [assumptions([a7, a8])], [c3, c13])). % 259.72/33.45 cnf(c16, plain, % 259.72/33.45 ~subset(X3,singleton(sK1)), % 259.72/33.45 inference(strict_subterm_extension, [assumptions([a7, a8])], [c3, c13])). % 259.72/33.45 % 259.72/33.45 cnf(c17, axiom, % 259.72/33.45 subset(empty_set,X4)). % 259.72/33.45 cnf(a9, assumption, % 259.72/33.45 X3 = empty_set). % 259.72/33.45 cnf(a10, assumption, % 259.72/33.45 singleton(sK1) = X4). % 259.72/33.45 cnf(c18, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c17])). % 259.72/33.45 cnf(c19, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c17])). % 259.72/33.45 % 259.72/33.45 cnf(c20, plain, % 259.72/33.45 empty_set = sK0). % 259.72/33.45 cnf(a11, assumption, % 259.72/33.45 sK0 = sK0). % 259.72/33.45 cnf(a12, assumption, % 259.72/33.45 empty_set = X5). % 259.72/33.45 cnf(c21, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(equality_reduction, [assumptions([a11, a12])], [c15, c20])). % 259.72/33.45 cnf(c22, plain, % 259.72/33.45 empty_set != X5, % 259.72/33.45 inference(equality_reduction, [assumptions([a11, a12])], [c15, c20])). % 259.72/33.45 % 259.72/33.45 cnf(a13, assumption, % 259.72/33.45 empty_set = X5). % 259.72/33.45 cnf(c23, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(reflexivity, [assumptions([a13])], [c22])). % 259.72/33.45 % 259.72/33.45 cnf(c24, axiom, % 259.72/33.45 empty_set = set_difference(X6,X7) | ~subset(X6,X7)). % 259.72/33.45 cnf(a14, assumption, % 259.72/33.45 sK0 = X6). % 259.72/33.45 cnf(a15, assumption, % 259.72/33.45 singleton(sK1) = X7). % 259.72/33.45 cnf(c25, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(strict_predicate_extension, [assumptions([a14, a15])], [c14, c24])). % 259.72/33.45 cnf(c26, plain, % 259.72/33.45 empty_set = set_difference(X6,X7), % 259.72/33.45 inference(strict_predicate_extension, [assumptions([a14, a15])], [c14, c24])). % 259.72/33.45 % 259.72/33.45 cnf(c27, axiom, % 259.72/33.45 subset(X8,set_difference(X9,singleton(X10))) | in(X10,X8) | ~subset(X8,X9)). % 259.72/33.45 cnf(a16, assumption, % 259.72/33.45 set_difference(X9,singleton(X10)) = set_difference(X6,X7)). % 259.72/33.45 cnf(a17, assumption, % 259.72/33.45 empty_set = X11). % 259.72/33.45 cnf(c28, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(strict_subterm_extension, [assumptions([a16, a17])], [c26, c27])). % 259.72/33.45 cnf(c29, plain, % 259.72/33.45 in(X10,X8) | ~subset(X8,X9), % 259.72/33.45 inference(strict_subterm_extension, [assumptions([a16, a17])], [c26, c27])). % 259.72/33.45 cnf(c30, plain, % 259.72/33.45 subset(X8,X11), % 259.72/33.45 inference(strict_subterm_extension, [assumptions([a16, a17])], [c26, c27])). % 259.72/33.45 % 259.72/33.45 cnf(c31, axiom, % 259.72/33.45 empty_set = X12 | ~subset(X12,empty_set)). % 259.72/33.45 cnf(a18, assumption, % 259.72/33.45 X8 = X12). % 259.72/33.45 cnf(a19, assumption, % 259.72/33.45 X11 = empty_set). % 259.72/33.45 cnf(c32, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(strict_predicate_extension, [assumptions([a18, a19])], [c30, c31])). % 259.72/33.45 cnf(c33, plain, % 259.72/33.45 empty_set = X12, % 259.72/33.45 inference(strict_predicate_extension, [assumptions([a18, a19])], [c30, c31])). % 259.72/33.45 % 259.72/33.45 cnf(c34, plain, % 259.72/33.45 empty_set != sK0). % 259.72/33.45 cnf(a20, assumption, % 259.72/33.45 sK0 = X12). % 259.72/33.45 cnf(a21, assumption, % 259.72/33.45 empty_set = X13). % 259.72/33.45 cnf(c35, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(subterm_reduction, [assumptions([a20, a21])], [c33, c34])). % 259.72/33.45 cnf(c36, plain, % 259.72/33.45 empty_set != X13, % 259.72/33.45 inference(subterm_reduction, [assumptions([a20, a21])], [c33, c34])). % 259.72/33.45 % 259.72/33.45 cnf(a22, assumption, % 259.72/33.45 empty_set = X13). % 259.72/33.45 cnf(c37, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(reflexivity, [assumptions([a22])], [c36])). % 259.72/33.45 % 259.72/33.45 cnf(c38, axiom, % 259.72/33.45 subset(singleton(X14),X15) | ~in(X14,X15)). % 259.72/33.45 cnf(a23, assumption, % 259.72/33.45 X10 = X14). % 259.72/33.45 cnf(a24, assumption, % 259.72/33.45 X8 = X15). % 259.72/33.45 cnf(c39, plain, % 259.72/33.45 ~subset(X8,X9), % 259.72/33.45 inference(strict_predicate_extension, [assumptions([a23, a24])], [c29, c38])). % 259.72/33.45 cnf(c40, plain, % 259.72/33.45 subset(singleton(X14),X15), % 259.72/33.45 inference(strict_predicate_extension, [assumptions([a23, a24])], [c29, c38])). % 259.72/33.45 % 259.72/33.45 cnf(c41, axiom, % 259.72/33.45 X16 = X17 | ~subset(X17,X16) | ~subset(X16,X17)). % 259.72/33.45 cnf(a25, assumption, % 259.72/33.45 singleton(X14) = X16). % 259.72/33.45 cnf(a26, assumption, % 259.72/33.45 X15 = X17). % 259.72/33.45 cnf(c42, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(strict_predicate_extension, [assumptions([a25, a26])], [c40, c41])). % 259.72/33.45 cnf(c43, plain, % 259.72/33.45 X16 = X17 | ~subset(X17,X16), % 259.72/33.45 inference(strict_predicate_extension, [assumptions([a25, a26])], [c40, c41])). % 259.72/33.45 % 259.72/33.45 cnf(c44, plain, % 259.72/33.45 sK0 != singleton(sK1)). % 259.72/33.45 cnf(a27, assumption, % 259.72/33.45 singleton(sK1) = X16). % 259.72/33.45 cnf(c45, plain, % 259.72/33.45 ~subset(X17,X16), % 259.72/33.45 inference(subterm_reduction, [assumptions([a27])], [c43, c44])). % 259.72/33.45 cnf(c46, plain, % 259.72/33.45 sK0 != X17, % 259.72/33.45 inference(subterm_reduction, [assumptions([a27])], [c43, c44])). % 259.72/33.45 % 259.72/33.45 cnf(a28, assumption, % 259.72/33.45 sK0 = X17). % 259.72/33.45 cnf(c47, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(reflexivity, [assumptions([a28])], [c46])). % 259.72/33.45 % 259.72/33.45 cnf(c48, plain, % 259.72/33.45 subset(sK0,singleton(sK1))). % 259.72/33.45 cnf(a29, assumption, % 259.72/33.45 X17 = sK0). % 259.72/33.45 cnf(a30, assumption, % 259.72/33.45 X16 = singleton(sK1)). % 259.72/33.45 cnf(c49, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(predicate_reduction, [assumptions([a29, a30])], [c45, c48])). % 259.72/33.45 % 259.72/33.45 cnf(c50, plain, % 259.72/33.45 subset(sK0,X0)). % 259.72/33.45 cnf(a31, assumption, % 259.72/33.45 X8 = sK0). % 259.72/33.45 cnf(a32, assumption, % 259.72/33.45 X9 = X0). % 259.72/33.45 cnf(c51, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(predicate_reduction, [assumptions([a31, a32])], [c39, c50])). % 259.72/33.45 % 259.72/33.45 cnf(c52, plain, % 259.72/33.45 $false, % 259.72/33.45 inference(constraint_solving, [ % 259.72/33.45 bind(X0, sK0), % 259.72/33.45 bind(X1, sK0), % 259.72/33.45 bind(X2, sK0), % 259.72/33.45 bind(X3, empty_set), % 259.72/33.45 bind(X4, singleton(sK1)), % 259.72/33.45 bind(X5, empty_set), % 259.72/33.45 bind(X6, sK0), % 259.72/33.45 bind(X7, singleton(sK1)), % 259.72/33.45 bind(X8, sK0), % 259.72/33.45 bind(X9, sK0), % 259.72/33.45 bind(X10, sK1), % 259.72/33.45 bind(X11, empty_set), % 259.72/33.45 bind(X12, sK0), % 259.72/33.45 bind(X13, empty_set), % 259.72/33.45 bind(X14, sK1), % 259.72/33.45 bind(X15, sK0), % 259.72/33.45 bind(X16, singleton(X14)), % 259.72/33.45 bind(X17, sK0) % 259.72/33.45 ], % 259.72/33.45 [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, a28, a29, a30, a31, a32])). % 259.72/33.45 % 259.72/33.45 % SZS output end IncompleteProof %------------------------------------------------------------------------------