%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU140+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n010.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 11:53:24 EDT 2022 % Result : Theorem 0.15s 0.33s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.10 % Problem : SEU140+1 : TPTP v8.1.0. Released v3.3.0. % 0.10/0.11 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.11/0.30 % Computer : n010.cluster.edu % 0.11/0.30 % Model : x86_64 x86_64 % 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.30 % Memory : 8042.1875MB % 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.30 % CPULimit : 300 % 0.11/0.30 % WCLimit : 600 % 0.11/0.30 % DateTime : Sun Jun 19 04:54:38 EDT 2022 % 0.11/0.30 % CPUTime : % 0.15/0.33 % SZS status Theorem % 0.15/0.33 % SZS output begin IncompleteProof % 0.15/0.33 cnf(c0, axiom, % 0.15/0.33 disjoint(sK3,sK4)). % 0.15/0.33 cnf(c1, plain, % 0.15/0.33 disjoint(sK3,sK4), % 0.15/0.33 inference(start, [], [c0])). % 0.15/0.33 % 0.15/0.33 cnf(c2, axiom, % 0.15/0.33 set_intersection2(X0,X1) = empty_set | ~disjoint(X0,X1)). % 0.15/0.33 cnf(a0, assumption, % 0.15/0.33 sK3 = X0). % 0.15/0.33 cnf(a1, assumption, % 0.15/0.33 sK4 = X1). % 0.15/0.33 cnf(c3, plain, % 0.15/0.33 $false, % 0.15/0.33 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.15/0.33 cnf(c4, plain, % 0.15/0.33 set_intersection2(X0,X1) = empty_set, % 0.15/0.33 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.15/0.33 % 0.15/0.33 cnf(c5, axiom, % 0.15/0.33 subset(set_intersection2(X2,X3),set_intersection2(X4,X3)) | ~subset(X2,X4)). % 0.15/0.33 cnf(a2, assumption, % 0.15/0.33 set_intersection2(X4,X3) = set_intersection2(X0,X1)). % 0.15/0.33 cnf(a3, assumption, % 0.15/0.33 empty_set = X5). % 0.15/0.33 cnf(c6, plain, % 0.15/0.33 $false, % 0.15/0.33 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 0.15/0.33 cnf(c7, plain, % 0.15/0.33 ~subset(X2,X4), % 0.15/0.33 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 0.15/0.33 cnf(c8, plain, % 0.15/0.33 subset(set_intersection2(X2,X3),X5), % 0.15/0.33 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 0.15/0.33 % 0.15/0.33 cnf(c9, axiom, % 0.15/0.33 empty_set = X6 | ~subset(X6,empty_set)). % 0.15/0.33 cnf(a4, assumption, % 0.15/0.33 set_intersection2(X2,X3) = X6). % 0.15/0.33 cnf(a5, assumption, % 0.15/0.33 X5 = empty_set). % 0.15/0.33 cnf(c10, plain, % 0.15/0.33 $false, % 0.15/0.33 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c9])). % 0.15/0.33 cnf(c11, plain, % 0.15/0.33 empty_set = X6, % 0.15/0.33 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c9])). % 0.15/0.33 % 0.15/0.33 cnf(c12, axiom, % 0.15/0.33 disjoint(X7,X8) | set_intersection2(X7,X8) != empty_set). % 0.15/0.33 cnf(a6, assumption, % 0.15/0.33 set_intersection2(X7,X8) = X6). % 0.15/0.33 cnf(a7, assumption, % 0.15/0.33 empty_set = X9). % 0.15/0.33 cnf(c13, plain, % 0.15/0.33 $false, % 0.15/0.33 inference(strict_subterm_extension, [assumptions([a6, a7])], [c11, c12])). % 0.15/0.33 cnf(c14, plain, % 0.15/0.33 disjoint(X7,X8), % 0.15/0.33 inference(strict_subterm_extension, [assumptions([a6, a7])], [c11, c12])). % 0.15/0.33 cnf(c15, plain, % 0.15/0.33 X9 != empty_set, % 0.15/0.33 inference(strict_subterm_extension, [assumptions([a6, a7])], [c11, c12])). % 0.15/0.33 % 0.15/0.33 cnf(a8, assumption, % 0.15/0.33 X9 = empty_set). % 0.15/0.33 cnf(c16, plain, % 0.15/0.33 $false, % 0.15/0.33 inference(reflexivity, [assumptions([a8])], [c15])). % 0.15/0.33 % 0.15/0.33 cnf(c17, axiom, % 0.15/0.33 ~disjoint(sK2,sK4)). % 0.15/0.33 cnf(a9, assumption, % 0.15/0.33 X7 = sK2). % 0.15/0.33 cnf(a10, assumption, % 0.15/0.33 X8 = sK4). % 0.15/0.33 cnf(c18, plain, % 0.15/0.33 $false, % 0.15/0.33 inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c17])). % 0.15/0.33 cnf(c19, plain, % 0.15/0.33 $false, % 0.15/0.33 inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c17])). % 0.15/0.33 % 0.15/0.33 cnf(c20, axiom, % 0.15/0.33 subset(sK2,sK3)). % 0.15/0.33 cnf(a11, assumption, % 0.15/0.33 X2 = sK2). % 0.15/0.33 cnf(a12, assumption, % 0.15/0.33 X4 = sK3). % 0.15/0.33 cnf(c21, plain, % 0.15/0.33 $false, % 0.15/0.33 inference(strict_predicate_extension, [assumptions([a11, a12])], [c7, c20])). % 0.15/0.33 cnf(c22, plain, % 0.15/0.33 $false, % 0.15/0.33 inference(strict_predicate_extension, [assumptions([a11, a12])], [c7, c20])). % 0.15/0.33 % 0.15/0.33 cnf(c23, plain, % 0.15/0.33 $false, % 0.15/0.33 inference(constraint_solving, [ % 0.15/0.33 bind(X0, sK3), % 0.15/0.33 bind(X1, sK4), % 0.15/0.33 bind(X2, sK2), % 0.15/0.33 bind(X3, sK4), % 0.15/0.33 bind(X4, sK3), % 0.15/0.33 bind(X5, empty_set), % 0.15/0.33 bind(X6, set_intersection2(X2,X3)), % 0.15/0.33 bind(X7, sK2), % 0.15/0.33 bind(X8, sK4), % 0.15/0.33 bind(X9, empty_set) % 0.15/0.33 ], % 0.15/0.33 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])). % 0.15/0.33 % 0.15/0.33 % SZS output end IncompleteProof %------------------------------------------------------------------------------