%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM852+2 : TPTP v8.1.0. Released v4.1.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n007.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 : Mon Jul 18 11:37:09 EDT 2022 % Result : Theorem 0.21s 0.54s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : NUM852+2 : TPTP v8.1.0. Released v4.1.0. % 0.06/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.34 % Computer : n007.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Tue Jul 5 21:10:28 EDT 2022 % 0.14/0.34 % CPUTime : % 0.21/0.54 % SZS status Theorem % 0.21/0.54 % SZS output begin IncompleteProof % 0.21/0.54 cnf(c0, axiom, % 0.21/0.54 ~greater(vmul(vd481,vd469),vmul(vd480,vd469))). % 0.21/0.54 cnf(c1, plain, % 0.21/0.54 ~greater(vmul(vd481,vd469),vmul(vd480,vd469)), % 0.21/0.54 inference(start, [], [c0])). % 0.21/0.54 % 0.21/0.54 cnf(c2, axiom, % 0.21/0.54 greater(vplus(X0,X1),X0)). % 0.21/0.54 cnf(a0, assumption, % 0.21/0.54 X2 = vmul(vd481,vd469)). % 0.21/0.54 cnf(a1, assumption, % 0.21/0.54 X3 = vmul(vd480,vd469)). % 0.21/0.54 cnf(c3, plain, % 0.21/0.54 $false, % 0.21/0.54 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.54 cnf(c4, plain, % 0.21/0.54 $false, % 0.21/0.54 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.54 cnf(c5, plain, % 0.21/0.54 vplus(X0,X1) != X2 | X0 != X3, % 0.21/0.54 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.54 % 0.21/0.54 cnf(c6, axiom, % 0.21/0.54 vplus(vmul(X4,vd469),vmul(vskolem9(X5,X4),vd469)) = vmul(vplus(X4,vskolem9(X5,X4)),vd469) | ~greater(X5,X4)). % 0.21/0.54 cnf(a2, assumption, % 0.21/0.54 vplus(X0,X1) = vplus(vmul(X4,vd469),vmul(vskolem9(X5,X4),vd469))). % 0.21/0.54 cnf(c7, plain, % 0.21/0.54 X0 != X3, % 0.21/0.54 inference(strict_function_extension, [assumptions([a2])], [c5, c6])). % 0.21/0.54 cnf(c8, plain, % 0.21/0.54 ~greater(X5,X4), % 0.21/0.54 inference(strict_function_extension, [assumptions([a2])], [c5, c6])). % 0.21/0.54 cnf(c9, plain, % 0.21/0.54 X6 != vmul(vplus(X4,vskolem9(X5,X4)),vd469) | X6 != X2, % 0.21/0.54 inference(strict_function_extension, [assumptions([a2])], [c5, c6])). % 0.21/0.54 % 0.21/0.54 cnf(c10, axiom, % 0.21/0.54 vplus(X7,vskolem9(X8,X7)) = X8 | ~greater(X8,X7)). % 0.21/0.54 cnf(a3, assumption, % 0.21/0.54 vplus(X4,vskolem9(X5,X4)) = vplus(X7,vskolem9(X8,X7))). % 0.21/0.54 cnf(c11, plain, % 0.21/0.54 X6 != X2, % 0.21/0.54 inference(strict_function_extension, [assumptions([a3])], [c9, c10])). % 0.21/0.54 cnf(c12, plain, % 0.21/0.54 ~greater(X8,X7), % 0.21/0.54 inference(strict_function_extension, [assumptions([a3])], [c9, c10])). % 0.21/0.54 cnf(c13, plain, % 0.21/0.54 X9 != X8 | X6 != vmul(X9,vd469), % 0.21/0.54 inference(strict_function_extension, [assumptions([a3])], [c9, c10])). % 0.21/0.54 % 0.21/0.54 cnf(a4, assumption, % 0.21/0.54 X9 = X8). % 0.21/0.54 cnf(c14, plain, % 0.21/0.54 X6 != vmul(X9,vd469), % 0.21/0.54 inference(reflexivity, [assumptions([a4])], [c13])). % 0.21/0.54 % 0.21/0.54 cnf(a5, assumption, % 0.21/0.54 X6 = vmul(X9,vd469)). % 0.21/0.54 cnf(c15, plain, % 0.21/0.54 $false, % 0.21/0.54 inference(reflexivity, [assumptions([a5])], [c14])). % 0.21/0.54 % 0.21/0.54 cnf(c16, axiom, % 0.21/0.54 greater(vd481,vd480)). % 0.21/0.54 cnf(a6, assumption, % 0.21/0.54 X8 = vd481). % 0.21/0.54 cnf(a7, assumption, % 0.21/0.54 X7 = vd480). % 0.21/0.54 cnf(c17, plain, % 0.21/0.54 $false, % 0.21/0.54 inference(strict_predicate_extension, [assumptions([a6, a7])], [c12, c16])). % 0.21/0.54 cnf(c18, plain, % 0.21/0.54 $false, % 0.21/0.54 inference(strict_predicate_extension, [assumptions([a6, a7])], [c12, c16])). % 0.21/0.54 % 0.21/0.54 cnf(a8, assumption, % 0.21/0.54 X6 = X2). % 0.21/0.54 cnf(c19, plain, % 0.21/0.54 $false, % 0.21/0.54 inference(reflexivity, [assumptions([a8])], [c11])). % 0.21/0.54 % 0.21/0.54 cnf(c20, plain, % 0.21/0.54 greater(X8,X7)). % 0.21/0.54 cnf(a9, assumption, % 0.21/0.54 X5 = X8). % 0.21/0.54 cnf(a10, assumption, % 0.21/0.54 X4 = X7). % 0.21/0.54 cnf(c21, plain, % 0.21/0.54 $false, % 0.21/0.54 inference(predicate_reduction, [assumptions([a9, a10])], [c8, c20])). % 0.21/0.54 % 0.21/0.54 cnf(a11, assumption, % 0.21/0.54 X0 = X3). % 0.21/0.54 cnf(c22, plain, % 0.21/0.54 $false, % 0.21/0.54 inference(reflexivity, [assumptions([a11])], [c7])). % 0.21/0.54 % 0.21/0.54 cnf(c23, plain, % 0.21/0.54 $false, % 0.21/0.54 inference(constraint_solving, [ % 0.21/0.54 bind(X0, vmul(X4,vd469)), % 0.21/0.54 bind(X1, vmul(vskolem9(X5,X4),vd469)), % 0.21/0.54 bind(X2, vmul(vd481,vd469)), % 0.21/0.54 bind(X3, vmul(vd480,vd469)), % 0.21/0.54 bind(X4, vd480), % 0.21/0.54 bind(X5, vd481), % 0.21/0.54 bind(X6, vmul(X9,vd469)), % 0.21/0.54 bind(X7, vd480), % 0.21/0.54 bind(X8, vd481), % 0.21/0.54 bind(X9, vd481) % 0.21/0.54 ], % 0.21/0.54 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.21/0.54 % 0.21/0.54 % SZS output end IncompleteProof %------------------------------------------------------------------------------