%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : KLE146+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 : n004.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 : Sun Jul 17 02:09:41 EDT 2022 % Result : Theorem 46.12s 6.30s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : KLE146+1 : TPTP v8.1.0. Released v4.0.0. % 0.13/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.35 % Computer : n004.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Thu Jun 16 16:27:53 EDT 2022 % 0.20/0.35 % CPUTime : % 46.12/6.30 % SZS status Theorem % 46.12/6.30 % SZS output begin IncompleteProof % 46.12/6.30 cnf(c0, axiom, % 46.12/6.30 ~leq(one,strong_iteration(sK0))). % 46.12/6.30 cnf(c1, plain, % 46.12/6.30 ~leq(one,strong_iteration(sK0)), % 46.12/6.30 inference(start, [], [c0])). % 46.12/6.30 % 46.12/6.30 cnf(c2, axiom, % 46.12/6.30 leq(X0,X1) | addition(X0,X1) != X1). % 46.12/6.30 cnf(a0, assumption, % 46.12/6.30 one = X0). % 46.12/6.30 cnf(a1, assumption, % 46.12/6.30 strong_iteration(sK0) = X1). % 46.12/6.30 cnf(c3, plain, % 46.12/6.30 $false, % 46.12/6.30 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 46.12/6.30 cnf(c4, plain, % 46.12/6.30 addition(X0,X1) != X1, % 46.12/6.30 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 46.12/6.30 % 46.12/6.30 cnf(c5, axiom, % 46.12/6.30 addition(X2,addition(X3,X4)) = addition(addition(X2,X3),X4)). % 46.12/6.30 cnf(a2, assumption, % 46.12/6.30 addition(X5,X6) = addition(X0,X1)). % 46.12/6.30 cnf(c6, plain, % 46.12/6.30 $false, % 46.12/6.30 inference(lazy_function_extension, [assumptions([a2])], [c4, c5])). % 46.12/6.30 cnf(c7, plain, % 46.12/6.30 $false, % 46.12/6.30 inference(lazy_function_extension, [assumptions([a2])], [c4, c5])). % 46.12/6.30 cnf(c8, plain, % 46.12/6.30 X5 != X2 | X6 != addition(X3,X4) | X7 != addition(addition(X2,X3),X4) | X7 != X1, % 46.12/6.30 inference(lazy_function_extension, [assumptions([a2])], [c4, c5])). % 46.12/6.30 % 46.12/6.30 cnf(a3, assumption, % 46.12/6.30 X5 = X2). % 46.12/6.30 cnf(c9, plain, % 46.12/6.30 X6 != addition(X3,X4) | X7 != addition(addition(X2,X3),X4) | X7 != X1, % 46.12/6.30 inference(reflexivity, [assumptions([a3])], [c8])). % 46.12/6.30 % 46.12/6.30 cnf(c10, axiom, % 46.12/6.30 addition(X8,X9) = addition(X9,X8)). % 46.12/6.30 cnf(a4, assumption, % 46.12/6.30 addition(X3,X4) = addition(X9,X8)). % 46.12/6.30 cnf(c11, plain, % 46.12/6.30 X7 != addition(addition(X2,X3),X4) | X7 != X1, % 46.12/6.30 inference(strict_function_extension, [assumptions([a4])], [c9, c10])). % 46.12/6.30 cnf(c12, plain, % 46.12/6.30 $false, % 46.12/6.30 inference(strict_function_extension, [assumptions([a4])], [c9, c10])). % 46.12/6.30 cnf(c13, plain, % 46.12/6.30 X10 != addition(X8,X9) | X6 != X10, % 46.12/6.30 inference(strict_function_extension, [assumptions([a4])], [c9, c10])). % 46.12/6.30 % 46.12/6.30 cnf(c14, axiom, % 46.12/6.30 strong_iteration(X11) = addition(multiplication(X11,strong_iteration(X11)),one)). % 46.12/6.30 cnf(a5, assumption, % 46.12/6.30 addition(X8,X9) = addition(multiplication(X11,strong_iteration(X11)),one)). % 46.12/6.30 cnf(c15, plain, % 46.12/6.30 X6 != X10, % 46.12/6.30 inference(strict_function_extension, [assumptions([a5])], [c13, c14])). % 46.12/6.30 cnf(c16, plain, % 46.12/6.30 $false, % 46.12/6.30 inference(strict_function_extension, [assumptions([a5])], [c13, c14])). % 46.12/6.30 cnf(c17, plain, % 46.12/6.30 X12 != strong_iteration(X11) | X10 != X12, % 46.12/6.30 inference(strict_function_extension, [assumptions([a5])], [c13, c14])). % 46.12/6.30 % 46.12/6.30 cnf(a6, assumption, % 46.12/6.30 X12 = strong_iteration(X11)). % 46.12/6.30 cnf(c18, plain, % 46.12/6.30 X10 != X12, % 46.12/6.30 inference(reflexivity, [assumptions([a6])], [c17])). % 46.12/6.30 % 46.12/6.30 cnf(a7, assumption, % 46.12/6.30 X10 = X12). % 46.12/6.30 cnf(c19, plain, % 46.12/6.30 $false, % 46.12/6.30 inference(reflexivity, [assumptions([a7])], [c18])). % 46.12/6.30 % 46.12/6.30 cnf(a8, assumption, % 46.12/6.30 X6 = X10). % 46.12/6.30 cnf(c20, plain, % 46.12/6.30 $false, % 46.12/6.30 inference(reflexivity, [assumptions([a8])], [c15])). % 46.12/6.30 % 46.12/6.30 cnf(c21, axiom, % 46.12/6.30 addition(X13,X13) = X13). % 46.12/6.30 cnf(a9, assumption, % 46.12/6.30 addition(X2,X3) = addition(X13,X13)). % 46.12/6.30 cnf(c22, plain, % 46.12/6.30 X7 != X1, % 46.12/6.30 inference(strict_function_extension, [assumptions([a9])], [c11, c21])). % 46.12/6.30 cnf(c23, plain, % 46.12/6.30 $false, % 46.12/6.30 inference(strict_function_extension, [assumptions([a9])], [c11, c21])). % 46.12/6.30 cnf(c24, plain, % 46.12/6.30 X14 != X13 | X7 != addition(X14,X4), % 46.12/6.30 inference(strict_function_extension, [assumptions([a9])], [c11, c21])). % 46.12/6.30 % 46.12/6.30 cnf(a10, assumption, % 46.12/6.30 X14 = X13). % 46.12/6.30 cnf(c25, plain, % 46.12/6.30 X7 != addition(X14,X4), % 46.12/6.30 inference(reflexivity, [assumptions([a10])], [c24])). % 46.12/6.30 % 46.12/6.30 cnf(c26, plain, % 46.12/6.30 X6 = addition(X3,X4)). % 46.12/6.30 cnf(a11, assumption, % 46.12/6.30 addition(X14,X4) = addition(X3,X4)). % 46.12/6.30 cnf(c27, plain, % 46.12/6.30 $false, % 46.12/6.30 inference(equality_reduction, [assumptions([a11])], [c25, c26])). % 46.12/6.30 cnf(c28, plain, % 46.12/6.30 X7 != X6, % 46.12/6.30 inference(equality_reduction, [assumptions([a11])], [c25, c26])). % 46.12/6.30 % 46.12/6.30 cnf(a12, assumption, % 46.12/6.30 X7 = X6). % 46.12/6.30 cnf(c29, plain, % 46.12/6.30 $false, % 46.12/6.30 inference(reflexivity, [assumptions([a12])], [c28])). % 46.12/6.30 % 46.12/6.30 cnf(a13, assumption, % 46.12/6.30 X7 = X1). % 46.12/6.30 cnf(c30, plain, % 46.12/6.30 $false, % 46.12/6.30 inference(reflexivity, [assumptions([a13])], [c22])). % 46.12/6.30 % 46.12/6.30 cnf(c31, plain, % 46.12/6.30 $false, % 46.12/6.30 inference(constraint_solving, [ % 46.12/6.30 bind(X0, one), % 46.12/6.30 bind(X1, strong_iteration(sK0)), % 46.12/6.30 bind(X2, one), % 46.12/6.30 bind(X3, one), % 46.12/6.30 bind(X4, multiplication(X11,strong_iteration(X11))), % 46.12/6.30 bind(X7, strong_iteration(sK0)), % 46.12/6.30 bind(X5, one), % 46.12/6.30 bind(X6, strong_iteration(sK0)), % 46.12/6.30 bind(X8, multiplication(X11,strong_iteration(X11))), % 46.12/6.30 bind(X9, one), % 46.12/6.30 bind(X10, strong_iteration(X11)), % 46.12/6.30 bind(X11, sK0), % 46.12/6.30 bind(X12, strong_iteration(X11)), % 46.12/6.30 bind(X13, one), % 46.12/6.30 bind(X14, one) % 46.12/6.30 ], % 46.12/6.30 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])). % 46.12/6.30 % 46.12/6.30 % SZS output end IncompleteProof %------------------------------------------------------------------------------