%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : RNG006-2 : TPTP v8.1.0. Released v1.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 : n028.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 20:33:21 EDT 2022 % Result : Unsatisfiable 0.12s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : RNG006-2 : TPTP v8.1.0. Released v1.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 : n028.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 : Mon May 30 20:17:35 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 % SZS status Unsatisfiable % 0.12/0.34 % SZS output begin IncompleteProof % 0.12/0.34 cnf(c0, axiom, % 0.12/0.34 ~product(a,bS_Ic,aPb_S_IaPc)). % 0.12/0.34 cnf(c1, plain, % 0.12/0.34 ~product(a,bS_Ic,aPb_S_IaPc), % 0.12/0.34 inference(start, [], [c0])). % 0.12/0.34 % 0.12/0.34 cnf(c2, axiom, % 0.12/0.34 product(X0,X1,X2) | ~sum(X3,X4,X2) | ~sum(X5,X6,X1) | ~product(X0,X6,X4) | ~product(X0,X5,X3)). % 0.12/0.34 cnf(a0, assumption, % 0.12/0.34 a = X0). % 0.12/0.34 cnf(a1, assumption, % 0.12/0.34 bS_Ic = X1). % 0.12/0.34 cnf(a2, assumption, % 0.12/0.34 aPb_S_IaPc = X2). % 0.12/0.34 cnf(c3, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.12/0.34 cnf(c4, plain, % 0.12/0.34 ~sum(X3,X4,X2) | ~sum(X5,X6,X1) | ~product(X0,X6,X4) | ~product(X0,X5,X3), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.12/0.34 % 0.12/0.34 cnf(c5, axiom, % 0.12/0.34 sum(aPb,additive_inverse(aPc),aPb_S_IaPc)). % 0.12/0.34 cnf(a3, assumption, % 0.12/0.34 X3 = aPb). % 0.12/0.34 cnf(a4, assumption, % 0.12/0.34 X4 = additive_inverse(aPc)). % 0.12/0.34 cnf(a5, assumption, % 0.12/0.34 X2 = aPb_S_IaPc). % 0.12/0.34 cnf(c6, plain, % 0.12/0.34 ~sum(X5,X6,X1) | ~product(X0,X6,X4) | ~product(X0,X5,X3), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.12/0.34 cnf(c7, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])). % 0.12/0.34 % 0.12/0.34 cnf(c8, axiom, % 0.12/0.34 sum(b,additive_inverse(c),bS_Ic)). % 0.12/0.34 cnf(a6, assumption, % 0.12/0.34 X5 = b). % 0.12/0.34 cnf(a7, assumption, % 0.12/0.34 X6 = additive_inverse(c)). % 0.12/0.34 cnf(a8, assumption, % 0.12/0.34 X1 = bS_Ic). % 0.12/0.34 cnf(c9, plain, % 0.12/0.34 ~product(X0,X6,X4) | ~product(X0,X5,X3), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])). % 0.12/0.34 cnf(c10, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])). % 0.12/0.34 % 0.12/0.34 cnf(c11, axiom, % 0.12/0.34 product(X7,additive_inverse(X8),additive_inverse(X9)) | ~product(X7,X8,X9)). % 0.12/0.34 cnf(a9, assumption, % 0.12/0.34 X0 = X7). % 0.12/0.34 cnf(a10, assumption, % 0.12/0.34 X6 = additive_inverse(X8)). % 0.12/0.34 cnf(a11, assumption, % 0.12/0.34 X4 = additive_inverse(X9)). % 0.12/0.34 cnf(c12, plain, % 0.12/0.34 ~product(X0,X5,X3), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c9, c11])). % 0.12/0.34 cnf(c13, plain, % 0.12/0.34 ~product(X7,X8,X9), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c9, c11])). % 0.12/0.34 % 0.12/0.34 cnf(c14, axiom, % 0.12/0.34 product(a,c,aPc)). % 0.12/0.34 cnf(a12, assumption, % 0.12/0.34 X7 = a). % 0.12/0.34 cnf(a13, assumption, % 0.12/0.34 X8 = c). % 0.12/0.34 cnf(a14, assumption, % 0.12/0.34 X9 = aPc). % 0.12/0.34 cnf(c15, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c13, c14])). % 0.12/0.34 cnf(c16, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c13, c14])). % 0.12/0.34 % 0.12/0.34 cnf(c17, axiom, % 0.12/0.34 product(a,b,aPb)). % 0.12/0.34 cnf(a15, assumption, % 0.12/0.34 X0 = a). % 0.12/0.34 cnf(a16, assumption, % 0.12/0.34 X5 = b). % 0.12/0.34 cnf(a17, assumption, % 0.12/0.34 X3 = aPb). % 0.12/0.34 cnf(c18, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a15, a16, a17])], [c12, c17])). % 0.12/0.34 cnf(c19, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a15, a16, a17])], [c12, c17])). % 0.12/0.34 % 0.12/0.34 cnf(c20, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(constraint_solving, [ % 0.12/0.34 bind(X0, a), % 0.12/0.34 bind(X1, bS_Ic), % 0.12/0.34 bind(X2, aPb_S_IaPc), % 0.12/0.34 bind(X3, aPb), % 0.12/0.34 bind(X4, additive_inverse(aPc)), % 0.12/0.34 bind(X5, b), % 0.12/0.34 bind(X6, additive_inverse(c)), % 0.12/0.34 bind(X7, a), % 0.12/0.34 bind(X8, c), % 0.12/0.34 bind(X9, aPc) % 0.12/0.34 ], % 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])). % 0.12/0.34 % 0.12/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------