%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU177+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 : n009.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:48 EDT 2022 % Result : Theorem 4.60s 0.96s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SEU177+1 : TPTP v8.1.0. Released v3.3.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n009.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sun Jun 19 07:04:22 EDT 2022 % 0.13/0.35 % CPUTime : % 4.60/0.96 % SZS status Theorem % 4.60/0.96 % SZS output begin IncompleteProof % 4.60/0.96 cnf(c0, axiom, % 4.60/0.96 relation(sK10)). % 4.60/0.96 cnf(c1, plain, % 4.60/0.96 relation(sK10), % 4.60/0.96 inference(start, [], [c0])). % 4.60/0.96 % 4.60/0.96 cnf(c2, axiom, % 4.60/0.96 sP3(X0) | ~relation(X0)). % 4.60/0.96 cnf(a0, assumption, % 4.60/0.96 sK10 = X0). % 4.60/0.96 cnf(c3, plain, % 4.60/0.96 $false, % 4.60/0.96 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 4.60/0.96 cnf(c4, plain, % 4.60/0.96 sP3(X0), % 4.60/0.96 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 4.60/0.96 % 4.60/0.96 cnf(c5, axiom, % 4.60/0.96 sP2(X1,relation_rng(X1)) | ~sP3(X1)). % 4.60/0.96 cnf(a1, assumption, % 4.60/0.96 X0 = X1). % 4.60/0.96 cnf(c6, plain, % 4.60/0.96 $false, % 4.60/0.96 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 4.60/0.96 cnf(c7, plain, % 4.60/0.96 sP2(X1,relation_rng(X1)), % 4.60/0.96 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 4.60/0.96 % 4.60/0.96 cnf(c8, axiom, % 4.60/0.96 in(X2,X3) | ~in(unordered_pair(unordered_pair(X4,X2),singleton(X4)),X5) | ~sP2(X5,X3)). % 4.60/0.96 cnf(a2, assumption, % 4.60/0.96 X1 = X5). % 4.60/0.96 cnf(a3, assumption, % 4.60/0.96 relation_rng(X1) = X3). % 4.60/0.96 cnf(c9, plain, % 4.60/0.96 $false, % 4.60/0.96 inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])). % 4.60/0.96 cnf(c10, plain, % 4.60/0.96 in(X2,X3) | ~in(unordered_pair(unordered_pair(X4,X2),singleton(X4)),X5), % 4.60/0.96 inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])). % 4.60/0.96 % 4.60/0.96 cnf(c11, axiom, % 4.60/0.96 ~in(sK9,relation_rng(sK10)) | ~in(sK8,relation_dom(sK10))). % 4.60/0.96 cnf(a4, assumption, % 4.60/0.96 X2 = sK9). % 4.60/0.96 cnf(a5, assumption, % 4.60/0.96 X3 = relation_rng(sK10)). % 4.60/0.96 cnf(c12, plain, % 4.60/0.96 ~in(unordered_pair(unordered_pair(X4,X2),singleton(X4)),X5), % 4.60/0.96 inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])). % 4.60/0.96 cnf(c13, plain, % 4.60/0.96 ~in(sK8,relation_dom(sK10)), % 4.60/0.96 inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])). % 4.60/0.96 % 4.60/0.96 cnf(c14, axiom, % 4.60/0.96 in(X6,X7) | ~in(unordered_pair(unordered_pair(X6,X8),singleton(X6)),X9) | ~sP0(X9,X7)). % 4.60/0.96 cnf(a6, assumption, % 4.60/0.96 sK8 = X6). % 4.60/0.96 cnf(a7, assumption, % 4.60/0.96 relation_dom(sK10) = X7). % 4.60/0.96 cnf(c15, plain, % 4.60/0.96 $false, % 4.60/0.96 inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c14])). % 4.60/0.96 cnf(c16, plain, % 4.60/0.96 ~in(unordered_pair(unordered_pair(X6,X8),singleton(X6)),X9) | ~sP0(X9,X7), % 4.60/0.96 inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c14])). % 4.60/0.96 % 4.60/0.96 cnf(c17, axiom, % 4.60/0.96 in(unordered_pair(unordered_pair(sK8,sK9),singleton(sK8)),sK10)). % 4.60/0.96 cnf(a8, assumption, % 4.60/0.96 unordered_pair(unordered_pair(X6,X8),singleton(X6)) = unordered_pair(unordered_pair(sK8,sK9),singleton(sK8))). % 4.60/0.96 cnf(a9, assumption, % 4.60/0.96 X9 = sK10). % 4.60/0.96 cnf(c18, plain, % 4.60/0.96 ~sP0(X9,X7), % 4.60/0.96 inference(strict_predicate_extension, [assumptions([a8, a9])], [c16, c17])). % 4.60/0.96 cnf(c19, plain, % 4.60/0.96 $false, % 4.60/0.96 inference(strict_predicate_extension, [assumptions([a8, a9])], [c16, c17])). % 4.60/0.96 % 4.60/0.96 cnf(c20, axiom, % 4.60/0.96 sP0(X10,relation_dom(X10)) | ~sP1(X10)). % 4.60/0.96 cnf(a10, assumption, % 4.60/0.96 X9 = X10). % 4.60/0.96 cnf(a11, assumption, % 4.60/0.96 X7 = relation_dom(X10)). % 4.60/0.96 cnf(c21, plain, % 4.60/0.96 $false, % 4.60/0.96 inference(strict_predicate_extension, [assumptions([a10, a11])], [c18, c20])). % 4.60/0.96 cnf(c22, plain, % 4.60/0.96 ~sP1(X10), % 4.60/0.96 inference(strict_predicate_extension, [assumptions([a10, a11])], [c18, c20])). % 4.60/0.96 % 4.60/0.96 cnf(c23, axiom, % 4.60/0.96 sP1(X11) | ~relation(X11)). % 4.60/0.96 cnf(a12, assumption, % 4.60/0.96 X10 = X11). % 4.60/0.96 cnf(c24, plain, % 4.60/0.96 $false, % 4.60/0.96 inference(strict_predicate_extension, [assumptions([a12])], [c22, c23])). % 4.60/0.96 cnf(c25, plain, % 4.60/0.96 ~relation(X11), % 4.60/0.96 inference(strict_predicate_extension, [assumptions([a12])], [c22, c23])). % 4.60/0.96 % 4.60/0.96 cnf(c26, plain, % 4.60/0.96 relation(sK10)). % 4.60/0.96 cnf(a13, assumption, % 4.60/0.96 X11 = sK10). % 4.60/0.96 cnf(c27, plain, % 4.60/0.96 $false, % 4.60/0.96 inference(predicate_reduction, [assumptions([a13])], [c25, c26])). % 4.60/0.96 % 4.60/0.96 cnf(c28, plain, % 4.60/0.96 in(unordered_pair(unordered_pair(X6,X8),singleton(X6)),X9)). % 4.60/0.96 cnf(a14, assumption, % 4.60/0.96 unordered_pair(unordered_pair(X4,X2),singleton(X4)) = unordered_pair(unordered_pair(X6,X8),singleton(X6))). % 4.60/0.96 cnf(a15, assumption, % 4.60/0.96 X5 = X9). % 4.60/0.96 cnf(c29, plain, % 4.60/0.96 $false, % 4.60/0.96 inference(predicate_reduction, [assumptions([a14, a15])], [c12, c28])). % 4.60/0.96 % 4.60/0.96 cnf(c30, plain, % 4.60/0.96 $false, % 4.60/0.96 inference(constraint_solving, [ % 4.60/0.96 bind(X0, sK10), % 4.60/0.96 bind(X1, sK10), % 4.60/0.96 bind(X2, sK9), % 4.60/0.96 bind(X3, relation_rng(X1)), % 4.60/0.96 bind(X4, sK8), % 4.60/0.96 bind(X5, sK10), % 4.60/0.96 bind(X6, sK8), % 4.60/0.96 bind(X7, relation_dom(sK10)), % 4.60/0.96 bind(X8, sK9), % 4.60/0.96 bind(X9, sK10), % 4.60/0.96 bind(X10, sK10), % 4.60/0.96 bind(X11, sK10) % 4.60/0.96 ], % 4.60/0.96 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 4.60/0.96 % 4.60/0.96 % SZS output end IncompleteProof %------------------------------------------------------------------------------