%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM852+1 : 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 : 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 : Mon Jul 18 11:37:09 EDT 2022 % Result : Theorem 39.40s 5.46s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : NUM852+1 : TPTP v8.1.0. Released v4.1.0. % 0.12/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n020.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 Jul 7 21:55:58 EDT 2022 % 0.12/0.33 % CPUTime : % 39.40/5.46 % SZS status Theorem % 39.40/5.46 % SZS output begin IncompleteProof % 39.40/5.46 cnf(c0, axiom, % 39.40/5.46 ~greater(vmul(vd481,vd469),vmul(vd480,vd469))). % 39.40/5.46 cnf(c1, plain, % 39.40/5.46 ~greater(vmul(vd481,vd469),vmul(vd480,vd469)), % 39.40/5.46 inference(start, [], [c0])). % 39.40/5.46 % 39.40/5.46 cnf(c2, axiom, % 39.40/5.46 greater(X0,X1) | ~greater(vplus(X0,X2),vplus(X1,X2))). % 39.40/5.46 cnf(a0, assumption, % 39.40/5.46 vmul(vd481,vd469) = X0). % 39.40/5.46 cnf(a1, assumption, % 39.40/5.46 vmul(vd480,vd469) = X1). % 39.40/5.46 cnf(c3, plain, % 39.40/5.46 $false, % 39.40/5.46 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 39.40/5.46 cnf(c4, plain, % 39.40/5.46 ~greater(vplus(X0,X2),vplus(X1,X2)), % 39.40/5.46 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 39.40/5.46 % 39.40/5.46 cnf(c5, axiom, % 39.40/5.46 vplus(vmul(X3,vd469),vmul(vskolem9(X4,X3),vd469)) = vmul(vplus(X3,vskolem9(X4,X3)),vd469) | ~greater(X4,X3)). % 39.40/5.46 cnf(a2, assumption, % 39.40/5.46 vplus(X1,X2) = vplus(vmul(X3,vd469),vmul(vskolem9(X4,X3),vd469))). % 39.40/5.46 cnf(c6, plain, % 39.40/5.46 $false, % 39.40/5.46 inference(strict_function_extension, [assumptions([a2])], [c4, c5])). % 39.40/5.46 cnf(c7, plain, % 39.40/5.46 ~greater(X4,X3), % 39.40/5.46 inference(strict_function_extension, [assumptions([a2])], [c4, c5])). % 39.40/5.46 cnf(c8, plain, % 39.40/5.46 X5 != vmul(vplus(X3,vskolem9(X4,X3)),vd469) | ~greater(vplus(X0,X2),X5), % 39.40/5.46 inference(strict_function_extension, [assumptions([a2])], [c4, c5])). % 39.40/5.46 % 39.40/5.46 cnf(c9, axiom, % 39.40/5.46 vmul(X6,vd469) = vmul(vplus(X7,vskolem9(X6,X7)),vd469) | ~greater(X6,X7)). % 39.40/5.46 cnf(a3, assumption, % 39.40/5.46 vmul(vplus(X3,vskolem9(X4,X3)),vd469) = vmul(vplus(X7,vskolem9(X6,X7)),vd469)). % 39.40/5.46 cnf(c10, plain, % 39.40/5.46 ~greater(vplus(X0,X2),X5), % 39.40/5.46 inference(strict_function_extension, [assumptions([a3])], [c8, c9])). % 39.40/5.46 cnf(c11, plain, % 39.40/5.46 ~greater(X6,X7), % 39.40/5.46 inference(strict_function_extension, [assumptions([a3])], [c8, c9])). % 39.40/5.46 cnf(c12, plain, % 39.40/5.46 X8 != vmul(X6,vd469) | X5 != X8, % 39.40/5.46 inference(strict_function_extension, [assumptions([a3])], [c8, c9])). % 39.40/5.46 % 39.40/5.46 cnf(a4, assumption, % 39.40/5.46 X8 = vmul(X6,vd469)). % 39.40/5.46 cnf(c13, plain, % 39.40/5.46 X5 != X8, % 39.40/5.46 inference(reflexivity, [assumptions([a4])], [c12])). % 39.40/5.46 % 39.40/5.46 cnf(a5, assumption, % 39.40/5.46 X5 = X8). % 39.40/5.46 cnf(c14, plain, % 39.40/5.46 $false, % 39.40/5.46 inference(reflexivity, [assumptions([a5])], [c13])). % 39.40/5.46 % 39.40/5.46 cnf(c15, axiom, % 39.40/5.46 greater(vd481,vd480)). % 39.40/5.46 cnf(a6, assumption, % 39.40/5.46 X6 = vd481). % 39.40/5.46 cnf(a7, assumption, % 39.40/5.46 X7 = vd480). % 39.40/5.46 cnf(c16, plain, % 39.40/5.46 $false, % 39.40/5.46 inference(strict_predicate_extension, [assumptions([a6, a7])], [c11, c15])). % 39.40/5.46 cnf(c17, plain, % 39.40/5.46 $false, % 39.40/5.46 inference(strict_predicate_extension, [assumptions([a6, a7])], [c11, c15])). % 39.40/5.46 % 39.40/5.46 cnf(c18, axiom, % 39.40/5.46 greater(vplus(X9,X10),X9)). % 39.40/5.46 cnf(a8, assumption, % 39.40/5.46 vplus(X0,X2) = vplus(X9,X10)). % 39.40/5.46 cnf(a9, assumption, % 39.40/5.46 X5 = X9). % 39.40/5.46 cnf(c19, plain, % 39.40/5.46 $false, % 39.40/5.46 inference(strict_predicate_extension, [assumptions([a8, a9])], [c10, c18])). % 39.40/5.46 cnf(c20, plain, % 39.40/5.46 $false, % 39.40/5.46 inference(strict_predicate_extension, [assumptions([a8, a9])], [c10, c18])). % 39.40/5.46 % 39.40/5.46 cnf(c21, plain, % 39.40/5.46 greater(X6,X7)). % 39.40/5.46 cnf(a10, assumption, % 39.40/5.46 X4 = X6). % 39.40/5.46 cnf(a11, assumption, % 39.40/5.46 X3 = X7). % 39.40/5.46 cnf(c22, plain, % 39.40/5.46 $false, % 39.40/5.46 inference(predicate_reduction, [assumptions([a10, a11])], [c7, c21])). % 39.40/5.46 % 39.40/5.46 cnf(c23, plain, % 39.40/5.46 $false, % 39.40/5.46 inference(constraint_solving, [ % 39.40/5.46 bind(X0, vmul(vd481,vd469)), % 39.40/5.46 bind(X1, vmul(vd480,vd469)), % 39.40/5.46 bind(X2, vmul(vskolem9(X4,X3),vd469)), % 39.40/5.46 bind(X3, vd480), % 39.40/5.46 bind(X4, vd481), % 39.40/5.46 bind(X5, vmul(X6,vd469)), % 39.40/5.46 bind(X6, vd481), % 39.40/5.46 bind(X7, vd480), % 39.40/5.46 bind(X8, vmul(X6,vd469)), % 39.40/5.46 bind(X9, vmul(vd481,vd469)), % 39.40/5.46 bind(X10, vmul(vskolem9(X4,X3),vd469)) % 39.40/5.46 ], % 39.40/5.46 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 39.40/5.46 % 39.40/5.46 % SZS output end IncompleteProof %------------------------------------------------------------------------------