%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET977+1 : TPTP v8.1.0. Released v3.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 : 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 02:49:33 EDT 2022 % Result : Theorem 0.23s 0.49s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.13 % Problem : SET977+1 : TPTP v8.1.0. Released v3.2.0. % 0.13/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.36 % Computer : n010.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Sat Jul 9 22:34:00 EDT 2022 % 0.14/0.36 % CPUTime : % 0.23/0.49 % SZS status Theorem % 0.23/0.49 % SZS output begin IncompleteProof % 0.23/0.49 cnf(c0, axiom, % 0.23/0.49 empty_set = cartesian_product2(sK3,singleton(sK4)) | empty_set = cartesian_product2(singleton(sK4),sK3)). % 0.23/0.49 cnf(c1, plain, % 0.23/0.49 empty_set = cartesian_product2(sK3,singleton(sK4)) | empty_set = cartesian_product2(singleton(sK4),sK3), % 0.23/0.49 inference(start, [], [c0])). % 0.23/0.49 % 0.23/0.49 cnf(c2, axiom, % 0.23/0.49 in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),cartesian_product2(X2,singleton(X1))) | ~in(X0,X2)). % 0.23/0.49 cnf(a0, assumption, % 0.23/0.49 cartesian_product2(X2,singleton(X1)) = cartesian_product2(sK3,singleton(sK4))). % 0.23/0.49 cnf(a1, assumption, % 0.23/0.49 empty_set = X3). % 0.23/0.49 cnf(c3, plain, % 0.23/0.49 empty_set = cartesian_product2(singleton(sK4),sK3), % 0.23/0.49 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.23/0.49 cnf(c4, plain, % 0.23/0.49 ~in(X0,X2), % 0.23/0.49 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.23/0.49 cnf(c5, plain, % 0.23/0.49 in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),X3), % 0.23/0.49 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.23/0.49 % 0.23/0.49 cnf(c6, axiom, % 0.23/0.49 ~in(X4,empty_set)). % 0.23/0.49 cnf(a2, assumption, % 0.23/0.49 unordered_pair(unordered_pair(X0,X1),singleton(X0)) = X4). % 0.23/0.49 cnf(a3, assumption, % 0.23/0.49 X3 = empty_set). % 0.23/0.49 cnf(c7, plain, % 0.23/0.49 $false, % 0.23/0.49 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 0.23/0.49 cnf(c8, plain, % 0.23/0.49 $false, % 0.23/0.49 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 0.23/0.49 % 0.23/0.49 cnf(c9, axiom, % 0.23/0.49 empty_set = X5 | in(sK0(X5),X5)). % 0.23/0.49 cnf(a4, assumption, % 0.23/0.49 X0 = sK0(X5)). % 0.23/0.49 cnf(a5, assumption, % 0.23/0.49 X2 = X5). % 0.23/0.49 cnf(c10, plain, % 0.23/0.49 $false, % 0.23/0.49 inference(strict_predicate_extension, [assumptions([a4, a5])], [c4, c9])). % 0.23/0.49 cnf(c11, plain, % 0.23/0.49 empty_set = X5, % 0.23/0.49 inference(strict_predicate_extension, [assumptions([a4, a5])], [c4, c9])). % 0.23/0.49 % 0.23/0.49 cnf(c12, axiom, % 0.23/0.49 empty_set != sK3). % 0.23/0.49 cnf(a6, assumption, % 0.23/0.49 sK3 = X5). % 0.23/0.49 cnf(a7, assumption, % 0.23/0.49 empty_set = X6). % 0.23/0.49 cnf(c13, plain, % 0.23/0.49 $false, % 0.23/0.49 inference(strict_subterm_extension, [assumptions([a6, a7])], [c11, c12])). % 0.23/0.49 cnf(c14, plain, % 0.23/0.49 $false, % 0.23/0.49 inference(strict_subterm_extension, [assumptions([a6, a7])], [c11, c12])). % 0.23/0.49 cnf(c15, plain, % 0.23/0.49 empty_set != X6, % 0.23/0.49 inference(strict_subterm_extension, [assumptions([a6, a7])], [c11, c12])). % 0.23/0.49 % 0.23/0.49 cnf(a8, assumption, % 0.23/0.49 empty_set = X6). % 0.23/0.49 cnf(c16, plain, % 0.23/0.49 $false, % 0.23/0.49 inference(reflexivity, [assumptions([a8])], [c15])). % 0.23/0.49 % 0.23/0.49 cnf(c17, axiom, % 0.23/0.49 in(unordered_pair(unordered_pair(X7,X8),singleton(X7)),cartesian_product2(singleton(X7),X9)) | ~in(X8,X9)). % 0.23/0.49 cnf(a9, assumption, % 0.23/0.49 cartesian_product2(singleton(X7),X9) = cartesian_product2(singleton(sK4),sK3)). % 0.23/0.49 cnf(a10, assumption, % 0.23/0.49 empty_set = X10). % 0.23/0.49 cnf(c18, plain, % 0.23/0.49 $false, % 0.23/0.49 inference(strict_subterm_extension, [assumptions([a9, a10])], [c3, c17])). % 0.23/0.49 cnf(c19, plain, % 0.23/0.49 ~in(X8,X9), % 0.23/0.49 inference(strict_subterm_extension, [assumptions([a9, a10])], [c3, c17])). % 0.23/0.49 cnf(c20, plain, % 0.23/0.49 in(unordered_pair(unordered_pair(X7,X8),singleton(X7)),X10), % 0.23/0.49 inference(strict_subterm_extension, [assumptions([a9, a10])], [c3, c17])). % 0.23/0.49 % 0.23/0.49 cnf(c21, axiom, % 0.23/0.49 ~in(X11,empty_set)). % 0.23/0.49 cnf(a11, assumption, % 0.23/0.49 unordered_pair(unordered_pair(X7,X8),singleton(X7)) = X11). % 0.23/0.49 cnf(a12, assumption, % 0.23/0.49 X10 = empty_set). % 0.23/0.49 cnf(c22, plain, % 0.23/0.49 $false, % 0.23/0.49 inference(strict_predicate_extension, [assumptions([a11, a12])], [c20, c21])). % 0.23/0.50 cnf(c23, plain, % 0.23/0.50 $false, % 0.23/0.50 inference(strict_predicate_extension, [assumptions([a11, a12])], [c20, c21])). % 0.23/0.50 % 0.23/0.50 cnf(c24, plain, % 0.23/0.50 in(X0,X2)). % 0.23/0.50 cnf(a13, assumption, % 0.23/0.50 X8 = X0). % 0.23/0.50 cnf(a14, assumption, % 0.23/0.50 X9 = X2). % 0.23/0.50 cnf(c25, plain, % 0.23/0.50 $false, % 0.23/0.50 inference(predicate_reduction, [assumptions([a13, a14])], [c19, c24])). % 0.23/0.50 % 0.23/0.50 cnf(c26, plain, % 0.23/0.50 $false, % 0.23/0.50 inference(constraint_solving, [ % 0.23/0.50 bind(X0, sK0(X5)), % 0.23/0.50 bind(X1, sK4), % 0.23/0.50 bind(X2, sK3), % 0.23/0.50 bind(X3, empty_set), % 0.23/0.50 bind(X4, unordered_pair(unordered_pair(X0,X1),singleton(X0))), % 0.23/0.50 bind(X5, sK3), % 0.23/0.50 bind(X6, empty_set), % 0.23/0.50 bind(X7, sK4), % 0.23/0.50 bind(X8, sK0(X5)), % 0.23/0.50 bind(X9, sK3), % 0.23/0.50 bind(X10, empty_set), % 0.23/0.50 bind(X11, unordered_pair(unordered_pair(X7,X8),singleton(X7))) % 0.23/0.50 ], % 0.23/0.50 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])). % 0.23/0.50 % 0.23/0.50 % SZS output end IncompleteProof %------------------------------------------------------------------------------