%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : KLE003+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 : n020.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:03 EDT 2022 % Result : Theorem 0.12s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : KLE003+1 : TPTP v8.1.0. Released v4.0.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n020.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Thu Jun 16 12:38:49 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.36 % SZS status Theorem % 0.12/0.36 % SZS output begin IncompleteProof % 0.12/0.36 cnf(c0, axiom, % 0.12/0.36 one != addition(one,one) | sK0 != addition(sK0,sK0)). % 0.12/0.36 cnf(c1, plain, % 0.12/0.36 one != addition(one,one) | sK0 != addition(sK0,sK0), % 0.12/0.36 inference(start, [], [c0])). % 0.12/0.36 % 0.12/0.36 cnf(c2, axiom, % 0.12/0.36 addition(X0,X0) = X0). % 0.12/0.36 cnf(a0, assumption, % 0.12/0.36 addition(one,one) = addition(X0,X0)). % 0.12/0.36 cnf(c3, plain, % 0.12/0.36 sK0 != addition(sK0,sK0), % 0.12/0.36 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.36 cnf(c4, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.36 cnf(c5, plain, % 0.12/0.36 X1 != X0 | one != X1, % 0.12/0.36 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.36 % 0.12/0.36 cnf(a1, assumption, % 0.12/0.36 X1 = X0). % 0.12/0.36 cnf(c6, plain, % 0.12/0.36 one != X1, % 0.12/0.36 inference(reflexivity, [assumptions([a1])], [c5])). % 0.12/0.36 % 0.12/0.36 cnf(a2, assumption, % 0.12/0.36 one = X1). % 0.12/0.36 cnf(c7, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(reflexivity, [assumptions([a2])], [c6])). % 0.12/0.36 % 0.12/0.36 cnf(c8, axiom, % 0.12/0.36 addition(X2,X2) = X2). % 0.12/0.36 cnf(a3, assumption, % 0.12/0.36 addition(sK0,sK0) = addition(X2,X2)). % 0.12/0.36 cnf(c9, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_function_extension, [assumptions([a3])], [c3, c8])). % 0.12/0.36 cnf(c10, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(strict_function_extension, [assumptions([a3])], [c3, c8])). % 0.12/0.36 cnf(c11, plain, % 0.12/0.36 X3 != X2 | sK0 != X3, % 0.12/0.36 inference(strict_function_extension, [assumptions([a3])], [c3, c8])). % 0.12/0.36 % 0.12/0.36 cnf(a4, assumption, % 0.12/0.36 X3 = X2). % 0.12/0.36 cnf(c12, plain, % 0.12/0.36 sK0 != X3, % 0.12/0.36 inference(reflexivity, [assumptions([a4])], [c11])). % 0.12/0.36 % 0.12/0.36 cnf(a5, assumption, % 0.12/0.36 sK0 = X3). % 0.12/0.36 cnf(c13, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(reflexivity, [assumptions([a5])], [c12])). % 0.12/0.36 % 0.12/0.36 cnf(c14, plain, % 0.12/0.36 $false, % 0.12/0.36 inference(constraint_solving, [ % 0.12/0.36 bind(X0, one), % 0.12/0.36 bind(X1, one), % 0.12/0.36 bind(X2, sK0), % 0.12/0.36 bind(X3, sK0) % 0.12/0.36 ], % 0.12/0.36 [a0, a1, a2, a3, a4, a5])). % 0.12/0.36 % 0.12/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------