%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CSR115+31 : 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 : n016.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:35 EDT 2022 % Result : Theorem 80.20s 10.67s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : CSR115+31 : 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.12/0.33 % Computer : n016.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 06:59:41 EDT 2022 % 0.12/0.33 % CPUTime : % 80.20/10.67 % SZS status Theorem % 80.20/10.67 % SZS output begin IncompleteProof % 80.20/10.67 cnf(c0, axiom, % 80.20/10.67 ~val(X0,X1) | ~sub(X0,jahr__1_1) | ~sub(X2,name_1_1) | ~sub(X3,name_1_1) | ~obj(X4,X5) | ~has_card_leq(X1,int1994) | ~attr(X6,X0) | ~attr(X7,X2) | ~attr(X5,X3)). % 80.20/10.67 cnf(c1, plain, % 80.20/10.67 ~val(X0,X1) | ~sub(X0,jahr__1_1) | ~sub(X2,name_1_1) | ~sub(X3,name_1_1) | ~obj(X4,X5) | ~has_card_leq(X1,int1994) | ~attr(X6,X0) | ~attr(X7,X2) | ~attr(X5,X3), % 80.20/10.67 inference(start, [], [c0])). % 80.20/10.67 % 80.20/10.67 cnf(c2, axiom, % 80.20/10.67 val(c5139,c5136)). % 80.20/10.67 cnf(a0, assumption, % 80.20/10.67 X0 = c5139). % 80.20/10.67 cnf(a1, assumption, % 80.20/10.67 X1 = c5136). % 80.20/10.67 cnf(c3, plain, % 80.20/10.67 ~sub(X0,jahr__1_1) | ~sub(X2,name_1_1) | ~sub(X3,name_1_1) | ~obj(X4,X5) | ~has_card_leq(X1,int1994) | ~attr(X6,X0) | ~attr(X7,X2) | ~attr(X5,X3), % 80.20/10.67 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 80.20/10.67 cnf(c4, plain, % 80.20/10.67 $false, % 80.20/10.67 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 80.20/10.67 % 80.20/10.67 cnf(c5, axiom, % 80.20/10.67 sub(c5139,jahr__1_1)). % 80.20/10.67 cnf(a2, assumption, % 80.20/10.67 X0 = c5139). % 80.20/10.67 cnf(a3, assumption, % 80.20/10.67 jahr__1_1 = jahr__1_1). % 80.20/10.67 cnf(c6, plain, % 80.20/10.67 ~sub(X2,name_1_1) | ~sub(X3,name_1_1) | ~obj(X4,X5) | ~has_card_leq(X1,int1994) | ~attr(X6,X0) | ~attr(X7,X2) | ~attr(X5,X3), % 80.20/10.67 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 80.20/10.67 cnf(c7, plain, % 80.20/10.67 $false, % 80.20/10.67 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 80.20/10.67 % 80.20/10.67 cnf(c8, axiom, % 80.20/10.67 sub(c12,name_1_1)). % 80.20/10.67 cnf(a4, assumption, % 80.20/10.67 X2 = c12). % 80.20/10.67 cnf(a5, assumption, % 80.20/10.67 name_1_1 = name_1_1). % 80.20/10.67 cnf(c9, plain, % 80.20/10.67 ~sub(X3,name_1_1) | ~obj(X4,X5) | ~has_card_leq(X1,int1994) | ~attr(X6,X0) | ~attr(X7,X2) | ~attr(X5,X3), % 80.20/10.67 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 80.20/10.67 cnf(c10, plain, % 80.20/10.67 $false, % 80.20/10.67 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 80.20/10.67 % 80.20/10.67 cnf(c11, plain, % 80.20/10.67 sub(X2,name_1_1)). % 80.20/10.67 cnf(a6, assumption, % 80.20/10.67 X3 = X2). % 80.20/10.67 cnf(a7, assumption, % 80.20/10.67 name_1_1 = name_1_1). % 80.20/10.67 cnf(c12, plain, % 80.20/10.67 ~obj(X4,X5) | ~has_card_leq(X1,int1994) | ~attr(X6,X0) | ~attr(X7,X2) | ~attr(X5,X3), % 80.20/10.67 inference(predicate_reduction, [assumptions([a6, a7])], [c9, c11])). % 80.20/10.67 % 80.20/10.67 cnf(c13, axiom, % 80.20/10.67 obj(sK100(X8),X8) | ~sP36(X8)). % 80.20/10.67 cnf(a8, assumption, % 80.20/10.67 X4 = sK100(X8)). % 80.20/10.67 cnf(a9, assumption, % 80.20/10.67 X5 = X8). % 80.20/10.67 cnf(c14, plain, % 80.20/10.67 ~has_card_leq(X1,int1994) | ~attr(X6,X0) | ~attr(X7,X2) | ~attr(X5,X3), % 80.20/10.67 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c13])). % 80.20/10.67 cnf(c15, plain, % 80.20/10.67 ~sP36(X8), % 80.20/10.67 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c13])). % 80.20/10.67 % 80.20/10.67 cnf(c16, axiom, % 80.20/10.67 sP36(X9) | ~sub(X10,X11) | ~member(X11,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X9,X10)). % 80.20/10.67 cnf(a10, assumption, % 80.20/10.67 X8 = X9). % 80.20/10.67 cnf(c17, plain, % 80.20/10.67 $false, % 80.20/10.67 inference(strict_predicate_extension, [assumptions([a10])], [c15, c16])). % 80.20/10.67 cnf(c18, plain, % 80.20/10.67 ~sub(X10,X11) | ~member(X11,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X9,X10), % 80.20/10.67 inference(strict_predicate_extension, [assumptions([a10])], [c15, c16])). % 80.20/10.67 % 80.20/10.67 cnf(c19, plain, % 80.20/10.67 sub(X2,name_1_1)). % 80.20/10.67 cnf(a11, assumption, % 80.20/10.67 X10 = X2). % 80.20/10.67 cnf(a12, assumption, % 80.20/10.67 X11 = name_1_1). % 80.20/10.67 cnf(c20, plain, % 80.20/10.67 ~member(X11,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X9,X10), % 80.20/10.67 inference(predicate_reduction, [assumptions([a11, a12])], [c18, c19])). % 80.20/10.67 % 80.20/10.67 cnf(c21, axiom, % 80.20/10.67 member(X12,cons(X13,X14)) | ~member(X12,X14)). % 80.20/10.67 cnf(a13, assumption, % 80.20/10.67 X11 = X12). % 80.20/10.67 cnf(a14, assumption, % 80.20/10.67 cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))) = cons(X13,X14)). % 80.20/10.67 cnf(c22, plain, % 80.20/10.67 ~attr(X9,X10), % 80.20/10.67 inference(strict_predicate_extension, [assumptions([a13, a14])], [c20, c21])). % 80.20/10.67 cnf(c23, plain, % 80.20/10.67 ~member(X12,X14), % 80.20/10.67 inference(strict_predicate_extension, [assumptions([a13, a14])], [c20, c21])). % 80.20/10.67 % 80.20/10.67 cnf(c24, axiom, % 80.20/10.67 member(X15,cons(X16,X17)) | ~member(X15,X17)). % 80.20/10.67 cnf(a15, assumption, % 80.20/10.67 X12 = X15). % 80.20/10.67 cnf(a16, assumption, % 80.20/10.67 X14 = cons(X16,X17)). % 80.20/10.67 cnf(c25, plain, % 80.20/10.67 $false, % 80.20/10.67 inference(strict_predicate_extension, [assumptions([a15, a16])], [c23, c24])). % 80.20/10.67 cnf(c26, plain, % 80.20/10.67 ~member(X15,X17), % 80.20/10.67 inference(strict_predicate_extension, [assumptions([a15, a16])], [c23, c24])). % 80.20/10.67 % 80.20/10.67 cnf(c27, axiom, % 80.20/10.67 member(X18,cons(X18,X19))). % 80.20/10.67 cnf(a17, assumption, % 80.20/10.67 X15 = X18). % 80.20/10.67 cnf(a18, assumption, % 80.20/10.67 X17 = cons(X18,X19)). % 80.20/10.67 cnf(c28, plain, % 80.20/10.68 $false, % 80.20/10.68 inference(strict_predicate_extension, [assumptions([a17, a18])], [c26, c27])). % 80.20/10.68 cnf(c29, plain, % 80.20/10.68 $false, % 80.20/10.68 inference(strict_predicate_extension, [assumptions([a17, a18])], [c26, c27])). % 80.20/10.68 % 80.20/10.68 cnf(c30, axiom, % 80.20/10.68 attr(c11,c12)). % 80.20/10.68 cnf(a19, assumption, % 80.20/10.68 X9 = c11). % 80.20/10.68 cnf(a20, assumption, % 80.20/10.68 X10 = c12). % 80.20/10.68 cnf(c31, plain, % 80.20/10.68 $false, % 80.20/10.68 inference(strict_predicate_extension, [assumptions([a19, a20])], [c22, c30])). % 80.20/10.68 cnf(c32, plain, % 80.20/10.68 $false, % 80.20/10.68 inference(strict_predicate_extension, [assumptions([a19, a20])], [c22, c30])). % 80.20/10.68 % 80.20/10.68 cnf(c33, axiom, % 80.20/10.68 has_card_leq(X20,X21) | ~card(X20,X21)). % 80.20/10.68 cnf(a21, assumption, % 80.20/10.68 X1 = X20). % 80.20/10.68 cnf(a22, assumption, % 80.20/10.68 int1994 = X21). % 80.20/10.68 cnf(c34, plain, % 80.20/10.68 ~attr(X6,X0) | ~attr(X7,X2) | ~attr(X5,X3), % 80.20/10.68 inference(strict_predicate_extension, [assumptions([a21, a22])], [c14, c33])). % 80.20/10.68 cnf(c35, plain, % 80.20/10.68 ~card(X20,X21), % 80.20/10.68 inference(strict_predicate_extension, [assumptions([a21, a22])], [c14, c33])). % 80.20/10.68 % 80.20/10.68 cnf(c36, axiom, % 80.20/10.68 card(c5136,int1994)). % 80.20/10.68 cnf(a23, assumption, % 80.20/10.68 X20 = c5136). % 80.20/10.68 cnf(a24, assumption, % 80.20/10.68 X21 = int1994). % 80.20/10.68 cnf(c37, plain, % 80.20/10.68 $false, % 80.20/10.68 inference(strict_predicate_extension, [assumptions([a23, a24])], [c35, c36])). % 80.20/10.68 cnf(c38, plain, % 80.20/10.68 $false, % 80.20/10.68 inference(strict_predicate_extension, [assumptions([a23, a24])], [c35, c36])). % 80.20/10.68 % 80.20/10.68 cnf(c39, axiom, % 80.20/10.68 attr(c5138,c5139)). % 80.20/10.68 cnf(a25, assumption, % 80.20/10.68 X6 = c5138). % 80.20/10.68 cnf(a26, assumption, % 80.20/10.68 X0 = c5139). % 80.20/10.68 cnf(c40, plain, % 80.20/10.68 ~attr(X7,X2) | ~attr(X5,X3), % 80.20/10.68 inference(strict_predicate_extension, [assumptions([a25, a26])], [c34, c39])). % 80.20/10.68 cnf(c41, plain, % 80.20/10.68 $false, % 80.20/10.68 inference(strict_predicate_extension, [assumptions([a25, a26])], [c34, c39])). % 80.20/10.68 % 80.20/10.68 cnf(c42, plain, % 80.20/10.68 attr(X9,X10)). % 80.20/10.68 cnf(a27, assumption, % 80.20/10.68 X7 = X9). % 80.20/10.68 cnf(a28, assumption, % 80.20/10.68 X2 = X10). % 80.20/10.68 cnf(c43, plain, % 80.20/10.68 ~attr(X5,X3), % 80.20/10.68 inference(predicate_reduction, [assumptions([a27, a28])], [c40, c42])). % 80.20/10.68 % 80.20/10.68 cnf(c44, plain, % 80.20/10.68 attr(X9,X10)). % 80.20/10.68 cnf(a29, assumption, % 80.20/10.68 X5 = X9). % 80.20/10.68 cnf(a30, assumption, % 80.20/10.68 X3 = X10). % 80.20/10.68 cnf(c45, plain, % 80.20/10.68 $false, % 80.20/10.68 inference(predicate_reduction, [assumptions([a29, a30])], [c43, c44])). % 80.20/10.68 % 80.20/10.68 cnf(c46, plain, % 80.20/10.68 $false, % 80.20/10.68 inference(constraint_solving, [ % 80.20/10.68 bind(X0, c5139), % 80.20/10.68 bind(X1, c5136), % 80.20/10.68 bind(X2, c12), % 80.20/10.68 bind(X3, c12), % 80.20/10.68 bind(X4, sK100(X8)), % 80.20/10.68 bind(X5, c11), % 80.20/10.68 bind(X6, c5138), % 80.20/10.68 bind(X7, c11), % 80.20/10.68 bind(X8, c11), % 80.20/10.68 bind(X9, c11), % 80.20/10.68 bind(X10, c12), % 80.20/10.68 bind(X11, name_1_1), % 80.20/10.68 bind(X12, name_1_1), % 80.20/10.68 bind(X13, eigenname_1_1), % 80.20/10.68 bind(X14, cons(familiename_1_1,cons(name_1_1,nil))), % 80.20/10.68 bind(X15, name_1_1), % 80.20/10.68 bind(X16, familiename_1_1), % 80.20/10.68 bind(X17, cons(name_1_1,nil)), % 80.20/10.68 bind(X18, name_1_1), % 80.20/10.68 bind(X19, nil), % 80.20/10.68 bind(X20, c5136), % 80.20/10.68 bind(X21, int1994) % 80.20/10.68 ], % 80.20/10.68 [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, a29, a30])). % 80.20/10.68 % 80.20/10.68 % SZS output end IncompleteProof %------------------------------------------------------------------------------