%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET878+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 : n009.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:48:56 EDT 2022 % Result : Theorem 0.12s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : SET878+1 : TPTP v8.1.0. Released v3.2.0. % 0.08/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n009.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sat Jul 9 23:33:52 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 % SZS status Theorem % 0.12/0.37 % SZS output begin IncompleteProof % 0.12/0.37 cnf(c0, axiom, % 0.12/0.37 singleton(sK5) != set_intersection2(singleton(sK5),unordered_pair(sK5,sK6))). % 0.12/0.37 cnf(c1, plain, % 0.12/0.37 singleton(sK5) != set_intersection2(singleton(sK5),unordered_pair(sK5,sK6)), % 0.12/0.37 inference(start, [], [c0])). % 0.12/0.37 % 0.12/0.37 cnf(c2, axiom, % 0.12/0.37 set_intersection2(X0,X1) = set_intersection2(X1,X0)). % 0.12/0.37 cnf(a0, assumption, % 0.12/0.37 set_intersection2(singleton(sK5),unordered_pair(sK5,sK6)) = set_intersection2(X1,X0)). % 0.12/0.37 cnf(c3, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.37 cnf(c4, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.37 cnf(c5, plain, % 0.12/0.37 X2 != set_intersection2(X0,X1) | singleton(sK5) != X2, % 0.12/0.37 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.37 % 0.12/0.37 cnf(c6, axiom, % 0.12/0.37 singleton(X3) = set_intersection2(X4,singleton(X3)) | ~in(X3,X4)). % 0.12/0.37 cnf(a1, assumption, % 0.12/0.37 set_intersection2(X0,X1) = set_intersection2(X4,singleton(X3))). % 0.12/0.37 cnf(c7, plain, % 0.12/0.37 singleton(sK5) != X2, % 0.12/0.37 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.12/0.37 cnf(c8, plain, % 0.12/0.37 ~in(X3,X4), % 0.12/0.37 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.12/0.37 cnf(c9, plain, % 0.12/0.37 X5 != singleton(X3) | X2 != X5, % 0.12/0.37 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.12/0.37 % 0.12/0.37 cnf(a2, assumption, % 0.12/0.37 X5 = singleton(X3)). % 0.12/0.37 cnf(c10, plain, % 0.12/0.37 X2 != X5, % 0.12/0.37 inference(reflexivity, [assumptions([a2])], [c9])). % 0.12/0.37 % 0.12/0.37 cnf(a3, assumption, % 0.12/0.37 X2 = X5). % 0.12/0.37 cnf(c11, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(reflexivity, [assumptions([a3])], [c10])). % 0.12/0.37 % 0.12/0.37 cnf(c12, axiom, % 0.12/0.37 in(X6,X7) | ~sP0(X6,X8,X9) | ~sP1(X9,X8,X7)). % 0.12/0.37 cnf(a4, assumption, % 0.12/0.37 X3 = X6). % 0.12/0.37 cnf(a5, assumption, % 0.12/0.37 X4 = X7). % 0.12/0.37 cnf(c13, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c12])). % 0.12/0.37 cnf(c14, plain, % 0.12/0.37 ~sP0(X6,X8,X9) | ~sP1(X9,X8,X7), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c12])). % 0.12/0.37 % 0.12/0.37 cnf(c15, axiom, % 0.12/0.37 sP0(X10,X11,X10)). % 0.12/0.37 cnf(a6, assumption, % 0.12/0.37 X6 = X10). % 0.12/0.37 cnf(a7, assumption, % 0.12/0.37 X8 = X11). % 0.12/0.37 cnf(a8, assumption, % 0.12/0.37 X9 = X10). % 0.12/0.37 cnf(c16, plain, % 0.12/0.37 ~sP1(X9,X8,X7), % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c14, c15])). % 0.12/0.37 cnf(c17, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c14, c15])). % 0.12/0.37 % 0.12/0.37 cnf(c18, axiom, % 0.12/0.37 sP1(X12,X13,unordered_pair(X12,X13))). % 0.12/0.37 cnf(a9, assumption, % 0.12/0.37 X9 = X12). % 0.12/0.37 cnf(a10, assumption, % 0.12/0.37 X8 = X13). % 0.12/0.37 cnf(a11, assumption, % 0.12/0.37 X7 = unordered_pair(X12,X13)). % 0.12/0.37 cnf(c19, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c16, c18])). % 0.12/0.37 cnf(c20, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c16, c18])). % 0.12/0.37 % 0.12/0.37 cnf(a12, assumption, % 0.12/0.37 singleton(sK5) = X2). % 0.12/0.37 cnf(c21, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(reflexivity, [assumptions([a12])], [c7])). % 0.12/0.37 % 0.12/0.37 cnf(c22, plain, % 0.12/0.37 $false, % 0.12/0.37 inference(constraint_solving, [ % 0.12/0.37 bind(X0, unordered_pair(sK5,sK6)), % 0.12/0.37 bind(X1, singleton(sK5)), % 0.12/0.37 bind(X2, singleton(X3)), % 0.12/0.37 bind(X3, sK5), % 0.12/0.37 bind(X4, unordered_pair(sK5,sK6)), % 0.12/0.37 bind(X5, singleton(X3)), % 0.12/0.37 bind(X6, sK5), % 0.12/0.37 bind(X7, unordered_pair(sK5,sK6)), % 0.12/0.37 bind(X8, sK6), % 0.12/0.37 bind(X9, sK5), % 0.12/0.37 bind(X10, sK5), % 0.12/0.37 bind(X11, sK6), % 0.12/0.37 bind(X12, sK5), % 0.12/0.37 bind(X13, sK6) % 0.12/0.37 ], % 0.12/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])). % 0.12/0.37 % 0.12/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------