%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET928+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 : 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:49:17 EDT 2022 % Result : Theorem 3.90s 0.82s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : SET928+1 : TPTP v8.1.0. Released v3.2.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.34 % Computer : n026.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Sun Jul 10 19:00:41 EDT 2022 % 0.14/0.35 % CPUTime : % 3.90/0.82 % SZS status Theorem % 3.90/0.82 % SZS output begin IncompleteProof % 3.90/0.82 cnf(c0, axiom, % 3.90/0.82 ~in(sK2,sK4) | unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4)). % 3.90/0.82 cnf(c1, plain, % 3.90/0.82 ~in(sK2,sK4) | unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4), % 3.90/0.82 inference(start, [], [c0])). % 3.90/0.82 % 3.90/0.82 cnf(c2, axiom, % 3.90/0.82 disjoint(unordered_pair(X0,X1),X2) | in(X1,X2) | in(X0,X2)). % 3.90/0.82 cnf(a0, assumption, % 3.90/0.82 sK2 = X0). % 3.90/0.82 cnf(a1, assumption, % 3.90/0.82 sK4 = X2). % 3.90/0.82 cnf(c3, plain, % 3.90/0.82 unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4), % 3.90/0.82 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 3.90/0.82 cnf(c4, plain, % 3.90/0.82 disjoint(unordered_pair(X0,X1),X2) | in(X1,X2), % 3.90/0.82 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 3.90/0.82 % 3.90/0.82 cnf(c5, axiom, % 3.90/0.82 unordered_pair(X3,X4) = unordered_pair(X4,X3)). % 3.90/0.82 cnf(a2, assumption, % 3.90/0.82 unordered_pair(X0,X1) = unordered_pair(X4,X3)). % 3.90/0.82 cnf(c6, plain, % 3.90/0.82 in(X1,X2), % 3.90/0.82 inference(strict_function_extension, [assumptions([a2])], [c4, c5])). % 3.90/0.82 cnf(c7, plain, % 3.90/0.82 $false, % 3.90/0.82 inference(strict_function_extension, [assumptions([a2])], [c4, c5])). % 3.90/0.82 cnf(c8, plain, % 3.90/0.82 X5 != unordered_pair(X3,X4) | disjoint(X5,X2), % 3.90/0.82 inference(strict_function_extension, [assumptions([a2])], [c4, c5])). % 3.90/0.82 % 3.90/0.82 cnf(a3, assumption, % 3.90/0.82 X5 = unordered_pair(X3,X4)). % 3.90/0.82 cnf(c9, plain, % 3.90/0.82 disjoint(X5,X2), % 3.90/0.82 inference(reflexivity, [assumptions([a3])], [c8])). % 3.90/0.82 % 3.90/0.82 cnf(c10, axiom, % 3.90/0.82 ~in(X6,X7) | ~disjoint(unordered_pair(X6,X8),X7)). % 3.90/0.82 cnf(a4, assumption, % 3.90/0.82 X5 = unordered_pair(X6,X8)). % 3.90/0.82 cnf(a5, assumption, % 3.90/0.82 X2 = X7). % 3.90/0.82 cnf(c11, plain, % 3.90/0.82 $false, % 3.90/0.82 inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c10])). % 3.90/0.82 cnf(c12, plain, % 3.90/0.82 ~in(X6,X7), % 3.90/0.82 inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c10])). % 3.90/0.82 % 3.90/0.82 cnf(c13, axiom, % 3.90/0.82 in(sK3,sK4) | in(sK2,sK4) | unordered_pair(sK2,sK3) != set_difference(unordered_pair(sK2,sK3),sK4)). % 3.90/0.82 cnf(a6, assumption, % 3.90/0.82 X6 = sK3). % 3.90/0.82 cnf(a7, assumption, % 3.90/0.82 X7 = sK4). % 3.90/0.82 cnf(c14, plain, % 3.90/0.82 $false, % 3.90/0.82 inference(strict_predicate_extension, [assumptions([a6, a7])], [c12, c13])). % 3.90/0.82 cnf(c15, plain, % 3.90/0.82 in(sK2,sK4) | unordered_pair(sK2,sK3) != set_difference(unordered_pair(sK2,sK3),sK4), % 3.90/0.82 inference(strict_predicate_extension, [assumptions([a6, a7])], [c12, c13])). % 3.90/0.82 % 3.90/0.82 cnf(c16, plain, % 3.90/0.82 ~in(sK2,sK4)). % 3.90/0.82 cnf(a8, assumption, % 3.90/0.82 sK2 = sK2). % 3.90/0.82 cnf(a9, assumption, % 3.90/0.82 sK4 = sK4). % 3.90/0.82 cnf(c17, plain, % 3.90/0.82 unordered_pair(sK2,sK3) != set_difference(unordered_pair(sK2,sK3),sK4), % 3.90/0.82 inference(predicate_reduction, [assumptions([a8, a9])], [c15, c16])). % 3.90/0.82 % 3.90/0.82 cnf(c18, axiom, % 3.90/0.82 set_difference(X9,X10) = X9 | ~disjoint(X9,X10)). % 3.90/0.82 cnf(a10, assumption, % 3.90/0.82 set_difference(unordered_pair(sK2,sK3),sK4) = set_difference(X9,X10)). % 3.90/0.82 cnf(c19, plain, % 3.90/0.82 $false, % 3.90/0.82 inference(strict_function_extension, [assumptions([a10])], [c17, c18])). % 3.90/0.82 cnf(c20, plain, % 3.90/0.82 ~disjoint(X9,X10), % 3.90/0.82 inference(strict_function_extension, [assumptions([a10])], [c17, c18])). % 3.90/0.82 cnf(c21, plain, % 3.90/0.82 X11 != X9 | unordered_pair(sK2,sK3) != X11, % 3.90/0.82 inference(strict_function_extension, [assumptions([a10])], [c17, c18])). % 3.90/0.82 % 3.90/0.82 cnf(a11, assumption, % 3.90/0.82 X11 = X9). % 3.90/0.82 cnf(c22, plain, % 3.90/0.82 unordered_pair(sK2,sK3) != X11, % 3.90/0.82 inference(reflexivity, [assumptions([a11])], [c21])). % 3.90/0.82 % 3.90/0.82 cnf(a12, assumption, % 3.90/0.82 unordered_pair(sK2,sK3) = X11). % 3.90/0.82 cnf(c23, plain, % 3.90/0.82 $false, % 3.90/0.82 inference(reflexivity, [assumptions([a12])], [c22])). % 3.90/0.82 % 3.90/0.82 cnf(c24, plain, % 3.90/0.82 disjoint(unordered_pair(X0,X1),X2)). % 3.90/0.82 cnf(a13, assumption, % 3.90/0.82 X9 = unordered_pair(X0,X1)). % 3.90/0.82 cnf(a14, assumption, % 3.90/0.82 X10 = X2). % 3.90/0.82 cnf(c25, plain, % 3.90/0.82 $false, % 3.90/0.82 inference(predicate_reduction, [assumptions([a13, a14])], [c20, c24])). % 3.90/0.82 % 3.90/0.82 cnf(c26, axiom, % 3.90/0.82 ~in(sK3,sK4) | unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4)). % 3.90/0.82 cnf(a15, assumption, % 3.90/0.82 X1 = sK3). % 3.90/0.82 cnf(a16, assumption, % 3.90/0.82 X2 = sK4). % 3.90/0.82 cnf(c27, plain, % 3.90/0.82 $false, % 3.90/0.82 inference(strict_predicate_extension, [assumptions([a15, a16])], [c6, c26])). % 3.90/0.82 cnf(c28, plain, % 3.90/0.82 unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4), % 3.90/0.82 inference(strict_predicate_extension, [assumptions([a15, a16])], [c6, c26])). % 3.90/0.82 % 3.90/0.82 cnf(c29, axiom, % 3.90/0.82 disjoint(X12,X13) | set_difference(X12,X13) != X12). % 3.90/0.82 cnf(a17, assumption, % 3.90/0.82 set_difference(X12,X13) = set_difference(unordered_pair(sK2,sK3),sK4)). % 3.90/0.82 cnf(a18, assumption, % 3.90/0.82 unordered_pair(sK2,sK3) = X14). % 3.90/0.82 cnf(c30, plain, % 3.90/0.82 $false, % 3.90/0.82 inference(strict_subterm_extension, [assumptions([a17, a18])], [c28, c29])). % 3.90/0.82 cnf(c31, plain, % 3.90/0.82 disjoint(X12,X13), % 3.90/0.82 inference(strict_subterm_extension, [assumptions([a17, a18])], [c28, c29])). % 3.90/0.82 cnf(c32, plain, % 3.90/0.82 X14 != X12, % 3.90/0.82 inference(strict_subterm_extension, [assumptions([a17, a18])], [c28, c29])). % 3.90/0.82 % 3.90/0.82 cnf(a19, assumption, % 3.90/0.82 X14 = X12). % 3.90/0.82 cnf(c33, plain, % 3.90/0.82 $false, % 3.90/0.82 inference(reflexivity, [assumptions([a19])], [c32])). % 3.90/0.82 % 3.90/0.82 cnf(c34, plain, % 3.90/0.82 ~disjoint(unordered_pair(X0,X1),X2)). % 3.90/0.82 cnf(a20, assumption, % 3.90/0.82 X12 = unordered_pair(X0,X1)). % 3.90/0.82 cnf(a21, assumption, % 3.90/0.82 X13 = X2). % 3.90/0.82 cnf(c35, plain, % 3.90/0.82 $false, % 3.90/0.82 inference(predicate_reduction, [assumptions([a20, a21])], [c31, c34])). % 3.90/0.82 % 3.90/0.82 cnf(c36, axiom, % 3.90/0.82 disjoint(X15,X16) | set_difference(X15,X16) != X15). % 3.90/0.82 cnf(a22, assumption, % 3.90/0.82 set_difference(X15,X16) = set_difference(unordered_pair(sK2,sK3),sK4)). % 3.90/0.82 cnf(a23, assumption, % 3.90/0.82 unordered_pair(sK2,sK3) = X17). % 3.90/0.82 cnf(c37, plain, % 3.90/0.82 $false, % 3.90/0.82 inference(strict_subterm_extension, [assumptions([a22, a23])], [c3, c36])). % 3.90/0.82 cnf(c38, plain, % 3.90/0.82 disjoint(X15,X16), % 3.90/0.82 inference(strict_subterm_extension, [assumptions([a22, a23])], [c3, c36])). % 3.90/0.82 cnf(c39, plain, % 3.90/0.82 X17 != X15, % 3.90/0.82 inference(strict_subterm_extension, [assumptions([a22, a23])], [c3, c36])). % 3.90/0.82 % 3.90/0.82 cnf(a24, assumption, % 3.90/0.82 X17 = X15). % 3.90/0.82 cnf(c40, plain, % 3.90/0.82 $false, % 3.90/0.82 inference(reflexivity, [assumptions([a24])], [c39])). % 3.90/0.82 % 3.90/0.82 cnf(c41, axiom, % 3.90/0.82 ~in(X18,X19) | ~disjoint(unordered_pair(X18,X20),X19)). % 3.90/0.82 cnf(a25, assumption, % 3.90/0.82 X15 = unordered_pair(X18,X20)). % 3.90/0.82 cnf(a26, assumption, % 3.90/0.82 X16 = X19). % 3.90/0.82 cnf(c42, plain, % 3.90/0.82 $false, % 3.90/0.82 inference(strict_predicate_extension, [assumptions([a25, a26])], [c38, c41])). % 3.90/0.82 cnf(c43, plain, % 3.90/0.82 ~in(X18,X19), % 3.90/0.82 inference(strict_predicate_extension, [assumptions([a25, a26])], [c38, c41])). % 3.90/0.82 % 3.90/0.82 cnf(c44, plain, % 3.90/0.82 in(sK2,sK4)). % 3.90/0.82 cnf(a27, assumption, % 3.90/0.82 X18 = sK2). % 3.90/0.82 cnf(a28, assumption, % 3.90/0.82 X19 = sK4). % 3.90/0.82 cnf(c45, plain, % 3.90/0.82 $false, % 3.90/0.82 inference(predicate_reduction, [assumptions([a27, a28])], [c43, c44])). % 3.90/0.82 % 3.90/0.82 cnf(c46, plain, % 3.90/0.82 $false, % 3.90/0.82 inference(constraint_solving, [ % 3.90/0.82 bind(X0, sK2), % 3.90/0.82 bind(X1, sK3), % 3.90/0.82 bind(X2, sK4), % 3.90/0.82 bind(X3, sK3), % 3.90/0.82 bind(X4, sK2), % 3.90/0.82 bind(X5, unordered_pair(X3,X4)), % 3.90/0.82 bind(X6, sK3), % 3.90/0.82 bind(X7, sK4), % 3.90/0.82 bind(X8, sK2), % 3.90/0.82 bind(X9, unordered_pair(sK2,sK3)), % 3.90/0.82 bind(X10, sK4), % 3.90/0.82 bind(X11, unordered_pair(sK2,sK3)), % 3.90/0.82 bind(X12, unordered_pair(sK2,sK3)), % 3.90/0.82 bind(X13, sK4), % 3.90/0.82 bind(X14, unordered_pair(sK2,sK3)), % 3.90/0.82 bind(X15, unordered_pair(sK2,sK3)), % 3.90/0.82 bind(X16, sK4), % 3.90/0.82 bind(X17, unordered_pair(sK2,sK3)), % 3.90/0.82 bind(X18, sK2), % 3.90/0.82 bind(X19, sK4), % 3.90/0.82 bind(X20, sK3) % 3.90/0.82 ], % 3.90/0.82 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28])). % 3.90/0.82 % 3.90/0.82 % SZS output end IncompleteProof %------------------------------------------------------------------------------