%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CSR114+28 : 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 : n010.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 5.79s 1.24s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : CSR114+28 : TPTP v8.1.0. Released v4.0.0. % 0.12/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n010.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.18/0.33 % DateTime : Sat Jun 11 05:59:10 EDT 2022 % 0.18/0.33 % CPUTime : % 5.79/1.24 % SZS status Theorem % 5.79/1.24 % SZS output begin IncompleteProof % 5.79/1.24 cnf(c0, axiom, % 5.79/1.24 ~val(X0,rom_0) | ~sub(X1,stadt__1_1) | ~sub(X0,name_1_1) | ~scar(X2,X3) | ~attr(X1,X0)). % 5.79/1.24 cnf(c1, plain, % 5.79/1.24 ~val(X0,rom_0) | ~sub(X1,stadt__1_1) | ~sub(X0,name_1_1) | ~scar(X2,X3) | ~attr(X1,X0), % 5.79/1.24 inference(start, [], [c0])). % 5.79/1.24 % 5.79/1.24 cnf(c2, axiom, % 5.79/1.24 val(c621,rom_0)). % 5.79/1.24 cnf(a0, assumption, % 5.79/1.24 X0 = c621). % 5.79/1.24 cnf(a1, assumption, % 5.79/1.24 rom_0 = rom_0). % 5.79/1.24 cnf(c3, plain, % 5.79/1.24 ~sub(X1,stadt__1_1) | ~sub(X0,name_1_1) | ~scar(X2,X3) | ~attr(X1,X0), % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 5.79/1.24 cnf(c4, plain, % 5.79/1.24 $false, % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 5.79/1.24 % 5.79/1.24 cnf(c5, axiom, % 5.79/1.24 sub(c620,stadt__1_1)). % 5.79/1.24 cnf(a2, assumption, % 5.79/1.24 X1 = c620). % 5.79/1.24 cnf(a3, assumption, % 5.79/1.24 stadt__1_1 = stadt__1_1). % 5.79/1.24 cnf(c6, plain, % 5.79/1.24 ~sub(X0,name_1_1) | ~scar(X2,X3) | ~attr(X1,X0), % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 5.79/1.24 cnf(c7, plain, % 5.79/1.24 $false, % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 5.79/1.24 % 5.79/1.24 cnf(c8, axiom, % 5.79/1.24 sub(c621,name_1_1)). % 5.79/1.24 cnf(a4, assumption, % 5.79/1.24 X0 = c621). % 5.79/1.24 cnf(a5, assumption, % 5.79/1.24 name_1_1 = name_1_1). % 5.79/1.24 cnf(c9, plain, % 5.79/1.24 ~scar(X2,X3) | ~attr(X1,X0), % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 5.79/1.24 cnf(c10, plain, % 5.79/1.24 $false, % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 5.79/1.24 % 5.79/1.24 cnf(c11, axiom, % 5.79/1.24 scar(sK100(X4),X4) | ~sP36(X4)). % 5.79/1.24 cnf(a6, assumption, % 5.79/1.24 X2 = sK100(X4)). % 5.79/1.24 cnf(a7, assumption, % 5.79/1.24 X3 = X4). % 5.79/1.24 cnf(c12, plain, % 5.79/1.24 ~attr(X1,X0), % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])). % 5.79/1.24 cnf(c13, plain, % 5.79/1.24 ~sP36(X4), % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])). % 5.79/1.24 % 5.79/1.24 cnf(c14, axiom, % 5.79/1.24 sP36(X5) | ~sub(X6,X7) | ~member(X7,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X5,X6)). % 5.79/1.24 cnf(a8, assumption, % 5.79/1.24 X4 = X5). % 5.79/1.24 cnf(c15, plain, % 5.79/1.24 $false, % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a8])], [c13, c14])). % 5.79/1.24 cnf(c16, plain, % 5.79/1.24 ~sub(X6,X7) | ~member(X7,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X5,X6), % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a8])], [c13, c14])). % 5.79/1.24 % 5.79/1.24 cnf(c17, plain, % 5.79/1.24 sub(X0,name_1_1)). % 5.79/1.24 cnf(a9, assumption, % 5.79/1.24 X6 = X0). % 5.79/1.24 cnf(a10, assumption, % 5.79/1.24 X7 = name_1_1). % 5.79/1.24 cnf(c18, plain, % 5.79/1.24 ~member(X7,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X5,X6), % 5.79/1.24 inference(predicate_reduction, [assumptions([a9, a10])], [c16, c17])). % 5.79/1.24 % 5.79/1.24 cnf(c19, axiom, % 5.79/1.24 member(X8,cons(X9,X10)) | ~member(X8,X10)). % 5.79/1.24 cnf(a11, assumption, % 5.79/1.24 X7 = X8). % 5.79/1.24 cnf(a12, assumption, % 5.79/1.24 cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))) = cons(X9,X10)). % 5.79/1.24 cnf(c20, plain, % 5.79/1.24 ~attr(X5,X6), % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c19])). % 5.79/1.24 cnf(c21, plain, % 5.79/1.24 ~member(X8,X10), % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c19])). % 5.79/1.24 % 5.79/1.24 cnf(c22, axiom, % 5.79/1.24 member(X11,cons(X12,X13)) | ~member(X11,X13)). % 5.79/1.24 cnf(a13, assumption, % 5.79/1.24 X8 = X11). % 5.79/1.24 cnf(a14, assumption, % 5.79/1.24 X10 = cons(X12,X13)). % 5.79/1.24 cnf(c23, plain, % 5.79/1.24 $false, % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a13, a14])], [c21, c22])). % 5.79/1.24 cnf(c24, plain, % 5.79/1.24 ~member(X11,X13), % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a13, a14])], [c21, c22])). % 5.79/1.24 % 5.79/1.24 cnf(c25, axiom, % 5.79/1.24 member(X14,cons(X14,X15))). % 5.79/1.24 cnf(a15, assumption, % 5.79/1.24 X11 = X14). % 5.79/1.24 cnf(a16, assumption, % 5.79/1.24 X13 = cons(X14,X15)). % 5.79/1.24 cnf(c26, plain, % 5.79/1.24 $false, % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a15, a16])], [c24, c25])). % 5.79/1.24 cnf(c27, plain, % 5.79/1.24 $false, % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a15, a16])], [c24, c25])). % 5.79/1.24 % 5.79/1.24 cnf(c28, axiom, % 5.79/1.24 attr(c620,c621)). % 5.79/1.24 cnf(a17, assumption, % 5.79/1.24 X5 = c620). % 5.79/1.24 cnf(a18, assumption, % 5.79/1.24 X6 = c621). % 5.79/1.24 cnf(c29, plain, % 5.79/1.24 $false, % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a17, a18])], [c20, c28])). % 5.79/1.24 cnf(c30, plain, % 5.79/1.24 $false, % 5.79/1.24 inference(strict_predicate_extension, [assumptions([a17, a18])], [c20, c28])). % 5.79/1.24 % 5.79/1.24 cnf(c31, plain, % 5.79/1.24 attr(X5,X6)). % 5.79/1.24 cnf(a19, assumption, % 5.79/1.24 X1 = X5). % 5.79/1.24 cnf(a20, assumption, % 5.79/1.24 X0 = X6). % 5.79/1.24 cnf(c32, plain, % 5.79/1.24 $false, % 5.79/1.24 inference(predicate_reduction, [assumptions([a19, a20])], [c12, c31])). % 5.79/1.24 % 5.79/1.24 cnf(c33, plain, % 5.79/1.24 $false, % 5.79/1.24 inference(constraint_solving, [ % 5.79/1.24 bind(X0, c621), % 5.79/1.24 bind(X1, c620), % 5.79/1.24 bind(X2, sK100(X4)), % 5.79/1.24 bind(X3, c620), % 5.79/1.24 bind(X4, c620), % 5.79/1.24 bind(X5, c620), % 5.79/1.24 bind(X6, c621), % 5.79/1.24 bind(X7, name_1_1), % 5.79/1.24 bind(X8, name_1_1), % 5.79/1.24 bind(X9, eigenname_1_1), % 5.79/1.24 bind(X10, cons(familiename_1_1,cons(name_1_1,nil))), % 5.79/1.24 bind(X11, name_1_1), % 5.79/1.24 bind(X12, familiename_1_1), % 5.79/1.24 bind(X13, cons(name_1_1,nil)), % 5.79/1.24 bind(X14, name_1_1), % 5.79/1.24 bind(X15, nil) % 5.79/1.24 ], % 5.79/1.24 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])). % 5.79/1.24 % 5.79/1.24 % SZS output end IncompleteProof %------------------------------------------------------------------------------