%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET602+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 : n004.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 0.20s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET602+4 : TPTP v8.1.0. Released v2.2.0. % 0.13/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n004.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 : Sat Jul 9 20:13:22 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.37 % SZS status Theorem % 0.20/0.37 % SZS output begin IncompleteProof % 0.20/0.37 cnf(c0, axiom, % 0.20/0.37 ~equal_set(difference(sK3,sK3),empty_set)). % 0.20/0.37 cnf(c1, plain, % 0.20/0.37 ~equal_set(difference(sK3,sK3),empty_set), % 0.20/0.37 inference(start, [], [c0])). % 0.20/0.37 % 0.20/0.37 cnf(c2, axiom, % 0.20/0.37 equal_set(X0,X1) | ~subset(X1,X0) | ~subset(X0,X1)). % 0.20/0.37 cnf(a0, assumption, % 0.20/0.37 difference(sK3,sK3) = X0). % 0.20/0.37 cnf(a1, assumption, % 0.20/0.37 empty_set = X1). % 0.20/0.37 cnf(c3, plain, % 0.20/0.37 $false, % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.37 cnf(c4, plain, % 0.20/0.37 ~subset(X1,X0) | ~subset(X0,X1), % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.37 % 0.20/0.37 cnf(c5, axiom, % 0.20/0.37 subset(X2,X3) | member(sK0(X2,X3),X2)). % 0.20/0.37 cnf(a2, assumption, % 0.20/0.37 X1 = X2). % 0.20/0.37 cnf(a3, assumption, % 0.20/0.37 X0 = X3). % 0.20/0.37 cnf(c6, plain, % 0.20/0.37 ~subset(X0,X1), % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.37 cnf(c7, plain, % 0.20/0.37 member(sK0(X2,X3),X2), % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.37 % 0.20/0.37 cnf(c8, axiom, % 0.20/0.37 ~member(X4,empty_set)). % 0.20/0.37 cnf(a4, assumption, % 0.20/0.37 sK0(X2,X3) = X4). % 0.20/0.37 cnf(a5, assumption, % 0.20/0.37 X2 = empty_set). % 0.20/0.37 cnf(c9, plain, % 0.20/0.37 $false, % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.20/0.37 cnf(c10, plain, % 0.20/0.37 $false, % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.20/0.37 % 0.20/0.37 cnf(c11, axiom, % 0.20/0.37 subset(X5,X6) | member(sK0(X5,X6),X5)). % 0.20/0.37 cnf(a6, assumption, % 0.20/0.37 X0 = X5). % 0.20/0.37 cnf(a7, assumption, % 0.20/0.37 X1 = X6). % 0.20/0.37 cnf(c12, plain, % 0.20/0.37 $false, % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])). % 0.20/0.37 cnf(c13, plain, % 0.20/0.37 member(sK0(X5,X6),X5), % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])). % 0.20/0.37 % 0.20/0.37 cnf(c14, axiom, % 0.20/0.37 member(X7,X8) | ~member(X7,difference(X8,X9))). % 0.20/0.37 cnf(a8, assumption, % 0.20/0.37 sK0(X5,X6) = X7). % 0.20/0.37 cnf(a9, assumption, % 0.20/0.37 X5 = difference(X8,X9)). % 0.20/0.37 cnf(c15, plain, % 0.20/0.37 $false, % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])). % 0.20/0.37 cnf(c16, plain, % 0.20/0.37 member(X7,X8), % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])). % 0.20/0.37 % 0.20/0.37 cnf(c17, axiom, % 0.20/0.37 ~member(X10,X11) | ~member(X10,difference(X12,X11))). % 0.20/0.37 cnf(a10, assumption, % 0.20/0.37 X7 = X10). % 0.20/0.37 cnf(a11, assumption, % 0.20/0.37 X8 = X11). % 0.20/0.37 cnf(c18, plain, % 0.20/0.37 $false, % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 0.20/0.37 cnf(c19, plain, % 0.20/0.37 ~member(X10,difference(X12,X11)), % 0.20/0.37 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 0.20/0.37 % 0.20/0.37 cnf(c20, plain, % 0.20/0.37 member(sK0(X5,X6),X5)). % 0.20/0.37 cnf(a12, assumption, % 0.20/0.37 X10 = sK0(X5,X6)). % 0.20/0.37 cnf(a13, assumption, % 0.20/0.37 difference(X12,X11) = X5). % 0.20/0.37 cnf(c21, plain, % 0.20/0.37 $false, % 0.20/0.37 inference(predicate_reduction, [assumptions([a12, a13])], [c19, c20])). % 0.20/0.37 % 0.20/0.37 cnf(c22, plain, % 0.20/0.37 $false, % 0.20/0.37 inference(constraint_solving, [ % 0.20/0.37 bind(X0, difference(sK3,sK3)), % 0.20/0.37 bind(X1, empty_set), % 0.20/0.37 bind(X2, empty_set), % 0.20/0.37 bind(X3, difference(sK3,sK3)), % 0.20/0.37 bind(X4, sK0(X2,X3)), % 0.20/0.37 bind(X5, difference(sK3,sK3)), % 0.20/0.37 bind(X6, empty_set), % 0.20/0.37 bind(X7, sK0(X5,X6)), % 0.20/0.37 bind(X8, sK3), % 0.20/0.37 bind(X9, sK3), % 0.20/0.37 bind(X10, sK0(X5,X6)), % 0.20/0.37 bind(X11, sK3), % 0.20/0.37 bind(X12, sK3) % 0.20/0.37 ], % 0.20/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])). % 0.20/0.37 % 0.20/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------