%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU120+2 : 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:53:14 EDT 2022 % Result : Theorem 1.98s 0.60s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SEU120+2 : TPTP v8.1.0. Released v3.3.0. % 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n010.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sun Jun 19 13:19:37 EDT 2022 % 0.13/0.34 % CPUTime : % 1.98/0.60 % SZS status Theorem % 1.98/0.60 % SZS output begin IncompleteProof % 1.98/0.60 cnf(c0, axiom, % 1.98/0.60 disjoint(sK8,sK9) | sP2(sK9,sK8)). % 1.98/0.60 cnf(c1, plain, % 1.98/0.60 disjoint(sK8,sK9) | sP2(sK9,sK8), % 1.98/0.60 inference(start, [], [c0])). % 1.98/0.60 % 1.98/0.60 cnf(c2, axiom, % 1.98/0.60 set_intersection2(X0,X1) = empty_set | ~disjoint(X0,X1)). % 1.98/0.60 cnf(a0, assumption, % 1.98/0.60 sK8 = X0). % 1.98/0.60 cnf(a1, assumption, % 1.98/0.60 sK9 = X1). % 1.98/0.60 cnf(c3, plain, % 1.98/0.60 sP2(sK9,sK8), % 1.98/0.60 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 1.98/0.60 cnf(c4, plain, % 1.98/0.60 set_intersection2(X0,X1) = empty_set, % 1.98/0.60 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 1.98/0.60 % 1.98/0.60 cnf(c5, axiom, % 1.98/0.60 in(sK10,set_intersection2(sK8,sK9)) | sP2(sK9,sK8)). % 1.98/0.60 cnf(a2, assumption, % 1.98/0.60 set_intersection2(sK8,sK9) = set_intersection2(X0,X1)). % 1.98/0.60 cnf(a3, assumption, % 1.98/0.60 empty_set = X2). % 1.98/0.60 cnf(c6, plain, % 1.98/0.60 $false, % 1.98/0.60 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 1.98/0.60 cnf(c7, plain, % 1.98/0.60 sP2(sK9,sK8), % 1.98/0.60 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 1.98/0.60 cnf(c8, plain, % 1.98/0.60 in(sK10,X2), % 1.98/0.60 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 1.98/0.60 % 1.98/0.60 cnf(c9, axiom, % 1.98/0.60 ~in(X3,empty_set)). % 1.98/0.60 cnf(a4, assumption, % 1.98/0.60 sK10 = X3). % 1.98/0.60 cnf(a5, assumption, % 1.98/0.60 X2 = empty_set). % 1.98/0.60 cnf(c10, plain, % 1.98/0.60 $false, % 1.98/0.60 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c9])). % 1.98/0.60 cnf(c11, plain, % 1.98/0.60 $false, % 1.98/0.60 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c9])). % 1.98/0.60 % 1.98/0.60 cnf(c12, axiom, % 1.98/0.60 ~disjoint(X4,X5) | ~sP2(X5,X4)). % 1.98/0.60 cnf(a6, assumption, % 1.98/0.60 sK9 = X5). % 1.98/0.60 cnf(a7, assumption, % 1.98/0.60 sK8 = X4). % 1.98/0.60 cnf(c13, plain, % 1.98/0.60 $false, % 1.98/0.60 inference(strict_predicate_extension, [assumptions([a6, a7])], [c7, c12])). % 1.98/0.60 cnf(c14, plain, % 1.98/0.60 ~disjoint(X4,X5), % 1.98/0.60 inference(strict_predicate_extension, [assumptions([a6, a7])], [c7, c12])). % 1.98/0.60 % 1.98/0.60 cnf(c15, plain, % 1.98/0.60 disjoint(sK8,sK9)). % 1.98/0.60 cnf(a8, assumption, % 1.98/0.60 X4 = sK8). % 1.98/0.60 cnf(a9, assumption, % 1.98/0.60 X5 = sK9). % 1.98/0.60 cnf(c16, plain, % 1.98/0.60 $false, % 1.98/0.60 inference(predicate_reduction, [assumptions([a8, a9])], [c14, c15])). % 1.98/0.60 % 1.98/0.60 cnf(c17, axiom, % 1.98/0.60 ~in(X6,set_intersection2(X7,X8)) | ~sP2(X8,X7)). % 1.98/0.60 cnf(a10, assumption, % 1.98/0.60 sK9 = X8). % 1.98/0.60 cnf(a11, assumption, % 1.98/0.60 sK8 = X7). % 1.98/0.60 cnf(c18, plain, % 1.98/0.60 $false, % 1.98/0.60 inference(strict_predicate_extension, [assumptions([a10, a11])], [c3, c17])). % 1.98/0.60 cnf(c19, plain, % 1.98/0.60 ~in(X6,set_intersection2(X7,X8)), % 1.98/0.60 inference(strict_predicate_extension, [assumptions([a10, a11])], [c3, c17])). % 1.98/0.60 % 1.98/0.60 cnf(c20, axiom, % 1.98/0.60 empty_set = X9 | in(sK3(X9),X9)). % 1.98/0.60 cnf(a12, assumption, % 1.98/0.60 X6 = sK3(X9)). % 1.98/0.60 cnf(a13, assumption, % 1.98/0.60 set_intersection2(X7,X8) = X9). % 1.98/0.60 cnf(c21, plain, % 1.98/0.60 $false, % 1.98/0.60 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])). % 1.98/0.60 cnf(c22, plain, % 1.98/0.60 empty_set = X9, % 1.98/0.60 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])). % 1.98/0.60 % 1.98/0.60 cnf(c23, axiom, % 1.98/0.60 disjoint(X10,X11) | set_intersection2(X10,X11) != empty_set). % 1.98/0.60 cnf(a14, assumption, % 1.98/0.60 set_intersection2(X10,X11) = X9). % 1.98/0.60 cnf(a15, assumption, % 1.98/0.60 empty_set = X12). % 1.98/0.60 cnf(c24, plain, % 1.98/0.60 $false, % 1.98/0.60 inference(strict_subterm_extension, [assumptions([a14, a15])], [c22, c23])). % 1.98/0.60 cnf(c25, plain, % 1.98/0.60 disjoint(X10,X11), % 1.98/0.60 inference(strict_subterm_extension, [assumptions([a14, a15])], [c22, c23])). % 1.98/0.60 cnf(c26, plain, % 1.98/0.60 X12 != empty_set, % 1.98/0.60 inference(strict_subterm_extension, [assumptions([a14, a15])], [c22, c23])). % 1.98/0.60 % 1.98/0.60 cnf(a16, assumption, % 1.98/0.60 X12 = empty_set). % 1.98/0.60 cnf(c27, plain, % 1.98/0.60 $false, % 1.98/0.60 inference(reflexivity, [assumptions([a16])], [c26])). % 1.98/0.60 % 1.98/0.60 cnf(c28, plain, % 1.98/0.60 ~disjoint(sK8,sK9)). % 1.98/0.60 cnf(a17, assumption, % 1.98/0.60 X10 = sK8). % 1.98/0.60 cnf(a18, assumption, % 1.98/0.60 X11 = sK9). % 1.98/0.60 cnf(c29, plain, % 1.98/0.60 $false, % 1.98/0.60 inference(predicate_reduction, [assumptions([a17, a18])], [c25, c28])). % 1.98/0.60 % 1.98/0.60 cnf(c30, plain, % 1.98/0.60 $false, % 1.98/0.60 inference(constraint_solving, [ % 1.98/0.60 bind(X0, sK8), % 1.98/0.60 bind(X1, sK9), % 1.98/0.60 bind(X2, empty_set), % 1.98/0.60 bind(X3, sK10), % 1.98/0.60 bind(X4, sK8), % 1.98/0.60 bind(X5, sK9), % 1.98/0.60 bind(X6, sK3(X9)), % 1.98/0.60 bind(X7, sK8), % 1.98/0.60 bind(X8, sK9), % 1.98/0.60 bind(X9, set_intersection2(X7,X8)), % 1.98/0.60 bind(X10, sK8), % 1.98/0.60 bind(X11, sK9), % 1.98/0.60 bind(X12, empty_set) % 1.98/0.60 ], % 1.98/0.60 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])). % 1.98/0.60 % 1.98/0.60 % SZS output end IncompleteProof %------------------------------------------------------------------------------