%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CSR115+5 : 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 : n022.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:41 EDT 2022 % Result : Theorem 6.94s 1.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : CSR115+5 : TPTP v8.1.0. Released v4.0.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n022.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sat Jun 11 02:48:49 EDT 2022 % 0.13/0.33 % CPUTime : % 6.94/1.37 % SZS status Theorem % 6.94/1.37 % SZS output begin IncompleteProof % 6.94/1.37 cnf(c0, axiom, % 6.94/1.37 ~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)). % 6.94/1.37 cnf(c1, plain, % 6.94/1.37 ~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), % 6.94/1.37 inference(start, [], [c0])). % 6.94/1.37 % 6.94/1.37 cnf(c2, axiom, % 6.94/1.37 val(c55668,bmw_0)). % 6.94/1.37 cnf(a0, assumption, % 6.94/1.37 X0 = c55668). % 6.94/1.37 cnf(a1, assumption, % 6.94/1.37 bmw_0 = bmw_0). % 6.94/1.37 cnf(c3, plain, % 6.94/1.37 ~sub(X0,name_1_1) | ~sub(X1,firma_1_1) | ~prop(X1,britisch__1_1) | ~obj(X2,X1) | ~attr(X3,X4) | ~attr(X5,X0), % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 6.94/1.37 cnf(c4, plain, % 6.94/1.37 $false, % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 6.94/1.37 % 6.94/1.37 cnf(c5, axiom, % 6.94/1.37 sub(c55668,name_1_1)). % 6.94/1.37 cnf(a2, assumption, % 6.94/1.37 X0 = c55668). % 6.94/1.37 cnf(a3, assumption, % 6.94/1.37 name_1_1 = name_1_1). % 6.94/1.37 cnf(c6, plain, % 6.94/1.37 ~sub(X1,firma_1_1) | ~prop(X1,britisch__1_1) | ~obj(X2,X1) | ~attr(X3,X4) | ~attr(X5,X0), % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 6.94/1.37 cnf(c7, plain, % 6.94/1.37 $false, % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 6.94/1.37 % 6.94/1.37 cnf(c8, axiom, % 6.94/1.37 sub(c55986,firma_1_1)). % 6.94/1.37 cnf(a4, assumption, % 6.94/1.37 X1 = c55986). % 6.94/1.37 cnf(a5, assumption, % 6.94/1.37 firma_1_1 = firma_1_1). % 6.94/1.37 cnf(c9, plain, % 6.94/1.37 ~prop(X1,britisch__1_1) | ~obj(X2,X1) | ~attr(X3,X4) | ~attr(X5,X0), % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 6.94/1.37 cnf(c10, plain, % 6.94/1.37 $false, % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 6.94/1.37 % 6.94/1.37 cnf(c11, axiom, % 6.94/1.37 prop(c55986,britisch__1_1)). % 6.94/1.37 cnf(a6, assumption, % 6.94/1.37 X1 = c55986). % 6.94/1.37 cnf(a7, assumption, % 6.94/1.37 britisch__1_1 = britisch__1_1). % 6.94/1.37 cnf(c12, plain, % 6.94/1.37 ~obj(X2,X1) | ~attr(X3,X4) | ~attr(X5,X0), % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])). % 6.94/1.37 cnf(c13, plain, % 6.94/1.37 $false, % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])). % 6.94/1.37 % 6.94/1.37 cnf(c14, axiom, % 6.94/1.37 obj(sK100(X6),X6) | ~sP36(X6)). % 6.94/1.37 cnf(a8, assumption, % 6.94/1.37 X2 = sK100(X6)). % 6.94/1.37 cnf(a9, assumption, % 6.94/1.37 X1 = X6). % 6.94/1.37 cnf(c15, plain, % 6.94/1.37 ~attr(X3,X4) | ~attr(X5,X0), % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 6.94/1.37 cnf(c16, plain, % 6.94/1.37 ~sP36(X6), % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 6.94/1.37 % 6.94/1.37 cnf(c17, axiom, % 6.94/1.37 sP36(X7) | ~sub(X8,X9) | ~member(X9,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X7,X8)). % 6.94/1.37 cnf(a10, assumption, % 6.94/1.37 X6 = X7). % 6.94/1.37 cnf(c18, plain, % 6.94/1.37 $false, % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a10])], [c16, c17])). % 6.94/1.37 cnf(c19, plain, % 6.94/1.37 ~sub(X8,X9) | ~member(X9,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X7,X8), % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a10])], [c16, c17])). % 6.94/1.37 % 6.94/1.37 cnf(c20, axiom, % 6.94/1.37 sub(c55987,name_1_1)). % 6.94/1.37 cnf(a11, assumption, % 6.94/1.37 X8 = c55987). % 6.94/1.37 cnf(a12, assumption, % 6.94/1.37 X9 = name_1_1). % 6.94/1.37 cnf(c21, plain, % 6.94/1.37 ~member(X9,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X7,X8), % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a11, a12])], [c19, c20])). % 6.94/1.37 cnf(c22, plain, % 6.94/1.37 $false, % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a11, a12])], [c19, c20])). % 6.94/1.37 % 6.94/1.37 cnf(c23, axiom, % 6.94/1.37 member(X10,cons(X11,X12)) | ~member(X10,X12)). % 6.94/1.37 cnf(a13, assumption, % 6.94/1.37 X9 = X10). % 6.94/1.37 cnf(a14, assumption, % 6.94/1.37 cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))) = cons(X11,X12)). % 6.94/1.37 cnf(c24, plain, % 6.94/1.37 ~attr(X7,X8), % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a13, a14])], [c21, c23])). % 6.94/1.37 cnf(c25, plain, % 6.94/1.37 ~member(X10,X12), % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a13, a14])], [c21, c23])). % 6.94/1.37 % 6.94/1.37 cnf(c26, axiom, % 6.94/1.37 member(X13,cons(X14,X15)) | ~member(X13,X15)). % 6.94/1.37 cnf(a15, assumption, % 6.94/1.37 X10 = X13). % 6.94/1.37 cnf(a16, assumption, % 6.94/1.37 X12 = cons(X14,X15)). % 6.94/1.37 cnf(c27, plain, % 6.94/1.37 $false, % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a15, a16])], [c25, c26])). % 6.94/1.37 cnf(c28, plain, % 6.94/1.37 ~member(X13,X15), % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a15, a16])], [c25, c26])). % 6.94/1.37 % 6.94/1.37 cnf(c29, axiom, % 6.94/1.37 member(X16,cons(X16,X17))). % 6.94/1.37 cnf(a17, assumption, % 6.94/1.37 X13 = X16). % 6.94/1.37 cnf(a18, assumption, % 6.94/1.37 X15 = cons(X16,X17)). % 6.94/1.37 cnf(c30, plain, % 6.94/1.37 $false, % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a17, a18])], [c28, c29])). % 6.94/1.37 cnf(c31, plain, % 6.94/1.37 $false, % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a17, a18])], [c28, c29])). % 6.94/1.37 % 6.94/1.37 cnf(c32, axiom, % 6.94/1.37 attr(c55986,c55987)). % 6.94/1.37 cnf(a19, assumption, % 6.94/1.37 X7 = c55986). % 6.94/1.37 cnf(a20, assumption, % 6.94/1.37 X8 = c55987). % 6.94/1.37 cnf(c33, plain, % 6.94/1.37 $false, % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a19, a20])], [c24, c32])). % 6.94/1.37 cnf(c34, plain, % 6.94/1.37 $false, % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a19, a20])], [c24, c32])). % 6.94/1.37 % 6.94/1.37 cnf(c35, plain, % 6.94/1.37 attr(X7,X8)). % 6.94/1.37 cnf(a21, assumption, % 6.94/1.37 X3 = X7). % 6.94/1.37 cnf(a22, assumption, % 6.94/1.37 X4 = X8). % 6.94/1.37 cnf(c36, plain, % 6.94/1.37 ~attr(X5,X0), % 6.94/1.37 inference(predicate_reduction, [assumptions([a21, a22])], [c15, c35])). % 6.94/1.37 % 6.94/1.37 cnf(c37, axiom, % 6.94/1.37 attr(c55667,c55668)). % 6.94/1.37 cnf(a23, assumption, % 6.94/1.37 X5 = c55667). % 6.94/1.37 cnf(a24, assumption, % 6.94/1.37 X0 = c55668). % 6.94/1.37 cnf(c38, plain, % 6.94/1.37 $false, % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a23, a24])], [c36, c37])). % 6.94/1.37 cnf(c39, plain, % 6.94/1.37 $false, % 6.94/1.37 inference(strict_predicate_extension, [assumptions([a23, a24])], [c36, c37])). % 6.94/1.37 % 6.94/1.37 cnf(c40, plain, % 6.94/1.37 $false, % 6.94/1.37 inference(constraint_solving, [ % 6.94/1.37 bind(X0, c55668), % 6.94/1.37 bind(X1, c55986), % 6.94/1.37 bind(X2, sK100(X6)), % 6.94/1.37 bind(X3, c55986), % 6.94/1.37 bind(X4, c55987), % 6.94/1.37 bind(X5, c55667), % 6.94/1.37 bind(X6, c55986), % 6.94/1.37 bind(X7, c55986), % 6.94/1.37 bind(X8, c55987), % 6.94/1.37 bind(X9, name_1_1), % 6.94/1.37 bind(X10, name_1_1), % 6.94/1.37 bind(X11, eigenname_1_1), % 6.94/1.37 bind(X12, cons(familiename_1_1,cons(name_1_1,nil))), % 6.94/1.37 bind(X13, name_1_1), % 6.94/1.37 bind(X14, familiename_1_1), % 6.94/1.37 bind(X15, cons(name_1_1,nil)), % 6.94/1.37 bind(X16, name_1_1), % 6.94/1.37 bind(X17, nil) % 6.94/1.37 ], % 6.94/1.37 [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])). % 6.94/1.37 % 6.94/1.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------