%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM532+1 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n026.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 : Mon Jul 18 11:33:45 EDT 2022 % Result : Theorem 0.12s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : NUM532+1 : TPTP v8.1.0. Released v4.0.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 : n026.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 : Tue Jul 5 08:27:22 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 % SZS status Theorem % 0.12/0.34 % SZS output begin IncompleteProof % 0.12/0.34 cnf(c0, axiom, % 0.12/0.34 ~aSubsetOf0(xA,xA)). % 0.12/0.34 cnf(c1, plain, % 0.12/0.34 ~aSubsetOf0(xA,xA), % 0.12/0.34 inference(start, [], [c0])). % 0.12/0.34 % 0.12/0.34 cnf(c2, axiom, % 0.12/0.34 aSubsetOf0(X0,X1) | ~sP0(X1,X0) | ~sP1(X1)). % 0.12/0.34 cnf(a0, assumption, % 0.12/0.34 xA = X0). % 0.12/0.34 cnf(a1, assumption, % 0.12/0.34 xA = X1). % 0.12/0.34 cnf(c3, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.34 cnf(c4, plain, % 0.12/0.34 ~sP0(X1,X0) | ~sP1(X1), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.34 % 0.12/0.34 cnf(c5, axiom, % 0.12/0.34 sP0(X2,X3) | aElementOf0(sK3(X2,X3),X3) | ~aSet0(X3)). % 0.12/0.34 cnf(a2, assumption, % 0.12/0.34 X1 = X2). % 0.12/0.34 cnf(a3, assumption, % 0.12/0.34 X0 = X3). % 0.12/0.34 cnf(c6, plain, % 0.12/0.34 ~sP1(X1), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.34 cnf(c7, plain, % 0.12/0.34 aElementOf0(sK3(X2,X3),X3) | ~aSet0(X3), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.34 % 0.12/0.34 cnf(c8, axiom, % 0.12/0.34 sP0(X4,X5) | ~aElementOf0(sK3(X4,X5),X4) | ~aSet0(X5)). % 0.12/0.34 cnf(a4, assumption, % 0.12/0.34 sK3(X2,X3) = sK3(X4,X5)). % 0.12/0.34 cnf(a5, assumption, % 0.12/0.34 X3 = X4). % 0.12/0.34 cnf(c9, plain, % 0.12/0.34 ~aSet0(X3), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.12/0.34 cnf(c10, plain, % 0.12/0.34 sP0(X4,X5) | ~aSet0(X5), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.12/0.34 % 0.12/0.34 cnf(c11, plain, % 0.12/0.34 ~sP0(X1,X0)). % 0.12/0.34 cnf(a6, assumption, % 0.12/0.34 X4 = X1). % 0.12/0.34 cnf(a7, assumption, % 0.12/0.34 X5 = X0). % 0.12/0.34 cnf(c12, plain, % 0.12/0.34 ~aSet0(X5), % 0.12/0.34 inference(predicate_reduction, [assumptions([a6, a7])], [c10, c11])). % 0.12/0.34 % 0.12/0.34 cnf(c13, axiom, % 0.12/0.34 aSet0(xA)). % 0.12/0.34 cnf(a8, assumption, % 0.12/0.34 X5 = xA). % 0.12/0.34 cnf(c14, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a8])], [c12, c13])). % 0.12/0.34 cnf(c15, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a8])], [c12, c13])). % 0.12/0.34 % 0.12/0.34 cnf(c16, plain, % 0.12/0.34 aSet0(X5)). % 0.12/0.34 cnf(a9, assumption, % 0.12/0.34 X3 = X5). % 0.12/0.34 cnf(c17, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [assumptions([a9])], [c9, c16])). % 0.12/0.34 % 0.12/0.34 cnf(c18, axiom, % 0.12/0.34 sP1(X6) | ~aSet0(X6)). % 0.12/0.34 cnf(a10, assumption, % 0.12/0.34 X1 = X6). % 0.12/0.34 cnf(c19, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a10])], [c6, c18])). % 0.12/0.34 cnf(c20, plain, % 0.12/0.34 ~aSet0(X6), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a10])], [c6, c18])). % 0.12/0.34 % 0.12/0.34 cnf(c21, plain, % 0.12/0.34 aSet0(X5)). % 0.12/0.34 cnf(a11, assumption, % 0.12/0.34 X6 = X5). % 0.12/0.34 cnf(c22, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [assumptions([a11])], [c20, c21])). % 0.12/0.34 % 0.12/0.34 cnf(c23, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(constraint_solving, [ % 0.12/0.34 bind(X0, xA), % 0.12/0.34 bind(X1, xA), % 0.12/0.34 bind(X2, xA), % 0.12/0.34 bind(X3, xA), % 0.12/0.34 bind(X4, xA), % 0.12/0.34 bind(X5, xA), % 0.12/0.34 bind(X6, xA) % 0.12/0.34 ], % 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.12/0.34 % 0.12/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------