%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET630+3 : TPTP v8.1.0. Released v2.2.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n028.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 02:47:15 EDT 2022 % Result : Theorem 13.60s 2.07s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET630+3 : TPTP v8.1.0. Released v2.2.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n028.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 Jul 10 19:10:27 EDT 2022 % 0.12/0.34 % CPUTime : % 13.60/2.07 % SZS status Theorem % 13.60/2.07 % SZS output begin IncompleteProof % 13.60/2.07 cnf(c0, axiom, % 13.60/2.07 ~disjoint(intersection(sK3,sK4),union(difference(sK3,sK4),difference(sK4,sK3)))). % 13.60/2.07 cnf(c1, plain, % 13.60/2.07 ~disjoint(intersection(sK3,sK4),union(difference(sK3,sK4),difference(sK4,sK3))), % 13.60/2.07 inference(start, [], [c0])). % 13.60/2.07 % 13.60/2.07 cnf(c2, axiom, % 13.60/2.07 disjoint(X0,X1) | intersect(X0,X1)). % 13.60/2.07 cnf(a0, assumption, % 13.60/2.07 intersection(sK3,sK4) = X0). % 13.60/2.07 cnf(a1, assumption, % 13.60/2.07 union(difference(sK3,sK4),difference(sK4,sK3)) = X1). % 13.60/2.07 cnf(c3, plain, % 13.60/2.07 $false, % 13.60/2.07 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 13.60/2.07 cnf(c4, plain, % 13.60/2.07 intersect(X0,X1), % 13.60/2.07 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 13.60/2.07 % 13.60/2.07 cnf(c5, axiom, % 13.60/2.07 intersect(X2,X3) | intersect(X2,X4) | ~intersect(X2,union(X4,X3))). % 13.60/2.07 cnf(a2, assumption, % 13.60/2.07 X0 = X2). % 13.60/2.07 cnf(a3, assumption, % 13.60/2.07 X1 = union(X4,X3)). % 13.60/2.07 cnf(c6, plain, % 13.60/2.07 $false, % 13.60/2.07 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 13.60/2.07 cnf(c7, plain, % 13.60/2.07 intersect(X2,X3) | intersect(X2,X4), % 13.60/2.07 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 13.60/2.07 % 13.60/2.07 cnf(c8, axiom, % 13.60/2.07 ~intersect(X5,X6) | ~disjoint(X5,X6)). % 13.60/2.07 cnf(a4, assumption, % 13.60/2.07 X2 = X5). % 13.60/2.07 cnf(a5, assumption, % 13.60/2.07 X3 = X6). % 13.60/2.07 cnf(c9, plain, % 13.60/2.07 intersect(X2,X4), % 13.60/2.07 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 13.60/2.07 cnf(c10, plain, % 13.60/2.07 ~disjoint(X5,X6), % 13.60/2.07 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 13.60/2.07 % 13.60/2.07 cnf(c11, axiom, % 13.60/2.07 disjoint(intersection(X7,X8),difference(X7,X8))). % 13.60/2.07 cnf(a6, assumption, % 13.60/2.07 X9 = X5). % 13.60/2.07 cnf(a7, assumption, % 13.60/2.07 X10 = X6). % 13.60/2.07 cnf(c12, plain, % 13.60/2.07 $false, % 13.60/2.07 inference(lazy_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 13.60/2.07 cnf(c13, plain, % 13.60/2.07 $false, % 13.60/2.07 inference(lazy_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 13.60/2.07 cnf(c14, plain, % 13.60/2.07 intersection(X7,X8) != X9 | difference(X7,X8) != X10, % 13.60/2.07 inference(lazy_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 13.60/2.07 % 13.60/2.07 cnf(c15, axiom, % 13.60/2.07 intersection(X11,X12) = intersection(X12,X11)). % 13.60/2.07 cnf(a8, assumption, % 13.60/2.07 intersection(X7,X8) = intersection(X12,X11)). % 13.60/2.07 cnf(c16, plain, % 13.60/2.07 difference(X7,X8) != X10, % 13.60/2.07 inference(strict_function_extension, [assumptions([a8])], [c14, c15])). % 13.60/2.07 cnf(c17, plain, % 13.60/2.07 $false, % 13.60/2.07 inference(strict_function_extension, [assumptions([a8])], [c14, c15])). % 13.60/2.07 cnf(c18, plain, % 13.60/2.07 X13 != intersection(X11,X12) | X13 != X9, % 13.60/2.07 inference(strict_function_extension, [assumptions([a8])], [c14, c15])). % 13.60/2.07 % 13.60/2.07 cnf(a9, assumption, % 13.60/2.07 X13 = intersection(X11,X12)). % 13.60/2.07 cnf(c19, plain, % 13.60/2.07 X13 != X9, % 13.60/2.07 inference(reflexivity, [assumptions([a9])], [c18])). % 13.60/2.07 % 13.60/2.07 cnf(a10, assumption, % 13.60/2.07 X13 = X9). % 13.60/2.07 cnf(c20, plain, % 13.60/2.07 $false, % 13.60/2.07 inference(reflexivity, [assumptions([a10])], [c19])). % 13.60/2.07 % 13.60/2.07 cnf(a11, assumption, % 13.60/2.07 difference(X7,X8) = X10). % 13.60/2.07 cnf(c21, plain, % 13.60/2.07 $false, % 13.60/2.07 inference(reflexivity, [assumptions([a11])], [c16])). % 13.60/2.07 % 13.60/2.07 cnf(c22, axiom, % 13.60/2.07 ~intersect(X14,X15) | ~disjoint(X14,X15)). % 13.60/2.07 cnf(a12, assumption, % 13.60/2.07 X2 = X14). % 13.60/2.07 cnf(a13, assumption, % 13.60/2.07 X4 = X15). % 13.60/2.07 cnf(c23, plain, % 13.60/2.07 $false, % 13.60/2.07 inference(strict_predicate_extension, [assumptions([a12, a13])], [c9, c22])). % 13.60/2.07 cnf(c24, plain, % 13.60/2.07 ~disjoint(X14,X15), % 13.60/2.07 inference(strict_predicate_extension, [assumptions([a12, a13])], [c9, c22])). % 13.60/2.07 % 13.60/2.07 cnf(c25, axiom, % 13.60/2.07 disjoint(intersection(X16,X17),difference(X16,X17))). % 13.60/2.07 cnf(a14, assumption, % 13.60/2.07 X14 = intersection(X16,X17)). % 13.60/2.07 cnf(a15, assumption, % 13.60/2.07 X15 = difference(X16,X17)). % 13.60/2.07 cnf(c26, plain, % 13.60/2.07 $false, % 13.60/2.07 inference(strict_predicate_extension, [assumptions([a14, a15])], [c24, c25])). % 13.60/2.07 cnf(c27, plain, % 13.60/2.07 $false, % 13.60/2.07 inference(strict_predicate_extension, [assumptions([a14, a15])], [c24, c25])). % 13.60/2.07 % 13.60/2.07 cnf(c28, plain, % 13.60/2.07 $false, % 13.60/2.07 inference(constraint_solving, [ % 13.60/2.07 bind(X0, intersection(sK3,sK4)), % 13.60/2.07 bind(X1, union(difference(sK3,sK4),difference(sK4,sK3))), % 13.60/2.07 bind(X2, intersection(sK3,sK4)), % 13.60/2.07 bind(X3, difference(sK4,sK3)), % 13.60/2.07 bind(X4, difference(sK3,sK4)), % 13.60/2.07 bind(X5, intersection(sK3,sK4)), % 13.60/2.07 bind(X6, difference(sK4,sK3)), % 13.60/2.07 bind(X7, sK4), % 13.60/2.07 bind(X8, sK3), % 13.60/2.07 bind(X9, intersection(sK3,sK4)), % 13.60/2.07 bind(X10, difference(sK4,sK3)), % 13.60/2.07 bind(X11, sK3), % 13.60/2.07 bind(X12, sK4), % 13.60/2.07 bind(X13, intersection(X11,X12)), % 13.60/2.07 bind(X14, intersection(sK3,sK4)), % 13.60/2.07 bind(X15, difference(sK3,sK4)), % 13.60/2.07 bind(X16, sK3), % 13.60/2.07 bind(X17, sK4) % 13.60/2.07 ], % 13.60/2.07 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 13.60/2.07 % 13.60/2.07 % SZS output end IncompleteProof %------------------------------------------------------------------------------