%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CSR115+65 : 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 : n029.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:42 EDT 2022 % Result : Theorem 0.43s 0.59s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : CSR115+65 : TPTP v8.1.0. Released v4.0.0. % 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n029.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Fri Jun 10 02:40:07 EDT 2022 % 0.12/0.35 % CPUTime : % 0.43/0.59 % SZS status Theorem % 0.43/0.59 % SZS output begin IncompleteProof % 0.43/0.59 cnf(c0, axiom, % 0.43/0.59 ~obj(X0,X1) | ~attr(X2,X3) | ~attr(X4,X5) | ~attr(X1,X6)). % 0.43/0.59 cnf(c1, plain, % 0.43/0.59 ~obj(X0,X1) | ~attr(X2,X3) | ~attr(X4,X5) | ~attr(X1,X6), % 0.43/0.59 inference(start, [], [c0])). % 0.43/0.59 % 0.43/0.59 cnf(c2, axiom, % 0.43/0.59 obj(sK100(X7),X7) | ~sP36(X7)). % 0.43/0.59 cnf(a0, assumption, % 0.43/0.59 X0 = sK100(X7)). % 0.43/0.59 cnf(a1, assumption, % 0.43/0.59 X1 = X7). % 0.43/0.59 cnf(c3, plain, % 0.43/0.59 ~attr(X2,X3) | ~attr(X4,X5) | ~attr(X1,X6), % 0.43/0.59 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.43/0.59 cnf(c4, plain, % 0.43/0.59 ~sP36(X7), % 0.43/0.59 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.43/0.59 % 0.43/0.59 cnf(c5, axiom, % 0.43/0.59 sP36(X8) | ~sub(X9,X10) | ~member(X10,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X8,X9)). % 0.43/0.59 cnf(a2, assumption, % 0.43/0.59 X7 = X8). % 0.43/0.59 cnf(c6, plain, % 0.43/0.59 $false, % 0.43/0.59 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])). % 0.43/0.59 cnf(c7, plain, % 0.43/0.59 ~sub(X9,X10) | ~member(X10,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X8,X9), % 0.43/0.59 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])). % 0.43/0.59 % 0.43/0.59 cnf(c8, axiom, % 0.43/0.59 sub(c34926,familiename_1_1)). % 0.43/0.59 cnf(a3, assumption, % 0.43/0.59 X9 = c34926). % 0.43/0.59 cnf(a4, assumption, % 0.43/0.59 X10 = familiename_1_1). % 0.43/0.59 cnf(c9, plain, % 0.43/0.59 ~member(X10,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X8,X9), % 0.43/0.59 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 0.43/0.59 cnf(c10, plain, % 0.43/0.59 $false, % 0.43/0.59 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 0.43/0.59 % 0.43/0.59 cnf(c11, axiom, % 0.43/0.59 member(X11,cons(X12,X13)) | ~member(X11,X13)). % 0.43/0.59 cnf(a5, assumption, % 0.43/0.59 X10 = X11). % 0.43/0.59 cnf(a6, assumption, % 0.43/0.59 cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))) = cons(X12,X13)). % 0.43/0.59 cnf(c12, plain, % 0.43/0.59 ~attr(X8,X9), % 0.43/0.59 inference(strict_predicate_extension, [assumptions([a5, a6])], [c9, c11])). % 0.43/0.59 cnf(c13, plain, % 0.43/0.59 ~member(X11,X13), % 0.43/0.59 inference(strict_predicate_extension, [assumptions([a5, a6])], [c9, c11])). % 0.43/0.59 % 0.43/0.59 cnf(c14, axiom, % 0.43/0.59 member(X14,cons(X14,X15))). % 0.43/0.59 cnf(a7, assumption, % 0.43/0.59 X11 = X14). % 0.43/0.59 cnf(a8, assumption, % 0.43/0.59 X13 = cons(X14,X15)). % 0.43/0.59 cnf(c15, plain, % 0.43/0.59 $false, % 0.43/0.59 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 0.43/0.59 cnf(c16, plain, % 0.43/0.59 $false, % 0.43/0.59 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])). % 0.43/0.59 % 0.43/0.59 cnf(c17, axiom, % 0.43/0.59 attr(c34925,c34926)). % 0.43/0.59 cnf(a9, assumption, % 0.43/0.59 X8 = c34925). % 0.43/0.59 cnf(a10, assumption, % 0.43/0.59 X9 = c34926). % 0.43/0.59 cnf(c18, plain, % 0.43/0.59 $false, % 0.43/0.59 inference(strict_predicate_extension, [assumptions([a9, a10])], [c12, c17])). % 0.43/0.59 cnf(c19, plain, % 0.43/0.59 $false, % 0.43/0.59 inference(strict_predicate_extension, [assumptions([a9, a10])], [c12, c17])). % 0.43/0.59 % 0.43/0.59 cnf(c20, plain, % 0.43/0.59 attr(X8,X9)). % 0.43/0.59 cnf(a11, assumption, % 0.43/0.59 X2 = X8). % 0.43/0.59 cnf(a12, assumption, % 0.43/0.59 X3 = X9). % 0.43/0.59 cnf(c21, plain, % 0.43/0.59 ~attr(X4,X5) | ~attr(X1,X6), % 0.43/0.59 inference(predicate_reduction, [assumptions([a11, a12])], [c3, c20])). % 0.43/0.59 % 0.43/0.59 cnf(c22, plain, % 0.43/0.59 attr(X8,X9)). % 0.43/0.59 cnf(a13, assumption, % 0.43/0.59 X4 = X8). % 0.43/0.59 cnf(a14, assumption, % 0.43/0.59 X5 = X9). % 0.43/0.59 cnf(c23, plain, % 0.43/0.59 ~attr(X1,X6), % 0.43/0.59 inference(predicate_reduction, [assumptions([a13, a14])], [c21, c22])). % 0.43/0.59 % 0.43/0.59 cnf(c24, plain, % 0.43/0.59 attr(X8,X9)). % 0.43/0.59 cnf(a15, assumption, % 0.43/0.59 X1 = X8). % 0.43/0.59 cnf(a16, assumption, % 0.43/0.59 X6 = X9). % 0.43/0.59 cnf(c25, plain, % 0.43/0.59 $false, % 0.43/0.59 inference(predicate_reduction, [assumptions([a15, a16])], [c23, c24])). % 0.43/0.59 % 0.43/0.59 cnf(c26, plain, % 0.43/0.59 $false, % 0.43/0.59 inference(constraint_solving, [ % 0.43/0.59 bind(X0, sK100(X7)), % 0.43/0.59 bind(X1, c34925), % 0.43/0.59 bind(X2, c34925), % 0.43/0.59 bind(X3, c34926), % 0.43/0.59 bind(X4, c34925), % 0.43/0.59 bind(X5, c34926), % 0.43/0.59 bind(X6, c34926), % 0.43/0.59 bind(X7, c34925), % 0.43/0.59 bind(X8, c34925), % 0.43/0.59 bind(X9, c34926), % 0.43/0.59 bind(X10, familiename_1_1), % 0.43/0.59 bind(X11, familiename_1_1), % 0.43/0.59 bind(X12, eigenname_1_1), % 0.43/0.59 bind(X13, cons(familiename_1_1,cons(name_1_1,nil))), % 0.43/0.59 bind(X14, familiename_1_1), % 0.43/0.59 bind(X15, cons(name_1_1,nil)) % 0.43/0.59 ], % 0.43/0.59 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])). % 0.43/0.59 % 0.43/0.59 % SZS output end IncompleteProof %------------------------------------------------------------------------------