%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : KLE138+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 : n023.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:38 EDT 2022 % Result : Theorem 0.15s 0.41s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : KLE138+1 : TPTP v8.1.0. Released v4.0.0. % 0.08/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.15/0.36 % Computer : n023.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 600 % 0.15/0.36 % DateTime : Thu Jun 16 13:10:50 EDT 2022 % 0.15/0.36 % CPUTime : % 0.15/0.41 % SZS status Theorem % 0.15/0.41 % SZS output begin IncompleteProof % 0.15/0.41 cnf(c0, axiom, % 0.15/0.41 one != strong_iteration(zero)). % 0.15/0.41 cnf(c1, plain, % 0.15/0.41 one != strong_iteration(zero), % 0.15/0.41 inference(start, [], [c0])). % 0.15/0.41 % 0.15/0.41 cnf(c2, axiom, % 0.15/0.41 strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one)). % 0.15/0.41 cnf(a0, assumption, % 0.15/0.41 strong_iteration(zero) = strong_iteration(X0)). % 0.15/0.41 cnf(c3, plain, % 0.15/0.41 $false, % 0.15/0.41 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.15/0.41 cnf(c4, plain, % 0.15/0.41 $false, % 0.15/0.41 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.15/0.41 cnf(c5, plain, % 0.15/0.41 X1 != addition(multiplication(X0,strong_iteration(X0)),one) | one != X1, % 0.15/0.41 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.15/0.41 % 0.15/0.41 cnf(c6, axiom, % 0.15/0.41 zero = multiplication(zero,X2)). % 0.15/0.41 cnf(a1, assumption, % 0.15/0.41 multiplication(X0,strong_iteration(X0)) = multiplication(zero,X2)). % 0.15/0.41 cnf(c7, plain, % 0.15/0.41 one != X1, % 0.15/0.41 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.15/0.41 cnf(c8, plain, % 0.15/0.41 $false, % 0.15/0.41 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.15/0.41 cnf(c9, plain, % 0.15/0.41 X3 != zero | X1 != addition(X3,one), % 0.15/0.41 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.15/0.41 % 0.15/0.41 cnf(a2, assumption, % 0.15/0.41 X3 = zero). % 0.15/0.41 cnf(c10, plain, % 0.15/0.41 X1 != addition(X3,one), % 0.15/0.41 inference(reflexivity, [assumptions([a2])], [c9])). % 0.15/0.41 % 0.15/0.41 cnf(c11, axiom, % 0.15/0.41 addition(X4,X5) = addition(X5,X4)). % 0.15/0.41 cnf(a3, assumption, % 0.15/0.41 addition(X3,one) = addition(X5,X4)). % 0.15/0.41 cnf(c12, plain, % 0.15/0.41 $false, % 0.15/0.41 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 0.15/0.41 cnf(c13, plain, % 0.15/0.41 $false, % 0.15/0.41 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 0.15/0.41 cnf(c14, plain, % 0.15/0.41 X6 != addition(X4,X5) | X1 != X6, % 0.15/0.41 inference(strict_function_extension, [assumptions([a3])], [c10, c11])). % 0.15/0.41 % 0.15/0.41 cnf(c15, axiom, % 0.15/0.41 addition(X7,zero) = X7). % 0.15/0.41 cnf(a4, assumption, % 0.15/0.41 addition(X4,X5) = addition(X7,zero)). % 0.15/0.41 cnf(c16, plain, % 0.15/0.41 X1 != X6, % 0.15/0.41 inference(strict_function_extension, [assumptions([a4])], [c14, c15])). % 0.15/0.41 cnf(c17, plain, % 0.15/0.41 $false, % 0.15/0.41 inference(strict_function_extension, [assumptions([a4])], [c14, c15])). % 0.15/0.41 cnf(c18, plain, % 0.15/0.41 X8 != X7 | X6 != X8, % 0.15/0.41 inference(strict_function_extension, [assumptions([a4])], [c14, c15])). % 0.15/0.41 % 0.15/0.41 cnf(a5, assumption, % 0.15/0.41 X8 = X7). % 0.15/0.41 cnf(c19, plain, % 0.15/0.41 X6 != X8, % 0.15/0.41 inference(reflexivity, [assumptions([a5])], [c18])). % 0.15/0.41 % 0.15/0.41 cnf(a6, assumption, % 0.15/0.41 X6 = X8). % 0.15/0.41 cnf(c20, plain, % 0.15/0.41 $false, % 0.15/0.41 inference(reflexivity, [assumptions([a6])], [c19])). % 0.15/0.41 % 0.15/0.41 cnf(a7, assumption, % 0.15/0.41 X1 = X6). % 0.15/0.41 cnf(c21, plain, % 0.15/0.41 $false, % 0.15/0.41 inference(reflexivity, [assumptions([a7])], [c16])). % 0.15/0.41 % 0.15/0.41 cnf(a8, assumption, % 0.15/0.41 one = X1). % 0.15/0.41 cnf(c22, plain, % 0.15/0.41 $false, % 0.15/0.41 inference(reflexivity, [assumptions([a8])], [c7])). % 0.15/0.41 % 0.15/0.41 cnf(c23, plain, % 0.15/0.41 $false, % 0.15/0.41 inference(constraint_solving, [ % 0.15/0.41 bind(X0, zero), % 0.15/0.41 bind(X1, one), % 0.15/0.41 bind(X2, strong_iteration(X0)), % 0.15/0.41 bind(X3, zero), % 0.15/0.41 bind(X4, one), % 0.15/0.41 bind(X5, zero), % 0.15/0.41 bind(X6, one), % 0.15/0.41 bind(X7, one), % 0.15/0.41 bind(X8, one) % 0.15/0.41 ], % 0.15/0.41 [a0, a1, a2, a3, a4, a5, a6, a7, a8])). % 0.15/0.41 % 0.15/0.41 % SZS output end IncompleteProof %------------------------------------------------------------------------------