%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET635+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 : n005.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:18 EDT 2022 % Result : Theorem 19.09s 2.81s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SET635+3 : TPTP v8.1.0. Released v2.2.0. % 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n005.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 13:34:37 EDT 2022 % 0.12/0.33 % CPUTime : % 19.09/2.81 % SZS status Theorem % 19.09/2.81 % SZS output begin IncompleteProof % 19.09/2.81 cnf(c0, axiom, % 19.09/2.81 intersection(sK4,difference(sK5,sK6)) != difference(intersection(sK4,sK5),intersection(sK4,sK6))). % 19.09/2.81 cnf(c1, plain, % 19.09/2.81 intersection(sK4,difference(sK5,sK6)) != difference(intersection(sK4,sK5),intersection(sK4,sK6)), % 19.09/2.81 inference(start, [], [c0])). % 19.09/2.81 % 19.09/2.81 cnf(c2, axiom, % 19.09/2.81 difference(X0,intersection(X1,X2)) = union(difference(X0,X1),difference(X0,X2))). % 19.09/2.81 cnf(a0, assumption, % 19.09/2.81 difference(intersection(sK4,sK5),intersection(sK4,sK6)) = difference(X0,intersection(X1,X2))). % 19.09/2.81 cnf(c3, plain, % 19.09/2.81 $false, % 19.09/2.81 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 19.09/2.81 cnf(c4, plain, % 19.09/2.81 $false, % 19.09/2.81 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 19.09/2.81 cnf(c5, plain, % 19.09/2.81 X3 != union(difference(X0,X1),difference(X0,X2)) | intersection(sK4,difference(sK5,sK6)) != X3, % 19.09/2.81 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 19.09/2.81 % 19.09/2.81 cnf(c6, axiom, % 19.09/2.81 difference(X4,X5) = empty_set | ~subset(X4,X5)). % 19.09/2.81 cnf(a1, assumption, % 19.09/2.81 difference(X0,X1) = difference(X4,X5)). % 19.09/2.81 cnf(c7, plain, % 19.09/2.81 intersection(sK4,difference(sK5,sK6)) != X3, % 19.09/2.81 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 19.09/2.81 cnf(c8, plain, % 19.09/2.81 ~subset(X4,X5), % 19.09/2.81 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 19.09/2.81 cnf(c9, plain, % 19.09/2.81 X6 != empty_set | X3 != union(X6,difference(X0,X2)), % 19.09/2.81 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 19.09/2.81 % 19.09/2.81 cnf(a2, assumption, % 19.09/2.81 X6 = empty_set). % 19.09/2.81 cnf(c10, plain, % 19.09/2.81 X3 != union(X6,difference(X0,X2)), % 19.09/2.81 inference(reflexivity, [assumptions([a2])], [c9])). % 19.09/2.81 % 19.09/2.81 cnf(c11, axiom, % 19.09/2.81 intersection(X7,difference(X8,X9)) = difference(intersection(X7,X8),X9)). % 19.09/2.81 cnf(a3, assumption, % 19.09/2.81 difference(X0,X2) = difference(intersection(X7,X8),X9)). % 19.09/2.81 cnf(c12, plain, % 19.09/2.81 $false, % 19.09/2.81 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 19.09/2.81 cnf(c13, plain, % 19.09/2.81 $false, % 19.09/2.81 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 19.09/2.81 cnf(c14, plain, % 19.09/2.81 X10 != intersection(X7,difference(X8,X9)) | X3 != union(X6,X10), % 19.09/2.81 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 19.09/2.81 % 19.09/2.81 cnf(a4, assumption, % 19.09/2.81 X10 = intersection(X7,difference(X8,X9))). % 19.09/2.81 cnf(c15, plain, % 19.09/2.81 X3 != union(X6,X10), % 19.09/2.81 inference(reflexivity, [assumptions([a4])], [c14])). % 19.09/2.81 % 19.09/2.81 cnf(c16, axiom, % 19.09/2.81 union(X11,X12) = union(X12,X11)). % 19.09/2.81 cnf(a5, assumption, % 19.09/2.81 union(X6,X10) = union(X11,X12)). % 19.09/2.81 cnf(c17, plain, % 19.09/2.81 $false, % 19.09/2.81 inference(strict_function_extension, [assumptions([a5])], [c15, c16])). % 19.09/2.81 cnf(c18, plain, % 19.09/2.81 $false, % 19.09/2.81 inference(strict_function_extension, [assumptions([a5])], [c15, c16])). % 19.09/2.81 cnf(c19, plain, % 19.09/2.81 X13 != union(X12,X11) | X3 != X13, % 19.09/2.81 inference(strict_function_extension, [assumptions([a5])], [c15, c16])). % 19.09/2.81 % 19.09/2.81 cnf(c20, axiom, % 19.09/2.81 union(X14,empty_set) = X14). % 19.09/2.81 cnf(a6, assumption, % 19.09/2.81 union(X12,X11) = union(X14,empty_set)). % 19.09/2.81 cnf(c21, plain, % 19.09/2.81 X3 != X13, % 19.09/2.81 inference(strict_function_extension, [assumptions([a6])], [c19, c20])). % 19.09/2.81 cnf(c22, plain, % 19.09/2.81 $false, % 19.09/2.81 inference(strict_function_extension, [assumptions([a6])], [c19, c20])). % 19.09/2.81 cnf(c23, plain, % 19.09/2.81 X15 != X14 | X13 != X15, % 19.09/2.81 inference(strict_function_extension, [assumptions([a6])], [c19, c20])). % 19.09/2.81 % 19.09/2.81 cnf(a7, assumption, % 19.09/2.81 X15 = X14). % 19.09/2.81 cnf(c24, plain, % 19.09/2.81 X13 != X15, % 19.09/2.81 inference(reflexivity, [assumptions([a7])], [c23])). % 19.09/2.81 % 19.09/2.81 cnf(a8, assumption, % 19.09/2.81 X13 = X15). % 19.09/2.81 cnf(c25, plain, % 19.09/2.81 $false, % 19.09/2.81 inference(reflexivity, [assumptions([a8])], [c24])). % 19.09/2.81 % 19.09/2.81 cnf(a9, assumption, % 19.09/2.81 X3 = X13). % 19.09/2.81 cnf(c26, plain, % 19.09/2.81 $false, % 19.09/2.81 inference(reflexivity, [assumptions([a9])], [c21])). % 19.09/2.81 % 19.09/2.81 cnf(c27, axiom, % 19.09/2.81 subset(intersection(X16,X17),X16)). % 19.09/2.81 cnf(a10, assumption, % 19.09/2.81 X4 = intersection(X16,X17)). % 19.09/2.81 cnf(a11, assumption, % 19.09/2.81 X5 = X16). % 19.09/2.81 cnf(c28, plain, % 19.09/2.81 $false, % 19.09/2.81 inference(strict_predicate_extension, [assumptions([a10, a11])], [c8, c27])). % 19.09/2.81 cnf(c29, plain, % 19.09/2.81 $false, % 19.09/2.81 inference(strict_predicate_extension, [assumptions([a10, a11])], [c8, c27])). % 19.09/2.81 % 19.09/2.81 cnf(a12, assumption, % 19.09/2.81 intersection(sK4,difference(sK5,sK6)) = X3). % 19.09/2.81 cnf(c30, plain, % 19.09/2.81 $false, % 19.09/2.81 inference(reflexivity, [assumptions([a12])], [c7])). % 19.09/2.81 % 19.09/2.81 cnf(c31, plain, % 19.09/2.81 $false, % 19.09/2.81 inference(constraint_solving, [ % 19.09/2.81 bind(X0, intersection(sK4,sK5)), % 19.09/2.81 bind(X1, sK4), % 19.09/2.81 bind(X2, sK6), % 19.09/2.81 bind(X3, intersection(X7,difference(X8,X9))), % 19.09/2.81 bind(X4, intersection(sK4,sK5)), % 19.09/2.81 bind(X5, sK4), % 19.09/2.81 bind(X6, empty_set), % 19.09/2.81 bind(X7, sK4), % 19.09/2.81 bind(X8, sK5), % 19.09/2.81 bind(X9, sK6), % 19.09/2.81 bind(X10, intersection(X7,difference(X8,X9))), % 19.09/2.81 bind(X11, empty_set), % 19.09/2.81 bind(X12, intersection(X7,difference(X8,X9))), % 19.09/2.81 bind(X13, intersection(X7,difference(X8,X9))), % 19.09/2.81 bind(X14, intersection(X7,difference(X8,X9))), % 19.09/2.81 bind(X15, intersection(X7,difference(X8,X9))), % 19.09/2.81 bind(X16, sK4), % 19.09/2.81 bind(X17, sK5) % 19.09/2.81 ], % 19.09/2.81 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])). % 19.09/2.81 % 19.09/2.81 % SZS output end IncompleteProof %------------------------------------------------------------------------------