%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CSR113+13 : 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 : n008.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:20 EDT 2022 % Result : Theorem 18.98s 2.90s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : CSR113+13 : TPTP v8.1.0. Released v4.0.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n008.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.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sat Jun 11 15:24:22 EDT 2022 % 0.13/0.34 % CPUTime : % 18.98/2.90 % SZS status Theorem % 18.98/2.90 % SZS output begin IncompleteProof % 18.98/2.90 cnf(c0, axiom, % 18.98/2.90 ~val(X0,new_york_0) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~attr(X3,X0) | ~flp(X4,X3)). % 18.98/2.90 cnf(c1, plain, % 18.98/2.90 ~val(X0,new_york_0) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~attr(X3,X0) | ~flp(X4,X3), % 18.98/2.90 inference(start, [], [c0])). % 18.98/2.90 % 18.98/2.90 cnf(c2, axiom, % 18.98/2.90 val(c59,new_york_0)). % 18.98/2.90 cnf(a0, assumption, % 18.98/2.90 X0 = c59). % 18.98/2.90 cnf(a1, assumption, % 18.98/2.90 new_york_0 = new_york_0). % 18.98/2.90 cnf(c3, plain, % 18.98/2.90 ~sub(X0,name_1_1) | ~scar(X1,X2) | ~attr(X3,X0) | ~flp(X4,X3), % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 18.98/2.90 cnf(c4, plain, % 18.98/2.90 $false, % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 18.98/2.90 % 18.98/2.90 cnf(c5, axiom, % 18.98/2.90 sub(c59,name_1_1)). % 18.98/2.90 cnf(a2, assumption, % 18.98/2.90 X0 = c59). % 18.98/2.90 cnf(a3, assumption, % 18.98/2.90 name_1_1 = name_1_1). % 18.98/2.90 cnf(c6, plain, % 18.98/2.90 ~scar(X1,X2) | ~attr(X3,X0) | ~flp(X4,X3), % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 18.98/2.90 cnf(c7, plain, % 18.98/2.90 $false, % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 18.98/2.90 % 18.98/2.90 cnf(c8, axiom, % 18.98/2.90 scar(sK100(X5),X5) | ~sP36(X5)). % 18.98/2.90 cnf(a4, assumption, % 18.98/2.90 X1 = sK100(X5)). % 18.98/2.90 cnf(a5, assumption, % 18.98/2.90 X2 = X5). % 18.98/2.90 cnf(c9, plain, % 18.98/2.90 ~attr(X3,X0) | ~flp(X4,X3), % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 18.98/2.90 cnf(c10, plain, % 18.98/2.90 ~sP36(X5), % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 18.98/2.90 % 18.98/2.90 cnf(c11, axiom, % 18.98/2.90 sP36(X6) | ~sub(X7,X8) | ~member(X8,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X6,X7)). % 18.98/2.90 cnf(a6, assumption, % 18.98/2.90 X5 = X6). % 18.98/2.90 cnf(c12, plain, % 18.98/2.90 $false, % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a6])], [c10, c11])). % 18.98/2.90 cnf(c13, plain, % 18.98/2.90 ~sub(X7,X8) | ~member(X8,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X6,X7), % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a6])], [c10, c11])). % 18.98/2.90 % 18.98/2.90 cnf(c14, plain, % 18.98/2.90 sub(X0,name_1_1)). % 18.98/2.90 cnf(a7, assumption, % 18.98/2.90 X7 = X0). % 18.98/2.90 cnf(a8, assumption, % 18.98/2.90 X8 = name_1_1). % 18.98/2.90 cnf(c15, plain, % 18.98/2.90 ~member(X8,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X6,X7), % 18.98/2.90 inference(predicate_reduction, [assumptions([a7, a8])], [c13, c14])). % 18.98/2.90 % 18.98/2.90 cnf(c16, axiom, % 18.98/2.90 member(X9,cons(X10,X11)) | ~member(X9,X11)). % 18.98/2.90 cnf(a9, assumption, % 18.98/2.90 X8 = X9). % 18.98/2.90 cnf(a10, assumption, % 18.98/2.90 cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))) = cons(X10,X11)). % 18.98/2.90 cnf(c17, plain, % 18.98/2.90 ~attr(X6,X7), % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c16])). % 18.98/2.90 cnf(c18, plain, % 18.98/2.90 ~member(X9,X11), % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c16])). % 18.98/2.90 % 18.98/2.90 cnf(c19, axiom, % 18.98/2.90 member(X12,cons(X13,X14)) | ~member(X12,X14)). % 18.98/2.90 cnf(a11, assumption, % 18.98/2.90 X9 = X12). % 18.98/2.90 cnf(a12, assumption, % 18.98/2.90 X11 = cons(X13,X14)). % 18.98/2.90 cnf(c20, plain, % 18.98/2.90 $false, % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c19])). % 18.98/2.90 cnf(c21, plain, % 18.98/2.90 ~member(X12,X14), % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c19])). % 18.98/2.90 % 18.98/2.90 cnf(c22, axiom, % 18.98/2.90 member(X15,cons(X15,X16))). % 18.98/2.90 cnf(a13, assumption, % 18.98/2.90 X12 = X15). % 18.98/2.90 cnf(a14, assumption, % 18.98/2.90 X14 = cons(X15,X16)). % 18.98/2.90 cnf(c23, plain, % 18.98/2.90 $false, % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a13, a14])], [c21, c22])). % 18.98/2.90 cnf(c24, plain, % 18.98/2.90 $false, % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a13, a14])], [c21, c22])). % 18.98/2.90 % 18.98/2.90 cnf(c25, axiom, % 18.98/2.90 attr(c58,c59)). % 18.98/2.90 cnf(a15, assumption, % 18.98/2.90 X6 = c58). % 18.98/2.90 cnf(a16, assumption, % 18.98/2.90 X7 = c59). % 18.98/2.90 cnf(c26, plain, % 18.98/2.90 $false, % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a15, a16])], [c17, c25])). % 18.98/2.90 cnf(c27, plain, % 18.98/2.90 $false, % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a15, a16])], [c17, c25])). % 18.98/2.90 % 18.98/2.90 cnf(c28, plain, % 18.98/2.90 attr(X6,X7)). % 18.98/2.90 cnf(a17, assumption, % 18.98/2.90 X3 = X6). % 18.98/2.90 cnf(a18, assumption, % 18.98/2.90 X0 = X7). % 18.98/2.90 cnf(c29, plain, % 18.98/2.90 ~flp(X4,X3), % 18.98/2.90 inference(predicate_reduction, [assumptions([a17, a18])], [c9, c28])). % 18.98/2.90 % 18.98/2.90 cnf(c30, axiom, % 18.98/2.90 flp(X17,X18) | sP45(X18,X17)). % 18.98/2.90 cnf(a19, assumption, % 18.98/2.90 X4 = X17). % 18.98/2.90 cnf(a20, assumption, % 18.98/2.90 X3 = X18). % 18.98/2.90 cnf(c31, plain, % 18.98/2.90 $false, % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a19, a20])], [c29, c30])). % 18.98/2.90 cnf(c32, plain, % 18.98/2.90 sP45(X18,X17), % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a19, a20])], [c29, c30])). % 18.98/2.90 % 18.98/2.90 cnf(c33, axiom, % 18.98/2.90 ~in(X19,X20) | ~sP45(X20,X19)). % 18.98/2.90 cnf(a21, assumption, % 18.98/2.90 X18 = X20). % 18.98/2.90 cnf(a22, assumption, % 18.98/2.90 X17 = X19). % 18.98/2.90 cnf(c34, plain, % 18.98/2.90 $false, % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a21, a22])], [c32, c33])). % 18.98/2.90 cnf(c35, plain, % 18.98/2.90 ~in(X19,X20), % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a21, a22])], [c32, c33])). % 18.98/2.90 % 18.98/2.90 cnf(c36, axiom, % 18.98/2.90 in(c72,c58)). % 18.98/2.90 cnf(a23, assumption, % 18.98/2.90 X19 = c72). % 18.98/2.90 cnf(a24, assumption, % 18.98/2.90 X20 = c58). % 18.98/2.90 cnf(c37, plain, % 18.98/2.90 $false, % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a23, a24])], [c35, c36])). % 18.98/2.90 cnf(c38, plain, % 18.98/2.90 $false, % 18.98/2.90 inference(strict_predicate_extension, [assumptions([a23, a24])], [c35, c36])). % 18.98/2.90 % 18.98/2.90 cnf(c39, plain, % 18.98/2.90 $false, % 18.98/2.90 inference(constraint_solving, [ % 18.98/2.90 bind(X0, c59), % 18.98/2.90 bind(X1, sK100(X5)), % 18.98/2.90 bind(X2, c58), % 18.98/2.90 bind(X3, c58), % 18.98/2.90 bind(X4, c72), % 18.98/2.90 bind(X5, c58), % 18.98/2.90 bind(X6, c58), % 18.98/2.90 bind(X7, c59), % 18.98/2.90 bind(X8, name_1_1), % 18.98/2.90 bind(X9, name_1_1), % 18.98/2.90 bind(X10, eigenname_1_1), % 18.98/2.90 bind(X11, cons(familiename_1_1,cons(name_1_1,nil))), % 18.98/2.90 bind(X12, name_1_1), % 18.98/2.90 bind(X13, familiename_1_1), % 18.98/2.90 bind(X14, cons(name_1_1,nil)), % 18.98/2.90 bind(X15, name_1_1), % 18.98/2.90 bind(X16, nil), % 18.98/2.90 bind(X17, c72), % 18.98/2.90 bind(X18, c58), % 18.98/2.90 bind(X19, c72), % 18.98/2.90 bind(X20, c58) % 18.98/2.90 ], % 18.98/2.90 [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])). % 18.98/2.90 % 18.98/2.90 % SZS output end IncompleteProof %------------------------------------------------------------------------------