%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CSR115+9 : 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 : 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 : Fri Jul 15 20:37:49 EDT 2022 % Result : Theorem 20.28s 3.11s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : CSR115+9 : TPTP v8.1.0. Released v4.0.0. % 0.00/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 : Sat Jun 11 16:52:35 EDT 2022 % 0.12/0.34 % CPUTime : % 20.28/3.11 % SZS status Theorem % 20.28/3.11 % SZS output begin IncompleteProof % 20.28/3.11 cnf(c0, axiom, % 20.28/3.11 ~val(X0,bmw_0) | ~sub(X0,name_1_1) | ~sub(X1,firma_1_1) | ~prop(X1,britisch__1_1) | ~obj(X2,X1) | ~attr(X3,X4) | ~attr(X5,X0)). % 20.28/3.11 cnf(c1, plain, % 20.28/3.11 ~val(X0,bmw_0) | ~sub(X0,name_1_1) | ~sub(X1,firma_1_1) | ~prop(X1,britisch__1_1) | ~obj(X2,X1) | ~attr(X3,X4) | ~attr(X5,X0), % 20.28/3.11 inference(start, [], [c0])). % 20.28/3.11 % 20.28/3.11 cnf(c2, axiom, % 20.28/3.11 val(c57202,bmw_0)). % 20.28/3.11 cnf(a0, assumption, % 20.28/3.11 X0 = c57202). % 20.28/3.11 cnf(a1, assumption, % 20.28/3.11 bmw_0 = bmw_0). % 20.28/3.11 cnf(c3, plain, % 20.28/3.11 ~sub(X0,name_1_1) | ~sub(X1,firma_1_1) | ~prop(X1,britisch__1_1) | ~obj(X2,X1) | ~attr(X3,X4) | ~attr(X5,X0), % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 20.28/3.11 cnf(c4, plain, % 20.28/3.11 $false, % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 20.28/3.11 % 20.28/3.11 cnf(c5, axiom, % 20.28/3.11 sub(c57202,name_1_1)). % 20.28/3.11 cnf(a2, assumption, % 20.28/3.11 X0 = c57202). % 20.28/3.11 cnf(a3, assumption, % 20.28/3.11 name_1_1 = name_1_1). % 20.28/3.11 cnf(c6, plain, % 20.28/3.11 ~sub(X1,firma_1_1) | ~prop(X1,britisch__1_1) | ~obj(X2,X1) | ~attr(X3,X4) | ~attr(X5,X0), % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 20.28/3.11 cnf(c7, plain, % 20.28/3.11 $false, % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 20.28/3.11 % 20.28/3.11 cnf(c8, axiom, % 20.28/3.11 sub(c58970,firma_1_1)). % 20.28/3.11 cnf(a4, assumption, % 20.28/3.11 X1 = c58970). % 20.28/3.11 cnf(a5, assumption, % 20.28/3.11 firma_1_1 = firma_1_1). % 20.28/3.11 cnf(c9, plain, % 20.28/3.11 ~prop(X1,britisch__1_1) | ~obj(X2,X1) | ~attr(X3,X4) | ~attr(X5,X0), % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 20.28/3.11 cnf(c10, plain, % 20.28/3.11 $false, % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 20.28/3.11 % 20.28/3.11 cnf(c11, axiom, % 20.28/3.11 prop(c58970,britisch__1_1)). % 20.28/3.11 cnf(a6, assumption, % 20.28/3.11 X1 = c58970). % 20.28/3.11 cnf(a7, assumption, % 20.28/3.11 britisch__1_1 = britisch__1_1). % 20.28/3.11 cnf(c12, plain, % 20.28/3.11 ~obj(X2,X1) | ~attr(X3,X4) | ~attr(X5,X0), % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])). % 20.28/3.11 cnf(c13, plain, % 20.28/3.11 $false, % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])). % 20.28/3.11 % 20.28/3.11 cnf(c14, axiom, % 20.28/3.11 obj(sK51(X6,X7),X6) | ~sP2(X6,X7)). % 20.28/3.11 cnf(a8, assumption, % 20.28/3.11 X2 = sK51(X6,X7)). % 20.28/3.11 cnf(a9, assumption, % 20.28/3.11 X1 = X6). % 20.28/3.11 cnf(c15, plain, % 20.28/3.11 ~attr(X3,X4) | ~attr(X5,X0), % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 20.28/3.11 cnf(c16, plain, % 20.28/3.11 ~sP2(X6,X7), % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 20.28/3.11 % 20.28/3.11 cnf(c17, axiom, % 20.28/3.11 sP2(X8,X9) | ~loc(X8,X9) | ~has_fact_leq(X8,real)). % 20.28/3.11 cnf(a10, assumption, % 20.28/3.11 X6 = X8). % 20.28/3.11 cnf(a11, assumption, % 20.28/3.11 X7 = X9). % 20.28/3.11 cnf(c18, plain, % 20.28/3.11 $false, % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 20.28/3.11 cnf(c19, plain, % 20.28/3.11 ~loc(X8,X9) | ~has_fact_leq(X8,real), % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 20.28/3.11 % 20.28/3.11 cnf(c20, axiom, % 20.28/3.11 loc(X10,sK98(X11,X10)) | ~sP34(X11,X10)). % 20.28/3.11 cnf(a12, assumption, % 20.28/3.11 X8 = X10). % 20.28/3.11 cnf(a13, assumption, % 20.28/3.11 X9 = sK98(X11,X10)). % 20.28/3.11 cnf(c21, plain, % 20.28/3.11 ~has_fact_leq(X8,real), % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])). % 20.28/3.11 cnf(c22, plain, % 20.28/3.11 ~sP34(X11,X10), % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])). % 20.28/3.11 % 20.28/3.11 cnf(c23, axiom, % 20.28/3.11 sP34(X12,X13) | ~state_adjective_state_binding(X14,X12) | ~prop(X13,X14)). % 20.28/3.11 cnf(a14, assumption, % 20.28/3.11 X11 = X12). % 20.28/3.11 cnf(a15, assumption, % 20.28/3.11 X10 = X13). % 20.28/3.11 cnf(c24, plain, % 20.28/3.11 $false, % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])). % 20.28/3.11 cnf(c25, plain, % 20.28/3.11 ~state_adjective_state_binding(X14,X12) | ~prop(X13,X14), % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])). % 20.28/3.11 % 20.28/3.11 cnf(c26, axiom, % 20.28/3.11 state_adjective_state_binding(britisch__1_1,grossbritannien_0)). % 20.28/3.11 cnf(a16, assumption, % 20.28/3.11 X14 = britisch__1_1). % 20.28/3.11 cnf(a17, assumption, % 20.28/3.11 X12 = grossbritannien_0). % 20.28/3.11 cnf(c27, plain, % 20.28/3.11 ~prop(X13,X14), % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a16, a17])], [c25, c26])). % 20.28/3.11 cnf(c28, plain, % 20.28/3.11 $false, % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a16, a17])], [c25, c26])). % 20.28/3.11 % 20.28/3.11 cnf(c29, plain, % 20.28/3.11 prop(X1,britisch__1_1)). % 20.28/3.11 cnf(a18, assumption, % 20.28/3.11 X13 = X1). % 20.28/3.11 cnf(a19, assumption, % 20.28/3.11 X14 = britisch__1_1). % 20.28/3.11 cnf(c30, plain, % 20.28/3.11 $false, % 20.28/3.11 inference(predicate_reduction, [assumptions([a18, a19])], [c27, c29])). % 20.28/3.11 % 20.28/3.11 cnf(c31, axiom, % 20.28/3.11 has_fact_leq(X15,X16) | ~fact(X15,X16)). % 20.28/3.11 cnf(a20, assumption, % 20.28/3.11 X8 = X15). % 20.28/3.11 cnf(a21, assumption, % 20.28/3.11 real = X16). % 20.28/3.11 cnf(c32, plain, % 20.28/3.11 $false, % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a20, a21])], [c21, c31])). % 20.28/3.11 cnf(c33, plain, % 20.28/3.11 ~fact(X15,X16), % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a20, a21])], [c21, c31])). % 20.28/3.11 % 20.28/3.11 cnf(c34, axiom, % 20.28/3.11 fact(c58970,real)). % 20.28/3.11 cnf(a22, assumption, % 20.28/3.11 X15 = c58970). % 20.28/3.11 cnf(a23, assumption, % 20.28/3.11 X16 = real). % 20.28/3.11 cnf(c35, plain, % 20.28/3.11 $false, % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a22, a23])], [c33, c34])). % 20.28/3.11 cnf(c36, plain, % 20.28/3.11 $false, % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a22, a23])], [c33, c34])). % 20.28/3.11 % 20.28/3.11 cnf(c37, axiom, % 20.28/3.11 attr(c59035,c59036)). % 20.28/3.11 cnf(a24, assumption, % 20.28/3.11 X3 = c59035). % 20.28/3.11 cnf(a25, assumption, % 20.28/3.11 X4 = c59036). % 20.28/3.11 cnf(c38, plain, % 20.28/3.11 ~attr(X5,X0), % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a24, a25])], [c15, c37])). % 20.28/3.11 cnf(c39, plain, % 20.28/3.11 $false, % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a24, a25])], [c15, c37])). % 20.28/3.11 % 20.28/3.11 cnf(c40, axiom, % 20.28/3.11 attr(c57201,c57202)). % 20.28/3.11 cnf(a26, assumption, % 20.28/3.11 X5 = c57201). % 20.28/3.11 cnf(a27, assumption, % 20.28/3.11 X0 = c57202). % 20.28/3.11 cnf(c41, plain, % 20.28/3.11 $false, % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a26, a27])], [c38, c40])). % 20.28/3.11 cnf(c42, plain, % 20.28/3.11 $false, % 20.28/3.11 inference(strict_predicate_extension, [assumptions([a26, a27])], [c38, c40])). % 20.28/3.11 % 20.28/3.11 cnf(c43, plain, % 20.28/3.11 $false, % 20.28/3.11 inference(constraint_solving, [ % 20.28/3.11 bind(X0, c57202), % 20.28/3.11 bind(X1, c58970), % 20.28/3.11 bind(X2, sK51(X6,X7)), % 20.28/3.11 bind(X3, c59035), % 20.28/3.11 bind(X4, c59036), % 20.28/3.11 bind(X5, c57201), % 20.28/3.11 bind(X6, c58970), % 20.28/3.11 bind(X7, sK98(X11,X10)), % 20.28/3.11 bind(X8, c58970), % 20.28/3.11 bind(X9, sK98(X11,X10)), % 20.28/3.11 bind(X10, c58970), % 20.28/3.11 bind(X11, grossbritannien_0), % 20.28/3.11 bind(X12, grossbritannien_0), % 20.28/3.11 bind(X13, c58970), % 20.28/3.11 bind(X14, britisch__1_1), % 20.28/3.11 bind(X15, c58970), % 20.28/3.11 bind(X16, real) % 20.28/3.11 ], % 20.28/3.11 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27])). % 20.28/3.11 % 20.28/3.11 % SZS output end IncompleteProof %------------------------------------------------------------------------------