%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CSR115+48 : 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 : n021.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:38 EDT 2022 % Result : Theorem 0.42s 0.57s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : CSR115+48 : TPTP v8.1.0. Released v4.0.0. % 0.03/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.35 % Computer : n021.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Fri Jun 10 22:06:54 EDT 2022 % 0.14/0.35 % CPUTime : % 0.42/0.57 % SZS status Theorem % 0.42/0.57 % SZS output begin IncompleteProof % 0.42/0.57 cnf(c0, axiom, % 0.42/0.57 ~val(X0,X1) | ~val(X2,bmw_0) | ~val(X3,bmw_0) | ~temp(X4,X5) | ~sub(X0,jahr__1_1) | ~sub(X2,name_1_1) | ~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7)). % 0.42/0.57 cnf(c1, plain, % 0.42/0.57 ~val(X0,X1) | ~val(X2,bmw_0) | ~val(X3,bmw_0) | ~temp(X4,X5) | ~sub(X0,jahr__1_1) | ~sub(X2,name_1_1) | ~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7), % 0.42/0.57 inference(start, [], [c0])). % 0.42/0.57 % 0.42/0.57 cnf(c2, axiom, % 0.42/0.57 val(c518,c508)). % 0.42/0.57 cnf(a0, assumption, % 0.42/0.57 X0 = c518). % 0.42/0.57 cnf(a1, assumption, % 0.42/0.57 X1 = c508). % 0.42/0.57 cnf(c3, plain, % 0.42/0.57 ~val(X2,bmw_0) | ~val(X3,bmw_0) | ~temp(X4,X5) | ~sub(X0,jahr__1_1) | ~sub(X2,name_1_1) | ~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7), % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.42/0.57 cnf(c4, plain, % 0.42/0.57 $false, % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.42/0.57 % 0.42/0.57 cnf(c5, axiom, % 0.42/0.57 val(c420,bmw_0)). % 0.42/0.57 cnf(a2, assumption, % 0.42/0.57 X2 = c420). % 0.42/0.57 cnf(a3, assumption, % 0.42/0.57 bmw_0 = bmw_0). % 0.42/0.57 cnf(c6, plain, % 0.42/0.57 ~val(X3,bmw_0) | ~temp(X4,X5) | ~sub(X0,jahr__1_1) | ~sub(X2,name_1_1) | ~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7), % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 0.42/0.57 cnf(c7, plain, % 0.42/0.57 $false, % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 0.42/0.57 % 0.42/0.57 cnf(c8, plain, % 0.42/0.57 val(X2,bmw_0)). % 0.42/0.57 cnf(a4, assumption, % 0.42/0.57 X3 = X2). % 0.42/0.57 cnf(a5, assumption, % 0.42/0.57 bmw_0 = bmw_0). % 0.42/0.57 cnf(c9, plain, % 0.42/0.57 ~temp(X4,X5) | ~sub(X0,jahr__1_1) | ~sub(X2,name_1_1) | ~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7), % 0.42/0.57 inference(predicate_reduction, [assumptions([a4, a5])], [c6, c8])). % 0.42/0.57 % 0.42/0.57 cnf(c10, axiom, % 0.42/0.57 temp(c519,c517)). % 0.42/0.57 cnf(a6, assumption, % 0.42/0.57 X4 = c519). % 0.42/0.57 cnf(a7, assumption, % 0.42/0.57 X5 = c517). % 0.42/0.57 cnf(c11, plain, % 0.42/0.57 ~sub(X0,jahr__1_1) | ~sub(X2,name_1_1) | ~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7), % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c10])). % 0.42/0.57 cnf(c12, plain, % 0.42/0.57 $false, % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c10])). % 0.42/0.57 % 0.42/0.57 cnf(c13, axiom, % 0.42/0.57 sub(c518,jahr__1_1)). % 0.42/0.57 cnf(a8, assumption, % 0.42/0.57 X0 = c518). % 0.42/0.57 cnf(a9, assumption, % 0.42/0.57 jahr__1_1 = jahr__1_1). % 0.42/0.57 cnf(c14, plain, % 0.42/0.57 ~sub(X2,name_1_1) | ~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7), % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a8, a9])], [c11, c13])). % 0.42/0.57 cnf(c15, plain, % 0.42/0.57 $false, % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a8, a9])], [c11, c13])). % 0.42/0.57 % 0.42/0.57 cnf(c16, axiom, % 0.42/0.57 sub(c420,name_1_1)). % 0.42/0.57 cnf(a10, assumption, % 0.42/0.57 X2 = c420). % 0.42/0.57 cnf(a11, assumption, % 0.42/0.57 name_1_1 = name_1_1). % 0.42/0.57 cnf(c17, plain, % 0.42/0.57 ~sub(X6,firma_1_1) | ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7), % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a10, a11])], [c14, c16])). % 0.42/0.57 cnf(c18, plain, % 0.42/0.57 $false, % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a10, a11])], [c14, c16])). % 0.42/0.57 % 0.42/0.57 cnf(c19, axiom, % 0.42/0.57 sub(c419,firma_1_1)). % 0.42/0.57 cnf(a12, assumption, % 0.42/0.57 X6 = c419). % 0.42/0.57 cnf(a13, assumption, % 0.42/0.57 firma_1_1 = firma_1_1). % 0.42/0.57 cnf(c20, plain, % 0.42/0.57 ~sub(X3,name_1_1) | ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7), % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c19])). % 0.42/0.57 cnf(c21, plain, % 0.42/0.57 $false, % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c19])). % 0.42/0.57 % 0.42/0.57 cnf(c22, plain, % 0.42/0.57 sub(X2,name_1_1)). % 0.42/0.57 cnf(a14, assumption, % 0.42/0.57 X3 = X2). % 0.42/0.57 cnf(a15, assumption, % 0.42/0.57 name_1_1 = name_1_1). % 0.42/0.57 cnf(c23, plain, % 0.42/0.57 ~has_card_leq(X1,int1994) | ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7), % 0.42/0.57 inference(predicate_reduction, [assumptions([a14, a15])], [c20, c22])). % 0.42/0.57 % 0.42/0.57 cnf(c24, axiom, % 0.42/0.57 has_card_leq(X8,X9) | ~card(X8,X9)). % 0.42/0.57 cnf(a16, assumption, % 0.42/0.57 X1 = X8). % 0.42/0.57 cnf(a17, assumption, % 0.42/0.57 int1994 = X9). % 0.42/0.57 cnf(c25, plain, % 0.42/0.57 ~attr(X5,X0) | ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7), % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])). % 0.42/0.57 cnf(c26, plain, % 0.42/0.57 ~card(X8,X9), % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])). % 0.42/0.57 % 0.42/0.57 cnf(c27, axiom, % 0.42/0.57 card(c508,int1994)). % 0.42/0.57 cnf(a18, assumption, % 0.42/0.57 X8 = c508). % 0.42/0.57 cnf(a19, assumption, % 0.42/0.57 X9 = int1994). % 0.42/0.57 cnf(c28, plain, % 0.42/0.57 $false, % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a18, a19])], [c26, c27])). % 0.42/0.57 cnf(c29, plain, % 0.42/0.57 $false, % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a18, a19])], [c26, c27])). % 0.42/0.57 % 0.42/0.57 cnf(c30, axiom, % 0.42/0.57 attr(c517,c518)). % 0.42/0.57 cnf(a20, assumption, % 0.42/0.57 X5 = c517). % 0.42/0.57 cnf(a21, assumption, % 0.42/0.57 X0 = c518). % 0.42/0.57 cnf(c31, plain, % 0.42/0.57 ~attr(X7,X2) | ~attr(X6,X3) | ~agt(X4,X7), % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a20, a21])], [c25, c30])). % 0.42/0.57 cnf(c32, plain, % 0.42/0.57 $false, % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a20, a21])], [c25, c30])). % 0.42/0.57 % 0.42/0.57 cnf(c33, axiom, % 0.42/0.57 attr(c419,c420)). % 0.42/0.57 cnf(a22, assumption, % 0.42/0.57 X7 = c419). % 0.42/0.57 cnf(a23, assumption, % 0.42/0.57 X2 = c420). % 0.42/0.57 cnf(c34, plain, % 0.42/0.57 ~attr(X6,X3) | ~agt(X4,X7), % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a22, a23])], [c31, c33])). % 0.42/0.57 cnf(c35, plain, % 0.42/0.57 $false, % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a22, a23])], [c31, c33])). % 0.42/0.57 % 0.42/0.57 cnf(c36, plain, % 0.42/0.57 attr(X7,X2)). % 0.42/0.57 cnf(a24, assumption, % 0.42/0.57 X6 = X7). % 0.42/0.57 cnf(a25, assumption, % 0.42/0.57 X3 = X2). % 0.42/0.57 cnf(c37, plain, % 0.42/0.57 ~agt(X4,X7), % 0.42/0.57 inference(predicate_reduction, [assumptions([a24, a25])], [c34, c36])). % 0.42/0.57 % 0.42/0.57 cnf(c38, axiom, % 0.42/0.57 agt(c519,c419)). % 0.42/0.57 cnf(a26, assumption, % 0.42/0.57 X4 = c519). % 0.42/0.57 cnf(a27, assumption, % 0.42/0.57 X7 = c419). % 0.42/0.57 cnf(c39, plain, % 0.42/0.57 $false, % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a26, a27])], [c37, c38])). % 0.42/0.57 cnf(c40, plain, % 0.42/0.57 $false, % 0.42/0.57 inference(strict_predicate_extension, [assumptions([a26, a27])], [c37, c38])). % 0.42/0.57 % 0.42/0.57 cnf(c41, plain, % 0.42/0.57 $false, % 0.42/0.57 inference(constraint_solving, [ % 0.42/0.57 bind(X0, c518), % 0.42/0.57 bind(X1, c508), % 0.42/0.57 bind(X2, c420), % 0.42/0.57 bind(X3, c420), % 0.42/0.57 bind(X4, c519), % 0.42/0.57 bind(X5, c517), % 0.42/0.57 bind(X6, c419), % 0.42/0.57 bind(X7, c419), % 0.42/0.57 bind(X8, c508), % 0.42/0.57 bind(X9, int1994) % 0.42/0.57 ], % 0.42/0.57 [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])). % 0.42/0.57 % 0.42/0.57 % SZS output end IncompleteProof %------------------------------------------------------------------------------