%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU144+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:27 EDT 2022 % Result : Theorem 0.21s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEU144+1 : TPTP v8.1.0. Released v3.3.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n010.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 06:02:07 EDT 2022 % 0.12/0.34 % CPUTime : % 0.21/0.40 % SZS status Theorem % 0.21/0.40 % SZS output begin IncompleteProof % 0.21/0.40 cnf(c0, axiom, % 0.21/0.40 in(sK3,sK4) | subset(singleton(sK3),sK4)). % 0.21/0.40 cnf(c1, plain, % 0.21/0.40 in(sK3,sK4) | subset(singleton(sK3),sK4), % 0.21/0.40 inference(start, [], [c0])). % 0.21/0.40 % 0.21/0.40 cnf(c2, axiom, % 0.21/0.40 ~in(sK3,sK4) | ~subset(singleton(sK3),sK4)). % 0.21/0.40 cnf(a0, assumption, % 0.21/0.40 sK3 = sK3). % 0.21/0.40 cnf(a1, assumption, % 0.21/0.40 sK4 = sK4). % 0.21/0.40 cnf(c3, plain, % 0.21/0.40 subset(singleton(sK3),sK4), % 0.21/0.40 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.40 cnf(c4, plain, % 0.21/0.40 ~subset(singleton(sK3),sK4), % 0.21/0.40 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.40 % 0.21/0.40 cnf(c5, axiom, % 0.21/0.40 subset(X0,X1) | in(sK2(X0,X1),X0)). % 0.21/0.40 cnf(a2, assumption, % 0.21/0.40 singleton(sK3) = X0). % 0.21/0.40 cnf(a3, assumption, % 0.21/0.40 sK4 = X1). % 0.21/0.40 cnf(c6, plain, % 0.21/0.40 $false, % 0.21/0.40 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.21/0.40 cnf(c7, plain, % 0.21/0.40 in(sK2(X0,X1),X0), % 0.21/0.40 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.21/0.40 % 0.21/0.40 cnf(c8, axiom, % 0.21/0.40 X2 = X3 | ~in(X3,X4) | ~sP0(X2,X4)). % 0.21/0.40 cnf(a4, assumption, % 0.21/0.40 sK2(X0,X1) = X3). % 0.21/0.40 cnf(a5, assumption, % 0.21/0.40 X0 = X4). % 0.21/0.40 cnf(c9, plain, % 0.21/0.40 $false, % 0.21/0.40 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.21/0.40 cnf(c10, plain, % 0.21/0.40 X2 = X3 | ~sP0(X2,X4), % 0.21/0.40 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.21/0.40 % 0.21/0.40 cnf(c11, axiom, % 0.21/0.40 subset(X5,X6) | ~in(sK2(X5,X6),X6)). % 0.21/0.40 cnf(a6, assumption, % 0.21/0.40 sK2(X5,X6) = X3). % 0.21/0.40 cnf(c12, plain, % 0.21/0.40 ~sP0(X2,X4), % 0.21/0.40 inference(strict_subterm_extension, [assumptions([a6])], [c10, c11])). % 0.21/0.40 cnf(c13, plain, % 0.21/0.40 subset(X5,X6), % 0.21/0.40 inference(strict_subterm_extension, [assumptions([a6])], [c10, c11])). % 0.21/0.40 cnf(c14, plain, % 0.21/0.40 ~in(X2,X6), % 0.21/0.40 inference(strict_subterm_extension, [assumptions([a6])], [c10, c11])). % 0.21/0.40 % 0.21/0.40 cnf(c15, plain, % 0.21/0.40 in(sK3,sK4)). % 0.21/0.40 cnf(a7, assumption, % 0.21/0.40 X2 = sK3). % 0.21/0.40 cnf(a8, assumption, % 0.21/0.40 X6 = sK4). % 0.21/0.40 cnf(c16, plain, % 0.21/0.40 $false, % 0.21/0.40 inference(predicate_reduction, [assumptions([a7, a8])], [c14, c15])). % 0.21/0.40 % 0.21/0.40 cnf(c17, plain, % 0.21/0.40 ~subset(singleton(sK3),sK4)). % 0.21/0.40 cnf(a9, assumption, % 0.21/0.40 X5 = singleton(sK3)). % 0.21/0.40 cnf(a10, assumption, % 0.21/0.40 X6 = sK4). % 0.21/0.40 cnf(c18, plain, % 0.21/0.40 $false, % 0.21/0.40 inference(predicate_reduction, [assumptions([a9, a10])], [c13, c17])). % 0.21/0.40 % 0.21/0.40 cnf(c19, axiom, % 0.21/0.40 sP0(X7,singleton(X7))). % 0.21/0.40 cnf(a11, assumption, % 0.21/0.40 X2 = X7). % 0.21/0.40 cnf(a12, assumption, % 0.21/0.40 X4 = singleton(X7)). % 0.21/0.40 cnf(c20, plain, % 0.21/0.40 $false, % 0.21/0.40 inference(strict_predicate_extension, [assumptions([a11, a12])], [c12, c19])). % 0.21/0.40 cnf(c21, plain, % 0.21/0.40 $false, % 0.21/0.40 inference(strict_predicate_extension, [assumptions([a11, a12])], [c12, c19])). % 0.21/0.40 % 0.21/0.40 cnf(c22, axiom, % 0.21/0.40 in(X8,X9) | ~in(X8,X10) | ~subset(X10,X9)). % 0.21/0.40 cnf(a13, assumption, % 0.21/0.40 singleton(sK3) = X10). % 0.21/0.40 cnf(a14, assumption, % 0.21/0.40 sK4 = X9). % 0.21/0.40 cnf(c23, plain, % 0.21/0.40 $false, % 0.21/0.40 inference(strict_predicate_extension, [assumptions([a13, a14])], [c3, c22])). % 0.21/0.40 cnf(c24, plain, % 0.21/0.40 in(X8,X9) | ~in(X8,X10), % 0.21/0.40 inference(strict_predicate_extension, [assumptions([a13, a14])], [c3, c22])). % 0.21/0.40 % 0.21/0.40 cnf(c25, plain, % 0.21/0.40 ~in(sK3,sK4)). % 0.21/0.40 cnf(a15, assumption, % 0.21/0.40 X8 = sK3). % 0.21/0.40 cnf(a16, assumption, % 0.21/0.40 X9 = sK4). % 0.21/0.40 cnf(c26, plain, % 0.21/0.40 ~in(X8,X10), % 0.21/0.40 inference(predicate_reduction, [assumptions([a15, a16])], [c24, c25])). % 0.21/0.40 % 0.21/0.40 cnf(c27, axiom, % 0.21/0.40 in(X11,X12) | ~sP0(X11,X12)). % 0.21/0.40 cnf(a17, assumption, % 0.21/0.40 X8 = X11). % 0.21/0.40 cnf(a18, assumption, % 0.21/0.40 X10 = X12). % 0.21/0.40 cnf(c28, plain, % 0.21/0.40 $false, % 0.21/0.40 inference(strict_predicate_extension, [assumptions([a17, a18])], [c26, c27])). % 0.21/0.40 cnf(c29, plain, % 0.21/0.40 ~sP0(X11,X12), % 0.21/0.40 inference(strict_predicate_extension, [assumptions([a17, a18])], [c26, c27])). % 0.21/0.40 % 0.21/0.40 cnf(c30, plain, % 0.21/0.40 sP0(X2,X4)). % 0.21/0.40 cnf(a19, assumption, % 0.21/0.40 X11 = X2). % 0.21/0.40 cnf(a20, assumption, % 0.21/0.40 X12 = X4). % 0.21/0.40 cnf(c31, plain, % 0.21/0.40 $false, % 0.21/0.40 inference(predicate_reduction, [assumptions([a19, a20])], [c29, c30])). % 0.21/0.40 % 0.21/0.40 cnf(c32, plain, % 0.21/0.40 $false, % 0.21/0.40 inference(constraint_solving, [ % 0.21/0.40 bind(X0, singleton(sK3)), % 0.21/0.40 bind(X1, sK4), % 0.21/0.40 bind(X2, sK3), % 0.21/0.40 bind(X3, sK2(X0,X1)), % 0.21/0.40 bind(X4, singleton(sK3)), % 0.21/0.40 bind(X5, singleton(sK3)), % 0.21/0.40 bind(X6, sK4), % 0.21/0.40 bind(X7, sK3), % 0.21/0.40 bind(X8, sK3), % 0.21/0.40 bind(X9, sK4), % 0.21/0.40 bind(X10, singleton(sK3)), % 0.21/0.40 bind(X11, sK3), % 0.21/0.40 bind(X12, singleton(sK3)) % 0.21/0.40 ], % 0.21/0.40 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])). % 0.21/0.40 % 0.21/0.40 % SZS output end IncompleteProof %------------------------------------------------------------------------------