%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET002-1 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n024.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:42:07 EDT 2022 % Result : Unsatisfiable 0.12s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET002-1 : TPTP v8.1.0. Released v1.0.0. % 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n024.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 : Mon Jul 11 10:06:28 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 % SZS status Unsatisfiable % 0.12/0.34 % SZS output begin IncompleteProof % 0.12/0.34 cnf(c0, axiom, % 0.12/0.34 ~equal_sets(aUa,a)). % 0.12/0.34 cnf(c1, plain, % 0.12/0.34 ~equal_sets(aUa,a), % 0.12/0.34 inference(start, [], [c0])). % 0.12/0.34 % 0.12/0.34 cnf(c2, axiom, % 0.12/0.34 equal_sets(X0,X1) | ~subset(X0,X1) | ~subset(X1,X0)). % 0.12/0.34 cnf(a0, assumption, % 0.12/0.34 aUa = X0). % 0.12/0.34 cnf(a1, assumption, % 0.12/0.34 a = X1). % 0.12/0.34 cnf(c3, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.34 cnf(c4, plain, % 0.12/0.34 ~subset(X0,X1) | ~subset(X1,X0), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.34 % 0.12/0.34 cnf(c5, axiom, % 0.12/0.34 subset(X2,X3) | ~member(member_of_1_not_of_2(X2,X3),X3)). % 0.12/0.34 cnf(a2, assumption, % 0.12/0.34 X0 = X2). % 0.12/0.34 cnf(a3, assumption, % 0.12/0.34 X1 = X3). % 0.12/0.34 cnf(c6, plain, % 0.12/0.34 ~subset(X1,X0), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.34 cnf(c7, plain, % 0.12/0.34 ~member(member_of_1_not_of_2(X2,X3),X3), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.34 % 0.12/0.34 cnf(c8, axiom, % 0.12/0.34 member(X4,X5) | member(X4,X6) | ~member(X4,X7) | ~union(X6,X5,X7)). % 0.12/0.34 cnf(a4, assumption, % 0.12/0.34 member_of_1_not_of_2(X2,X3) = X4). % 0.12/0.34 cnf(a5, assumption, % 0.12/0.34 X3 = X5). % 0.12/0.34 cnf(c9, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.12/0.34 cnf(c10, plain, % 0.12/0.34 member(X4,X6) | ~member(X4,X7) | ~union(X6,X5,X7), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.12/0.34 % 0.12/0.34 cnf(c11, plain, % 0.12/0.34 ~member(member_of_1_not_of_2(X2,X3),X3)). % 0.12/0.34 cnf(a6, assumption, % 0.12/0.34 X4 = member_of_1_not_of_2(X2,X3)). % 0.12/0.34 cnf(a7, assumption, % 0.12/0.34 X6 = X3). % 0.12/0.34 cnf(c12, plain, % 0.12/0.34 ~member(X4,X7) | ~union(X6,X5,X7), % 0.12/0.34 inference(predicate_reduction, [assumptions([a6, a7])], [c10, c11])). % 0.12/0.34 % 0.12/0.34 cnf(c13, axiom, % 0.12/0.34 member(member_of_1_not_of_2(X8,X9),X8) | subset(X8,X9)). % 0.12/0.34 cnf(a8, assumption, % 0.12/0.34 X4 = member_of_1_not_of_2(X8,X9)). % 0.12/0.34 cnf(a9, assumption, % 0.12/0.34 X7 = X8). % 0.12/0.34 cnf(c14, plain, % 0.12/0.34 ~union(X6,X5,X7), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c13])). % 0.12/0.34 cnf(c15, plain, % 0.12/0.34 subset(X8,X9), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c13])). % 0.12/0.34 % 0.12/0.34 cnf(c16, plain, % 0.12/0.34 ~subset(X0,X1)). % 0.12/0.34 cnf(a10, assumption, % 0.12/0.34 X8 = X0). % 0.12/0.34 cnf(a11, assumption, % 0.12/0.34 X9 = X1). % 0.12/0.34 cnf(c17, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [assumptions([a10, a11])], [c15, c16])). % 0.12/0.34 % 0.12/0.34 cnf(c18, axiom, % 0.12/0.34 union(a,a,aUa)). % 0.12/0.34 cnf(a12, assumption, % 0.12/0.34 X6 = a). % 0.12/0.34 cnf(a13, assumption, % 0.12/0.34 X5 = a). % 0.12/0.34 cnf(a14, assumption, % 0.12/0.34 X7 = aUa). % 0.12/0.34 cnf(c19, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c14, c18])). % 0.12/0.34 cnf(c20, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c14, c18])). % 0.12/0.34 % 0.12/0.34 cnf(c21, axiom, % 0.12/0.34 subset(X10,X11) | ~member(member_of_1_not_of_2(X10,X11),X11)). % 0.12/0.34 cnf(a15, assumption, % 0.12/0.34 X1 = X10). % 0.12/0.34 cnf(a16, assumption, % 0.12/0.34 X0 = X11). % 0.12/0.34 cnf(c22, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a15, a16])], [c6, c21])). % 0.12/0.34 cnf(c23, plain, % 0.12/0.34 ~member(member_of_1_not_of_2(X10,X11),X11), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a15, a16])], [c6, c21])). % 0.12/0.34 % 0.12/0.34 cnf(c24, axiom, % 0.12/0.34 member(X12,X13) | ~member(X12,X14) | ~union(X14,X15,X13)). % 0.12/0.34 cnf(a17, assumption, % 0.12/0.34 member_of_1_not_of_2(X10,X11) = X12). % 0.12/0.34 cnf(a18, assumption, % 0.12/0.34 X11 = X13). % 0.12/0.34 cnf(c25, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a17, a18])], [c23, c24])). % 0.12/0.34 cnf(c26, plain, % 0.12/0.34 ~member(X12,X14) | ~union(X14,X15,X13), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a17, a18])], [c23, c24])). % 0.12/0.34 % 0.12/0.34 cnf(c27, axiom, % 0.12/0.34 member(member_of_1_not_of_2(X16,X17),X16) | subset(X16,X17)). % 0.12/0.34 cnf(a19, assumption, % 0.12/0.34 X12 = member_of_1_not_of_2(X16,X17)). % 0.12/0.34 cnf(a20, assumption, % 0.12/0.34 X14 = X16). % 0.12/0.34 cnf(c28, plain, % 0.12/0.34 ~union(X14,X15,X13), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a19, a20])], [c26, c27])). % 0.12/0.34 cnf(c29, plain, % 0.12/0.34 subset(X16,X17), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a19, a20])], [c26, c27])). % 0.12/0.34 % 0.12/0.34 cnf(c30, plain, % 0.12/0.34 ~subset(X1,X0)). % 0.12/0.34 cnf(a21, assumption, % 0.12/0.34 X16 = X1). % 0.12/0.34 cnf(a22, assumption, % 0.12/0.34 X17 = X0). % 0.12/0.34 cnf(c31, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [assumptions([a21, a22])], [c29, c30])). % 0.12/0.34 % 0.12/0.34 cnf(c32, plain, % 0.12/0.34 union(X6,X5,X7)). % 0.12/0.34 cnf(a23, assumption, % 0.12/0.34 X14 = X6). % 0.12/0.34 cnf(a24, assumption, % 0.12/0.34 X15 = X5). % 0.12/0.34 cnf(a25, assumption, % 0.12/0.34 X13 = X7). % 0.12/0.34 cnf(c33, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [assumptions([a23, a24, a25])], [c28, c32])). % 0.12/0.34 % 0.12/0.34 cnf(c34, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(constraint_solving, [ % 0.12/0.34 bind(X0, aUa), % 0.12/0.34 bind(X1, a), % 0.12/0.34 bind(X2, aUa), % 0.12/0.34 bind(X3, a), % 0.12/0.34 bind(X4, member_of_1_not_of_2(X2,X3)), % 0.12/0.34 bind(X5, a), % 0.12/0.34 bind(X6, a), % 0.12/0.34 bind(X7, aUa), % 0.12/0.34 bind(X8, aUa), % 0.12/0.34 bind(X9, a), % 0.12/0.34 bind(X10, a), % 0.12/0.34 bind(X11, aUa), % 0.12/0.34 bind(X12, member_of_1_not_of_2(X10,X11)), % 0.12/0.34 bind(X13, aUa), % 0.12/0.34 bind(X14, a), % 0.12/0.34 bind(X15, a), % 0.12/0.34 bind(X16, a), % 0.12/0.34 bind(X17, aUa) % 0.12/0.34 ], % 0.12/0.34 [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])). % 0.12/0.34 % 0.12/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------