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