%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU160+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 : n017.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:37 EDT 2022 % Result : Theorem 0.20s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SEU160+1 : TPTP v8.1.0. Released v3.3.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.35 % Computer : n017.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Mon Jun 20 02:50:29 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.40 % SZS status Theorem % 0.20/0.40 % SZS output begin IncompleteProof % 0.20/0.40 cnf(c0, axiom, % 0.20/0.40 sK2 = singleton(sK3) | empty_set = sK2 | subset(sK2,singleton(sK3))). % 0.20/0.40 cnf(c1, plain, % 0.20/0.40 sK2 = singleton(sK3) | empty_set = sK2 | subset(sK2,singleton(sK3)), % 0.20/0.40 inference(start, [], [c0])). % 0.20/0.40 % 0.20/0.40 cnf(c2, axiom, % 0.20/0.40 sK2 != singleton(sK3) | ~subset(sK2,singleton(sK3))). % 0.20/0.40 cnf(a0, assumption, % 0.20/0.40 singleton(sK3) = singleton(sK3)). % 0.20/0.40 cnf(a1, assumption, % 0.20/0.40 sK2 = X0). % 0.20/0.40 cnf(c3, plain, % 0.20/0.40 empty_set = sK2 | subset(sK2,singleton(sK3)), % 0.20/0.40 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.40 cnf(c4, plain, % 0.20/0.40 ~subset(sK2,singleton(sK3)), % 0.20/0.40 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.40 cnf(c5, plain, % 0.20/0.40 sK2 != X0, % 0.20/0.40 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.40 % 0.20/0.40 cnf(a2, assumption, % 0.20/0.40 sK2 = X0). % 0.20/0.40 cnf(c6, plain, % 0.20/0.40 $false, % 0.20/0.40 inference(reflexivity, [assumptions([a2])], [c5])). % 0.20/0.40 % 0.20/0.40 cnf(c7, plain, % 0.20/0.40 sK2 = singleton(sK3)). % 0.20/0.40 cnf(a3, assumption, % 0.20/0.40 singleton(sK3) = singleton(sK3)). % 0.20/0.40 cnf(a4, assumption, % 0.20/0.40 sK2 = X1). % 0.20/0.40 cnf(c8, plain, % 0.20/0.40 $false, % 0.20/0.40 inference(equality_reduction, [assumptions([a3, a4])], [c4, c7])). % 0.20/0.40 cnf(c9, plain, % 0.20/0.40 ~subset(sK2,X1), % 0.20/0.40 inference(equality_reduction, [assumptions([a3, a4])], [c4, c7])). % 0.20/0.40 % 0.20/0.40 cnf(c10, axiom, % 0.20/0.40 subset(X2,X2)). % 0.20/0.40 cnf(a5, assumption, % 0.20/0.40 sK2 = X2). % 0.20/0.40 cnf(a6, assumption, % 0.20/0.40 X1 = X2). % 0.20/0.40 cnf(c11, plain, % 0.20/0.40 $false, % 0.20/0.40 inference(strict_predicate_extension, [assumptions([a5, a6])], [c9, c10])). % 0.20/0.40 cnf(c12, plain, % 0.20/0.40 $false, % 0.20/0.40 inference(strict_predicate_extension, [assumptions([a5, a6])], [c9, c10])). % 0.20/0.40 % 0.20/0.40 cnf(c13, axiom, % 0.20/0.40 empty_set != sK2 | ~subset(sK2,singleton(sK3))). % 0.20/0.40 cnf(a7, assumption, % 0.20/0.40 sK2 = sK2). % 0.20/0.40 cnf(a8, assumption, % 0.20/0.40 empty_set = X3). % 0.20/0.40 cnf(c14, plain, % 0.20/0.40 subset(sK2,singleton(sK3)), % 0.20/0.40 inference(strict_subterm_extension, [assumptions([a7, a8])], [c3, c13])). % 0.20/0.40 cnf(c15, plain, % 0.20/0.40 empty_set != sK2, % 0.20/0.40 inference(strict_subterm_extension, [assumptions([a7, a8])], [c3, c13])). % 0.20/0.40 cnf(c16, plain, % 0.20/0.40 ~subset(X3,singleton(sK3)), % 0.20/0.40 inference(strict_subterm_extension, [assumptions([a7, a8])], [c3, c13])). % 0.20/0.40 % 0.20/0.40 cnf(c17, axiom, % 0.20/0.40 subset(empty_set,singleton(X4))). % 0.20/0.40 cnf(a9, assumption, % 0.20/0.40 X3 = empty_set). % 0.20/0.40 cnf(a10, assumption, % 0.20/0.40 singleton(sK3) = singleton(X4)). % 0.20/0.40 cnf(c18, plain, % 0.20/0.40 $false, % 0.20/0.40 inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c17])). % 0.20/0.40 cnf(c19, plain, % 0.20/0.40 $false, % 0.20/0.40 inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c17])). % 0.20/0.40 % 0.20/0.40 cnf(c20, plain, % 0.20/0.40 empty_set = sK2). % 0.20/0.40 cnf(a11, assumption, % 0.20/0.40 sK2 = sK2). % 0.20/0.40 cnf(a12, assumption, % 0.20/0.40 empty_set = X5). % 0.20/0.40 cnf(c21, plain, % 0.20/0.40 $false, % 0.20/0.40 inference(equality_reduction, [assumptions([a11, a12])], [c15, c20])). % 0.20/0.40 cnf(c22, plain, % 0.20/0.40 empty_set != X5, % 0.20/0.40 inference(equality_reduction, [assumptions([a11, a12])], [c15, c20])). % 0.20/0.40 % 0.20/0.40 cnf(a13, assumption, % 0.20/0.40 empty_set = X5). % 0.20/0.40 cnf(c23, plain, % 0.20/0.40 $false, % 0.20/0.40 inference(reflexivity, [assumptions([a13])], [c22])). % 0.20/0.40 % 0.20/0.40 cnf(c24, axiom, % 0.20/0.40 singleton(X6) = X7 | empty_set = X7 | ~subset(X7,singleton(X6))). % 0.20/0.40 cnf(a14, assumption, % 0.20/0.40 sK2 = X7). % 0.20/0.40 cnf(a15, assumption, % 0.20/0.40 singleton(sK3) = singleton(X6)). % 0.20/0.40 cnf(c25, plain, % 0.20/0.40 $false, % 0.20/0.40 inference(strict_predicate_extension, [assumptions([a14, a15])], [c14, c24])). % 0.20/0.40 cnf(c26, plain, % 0.20/0.40 singleton(X6) = X7 | empty_set = X7, % 0.20/0.40 inference(strict_predicate_extension, [assumptions([a14, a15])], [c14, c24])). % 0.20/0.40 % 0.20/0.40 cnf(c27, plain, % 0.20/0.40 sK2 != singleton(sK3)). % 0.20/0.40 cnf(a16, assumption, % 0.20/0.40 singleton(sK3) = singleton(X6)). % 0.20/0.40 cnf(c28, plain, % 0.20/0.40 empty_set = X7, % 0.20/0.40 inference(subterm_reduction, [assumptions([a16])], [c26, c27])). % 0.20/0.40 cnf(c29, plain, % 0.20/0.40 sK2 != X7, % 0.20/0.40 inference(subterm_reduction, [assumptions([a16])], [c26, c27])). % 0.20/0.40 % 0.20/0.40 cnf(a17, assumption, % 0.20/0.40 sK2 = X7). % 0.20/0.40 cnf(c30, plain, % 0.20/0.40 $false, % 0.20/0.40 inference(reflexivity, [assumptions([a17])], [c29])). % 0.20/0.40 % 0.20/0.40 cnf(c31, plain, % 0.20/0.40 empty_set != sK2). % 0.20/0.40 cnf(a18, assumption, % 0.20/0.40 sK2 = X7). % 0.20/0.40 cnf(a19, assumption, % 0.20/0.40 empty_set = X8). % 0.20/0.40 cnf(c32, plain, % 0.20/0.40 $false, % 0.20/0.40 inference(subterm_reduction, [assumptions([a18, a19])], [c28, c31])). % 0.20/0.40 cnf(c33, plain, % 0.20/0.40 empty_set != X8, % 0.20/0.40 inference(subterm_reduction, [assumptions([a18, a19])], [c28, c31])). % 0.20/0.40 % 0.20/0.40 cnf(a20, assumption, % 0.20/0.40 empty_set = X8). % 0.20/0.40 cnf(c34, plain, % 0.20/0.40 $false, % 0.20/0.40 inference(reflexivity, [assumptions([a20])], [c33])). % 0.20/0.40 % 0.20/0.40 cnf(c35, plain, % 0.20/0.40 $false, % 0.20/0.40 inference(constraint_solving, [ % 0.20/0.40 bind(X0, sK2), % 0.20/0.41 bind(X1, sK2), % 0.20/0.41 bind(X2, sK2), % 0.20/0.41 bind(X3, empty_set), % 0.20/0.41 bind(X4, sK3), % 0.20/0.41 bind(X5, empty_set), % 0.20/0.41 bind(X6, sK3), % 0.20/0.41 bind(X7, sK2), % 0.20/0.41 bind(X8, empty_set) % 0.20/0.41 ], % 0.20/0.41 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])). % 0.20/0.41 % 0.20/0.41 % SZS output end IncompleteProof %------------------------------------------------------------------------------