%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU120+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 : n011.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:14 EDT 2022 % Result : Theorem 0.12s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : SEU120+1 : TPTP v8.1.0. Released v3.3.0. % 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n011.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 : Sun Jun 19 23:34:39 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.35 % SZS status Theorem % 0.12/0.35 % SZS output begin IncompleteProof % 0.12/0.35 cnf(c0, axiom, % 0.12/0.35 disjoint(sK4,sK5) | sP0(sK5,sK4)). % 0.12/0.35 cnf(c1, plain, % 0.12/0.35 disjoint(sK4,sK5) | sP0(sK5,sK4), % 0.12/0.35 inference(start, [], [c0])). % 0.12/0.35 % 0.12/0.35 cnf(c2, axiom, % 0.12/0.35 set_intersection2(X0,X1) = empty_set | ~disjoint(X0,X1)). % 0.12/0.35 cnf(a0, assumption, % 0.12/0.35 sK4 = X0). % 0.12/0.35 cnf(a1, assumption, % 0.12/0.35 sK5 = X1). % 0.12/0.35 cnf(c3, plain, % 0.12/0.35 sP0(sK5,sK4), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.35 cnf(c4, plain, % 0.12/0.35 set_intersection2(X0,X1) = empty_set, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.35 % 0.12/0.35 cnf(c5, axiom, % 0.12/0.35 in(sK6,set_intersection2(sK4,sK5)) | sP0(sK5,sK4)). % 0.12/0.35 cnf(a2, assumption, % 0.12/0.35 set_intersection2(sK4,sK5) = set_intersection2(X0,X1)). % 0.12/0.35 cnf(a3, assumption, % 0.12/0.35 empty_set = X2). % 0.12/0.35 cnf(c6, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.35 cnf(c7, plain, % 0.12/0.35 sP0(sK5,sK4), % 0.12/0.35 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.35 cnf(c8, plain, % 0.12/0.35 in(sK6,X2), % 0.12/0.35 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.36 % 0.12/0.36 cnf(c9, axiom, % 0.12/0.36 ~in(X3,empty_set)). % 0.12/0.36 cnf(a4, assumption, % 0.12/0.36 sK6 = X3). % 0.12/0.36 cnf(a5, assumption, % 0.12/0.36 X2 = empty_set). % 0.12/0.36 cnf(c10, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c9])). % 0.12/0.36 cnf(c11, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c9])). % 0.12/0.36 % 0.12/0.36 cnf(c12, axiom, % 0.12/0.36 ~disjoint(X4,X5) | ~sP0(X5,X4)). % 0.12/0.36 cnf(a6, assumption, % 0.12/0.36 sK5 = X5). % 0.12/0.36 cnf(a7, assumption, % 0.12/0.36 sK4 = X4). % 0.12/0.36 cnf(c13, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c7, c12])). % 0.12/0.36 cnf(c14, plain, % 0.12/0.36 ~disjoint(X4,X5), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c7, c12])). % 0.12/0.36 % 0.12/0.36 cnf(c15, plain, % 0.12/0.36 disjoint(sK4,sK5)). % 0.12/0.36 cnf(a8, assumption, % 0.12/0.36 X4 = sK4). % 0.12/0.36 cnf(a9, assumption, % 0.12/0.36 X5 = sK5). % 0.12/0.36 cnf(c16, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(predicate_reduction, [assumptions([a8, a9])], [c14, c15])). % 0.12/0.36 % 0.12/0.36 cnf(c17, axiom, % 0.12/0.36 ~in(X6,set_intersection2(X7,X8)) | ~sP0(X8,X7)). % 0.12/0.36 cnf(a10, assumption, % 0.12/0.36 sK5 = X8). % 0.12/0.36 cnf(a11, assumption, % 0.12/0.36 sK4 = X7). % 0.12/0.36 cnf(c18, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a10, a11])], [c3, c17])). % 0.12/0.36 cnf(c19, plain, % 0.12/0.36 ~in(X6,set_intersection2(X7,X8)), % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a10, a11])], [c3, c17])). % 0.12/0.36 % 0.12/0.36 cnf(c20, axiom, % 0.12/0.36 empty_set = X9 | in(sK1(X9),X9)). % 0.12/0.36 cnf(a12, assumption, % 0.12/0.36 X6 = sK1(X9)). % 0.12/0.36 cnf(a13, assumption, % 0.12/0.36 set_intersection2(X7,X8) = X9). % 0.12/0.36 cnf(c21, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])). % 0.12/0.36 cnf(c22, plain, % 0.12/0.36 empty_set = X9, % 0.12/0.36 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])). % 0.12/0.36 % 0.12/0.36 cnf(c23, axiom, % 0.12/0.36 disjoint(X10,X11) | set_intersection2(X10,X11) != empty_set). % 0.12/0.36 cnf(a14, assumption, % 0.12/0.36 set_intersection2(X10,X11) = X9). % 0.12/0.36 cnf(a15, assumption, % 0.12/0.36 empty_set = X12). % 0.12/0.36 cnf(c24, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_subterm_extension, [assumptions([a14, a15])], [c22, c23])). % 0.12/0.36 cnf(c25, plain, % 0.12/0.36 disjoint(X10,X11), % 0.12/0.36 inference(strict_subterm_extension, [assumptions([a14, a15])], [c22, c23])). % 0.12/0.36 cnf(c26, plain, % 0.12/0.36 X12 != empty_set, % 0.12/0.36 inference(strict_subterm_extension, [assumptions([a14, a15])], [c22, c23])). % 0.12/0.36 % 0.12/0.36 cnf(a16, assumption, % 0.12/0.36 X12 = empty_set). % 0.12/0.36 cnf(c27, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(reflexivity, [assumptions([a16])], [c26])). % 0.12/0.36 % 0.12/0.36 cnf(c28, plain, % 0.12/0.36 ~disjoint(sK4,sK5)). % 0.12/0.36 cnf(a17, assumption, % 0.12/0.36 X10 = sK4). % 0.12/0.36 cnf(a18, assumption, % 0.12/0.36 X11 = sK5). % 0.12/0.36 cnf(c29, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(predicate_reduction, [assumptions([a17, a18])], [c25, c28])). % 0.12/0.36 % 0.12/0.36 cnf(c30, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(constraint_solving, [ % 0.12/0.36 bind(X0, sK4), % 0.12/0.36 bind(X1, sK5), % 0.12/0.36 bind(X2, empty_set), % 0.12/0.36 bind(X3, sK6), % 0.12/0.36 bind(X4, sK4), % 0.12/0.36 bind(X5, sK5), % 0.12/0.36 bind(X6, sK1(X9)), % 0.12/0.36 bind(X7, sK4), % 0.12/0.36 bind(X8, sK5), % 0.12/0.36 bind(X9, set_intersection2(X7,X8)), % 0.12/0.36 bind(X10, sK4), % 0.12/0.36 bind(X11, sK5), % 0.12/0.36 bind(X12, empty_set) % 0.12/0.36 ], % 0.12/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])). % 0.12/0.36 % 0.12/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------