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