%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : KLE085+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 : n013.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:27 EDT 2022 % Result : Theorem 6.93s 1.23s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : KLE085+1 : TPTP v8.1.0. Released v4.0.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.35 % Computer : n013.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 15:49:59 EDT 2022 % 0.13/0.35 % CPUTime : % 6.93/1.23 % SZS status Theorem % 6.93/1.23 % SZS output begin IncompleteProof % 6.93/1.23 cnf(c0, axiom, % 6.93/1.23 one != addition(antidomain(antidomain(sK0)),one)). % 6.93/1.23 cnf(c1, plain, % 6.93/1.23 one != addition(antidomain(antidomain(sK0)),one), % 6.93/1.23 inference(start, [], [c0])). % 6.93/1.23 % 6.93/1.23 cnf(c2, axiom, % 6.93/1.23 addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2)). % 6.93/1.23 cnf(a0, assumption, % 6.93/1.23 addition(X3,X4) = addition(antidomain(antidomain(sK0)),one)). % 6.93/1.23 cnf(c3, plain, % 6.93/1.23 $false, % 6.93/1.23 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])). % 6.93/1.23 cnf(c4, plain, % 6.93/1.23 $false, % 6.93/1.23 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])). % 6.93/1.23 cnf(c5, plain, % 6.93/1.23 X3 != X0 | X4 != addition(X1,X2) | X5 != addition(addition(X0,X1),X2) | one != X5, % 6.93/1.23 inference(lazy_function_extension, [assumptions([a0])], [c1, c2])). % 6.93/1.23 % 6.93/1.23 cnf(a1, assumption, % 6.93/1.23 X3 = X0). % 6.93/1.23 cnf(c6, plain, % 6.93/1.23 X4 != addition(X1,X2) | X5 != addition(addition(X0,X1),X2) | one != X5, % 6.93/1.23 inference(reflexivity, [assumptions([a1])], [c5])). % 6.93/1.23 % 6.93/1.23 cnf(c7, axiom, % 6.93/1.23 one = addition(antidomain(antidomain(X6)),antidomain(X6))). % 6.93/1.23 cnf(a2, assumption, % 6.93/1.23 addition(X1,X2) = addition(antidomain(antidomain(X6)),antidomain(X6))). % 6.93/1.23 cnf(c8, plain, % 6.93/1.23 X5 != addition(addition(X0,X1),X2) | one != X5, % 6.93/1.23 inference(strict_function_extension, [assumptions([a2])], [c6, c7])). % 6.93/1.23 cnf(c9, plain, % 6.93/1.23 $false, % 6.93/1.23 inference(strict_function_extension, [assumptions([a2])], [c6, c7])). % 6.93/1.23 cnf(c10, plain, % 6.93/1.23 X7 != one | X4 != X7, % 6.93/1.23 inference(strict_function_extension, [assumptions([a2])], [c6, c7])). % 6.93/1.23 % 6.93/1.23 cnf(a3, assumption, % 6.93/1.23 X7 = one). % 6.93/1.23 cnf(c11, plain, % 6.93/1.23 X4 != X7, % 6.93/1.23 inference(reflexivity, [assumptions([a3])], [c10])). % 6.93/1.23 % 6.93/1.23 cnf(a4, assumption, % 6.93/1.23 X4 = X7). % 6.93/1.23 cnf(c12, plain, % 6.93/1.23 $false, % 6.93/1.23 inference(reflexivity, [assumptions([a4])], [c11])). % 6.93/1.23 % 6.93/1.23 cnf(c13, axiom, % 6.93/1.23 addition(X8,X8) = X8). % 6.93/1.23 cnf(a5, assumption, % 6.93/1.23 addition(X0,X1) = addition(X8,X8)). % 6.93/1.23 cnf(c14, plain, % 6.93/1.23 one != X5, % 6.93/1.23 inference(strict_function_extension, [assumptions([a5])], [c8, c13])). % 6.93/1.23 cnf(c15, plain, % 6.93/1.23 $false, % 6.93/1.23 inference(strict_function_extension, [assumptions([a5])], [c8, c13])). % 6.93/1.23 cnf(c16, plain, % 6.93/1.23 X9 != X8 | X5 != addition(X9,X2), % 6.93/1.23 inference(strict_function_extension, [assumptions([a5])], [c8, c13])). % 6.93/1.23 % 6.93/1.23 cnf(a6, assumption, % 6.93/1.23 X9 = X8). % 6.93/1.23 cnf(c17, plain, % 6.93/1.23 X5 != addition(X9,X2), % 6.93/1.23 inference(reflexivity, [assumptions([a6])], [c16])). % 6.93/1.23 % 6.93/1.23 cnf(c18, plain, % 6.93/1.23 X4 = addition(X1,X2)). % 6.93/1.23 cnf(a7, assumption, % 6.93/1.23 addition(X9,X2) = addition(X1,X2)). % 6.93/1.23 cnf(c19, plain, % 6.93/1.23 $false, % 6.93/1.23 inference(equality_reduction, [assumptions([a7])], [c17, c18])). % 6.93/1.23 cnf(c20, plain, % 6.93/1.23 X5 != X4, % 6.93/1.23 inference(equality_reduction, [assumptions([a7])], [c17, c18])). % 6.93/1.23 % 6.93/1.23 cnf(a8, assumption, % 6.93/1.23 X5 = X4). % 6.93/1.23 cnf(c21, plain, % 6.93/1.23 $false, % 6.93/1.23 inference(reflexivity, [assumptions([a8])], [c20])). % 6.93/1.23 % 6.93/1.23 cnf(a9, assumption, % 6.93/1.23 one = X5). % 6.93/1.23 cnf(c22, plain, % 6.93/1.23 $false, % 6.93/1.23 inference(reflexivity, [assumptions([a9])], [c14])). % 6.93/1.23 % 6.93/1.23 cnf(c23, plain, % 6.93/1.23 $false, % 6.93/1.23 inference(constraint_solving, [ % 6.93/1.23 bind(X0, antidomain(antidomain(sK0))), % 6.93/1.23 bind(X1, antidomain(antidomain(X6))), % 6.93/1.23 bind(X2, antidomain(X6)), % 6.93/1.23 bind(X5, one), % 6.93/1.23 bind(X3, antidomain(antidomain(sK0))), % 6.93/1.23 bind(X4, one), % 6.93/1.23 bind(X6, sK0), % 6.93/1.23 bind(X7, one), % 6.93/1.23 bind(X8, antidomain(antidomain(sK0))), % 6.93/1.23 bind(X9, antidomain(antidomain(sK0))) % 6.93/1.23 ], % 6.93/1.23 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])). % 6.93/1.23 % 6.93/1.23 % SZS output end IncompleteProof %------------------------------------------------------------------------------