%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWC255+1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n008.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 21:07:54 EDT 2022 % Result : Theorem 194.01s 27.10s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : SWC255+1 : TPTP v8.1.0. Released v2.4.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.34 % Computer : n008.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 12 03:12:52 EDT 2022 % 0.14/0.35 % CPUTime : % 194.01/27.10 % SZS status Theorem % 194.01/27.10 % SZS output begin IncompleteProof % 194.01/27.10 cnf(c0, axiom, % 194.01/27.10 sK90 = sK92). % 194.01/27.10 cnf(c1, plain, % 194.01/27.10 sK90 = sK92, % 194.01/27.10 inference(start, [], [c0])). % 194.01/27.10 % 194.01/27.10 cnf(c2, axiom, % 194.01/27.10 neq(sK90,nil) | sP41(sK89,sK91,sK90)). % 194.01/27.10 cnf(a0, assumption, % 194.01/27.10 sK90 = sK90). % 194.01/27.10 cnf(a1, assumption, % 194.01/27.10 sK92 = X0). % 194.01/27.10 cnf(c3, plain, % 194.01/27.10 $false, % 194.01/27.10 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 194.01/27.10 cnf(c4, plain, % 194.01/27.10 sP41(sK89,sK91,sK90), % 194.01/27.10 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 194.01/27.10 cnf(c5, plain, % 194.01/27.10 neq(X0,nil), % 194.01/27.10 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 194.01/27.10 % 194.01/27.10 cnf(c6, axiom, % 194.01/27.10 ~neq(sK92,nil) | sP41(sK89,sK91,sK90)). % 194.01/27.10 cnf(a2, assumption, % 194.01/27.10 X0 = sK92). % 194.01/27.10 cnf(a3, assumption, % 194.01/27.10 nil = nil). % 194.01/27.10 cnf(c7, plain, % 194.01/27.10 $false, % 194.01/27.10 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 194.01/27.10 cnf(c8, plain, % 194.01/27.10 sP41(sK89,sK91,sK90), % 194.01/27.10 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 194.01/27.10 % 194.01/27.10 cnf(c9, axiom, % 194.01/27.10 sK89 = sK91). % 194.01/27.10 cnf(a4, assumption, % 194.01/27.10 sK91 = sK91). % 194.01/27.10 cnf(c10, plain, % 194.01/27.10 $false, % 194.01/27.10 inference(strict_function_extension, [assumptions([a4])], [c8, c9])). % 194.01/27.10 cnf(c11, plain, % 194.01/27.10 $false, % 194.01/27.10 inference(strict_function_extension, [assumptions([a4])], [c8, c9])). % 194.01/27.10 cnf(c12, plain, % 194.01/27.10 X1 != sK89 | sP41(sK89,X1,sK90), % 194.01/27.10 inference(strict_function_extension, [assumptions([a4])], [c8, c9])). % 194.01/27.10 % 194.01/27.10 cnf(a5, assumption, % 194.01/27.10 X1 = sK89). % 194.01/27.10 cnf(c13, plain, % 194.01/27.10 sP41(sK89,X1,sK90), % 194.01/27.10 inference(reflexivity, [assumptions([a5])], [c12])). % 194.01/27.10 % 194.01/27.10 cnf(c14, axiom, % 194.01/27.10 ~singletonP(X2) | ~sP41(X2,X3,X4)). % 194.01/27.10 cnf(a6, assumption, % 194.01/27.10 sK89 = X2). % 194.01/27.10 cnf(a7, assumption, % 194.01/27.10 X1 = X3). % 194.01/27.10 cnf(a8, assumption, % 194.01/27.10 sK90 = X4). % 194.01/27.10 cnf(c15, plain, % 194.01/27.10 $false, % 194.01/27.10 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c13, c14])). % 194.01/27.10 cnf(c16, plain, % 194.01/27.10 ~singletonP(X2), % 194.01/27.10 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c13, c14])). % 194.01/27.10 % 194.01/27.10 cnf(c17, axiom, % 194.01/27.10 singletonP(X5) | ~sP41(X6,X5,X7)). % 194.01/27.10 cnf(a9, assumption, % 194.01/27.10 X2 = X5). % 194.01/27.10 cnf(c18, plain, % 194.01/27.10 $false, % 194.01/27.10 inference(strict_predicate_extension, [assumptions([a9])], [c16, c17])). % 194.01/27.10 cnf(c19, plain, % 194.01/27.10 ~sP41(X6,X5,X7), % 194.01/27.10 inference(strict_predicate_extension, [assumptions([a9])], [c16, c17])). % 194.01/27.10 % 194.01/27.10 cnf(c20, plain, % 194.01/27.10 sP41(sK89,X1,sK90)). % 194.01/27.10 cnf(a10, assumption, % 194.01/27.10 X6 = sK89). % 194.01/27.10 cnf(a11, assumption, % 194.01/27.10 X5 = X1). % 194.01/27.10 cnf(a12, assumption, % 194.01/27.10 X7 = sK90). % 194.01/27.10 cnf(c21, plain, % 194.01/27.10 $false, % 194.01/27.10 inference(predicate_reduction, [assumptions([a10, a11, a12])], [c19, c20])). % 194.01/27.10 % 194.01/27.10 cnf(c22, plain, % 194.01/27.10 ~sP41(sK89,sK91,sK90)). % 194.01/27.10 cnf(a13, assumption, % 194.01/27.10 sK89 = sK89). % 194.01/27.10 cnf(a14, assumption, % 194.01/27.10 sK91 = sK91). % 194.01/27.10 cnf(a15, assumption, % 194.01/27.10 sK90 = sK90). % 194.01/27.10 cnf(c23, plain, % 194.01/27.10 $false, % 194.01/27.10 inference(predicate_reduction, [assumptions([a13, a14, a15])], [c4, c22])). % 194.01/27.10 % 194.01/27.10 cnf(c24, plain, % 194.01/27.10 $false, % 194.01/27.10 inference(constraint_solving, [ % 194.01/27.10 bind(X0, sK92), % 194.01/27.10 bind(X1, sK89), % 194.01/27.10 bind(X2, sK89), % 194.01/27.10 bind(X3, sK89), % 194.01/27.10 bind(X4, sK90), % 194.01/27.10 bind(X5, sK89), % 194.01/27.10 bind(X6, sK89), % 194.01/27.10 bind(X7, sK90) % 194.01/27.10 ], % 194.01/27.10 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 194.01/27.10 % 194.01/27.10 % SZS output end IncompleteProof %------------------------------------------------------------------------------