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