%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET620+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 : n026.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:08 EDT 2022 % Result : Theorem 209.54s 27.00s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.06 % Problem : SET620+3 : TPTP v8.1.0. Released v2.2.0. % 0.00/0.07 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.06/0.25 % Computer : n026.cluster.edu % 0.06/0.25 % Model : x86_64 x86_64 % 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.06/0.25 % Memory : 8042.1875MB % 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64 % 0.06/0.25 % CPULimit : 300 % 0.06/0.25 % WCLimit : 600 % 0.06/0.25 % DateTime : Mon Jul 11 06:04:11 EDT 2022 % 0.06/0.25 % CPUTime : % 209.54/27.00 % SZS status Theorem % 209.54/27.00 % SZS output begin IncompleteProof % 209.54/27.00 cnf(c0, axiom, % 209.54/27.00 difference(union(sK3,sK4),intersection(sK3,sK4)) != union(difference(sK3,sK4),difference(sK4,sK3))). % 209.54/27.00 cnf(c1, plain, % 209.54/27.00 difference(union(sK3,sK4),intersection(sK3,sK4)) != union(difference(sK3,sK4),difference(sK4,sK3)), % 209.54/27.00 inference(start, [], [c0])). % 209.54/27.00 % 209.54/27.00 cnf(c2, axiom, % 209.54/27.00 difference(union(X0,X1),X2) = union(difference(X0,X2),difference(X1,X2))). % 209.54/27.00 cnf(a0, assumption, % 209.54/27.00 union(X3,X4) = union(difference(sK3,sK4),difference(sK4,sK3))). % 209.54/27.00 cnf(c3, plain, % 209.54/27.00 $false, % 209.54/27.00 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])). % 209.54/27.00 cnf(c4, plain, % 209.54/27.00 $false, % 209.54/27.00 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])). % 209.54/27.00 cnf(c5, plain, % 209.54/27.00 X3 != difference(X0,X2) | X4 != difference(X1,X2) | X5 != difference(union(X0,X1),X2) | difference(union(sK3,sK4),intersection(sK3,sK4)) != X5, % 209.54/27.00 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])). % 209.54/27.00 % 209.54/27.00 cnf(c6, axiom, % 209.54/27.00 difference(X6,X7) = difference(X6,intersection(X6,X7))). % 209.54/27.00 cnf(a1, assumption, % 209.54/27.00 difference(X0,X2) = difference(X6,intersection(X6,X7))). % 209.54/27.00 cnf(c7, plain, % 209.54/27.00 X4 != difference(X1,X2) | X5 != difference(union(X0,X1),X2) | difference(union(sK3,sK4),intersection(sK3,sK4)) != X5, % 209.54/27.00 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 209.54/27.00 cnf(c8, plain, % 209.54/27.00 $false, % 209.54/27.00 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 209.54/27.00 cnf(c9, plain, % 209.54/27.00 X8 != difference(X6,X7) | X3 != X8, % 209.54/27.00 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 209.54/27.00 % 209.54/27.00 cnf(a2, assumption, % 209.54/27.00 X8 = difference(X6,X7)). % 209.54/27.00 cnf(c10, plain, % 209.54/27.00 X3 != X8, % 209.54/27.00 inference(reflexivity, [assumptions([a2])], [c9])). % 209.54/27.00 % 209.54/27.00 cnf(a3, assumption, % 209.54/27.00 X3 = X8). % 209.54/27.00 cnf(c11, plain, % 209.54/27.00 $false, % 209.54/27.00 inference(reflexivity, [assumptions([a3])], [c10])). % 209.54/27.00 % 209.54/27.00 cnf(c12, axiom, % 209.54/27.00 difference(X9,X10) = difference(X9,intersection(X9,X10))). % 209.54/27.00 cnf(a4, assumption, % 209.54/27.00 difference(X11,X12) = difference(X1,X2)). % 209.54/27.00 cnf(c13, plain, % 209.54/27.00 X5 != difference(union(X0,X1),X2) | difference(union(sK3,sK4),intersection(sK3,sK4)) != X5, % 209.54/27.00 inference(lazy_function_extension, [assumptions([a4])], [c7, c12])). % 209.54/27.00 cnf(c14, plain, % 209.54/27.00 $false, % 209.54/27.00 inference(lazy_function_extension, [assumptions([a4])], [c7, c12])). % 209.54/27.00 cnf(c15, plain, % 209.54/27.00 X11 != X9 | X12 != intersection(X9,X10) | X13 != difference(X9,X10) | X4 != X13, % 209.54/27.00 inference(lazy_function_extension, [assumptions([a4])], [c7, c12])). % 209.54/27.00 % 209.54/27.00 cnf(a5, assumption, % 209.54/27.00 X11 = X9). % 209.54/27.00 cnf(c16, plain, % 209.54/27.00 X12 != intersection(X9,X10) | X13 != difference(X9,X10) | X4 != X13, % 209.54/27.00 inference(reflexivity, [assumptions([a5])], [c15])). % 209.54/27.00 % 209.54/27.00 cnf(c17, axiom, % 209.54/27.00 intersection(X14,X15) = intersection(X15,X14)). % 209.54/27.00 cnf(a6, assumption, % 209.54/27.00 intersection(X9,X10) = intersection(X15,X14)). % 209.54/27.00 cnf(c18, plain, % 209.54/27.00 X13 != difference(X9,X10) | X4 != X13, % 209.54/27.00 inference(strict_function_extension, [assumptions([a6])], [c16, c17])). % 209.54/27.00 cnf(c19, plain, % 209.54/27.00 $false, % 209.54/27.00 inference(strict_function_extension, [assumptions([a6])], [c16, c17])). % 209.54/27.00 cnf(c20, plain, % 209.54/27.00 X16 != intersection(X14,X15) | X12 != X16, % 209.54/27.00 inference(strict_function_extension, [assumptions([a6])], [c16, c17])). % 209.54/27.00 % 209.54/27.00 cnf(a7, assumption, % 209.54/27.00 X16 = intersection(X14,X15)). % 209.54/27.00 cnf(c21, plain, % 209.54/27.00 X12 != X16, % 209.54/27.00 inference(reflexivity, [assumptions([a7])], [c20])). % 209.54/27.00 % 209.54/27.00 cnf(a8, assumption, % 209.54/27.00 X12 = X16). % 209.54/27.00 cnf(c22, plain, % 209.54/27.00 $false, % 209.54/27.00 inference(reflexivity, [assumptions([a8])], [c21])). % 209.54/27.00 % 209.54/27.00 cnf(a9, assumption, % 209.54/27.00 X13 = difference(X9,X10)). % 209.54/27.00 cnf(c23, plain, % 209.54/27.00 X4 != X13, % 209.54/27.00 inference(reflexivity, [assumptions([a9])], [c18])). % 209.54/27.00 % 209.54/27.00 cnf(a10, assumption, % 209.54/27.00 X4 = X13). % 209.54/27.00 cnf(c24, plain, % 209.54/27.00 $false, % 209.54/27.00 inference(reflexivity, [assumptions([a10])], [c23])). % 209.54/27.00 % 209.54/27.00 cnf(a11, assumption, % 209.54/27.00 X5 = difference(union(X0,X1),X2)). % 209.54/27.00 cnf(c25, plain, % 209.54/27.00 difference(union(sK3,sK4),intersection(sK3,sK4)) != X5, % 209.54/27.00 inference(reflexivity, [assumptions([a11])], [c13])). % 209.54/27.00 % 209.54/27.00 cnf(a12, assumption, % 209.54/27.00 difference(union(sK3,sK4),intersection(sK3,sK4)) = X5). % 209.54/27.00 cnf(c26, plain, % 209.54/27.00 $false, % 209.54/27.00 inference(reflexivity, [assumptions([a12])], [c25])). % 209.54/27.00 % 209.54/27.00 cnf(c27, plain, % 209.54/27.00 $false, % 209.54/27.00 inference(constraint_solving, [ % 209.54/27.00 bind(X0, sK3), % 209.54/27.00 bind(X1, sK4), % 209.54/27.00 bind(X2, intersection(X6,X7)), % 209.54/27.00 bind(X5, difference(union(X0,X1),X2)), % 209.54/27.00 bind(X3, difference(sK3,sK4)), % 209.54/27.00 bind(X4, difference(sK4,sK3)), % 209.54/27.00 bind(X6, sK3), % 209.54/27.00 bind(X7, sK4), % 209.54/27.00 bind(X8, difference(X6,X7)), % 209.54/27.00 bind(X9, sK4), % 209.54/27.00 bind(X10, sK3), % 209.54/27.00 bind(X13, difference(X9,X10)), % 209.54/27.00 bind(X11, sK4), % 209.54/27.00 bind(X12, intersection(X6,X7)), % 209.54/27.00 bind(X14, sK3), % 209.54/27.00 bind(X15, sK4), % 209.54/27.00 bind(X16, intersection(X14,X15)) % 209.54/27.00 ], % 209.54/27.00 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])). % 209.54/27.00 % 209.54/27.00 % SZS output end IncompleteProof %------------------------------------------------------------------------------