%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : KLE075+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 : n015.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:25 EDT 2022 % Result : Theorem 0.12s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : KLE075+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.33 % Computer : n015.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Thu Jun 16 11:30:26 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 % SZS status Theorem % 0.12/0.34 % SZS output begin IncompleteProof % 0.12/0.34 cnf(c0, axiom, % 0.12/0.34 domain(sK0) != domain(multiplication(one,domain(sK0)))). % 0.12/0.34 cnf(c1, plain, % 0.12/0.34 domain(sK0) != domain(multiplication(one,domain(sK0))), % 0.12/0.34 inference(start, [], [c0])). % 0.12/0.34 % 0.12/0.34 cnf(c2, axiom, % 0.12/0.34 domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1)))). % 0.12/0.34 cnf(a0, assumption, % 0.12/0.34 domain(multiplication(one,domain(sK0))) = domain(multiplication(X0,domain(X1)))). % 0.12/0.34 cnf(c3, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.34 cnf(c4, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.34 cnf(c5, plain, % 0.12/0.34 X2 != domain(multiplication(X0,X1)) | domain(sK0) != X2, % 0.12/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.34 % 0.12/0.34 cnf(c6, axiom, % 0.12/0.34 multiplication(one,X3) = X3). % 0.12/0.34 cnf(a1, assumption, % 0.12/0.34 multiplication(X0,X1) = multiplication(one,X3)). % 0.12/0.34 cnf(c7, plain, % 0.12/0.34 domain(sK0) != X2, % 0.12/0.34 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.12/0.34 cnf(c8, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.12/0.34 cnf(c9, plain, % 0.12/0.34 X4 != X3 | X2 != domain(X4), % 0.12/0.34 inference(strict_function_extension, [assumptions([a1])], [c5, c6])). % 0.12/0.34 % 0.12/0.34 cnf(a2, assumption, % 0.12/0.34 X4 = X3). % 0.12/0.34 cnf(c10, plain, % 0.12/0.34 X2 != domain(X4), % 0.12/0.34 inference(reflexivity, [assumptions([a2])], [c9])). % 0.12/0.34 % 0.12/0.34 cnf(a3, assumption, % 0.12/0.34 X2 = domain(X4)). % 0.12/0.34 cnf(c11, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(reflexivity, [assumptions([a3])], [c10])). % 0.12/0.34 % 0.12/0.34 cnf(a4, assumption, % 0.12/0.34 domain(sK0) = X2). % 0.12/0.34 cnf(c12, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(reflexivity, [assumptions([a4])], [c7])). % 0.12/0.34 % 0.12/0.34 cnf(c13, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(constraint_solving, [ % 0.12/0.34 bind(X0, one), % 0.12/0.34 bind(X1, sK0), % 0.12/0.34 bind(X2, domain(X4)), % 0.12/0.34 bind(X3, sK0), % 0.12/0.34 bind(X4, sK0) % 0.12/0.34 ], % 0.12/0.34 [a0, a1, a2, a3, a4])). % 0.12/0.34 % 0.12/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------