%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM853+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 : n016.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.49s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM853+1 : TPTP v8.1.0. Released v4.1.0. % 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n016.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.18/0.34 % CPULimit : 300 % 0.18/0.34 % WCLimit : 600 % 0.18/0.34 % DateTime : Thu Jul 7 15:34:51 EDT 2022 % 0.18/0.34 % CPUTime : % 0.21/0.49 % SZS status Theorem % 0.21/0.49 % SZS output begin IncompleteProof % 0.21/0.49 cnf(c0, axiom, % 0.21/0.49 ~greater(vd486,vd488)). % 0.21/0.49 cnf(c1, plain, % 0.21/0.49 ~greater(vd486,vd488), % 0.21/0.49 inference(start, [], [c0])). % 0.21/0.49 % 0.21/0.49 cnf(c2, axiom, % 0.21/0.49 less(X0,X1) | greater(X0,X1) | X0 = X1). % 0.21/0.49 cnf(a0, assumption, % 0.21/0.49 vd486 = X0). % 0.21/0.49 cnf(a1, assumption, % 0.21/0.49 vd488 = X1). % 0.21/0.49 cnf(c3, plain, % 0.21/0.49 $false, % 0.21/0.49 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.49 cnf(c4, plain, % 0.21/0.49 less(X0,X1) | X0 = X1, % 0.21/0.49 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.49 % 0.21/0.49 cnf(c5, axiom, % 0.21/0.49 less(vmul(X2,X3),vmul(X4,X3)) | ~less(X2,X4)). % 0.21/0.49 cnf(a2, assumption, % 0.21/0.49 X0 = X2). % 0.21/0.49 cnf(a3, assumption, % 0.21/0.49 X1 = X4). % 0.21/0.49 cnf(c6, plain, % 0.21/0.49 X0 = X1, % 0.21/0.49 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.21/0.49 cnf(c7, plain, % 0.21/0.49 less(vmul(X2,X3),vmul(X4,X3)), % 0.21/0.49 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.21/0.49 % 0.21/0.49 cnf(c8, axiom, % 0.21/0.49 ~less(X5,X6) | ~greater(X5,X6)). % 0.21/0.49 cnf(a4, assumption, % 0.21/0.49 vmul(X2,X3) = X5). % 0.21/0.49 cnf(a5, assumption, % 0.21/0.49 vmul(X4,X3) = X6). % 0.21/0.49 cnf(c9, plain, % 0.21/0.49 $false, % 0.21/0.49 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.21/0.49 cnf(c10, plain, % 0.21/0.49 ~greater(X5,X6), % 0.21/0.49 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.21/0.49 % 0.21/0.49 cnf(c11, axiom, % 0.21/0.49 greater(vmul(vd486,vd487),vmul(vd488,vd487))). % 0.21/0.49 cnf(a6, assumption, % 0.21/0.49 X5 = vmul(vd486,vd487)). % 0.21/0.49 cnf(a7, assumption, % 0.21/0.49 X6 = vmul(vd488,vd487)). % 0.21/0.49 cnf(c12, plain, % 0.21/0.49 $false, % 0.21/0.49 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.21/0.49 cnf(c13, plain, % 0.21/0.49 $false, % 0.21/0.49 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.21/0.49 % 0.21/0.49 cnf(c14, axiom, % 0.21/0.49 greater(vmul(vd486,vd487),vmul(vd488,vd487))). % 0.21/0.49 cnf(a8, assumption, % 0.21/0.49 vd488 = X1). % 0.21/0.49 cnf(c15, plain, % 0.21/0.49 $false, % 0.21/0.49 inference(strict_subterm_extension, [assumptions([a8])], [c6, c14])). % 0.21/0.49 cnf(c16, plain, % 0.21/0.49 $false, % 0.21/0.49 inference(strict_subterm_extension, [assumptions([a8])], [c6, c14])). % 0.21/0.49 cnf(c17, plain, % 0.21/0.49 greater(vmul(vd486,vd487),vmul(X0,vd487)), % 0.21/0.49 inference(strict_subterm_extension, [assumptions([a8])], [c6, c14])). % 0.21/0.49 % 0.21/0.49 cnf(c18, axiom, % 0.21/0.49 ~greater(X7,X7)). % 0.21/0.49 cnf(a9, assumption, % 0.21/0.49 vmul(vd486,vd487) = X7). % 0.21/0.49 cnf(a10, assumption, % 0.21/0.49 vmul(X0,vd487) = X7). % 0.21/0.49 cnf(c19, plain, % 0.21/0.49 $false, % 0.21/0.49 inference(strict_predicate_extension, [assumptions([a9, a10])], [c17, c18])). % 0.21/0.49 cnf(c20, plain, % 0.21/0.49 $false, % 0.21/0.49 inference(strict_predicate_extension, [assumptions([a9, a10])], [c17, c18])). % 0.21/0.49 % 0.21/0.49 cnf(c21, plain, % 0.21/0.49 $false, % 0.21/0.49 inference(constraint_solving, [ % 0.21/0.49 bind(X0, vd486), % 0.21/0.49 bind(X1, vd488), % 0.21/0.49 bind(X2, vd486), % 0.21/0.49 bind(X3, vd487), % 0.21/0.49 bind(X4, vd488), % 0.21/0.49 bind(X5, vmul(X2,X3)), % 0.21/0.49 bind(X6, vmul(X4,X3)), % 0.21/0.49 bind(X7, vmul(vd486,vd487)) % 0.21/0.49 ], % 0.21/0.49 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])). % 0.21/0.49 % 0.21/0.49 % SZS output end IncompleteProof %------------------------------------------------------------------------------