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