%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU172+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 : n032.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:45 EDT 2022 % Result : Theorem 0.08s 0.29s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.08 % Problem : SEU172+1 : TPTP v8.1.0. Released v3.3.0. % 0.00/0.09 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.08/0.27 % Computer : n032.cluster.edu % 0.08/0.27 % Model : x86_64 x86_64 % 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.27 % Memory : 8042.1875MB % 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.27 % CPULimit : 300 % 0.08/0.27 % WCLimit : 600 % 0.08/0.27 % DateTime : Mon Jun 20 01:26:18 EDT 2022 % 0.08/0.27 % CPUTime : % 0.08/0.29 % SZS status Theorem % 0.08/0.29 % SZS output begin IncompleteProof % 0.08/0.29 cnf(c0, axiom, % 0.08/0.29 element(sK9,powerset(sK7))). % 0.08/0.29 cnf(c1, plain, % 0.08/0.29 element(sK9,powerset(sK7)), % 0.08/0.29 inference(start, [], [c0])). % 0.08/0.29 % 0.08/0.29 cnf(c2, axiom, % 0.08/0.29 subset_complement(X0,X1) = set_difference(X0,X1) | ~element(X1,powerset(X0))). % 0.08/0.29 cnf(a0, assumption, % 0.08/0.29 sK9 = X1). % 0.08/0.29 cnf(a1, assumption, % 0.08/0.29 powerset(sK7) = powerset(X0)). % 0.08/0.29 cnf(c3, plain, % 0.08/0.29 $false, % 0.08/0.29 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.08/0.29 cnf(c4, plain, % 0.08/0.29 subset_complement(X0,X1) = set_difference(X0,X1), % 0.08/0.29 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.08/0.29 % 0.08/0.29 cnf(c5, axiom, % 0.08/0.29 in(sK8,subset_complement(sK7,sK9))). % 0.08/0.29 cnf(a2, assumption, % 0.08/0.29 subset_complement(sK7,sK9) = subset_complement(X0,X1)). % 0.08/0.29 cnf(a3, assumption, % 0.08/0.29 set_difference(X0,X1) = X2). % 0.08/0.29 cnf(c6, plain, % 0.08/0.29 $false, % 0.08/0.29 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 0.08/0.29 cnf(c7, plain, % 0.08/0.29 $false, % 0.08/0.29 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 0.08/0.29 cnf(c8, plain, % 0.08/0.29 in(sK8,X2), % 0.08/0.29 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])). % 0.08/0.29 % 0.08/0.29 cnf(c9, axiom, % 0.08/0.29 sP0(X3,X4,X5) | ~in(X4,X6) | ~sP1(X5,X3,X6)). % 0.08/0.29 cnf(a4, assumption, % 0.08/0.29 sK8 = X4). % 0.08/0.29 cnf(a5, assumption, % 0.08/0.29 X2 = X6). % 0.08/0.29 cnf(c10, plain, % 0.08/0.29 $false, % 0.08/0.29 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c9])). % 0.08/0.29 cnf(c11, plain, % 0.08/0.29 sP0(X3,X4,X5) | ~sP1(X5,X3,X6), % 0.08/0.29 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c9])). % 0.08/0.29 % 0.08/0.29 cnf(c12, axiom, % 0.08/0.29 ~in(X7,X8) | ~sP0(X8,X7,X9)). % 0.08/0.29 cnf(a6, assumption, % 0.08/0.29 X3 = X8). % 0.08/0.29 cnf(a7, assumption, % 0.08/0.29 X4 = X7). % 0.08/0.29 cnf(a8, assumption, % 0.08/0.29 X5 = X9). % 0.08/0.29 cnf(c13, plain, % 0.08/0.29 ~sP1(X5,X3,X6), % 0.08/0.29 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c11, c12])). % 0.08/0.29 cnf(c14, plain, % 0.08/0.29 ~in(X7,X8), % 0.08/0.29 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c11, c12])). % 0.08/0.29 % 0.08/0.29 cnf(c15, axiom, % 0.08/0.29 in(sK8,sK9)). % 0.08/0.29 cnf(a9, assumption, % 0.08/0.29 X7 = sK8). % 0.08/0.29 cnf(a10, assumption, % 0.08/0.29 X8 = sK9). % 0.08/0.29 cnf(c16, plain, % 0.08/0.29 $false, % 0.08/0.29 inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c15])). % 0.08/0.29 cnf(c17, plain, % 0.08/0.29 $false, % 0.08/0.29 inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c15])). % 0.08/0.29 % 0.08/0.29 cnf(c18, axiom, % 0.08/0.29 sP1(X10,X11,set_difference(X10,X11))). % 0.08/0.29 cnf(a11, assumption, % 0.08/0.29 X5 = X10). % 0.08/0.29 cnf(a12, assumption, % 0.08/0.29 X3 = X11). % 0.08/0.29 cnf(a13, assumption, % 0.08/0.29 X6 = set_difference(X10,X11)). % 0.08/0.29 cnf(c19, plain, % 0.08/0.29 $false, % 0.08/0.29 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c13, c18])). % 0.08/0.29 cnf(c20, plain, % 0.08/0.29 $false, % 0.08/0.29 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c13, c18])). % 0.08/0.29 % 0.08/0.29 cnf(c21, plain, % 0.08/0.29 $false, % 0.08/0.29 inference(constraint_solving, [ % 0.08/0.29 bind(X0, sK7), % 0.08/0.29 bind(X1, sK9), % 0.08/0.29 bind(X2, set_difference(X0,X1)), % 0.08/0.29 bind(X3, sK9), % 0.08/0.29 bind(X4, sK8), % 0.08/0.29 bind(X5, sK7), % 0.08/0.29 bind(X6, set_difference(X0,X1)), % 0.08/0.29 bind(X7, sK8), % 0.08/0.29 bind(X8, sK9), % 0.08/0.29 bind(X9, sK7), % 0.08/0.29 bind(X10, sK7), % 0.08/0.29 bind(X11, sK9) % 0.08/0.29 ], % 0.08/0.29 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])). % 0.08/0.29 % 0.08/0.29 % SZS output end IncompleteProof %------------------------------------------------------------------------------