%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU134+2 : 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 : n005.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:22 EDT 2022 % Result : Theorem 1.71s 0.60s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SEU134+2 : TPTP v8.1.0. Released v3.3.0. % 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n005.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 : Sun Jun 19 07:38:53 EDT 2022 % 0.12/0.33 % CPUTime : % 1.71/0.60 % SZS status Theorem % 1.71/0.60 % SZS output begin IncompleteProof % 1.71/0.60 cnf(c0, axiom, % 1.71/0.60 subset(sK14,sK15) | empty_set = set_difference(sK14,sK15)). % 1.71/0.60 cnf(c1, plain, % 1.71/0.60 subset(sK14,sK15) | empty_set = set_difference(sK14,sK15), % 1.71/0.60 inference(start, [], [c0])). % 1.71/0.60 % 1.71/0.60 cnf(c2, axiom, % 1.71/0.60 empty_set = set_difference(X0,X1) | ~subset(X0,X1)). % 1.71/0.60 cnf(a0, assumption, % 1.71/0.60 sK14 = X0). % 1.71/0.60 cnf(a1, assumption, % 1.71/0.60 sK15 = X1). % 1.71/0.60 cnf(c3, plain, % 1.71/0.60 empty_set = set_difference(sK14,sK15), % 1.71/0.60 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 1.71/0.60 cnf(c4, plain, % 1.71/0.60 empty_set = set_difference(X0,X1), % 1.71/0.60 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 1.71/0.60 % 1.71/0.60 cnf(c5, axiom, % 1.71/0.60 ~subset(sK14,sK15) | empty_set != set_difference(sK14,sK15)). % 1.71/0.60 cnf(a2, assumption, % 1.71/0.60 set_difference(sK14,sK15) = set_difference(X0,X1)). % 1.71/0.60 cnf(a3, assumption, % 1.71/0.60 empty_set = X2). % 1.71/0.60 cnf(c6, plain, % 1.71/0.60 $false, % 1.71/0.60 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 1.71/0.60 cnf(c7, plain, % 1.71/0.60 ~subset(sK14,sK15), % 1.71/0.60 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 1.71/0.60 cnf(c8, plain, % 1.71/0.60 empty_set != X2, % 1.71/0.60 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 1.71/0.60 % 1.71/0.60 cnf(a4, assumption, % 1.71/0.60 empty_set = X2). % 1.71/0.60 cnf(c9, plain, % 1.71/0.60 $false, % 1.71/0.60 inference(reflexivity, [assumptions([a4])], [c8])). % 1.71/0.60 % 1.71/0.60 cnf(c10, plain, % 1.71/0.60 subset(sK14,sK15)). % 1.71/0.60 cnf(a5, assumption, % 1.71/0.60 sK14 = sK14). % 1.71/0.60 cnf(a6, assumption, % 1.71/0.60 sK15 = sK15). % 1.71/0.60 cnf(c11, plain, % 1.71/0.60 $false, % 1.71/0.60 inference(predicate_reduction, [assumptions([a5, a6])], [c7, c10])). % 1.71/0.60 % 1.71/0.60 cnf(c12, axiom, % 1.71/0.60 subset(X3,X4) | empty_set != set_difference(X3,X4)). % 1.71/0.60 cnf(a7, assumption, % 1.71/0.60 set_difference(X3,X4) = set_difference(sK14,sK15)). % 1.71/0.60 cnf(a8, assumption, % 1.71/0.60 empty_set = X5). % 1.71/0.60 cnf(c13, plain, % 1.71/0.60 $false, % 1.71/0.60 inference(strict_subterm_extension, [assumptions([a7, a8])], [c3, c12])). % 1.71/0.60 cnf(c14, plain, % 1.71/0.60 subset(X3,X4), % 1.71/0.60 inference(strict_subterm_extension, [assumptions([a7, a8])], [c3, c12])). % 1.71/0.60 cnf(c15, plain, % 1.71/0.60 empty_set != X5, % 1.71/0.60 inference(strict_subterm_extension, [assumptions([a7, a8])], [c3, c12])). % 1.71/0.60 % 1.71/0.60 cnf(a9, assumption, % 1.71/0.60 empty_set = X5). % 1.71/0.60 cnf(c16, plain, % 1.71/0.60 $false, % 1.71/0.60 inference(reflexivity, [assumptions([a9])], [c15])). % 1.71/0.60 % 1.71/0.60 cnf(c17, plain, % 1.71/0.60 ~subset(sK14,sK15)). % 1.71/0.60 cnf(a10, assumption, % 1.71/0.60 X3 = sK14). % 1.71/0.60 cnf(a11, assumption, % 1.71/0.60 X4 = sK15). % 1.71/0.60 cnf(c18, plain, % 1.71/0.60 $false, % 1.71/0.60 inference(predicate_reduction, [assumptions([a10, a11])], [c14, c17])). % 1.71/0.60 % 1.71/0.60 cnf(c19, plain, % 1.71/0.60 $false, % 1.71/0.60 inference(constraint_solving, [ % 1.71/0.60 bind(X0, sK14), % 1.71/0.60 bind(X1, sK15), % 1.71/0.60 bind(X2, empty_set), % 1.71/0.60 bind(X3, sK14), % 1.71/0.60 bind(X4, sK15), % 1.71/0.60 bind(X5, empty_set) % 1.71/0.60 ], % 1.71/0.60 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 1.71/0.60 % 1.71/0.60 % SZS output end IncompleteProof %------------------------------------------------------------------------------