%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET603+4 : 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 : n015.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:46:55 EDT 2022 % Result : Theorem 8.00s 1.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : SET603+4 : TPTP v8.1.0. Released v2.2.0. % 0.08/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n015.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sun Jul 10 20:39:38 EDT 2022 % 0.13/0.34 % CPUTime : % 8.00/1.40 % SZS status Theorem % 8.00/1.40 % SZS output begin IncompleteProof % 8.00/1.40 cnf(c0, axiom, % 8.00/1.40 ~equal_set(difference(sK3,empty_set),sK3)). % 8.00/1.40 cnf(c1, plain, % 8.00/1.40 ~equal_set(difference(sK3,empty_set),sK3), % 8.00/1.40 inference(start, [], [c0])). % 8.00/1.40 % 8.00/1.40 cnf(c2, axiom, % 8.00/1.40 equal_set(X0,X1) | ~subset(X1,X0) | ~subset(X0,X1)). % 8.00/1.40 cnf(a0, assumption, % 8.00/1.40 difference(sK3,empty_set) = X0). % 8.00/1.40 cnf(a1, assumption, % 8.00/1.40 sK3 = X1). % 8.00/1.40 cnf(c3, plain, % 8.00/1.40 $false, % 8.00/1.40 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 8.00/1.40 cnf(c4, plain, % 8.00/1.40 ~subset(X1,X0) | ~subset(X0,X1), % 8.00/1.40 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 8.00/1.40 % 8.00/1.40 cnf(c5, axiom, % 8.00/1.40 subset(X2,X3) | ~member(sK0(X2,X3),X3)). % 8.00/1.40 cnf(a2, assumption, % 8.00/1.40 X1 = X2). % 8.00/1.40 cnf(a3, assumption, % 8.00/1.40 X0 = X3). % 8.00/1.40 cnf(c6, plain, % 8.00/1.40 ~subset(X0,X1), % 8.00/1.40 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 8.00/1.40 cnf(c7, plain, % 8.00/1.40 ~member(sK0(X2,X3),X3), % 8.00/1.40 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 8.00/1.40 % 8.00/1.40 cnf(c8, axiom, % 8.00/1.40 member(X4,difference(X5,X6)) | member(X4,X6) | ~member(X4,X5)). % 8.00/1.40 cnf(a4, assumption, % 8.00/1.40 sK0(X2,X3) = X4). % 8.00/1.40 cnf(a5, assumption, % 8.00/1.40 X3 = difference(X5,X6)). % 8.00/1.40 cnf(c9, plain, % 8.00/1.40 $false, % 8.00/1.40 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 8.00/1.40 cnf(c10, plain, % 8.00/1.40 member(X4,X6) | ~member(X4,X5), % 8.00/1.40 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 8.00/1.40 % 8.00/1.40 cnf(c11, axiom, % 8.00/1.40 ~member(X7,empty_set)). % 8.00/1.40 cnf(a6, assumption, % 8.00/1.40 X4 = X7). % 8.00/1.40 cnf(a7, assumption, % 8.00/1.40 X6 = empty_set). % 8.00/1.40 cnf(c12, plain, % 8.00/1.40 ~member(X4,X5), % 8.00/1.40 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 8.00/1.40 cnf(c13, plain, % 8.00/1.40 $false, % 8.00/1.40 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 8.00/1.40 % 8.00/1.40 cnf(c14, axiom, % 8.00/1.40 subset(X8,X9) | member(sK0(X8,X9),X8)). % 8.00/1.40 cnf(a8, assumption, % 8.00/1.40 X4 = sK0(X8,X9)). % 8.00/1.40 cnf(a9, assumption, % 8.00/1.40 X5 = X8). % 8.00/1.40 cnf(c15, plain, % 8.00/1.40 $false, % 8.00/1.40 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 8.00/1.40 cnf(c16, plain, % 8.00/1.40 subset(X8,X9), % 8.00/1.40 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 8.00/1.40 % 8.00/1.40 cnf(c17, plain, % 8.00/1.40 ~subset(X1,X0)). % 8.00/1.40 cnf(a10, assumption, % 8.00/1.40 X8 = X1). % 8.00/1.40 cnf(a11, assumption, % 8.00/1.40 X9 = X0). % 8.00/1.40 cnf(c18, plain, % 8.00/1.40 $false, % 8.00/1.40 inference(predicate_reduction, [assumptions([a10, a11])], [c16, c17])). % 8.00/1.40 % 8.00/1.40 cnf(c19, axiom, % 8.00/1.40 subset(X10,X11) | ~member(sK0(X10,X11),X11)). % 8.00/1.40 cnf(a12, assumption, % 8.00/1.40 X0 = X10). % 8.00/1.40 cnf(a13, assumption, % 8.00/1.40 X1 = X11). % 8.00/1.40 cnf(c20, plain, % 8.00/1.40 $false, % 8.00/1.40 inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c19])). % 8.00/1.40 cnf(c21, plain, % 8.00/1.40 ~member(sK0(X10,X11),X11), % 8.00/1.40 inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c19])). % 8.00/1.40 % 8.00/1.40 cnf(c22, axiom, % 8.00/1.40 member(X12,X13) | ~member(X12,difference(X13,X14))). % 8.00/1.40 cnf(a14, assumption, % 8.00/1.40 sK0(X10,X11) = X12). % 8.00/1.40 cnf(a15, assumption, % 8.00/1.40 X11 = X13). % 8.00/1.40 cnf(c23, plain, % 8.00/1.40 $false, % 8.00/1.40 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c22])). % 8.00/1.40 cnf(c24, plain, % 8.00/1.40 ~member(X12,difference(X13,X14)), % 8.00/1.40 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c22])). % 8.00/1.40 % 8.00/1.40 cnf(c25, axiom, % 8.00/1.40 subset(X15,X16) | member(sK0(X15,X16),X15)). % 8.00/1.40 cnf(a16, assumption, % 8.00/1.40 X12 = sK0(X15,X16)). % 8.00/1.40 cnf(a17, assumption, % 8.00/1.40 difference(X13,X14) = X15). % 8.00/1.40 cnf(c26, plain, % 8.00/1.40 $false, % 8.00/1.40 inference(strict_predicate_extension, [assumptions([a16, a17])], [c24, c25])). % 8.00/1.40 cnf(c27, plain, % 8.00/1.40 subset(X15,X16), % 8.00/1.40 inference(strict_predicate_extension, [assumptions([a16, a17])], [c24, c25])). % 8.00/1.40 % 8.00/1.40 cnf(c28, plain, % 8.00/1.40 ~subset(X0,X1)). % 8.00/1.40 cnf(a18, assumption, % 8.00/1.40 X15 = X0). % 8.00/1.40 cnf(a19, assumption, % 8.00/1.40 X16 = X1). % 8.00/1.40 cnf(c29, plain, % 8.00/1.40 $false, % 8.00/1.40 inference(predicate_reduction, [assumptions([a18, a19])], [c27, c28])). % 8.00/1.40 % 8.00/1.40 cnf(c30, plain, % 8.00/1.40 $false, % 8.00/1.40 inference(constraint_solving, [ % 8.00/1.40 bind(X0, difference(sK3,empty_set)), % 8.00/1.40 bind(X1, sK3), % 8.00/1.40 bind(X2, sK3), % 8.00/1.40 bind(X3, difference(sK3,empty_set)), % 8.00/1.40 bind(X4, sK0(X2,X3)), % 8.00/1.40 bind(X5, sK3), % 8.00/1.40 bind(X6, empty_set), % 8.00/1.40 bind(X7, sK0(X2,X3)), % 8.00/1.40 bind(X8, sK3), % 8.00/1.40 bind(X9, difference(sK3,empty_set)), % 8.00/1.40 bind(X10, difference(sK3,empty_set)), % 8.00/1.40 bind(X11, sK3), % 8.00/1.40 bind(X12, sK0(X10,X11)), % 8.00/1.40 bind(X13, sK3), % 8.00/1.40 bind(X14, empty_set), % 8.00/1.40 bind(X15, difference(sK3,empty_set)), % 8.00/1.40 bind(X16, sK3) % 8.00/1.40 ], % 8.00/1.40 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])). % 8.00/1.40 % 8.00/1.40 % SZS output end IncompleteProof %------------------------------------------------------------------------------